Ajuste de curvas y superficies por polinomios implícitos
Palabras clave:
Ajuste, Polinomio Implícito, Estabilidad, MetaheurísticaResumen
La búsqueda de un polinomio implícito que aproxime cierto conjunto de observaciones X es el objetivo de muchas investigaciones en los últimos años. Sin embargo, la gran mayoría de los algoritmos de ajuste existentes presuponen el conocimiento del grado del polinomio implícito que mejor representa a los puntos. Este trabajo propone un algoritmo capaz de determinar el grado del polinomio necesario para la representación del conjunto de datos. Para este fin, se define una novedosa medida de distancia entre X y el polinomio implícito. El algoritmo planteado se basa en la idea de ir incrementando paulatinamente el grado, mientras haya una mejora en la suavidad de las soluciones.
Descargas
Citas
Large Geometric Models Archive. http://www.cc.gatech.edu/projects/large_models/, consultado el 2015-05-05.
The Stanford 3D Scanning Repository.http://graphics.stanford.edu/data/3Dscanrep/, consultado el 2015-05-05.
A. Ben-Israel. Generalized Inverses: Theory and Applications. Second edition, 2001.
H. Ben-Yaacov. Recognition of 3d objects based on implicit polynomials. Irwin and Joan Jacobs Center for Communication and Information Technologies, 2009.
M. Berger, J. Levine, L. Gustavo Nonato, G. Taubin, and C. T. Silva. An end-to-end framework for evaluating surface reconstruction. Scientific Computing and Imaging Institute, 2011.
M. M. Blane. The 3l algorithm for fitting implicit polynomial curves and surfaces to data. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22:298–313, March 2000.
R. Eberhart and Y. Shi. Comparing inertia weights and constriction factors in particle swarm optimization. Proceedings of the Congress on Evolutionary Computation, 1:84–88, 2000.
G. Golub. Matrix Computations. The Johns Hopkins University Press, third edition, 1996.
J. Kennedy and R. Eberhart. Particle swarm optimization. IEEE International Conference on Neural Networks, Proceedings, 4, December 1995.
Z. Landa. 2d object description and recognition based on contour matching by implicit polynomials. 2006.
V. Mederos and J. Estrada. A new algorithm to compute the euclidean distance from a point to a conic. Investigación Operacional, 23, 2002.
M. Pedersen. Good parameters for particle swarm optimization. 2010.
M.J. Polo-Corpa. Curve fitting using heuristics and bioinspired optimization algorithms for experimental data processing in chemistry. Chemometrics and Intelligent Laboratory Systems, 96:34–42, 2009.
K. Price and R. Storn. Differential Evolution - A Practical Approach to Global Optimization. Springer, 2006.
M. Rouhani. Implicit polynomial representation through a fast fitting error estimation. IEEE Transactions on Image Processing, April 2012.
M. Rouhani. The richer representation the better registration. IEEE Transactions on Image Processing, 22, December 2013.
T. Sahin. Fitting globally stabilized algebraic surfaces to range data. IEEE International Conference on Computer Vision, 2, 2005.
P. Schenzel. On the interactive visualization of implicit surfaces. Martin-Luther University Halle Press, September 2012.
R. Storn and K. Price. Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11, 1997.
E. Talbi. Metaheuristics from design to implementation. John Wiley & Sons, Inc., 2009.
T. Tasdizen. Improving the stability of algebraic curves for applications. IEEE Transactions on Image Processing, 9:405–416, March 2000.
G. Taubin. Nonplanar curve and surface estimation in 3-space. International Conference on Robotics and Automation, Proceedings, IEEE, pages 644–645, April 1988.
G. Taubin. Estimation of planar curves, surfaces, and nonplanar space curves defined by implicit equations with applications to edge and range image segmentation. Pattern Analysis and Machine Intelligence, IEEE, 13:1115–1138, November 1991.
G. Taubin. Object recognition based on moment (or algebraic) invariants. Geometric Invariance in Computer Vision, pages 375–397, 1992.
G. Taubin. Distance approximations for rasterizing implicit curves. ACM Transactions on Graphics, 13, January 1994.
G. Taubin. Parameterized families of polinomials for bounded algebraic curve and surface fitting. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16, March 1994.
G. Taubin and D. Cooper. Symbolic and Numerical Computation for Artificial Intelligence. Academic Press, 1992.
B. Zheng. 2D Curve and 3D Surface Representation using Implicit Polynomial and its Applications. PhD thesis, University of Tokyo, June 2008.
B. Zheng. An adaptive and stable method for fitting implicit polynomial curves and surfaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32, 2010.
B. Zheng. Breast MR image fusion by deformable implicit polynomial (dip). IPSJ Transactions on Computer Vision and Applications, 5, July 2013.
Descargas
Publicado
Versiones
- 2024-03-28 (3)
- 2024-03-21 (2)
- 2024-03-18 (1)
Cómo citar
Número
Sección
Licencia
Derechos de autor 2024 Ciencias Matemáticas
Esta obra está bajo una licencia internacional Creative Commons Atribución 4.0.
Esta licencia permite copiar y redistribuir el material en cualquier medio o formato bajo los siguientes términos: se debe dar crédito de manera adecuada, no se puede hacer uso del material con propósitos comerciales, y si remezcla, transforma o crea a partir del material, no podrá distribuir el material modificado. Bajo la licencia mencionada, los autores mantienen los derechos de autor de su trabajo.
