File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Face hallucination via sparse coding

TitleFace hallucination via sparse coding
Authors
KeywordsFace hallucination
Nonnegative matrix factorization
Sparse coding
Sparse representation
Super-resolution
Issue Date2008
Citation
Proceedings - International Conference on Image Processing, ICIP, 2008, p. 1264-1267 How to Cite?
AbstractIn this paper, we address the problem of hallucinating a high resolution face given a low resolution input face. The problem is approached through sparse coding. To exploit the facial structure, Non-negative Matrix Factorization (NMF) [1] is first employed to learn a localized part-based subspace. This subspace is effective for super-resolving the incoming low resolution face under reconstruction constraints. To further enhance the detailed facial information, we propose a local patch method based on sparse representation with respect to coupled overcomplete patch dictionaries, which can be fast solved through linear programming. Experiments demonstrate that our approach can hallucinate high quality super-resolution faces. © 2008 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/326785
ISSN
2020 SCImago Journal Rankings: 0.315

 

DC FieldValueLanguage
dc.contributor.authorYang, Jianchao-
dc.contributor.authorTang, Hao-
dc.contributor.authorMa, Yi-
dc.contributor.authorHuang, Thomas-
dc.date.accessioned2023-03-31T05:26:29Z-
dc.date.available2023-03-31T05:26:29Z-
dc.date.issued2008-
dc.identifier.citationProceedings - International Conference on Image Processing, ICIP, 2008, p. 1264-1267-
dc.identifier.issn1522-4880-
dc.identifier.urihttp://hdl.handle.net/10722/326785-
dc.description.abstractIn this paper, we address the problem of hallucinating a high resolution face given a low resolution input face. The problem is approached through sparse coding. To exploit the facial structure, Non-negative Matrix Factorization (NMF) [1] is first employed to learn a localized part-based subspace. This subspace is effective for super-resolving the incoming low resolution face under reconstruction constraints. To further enhance the detailed facial information, we propose a local patch method based on sparse representation with respect to coupled overcomplete patch dictionaries, which can be fast solved through linear programming. Experiments demonstrate that our approach can hallucinate high quality super-resolution faces. © 2008 IEEE.-
dc.languageeng-
dc.relation.ispartofProceedings - International Conference on Image Processing, ICIP-
dc.subjectFace hallucination-
dc.subjectNonnegative matrix factorization-
dc.subjectSparse coding-
dc.subjectSparse representation-
dc.subjectSuper-resolution-
dc.titleFace hallucination via sparse coding-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ICIP.2008.4711992-
dc.identifier.scopuseid_2-s2.0-69949125226-
dc.identifier.spage1264-
dc.identifier.epage1267-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats