Abstract
This paper presents a novel algorithm for selecting random features via compressed sensing to improve the performance of Normalized Cuts in image segmentation. Normalized Cuts is a clustering algorithm that has been widely applied to segmenting images, using features such as brightness, intervening contours and Gabor filter responses. Some drawbacks of Normalized Cuts are that computation times and memory usage can be excessive, and the obtained segmentations are often poor. This paper addresses the need to improve the processing time of Normalized Cuts while improving the segmentations. A significant proportion of the time in calculating Normalized Cuts is spent computing an affinity matrix. A new algorithm has been developed that selects random features using compressed sensing techniques to reduce the computation needed for the affinity matrix. The new algorithm, when compared to the standard implementation of Normalized Cuts for segmenting images from the BSDS500, produces better segmentations in significantly less time.
Original language | English |
---|---|
Title of host publication | ICGIP 2013 |
Subtitle of host publication | 5th Proceedings |
Place of Publication | United States |
Publisher | SPIE |
Pages | 1-8 |
Number of pages | 8 |
Volume | 9069 |
ISBN (Electronic) | 9781628410013 |
DOIs | |
Publication status | Published - 2013 |
Event | International Conference on Graphic and Image Processing (ICGIP) - Hong Kong, Hong Kong Duration: 26 Oct 2013 → 27 Oct 2013 http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=30157©ownerid=52887 |
Conference
Conference | International Conference on Graphic and Image Processing (ICGIP) |
---|---|
Country/Territory | Hong Kong |
Period | 26/10/13 → 27/10/13 |
Internet address |