By Topic

Robust Target Localization and Segmentation Using Graph Cut, KPCA and Mean-Shift

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Arif, O. ; Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA ; Vela, P.A.

This paper presents an algorithm for object localization and segmentation. The algorithm uses machine learning, and statistical and combinatorial optimization tools to build a tracker that is robust to noise and occlusions. The method is based on a novel energy formulation and its dual use for object localization and segmentation. The energy uses kernel principal component analysis to incorporate shape and appearance constraints of the target object and the background. The energy arising from the procedure is equivalent to an un-normalized density function, thus providing a probabilistic interpretation to the procedure. Mean-shift optimization finds the most probable location of the target object. Graph-cut maximization on the localized object window in the image generates the globally optimal segmentation.

Published in:

Machine Learning and Applications, 2009. ICMLA '09. International Conference on

Date of Conference:

13-15 Dec. 2009