A Perfect Match Condition for Point-Set Matching Problems Using the Optimal Mass Transport Approach

DOI10.1137/12086443XzbMath1280.49032OpenAlexW2093889309WikidataQ36851607 ScholiaQ36851607MaRDI QIDQ2873214

Pengwen Chen, Ching-Long Lin, I.-Liang Chern

Publication date: 23 January 2014

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/12086443x

zbMATH Keywords

Wasserstein metricslung registrationoptimal Monge-Kantorovich mass transportpoint-set matching problems

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Optimality conditions for minimax problems (49K35)

Related Items (2)

Matrix Balancing Based Interior Point Methods for Point Set Matching Problems ⋮ Graph connection Laplacian methods can be made robust to noise

This page was built for publication: A Perfect Match Condition for Point-Set Matching Problems Using the Optimal Mass Transport Approach