Sparse vs. Non-sparse: Which One Is Better for Practical Visual Tracking?
Recently, sparse representation based visual tracking methods have attracted increasing attention in the computer vision community. Although achieve superior performance to traditional tracking methods, however, a basic problem has not been answered yet --- that whether the sparsity constrain is really needed for visual tracking? To answer this question, in this paper, we first propose a robust non-sparse representation based tracker and then conduct extensive experiments to compare it against several state-of-the-art sparse representation based trackers. Our experiment results and analysis indicate that the proposed non-sparse tracker achieved competitive tracking accuracy with sparse trackers while having faster running speed, which support our non-sparse tracker to be used in practical applications.
Code (0)
등록된 구현이 없습니다.
Tasks
Visual TrackingSimilar Papers 제목 키워드 기반
SparseFormer: Sparse Visual Recognition via Limited Latent Tokens
Human visual recognition is a sparse process, where only a few salient visual cues are attended to rather than traversing every detail uniformly. However, most current vision networks follow a dense paradigm, processing …
Image ClassificationSparse Representation-based ClassificationVideo ClassificationSparse and Structured Visual Attention
Visual attention mechanisms are widely used in multimodal tasks, as visual question answering (VQA). One drawback of softmax-based attention mechanisms is that they assign some probability mass to all image regions, rega…
Image CaptioningQuestion AnsweringVisual Question AnsweringVisual Question Answering (VQA)Extending Deep Event Visual Odometry with Sparse Point-Cloud Export
Event cameras are well suited for visual odometry under high-speed motion and challenging lighting conditions due to their low latency, high temporal resolution, and high dynamic range. Deep Event Visual Odometry (DEVO) …
Visual OdometryMinimizing FLOPs to Learn Efficient Sparse Representations
Deep representation learning has become one of the most widely adopted approaches for visual search, recommendation, and identification. Retrieval of such representations from a large database is however computationally …
QuantizationRepresentation LearningRetrievalReFACTor: Practical Low-Rank Matrix Estimation Under Column-Sparsity
Various problems in data analysis and statistical genetics call for recovery of a column-sparse, low-rank matrix from noisy observations. We propose ReFACTor, a simple variation of the classical Truncated Singular Value …