<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>A correspondence-less approach to matching of deformable shapes</title></titleInfo>

  
  
<titleInfo type="alternative">
  
  <title>LNCS</title>
</titleInfo>

<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Jonathan</namePart>
  <namePart type="family">Pokrass</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Alexander</namePart>
  <namePart type="family">Bronstein</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">58f3726e-7cba-11ef-ad8b-e6e8cb3904e6</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0001-9699-8730</description></name>
<name type="personal">
  <namePart type="given">Michael M.</namePart>
  <namePart type="family">Bronstein</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>









<name type="conference">
  <namePart>SSVM: Scale Space and Variational Methods in Computer Vision</namePart>
</name>






<abstract lang="eng">Finding a match between partially available deformable shapes is a challenging problem with numerous applications. The problem is usually approached by computing local descriptors on a pair of shapes and then establishing a point-wise correspondence between the two. In this paper, we introduce an alternative correspondence-less approach to matching fragments to an entire shape undergoing a non-rigid deformation. We use diffusion geometric descriptors and optimize over the integration domains on which the integral descriptors of the two parts match. The problem is regularized using the Mumford-Shah functional. We show an efficient discretization based on the Ambrosio-Tortorelli approximation generalized to triangular meshes. Experiments demonstrating the success of the proposed method are presented.</abstract>

<originInfo><publisher>Springer Nature</publisher><dateIssued encoding="w3cdtf">2012</dateIssued><place><placeTerm type="text">Ein-Gedi, Israel</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>3rd International Conference on Scale Space and Variational Methods in Computer Vision</title></titleInfo>
  <identifier type="issn">0302-9743</identifier>
  <identifier type="eIssn">1611-3349</identifier>
  <identifier type="isbn">9783642247842</identifier><identifier type="doi">10.1007/978-3-642-24785-9_50</identifier>
<part><detail type="volume"><number>6667</number></detail><extent unit="pages">592 - 603</extent>
</part>
</relatedItem>

<note type="extern">yes</note>
<extension>
<bibliographicCitation>
<ista>Pokrass J, Bronstein AM, Bronstein MM. 2012. A correspondence-less approach to matching of deformable shapes. 3rd International Conference on Scale Space and Variational Methods in Computer Vision. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 6667, 592–603.</ista>
<mla>Pokrass, Jonathan, et al. “A Correspondence-Less Approach to Matching of Deformable Shapes.” &lt;i&gt;3rd International Conference on Scale Space and Variational Methods in Computer Vision&lt;/i&gt;, vol. 6667, Springer Nature, 2012, pp. 592–603, doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-642-24785-9_50&quot;&gt;10.1007/978-3-642-24785-9_50&lt;/a&gt;.</mla>
<chicago>Pokrass, Jonathan, Alex M. Bronstein, and Michael M. Bronstein. “A Correspondence-Less Approach to Matching of Deformable Shapes.” In &lt;i&gt;3rd International Conference on Scale Space and Variational Methods in Computer Vision&lt;/i&gt;, 6667:592–603. Springer Nature, 2012. &lt;a href=&quot;https://doi.org/10.1007/978-3-642-24785-9_50&quot;&gt;https://doi.org/10.1007/978-3-642-24785-9_50&lt;/a&gt;.</chicago>
<short>J. Pokrass, A.M. Bronstein, M.M. Bronstein, in:, 3rd International Conference on Scale Space and Variational Methods in Computer Vision, Springer Nature, 2012, pp. 592–603.</short>
<ama>Pokrass J, Bronstein AM, Bronstein MM. A correspondence-less approach to matching of deformable shapes. In: &lt;i&gt;3rd International Conference on Scale Space and Variational Methods in Computer Vision&lt;/i&gt;. Vol 6667. Springer Nature; 2012:592-603. doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-642-24785-9_50&quot;&gt;10.1007/978-3-642-24785-9_50&lt;/a&gt;</ama>
<ieee>J. Pokrass, A. M. Bronstein, and M. M. Bronstein, “A correspondence-less approach to matching of deformable shapes,” in &lt;i&gt;3rd International Conference on Scale Space and Variational Methods in Computer Vision&lt;/i&gt;, Ein-Gedi, Israel, 2012, vol. 6667, pp. 592–603.</ieee>
<apa>Pokrass, J., Bronstein, A. M., &amp;#38; Bronstein, M. M. (2012). A correspondence-less approach to matching of deformable shapes. In &lt;i&gt;3rd International Conference on Scale Space and Variational Methods in Computer Vision&lt;/i&gt; (Vol. 6667, pp. 592–603). Ein-Gedi, Israel: Springer Nature. &lt;a href=&quot;https://doi.org/10.1007/978-3-642-24785-9_50&quot;&gt;https://doi.org/10.1007/978-3-642-24785-9_50&lt;/a&gt;</apa>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>18342</recordIdentifier><recordCreationDate encoding="w3cdtf">2024-10-15T11:20:54Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2025-01-16T12:59:38Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
