Thanh Le

h-index14
2papers
516citations

2 Papers

2.8CVMar 14, 2023
PlanarTrack: A Large-scale Challenging Benchmark for Planar Object Tracking

Xinran Liu, Xiaoqiong Liu, Ziruo Yi et al.

Planar object tracking is a critical computer vision problem and has drawn increasing interest owing to its key roles in robotics, augmented reality, etc. Despite rapid progress, its further development, especially in the deep learning era, is largely hindered due to the lack of large-scale challenging benchmarks. Addressing this, we introduce PlanarTrack, a large-scale challenging planar tracking benchmark. Specifically, PlanarTrack consists of 1,000 videos with more than 490K images. All these videos are collected in complex unconstrained scenarios from the wild, which makes PlanarTrack, compared with existing benchmarks, more challenging but realistic for real-world applications. To ensure the high-quality annotation, each frame in PlanarTrack is manually labeled using four corners with multiple-round careful inspection and refinement. To our best knowledge, PlanarTrack, to date, is the largest and most challenging dataset dedicated to planar object tracking. In order to analyze the proposed PlanarTrack, we evaluate 10 planar trackers and conduct comprehensive comparisons and in-depth analysis. Our results, not surprisingly, demonstrate that current top-performing planar trackers degenerate significantly on the challenging PlanarTrack and more efforts are needed to improve planar tracking in the future. In addition, we further derive a variant named PlanarTrack$_{\mathbf{BB}}$ for generic object tracking from PlanarTrack. Our evaluation of 10 excellent generic trackers on PlanarTrack$_{\mathrm{BB}}$ manifests that, surprisingly, PlanarTrack$_{\mathrm{BB}}$ is even more challenging than several popular generic tracking benchmarks and more attention should be paid to handle such planar objects, though they are rigid. All benchmarks and evaluations will be released at the project webpage.

2.3MMNov 15, 2018
Motion Style Extraction Based on Sparse Coding Decomposition

Xuan Thanh Nguyen, Thanh Ha Le, Hongchuan Yu

We present a sparse coding-based framework for motion style decomposition and synthesis. Dynamic Time Warping is firstly used to synchronized input motions in the time domain as a pre-processing step. A sparse coding-based decomposition has been proposed, we also introduce the idea of core component and basic motion. Decomposed motions are then combined, transfer to synthesize new motions. Lastly, we develop limb length constraint as a post-processing step to remove distortion skeletons. Our framework has the advantage of less time-consuming, no manual alignment and large dataset requirement. As a result, our experiments show smooth and natural synthesized motion.