This Article 
 Bibliographic References 
 Add to: 
On Navigating Between Friends and Foes
June 1991 (vol. 13 no. 6)
pp. 602-606

The problem of determining the optimal straight path between a planar set of points is considered. Each point contributes to the cost of a path a value that depends on the distance between the path and the point. The cost function, quantifying this dependence, can be arbitrary and may be different for different points. An algorithm to solve this problem using an extension of the Hough transform is described. The range of applications includes straight-line fitting to a set of points in the presence of outliers, navigation, and path planning. The proposed extended Hough transform can be tuned to equivalent to well-known robust least-squares techniques, and allows efficient, approximate M-estimation.

[1] R.O. Duda and P.E. Hart, "Use of the Hough transformation to detect lines and curves in pictures,"Commun. Ass. Comput. Mach., vol. 15, no. 1, pp. 11-15, Jan. 1972.
[2] J. Illingworth and J. Kittler, "A survey of the Hough transform,"Comput. Vision Graphics Image Processing, vol. 44, pp. 87-116, 1988.
[3] W. Niblack and D. Petkovic, "On improving the accuracy of the Hough transform: Theory, simulations and experiments," inProc. IEEE Conf. CVPR'88, Ann Arbor, MI, June 1988, pp. 574-579.
[4] N. Kiryati and A. M. Bruckstein, "Antialiasing the Hough transform," inProc. IAPR 6th Scandinavian Conf. Image Analysis, Oulu, Finland, June 1989, pp. 621-628; alsoCVGIP: Graphical Models Image Processing, to be published.
[5] B. Kamgar-Parsi and B. Kamgar-Parsi, "A non-parametric method for fitting a straight line to a noisy image," Center for Automation Res., Univ. of Maryland, College Park, Tech. Rep. CAR-TR-315, Sept. 1987.
[6] I. Weiss, "Straight line fitting in a noisy image," inProc. IEEE Conf. CVPR'88, Ann-Arbor, MI, June 1988, pp. 647-652.
[7] P.R. Thrift and S.M. Dunn, "Approximating point-set images by line segments using a variation of the Hough transform,"Comput. Vision Graphics Image Processing, vol. 21, pp. 383-394, 1983.
[8] R.O. Duda and P.E. Hart,Pattern Classification and Scene Analysis. New York: Wiley, 1973, pp. 328-335.
[9] N. Kiryati and A.M. Bruckstein, "On navigating between friends and foes," EE Pub. 672, Dept. Electrical Engineering, Technion--Israel Institute of Technology, Haifa, May 1988.
[10] N. Kiryati and A.M. Bruckstein, "On navigating between friends and foes," inProc. IEEE 16th Conf. Electrical Electronics Engineers in Israel, Tel Aviv, Mar. 1989.
[11] Y. Pnueli, N. Kiryati, and A.M. Bruckstein, "Navigating in moving influence fields," inProc. 6th Israeli Conf. Artificial Intell. Computer Vision, Tel Aviv, Dec. 1989.
[12] N. Kiryati and A. M. Bruckstein, "What's in a set of points?" inProc. Int. Workshop Robust Computer Vision, Seattle, WA. Oct. 1990; also Dept. Computer Science, Technion -- Israel Institute of Technology, Haifa, Tech. Rep. 605, Jan. 1990.

Index Terms:
artificial intelligence; navigation; path planning; Hough transform; least-squares techniques; M-estimation; least squares approximations; navigation; planning (artificial intelligence); transforms
N. Kiryati, A.M. Bruckstein, "On Navigating Between Friends and Foes," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 13, no. 6, pp. 602-606, June 1991, doi:10.1109/34.87346
Usage of this product signifies your acceptance of the Terms of Use.