Scene segmentation by cluster detection in color spaces
- 1 June 1976
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGART Bulletin
- Vol. 58 (58), 16-17
- https://doi.org/10.1145/1045264.1045267
Abstract
Ohlander [1] has shown that a variety of scenes can be segmented into meaningful parts by histogramming the values of various point or local properties of the scene; extracting the region whose points gave rise to that peak; and repeating the process for the remainder of the scene. A generalization of this histogram analysis approach is to map the points of the scene into a multi-dimensional feature space, and to look for clusters in this space (a histogram is a mapping into a one-dimensional feature space, in which clusters are peaks). This note illustrates how one of Ohlander's scenes, a house, can be reasonably segmented by mapping it into a three-dimensional color space.Keywords
This publication has 1 reference indexed in Scilit:
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975