Fast and Accurate Intrinsic Symmetry Detection

  title={Fast and Accurate Intrinsic Symmetry Detection},
  author={Rajendra Nagar and Shanmuganathan Raman},
In computer vision and graphics, various types of symmetries are extensively studied since symmetry present in objects is a fundamental cue for understanding the shape and the structure of objects. In this work, we detect the intrinsic reflective symmetry in triangle meshes where we have to find the intrinsically symmetric point for each point of the shape. We establish correspondences between functions defined on the shapes by extending the functional map framework and then recover the point… 
Intrinsic Symmetry Detection on 3D Models with Skeleton‐guided Combination of Extrinsic Symmetries
This work proposes to decompose the model into convex parts, and use the similar structures of the skeleton of the model to guide combination of extrinsic symmetries between convex part for intrinsic symmetry detection, and gives up statistical computation for intrinsic symmetric detection.
Deep Functional Maps for Simultaneously Computing Direct and Symmetric Correspondences of 3D Shapes
We introduce a novel method of isometric correspondences for 3D shapes, designed to address the problem of multiple solutions associated with deep functional maps when matching shapes with
Robust, fast and flexible symmetry plane detection based on differentiable symmetry measure
A novel differentiable symmetry measure, which allows using gradient-based optimization to find symmetry in geometric objects and performs well on perfectly as well as approximately symmetrical objects, and is robust to noise and to missing parts.
MapTree: Recovering Multiple Solutions in the Space of Maps
This paper proposes a compact tree structure based on the spectral map representation for encoding and enumerating possible rough initializations, and a novel efficient approach for refining them to dense pointwise maps and leads to the first method capable of both producing multiple high-quality correspondences across shapes and revealing the symmetry structure of a shape without a priori information.
Learning-based Intrinsic Reflectional Symmetry Detection.
This paper proposes a learning-based approach to intrinsic reflectional symmetry detection, which is over 20 times faster than state-of-the-art methods, and meanwhile, is more robust, achieving higher correspondence accuracy in commonly used metrics.
ZoomOut: Spectral Upsampling for Efficient Shape Correspondence
It is shown that high quality maps can be obtained even if the input correspondences are noisy or are encoded by a small number of coefficients in a spectral basis, and the method is both robust to noisy input and scalable with respect to shape complexity.
Robust Estimation of Reflection Symmetry in Noisy and Partial 3D Point Clouds
This work proposes a statistical estimator for the plane of reflection symmetry that is robust to outliers and missing parts and poses the problem of finding the optimal estimator as an optimization problem on a 2-sphere that quickly converges to the global solution.
Skeleton Extraction Algorithm Based on Partial Intrinsic Symmetry
  • Fangjun Yi, Renyi Zhou
  • Computer Science
    2019 IEEE 4th International Conference on Signal and Image Processing (ICSIP)
  • 2019
This paper proposes two methods for calculating the Symmetrical Weighting Degree based on the distances between the pair of points in the sets, and illustrates the algorithm by applying it on three-dimensional and high-dimensional data, which verifies its outstanding performances in detailed structures preservation, local symmetry centers extraction, robustness and so on.
Globally optimal point set registration by joint symmetry plane fitting
The present work proposes a solution to the challenging problem of registering two partial point sets of the same object with very limited overlap by jointly optimizing the relative pose and symmetry plane parameters, and notably does so under global optimality by employing the branch-and-bound (BnB) paradigm.
Learning-based Real-time Detection of Intrinsic Reflectional Symmetry
A learning-based approach to intrinsic reflectional symmetry detection by avoiding random sampling, which is over 100 times faster than state-of-the-art methods, and meanwhile, is more robust, achieving higher correspondence accuracy in commonly used metrics.


Generalized intrinsic symmetry detection
This work develops an algorithm for the case of approximately isometric deformations, based on matching graphs of surface feature lines that are annotated with intrinsic geometric properties, which allows for detecting partial intrinsic as well as more general, non-isometric symmetries.
Characterization of Partial Intrinsic Symmetries
This work presents a mathematical framework and algorithm for characterizing and extracting partial intrinsic symmetries of surfaces, which is a fundamental building block for many modern geometry processing algorithms and does not rely on feature points, voting or probabilistic schemes.
Approximate Symmetry Detection in Partial 3D Meshes
This paper proposes a vote‐based approach to detect symmetry in 3D shapes, with special interest in models with large missing parts and shows the applicability of the algorithm in the repair and completion of challenging reassembled objects in the context of cultural heritage.
A planar-reflective symmetry transform for 3D shapes
This paper describes a planar reflective symmetry transform (PRST) that captures a continuous measure of the reflectional symmetry of a shape with respect to all possible planes and uses the transform to define two new geometric properties, center of symmetry and principal symmetry axes.
Global Intrinsic Symmetries of Shapes
An algorithm is devised which detects and computes the isometric mappings from the shape onto itself and is both computationally efficient and robust with respect to small non‐isometric deformations, even if they include topological changes.
Probably Approximately Symmetric: Fast Rigid Symmetry Detection With Global Guarantees
This work presents a fast algorithm for global rigid symmetry detection with approximation guarantees, and proves that the density of the sampling depends on the total variation of the shape, allowing for formal bounds on the algorithm's complexity and approximation quality.
Möbius Transformations For Global Intrinsic Symmetry Analysis
The algorithm is able to find intrinsic symmetries for a wide variety of object types with moderate deviations from perfect symmetry and the main advantages stem from the stability of the AGD in predicting potential symmetric point features and the low dimensionality of the Möbius group for enumerating potential self‐mappings.
Shape Analysis with Subspace Symmetries
This work introduces subspace symmetries whereby it characterize similarity by requiring the set of symmetric parts to form a low dimensional shape space and computes dense correspondences that can be used in various applications, such as model repair and denoising.
Group Representation of Global Intrinsic Symmetries
It is proved that the group representation of each symmetry can be uniquely determined from a small number of symmetric pairs of points under certain conditions, where the number of pairs is equal to the maximum multiplicity of eigenvalues of the Laplace‐Beltrami operator.
Functional maps
A novel representation of maps between pairs of shapes that allows for efficient inference and manipulation and supports certain algebraic operations such as map sum, difference and composition, and enables a number of applications, such as function or annotation transfer without establishing point-to-point correspondences.