DocumentCode :
2919165
Title :
Variable grouping for energy minimization
Author :
Kim, Taesup ; Nowozin, Sebastian ; Kohli, Pushmeet ; Yoo, Chang D.
Author_Institution :
Dept. of Electr. Eng., KAIST, Daejeon, South Korea
fYear :
2011
fDate :
20-25 June 2011
Firstpage :
1913
Lastpage :
1920
Abstract :
This paper addresses the problem of efficiently solving large-scale energy minimization problems encountered in computer vision. We propose an energy-aware method for merging random variables to reduce the size of the energy to be minimized. The method examines the energy function to find groups of variables which are likely to take the same label in the minimum energy state and thus can be represented by a single random variable. We propose and evaluate a number of extremely efficient variable grouping strategies. Experimental results show that our methods result in a dramatic reduction in the computational cost and memory requirements (in some cases by a factor of one hundred) with almost no drop in the accuracy of the final result. Comparative evaluation with efficient super-pixel generation methods, which are commonly used in variable grouping, reveals that our methods are far superior both in terms of accuracy and running time.
Keywords :
computer vision; group theory; image segmentation; minimisation; computational cost; computer vision; dramatic reduction; energy function; energy state; energy-aware method; large-scale energy minimization problem; memory requirement; random variable grouping; super-pixel generation method; Accuracy; Approximation methods; Image segmentation; Labeling; Merging; Minimization; Runtime;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on
Conference_Location :
Providence, RI
ISSN :
1063-6919
Print_ISBN :
978-1-4577-0394-2
Type :
conf
DOI :
10.1109/CVPR.2011.5995645
Filename :
5995645
Link To Document :
بازگشت