Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition

Details Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition

2010-10-18

arxiv.org/abs/1010.3467v1

Computer Science

Computer Vision and Pattern Recognition

Scientific paper

Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of these bases. The applicability of these methods to visual object recognition tasks has been limited because of the prohibitive cost of the optimization algorithms required to compute the sparse representation. In this work we propose a simple and efficient algorithm to learn basis functions. After training, this model also provides a fast and smooth approximator to the optimal representation, achieving even better accuracy than exact sparse coding algorithms on visual object recognition tasks.

Affiliated with

Also associated with

No associations

Rating

Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition 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 Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-305118