Feature Extraction on Binary Patterns
- 1 January 1969
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems Science and Cybernetics
- Vol. 5 (4) , 273-278
- https://doi.org/10.1109/tssc.1969.300219
Abstract
The objects and methods of automatic feature extraction on binary patterns are briefly reviewed. An intuitive interpretation for geometric features is suggested whereby such a feature is conceived of as a cluster of component vectors in pattern space. A modified version of the Isodata or K-means clustering algorithm is applied to a set of patterns originally proposed by Block, Nilsson, and Duda, and to another artificial alphabet. Results are given in terms of a figure-of-merit which measures the deviation between the original patterns and the patterns reconstructed from the automatically derived feature set.Keywords
This publication has 1 reference indexed in Scilit:
- A note on multiplying Boolean matricesCommunications of the ACM, 1962