The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Domain adaptation for object recognition: An unsupervised approach
Abstract
Adapting the classifier trained on a source domain to recognize instances from a new target domain is an important problem that is receiving recent attention. In this paper, we present one of the first studies on unsupervised domain adaptation in the context of object recognition, where we have labeled data only from the source domain (and therefore do not have correspondences between object categories across domains). Motivated by incremental learning, we create intermediate representations of data between the two domains by viewing the generative subspaces (of same dimension) created from these domains as points on the Grassmann manifold, and sampling points along the geodesic between them to obtain subspaces that provide a meaningful description of the underlying domain shift. We then obtain the projections of labeled source domain data onto these subspaces, from which a discriminative classifier is learnt to classify projected data from the target domain. We discuss extensions of our approach for semi-supervised adaptation, and for cases with multiple source and target domains, and report competitive results on standard datasets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
Pan, S. J., & Yang, Q. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.191 · Cited by 23,387
Speeded-Up Robust Features (SURF)
Bay, H., Ess, A., Tuytelaars, T., & Van Gool, L. (2008) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2007.09.014 · Cited by 13,557
Eigenfaces vs. Fisherfaces: recognition using class specific linear projection
Belhumeur, P. N., Hespanha, J. P., & Kriegman, D. J. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.598228 · Cited by 11,707
Face recognition using eigenfaces
Turk, M. A., & Pentland, A. P. (2002) · Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1991.139758 · Cited by 5,197
Domain Adaptation via Transfer Component Analysis
Pan, S. J., Tsang, I. W., Kwok, J. T., & Yang, Q. (2011) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2010.2091281 · Cited by 4,753
A theory of learning from different domains
Ben-David, S., Blitzer, J., Crammer, K., Kulesza, A., Pereira, F., & Vaughan, J. W. (2010) · Machine Learning · doi:10.1007/s10994-009-5152-4 · Cited by 3,515
The class imbalance problem: A systematic study1
Japkowicz, N., & Stephen, S. (2002) · Intelligent Data Analysis · doi:10.3233/ida-2002-6504 · Cited by 3,295
Adapting visual category models to new domains
Saenko, K., Kulis, B., Fritz, M., & Darrell, T. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15561-1_16 · Cited by 2,847
The Geometry of Algorithms with Orthogonality Constraints
Edelman, A., Arias, T. A., & Smith, S. T. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895290954 · Cited by 2,685
Analysis of Representations for Domain Adaptation
Ben-David, S., Blitzer, J., Crammer, K., & Pereira, F. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0022 · Cited by 2,019 · cited 1×
“Ben-David et al [5] generalized the results of [10] by presenting a theoretical analysis on the feature representation functions that should be used to minimize domain divergence, as well as classification error, under certain domain shift assumptions.”
Background(2007) · Cited by 2,018
Invariant image recognition by Zernike moments
Khotanzad, A., & Hong, Y. H. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.55109 · Cited by 1,914
Fourier Descriptors for Plane Closed Curves
Zahn, C. T., & Roskies, R. Z. (1972) · IEEE Transactions on Computers · doi:10.1109/tc.1972.5008949 · Cited by 1,860
Improving predictive inference under covariate shift by weighting the log-likelihood function
Shimodaira, H. (2000) · Journal of Statistical Planning and Inference · doi:10.1016/s0378-3758(00)00115-4 · Cited by 1,678
Domain adaptation with structural correspondence learning
Blitzer, J., McDonald, R., & Pereira, F. (2006) · Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing - EMNLP '06 · doi:10.3115/1610075.1610094 · Cited by 1,543
Riemannian center of mass and mollifier smoothing
Karcher, H. (1977) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160300502 · Cited by 995
Domain Adaptation for Statistical Classifiers
Daume III, H., & Marcu, D. (2006) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1872 · Cited by 816
Incremental learning from noisy data
Schlimmer, J. C., & Granger, R. H. (1986) · Machine Learning · doi:10.1007/bf00116895 · Cited by 653
Grassmann discriminant analysis: a unifying view on subspace-based learning
Hamm, J., & Lee, D. D. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390204 · Cited by 592
Domain Adaptation Problems: A DASVM Classification Technique and a Circular Validation Strategy
Bruzzone, L., & Marconcini, M. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.57 · Cited by 591
Domain Adaptation: Learning Bounds and Algorithms
Mansour, Y., Mohri, M., & Rostamizadeh, A. (2009) · arXiv · doi:10.48550/arxiv.0902.3430 · Cited by 504
(2008) · Cited by 436
Statistics on Special Manifolds
Chikuse, Y. (2003) · Lecture Notes in Statistics · doi:10.1007/978-0-387-21540-2 · Cited by 411
Learning Bounds for Domain Adaptation
Blitzer, J. C., Crammer, K., Kulesza, A., Pereira, F. M. B., & Wortman, J. R. (2007) · Cited by 393
Riemannian Geometry of Grassmann Manifolds with a View on Algorithmic Computation
Absil, P.-A., Mahony, R., & Sepulchre, R. (2004) · Acta Applicandae Mathematica · doi:10.1023/b:acap.0000013855.14971.91 · Cited by 393
Transferring naive bayes classifiers for text classification
Dai, W., Xue, G.-R., Yang, Q., & Yu, Y. H. (2007) · Cited by 325
Graph embedding discriminant analysis on Grassmannian manifolds for improved image set matching
Harandi, M. T., Sanderson, C., Shirazi, S., & Lovell, B. C. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995564 · Cited by 290
Domain adaptation from multiple sources via auxiliary classifiers
Duan, L., Tsang, I. W., Xu, D., & Chua, T.-S. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553411 · Cited by 289
Exploiting weakly-labeled Web images to improve object classification: a domain adaptation approach
Bergamo, A., & Torresani, L. (2010) · neural information processing systems · Cited by 239
Statistical analysis on Stiefel and Grassmann manifolds with applications in computer vision
Turaga, P., Veeraraghavan, A., & Chellappa, R. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587733 · Cited by 201
Self-citationImpossibility Theorems for Domain Adaptation
Ben-David, S., Lu, T., Luu, T. V., & Pál, D. (2010) · Cited by 200
Manifold alignment without correspondence
Wang, C., & Mahadevan, S. (2009) · Cited by 159
Object Recognition in 3D Point Clouds Using Web Data and Domain Adaptation
Lai, K., & Fox, D. (2010) · The International Journal of Robotics Research · doi:10.1177/0278364910369190 · Cited by 152
Co-regularization Based Semi-supervised Domain Adaptation
Kumar, A., Saha, A., & Daumé, H. (2010) · neural information processing systems · Cited by 146
Efficient algorithms for inferences on grassmann manifolds
Gallivan, K. A., Srivastava, A., Liu, X., & Dooren, P. V. (2004) · IEEE Workshop on Statistical Signal Processing (SSP) · doi:10.1109/ssp.2003.1289408 · Cited by 111
Online methods for multi-domain learning and adaptation
Dredze, M. H., & Crammer, K. (2008) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/1613715.1613801 · Cited by 74
Bridged Refinement for Transfer Learning
Xing, D., Dai, W., Xue, G.-R., & Yu, Y. H. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74976-9_31 · Cited by 58
Grassmann Registration Manifolds for Face Recognition
Lui, Y. M., & Beveridge, J. R. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88688-4_4 · Cited by 55
INCREMENTAL LEARNING IN BIOLOGICAL AND MACHINE LEARNING SYSTEMS
Chalup, S. K. (2002) · International Journal of Neural Systems · doi:10.1142/s0129065702001308 · Cited by 28
Cited by
Domain-Adversarial Training of Neural Networks
Ganin, Y., Ustinova, E., Ajakan, H., Germain, P., Larochelle, H., Laviolette, F., Marchand, M., & Lempitsky, V. (2017) · Advances in Computer Vision and Pattern Recognition · doi:10.1007/978-3-319-58347-1_10 · Cited by 8,318
A Comprehensive Survey on Transfer Learning
Zhuang, F., Qi, Z., Duan, K., Xi, D., Zhu, Y., Zhu, H., Xiong, H., & He, Q. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2020.3004555 · Cited by 6,678
“GFK is closely related to a previous approach termed geodesic flow subspaces (GFSs) [103].”
BackgroundWeiss, K., Khoshgoftaar, T. M., & Wang, D. (2016) · Journal of Big Data · doi:10.1186/s40537-016-0043-6 · Cited by 6,260
Deep CORAL: Correlation Alignment for Deep Domain Adaptation
Sun, B., & Saenko, K. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49409-8_35 · Cited by 3,757
Unsupervised Domain Adaptation by Backpropagation
Ganin, Y., & Lempitsky, V. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1409.7495 · Cited by 2,521
Metadata
- Authors
- Gopalan, R., Li, R., & Chellappa, R.
- Venue
- 2011 International Conference on Computer Vision
- Publisher
- IEEE
- Published
- 2011-11
- Pages
- 999-1006
- OpenAlex
- W2128053425
- Cited by
- 1,053
- References
- 40
- FWCI
- 33.41
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.