ZERO Lab
Home
News
People
Publications
Contact
Over-complete dictionary
Bases sorting: Generalizing the concept of frequency for over-complete dictionaries
We propose an algorithm, called Bases Sorting, to sort the bases of over-complete dictionaries used in sparse representation according to the magnitudes of coefficients when representing the training samples.
Cite
×