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 条
  • [41] MAP decoding using the EM algorithm
    Turin, W
    [J]. 1999 IEEE 49TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-3: MOVING INTO A NEW MILLENIUM, 1999, : 1866 - 1870
  • [42] UNSUPERVISED LEARNING ALGORITHM FOR VOWEL TEMPLATES BASED ON MINIMUM QUANTIZATION DISTORTION
    SUGIYAMA, M
    SHIKANO, K
    [J]. REVIEW OF THE ELECTRICAL COMMUNICATIONS LABORATORIES, 1986, 34 (03): : 357 - 362
  • [43] Accelerating the convergence of the EM algorithm using the vector ε algorithm
    Kuroda, Masahiro
    Sakakihara, Michio
    [J]. COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2006, 51 (03) : 1549 - 1561
  • [44] Adaptive MLSDE using the EM algorithm
    Zamiri-Jafarian, H
    Pasupathy, S
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1999, 47 (08) : 1181 - 1193
  • [45] Acceleration of the EM algorithm using the vector epsilon algorithm
    Mingfeng Wang
    Masahiro Kuroda
    Michio Sakakihara
    Zhi Geng
    [J]. Computational Statistics, 2008, 23 : 469 - 486
  • [46] Adaptive snakes using the EM algorithm
    Nascimento, JC
    Marques, JS
    [J]. IEEE TRANSACTIONS ON IMAGE PROCESSING, 2005, 14 (11) : 1678 - 1686
  • [47] Acceleration of the EM algorithm using the vector epsilon algorithm
    Wang, Mingfeng
    Kuroda, Masahiro
    Sakakihara, Michio
    Geng, Zhi
    [J]. COMPUTATIONAL STATISTICS, 2008, 23 (03) : 469 - 486
  • [48] Offline signature verification using shape correspondence
    Narwade, Pradeep N.
    Sawant, Rajendra R.
    Bonde, Sanjiv, V
    [J]. INTERNATIONAL JOURNAL OF BIOMETRICS, 2018, 10 (03) : 272 - 289
  • [50] Evaluation of shape correspondence using ordinal measures
    Cheikh, FA
    Cramariuc, B
    Partio, M
    Reijonen, P
    Gabbouj, M
    [J]. STORAGE AND RETRIEVAL FOR MEDIA DATABASES 2002, 2002, 4676 : 22 - 30