{"title":"基于多分辨率网格的三维目标识别","authors":"Qing Li, Manli Zhou, Jian Liu","doi":"10.1109/CVBVS.2000.855248","DOIUrl":null,"url":null,"abstract":"Motivated by the need of the numerous real-world applications, 3D object recognition has become an active research field. The representation describes the sensed data and the object models, and it is a key issue in the recognition process, which decides the match strategy and the effectiveness and robustness of the recognition system. In this paper, we propose an improved 3D object representation first, which computes the local signatures of a given basis polygon on the surface mesh, and converts the signatures to a 2D array called the distance-angle (DA) images by weighted bilinear interpolation. This representation is adaptive to free-form objects and resistant to occlusion and clutter. Compared with the original representation, it has a more distinct meaning, easier operation, and adaptation to different resolutions and irregular triangle meshes. Secondly, based on the improved representation, a novel 3D recognition algorithm is presented, which has multiresolution mesh based, coarse-to-fine recognition. By matching the DA image of a polygon in the scene surface mesh with the DA images of models at low resolution, a model candidate set is obtained. The set is filtered in the neighborhood of the matched polygons in a high-resolution mesh and verified by the model candidate sets of other polygons. Experiments show that this algorithm needs less computation and is very accurate and robust.","PeriodicalId":231063,"journal":{"name":"Proceedings IEEE Workshop on Computer Vision Beyond the Visible Spectrum: Methods and Applications (Cat. No.PR00640)","volume":"15 12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Multi-resolution mesh based 3D object recognition\",\"authors\":\"Qing Li, Manli Zhou, Jian Liu\",\"doi\":\"10.1109/CVBVS.2000.855248\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Motivated by the need of the numerous real-world applications, 3D object recognition has become an active research field. The representation describes the sensed data and the object models, and it is a key issue in the recognition process, which decides the match strategy and the effectiveness and robustness of the recognition system. In this paper, we propose an improved 3D object representation first, which computes the local signatures of a given basis polygon on the surface mesh, and converts the signatures to a 2D array called the distance-angle (DA) images by weighted bilinear interpolation. This representation is adaptive to free-form objects and resistant to occlusion and clutter. Compared with the original representation, it has a more distinct meaning, easier operation, and adaptation to different resolutions and irregular triangle meshes. Secondly, based on the improved representation, a novel 3D recognition algorithm is presented, which has multiresolution mesh based, coarse-to-fine recognition. By matching the DA image of a polygon in the scene surface mesh with the DA images of models at low resolution, a model candidate set is obtained. The set is filtered in the neighborhood of the matched polygons in a high-resolution mesh and verified by the model candidate sets of other polygons. Experiments show that this algorithm needs less computation and is very accurate and robust.\",\"PeriodicalId\":231063,\"journal\":{\"name\":\"Proceedings IEEE Workshop on Computer Vision Beyond the Visible Spectrum: Methods and Applications (Cat. No.PR00640)\",\"volume\":\"15 12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-06-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE Workshop on Computer Vision Beyond the Visible Spectrum: Methods and Applications (Cat. No.PR00640)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CVBVS.2000.855248\",\"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 IEEE Workshop on Computer Vision Beyond the Visible Spectrum: Methods and Applications (Cat. No.PR00640)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CVBVS.2000.855248","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Motivated by the need of the numerous real-world applications, 3D object recognition has become an active research field. The representation describes the sensed data and the object models, and it is a key issue in the recognition process, which decides the match strategy and the effectiveness and robustness of the recognition system. In this paper, we propose an improved 3D object representation first, which computes the local signatures of a given basis polygon on the surface mesh, and converts the signatures to a 2D array called the distance-angle (DA) images by weighted bilinear interpolation. This representation is adaptive to free-form objects and resistant to occlusion and clutter. Compared with the original representation, it has a more distinct meaning, easier operation, and adaptation to different resolutions and irregular triangle meshes. Secondly, based on the improved representation, a novel 3D recognition algorithm is presented, which has multiresolution mesh based, coarse-to-fine recognition. By matching the DA image of a polygon in the scene surface mesh with the DA images of models at low resolution, a model candidate set is obtained. The set is filtered in the neighborhood of the matched polygons in a high-resolution mesh and verified by the model candidate sets of other polygons. Experiments show that this algorithm needs less computation and is very accurate and robust.