{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T13:19:29Z","timestamp":1762953569012,"version":"3.41.0"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2010,7,26]],"date-time":"2010-07-26T00:00:00Z","timestamp":1280102400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2010,7,26]]},"abstract":"<jats:p>We introduce the Symmetry Factored Embedding (SFE) and the Symmetry Factored Distance (SFD) as new tools to analyze and represent symmetries in a point set. The SFE provides new coordinates in which symmetry is \"factored out,\" and the SFD is the Euclidean distance in that space. These constructions characterize the space of symmetric correspondences between points -- i.e., orbits. A key observation is that a set of points in the same orbit appears as a clique in a correspondence graph induced by pairwise similarities. As a result, the problem of finding approximate and partial symmetries in a point set reduces to the problem of measuring connectedness in the correspondence graph, a well-studied problem for which spectral methods provide a robust solution. We provide methods for computing the SFE and SFD for extrinsic global symmetries and then extend them to consider partial extrinsic and intrinsic cases. During experiments with difficult examples, we find that the proposed methods can characterize symmetries in inputs with noise, missing data, non-rigid deformations, and complex symmetries, without a priori knowledge of the symmetry group. As such, we believe that it provides a useful tool for automatic shape analysis in applications such as segmentation and stationary point detection.<\/jats:p>","DOI":"10.1145\/1778765.1778840","type":"journal-article","created":{"date-parts":[[2010,7,15]],"date-time":"2010-07-15T12:48:46Z","timestamp":1279198126000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":54,"title":["Symmetry factored embedding and distance"],"prefix":"10.1145","volume":"29","author":[{"given":"Yaron","family":"Lipman","sequence":"first","affiliation":[{"name":"Princeton University"}]},{"given":"Xiaobai","family":"Chen","sequence":"additional","affiliation":[{"name":"Princeton University"}]},{"given":"Ingrid","family":"Daubechies","sequence":"additional","affiliation":[{"name":"Princeton University"}]},{"given":"Thomas","family":"Funkhouser","sequence":"additional","affiliation":[{"name":"Princeton University"}]}],"member":"320","published-online":{"date-parts":[[2010,7,26]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Belkin M. and Niyogi P. 2001. Laplacian eigenmaps and spectral techniques for embedding and clustering. In Advances in Neural Information Processing Systems 14 MIT Press 585--591. Belkin M. and Niyogi P. 2001. Laplacian eigenmaps and spectral techniques for embedding and clustering. In Advances in Neural Information Processing Systems 14 MIT Press 585--591.","DOI":"10.7551\/mitpress\/1120.003.0080"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2386410.2386412"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01410.x"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-008-0147-3"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.121"},{"key":"e_1_2_2_6_1","first-page":"21","article-title":"Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps","volume":"102","author":"Coifman R. R.","year":"2005","unstructured":"Coifman , R. R. , Lafon , S. , Lee , A. B. , Maggioni , M. , Nadler , B. , Warner , F. , and Zucker , S. W. 2005 . Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps . Proceedings of the National Academy of Sciences 102 , 21 (May), 7426--7431. Coifman, R. R., Lafon, S., Lee, A. B., Maggioni, M., Nadler, B., Warner, F., and Zucker, S. W. 2005. Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps. Proceedings of the National Academy of Sciences 102, 21 (May), 7426--7431.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(98)80010-1"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11744047_40"},{"key":"e_1_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Imiya A. Ueno T. and Fermin I. 1999. Symmetry detection by random sampling and voting process. In CIAP99 400--405. Imiya A. Ueno T. and Fermin I. 1999. Symmetry detection by random sampling and voting process. In CIAP99 400--405.","DOI":"10.1109\/ICIAP.1999.797628"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1050-5"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1057432.1057448"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.20"},{"volume-title":"European Conference on Computer Vision, 546--555","author":"Leung T.","key":"e_1_2_2_13_1","unstructured":"Leung , T. , and Malik , J . 1996. Detecting, localizing and grouping repeated scene elements from an image . In European Conference on Computer Vision, 546--555 . Leung, T., and Malik, J. 1996. Detecting, localizing and grouping repeated scene elements from an image. In European Conference on Computer Vision, 546--555."},{"key":"e_1_2_2_14_1","unstructured":"Li W. Zhang A. and Kleeman L. 2005. Fast global reflectional symmetry detection for robotic grasping and visual tracking. In ACRA05. Li W. Zhang A. and Kleeman L. 2005. Fast global reflectional symmetry detection for robotic grasping and visual tracking. In ACRA05."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11802914_19"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1531326.1531378"},{"key":"e_1_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Liu S. Martin R. Langbein F. and Rosin P. 2007. Segmenting periodic reliefs on triangle meshes. In Math. of Surfaces XII Springer 290--306. Liu S. Martin R. Langbein F. and Rosin P. 2007. Segmenting periodic reliefs on triangle meshes. In Math. of Surfaces XII Springer 290--306.","DOI":"10.1007\/978-3-540-73843-5_18"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141924"},{"key":"e_1_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Nadler B. Lafon S. Coifman R. R. and Kevrekidis I. G. 2005. Diffusion maps spectral clustering and reaction coordinates of dynamical systems. ArXiv Mathematics e-prints. Nadler B. Lafon S. Coifman R. R. and Kevrekidis I. G. 2005. Diffusion maps spectral clustering and reaction coordinates of dynamical systems. ArXiv Mathematics e-prints.","DOI":"10.1016\/j.acha.2005.07.004"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1731309.1731314"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360642"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1080\/10586458.1993.10504266"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141923"},{"volume-title":"Int. Conf. on Comp. Vis.","author":"Raviv D.","key":"e_1_2_2_24_1","unstructured":"Raviv , D. , Bronstein , A. , Bronstein , M. , and Kimmel , R . 2007. Symmetries of non-rigid shapes . In Int. Conf. on Comp. Vis. Raviv, D., Bronstein, A., Bronstein, M., and Kimmel, R. 2007. Symmetries of non-rigid shapes. In Int. Conf. on Comp. Vis."},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01418978"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-008-0225-0"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_2_2_28_1","unstructured":"Shikhare D. Bhakar S. and Mudur S. 2001. Compression of large 3d engineering models using automatic discovery of repeating geometric features. 233--240. Shikhare D. Bhakar S. and Mudur S. 2001. Compression of large 3d engineering models using automatic discovery of repeating geometric features. 233--240."},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1618452.1618484"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(99)00138-5"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1021\/ja00071a042"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1778765.1778840","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1778765.1778840","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:47Z","timestamp":1750246787000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1778765.1778840"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,26]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,7,26]]}},"alternative-id":["10.1145\/1778765.1778840"],"URL":"https:\/\/doi.org\/10.1145\/1778765.1778840","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"type":"print","value":"0730-0301"},{"type":"electronic","value":"1557-7368"}],"subject":[],"published":{"date-parts":[[2010,7,26]]},"assertion":[{"value":"2010-07-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}