Sparse Approximation of Overdetermined Systems for Image Retrieval Application

DOI10.1007/978-81-322-2485-3_17zbMath1381.94024OpenAlexW2317366009MaRDI QIDQ2801911

No author found.

Publication date: 22 April 2016

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-81-322-2485-3_17

zbMATH Keywords

image retrievalLASSOunderdetermined systemoverdetermined systemsK-SVD

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Methods of successive quadratic programming type (90C55)

Cites Work

• Unnamed Item
• A simple proof of the restricted isometry property for random matrices
• Sparse and Redundant Representations
• Dictionary Learning Algorithms for Sparse Representation
• $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• In-Plane Rotation and Scale Invariant Clustering Using Dictionaries

This page was built for publication: Sparse Approximation of Overdetermined Systems for Image Retrieval Application