You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither SPIE nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the SPIE website.
10 January 2014Image segmentation using random features
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.
The alert did not successfully save. Please try again later.
Geoff Bull, Junbin Gao, Michael Antolovich, "Image segmentation using random features," Proc. SPIE 9069, Fifth International Conference on Graphic and Image Processing (ICGIP 2013), 90691Z (10 January 2014); https://doi.org/10.1117/12.2050885