Connectivity in Digital Pictures
Journal of the ACM (JACM)
Perceptrons: An Introduction to Computational Geometry
Perceptrons: An Introduction to Computational Geometry
ACM Computing Surveys (CSUR)
Algorithms for Image Component Labeling on SIMD Mesh-Connected Computers
IEEE Transactions on Computers
Fast Image Labeling Using Local Operators on Mesh-Connected Computers
IEEE Transactions on Pattern Analysis and Machine Intelligence
Parallel Architectures and Algorithms for Image Component Labeling
IEEE Transactions on Pattern Analysis and Machine Intelligence
Finding connected components on a scan line array processor
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Two Image-Template Operations for Binary Image Processing
Journal of Mathematical Imaging and Vision
Interactive volume segmentation with the PAVLOV architecture
PVGS '99 Proceedings of the 1999 IEEE symposium on Parallel visualization and graphics
A language for bitmap manipulation
ACM Transactions on Graphics (TOG)
Parallel algorithms for the orthogonal multiprocessor
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Loop re-ordering and pre-fetching at run-time
SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
A duality theorem for two connectivity-preserving parallel shrinking transformations
Future Generation Computer Systems - Cellular automata CA 2000 and ACRI 2000
Fast parallel processing array algorithms for some graph problems(Preliminary Version)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A Quality Factor for Measuring Program Efficiency
IEEE Transactions on Computers
Mesh-Connected Computers with Broadcasting
IEEE Transactions on Computers
An Analysis of Computational Cost in Image Processing: A Case Study
IEEE Transactions on Computers
| Hi-index | 48.23 |
A parallel processing algorithm for shrinking binary patterns to obtain single isolated elements, one for each pattern, is presented. This procedure may be used for counting patterns on a matrix, and a hardware implementation of the algorithm using large scale integrated tecnology is envisioned. The principal features of this method are the very small window employed (two-by-two elements), the parallel nature of the process, and the possibility of shrinking any pattern, regardless of the complexity of its configuration. Problems regarding merging and disconnection of patterns during the process as well as the determination of the maximum number of steps necessary to obtain a single isolated element from a pattern, are reviewed and discussed. An analogy with a neural network description, in terms of McCulloch-pitts “neurons” is presented.