scispace - formally typeset
Open AccessJournal ArticleDOI

Detecting Approximate Reflection Symmetry in a Point Set Using Optimization on Manifold

TLDR
The robustness of the approach is shown by varying the amount of distortion in a perfect reflection symmetry pattern where the authors perturb each point by a different amount of perturbation, and the effectiveness of the method is demonstrated by applying it to the problem of 2-D and 3-D reflection symmetry detection.
Abstract
We propose an algorithm to detect approximate reflection symmetry present in a set of volumetrically distributed points belonging to $\mathbb {R}^d$ containing a distorted reflection symmetry pattern. We pose the problem of detecting approximate reflection symmetry as the problem of establishing correspondences between the points which are reflections of each other and we determine the reflection symmetry transformation. We formulate an optimization framework in which the problem of establishing the correspondences amounts to solving a linear assignment problem and the problem of determining the reflection symmetry transformation amounts to solving an optimization problem on a smooth Riemannian product manifold. The proposed approach estimates the symmetry from the geometry of the points and is descriptor independent. We evaluate the performance of the proposed approach on the standard benchmark dataset and achieve the state-of-the-art performance. We further show the robustness of our approach by varying the amount of distortion in a perfect reflection symmetry pattern where we perturb each point by a different amount of perturbation. We demonstrate the effectiveness of the method by applying it to the problem of 2-D (two-dimensional) and 3-D reflection symmetry detection along with comparisons.

read more

Citations
More filters
Journal ArticleDOI

3DSymm: Robust and Accurate 3D Reflection Symmetry Detection

TL;DR: This work proposes a descriptor-free approach, in which, the problem of reflection symmetry detection as an optimization problem and provide a closed-form solution, and shows that the proposed method achieves state-of-the-art performance on the standard dataset.
Posted Content

R-PointHop: A Green, Accurate and Unsupervised Point Cloud Registration Method.

TL;DR: R-PointHop as discussed by the authors determines a local reference frame (LRF) for every point using its nearest neighbors and finds its local attributes by point downsampling, neighborhood expansion, attribute construction and dimensionality reduction steps.
Journal ArticleDOI

R-PointHop: A Green, Accurate, and Unsupervised Point Cloud Registration Method

TL;DR: R-PointHop as discussed by the authors determines a local reference frame (LRF) for every point using its nearest neighbors and finds local attributes by point downsampling, neighborhood expansion, attribute construction and dimensionality reduction steps.
Journal ArticleDOI

Reflection symmetry aware image retargeting

TL;DR: A novel image Retargeting approach which preserves the reflection symmetry present in the image during the image retargeting process and shows better preservation of symmetry axis, preservation of shape of the symmetric object, and quality of image retTargeting when compared to the existing methods.
Journal ArticleDOI

Reflection symmetry detection of shapes based on shape signatures

TL;DR: Wang et al. as mentioned in this paper presented two shape signature-based reflection symmetry detection methods with their theoretical underpinning and empirical evaluation, which can effectively deal with compound shapes which are challenging for traditional contour-based methods.
References
More filters
Proceedings ArticleDOI

Method for registration of 3-D shapes

TL;DR: In this paper, the authors describe a general purpose representation independent method for the accurate and computationally efficient registration of 3D shapes including free-form curves and surfaces, based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point.
Journal ArticleDOI

Convergence of a block coordinate descent method for nondifferentiable minimization

TL;DR: In this article, the convergence properties of a block coordinate descent method applied to minimize a non-convex function f(x1,.., x 2, N 3 ) with certain separability and regularity properties were studied.
Proceedings ArticleDOI

A new polynomial-time algorithm for linear programming

TL;DR: The algorithm consists of repeated application of such projective transformations each followed by optimization over an inscribed sphere to create a sequence of points which converges to the optimal solution in polynomial-time.
Proceedings ArticleDOI

The Princeton Shape Benchmark

TL;DR: It is concluded that no single descriptor is best for all classifications, and thus the main contribution of this paper is to provide a framework to determine the conditions under which each descriptor performs best.
Journal Article

Manopt, a matlab toolbox for optimization on manifolds

TL;DR: The Manopt toolbox as discussed by the authors is a user-friendly, documented piece of software dedicated to simplify experimenting with state-of-the-art Riemannian optimization algorithms.
Related Papers (5)