Name
Abstract | ||
|---|---|---|
Matching-based algorithms have been commonly used in planar object tracking. They often model a planar object as a set of keypoints, and then find correspondences between keypoint sets via descriptor matching. In previous work, unary constraints on appearances or locations are usually used to guide the matching. However, these approaches rarely utilize structure information of the object, and are ... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TPAMI.2017.2716350 | IEEE Transactions on Pattern Analysis and Machine Intelligence |
Keywords | Field | DocType |
Robustness,Object tracking,Target tracking,Visualization,Algorithm design and analysis,Benchmark testing | BitTorrent tracker,Computer vision,Spatial network,Pattern recognition,Computer science,Robustness (computer science),Pose,Matching (graph theory),Eye tracking,Video tracking,Artificial intelligence,Benchmark (computing) | Journal |
Volume | Issue | ISSN |
40 | 6 | 0162-8828 |
Citations | PageRank | References |
10 | 0.43 | 28 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tao Wang | 1 | 337 | 115.68 |
| Haibin Ling | 2 | 4531 | 215.76 |