skip to main content
10.1145/1244002.1244018acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

A randomized knot insertion algorithm for outline capture of planar images using cubic spline

Authors Info & Claims
Published:11 March 2007Publication History

ABSTRACT

The proposed work, in this paper, is concerned with an efficient technique of curve fitting using cubic splines. The technique has various phases including extracting outlines of images, detecting corner points from the detected outline, addition of extra knot points if needed. The last phase makes a significant contribution by making the technique automated. It uses the idea of knot insertion in a randomized manner. The proposed algorithm is an iterative one. The algorithm proposed is computationally efficient as compared to least square approach.

References

  1. Chetrikov, D. and Zsabo, S., A Simple and Efficient Algorithm for Detection of High Curvature Points in Planar Curves, In Proceedings of the 23rd Workshop of the Australian Pattern Recognition Group, 1999, 1751-2184.Google ScholarGoogle Scholar
  2. Wang, W., Pottmann, H., and Liu, Y., Fitting B-Spline Curves to Point Clouds by Squared Distance Minimization, HKU CS Tech Report TR-2004-11, 2004.Google ScholarGoogle Scholar
  3. Goshtasby A. A., Grouping and Parameterizing Irregularly Spaced Points for Curve Fitting, ACM Transactions on Graphics, 2000, 185-203. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Sarfraz, M. and Khan, M. A., An Automatic Algorithm for Approximating Boundary of Bitmap Characters, Future Generation Computer Systems, 2004, 1327-1336. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Sarfraz, M., Some Algorithms for Curve Design and Automatic Outline Capturing of Images, International Journal of Image and Graphics, 2004, 301--324.Google ScholarGoogle Scholar
  6. Hou, Z. J. and Wei, G. W., A New Approach to Edge Detection, Pattern Recognition, 2002, 1559--1570.Google ScholarGoogle Scholar
  7. Reche, P., Urdiales, C., Bandera, A., Trazegnies, C. and Sandoval, F., Corner Detection by Means of Contour Local Vectors, Electronic Letters, 2002, 38(14).Google ScholarGoogle ScholarCross RefCross Ref
  8. Marji, M. and Siv, P., A New Algorithm for Dominant Points Detection and Polygonization of Digital Curves, Pattern Recognition, 2003, 2239--2251.Google ScholarGoogle Scholar
  9. Sarfraz, M. and Raheem, M. A., Curve Designing Using a Rational Cubic Spline with Point and Interval Shape Control, IEEE Conference on Digital Object Identifier, Information Visualization, 2000, 63--68. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Wu-Chih Hu, Multiprimitive Segmentation Based on Meaningful Breakpoints for Fitting Digital Planar Curves with Line Segments and Conic Arcs, Image and Vision Computing, 2005, 783--789. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Kano, H., Nakata, H. and Martin, C. F., Optimal Curve Fitting and Smoothing using Normalized Uniform B-Splines: A Tool for Studying Complex Systems, Applied Mathematics and Computation, 2005, 96--128.Google ScholarGoogle Scholar
  12. Yang, Z., Deng, J., and Chen, F., Fitting Unorganized Point Clouds with Active Implicit B-Spline Curves, Visual Computer, 2005, 831--839.Google ScholarGoogle Scholar
  13. Lavoue, G., Dupont, F. and Baskurt, A., A New Subdivision Based Approach for Piecewise Smooth Approximation of 3D Polygonal Curves, Pattern Recognition, 2005, 1139--1151. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Yang, H., Wang, W., and Sun, J., Control Point Adjustment for B-Spline Curve Approximation, Computer Aided Design, 2004, 639--652.Google ScholarGoogle Scholar
  15. Yang, X., Curve Fitting and Fairing using Conic Spines, Computer Aided Design, 2004, 461--472.Google ScholarGoogle Scholar
  16. Sarfraz, M., Asim, M. R. and Masood, A., Piecewise Polygonal Approximation of Digital Curves, Eigth International Conference on Information Visualization, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Horng, J. H., An Adaptive Smooting Approach for Fitting Digital Planar Curves with Line Segments and Circular Arcs, Pattern Recognition Letters, 2003, 565--577. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Sarkar, B., Singh, L. K., Sarkar, D., Approximation of Digital Curves with Line Segments and Circular Arcs using Genetic Algorithms, Pattern Recognition Letters, 2003, 2585--2595. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Carr, J. C., Beatson, R. K, Cherrie, J. B., Mitchell, T. J., Fright, W. R., McCallum, B. C., and Evans, T. R., Reconstruction and Representation of 3D Objects with Radial Basis Functions, In Proceedings of SIGGRAPH 01, 6776, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Juttler, B., and Felis, A., A Least Square Fitting of Algebraic Spline Surfaces, Advance Computer Mathematics, 2002, 135--152.Google ScholarGoogle Scholar
  21. Morse, B. S., Yoo, T. S., Chen, D. T., Rheingans, P., and Subramanian, K. R., Interpolating Implicit Surfaces from Scattered Surface Data using Compactly Supported Radial Basis Functions, In SMI 01 Proceedings of the International Conference on Shape Modeling and Applications, 8998, IEEE Computer Society, Washington DC, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Yang, X. N. and Wang G. Z., Planar Point Set Fairing and Fitting by Arc Splines, Computer Aided Design, 2001, 35--43.Google ScholarGoogle Scholar

Index Terms

  1. A randomized knot insertion algorithm for outline capture of planar images using cubic spline

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SAC '07: Proceedings of the 2007 ACM symposium on Applied computing
        March 2007
        1688 pages
        ISBN:1595934804
        DOI:10.1145/1244002

        Copyright © 2007 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 11 March 2007

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate1,650of6,669submissions,25%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader