Shift-invariant sparse representation of images using learned dictionaries

Jayaraman J. Thiagarajan, Karthikeyan N. Ramamurthy, Andreas Spanias

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Citations (Scopus)

Abstract

Sparse approximations that are evaluated using overcomplete learned dictionaries are useful in many image processing applications such as compression, denoising and feature extraction. Incorporating shift invariance into sparse representation of images can improve sparsity while providing a good approximation. The K-SVD algorithm adapts the dictionary based on a set of training examples, without shift invariance constraints. This paper presents two algorithms for training dictionaries and evaluating shift-invariant sparse representations for image data. One is a modified version of the K-SVD algorithm and the other is a novel graph-based algorithm that adapts the dictionary and computes representations using a low complexity reconstruction procedure.

Original languageEnglish (US)
Title of host publicationProceedings of the 2008 IEEE Workshop on Machine Learning for Signal Processing, MLSP 2008
Pages145-150
Number of pages6
DOIs
StatePublished - 2008
Event2008 IEEE Workshop on Machine Learning for Signal Processing, MLSP 2008 - Cancun, Mexico
Duration: Oct 16 2008Oct 19 2008

Other

Other2008 IEEE Workshop on Machine Learning for Signal Processing, MLSP 2008
CountryMexico
CityCancun
Period10/16/0810/19/08

Fingerprint

Glossaries
Singular value decomposition
Invariance
Feature extraction
Image processing

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Electrical and Electronic Engineering

Cite this

Thiagarajan, J. J., Ramamurthy, K. N., & Spanias, A. (2008). Shift-invariant sparse representation of images using learned dictionaries. In Proceedings of the 2008 IEEE Workshop on Machine Learning for Signal Processing, MLSP 2008 (pp. 145-150). [4685470] https://doi.org/10.1109/MLSP.2008.4685470

Shift-invariant sparse representation of images using learned dictionaries. / Thiagarajan, Jayaraman J.; Ramamurthy, Karthikeyan N.; Spanias, Andreas.

Proceedings of the 2008 IEEE Workshop on Machine Learning for Signal Processing, MLSP 2008. 2008. p. 145-150 4685470.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Thiagarajan, JJ, Ramamurthy, KN & Spanias, A 2008, Shift-invariant sparse representation of images using learned dictionaries. in Proceedings of the 2008 IEEE Workshop on Machine Learning for Signal Processing, MLSP 2008., 4685470, pp. 145-150, 2008 IEEE Workshop on Machine Learning for Signal Processing, MLSP 2008, Cancun, Mexico, 10/16/08. https://doi.org/10.1109/MLSP.2008.4685470
Thiagarajan JJ, Ramamurthy KN, Spanias A. Shift-invariant sparse representation of images using learned dictionaries. In Proceedings of the 2008 IEEE Workshop on Machine Learning for Signal Processing, MLSP 2008. 2008. p. 145-150. 4685470 https://doi.org/10.1109/MLSP.2008.4685470
Thiagarajan, Jayaraman J. ; Ramamurthy, Karthikeyan N. ; Spanias, Andreas. / Shift-invariant sparse representation of images using learned dictionaries. Proceedings of the 2008 IEEE Workshop on Machine Learning for Signal Processing, MLSP 2008. 2008. pp. 145-150
@inproceedings{dd79eb1a85ca4794a0c147568a2b19d5,
title = "Shift-invariant sparse representation of images using learned dictionaries",
abstract = "Sparse approximations that are evaluated using overcomplete learned dictionaries are useful in many image processing applications such as compression, denoising and feature extraction. Incorporating shift invariance into sparse representation of images can improve sparsity while providing a good approximation. The K-SVD algorithm adapts the dictionary based on a set of training examples, without shift invariance constraints. This paper presents two algorithms for training dictionaries and evaluating shift-invariant sparse representations for image data. One is a modified version of the K-SVD algorithm and the other is a novel graph-based algorithm that adapts the dictionary and computes representations using a low complexity reconstruction procedure.",
author = "Thiagarajan, {Jayaraman J.} and Ramamurthy, {Karthikeyan N.} and Andreas Spanias",
year = "2008",
doi = "10.1109/MLSP.2008.4685470",
language = "English (US)",
isbn = "9781424423767",
pages = "145--150",
booktitle = "Proceedings of the 2008 IEEE Workshop on Machine Learning for Signal Processing, MLSP 2008",

}

TY - GEN

T1 - Shift-invariant sparse representation of images using learned dictionaries

AU - Thiagarajan, Jayaraman J.

AU - Ramamurthy, Karthikeyan N.

AU - Spanias, Andreas

PY - 2008

Y1 - 2008

N2 - Sparse approximations that are evaluated using overcomplete learned dictionaries are useful in many image processing applications such as compression, denoising and feature extraction. Incorporating shift invariance into sparse representation of images can improve sparsity while providing a good approximation. The K-SVD algorithm adapts the dictionary based on a set of training examples, without shift invariance constraints. This paper presents two algorithms for training dictionaries and evaluating shift-invariant sparse representations for image data. One is a modified version of the K-SVD algorithm and the other is a novel graph-based algorithm that adapts the dictionary and computes representations using a low complexity reconstruction procedure.

AB - Sparse approximations that are evaluated using overcomplete learned dictionaries are useful in many image processing applications such as compression, denoising and feature extraction. Incorporating shift invariance into sparse representation of images can improve sparsity while providing a good approximation. The K-SVD algorithm adapts the dictionary based on a set of training examples, without shift invariance constraints. This paper presents two algorithms for training dictionaries and evaluating shift-invariant sparse representations for image data. One is a modified version of the K-SVD algorithm and the other is a novel graph-based algorithm that adapts the dictionary and computes representations using a low complexity reconstruction procedure.

UR - http://www.scopus.com/inward/record.url?scp=58049184130&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=58049184130&partnerID=8YFLogxK

U2 - 10.1109/MLSP.2008.4685470

DO - 10.1109/MLSP.2008.4685470

M3 - Conference contribution

AN - SCOPUS:58049184130

SN - 9781424423767

SP - 145

EP - 150

BT - Proceedings of the 2008 IEEE Workshop on Machine Learning for Signal Processing, MLSP 2008

ER -