DocumentCode
659361
Title
Object Cut as Minimum Ratio Cycle in a Superpixel Boundary Graph
Author
Gao Zhu ; Yansheng Ming ; Hongdong Li
Author_Institution
Australian Nat. Univ., Canberra, ACT, Australia
fYear
2013
fDate
26-28 Nov. 2013
Firstpage
1
Lastpage
6
Abstract
A category-specific object cut method is proposed in this paper that utilizes both minimum ratio cycle optimization and superpixel segmentation. This method can find a non-self-intersecting cycle in the image plane which aligns well with the outer boundary of an object instance. Most existing approaches under the minimum ratio cycle optimization framework are used for unsupervised image segmentation. Directly applying their approaches will cause orientation ambiguity which makes the globally minimal solution unachievable. It is demonstrated that a modification on top-down classification information can alleviate this difficulty even it does not hold for traditional linear-energy object cut methods. PASCAL VOC 2007 segmentation dataset is used for experimental evaluation and improved performance is obtained when our method is compared with other competitive object cut algorithms.
Keywords
graph theory; image segmentation; optimisation; PASCAL VOC 2007 segmentation; category-specific object cut method; image plane; linear-energy object cut method; minimum ratio cycle optimization; non-self-intersecting cycle; orientation ambiguity; superpixel boundary graph; superpixel segmentation; top-down classification information; unsupervised image segmentation; Clocks; Image segmentation; Integral equations; Linear programming; Logistics; Optimization; Search problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Digital Image Computing: Techniques and Applications (DICTA), 2013 International Conference on
Conference_Location
Hobart, TAS
Type
conf
DOI
10.1109/DICTA.2013.6691506
Filename
6691506
Link To Document