390 likes | 499 Views
This paper presents a novel approach to symmetrizing 3D geometry by minimally deforming models in the spatial domain through optimization in transformation space. We provide a closed-form solution for symmetrizing point sets based on explicit point-pairing and introduce an algorithm that utilizes transformation domain reasoning to guide shape deformation. Key applications include symmetric remeshing and automatic correspondence detection for articulated bodies. Our method builds on prior work in symmetry detection and clustering, offering improved results for extracting symmetries in 3D geometries.
E N D
Symmetrization Niloy J. MitraLeonidas J. Guibas Mark Pauly TU Vienna Stanford University ETH Zurich SIGGRAPH 2007
Types of Symmetry • Invariance under a class of transformations
Symmetrization • Goal: Symmetrize 3D geometry • Approach: Minimally deform the model in the spatial domain by optimizing the distribution in transformation space
Contributions • Given an explicit point‐pairing, a closed form solution for symmetrizing the point set • A symmetrization algorithm that uses transform domain reasoning to guide shape deformation in object domain • Applications: • Extend the types of detected symmetries • Symmetric remeshing • Automatic correspondence for articulated bodies
Prior Work: Symmetry Detection • Mitra, Guibas, Pauly: Partial and Approximate Symmetry Detection for 3d Geometry. ACM Trans. Graph. 25, 3, 2006
Prior Work: Pair pruning • Initial pairs are sampled randomly • Pruning based on curvature and normal
Prior Work: Clustering • Use mean-shift algorithm • Non-Parametric Density Estimation Tessellate the space with windows The blue data points were traversed by the windows towards the mode Run the procedure in parallel
Prior Work: Verification • Goal : Extracting the connected components of the model from cluster • Starting with a random point of cluster • Corresponds to a pair (pi, pj) of points on the model surface • Look at the one-ring neighbors pi and apply T • Check distances of the transformed points to the surface around pj
2D Example: Symmetry Detection Transformation space d
2D Example: Voting Continues • Pairs of sample points define reflective symmetry transform
2D Example: Density Plot • Density plot → accumulation of symmetry evidence
2D Example: Density Peaks • Density cluster → reflective symmetry
2D Example: Symmetry Detection A set of potential corresponding point pairs extracted
2D Example: Local Symmetrization Cluster contraction Local symmetrization Cluster contraction in transform space Constrained deformation in object space
Recap • Object space point pairs → points in transform space • Cluster in transform space corresponds to approximate symmetry • Cluster contraction in transform space corresponds to constrained in deformation in object space that enhances object symmetry
2D Example: Global Symmetrization Cluster merging → global symmetrization
2D Example: Global Symmetrization Cluster merging/contraction → Global symmetrization
Sub‐problems • Local Symmetrization • Cluster contraction How to deform in the spatial domain ? Where to move in transform space ? • Global Symmetrization • Cluster merging
Optimal Displacements • Goal: Minimally displace two points to make them symmetric with respect to a given transformation [Zabrodsky et al. 1997]
Optimal Transformation • Goal: Find optimal transformation and minimal displacements for a set of point‐pairs
Optimal Transformation • Reflection • Minimize energy • Reduced to eigenvalue problem • Rigid Transform • Minimize energy • SVD problem
Optimization • Initial random sampling does not respect symmetries. • The correspondences estimated during the symmetry detection stage are potentially inaccurate and incomplete
Optimizing Sample Positions • Every sample p shifted in the direction of displacement dp (white circle) • Project them onto the surface (colored square) • The procedure is iterated until the variance of the cluster is no longer reduced.
Sub‐problems • Local Symmetrization • Cluster contraction Where to move in transform space ? How to deform in the spatial domain ? Optimal transformation • Global Symmetrization • Cluster merging
Symmetrizing Deformation • Using existing shape deformation method • Symmetrizing displacements positional constraints • 2D : As-rigid-as-possible shape manipulation method[Igarashi et al.2005] • 3D : Non-linear PriMo deformation model [Botsch et al. 2006] As-Rigid-As-Possible Shape Manipulation [Igarashi 2005] PriMo: Coupled Prisms for Intuitive Surface Modeling [Botsch 2006]
Contracting Clusters • Find sample pairs • Optimize sample positions on surface • Compute the optimaltransformation • Update pi : • pare used as deformation constraints • Re-compute the optimal transformation • Find new sample pairs every 5 time step
Merging Clusters • Sort clusters by height • Select the most pronounced cluster for symmetrization • Apply the symmetrizing deformation • Repeat the process with next biggest cluster • Finally, Merge clusters based on distance greedily
Control • User controls the deformation by modifying the stiffness of the shape’s material • Soft materials allow for better symmetrization • Stiffer materials more strongly resist the symmetrizing deformation • System allow spatially varying stiffness • User controls the symmetrization by interactively selecting clusters for contraction or merging
Results - Symmetric Meshing Symmetry Based Remeshing [Podolak al SGP 2007]
Limitations • Some case, method is fails to process the entire model • The front feet of the bunny and the right foot of the male character • Small-scale features are sometimes ignored Insufficient local matching • The deformation model does not respect the semantics of the shape.
Conclusion • Symmetrizationalgorithm • Robust and efficient, requires minimal user intervention • Handle both local and global symmetries • Future Work • Symmetry respecting geometry processing • Hierarchical shape semantics • Perception, art, design • Other data, e.g. motion data, derived spaces