Digital Image Processing Algorithms and ApplicationsJohn Wiley & Sons, 2000 M02 22 - 432 páginas 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. |
Contenido
I | 1 |
II | 2 |
III | 4 |
IV | 7 |
V | 13 |
VI | 18 |
VII | 20 |
VIII | 38 |
XXXIX | 205 |
XL | 221 |
XLI | 229 |
XLII | 235 |
XLIII | 241 |
XLIV | 242 |
XLV | 249 |
XLVII | 257 |
IX | 51 |
X | 52 |
XI | 59 |
XII | 68 |
XIII | 85 |
XIV | 92 |
XV | 96 |
XVI | 103 |
XVII | 107 |
XVIII | 113 |
XIX | 121 |
XX | 122 |
XXI | 125 |
XXII | 128 |
XXIII | 133 |
XXIV | 135 |
XXV | 139 |
XXVI | 149 |
XXVII | 156 |
XXVIII | 162 |
XXIX | 166 |
XXX | 168 |
XXXI | 174 |
XXXII | 177 |
XXXIII | 179 |
XXXIV | 180 |
XXXV | 191 |
XXXVI | 192 |
XXXVII | 200 |
XXXVIII | 203 |
XLVIII | 275 |
XLIX | 277 |
L | 282 |
LI | 297 |
LII | 300 |
LIII | 303 |
LIV | 323 |
LV | 324 |
LVI | 329 |
LVII | 334 |
LVIII | 336 |
LIX | 342 |
LX | 348 |
LXI | 352 |
LXII | 356 |
LXIII | 361 |
LXIV | 369 |
LXV | 372 |
LXVI | 376 |
LXVII | 382 |
LXVIII | 385 |
LXIX | 386 |
LXX | 401 |
LXXI | 402 |
LXXII | 405 |
LXXIII | 406 |
LXXIV | 407 |
LXXV | 413 |
Otras ediciones - Ver todas
Términos y frases comunes
2-d DFT applications array binary image boundary calculation code table codeword coefficients color image column compression computer vision coordinates N2 corner coordinates corresponding denotes described detection digital image processing edge detector EIKONA end coordinates float Fourier transform function 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 JPEG k₁ LABEL Let us suppose linear convolution malloc((unsigned mathematical morphology matrix median filter merge merge algorithm morphological N₁ N₂ nc++ nodes noise nr++ object operations original image output image parameter Pitas pixel power spectrum pyramid quadtree quantization RCFFT recursive representation return(0 segmentation sequence shown in Figure Signal Processing sizeof(float split structuring element Subroutine techniques texture threshold two-dimensional unsigned char vector watermark Wiener filter window Σ Σ