{"title":"Deformable and Occluded Object Tracking via Graph Learning","authors":"Wei Han, G. Huang, Dongshun Cui","doi":"10.1109/DICTA.2017.8227424","DOIUrl":null,"url":null,"abstract":"Object deformation and occlusion are ubiquitous problems for visual tracking. Though many efforts have been made to handle object deformation and occlusion, most existing tracking algorithms fail in case of large deformation and severe occlusion. In this paper, we propose a graph learning-based tracking framework to handle both challenges. For each consecutive frame pair, we construct a weighted graph, in which the nodes are the local parts of both frames. Our algorithm optimizes the graph similarity matrix until two disconnected subgraphs separate the foreground and background nodes. We assign foreground/background labels to the current frame nodes based on the learned graph and estimate the object bounding box under an optimization framework with the predicted foreground parts. Experimental results on the Deform-SOT dataset shows that the proposed method achieves the state-of-the-art performance.","PeriodicalId":194175,"journal":{"name":"2017 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DICTA.2017.8227424","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Object deformation and occlusion are ubiquitous problems for visual tracking. Though many efforts have been made to handle object deformation and occlusion, most existing tracking algorithms fail in case of large deformation and severe occlusion. In this paper, we propose a graph learning-based tracking framework to handle both challenges. For each consecutive frame pair, we construct a weighted graph, in which the nodes are the local parts of both frames. Our algorithm optimizes the graph similarity matrix until two disconnected subgraphs separate the foreground and background nodes. We assign foreground/background labels to the current frame nodes based on the learned graph and estimate the object bounding box under an optimization framework with the predicted foreground parts. Experimental results on the Deform-SOT dataset shows that the proposed method achieves the state-of-the-art performance.