Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2683483.2683499acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicvgipConference Proceedingsconference-collections
research-article

Parametric Dictionaries and Feature Augmentation for Continuous Domain Adaptation

Published: 14 December 2014 Publication History

Abstract

In this paper, we study methods for learning classifiers for the case when there is a variation introduced by an underlying continuous parameter θ representing transformations like blur, pose, time, etc. First, we consider the task of learning dictionary-based representation for such cases. Sparse representations driven by data-derived dictionaries have produced state-of-the-art results in various image restoration and classification tasks. While significant advances have been made in this direction, most techniques have focused on learning a single dictionary to represent all variations in the data. In this paper, we show that dictionary learning can be significantly improved by explicitly parameterizing the dictionaries for θ. We develop an optimization framework to learn parametric dictionaries that vary smoothly with θ. We propose two optimization approaches, (a) least squares approach, and (b) the regularized K-SVD approach. Furthermore, we analyze the variations in data induced by θ from a different yet related perspective of feature augmentation. Specifically, we extend the feature augmentation technique proposed for adaptation of discretely separable domains to continuously varying domains, and propose a Mercer kernel to account for such changes. We present experimental validation of the proposed techniques using both synthetic and real datasets.

References

[1]
M. Aharon, M. Elad, and A. Bruckstein. K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation. IEEE Transactions on Signal Processing, 54(11):4311–4322, Nov 2006.
[2]
J. Blitzer, R. McDonald, and F. Pereira. Domain adaptation with structural correspondence learning. In EMNLP, 2006.
[3]
H. Daumé III. Frustratingly easy domain adaptation. In ACL, 2007.
[4]
M. Elad and M. Aharon. Image denoising via sparse and redundant representations over learned dictionaries. IEEE Transactions on Image Processing, 15(12):3736–3745, Dec 2006.
[5]
K. Engan, S. Aase, and J. H. Husoy. Method of optimal directions for frame design. In ICASSP, 1999.
[6]
K. Etemad and R. Chellappa. Separability-based multi-scale basis selection and feature extraction for signal and image classification. IEEE Transactions on Image Processing, 7(10):1453–1465, 1998.
[7]
B. Gong, Y. Shi, F. Sha, and K. Grauman. Geodesic flow kernel for unsupervised domain adaptation. IEEE Conference on Computer Vision and Pattern Recognition, pages 2066–2073, June 2012.
[8]
R. Gopalan, R. Li, and R. Chellappa. Domain adaptation for object recognition: An unsupervised approach. In ICCV, 2011.
[9]
R. Gopalan, R. Li, and R. Chellappa. Unsupervised adaptation across domain shift by generating intermediate data representations. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2014.
[10]
X. He, S. Yan, Y. Hu, P. Niyogi, and H. Zhang. Face recognition using laplacianfaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(3):328–340, 2005.
[11]
R. Jenatton, J. Mairal, G. Obozinski, and F. Bach. Proximal methods for sparse hierarchical dictionary learning. In ICML, 2010.
[12]
Y. Jia, M. Salzmann, and T. Darrell. Factorized latent spaces with structured sparsity. Neural Information Processing Systems, pages 982–990, 2010.
[13]
Z. Jiang, Z. Lin, and L. S. Davis. Learning a discriminative dictionary for sparse coding via label consistent k-svd. In CVPR, 2011.
[14]
H. Lee, A. Battle, R. Raina, and A. Ng. Efficient sparse coding algorithms. In NIPS, 2007.
[15]
K. Lee, J. Ho, and D. Kriegman. Acquiring linear subspaces for face recognition under variable lighting. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(5):684–698, may 2005.
[16]
K. Lee, J. Ho, M. H. Yang, and D. Kriegman. Visual tracking and recognition using probabilistic appearance manifolds. Computer Vision and Image Understanding, 99:303–331, 2005.
[17]
J. Mairal, F. Bach, and J. Ponce. Task-driven dictionary learning. IEEE Transactions on Pattern Analysis and Machine Intelligence, PP(99):1, 2011.
[18]
J. Mairal, F. Bach, J. Ponce, and G. Sapiro. Online dictionary learning for sparse coding. In ICML, 2009.
[19]
J. Mairal, F. Bach, J. Ponce, G. Sapiro, and A. Zisserman. Discriminative learned dictionaries for local image analysis. In CVPR, 2008.
[20]
J. Ni, Q. Qiu, and R. Chellappa. Subspace interpolation via dictionary learning for unsupervised domain adaptation. IEEE Conference on Computer Vision and Pattern Recognition, pages 692–699, June 2013.
[21]
B. Olshausen and D. Field. Sparse coding with an overcomplete basis set: A strategy employed by v1? Vision research, 37(23):3311–3325, 1997.
[22]
Y. Pati, R. Rezaiifar, and P. Krishnaprasad. Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. In Asilomar Conference on Signals, Systems and Computers, 1993.
[23]
Q. Qiu, V. M. Patel, P. Turaga, and R. Chellappa. Domain adaptive dictionary learning. European Conference on Computer Vision, 2012.
[24]
K. Rosenblum, L. Zelnik-Manor, and Y. C. Eldar. Dictionary optimization for block-sparse representations. arXiv:1005.0202v1, May 2010.
[25]
K. Saenko, B. Kulis, M. Fritz, and T. Darrell. Adapting visual category models to new domains. European Conference on Computer Vision, 6314:213–226, 2010.
[26]
E. Sandhaus. The new york times annotated corpus. Linguistic Data Consortium, Philadelphia, 2008.
[27]
S. Shekhar, V. M. Patel, H. V. Nguyen, and R. Chellappa. Generalized domain-adaptive dictionaries. IEEE Conference on Computer Vision and Pattern Recognition, pages 361–368, 2013.
[28]
H. Shen and J. Z. Huang. Sparse principal component analysis via regularized low rank matrix approximation. Journal of Multivariate Analysis, 99:1015–1034, July 2008.
[29]
A. Shrivastava, S. Shekhar, and V. M. Patel. Unsupervised domain adaptation using parallel transport on grassmann manifold. IEEE Winter conference on Applications of Computer Vision, 2014.
[30]
T. Sim, S. Baker, and M. Bsat. The cmu pose, illumination, and expression (pie) database. In International Conference on Automatic Face and Gesture Recognition, 2002.
[31]
J. A. Tropp. Greed is good: Algorithmic results for sparse approximation. IEEE Transactions on Information Theory, 50(10):2231–2242, Oct. 2004.
[32]
J. Wright, A. Yang, A. Ganesh, S. Sastry, and Y. Ma. Robust face recognition via sparse representation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(2):210–227, 2009.
[33]
Q. Zhang and B. Li. Discriminative k-svd for dictionary learning in face recognition. In CVPR, 2010.
[34]
Z. Zhang, E. Klassen, A. Srivastava, P. Turaga, and R. Chellappa. Blurring-invariant riemannian metrics for comparing signals and images. In ICCV, 2011.

Cited By

View all
  • (2021)Augmenting features by relative transformation for small dataKnowledge-Based Systems10.1016/j.knosys.2021.107121225(107121)Online publication date: Aug-2021

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences
ICVGIP '14: Proceedings of the 2014 Indian Conference on Computer Vision Graphics and Image Processing
December 2014
692 pages
ISBN:9781450330619
DOI:10.1145/2683483
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 December 2014

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Dictionary Learning
  2. Discriminative dictionary
  3. Domain Adaptation
  4. Feature Augmentation
  5. Parameters

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

ICVGIP '14

Acceptance Rates

Overall Acceptance Rate 95 of 286 submissions, 33%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)0
Reflects downloads up to 09 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2021)Augmenting features by relative transformation for small dataKnowledge-Based Systems10.1016/j.knosys.2021.107121225(107121)Online publication date: Aug-2021

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media