Description and recognition of curved objects

The author presents an approach to the approximation of curves for the description and recognition of curved objects. One needs only to make a rotation and a scaling respectively to a circular arc to find the longest arc of the approximation of the part of a curve which might contain linear segments. As all points in the curve are independent from each other in computing, it is easy to use a parallel algorithm for fast computing. Experiments on several high resolution tactile images show the algorithm behaves well. This method can also be extended to the recognition of occluded curved objects.<<ETX>>

[1]  Yoshisuke Kurozumi,et al.  Polygonal approximation by the minimax method , 1982, Comput. Graph. Image Process..

[2]  S. Honnenahalli,et al.  Piecewise representation of curves with concatenated arcs via detection of appropriate break points , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[3]  W. Eric L. Grimson,et al.  On the recognition of curved objects , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[4]  James George Dunham,et al.  Optimum Uniform Piecewise Linear Approximation of Planar Curves , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Urs Ramer,et al.  An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..