Digital Geometry for Image-Based Metrology

This paper surveys several interesting issues arising in digital geometry due to the need to perform accurate automated measurements on objects that are seen through the eyes of various types of imaging devices. These devices are typically regular arrays of (light) sensors and provide us matrices of quantized probings of the objects being looked at. In this setting, the natural questions that may be posed are: how accurately can we locate and recognize these objects from classes of possible objects, and how precisely can we measure various geometric properties of the objects of interest, how accurately can we locate them given the limitations imposed upon us by the geometry of the sensor lattices and the quantization and noise omnipresent in the sensor device output. Yet another exciting area of investigation is the design of (classes of) objects that enable optimal exploitation of the imaging device capabilities, in the sense of yielding the most accurate measurements possible.

[1]  Marjorie Senechal,et al.  Quasicrystals: the view from les houches , 1990 .

[2]  K. Voss.  Discrete Images, Objects, and Functions in Zn , 1993 .

[3]  M. Lothaire,et al.  Algebraic Combinatorics on Words: Index of Notation , 2002 .

[4]  R. Goldenberg,et al.  Optimized overlay metrology marks: theory and experiment , 2004, IEEE Transactions on Semiconductor Manufacturing.

[5]  Laure Tougne,et al.  An elementary algorithm for digital arc segmentation , 2004, Discret. Appl. Math..

[6]  Jeffrey Shallit,et al.  Automatic Sequences by Jean-Paul Allouche , 2003 .

[7]  A. Smeulders,et al.  Discrete straight line segments: parameters, primitives and properties , 1991 .

[8]  T. Pavlidis.  Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.

[9]  Alfred M. Bruckstein,et al.  Gray levels can improve the performance of binary image digitizers , 1991, CVGIP Graph. Model. Image Process..

[10]  Alfred M. Bruckstein,et al.  Design of Perimeter Estimators for Digitized Planar Shapes , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Alon Efrat,et al.  Subpixel image registration using circular fiducials , 1994, Int. J. Comput. Geom. Appl..

[12]  M. D. McIlroy.  A note on discrete representation of lines , 1985, AT&T Technical Journal.

[13]  Sheng-Wen Shih,et al.  On Designing an Isotropic Fiducial Mark , 2022 .

[14]  Baryshnikov,et al.  Complexity of trajectories in rectangular billiards , 1994, chao-dyn/9406001.

[15]  M. Lothaire.  Algebraic Combinatorics on Words , 2002 .

[16]  Kenneth G. Paterson,et al.  A method for constructing decodable de Bruijn sequences , 1996, IEEE Trans. Inf. Theory.

[17]  P. A. B. Pleasants.  Quasicrystallography: some interesting new patterns , 1985 .

[18]  Alfred M. Bruckstein,et al.  Finding the kernel of planar shapes , 1991, Pattern Recognit..

[19]  D. Proffitt,et al.  Metrication errors and coding efficiency of chain-encoding schemes for the representation of lines and edges , 1979 .

[20]  Larry S. Davis.  Foundations of Image Understanding , 2001 .

[21]  Alfred M. Bruckstein,et al.  On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[22]  David I. Havelock,et al.  The Topology of Locales and Its Effects on Position Uncertainty , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[23]  Herbert Freeman,et al.  On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

[24]  Alon Orlitsky,et al.  Design of Shapes for Precise Image Registration , 1998, IEEE Trans. Inf. Theory.

[25]  J. Shallit,et al.  Automatic Sequences: Contents , 2003 .

[26]  Longin Jan Latecki.  Discrete Representation of Spatial Objects in Computer Vision , 1998, Computational Imaging and Vision.

[27]  Henryk Iwaniec,et al.  Elementary and analytic theory of numbers , 1985 .

[28]  Robert A. Melter,et al.  Vision Geometry , 1992 .