CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 1985 vol.7 Issue No.01 - January
Issue No.01 - January (1985 vol.7)
Its'Hak Dinstein , Department of Electrical and Computer Engineering, Ben-Gurion University, Beersheva, Israel; IBM Research Laboratory, San Jose, CA 95193.
David W. L. Yen , IBM Research Laboratory, San Jose, CA 95193.
Myron D. Flickner , IBM Research Laboratory, San Jose, CA 95193.
The storage requirements for component labeling and feature extraction operations are unknown a priori. Whenever large images are processed, many labels, and thus a large amount of storage, may be required, making hardware implementation difficult. The proposed labeling procedure eliminates memory overflow by enabling the reuse of memory locations in which features of nonactive labels had been stored. The storage requirement for the worst case conditions is analyzed and is shown to be realizable. The basic procedure can be implemented in two modes, an interrupted mode or a parallel mode. A hardware design is presented.
Its'Hak Dinstein, David W. L. Yen, Myron D. Flickner, "Handling Memory Overflow in Connected Component Labeling Applications", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.7, no. 1, pp. 116-121, January 1985, doi:10.1109/TPAMI.1985.4767627