2009 16th IEEE International Conference on Image Processing (ICIP) 2009
DOI: 10.1109/icip.2009.5413905
|View full text |Cite
|
Sign up to set email alerts
|

Genetic algorithms for 3d reconstruction with supershapes

Abstract: Supershape model is a recent primitive that represents numerous 3D shapes with several symmetry axes. The main interest of this model is its capability to reconstruct more complex shape than superquadric model with only one implicit equation. In this paper we propose a genetic algorithms to reconstruct a point cloud using those primitives. We used the pseudo-Euclidean distance to introduce a threshold to handle real data imperfection and speed up the process. Simulations using our proposed fitness functions an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(9 citation statements)
references
References 21 publications
0
9
0
Order By: Relevance
“…To alleviate this, Vaskevicius and Birk [29] introduced a numerically stable method of computing the gradient of the inside-outside function with respect to the superquadric parameters, making possible to better model shapes, such as cuboids and cylinders. Others have approached the recovery procedure from another perspective, for example, by using genetic algorithms [11]. Extensions to superquadrics were also proposed [30], [31], but ultimately these also relied on iterative optimization procedures during recovery, which stalled further development in this direction.…”
Section: A Superquadric Recoverymentioning
confidence: 99%
“…To alleviate this, Vaskevicius and Birk [29] introduced a numerically stable method of computing the gradient of the inside-outside function with respect to the superquadric parameters, making possible to better model shapes, such as cuboids and cylinders. Others have approached the recovery procedure from another perspective, for example, by using genetic algorithms [11]. Extensions to superquadrics were also proposed [30], [31], but ultimately these also relied on iterative optimization procedures during recovery, which stalled further development in this direction.…”
Section: A Superquadric Recoverymentioning
confidence: 99%
“…Other researchers have tried to improve this method in various ways, for example in modifying the fitting function [12], or using multiresolution [13] but still essentially relying on iterative methods of minimizing the fitting function. Instead of gradient least-squares minimization, other methods of minimization have also been tried, such as genetic algorithms [14]. Several extensions of superquadrics were proposed in the literature [15], [16], however, the basic superquadric shape model and the recovery method of Solina and Bajcsy prevailed in most applications of superquadrics, in particular for path and grasp planning in robotics, for modelling and interpretation of medical images etc.…”
Section: Related Workmentioning
confidence: 99%
“…Bokhabrine et al [8] used a GA to evolve all supershape parameters for surface reconstruction (i.e., a target-based approach) using an inside-outside function [20] for fitness. Voisin et al [79] later extended this to utilise a pseudo-Euclidean distance for fitness determination, yielding improved performance.…”
Section: Gielis Superformulamentioning
confidence: 99%