By Topic

Occlusion Handling for Object Tracking Using a Fast Level Set Method

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

5 Author(s)
Gambini, J. ; Dept. de Comput., UBA, Buenos Aires ; Rozichner, D. ; Buemi, M.E. ; Mejail, M.
more authors

Tracking objects in image sequences is a difficult problem because of the frequent occlusions encountered among the objects and people. In this paper, a method for tracking objects through occlusions based on a level set technique, is presented. Two ca.ses are considered: 1-the object is obstructed by another one of a different color. 2-the object is obstructed by another one of the same color.In the first case, the classical algorithms based on active contours fail to track the object's contour because the curve disappears from the scene. In this proposal, occlusion is detected and the solution is based on keeping the curve in the same place until the object of interest appears in the scene again.In the second case, the classic algorithms based on active contours do not distinguish between two image objects of the same color, so due to the possible changes in the topology, the curve fits the edge of both objects and it is divided. We solve this problem by means of localizing the centroid of the curve.The experimental results show that these methods significantly improve the tracking with occlusions.

Published in:

Computer Graphics and Image Processing, 2008. SIBGRAPI '08. XXI Brazilian Symposium on

Date of Conference:

12-15 Oct. 2008