Details

Algorithms for Image Processing and Computer Vision


Algorithms for Image Processing and Computer Vision


2. Aufl.

von: J. R. Parker

76,99 €

Verlag: Wiley
Format: PDF
Veröffentl.: 01.12.2010
ISBN/EAN: 9781118019627
Sprache: englisch
Anzahl Seiten: 512

DRM-geschütztes eBook, Sie benötigen z.B. Adobe Digital Editions und eine Adobe ID zum Lesen.

Beschreibungen

<b>A cookbook of algorithms for common image processing applications</b> <p>Thanks to advances in computer hardware and software, algorithms have been developed that support sophisticated image processing without requiring an extensive background in mathematics. This bestselling book has been fully updated with the newest of these, including 2D vision methods in content-based searches and the use of graphics cards as image processing computational aids. It’s an ideal reference for software engineers and developers, advanced programmers, graphics programmers, scientists, and other specialists who require highly specialized image processing.</p> <ul> <li>Algorithms now exist for a wide variety of sophisticated image processing applications required by software engineers and developers, advanced programmers, graphics programmers, scientists, and related specialists</li> <li>This bestselling book has been completely updated to include the latest algorithms, including 2D vision methods in content-based searches, details on modern classifier methods, and graphics cards used as image processing computational aids</li> <li>Saves hours of mathematical calculating by using distributed processing and GPU programming, and gives non-mathematicians the shortcuts needed to program relatively sophisticated applications.</li> </ul> <p><i>Algorithms for Image Processing and Computer Vision, 2nd Edition</i> provides the tools to speed development of image processing applications.</p>
<p>Preface xxi</p> <p><b>Chapter 1 Practical Aspects of a Vision System — Image Display, Input/Output, and Library Calls 1</b></p> <p>OpenCV 2</p> <p>The Basic OpenCV Code 2</p> <p>The IplImage Data Structure 3</p> <p>Reading and Writing Images 6</p> <p>Image Display 7</p> <p>An Example 7</p> <p>Image Capture 10</p> <p>Interfacing with the AIPCV Library 14</p> <p>Website Files 18</p> <p>References 18</p> <p><b>Chapter 2 Edge-Detection Techniques 21</b></p> <p>The Purpose of Edge Detection 21</p> <p>Traditional Approaches and Theory 23</p> <p>Models of Edges 24</p> <p>Noise 26</p> <p>Derivative Operators 30</p> <p>Template-Based Edge Detection 36</p> <p>Edge Models: The Marr-Hildreth Edge Detector 39</p> <p>The Canny Edge Detector 42</p> <p>The Shen-Castan (ISEF) Edge Detector 48</p> <p>A Comparison of Two Optimal Edge Detectors 51</p> <p>Color Edges 53</p> <p>Source Code for the Marr-Hildreth Edge Detector 58</p> <p>Source Code for the Canny Edge Detector 62</p> <p>Source Code for the Shen-Castan Edge Detector 70</p> <p>Website Files 80</p> <p>References 82</p> <p><b>Chapter 3 Digital Morphology 85</b></p> <p>Morphology Defined 85</p> <p>Connectedness 86</p> <p>Elements of Digital Morphology — Binary Operations 87</p> <p>Binary Dilation 88</p> <p>Implementing Binary Dilation 92</p> <p>Binary Erosion 94</p> <p>Implementation of Binary Erosion 100</p> <p>Opening and Closing 101</p> <p>MAX — A High-Level Programming Language for Morphology 107</p> <p>The ‘‘Hit-and-Miss’’ Transform 113</p> <p>Identifying Region Boundaries 116</p> <p>Conditional Dilation 116</p> <p>Counting Regions 119</p> <p>Grey-Level Morphology 121</p> <p>Opening and Closing 123</p> <p>Smoothing 126</p> <p>Gradient 128</p> <p>Segmentation of Textures 129</p> <p>Size Distribution of Objects 130</p> <p>Color Morphology 131</p> <p>Website Files 132</p> <p>References 135</p> <p><b>Chapter 4 Grey-Level Segmentation 137</b></p> <p>Basics of Grey-Level Segmentation 137</p> <p>Using Edge Pixels 139</p> <p>Iterative Selection 140</p> <p>The Method of Grey-Level Histograms 141</p> <p>Using Entropy 142</p> <p>Fuzzy Sets 146</p> <p>Minimum Error Thresholding 148</p> <p>Sample Results From Single Threshold Selection 149</p> <p>The Use of Regional Thresholds 151</p> <p>Chow and Kaneko 152</p> <p>Modeling Illumination Using Edges 156</p> <p>Implementation and Results 159</p> <p>Comparisons 160</p> <p>Relaxation Methods 161</p> <p>Moving Averages 167</p> <p>Cluster-Based Thresholds 170</p> <p>Multiple Thresholds 171</p> <p>Website Files 172</p> <p>References 173</p> <p><b>Chapter 5 Texture and Color 177</b></p> <p>Texture and Segmentation 177</p> <p>A Simple Analysis of Texture in Grey-Level Images 179</p> <p>Grey-Level Co-Occurrence 182</p> <p>Maximum Probability 185</p> <p>Moments 185</p> <p>Contrast 185</p> <p>Homogeneity 185</p> <p>Entropy 186</p> <p>Results from the GLCM Descriptors 186</p> <p>Speeding Up the Texture Operators 186</p> <p>Edges and Texture 188</p> <p>Energy and Texture 191</p> <p>Surfaces and Texture 193</p> <p>Vector Dispersion 193</p> <p>Surface Curvature 195</p> <p>Fractal Dimension 198</p> <p>Color Segmentation 201</p> <p>Color Textures 205</p> <p>Website Files 205</p> <p>References 206</p> <p><b>Chapter 6 Thinning 209</b></p> <p>What Is a Skeleton? 209</p> <p>The Medial Axis Transform 210</p> <p>Iterative Morphological Methods 212</p> <p>The Use of Contours 221</p> <p>Choi/Lam/Siu Algorithm 224</p> <p>Treating the Object as a Polygon 226</p> <p>Triangulation Methods 227</p> <p>Force-Based Thinning 228</p> <p>Definitions 229</p> <p>Use of a Force Field 230</p> <p>Subpixel Skeletons 234</p> <p>Source Code for Zhang-Suen/Stentiford/Holt Combined Algorithm 235</p> <p>Website Files 246</p> <p>References 247</p> <p><b>Chapter 7 Image Restoration 251</b></p> <p>Image Degradations — The Real World 251</p> <p>The Frequency Domain 253</p> <p>The Fourier Transform 254</p> <p>The Fast Fourier Transform 256</p> <p>The Inverse Fourier Transform 260</p> <p>Two-Dimensional Fourier Transforms 260</p> <p>Fourier Transforms in OpenCV 262</p> <p>Creating Artificial Blur 264</p> <p>The Inverse Filter 270</p> <p>The Wiener Filter 271</p> <p>Structured Noise 273</p> <p>Motion Blur — A Special Case 276</p> <p>The Homomorphic Filter — Illumination 277</p> <p>Frequency Filters in General 278</p> <p>Isolating Illumination Effects 280</p> <p>Website Files 281</p> <p>References 283</p> <p><b>Chapter 8 Classification 285</b></p> <p>Objects, Patterns, and Statistics 285</p> <p>Features and Regions 288</p> <p>Training and Testing 292</p> <p>Variation: In-Class and Out-Class 295</p> <p>Minimum Distance Classifiers 299</p> <p>Distance Metrics 300</p> <p>Distances Between Features 302</p> <p>Cross Validation 304</p> <p>Support Vector Machines 306</p> <p>Multiple Classifiers — Ensembles 309</p> <p>Merging Multiple Methods 309</p> <p>Merging Type 1 Responses 310</p> <p>Evaluation 311</p> <p>Converting Between Response Types 312</p> <p>Merging Type 2 Responses 313</p> <p>Merging Type 3 Responses 315</p> <p>Bagging and Boosting 315</p> <p>Bagging 315</p> <p>Boosting 316</p> <p>Website Files 317</p> <p>References 318</p> <p><b>Chapter 9 Symbol Recognition 321</b></p> <p>The Problem 321</p> <p>OCR on Simple Perfect Images 322</p> <p>OCR on Scanned Images — Segmentation 326</p> <p>Noise 327</p> <p>Isolating Individual Glyphs 329</p> <p>Matching Templates 333</p> <p>Statistical Recognition 337</p> <p>OCR on Fax Images — Printed Characters 339</p> <p>Orientation — Skew Detection 340</p> <p>The Use of Edges 345</p> <p>Handprinted Characters 348</p> <p>Properties of the Character Outline 349</p> <p>Convex Deficiencies 353</p> <p>Vector Templates 357</p> <p>Neural Nets 363</p> <p>A Simple Neural Net 364</p> <p>A Backpropagation Net for Digit Recognition 368</p> <p>The Use of Multiple Classifiers 372</p> <p>Merging Multiple Methods 372</p> <p>Results From the Multiple Classifier 375</p> <p>Printed Music Recognition — A Study 375</p> <p>Staff Lines 376</p> <p>Segmentation 378</p> <p>Music Symbol Recognition 381</p> <p>Source Code for Neural Net Recognition System 383</p> <p>Website Files 390</p> <p>References 392</p> <p><b>Chapter 10 Content-Based Search — Finding Images by Example 395</b></p> <p>Searching Images 395</p> <p>Maintaining Collections of Images 396</p> <p>Features for Query by Example 399</p> <p>Color Image Features 399</p> <p>Mean Color 400</p> <p>Color Quad Tree 400</p> <p>Hue and Intensity Histograms 401</p> <p>Comparing Histograms 402</p> <p>Requantization 403</p> <p>Results from Simple Color Features 404</p> <p>Other Color-Based Methods 407</p> <p>Grey-Level Image Features 408</p> <p>Grey Histograms 409</p> <p>Grey Sigma — Moments 409</p> <p>Edge Density — Boundaries Between Objects 409</p> <p>Edge Direction 410</p> <p>Boolean Edge Density 410</p> <p>Spatial Considerations 411</p> <p>Overall Regions 411</p> <p>Rectangular Regions 412</p> <p>Angular Regions 412</p> <p>Circular Regions 414</p> <p>Hybrid Regions 414</p> <p>Test of Spatial Sampling 414</p> <p>Additional Considerations 417</p> <p>Texture 418</p> <p>Objects, Contours, Boundaries 418</p> <p>Data Sets 418</p> <p>Website Files 419</p> <p>References 420</p> <p>Systems 424</p> <p><b>Chapter 11 High-Performance Computing for Vision and Image Processing 425</b></p> <p>Paradigms for Multiple-Processor Computation 426</p> <p>Shared Memory 426</p> <p>Message Passing 427</p> <p>Execution Timing 427</p> <p>Using clock() 428</p> <p>Using QueryPerformanceCounter 430</p> <p>The Message-Passing Interface System 432</p> <p>Installing MPI 432</p> <p>Using MPI 433</p> <p>Inter-Process Communication 434</p> <p>Running MPI Programs 436</p> <p>Real Image Computations 437</p> <p>Using a Computer Network — Cluster Computing 440</p> <p>A Shared Memory System — Using the PC Graphics Processor 444</p> <p>GLSL 444</p> <p>OpenGL Fundamentals 445</p> <p>Practical Textures in OpenGL 448</p> <p>Shader Programming Basics 451</p> <p>Vertex and Fragment Shaders 452</p> <p>Required GLSL Initializations 453</p> <p>Reading and Converting the Image 454</p> <p>Passing Parameters to Shader Programs 456</p> <p>Putting It All Together 457</p> <p>Speedup Using the GPU 459</p> <p>Developing and Testing Shader Code 459</p> <p>Finding the Needed Software 460</p> <p>Website Files 461</p> <p>References 461</p> <p>Index 465</p>
<b>J. R. Parker</b> is a full professor working in the Art department at the University of Calgary. His major research projects include live performance in online virtual spaces, the design and construction of kinetic games, and the portrayal of Canadian history and culture in digital and online form.
<b>Now — the hottest algorithms for specialized image processing are right in your hands</b> <p>With this accessible cookbook of algorithms, you'll gain access to the most wanted image-processing applications, including morphology, image restoration, and symbol recognition. Throughout these pages, you'll find real-life examples that clearly describe the latest techniques, saving you hours of lengthy mathematical calculations. And all code is also included on the website, so you can experiment with your own ideas and algorithms for organizing and searching image data sets.</p> <p>This updated edition provides practical solutions so you can:</p> <ul> <li> <p>Program state-of-the-art image-processing capabilities into software</p> </li> <li> <p>Find the steps for taking advantage of classifiers</p> </li> <li> <p>Apply 2D vision methods in content-based searches</p> </li> <li> <p>Perform edge detection, thinning, thresholding, and morphology</p> </li> <li> <p>Link all the computers on your network into a large image-processing cluster</p> </li> <li> <p>Program the GPU to do image-processing and vision tasks</p> </li> <li> <p>Select the best method for searching through images</p> </li> </ul> <p>Visit the companion website at www.wiley.com/go/jrparker to access all code used in this book.</p>

Diese Produkte könnten Sie auch interessieren:

MDX Solutions
MDX Solutions
von: George Spofford, Sivakumar Harinath, Christopher Webb, Dylan Hai Huang, Francesco Civardi
PDF ebook
53,99 €
Concept Data Analysis
Concept Data Analysis
von: Claudio Carpineto, Giovanni Romano
PDF ebook
107,99 €