Skip to main content

B-spline Surface Approximation Using Hierarchical Genetic Algorithm

  • Conference paper
  • 2403 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8266))

Abstract

Surface approximation using splines has been widely used in geometric modeling and image analysis. One of the main problems associated with surface approximation by splines is the adequate selection of the number and location of the knots, as well as, the solution of the system of equations generated by tensor product spline surfaces. In this work, we use a hierarchical genetic algorithm (HGA) to tackle the B-spline surface approximation problem. The proposed approach is based on a novel hierarchical gene structure for the chromosomal representation, which allows us to determine the number and location of the knots for each surface dimension, and the B-spline coefficients simultaneously. Our approach is able to find solutions with fewest parameters within of the B-spline basis functions. The method is fully based on genetic algorithms and does not require subjective parameters like smooth factor or knot locations to perform the solution. In order to validate the efficacy of the proposed approach, simulation results from several tests on smooth surfaces have been included.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Shepard, D.: A two-dimensional interpolation function for irregularly-spaced data. In: Proceedings of the 1968 23rd ACM National Conference, ACM 1968, pp. 517–524. ACM, New York (1968)

    Google Scholar 

  2. Olshanskii, M.A., Reusken, A., Grande, J.: A Finite Element Method for Elliptic Equations on Surfaces. SIAM Journal on Numerical Analysis 47, 3339–3358 (2009)

    Google Scholar 

  3. Cohen, L.D., Cohen, I.: Finite-element methods for active contour models and balloons for 2-D and 3-D images. IEEE Transactions on Pattern Analysis and Machine Intelligence 15, 1131–1147 (1993)

    Google Scholar 

  4. Lee, T.C.M.: On algorithms for ordinary least squares regression spline fitting: a comparative study. Journal of Statistical Computation and Simulation 72, 647–663 (2002)

    Google Scholar 

  5. Mazroui, A., Mraoui, H., Sbibih, D., Tijini, A.: A new method for smoothing surfaces and computing hermite interpolants. BIT Numerical Mathematics 47, 613–635 (2007)

    Google Scholar 

  6. Schütze, T., Schwetlick, H.: Bivariate free knot splines. BIT Numerical Mathematics 43, 153–178 (2003)

    Google Scholar 

  7. Yoshimoto, F., Moriyama, M., Harada,T.: Automatic knot placement by a genetic algorithm for data fitting with a spline. In: Proceedings of the International Conference on Shape Modeling and Applications, SMI 1999, p. 162. IEEE Computer Society, Washington, DC (1999)

    Google Scholar 

  8. De Boor, C.: On calculating with b-spline. Journal of Approximation Theory 6, 50–62 (1972)

    Google Scholar 

  9. De Boor, C.: A Practical Guide to Splines. Springer, New York (1978)

    Google Scholar 

  10. Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. The MIT Press (1992)

    Google Scholar 

  11. Man, K.F., Tang, K.S., Kwong, S.: Genetic Algorithms: Concepts and Designs with Disk. Springer-Verlag New York, Inc., Secaucus (1999)

    Google Scholar 

  12. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Professional (1989)

    Google Scholar 

  13. Deb, K., Agrawal, R.B.: Simulated binary crossover for continuous search space. Complex Systems 9, 115–148 (1995)

    Google Scholar 

  14. Hwang, J.N., Lay, S.R., Maechler, M., Martin, R., Schimert, J.: Regression modeling in back-propagation and projection pursuit learning. IEEE Transactions on Neural Networks 5, 342–353 (1994)

    Google Scholar 

  15. Denison, D.G.T., Mallick, B.K., Smith, A.F.M.: Bayesian mars. Statistics and Computing 8, 337–346 (1998)

    Google Scholar 

  16. Cleveland, W.S.: Robust Locally Weighted Regression and Smoothing Scatterplots. Journal of the American Statistical Association 74, 829–836 (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Trejo-Caballero, G., Garcia-Capulin, C.H., Ibarra-Manzano, O.G., Avina-Cervantes, J.G., Burgara-Lopez, L.M., Rostro-Gonzalez, H. (2013). B-spline Surface Approximation Using Hierarchical Genetic Algorithm. In: Castro, F., Gelbukh, A., González, M. (eds) Advances in Soft Computing and Its Applications. MICAI 2013. Lecture Notes in Computer Science(), vol 8266. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45111-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45111-9_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45110-2

  • Online ISBN: 978-3-642-45111-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics