{"title":"基于全局和局部约束的不完全轨迹投影重建","authors":"H. Ackermann, B. Rosenhahn","doi":"10.1109/CVMP.2011.15","DOIUrl":null,"url":null,"abstract":"The paper deals with projective shape and motion reconstruction by subspace iterations. A prerequisite of factorization-style algorithms is that all feature points need be observed in all images, a condition which is hardly realistic in real videos. We therefore address the problem of estimating structure and motion considering missing features. The proposed algorithm does not require initialization and uniformly handles all available data. The computed solution is global in the sense that it does not merge partial solutions incrementally or hierarchically. The global cost due to the factorization is further amended by local constraints to regularize and stabilize the estimations. It is shown how both costs can be jointly minimized in the presence of unobserved points. By synthetic and real image sequences with up to $60\\%$ missing data we demonstrate that our algorithm is accurate and reliable.","PeriodicalId":167135,"journal":{"name":"2011 Conference for Visual Media Production","volume":"134 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Projective Reconstruction from Incomplete Trajectories by Global and Local Constraints\",\"authors\":\"H. Ackermann, B. Rosenhahn\",\"doi\":\"10.1109/CVMP.2011.15\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper deals with projective shape and motion reconstruction by subspace iterations. A prerequisite of factorization-style algorithms is that all feature points need be observed in all images, a condition which is hardly realistic in real videos. We therefore address the problem of estimating structure and motion considering missing features. The proposed algorithm does not require initialization and uniformly handles all available data. The computed solution is global in the sense that it does not merge partial solutions incrementally or hierarchically. The global cost due to the factorization is further amended by local constraints to regularize and stabilize the estimations. It is shown how both costs can be jointly minimized in the presence of unobserved points. By synthetic and real image sequences with up to $60\\\\%$ missing data we demonstrate that our algorithm is accurate and reliable.\",\"PeriodicalId\":167135,\"journal\":{\"name\":\"2011 Conference for Visual Media Production\",\"volume\":\"134 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Conference for Visual Media Production\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CVMP.2011.15\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Conference for Visual Media Production","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CVMP.2011.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Projective Reconstruction from Incomplete Trajectories by Global and Local Constraints
The paper deals with projective shape and motion reconstruction by subspace iterations. A prerequisite of factorization-style algorithms is that all feature points need be observed in all images, a condition which is hardly realistic in real videos. We therefore address the problem of estimating structure and motion considering missing features. The proposed algorithm does not require initialization and uniformly handles all available data. The computed solution is global in the sense that it does not merge partial solutions incrementally or hierarchically. The global cost due to the factorization is further amended by local constraints to regularize and stabilize the estimations. It is shown how both costs can be jointly minimized in the presence of unobserved points. By synthetic and real image sequences with up to $60\%$ missing data we demonstrate that our algorithm is accurate and reliable.