{"title":"基于密度估计和结构约束的姿态聚类","authors":"S. Moss, E. Hancock","doi":"10.1109/CVPR.1999.784613","DOIUrl":null,"url":null,"abstract":"This paper describes a statistical framework for object alignment by pose clustering. The idea underlying pose clustering is to transform the alignment process from the image domain to that of the appropriate transformation parameters. It commence by taking k-tuples from the primitive-sets for the model and the data. The size of the k-tuples is such that there are sufficient measurements available to estimate the full-set of transformation parameters. By pairing each k-tuple in the model and each k-tuple in the data, a set of transformation parameter estimates or alignment votes is accumulated. The work reported here draws on three ideas. Firstly, we estimate maximum likelihood alignment parameters by using the the EM algorithm to fit a mixture model to the set of transformation parameter votes. Secondly, we control the order of the underlying structure model using a minimum description length criterion. Finally, we limit problems of combinatorial background by imposing structural constraints on the k-tuples.","PeriodicalId":20644,"journal":{"name":"Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149)","volume":"33 1","pages":"85-91 Vol. 2"},"PeriodicalIF":0.0000,"publicationDate":"1999-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Pose clustering with density estimation and structural constraints\",\"authors\":\"S. Moss, E. Hancock\",\"doi\":\"10.1109/CVPR.1999.784613\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes a statistical framework for object alignment by pose clustering. The idea underlying pose clustering is to transform the alignment process from the image domain to that of the appropriate transformation parameters. It commence by taking k-tuples from the primitive-sets for the model and the data. The size of the k-tuples is such that there are sufficient measurements available to estimate the full-set of transformation parameters. By pairing each k-tuple in the model and each k-tuple in the data, a set of transformation parameter estimates or alignment votes is accumulated. The work reported here draws on three ideas. Firstly, we estimate maximum likelihood alignment parameters by using the the EM algorithm to fit a mixture model to the set of transformation parameter votes. Secondly, we control the order of the underlying structure model using a minimum description length criterion. Finally, we limit problems of combinatorial background by imposing structural constraints on the k-tuples.\",\"PeriodicalId\":20644,\"journal\":{\"name\":\"Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149)\",\"volume\":\"33 1\",\"pages\":\"85-91 Vol. 2\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CVPR.1999.784613\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CVPR.1999.784613","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Pose clustering with density estimation and structural constraints
This paper describes a statistical framework for object alignment by pose clustering. The idea underlying pose clustering is to transform the alignment process from the image domain to that of the appropriate transformation parameters. It commence by taking k-tuples from the primitive-sets for the model and the data. The size of the k-tuples is such that there are sufficient measurements available to estimate the full-set of transformation parameters. By pairing each k-tuple in the model and each k-tuple in the data, a set of transformation parameter estimates or alignment votes is accumulated. The work reported here draws on three ideas. Firstly, we estimate maximum likelihood alignment parameters by using the the EM algorithm to fit a mixture model to the set of transformation parameter votes. Secondly, we control the order of the underlying structure model using a minimum description length criterion. Finally, we limit problems of combinatorial background by imposing structural constraints on the k-tuples.