Free upgrade to UPS or Priority / BRAND NEW / [clean wrapped, well protected] [Authentic edition exactly the same as the Official Listing] / Genuine US Bookstore! Get your book in perfect condition! We also ship international!

Random Processes: A Mathematical Approach for Engineers (Prentice-Hall Information and System Sciences Series)

Science & Math

Gray, Robert M.

Davisson, Lee D.

Mathematics

PRENTICE/HALL

Stochastic Image Processing provides the first thorough treatment of Markov and hidden Markov random fields and their application to image processing. Although promoted as a promising approach for over thirty years, it has only been in the past few years that the theory and algorithms have developed to the point of providing useful solutions to old and new problems in image processing. Markov random fields are a multidimensional extension of Markov chains, but the generalization is complicated by the lack of a natural ordering of pixels in multidimensional spaces. Hidden Markov fields are a natural generalization of the hidden Markov models that have proved essential to the development of modern speech recognition, but again the multidimensional nature of the signals makes them inherently more complicated to handle. This added complexity contributed to the long time required for the development of successful methods and applications. This book collects together a variety of successful approaches to a complete and useful characterization of multidimensional Markov and hidden Markov models along with applications to image analysis. The book provides a survey and comparative development of an exciting and rapidly evolving field of multidimensional Markov and hidden Markov random fields with extensive references to the literature.

Stochastic Image Processing (Information Technology: Transmission, Processing and Storage)

Computers & Technology

Chee Sun Won

Computer Science

Springer

An Introduction to Statistical Signal Processing

This volume describes the essential tools and techniques of statistical signal processing. At every stage, theoretical ideas are linked to specific applications in communications and signal processing. The book begins with an overview of basic probability, random objects, expectation, and second-order moment theory, followed by a wide variety of examples of the most popular random process models and their basic uses and properties. Specific applications to the analysis of random signals and systems for communicating, estimating, detecting, modulating, and other processing of signals are interspersed throughout the text.

Networking & Cloud Computing

Cambridge University Press

In the current age of information technology, the issues of distributing and utilizing images efficiently and effectively are of substantial concern. Solutions to many of the problems arising from these issues are provided by techniques of image processing, among which segmentation and compression are topics of this book. Image segmentation is a process for dividing an image into its constituent parts. For block-based segmentation using statistical classification, an image is divided into blocks and a feature vector is formed for each block by grouping statistics of its pixel intensities. Conventional block-based segmentation algorithms classify each block separately, assuming independence of feature vectors. Image Segmentation and Compression Using Hidden Markov Models presents a new algorithm that models the statistical dependence among image blocks by two dimensional hidden Markov models (HMMs). Formulas for estimating the model according to the maximum likelihood criterion are derived from the EM algorithm. To segment an image, optimal classes are searched jointly for all the blocks by the maximum a posteriori (MAP) rule. The 2-D HMM is extended to multiresolution so that more context information is exploited in classification and fast progressive segmentation schemes can be formed naturally. The second issue addressed in the book is the design of joint compression and classification systems using the 2-D HMM and vector quantization. A classifier designed with the side goal of good compression often outperforms one aimed solely at classification because overfitting to training data is suppressed by vector quantization. Image Segmentation and Compression Using Hidden Markov Models is an essential reference source for researchers and engineers working in statistical signal processing or image processing, especially those who are interested in hidden Markov models. It is also of value to those working on statistical modeling.

Image Segmentation and Compression Using Hidden Markov Models (The Springer International Series in Engineering and Computer Science, 571)

Business & Money

Jia Li

Management & Leadership

Source Coding Theory (The Springer International Series in Engineering and Computer Science)

Source coding theory has as its goal the characterization of the optimal performance achievable in idealized communication systems which must code an information source for transmission over a digital communication or storage channel for transmission to a user. The user must decode the information into a form that is a good approximation to the original. A code is optimal within some class if it achieves the best possible fidelity given whatever constraints are imposed on the code by the available channel. In theory, the primary constraint imposed on a code by the channel is its rate or resolution, the number of bits per second or per input symbol that it can transmit from sender to receiver. In the real world, complexity may be as important as rate. The origins and the basic form of much of the theory date from Shan non's classical development of noiseless source coding and source coding subject to a fidelity criterion (also called rate-distortion theory) [73] [74]. Shannon combined a probabilistic notion of information with limit theo rems from ergodic theory and a random coding technique to describe the optimal performance of systems with a constrained rate but with uncon strained complexity and delay. An alternative approach called asymptotic or high rate quantization theory based on different techniques and approx imations was introduced by Bennett at approximately the same time [4]. This approach constrained the delay but allowed the rate to grow large.

Source Coding Theory (The Springer International Series in Engineering and Computer Science, 83)

Herb Caen, a popular columnist for the San Francisco Chronicle, recently quoted a Voice of America press release as saying that it was reorganizing in order to "eliminate duplication and redundancy. " This quote both states a goal of data compression and illustrates its common need: the removal of duplication (or redundancy) can provide a more efficient representation of data and the quoted phrase is itself a candidate for such surgery. Not only can the number of words in the quote be reduced without losing informa tion, but the statement would actually be enhanced by such compression since it will no longer exemplify the wrong that the policy is supposed to correct. Here compression can streamline the phrase and minimize the em barassment while improving the English style. Compression in general is intended to provide efficient representations of data while preserving the essential information contained in the data. This book is devoted to the theory and practice of signal compression, i. e. , data compression applied to signals such as speech, audio, images, and video signals (excluding other data types such as financial data or general purpose computer data). The emphasis is on the conversion of analog waveforms into efficient digital representations and on the compression of digital information into the fewest possible bits. Both operations should yield the highest possible reconstruction fidelity subject to constraints on the bit rate and implementation complexity.

Vector Quantization and Signal Compression (The Springer International Series in Engineering and Computer Science, 159)

Gersho, Allen

Probability, Random Processes, and Ergodic Properties

Probability, Random Processes, and Ergodic Properties is for mathematically inclined information/communication theorists and people working in signal processing. It will also interest those working with random or stochastic processes, including mathematicians, statisticians, and economists. Highlights: Complete tour of book and guidelines for use given in Introduction, so readers can see at a glance the topics of interest. Structures mathematics for an engineering audience, with emphasis on engineering applications. New in the Second Edition: Much of the material has been rearranged and revised for pedagogical reasons. The original first chapter has been split in order to allow a more thorough treatment of basic probability before tackling random processes and dynamical systems. The final chapter has been broken into two pieces to provide separate emphasis on process metrics and the ergodic decomposition of affine functionals. Many classic inequalities are now incorporated into the text, along with proofs; and many citations have been added.

Reference

Entropy and Information Theory

This book is an updated version of the information theory classic, first published in 1990. About one-third of the book is devoted to Shannon source and channel coding theorems; the remainder addresses sources, channels, and codes and on information and distortion measures and their properties. 
New in this edition:
<ul>
<li>Expanded treatment of stationary or sliding-block codes and their relations to traditional block codes</li>
<li>Expanded discussion of results from ergodic theory relevant to information theory</li>
<li>Expanded treatment of B-processes -- processes formed by stationary coding memoryless sources</li>
<li>New material on trading off information and distortion, including the Marton inequality</li>
<li>New material on the properties of optimal and asymptotically optimal source codes</li>
<li>New material on the relationships of source coding and rate-constrained simulation or modeling of random processes</li>
</ul>
Significant material not covered in other information theory texts includes stationary/sliding-block codes, a geometric view of information theory provided by process distance measures, and general Shannon coding theorems for asymptotic mean stationary sources, which may be neither ergodic nor stationary, and d-bar continuous channels.

Chee Sun Won, Springer

Vector Quantization and Signal Compression (The Springer International Series in Engineering and Computer Science)

See the best price to sell, buy, or rent books by Gray, Robert M.. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Gray, Robert M.

See the best price to sell, buy, or rent books by Gray, Robert M.. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Random Processes: A Mathematical Approach for Engineers (Prentice-Hall Information and System Sciences Series)

Stochastic Image Processing (Information Technology: Transmission, Processing and Storage)

An Introduction to Statistical Signal Processing

Image Segmentation and Compression Using Hidden Markov Models (The Springer International Series in Engineering and Computer Science, 571)

Source Coding Theory (The Springer International Series in Engineering and Computer Science, 83)

Vector Quantization and Signal Compression (The Springer International Series in Engineering and Computer Science, 159)

Probability, Random Processes, and Ergodic Properties

Entropy and Information Theory

Stochastic Image Processing (Information Technology: Transmission, Processing and Storage)

Vector Quantization and Signal Compression (The Springer International Series in Engineering and Computer Science)