Jorge Batista, K. Krakowski, Luís Machado, P. Martins, F. Leite
{"title":"基于C - log -光滑子空间插值的多源域自适应","authors":"Jorge Batista, K. Krakowski, Luís Machado, P. Martins, F. Leite","doi":"10.1109/ICIP.2016.7532879","DOIUrl":null,"url":null,"abstract":"Manifold-based domain adaptation algorithms are receiving increasing attention in computer vision to model distribution shifts between source and target domain. In contrast to early works, that mainly explore intermediate subspaces along geodesics, in this work we propose to interpolate subspaces through C1-smooth curves on the Grassmann manifold. The new methodis based on the geometric Casteljau algorithm that is used to generate smooth interpolating polynomial curves on non-euclidean spaces and can be extended to generate polynomial splines that interpolate a given set of data on the Grassmann manifold. To evaluate the usefulness of the proposed interpolating curves on vision related problems, several experiments were conducted. We show the advantage of using smooth subspaces interpolation in multi-source unsupervised domain adaptation problems and in object recognition problems across datasets.","PeriodicalId":6521,"journal":{"name":"2016 IEEE International Conference on Image Processing (ICIP)","volume":"1 1","pages":"2846-2850"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Multi-source domain adaptation using C⁁1-smooth subspaces interpolation\",\"authors\":\"Jorge Batista, K. Krakowski, Luís Machado, P. Martins, F. Leite\",\"doi\":\"10.1109/ICIP.2016.7532879\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Manifold-based domain adaptation algorithms are receiving increasing attention in computer vision to model distribution shifts between source and target domain. In contrast to early works, that mainly explore intermediate subspaces along geodesics, in this work we propose to interpolate subspaces through C1-smooth curves on the Grassmann manifold. The new methodis based on the geometric Casteljau algorithm that is used to generate smooth interpolating polynomial curves on non-euclidean spaces and can be extended to generate polynomial splines that interpolate a given set of data on the Grassmann manifold. To evaluate the usefulness of the proposed interpolating curves on vision related problems, several experiments were conducted. We show the advantage of using smooth subspaces interpolation in multi-source unsupervised domain adaptation problems and in object recognition problems across datasets.\",\"PeriodicalId\":6521,\"journal\":{\"name\":\"2016 IEEE International Conference on Image Processing (ICIP)\",\"volume\":\"1 1\",\"pages\":\"2846-2850\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Conference on Image Processing (ICIP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIP.2016.7532879\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Image Processing (ICIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIP.2016.7532879","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multi-source domain adaptation using C⁁1-smooth subspaces interpolation
Manifold-based domain adaptation algorithms are receiving increasing attention in computer vision to model distribution shifts between source and target domain. In contrast to early works, that mainly explore intermediate subspaces along geodesics, in this work we propose to interpolate subspaces through C1-smooth curves on the Grassmann manifold. The new methodis based on the geometric Casteljau algorithm that is used to generate smooth interpolating polynomial curves on non-euclidean spaces and can be extended to generate polynomial splines that interpolate a given set of data on the Grassmann manifold. To evaluate the usefulness of the proposed interpolating curves on vision related problems, several experiments were conducted. We show the advantage of using smooth subspaces interpolation in multi-source unsupervised domain adaptation problems and in object recognition problems across datasets.