Image Processing Reference
In-Depth Information
[214] W. E. Wright. Parallelization of Bresenham's line and circle algorithms.
IEEE Computer Graphics and Applications, 10(5):60-67, 1990.
[215] L. D. Wu. On the Freeman's conjecture about the chaincode of a line. In
Proceedings of the 5th International Conference on Pattern Recognition,
pages 32-34, 1980.
[216] L. D. Wu. On the chaincode of a line. IEEE Transactions on Pattern
Analysis and Machine Intelligence, 4:347-353, 1982.
[217] L.-D. Wu. A piecewise linear approximation based on a statistical model.
IEEE Trans. PAMI, 6:41-45, 1984.
[218] X. Wu and J. G. Rokne. Double-step incremental generation of lines and
circles. Computer Vision, Graphics, and Image Processing, 37(3):331-
344, 1987.
[219] D. M. Wuescher and K. L. Boyer. Robust contour decomposition using
a constant curvature criterion. IEEE Trans. PAMI, 13(1):41-51, 1991.
[220] Y. Xie and Q. Ji. Effective line detection with error propagation. In
Proc. Intl. Conf. Image Processing (ICIP), IEEE CS Press, pages 181-
184, 2001.
[221] M. Yamashita and T. Ibaraki. Distances defined by neighborhood se-
quences. Pattern Recognition, 19:237-246, 1986.
[222] C. Yao and J. G. Rokne. Hybrid scan-conversion of circles. IEEE Trans.
Visualization and Computer Graphics, 1(4):311-318, 1995.
[223] P. Y. Yin. A new method for polygonal approximation using genetic
algorithms. Pattern Recognition Letters, 19(11):1017-1026, 1998.
[224] P. Y. Yin. Ant colony search algorithms for optimal polygonal approx-
imation of plane curves. Pattern Recognition, 36:1783-1797, 2003.
[225] P. Y. Yin. A discrete particle swarm algorithm for optimal polygonal
approximation of digital curves. J. Visual Comm. Image Representation,
15(2):241-260, 2004.
