Approximate search with quantized sparse representations

This paper tackles the task of storing a large collection of vectors, such as visual descriptors, and of searching in it. To this end, we propose to approximate database vectors by constrained sparse coding, where possible atom weights are restricted to belong to a finite subset... (read more)

Results in Papers With Code
(↓ scroll down to see all results)