Abstract
We have examined the clustering results obtained via our previously published N-dimensional histogram segmentation algorithm. In particular, we have derived a method to recombine areas that have been oversegmented in the initial segmentation process. While the algorithm does reduce the number of clusters, different initial clustering inputs do lead to different clustering results. Methods to compare the different final segmentations will be discussed.
Original language | English |
---|---|
Pages | 309-312 |
Number of pages | 4 |
State | Published - 1 Dec 2004 |
Event | 2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings - Tel-Aviv, Israel Duration: 6 Sep 2004 → 7 Sep 2004 |
Conference
Conference | 2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings |
---|---|
Country/Territory | Israel |
City | Tel-Aviv |
Period | 6/09/04 → 7/09/04 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Electronic, Optical and Magnetic Materials