Learning dictionaries with graph embedding constraints

Karthikeyan Natesan Ramamurthy, Jayaraman J. Thiagarajan, Prasanna Sattigeri, Andreas Spanias

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

11 Citations (Scopus)

Abstract

Several supervised, semi-supervised, and unsupervised machine learning schemes can be unified under the general framework of graph embedding. Incorporating graph embedding principles into sparse representation based learning schemes can provide an improved performance in several learning tasks. In this work, we propose a dictionary learning procedure for computing discriminative sparse codes that obey graph embedding constraints. In order to compute the graph-embedded sparse codes, we integrate a modified version of the sequential quadratic programming procedure with the feature sign search method. We demonstrate, using simulations with the AR face database, that the proposed approach performs better than several baseline methods in supervised and semi-supervised classification.

Original languageEnglish (US)
Title of host publicationConference Record - Asilomar Conference on Signals, Systems and Computers
Pages1974-1978
Number of pages5
DOIs
StatePublished - 2012
Event46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012 - Pacific Grove, CA, United States
Duration: Nov 4 2012Nov 7 2012

Other

Other46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012
CountryUnited States
CityPacific Grove, CA
Period11/4/1211/7/12

Fingerprint

Quadratic programming
Glossaries
Learning systems

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing

Cite this

Ramamurthy, K. N., Thiagarajan, J. J., Sattigeri, P., & Spanias, A. (2012). Learning dictionaries with graph embedding constraints. In Conference Record - Asilomar Conference on Signals, Systems and Computers (pp. 1974-1978). [6489385] https://doi.org/10.1109/ACSSC.2012.6489385

Learning dictionaries with graph embedding constraints. / Ramamurthy, Karthikeyan Natesan; Thiagarajan, Jayaraman J.; Sattigeri, Prasanna; Spanias, Andreas.

Conference Record - Asilomar Conference on Signals, Systems and Computers. 2012. p. 1974-1978 6489385.

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

Ramamurthy, KN, Thiagarajan, JJ, Sattigeri, P & Spanias, A 2012, Learning dictionaries with graph embedding constraints. in Conference Record - Asilomar Conference on Signals, Systems and Computers., 6489385, pp. 1974-1978, 46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012, Pacific Grove, CA, United States, 11/4/12. https://doi.org/10.1109/ACSSC.2012.6489385
Ramamurthy KN, Thiagarajan JJ, Sattigeri P, Spanias A. Learning dictionaries with graph embedding constraints. In Conference Record - Asilomar Conference on Signals, Systems and Computers. 2012. p. 1974-1978. 6489385 https://doi.org/10.1109/ACSSC.2012.6489385
Ramamurthy, Karthikeyan Natesan ; Thiagarajan, Jayaraman J. ; Sattigeri, Prasanna ; Spanias, Andreas. / Learning dictionaries with graph embedding constraints. Conference Record - Asilomar Conference on Signals, Systems and Computers. 2012. pp. 1974-1978
@inproceedings{98336c32f7594d34a9741eabeca70b39,
title = "Learning dictionaries with graph embedding constraints",
abstract = "Several supervised, semi-supervised, and unsupervised machine learning schemes can be unified under the general framework of graph embedding. Incorporating graph embedding principles into sparse representation based learning schemes can provide an improved performance in several learning tasks. In this work, we propose a dictionary learning procedure for computing discriminative sparse codes that obey graph embedding constraints. In order to compute the graph-embedded sparse codes, we integrate a modified version of the sequential quadratic programming procedure with the feature sign search method. We demonstrate, using simulations with the AR face database, that the proposed approach performs better than several baseline methods in supervised and semi-supervised classification.",
author = "Ramamurthy, {Karthikeyan Natesan} and Thiagarajan, {Jayaraman J.} and Prasanna Sattigeri and Andreas Spanias",
year = "2012",
doi = "10.1109/ACSSC.2012.6489385",
language = "English (US)",
isbn = "9781467350518",
pages = "1974--1978",
booktitle = "Conference Record - Asilomar Conference on Signals, Systems and Computers",

}

TY - GEN

T1 - Learning dictionaries with graph embedding constraints

AU - Ramamurthy, Karthikeyan Natesan

AU - Thiagarajan, Jayaraman J.

AU - Sattigeri, Prasanna

AU - Spanias, Andreas

PY - 2012

Y1 - 2012

N2 - Several supervised, semi-supervised, and unsupervised machine learning schemes can be unified under the general framework of graph embedding. Incorporating graph embedding principles into sparse representation based learning schemes can provide an improved performance in several learning tasks. In this work, we propose a dictionary learning procedure for computing discriminative sparse codes that obey graph embedding constraints. In order to compute the graph-embedded sparse codes, we integrate a modified version of the sequential quadratic programming procedure with the feature sign search method. We demonstrate, using simulations with the AR face database, that the proposed approach performs better than several baseline methods in supervised and semi-supervised classification.

AB - Several supervised, semi-supervised, and unsupervised machine learning schemes can be unified under the general framework of graph embedding. Incorporating graph embedding principles into sparse representation based learning schemes can provide an improved performance in several learning tasks. In this work, we propose a dictionary learning procedure for computing discriminative sparse codes that obey graph embedding constraints. In order to compute the graph-embedded sparse codes, we integrate a modified version of the sequential quadratic programming procedure with the feature sign search method. We demonstrate, using simulations with the AR face database, that the proposed approach performs better than several baseline methods in supervised and semi-supervised classification.

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

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

U2 - 10.1109/ACSSC.2012.6489385

DO - 10.1109/ACSSC.2012.6489385

M3 - Conference contribution

AN - SCOPUS:84876262585

SN - 9781467350518

SP - 1974

EP - 1978

BT - Conference Record - Asilomar Conference on Signals, Systems and Computers

ER -