Sparse approximation of overdetermined systems for image retrieval application

DOI10.1007/978-81-322-2485-3_17MaRDI QIDQ2801911zbMATH OpenOpenAlexFDO

Authors M. B. Srinivas, R. Ramu Naidu

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 retrievalK-SVDLASSOoverdetermined systemsunderdetermined system

Mathematics Subject Classification ID

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

Recommendations

• Advances and perspective on compressed sensing and applications on image processing
• Sparse representation and reconstruction of image based on compressed sensing
• Compressed sensing
• Compressive sensing
• Theory and applications of compressed sensing

Cites work

• rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• A simple proof of the restricted isometry property for random matrices
• Dictionary Learning Algorithms for Sparse Representation
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• In-Plane Rotation and Scale Invariant Clustering Using Dictionaries
• Sparse and redundant representations. From theory to applications in signal and image processing.

This page was built for publication: Sparse approximation of overdetermined systems for image retrieval application

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2801911)