Parameterizing Region Covariance: An Efficient Way To Apply Sparse Codes On Second Order Statistics
Xiyang Dai, Sameh Khamis, Yangmuzi Zhang, Larry S. Davis

TL;DR
This paper introduces a novel Euclidean space representation for region covariance matrices, enabling efficient sparse modeling that achieves competitive results in vision tasks.
Contribution
It proposes a method to transform structured sparse model learning on region covariance into a vectorized form, simplifying computation.
Findings
Achieves competitive performance on vision tasks
Enables efficient sparse modeling of region covariance matrices
Simplifies complex computations in structured data analysis
Abstract
Sparse representations have been successfully applied to signal processing, computer vision and machine learning. Currently there is a trend to learn sparse models directly on structure data, such as region covariance. However, such methods when combined with region covariance often require complex computation. We present an approach to transform a structured sparse model learning problem to a traditional vectorized sparse modeling problem by constructing a Euclidean space representation for region covariance matrices. Our new representation has multiple advantages. Experiments on several vision tasks demonstrate competitive performance with the state-of-the-art methods.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Face and Expression Recognition · Blind Source Separation Techniques
