Multiple pattern classification by sparse subspace decomposition

Details Multiple pattern classification by sparse subspace decomposition Multiple pattern classification by sparse subspace decomposition

2009-07-30

arxiv.org/abs/0907.5321v2

Computer Science

Computer Vision and Pattern Recognition

8 pages, 3 figures, 2nd IEEE International Workshop on Subspace Methods, Workshop Proceedings of ICCV 2009

Scientific paper

A robust classification method is developed on the basis of sparse subspace decomposition. This method tries to decompose a mixture of subspaces of unlabeled data (queries) into class subspaces as few as possible. Each query is classified into the class whose subspace significantly contributes to the decomposed subspace. Multiple queries from different classes can be simultaneously classified into their respective classes. A practical greedy algorithm of the sparse subspace decomposition is designed for the classification. The present method achieves high recognition rate and robust performance exploiting joint sparsity.

Affiliated with

Also associated with

No associations

Rating

Multiple pattern classification by sparse subspace decomposition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multiple pattern classification by sparse subspace decomposition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiple pattern classification by sparse subspace decomposition will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-468923