A fast algorithm to calculate the Euler number for binary images
Pattern Recognition Letters
Connectivity in Digital Pictures
Journal of the ACM (JACM)
In-place sorting with fewer moves
Information Processing Letters
Asymptotically efficient in-place merging
Theoretical Computer Science
In-place algorithms for sorting problems
ACM SIGACT News
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
In-Place Planar Convex Hull Algorithms
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital Geometry: Geometric Methods for Digital Picture Analysis
Border and Surface Tracing - Theoretical Foundations
IEEE Transactions on Pattern Analysis and Machine Intelligence
In-place algorithm for image rotation
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
In-Place algorithms for computing (layers of) maxima
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Curves, hypersurfaces, and good pairs of adjacency relations
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Counting gaps in binary pictures
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
| Hi-index | 0.00 |
In recent years the design of space-efficient algorithms that work within a limited amount of memory is becoming a hot topic of research. This is particularly crucial for intelligent peripherals used in image analysis and processing, such as digital cameras, scanners, or printers, that are equipped with considerably lower memory than the usual computers. In the present paper we propose a constant-working space algorithm for determining the genus of a binary digital object. More precisely, given an m ×n binary array representing the image, we show how one can count the number of holes of the array with an optimal number of O (mn ) integer arithmetic operations and optimal O (1) working space. Our consideration covers the two basic possibilities for object and hole types determined by the adjacency relation adopted for the object and for the background. The algorithm is particularly based on certain combinatorial relation between some characteristics of a digital picture.