The number of digital straight lines on an N×N grid
暂无分享,去创建一个
Alfred M. Bruckstein | Michael Lindenbaum | Jack Koplowitz | A. Bruckstein | M. Lindenbaum | J. Koplowitz
[1] Jack Koplowitz,et al. A Robust Filtering Algorithm for Subpixel Reconstruction of Chain Coded Line Drawings , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[2] AZRIEL ROSENFELD,et al. Digital Straight Line Segments , 1974, IEEE Transactions on Computers.
[3] Azriel Rosenfeld,et al. Digital Straight Lines and Convexity of Digital Regions , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[4] Eric C. Olson,et al. A geometric approach to subpixel registration accuracy , 1987, Computer Vision Graphics and Image Processing.
[5] Li-De Wu,et al. On the Chain Code of a Line , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[6] Thomas M. Cover,et al. Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition , 1965, IEEE Trans. Electron. Comput..
[7] Wade H. Foy. Entropy of simple line drawings (Corresp.) , 1964, IEEE Trans. Inf. Theory.
[8] S. H. Y. Hung,et al. On the Straightness of Digital Arcs , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[9] Dimitris Anastassiou,et al. A probability model for simple closed random curves , 1981, IEEE Trans. Inf. Theory.
[10] C. A. Berenstein,et al. On the Number of Digital Straight Line Segments , 1988, IEEE Trans. Pattern Anal. Mach. Intell..