By Topic

On the number of digital convex polygons inscribed into an (m,m)-grid

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ivic, A. ; Serbian Acad. of Sci., Beograd, Serbia ; Koplowitz, Jack ; Zunic, J.

Binary images of objects are digitized by coloring a pixel cell black if more than half of its area is within the interior of the object. For simplicity, the digitization is often modified by looking only at the center point of a cell to determine its pixel value. The digitized boundary curve consists of a sequence of 4-directional links, sometimes called a "crack" code since it follows the cracks or edges of the pixel cells. Of interest here is the entropy of digitized binary objects or planar curves on an m×m integer grid. Let D(m) denote the number of digital convex polygons which can be inscribed into an integer grid of size m×m. The asymptotic estimation of log D(m) is of interest in determining the entropy of digitized convex shapes. It is shown that log D(m) is of the order m2/3

Published in:

Information Theory, IEEE Transactions on  (Volume:40 ,  Issue: 5 )