Tony F. Chan

At no other time in human history have the influence and impact of image processing on modern society, science, and technology been so explosive. Image processing has become a critical component in contemporary science and technology and has many important applications. This book develops the mathematical foundation of modern image processing and low-level computer vision, and presents a general framework from the analysis of image structures and patterns to their processing. The core mathematical and computational ingredients of several important image processing tasks are investigated. The book bridges contemporary mathematics with state-of-the-art methodologies in modern image processing while organizing the vast contemporary literature into a coherent and logical structure. Image processing has traditionally been built on the machinery of Fourier and spectral analysis; however, in the past few decades numerous novel competing methods and tools have emerged. These diversified approaches, although seemingly distinct, are in fact intrinsically connected. The authors integrate this diversity of modern image processing approaches by revealing the few common threads connecting them.Some newer emergent integration efforts have also been highlighted and analyzed. Image Processing and Analysis is systematic and well organized. The authors first investigate the geometric, functional, and atomic structures of images and then rigorously develop and analyze several image processors. The book is comprehensive and integrative, covering the four most powerful classes of mathematical tools in contemporary image analysis and processing while exploring their intrinsic connections and integration. The material is balanced in theory and computation, following a solid theoretical analysis of model building and performance with computational implementation and numerical examples.

In this book, which focuses on the use of iterative methods for solving large sparse systems of linear equations, templates are introduced to meet the needs of both the traditional user and the high performance specialist. Templates, a description of a general algorithm rather than the executable object or source code more commonly found in a conventional software library, offer whatever degree of customization the user may desire.Templates have three distinct advantages: they are general and reusable, they are not language specific, and they exploit the expertise of both the numerical analyst, who creates a template reflecting in depth knowledge of a specific numerical technique, and the computational scientist, who then provides ""value added"" capability to the general template description, customizing it for specific needs.For each template that is presented, the authors provide a mathematical description of the flow of the algorithm, discussion of convergence and stopping criteria to use in the iteration, suggestions for applying a method to special matrix types, advice for tuning the template, tips on parallel implementations, and hints as to when and why a method is useful.