{"title":"一种基于判别特征的目标跟踪均值偏移算法","authors":"C. Xue, Ming Zhu, Aihua Chen","doi":"10.1109/KAMW.2008.4810464","DOIUrl":null,"url":null,"abstract":"The mean-shift algorithm has been proved to be efficient for object tracking. Traditional mean-shift algorithm uses global color histogram features, regardless the features belong to the object or to the background, which will cause localization drift. In this paper, we propose a new algorithm which can overcome this disadvantage. Our hypothesis is that the features that best discriminate between object and background are also the best for tracking, and our tracking is based on these discriminative features. Features are chosen by separating the object from the background, using a voting strategy. Experimental results show that the proposed algorithm in this paper is more robust than the traditional mean-shift algorithm.","PeriodicalId":375613,"journal":{"name":"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop","volume":"12 35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"A Discriminative Feature-Based Mean-shift Algorithm for Object Tracking\",\"authors\":\"C. Xue, Ming Zhu, Aihua Chen\",\"doi\":\"10.1109/KAMW.2008.4810464\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The mean-shift algorithm has been proved to be efficient for object tracking. Traditional mean-shift algorithm uses global color histogram features, regardless the features belong to the object or to the background, which will cause localization drift. In this paper, we propose a new algorithm which can overcome this disadvantage. Our hypothesis is that the features that best discriminate between object and background are also the best for tracking, and our tracking is based on these discriminative features. Features are chosen by separating the object from the background, using a voting strategy. Experimental results show that the proposed algorithm in this paper is more robust than the traditional mean-shift algorithm.\",\"PeriodicalId\":375613,\"journal\":{\"name\":\"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop\",\"volume\":\"12 35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/KAMW.2008.4810464\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KAMW.2008.4810464","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Discriminative Feature-Based Mean-shift Algorithm for Object Tracking
The mean-shift algorithm has been proved to be efficient for object tracking. Traditional mean-shift algorithm uses global color histogram features, regardless the features belong to the object or to the background, which will cause localization drift. In this paper, we propose a new algorithm which can overcome this disadvantage. Our hypothesis is that the features that best discriminate between object and background are also the best for tracking, and our tracking is based on these discriminative features. Features are chosen by separating the object from the background, using a voting strategy. Experimental results show that the proposed algorithm in this paper is more robust than the traditional mean-shift algorithm.