{"title":"3D models retrieval by using characteristic views","authors":"S. Mahmoudi, M. Daoudi","doi":"10.1109/ICPR.2002.1048337","DOIUrl":null,"url":null,"abstract":"In this work we introduce a new method for indexing 3D models. This method is based on the characterization of 3D objects by a set of 7 characteristic views, including three principals, and four secondaries. The primary, secondary, and tertiary viewing directions are determined by the eigenvector analysis of the covariance matrix related to the 3D object. The secondary views are deduced from the principal views. We propose an index based on \"curvature scale space\", organized around a tree structure, named M-Tree, which is parameterized by a distance function and allows one to considerably decrease the calculating time by saving the intermediate distances.","PeriodicalId":159502,"journal":{"name":"Object recognition supported by user interaction for service robots","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"75","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Object recognition supported by user interaction for service robots","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.2002.1048337","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 75
Abstract
In this work we introduce a new method for indexing 3D models. This method is based on the characterization of 3D objects by a set of 7 characteristic views, including three principals, and four secondaries. The primary, secondary, and tertiary viewing directions are determined by the eigenvector analysis of the covariance matrix related to the 3D object. The secondary views are deduced from the principal views. We propose an index based on "curvature scale space", organized around a tree structure, named M-Tree, which is parameterized by a distance function and allows one to considerably decrease the calculating time by saving the intermediate distances.