Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
Object Tracking with Target and Background Samples Chunsheng HUA Haiyuan WU Qian CHEN Toshikazu WADA Publication IEICE TRANSACTIONS on Information and Systems Vol.E90-D No.4 pp.766-774 Publication Date: 2007/04/01 Online ISSN: 1745-1361 DOI: 10.1093/ietisy/e90-d.4.766 Print ISSN: 0916-8532 Type of Manuscript: PAPER Category: Image Recognition, Computer Vision Keyword: object tracking, K-means clustering, tracking failure detection and recovery, background interfusion, Full Text: PDF(1.6MB)>>
Summary: In this paper, we present a general object tracking method based on a newly proposed pixel-wise clustering algorithm. To track an object in a cluttered environment is a challenging issue because a target object may be in concave shape or have apertures (e.g. a hand or a comb). In those cases, it is difficult to separate the target from the background completely by simply modifying the shape of the search area. Our algorithm solves the problem by 1) describing the target object by a set of pixels; 2) using a K-means based algorithm to detect all target pixels. To realize stable and reliable detection of target pixels, we firstly use a 5D feature vector to describe both the color ("Y, U, V") and the position ("x, y") of each pixel uniformly. This enables the simultaneous adaptation to both the color and geometric features during tracking. Secondly, we use a variable ellipse model to describe the shape of the search area and to model the surrounding background. This guarantees the stable object tracking under various geometric transformations. The robust tracking is realized by classifying the pixels within the search area into "target" and "background" groups with a K-means clustering based algorithm that uses the "positive" and "negative" samples. We also propose a method that can detect the tracking failure and recover from it during tracking by making use of both the "positive" and "negative" samples. This feature makes our method become a more reliable tracking algorithm because it can discover the target once again when the target has become lost. Through the extensive experiments under various environments and conditions, the effectiveness and efficiency of the proposed algorithm is confirmed. | ||||||||||
| ||||||||||