Binary Digital Image Processing: A Discrete Approach
Academic Press, Dec 1, 1999 - Technology & Engineering - 368 pages
Binary Digital Image Processing is aimed at faculty, postgraduate students and industry specialists. It is both a text reference and a textbook that reviews and analyses the research output in this field of binary image processing. It is aimed at both advanced researchers as well as educating the novice to this area. The theoretical part of this book includes the basic principles required for binary digital image analysis. The practical part which will take an algorithmic approach addresses problems which find applications beyond binary digital line image processing.
The book first outlines the theoretical framework underpinning the study of digital image processing with particular reference to those needed for line image processing. The theoretical tools in the first part of the book set the stage for the second and third parts, where low-level binary image processing is addressed and then intermediate level processing of binary line images is studied. The book concludes with some practical applications of this work by reviewing some industrial and software applications (engineering drawing storage and primitive extraction, fingerprint compression).
What people are saying - Write a review
We haven't found any reviews in the usual places.
Chapter 2 Discrete geometry
Chapter 3 Algorithmic graph theory
Chapter 4 Acquisition and storage
Chapter 5 Distance transformations
Chapter 6 Binary digital image characteristics
Other editions - View all
8-connected 8-digital arc algorithm associated binary digital image binary image binary line image black pixels border centres of maximal chain-code chamfer distance Chapter characterisation codes compact chord property computation connected component contains continuous segment continuous set continuous straight segment contour convex hull convex sets corresponding curve deﬁned Deﬁnition digital arc digital image processing digital straight segment digital topology digitisation boxes digitisation scheme digitisation set discrete circle discrete discs discrete distance maps discrete points discrete space distance transformation equivalent Euclidean distance map example Farey sequence ﬁrst foreground geometrical graph theory grid graph grid-intersect quantisation Initialisation integer L-convex mask maximal discs minimum weighted spanning move lengths neighbourhood object-boundary quantisation operations propagation Proposition radius real point represented respectively satisﬁes sequential set of discrete set of pixels shown in Figure skeleton square lattice square-box quantisation storage techniques triangular lattice updated vertex vertices visibility polygon Voronoi diagrams white pixels