This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Number of Digital Straight Line Segments
November 1988 (vol. 10 no. 6)
pp. 880-887

A closed-form expression has been reported in the literature for L/sub N/, the number of digital line segments of length N that correspond to lines of the form y=ax+ beta , O>or= alpha , beta >1. The authors prove an asymptotic estimate for L/sub N/ that might prove useful for many applications, namely, L/sub N/=N/sup 3// pi /sup 2/+O(N/sup 2/ log N). An application to an image registration problem is given.

[1] D. Lavine, L. N. Kanal, C. A. Berenstein, E. Slud, and C. Herman, "Analysis of subpixel registration accuracy," inProc. NASA Symp. Math. Pattern Recognition Anal., Houston, TX, June 1983.
[2] C. A. Berenstein, L. N. Kanal, D. Lavine, E. Olson, and E. Slud, "Analysis of subpixel registration," presented at the NASA/Math. Pattern Recognition Image Anal. Symp., Houston, TX, June 1984.
[3] D. Lavine, E. Olson, B. Lambird, C. A. Berenstein, and L. N. Kanal, "Analysis of subpixel accuracy," presented at the NASA/Math. Pattern Recognition Image Anal. Symp., Houston, TX, June 1985.
[4] C. A. Berenstein, L. N. Kanal, D. Lavine, and E. Olson, "A geometric approach to subpixel registration accuracy,"Comput. Vision Graphics Image Processing, vol. 40, no. 3, pp. 334-360, 1987.
[5] L. Dorst and A. W. M. Smeulders, "Discrete representation of straight lines,"IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI- 6, pp. 450-462, 1984.
[6] E. C. Kim and A. Rosenfeld, "Digital straight lines and convexity of digital regions,"IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-4, pp. 149-153, 1982.
[7] J. Rothstein and C. Weiman, "Parallel and sequential specification of a context sensitive language for straight lines of grids,"Comput. Graphics Image Processing, vol. 5, pp. 106-124, 1976.
[8] L. A. Santalo,Integral Geometry and Geometrical Probability. Reading, MA: Addison-Wesley, 1976.
[9] G. H. Hardy and E. M. Wright,An Introduction to the Theory of Numbers. New York: Oxford Univ. Press, 1968.
[10] A. P. Sundar Raj and J. Kopiowitz, "On bit reduction of chain coded line drawings,"Pattern Recognition Lett., vol. 4, pp. 99-102, 1986.
[11] M. D. McIlroy, "A note on discrete representation of lines,"AT&T Tech. J., vol. 64, pp. 481-490, 1984.
[12] J. Koplowitz and A. P. Sundar Raj, "A robust filtering algorithm for subpixel reconstruction of chain coded line drawings,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI-9, pp. 451-457, 1987.
[13] G. Oltramare,Mem. Inst. Nat. Genevois, vol. 4, pp. 1-10, 1856; see also, L. E. Dickson,History of the Theory of Numbers. Chelsea, 1952, p. 142.

Index Terms:
computerized picture processing; digital straight line segments; closed-form expression; asymptotic estimate; image registration; computational complexity; computerised picture processing
Citation:
C.A. Berenstein, D. Lavine, "On the Number of Digital Straight Line Segments," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 10, no. 6, pp. 880-887, Nov. 1988, doi:10.1109/34.9109
Usage of this product signifies your acceptance of the Terms of Use.