Publication:
Minimum-distortion isometric shape correspondence using em algorithm

dc.contributor.departmentDepartment of Computer Engineering
dc.contributor.departmentGraduate School of Sciences and Engineering
dc.contributor.kuauthorSahillioğlu, Yusuf
dc.contributor.kuauthorYemez, Yücel
dc.contributor.schoolcollegeinstituteCollege of Engineering
dc.contributor.schoolcollegeinstituteGRADUATE SCHOOL OF SCIENCES AND ENGINEERING
dc.date.accessioned2024-11-09T22:50:14Z
dc.date.issued2012
dc.description.abstractWe 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.
dc.description.indexedbyWOS
dc.description.indexedbyScopus
dc.description.indexedbyPubMed
dc.description.issue11
dc.description.openaccessYES
dc.description.sponsoredbyTubitakEuTÜBİTAK
dc.description.sponsorshipTUBITAK [EEEAG-109E274] This work has been supported by TUBITAK under the project EEEAG-109E274.
dc.description.volume34
dc.identifier.doi10.1109/TPAMI.2012.26
dc.identifier.eissn1939-3539
dc.identifier.issn0162-8828
dc.identifier.scopus2-s2.0-84866696225
dc.identifier.urihttps://doi.org/10.1109/TPAMI.2012.26
dc.identifier.urihttps://hdl.handle.net/20.500.14288/6639
dc.identifier.wos308755000012
dc.keywords3D isometric shape correspondence
dc.keywordsMultidimensional scaling
dc.keywordsSpectral embedding
dc.keywordsIsometric distortion
dc.keywordsGreedy optimization
dc.keywordsBipartite perfect matching
dc.keywordsEM algorithm
dc.language.isoeng
dc.publisherIEEE Computer Soc
dc.relation.ispartofIEEE Transactions on Pattern Analysis and Machine Intelligence
dc.subjectComputer Science
dc.subjectArtificial intelligence
dc.subjectElectrical electronics engineering
dc.titleMinimum-distortion isometric shape correspondence using em algorithm
dc.typeJournal Article
dspace.entity.typePublication
local.contributor.kuauthorSahillioğlu, Yusuf
local.contributor.kuauthorYemez, Yücel
local.publication.orgunit1GRADUATE SCHOOL OF SCIENCES AND ENGINEERING
local.publication.orgunit1College of Engineering
local.publication.orgunit2Department of Computer Engineering
local.publication.orgunit2Graduate School of Sciences and Engineering
relation.isOrgUnitOfPublication89352e43-bf09-4ef4-82f6-6f9d0174ebae
relation.isOrgUnitOfPublication3fc31c89-e803-4eb1-af6b-6258bc42c3d8
relation.isOrgUnitOfPublication.latestForDiscovery89352e43-bf09-4ef4-82f6-6f9d0174ebae
relation.isParentOrgUnitOfPublication8e756b23-2d4a-4ce8-b1b3-62c794a8c164
relation.isParentOrgUnitOfPublication434c9663-2b11-4e66-9399-c863e2ebae43
relation.isParentOrgUnitOfPublication.latestForDiscovery8e756b23-2d4a-4ce8-b1b3-62c794a8c164

Files