Minimum-Distortion Isometric Shape Correspondence Using EM Algorithm

被引:48
|
作者
Sahillioglu, Yusuf [1 ]
Yemez, Yucel [1 ]
机构
[1] Koc Univ, Dept Comp Engn, TR-34450 Istanbul, Turkey
关键词
3D isometric shape correspondence; multidimensional scaling; spectral embedding; isometric distortion; greedy optimization; bipartite perfect matching; EM algorithm;
D O I
10.1109/TPAMI.2012.26
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present a purely isometric method that establishes 3D correspondence between two (nearly) isometric shapes. Our method evenly samples high-curvature vertices from the given mesh representations, and then seeks an injective mapping from one vertex set to the other that minimizes the isometric distortion. We formulate the problem of shape correspondence as combinatorial optimization over the domain of all possible mappings, which then reduces in a probabilistic setting to a log-likelihood maximization problem that we solve via the Expectation-Maximization (EM) algorithm. The EM algorithm is initialized in the spectral domain by transforming the sampled vertices via classical Multidimensional Scaling (MDS). Minimization of the isometric distortion, and hence maximization of the log-likelihood function, is then achieved in the original 3D euclidean space, for each iteration of the EM algorithm, in two steps: by first using bipartite perfect matching, and then a greedy optimization algorithm. The optimal mapping obtained at convergence can be one-to-one or many-to-one upon choice. We demonstrate the performance of our method on various isometric (or nearly isometric) pairs of shapes for some of which the ground-truth correspondence is available.
引用
收藏
页码:2203 / 2215
页数:13
相关论文
共 50 条
  • [1] Minimum-Distortion Embedding
    Agrawal, Akshay
    Ali, Alnur
    Boyd, Stephen
    [J]. FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2021, 14 (03): : 211 - 378
  • [2] A distributed minimum-distortion routing algorithm with in-network data processing
    Khalili, Ramin
    Kurose, Jim
    [J]. 27TH IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM), VOLS 1-5, 2008, : 296 - 300
  • [3] Minimum-Distortion Data Embedding in Video Streams
    Li, Ming
    Thawdar, Ngwe
    Pados, Dimitris A.
    Batalama, Stella N.
    Medley, Michael J.
    [J]. 2014 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2014, : 4589 - 4594
  • [4] THE ROLE OF PERMUTATION CODING IN MINIMUM-DISTORTION PERFECT COUNTERFORENSICS
    Balado, Felix
    [J]. 2014 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2014,
  • [5] Analytical establishment of the minimum-distortion pulse density modulation
    Nieznanski, J
    [J]. ELECTRICAL ENGINEERING, 1997, 80 (04): : 251 - 258
  • [6] A Genetic Isometric Shape Correspondence Algorithm with Adaptive Sampling
    Sahillioglu, Yusuf
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2018, 37 (05):
  • [7] Lattice-Based Minimum-Distortion Data Hiding
    Lin, Jieni
    Qin, Junren
    Lyu, Shanxiang
    Feng, Bingwen
    Wang, Jiabo
    [J]. IEEE COMMUNICATIONS LETTERS, 2021, 25 (09) : 2839 - 2843
  • [8] MINIMUM-DISTORTION FUNCTIONAL FOR ONE-DIMENSIONAL QUANTIZATION
    POOR, HV
    [J]. ELECTRONICS LETTERS, 1980, 16 (01) : 23 - 25
  • [9] Discrete Minimum Distortion Correspondence Problems for Non-rigid Shape Matching
    Wang, Chaohui
    Bronstein, Michael M.
    Bronstein, Alexander M.
    Paragios, Nikos
    [J]. SCALE SPACE AND VARIATIONAL METHODS IN COMPUTER VISION, 2012, 6667 : 580 - +
  • [10] Isometric Shape Correspondence Based on the Geodesic Structure
    Jia, Taorui
    Wang, Kang
    Wu, Zhongke
    Zhao, Junli
    Xu, Pengfei
    Liu, Cuiting
    Zhou, Mingquan
    [J]. TRANSACTIONS ON COMPUTATIONAL SCIENCE XXVI: SPECIAL ISSUE ON CYBERWORLDS AND CYBERSECURITY, 2016, 9550 : 41 - 56