{"title":"利用立体图像中的关系表进行特征对象的匹配","authors":"J.J Hwang, E.L Hall","doi":"10.1016/0146-664X(82)90071-5","DOIUrl":null,"url":null,"abstract":"<div><p>A method for three-dimensional scene matching is presented in this paper. Both the geometric and structural information of the segmented features in two images are used for three-dimensional scene matching. The segmented features such as regions, edge segments, and vertices are initially labelled by using a symbol set. Then the structural relationships among these labels in each image are tabulated in a relational table. The consistent labels between two relational tables associated with two given images are searched using a relaxation labelling process. In this process, the matching line equation between the two images is used as a constraint function to remove the ambiguous labels from the two relational tables. This process is applied iteratively until two isomorphic relational tables are deduced. Since the labels in the two isomorphic tables are in one-to-one correspondence, the problem of matching the two images is reduced to a problem of matching regions to regions, edge segments to edge segments, and vertices to vertices. Again using the matching line equation as a geometric constraint function, the corresponding points in the two images may be searched in the corresponding edge segments. The three-dimensional object geometry is then computed using the matched corresponding points.</p></div>","PeriodicalId":100313,"journal":{"name":"Computer Graphics and Image Processing","volume":"20 1","pages":"Pages 22-42"},"PeriodicalIF":0.0000,"publicationDate":"1982-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0146-664X(82)90071-5","citationCount":"24","resultStr":"{\"title\":\"Matching of featured objects using relational tables from stereo images\",\"authors\":\"J.J Hwang, E.L Hall\",\"doi\":\"10.1016/0146-664X(82)90071-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>A method for three-dimensional scene matching is presented in this paper. Both the geometric and structural information of the segmented features in two images are used for three-dimensional scene matching. The segmented features such as regions, edge segments, and vertices are initially labelled by using a symbol set. Then the structural relationships among these labels in each image are tabulated in a relational table. The consistent labels between two relational tables associated with two given images are searched using a relaxation labelling process. In this process, the matching line equation between the two images is used as a constraint function to remove the ambiguous labels from the two relational tables. This process is applied iteratively until two isomorphic relational tables are deduced. Since the labels in the two isomorphic tables are in one-to-one correspondence, the problem of matching the two images is reduced to a problem of matching regions to regions, edge segments to edge segments, and vertices to vertices. Again using the matching line equation as a geometric constraint function, the corresponding points in the two images may be searched in the corresponding edge segments. The three-dimensional object geometry is then computed using the matched corresponding points.</p></div>\",\"PeriodicalId\":100313,\"journal\":{\"name\":\"Computer Graphics and Image Processing\",\"volume\":\"20 1\",\"pages\":\"Pages 22-42\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1982-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0146-664X(82)90071-5\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Graphics and Image Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0146664X82900715\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Graphics and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0146664X82900715","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Matching of featured objects using relational tables from stereo images
A method for three-dimensional scene matching is presented in this paper. Both the geometric and structural information of the segmented features in two images are used for three-dimensional scene matching. The segmented features such as regions, edge segments, and vertices are initially labelled by using a symbol set. Then the structural relationships among these labels in each image are tabulated in a relational table. The consistent labels between two relational tables associated with two given images are searched using a relaxation labelling process. In this process, the matching line equation between the two images is used as a constraint function to remove the ambiguous labels from the two relational tables. This process is applied iteratively until two isomorphic relational tables are deduced. Since the labels in the two isomorphic tables are in one-to-one correspondence, the problem of matching the two images is reduced to a problem of matching regions to regions, edge segments to edge segments, and vertices to vertices. Again using the matching line equation as a geometric constraint function, the corresponding points in the two images may be searched in the corresponding edge segments. The three-dimensional object geometry is then computed using the matched corresponding points.