Digital Image Processing Algorithms and Applications
A unique collection of algorithms and lab experiments for practitioners and researchers of digital image processing technology
With the field of digital image processing rapidly expanding, there is a growing need for a book that would go beyond theory and techniques to address the underlying algorithms. Digital Image Processing Algorithms and Applications fills the gap in the field, providing scientists and engineers with a complete library of algorithms for digital image processing, coding, and analysis. Digital image transform algorithms, edge detection algorithms, and image segmentation algorithms are carefully gleaned from the literature for compatibility and a track record of acceptance in the scientific community.
The author guides readers through all facets of the technology, supplementing the discussion with detailed lab exercises in EIKONA, his own digital image processing software, as well as useful PDF transparencies. He covers in depth filtering and enhancement, transforms, compression, edge detection, region segmentation, and shape analysis, explaining at every step the relevant theory, algorithm structure, and its use for problem solving in various applications. The availability of the lab exercises and the source code (all algorithms are presented in C-code) over the Internet makes the book an invaluable self-study guide. It also lets interested readers develop digital image processing applications on ordinary desktop computers as well as on Unix machines.
What people are saying - Write a review
Other editions - View all
2-d DFT algorithm is shown applications array binary image boundary buffers N1 calculation chain code code table codeword color image column compression computer vision coordinates N2 corner coordinates corresponding denotes described detection digital image processing edge detector EIKONA end coordinates Fourier transform fseek function gray-level grayscale histogram Hough transform Huffman code IEEE Transactions image a,b image histogram image pixels image regions implementation input image buffer int i,j int N1 intensity inverse j]=(unsigned JPEG Kotropoulos label Let us suppose linear convolution llinks malloc malloc((unsigned matrix median filter merge merge algorithm morphological nodes noise NW,MW object operations original image output image parameter Pitas pixel power spectrum pyramid quadtree quantization recursive representation segmentation sequence shown in Figure Signal Processing split structuring element Subroutine techniques texture threshold two-dimensional unsigned char vector watermark Wiener filter window