Name
Abstract | ||
|---|---|---|
Handling occlusion is a very challenging problem in object detection. This paper presents a method of learning a hierarchical model for X-to-X occlusion-free object detection (e.g., car-to-car and person-to-person occlusions in our experiments). The proposed method is motivated by an intuitive coupling-and-decoupling strategy. In the learning stage, the pair of occluding X׳s (e.g., car pairs or person pairs) is represented directly and jointly by a hierarchical And–Or directed acyclic graph (AOG) which accounts for the statistically significant co-occurrence (i.e., coupling). The structure and the parameters of the AOG are learned using the latent structural SVM (LSSVM) framework. In detection, a dynamic programming (DP) algorithm is utilized to find the best parse trees for all sliding windows with detection scores being greater than the learned threshold. Then, the two single X׳s are decoupled from the declared detections of X-to-X occluding pairs together with some non-maximum suppression (NMS) post-processing. In experiments, our method is tested on both a roadside-car dataset collected by ourselves (which will be released with this paper) and two public person datasets, the MPII-2Person dataset and the TUD-Crossing dataset. Our method is compared with state-of-the-art deformable part-based methods, and obtains comparable or better detection performance. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.patcog.2014.04.016 | Pattern Recognition |
Keywords | Field | DocType |
Occlusion modeling,Object detection,And–Or graph,Deformable part-based model,Latent structural SVM | Coupling,Computer science,Artificial intelligence,Hierarchical database model,Object detection,Dynamic programming,Computer vision,Pattern recognition,Support vector machine,Directed acyclic graph,Parsing,Free object,Machine learning | Journal |
Volume | Issue | ISSN |
47 | 10 | 0031-3203 |
Citations | PageRank | References |
6 | 0.47 | 23 |
Authors | ||
5 | ||