Back to results

University of Illinois at Urbana-Champaign

Learning sparse features and metric in signal and image processing

Abstract

dc:description

This dissertation studies two aspects of feature learning: representation learning and metric in feature space, from a machine learning perspective. Feature learning is a fundamental problem in computer vision and machine learning. First introduced in computational neuroscience in the context of sparse coding in the visual system, sparse coding plays a key role in feature representation learning, as the over-complete dictionary allows more representation flexibility and efficiency, and captures structures and patterns inherent in the raw data. First, we explore sparse representation and propose a novel sparse matrix factorization method for learning a dictionary in both a reconstructive and discriminative manner. The obtained representations can be directly used for multi-class classification. We also apply sparse representation on a camera trap dataset for wildlife monitoring and demonstrate good performance of sparse features in a challenging real world scenario. Second, from a theoretical perspective, we show that the popular ℓ1-norm based methods break down in the presence of high coherence and large noise. We introduce a novel regularization approach to handle model collinearity and obtain parsimonious variable selection simultaneously. The regularization term is non-convex and can take into account structured sparsity (e.g., group sparsity). We propose an efficient iterative thresholding procedure for solving the optimization. Our method achieves state-of-the-art performance for super-resolution signal spectrum estimation. On the other hand, in order to enhance the discriminative power of learned features, supervised learning is crucial. A proper metric is desired for various problems, such as image retrieval, similarity learning and face verification. We propose a ranking based metric learning algorithm under maximum margin criterion. We propose both batch and online algorithms. The regret bounds are given for online algorithms. Experiments are conducted on 3D human body shape matching problem and state-of-the-art performance is achieved.

Degree

thesis:*
Name thesis:degree_name
Ph.D.
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Electrical & Computer Engr
Grantor
University of Illinois at Urbana-Champaign
Year dc:date
2017

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Wang, Jiangping
Contributors dc:contributor
  • Huang, Thomas
  • Hasegawa-Johnson, Mark
  • Liang, Zhi-Pei
  • Liang, Feng

Subjects

dc:subject × 8

Rights

dc:rights
Statement dc:rights
  • Copyright 2017 Jiangping Wang
Language dc:language
en

Identifiers

dc:identifier.*
Handle dc:identifier
http://hdl.handle.net/2142/98199
OAI identifier oai:identifier
oai:www.ideals.illinois.edu:2142/98199

Chain of custody

source
Harvested from
University of Illinois - Urbana-Champaign
Base URL
www.ideals.illinois.edu/oai-pmh
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
citation

Wang, Jiangping. Learning sparse features and metric in signal and image processing. Dissertation thesis, University of Illinois at Urbana-Champaign, 2017. http://hdl.handle.net/2142/98199