{"scopus_import":"1","date_updated":"2024-12-12T12:42:56Z","type":"journal_article","date_created":"2024-10-15T11:20:55Z","publication_identifier":{"issn":["0162-8828"],"eissn":["1939-3539"]},"author":[{"last_name":"Litman","full_name":"Litman, R.","first_name":"R."},{"full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein"}],"page":"171-180","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"None","_id":"18413","issue":"1","article_processing_charge":"No","citation":{"chicago":"Litman, R., and Alex M. Bronstein. “Learning Spectral Descriptors for Deformable Shape Correspondence.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2014. <a href=\"https://doi.org/10.1109/tpami.2013.148\">https://doi.org/10.1109/tpami.2013.148</a>.","apa":"Litman, R., &#38; Bronstein, A. M. (2014). Learning spectral descriptors for deformable shape correspondence. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/tpami.2013.148\">https://doi.org/10.1109/tpami.2013.148</a>","mla":"Litman, R., and Alex M. Bronstein. “Learning Spectral Descriptors for Deformable Shape Correspondence.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 36, no. 1, IEEE, 2014, pp. 171–80, doi:<a href=\"https://doi.org/10.1109/tpami.2013.148\">10.1109/tpami.2013.148</a>.","ama":"Litman R, Bronstein AM. Learning spectral descriptors for deformable shape correspondence. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2014;36(1):171-180. doi:<a href=\"https://doi.org/10.1109/tpami.2013.148\">10.1109/tpami.2013.148</a>","ieee":"R. Litman and A. M. Bronstein, “Learning spectral descriptors for deformable shape correspondence,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 36, no. 1. IEEE, pp. 171–180, 2014.","short":"R. Litman, A.M. Bronstein, IEEE Transactions on Pattern Analysis and Machine Intelligence 36 (2014) 171–180.","ista":"Litman R, Bronstein AM. 2014. Learning spectral descriptors for deformable shape correspondence. IEEE Transactions on Pattern Analysis and Machine Intelligence. 36(1), 171–180."},"extern":"1","doi":"10.1109/tpami.2013.148","month":"01","volume":36,"year":"2014","external_id":{"pmid":["24231874"]},"publisher":"IEEE","title":"Learning spectral descriptors for deformable shape correspondence","date_published":"2014-01-01T00:00:00Z","pmid":1,"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","language":[{"iso":"eng"}],"publication_status":"published","day":"01","status":"public","abstract":[{"lang":"eng","text":"Informative and discriminative feature descriptors play a fundamental role in deformable shape analysis. For example, they have been successfully employed in correspondence, registration, and retrieval tasks. In recent years, significant attention has been devoted to descriptors obtained from the spectral decomposition of the Laplace-Beltrami operator associated with the shape. Notable examples in this family are the heat kernel signature (HKS) and the recently introduced wave kernel signature (WKS). The Laplacian-based descriptors achieve state-of-the-art performance in numerous shape analysis tasks; they are computationally efficient, isometry-invariant by construction, and can gracefully cope with a variety of transformations. In this paper, we formulate a generic family of parametric spectral descriptors. We argue that to be optimized for a specific task, the descriptor should take into account the statistics of the corpus of shapes to which it is applied (the \"signal\") and those of the class of transformations to which it is made insensitive (the \"noise\"). While such statistics are hard to model axiomatically, they can be learned from examples. Following the spirit of the Wiener filter in signal processing, we show a learning scheme for the construction of optimized spectral descriptors and relate it to Mahalanobis metric learning. The superiority of the proposed approach in generating correspondences is demonstrated on synthetic and scanned human figures. We also show that the learned descriptors are robust enough to be learned on synthetic data and transferred successfully to scanned shapes."}],"intvolume":"        36","quality_controlled":"1"}