On matching sets of 3D segments

被引：5
|
作者：
Guerra, C [1 ]
Pascucci, V [1 ]
机构：
[1] Univ Padua, Padua, Italy
来源：
VISION GEOMETRY VIII | 1999年 / 3811卷
关键词：
3D matching; range images; segment extraction; tabu search; indexing;
D O I：
10.1117/12.364090
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The problem of matching 3D objects has been studied extensively in computer vision. Here we consider the case of polyhedral objects extracted from range images and represented in terms of 3D lines. Given two sets of line segments A and B the problem is to find a rigid body transformation T that minimizes a given dissimilarity measure between T(A) and B. We discuss two practical approximate solutions to the segment matching problem in 3D that can be used to recognize planar-faced objects from range data. The first method is based on indexing and the second is a minimization of the Hausdorff distance. We show the advantage of an integrated use of the two strategies improving the overall performance without degradation in the quality of the results.
引用
下载
收藏
页码：157 / 167
页数：11
相关论文
共 50 条
  • [1] Matching sets of 3D line segments with application to polygonal arc matching
    KamgarParsi, B
    KamgarParsi, B
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1997, 19 (10) : 1090 - 1099
  • [2] Algorithms for matching 3D line sets
    Kamgar-Parsi, B
    Kamgar-Parsi, B
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (05) : 582 - 593
  • [3] Scan Segments Matching for Pairwise 3D Alignment
    Douillard, B.
    Quadros, A.
    Morton, P.
    Underwood, J. P.
    De Deuge, M.
    Hugosson, S.
    Hallstroem, M.
    Bailey, T.
    2012 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2012, : 3033 - 3040
  • [4] An open problem in matching sets of 3D lines
    Kamgar-Parsi, B
    Kamgar-Parsi, B
    2001 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, PROCEEDINGS, 2001, : 651 - 656
  • [5] Pattern matching for sets of segments
    Efrat, A
    Indyk, P
    Venkatasubramanian, S
    PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 295 - 304
  • [6] Pattern matching for sets of segments
    Efrat, A
    Indyk, P
    Venkatasubramanian, S
    ALGORITHMICA, 2004, 40 (03) : 147 - 160
  • [7] Matching Sets of Line Segments
    Yang, Hyeyun
    Vigneron, Antoine
    WALCOM: ALGORITHMS AND COMPUTATION (WALCOM 2019), 2019, 11355 : 261 - 273
  • [8] Matching sets of line segments
    Yang, Hyeyun
    Vigneron, Antoine
    THEORETICAL COMPUTER SCIENCE, 2021, 866 : 82 - 95
  • [9] Pattern Matching for Sets of Segments
    Alon Efrat
    Piotr Indyk
    Suresh Venkatasubramanian
    Algorithmica , 2004, 40 : 147 - 160
  • [10] An invariant, closed-form solution for matching sets of 3D lines'
    Kamgar-Parsi, B
    Kamgar-Parsi, B
    PROCEEDINGS OF THE 2004 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 2, 2004, : 431 - 436
12345