Image Segmentation and Compression Using Hidden Markov Models
Our rough guess is there are 35,250 words in this book.
At a pace averaging 250 words per minute, this book will take 2 hours and 21 minutes to read. With a half hour per day, this will take 5 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Gray, Robert M. - Contributor
Publication
2000 - Springer US, Boston, MA, Massachusetts
Language
English
Word Count
35,250 words, Guess
Page Count
141 pages
Physical Format
Electronic resource
Identifiers
- Internet Archiveimagesegmentatio00liji
- ISBN-101461370272
- ISBN-101461544971
- ISBN-139781461370277
- ISBN-139781461544975
and 4 more
- OCLC Control Number851823478
- Better World Books9781461370277
- Better World Books9781461544975
- Open LibraryOL27044924M
Classifications
- DDC006.6
- DDC006.37
- LCCTA1637-1638
and 2 more
- LCCTA1637-1638TA1634TK5
- LCCTA1634
Description
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.
Subjects
Series Statement
- The Springer International Series in Engineering and Computer Science -- 571
- International series in engineering and computer science -- 571.
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!