Speak to a world-class expert now.
1-800-FOR-KKAI (1-800-367-5524)
info@kkai.com
PrimeTrack® Instant Conferencing
PrimeTrack® Project Management System (patent pending)
CENTER FOR RAPID RESPONSE ENGINEERING® SOLUTIONS
ENGINEERING AND SCIENTIFIC CONSULTING SERVICES
2D-Pattern Matching Image and Video Compression: Theory, Algorithms, and Experiments
Consultant
KWY is a Computer Scientist, Algorithm Analysis and Design Expert, Bioinformatics Expert, Information Theory, Multimedia Compression Consultant, Computer Systems and Computer Communication Networks Consultant with world-class expertise in analysis and design of algorithms, bioinformatics, information theory, multimedia compression, random structures, performance evaluation, analytic combinatorics, discrete mathematics, pattern matching, stability problems in distributed systems, modeling of computer systems and computer communication networks, queueing theory, and operations research
Speak to this experienced, world-class expert now.
- Call (317) 735-4807
- E-mail kwy@rapid-response-consulting.com
For additional or different expertise, browse other top-level expert resumes in Expert Testimony, Failure Analysis, Manufacturing Optimization, KKAI's Center for Rapid Response Engineering® Solutions and a host of other Engineering and Scientific Consulting services.
Learn how KKAI assembles expert teams of any size or skill set combination to meet our clients' needs on a rapid-response basis - no matter how complex the challenge.
Or, peruse our 400 case studies or 500 other expert resumes.
Abstract
In this paper, we propose a lossy data compression framework based on an approximate two-dimensional (2D) pattern matching (2D-PMC) extension of the Lempel–Ziv lossless scheme. This framework forms the basis upon which higher level schemes relying on differential coding, frequency domain techniques, prediction, and other methods can be built. We apply our pattern matching framework to image and video compression and report on theoretical and experimental results. Theoretically, we show that the fixed database model used for video compression leads to suboptimal but computationally efficient performance. The compression ratio of this model is shown to tend to the generalized entropy. For image compression, we use a growing database model for which we provide an approximate analysis. The implementation of 2D-PMC is a challenging problem from the algorithmic point of view. We use a range of techniques and data structures such as -d trees, generalized run length coding, adaptive arithmetic coding, and variable and adaptive maximum distortion level to achieve good compression ratios at high compression speeds.We demonstrate bit rates in the range of 0.25–0.5 bpp for high-quality images and data rates in the range of 0.15–0.5 Mbps for a baseline video compression scheme that does not use any prediction or interpolation. We also demonstrate that this asymmetric compression scheme is capable of extremely fast decompression making it particularly suitable for networked multimedia applications.
Index Terms - Approximate pattern matching, arithmetic coding, generalized run-length coding, generalized Shannon entropy, -d trees, Lempel–Ziv schemes, multimedia compression, rate distortion.
To learn more about this paper and this consultant, please contact us.
Read other articles by this KKAI Associate:
A Framework for Self Manipulating Video Streams
Reliable Detection of Episodes in Event Sequences
Detecting Conserved Interaction Patterns in Biological Networks
Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments
| Computer Scientist, Algorithm Analysis and Design Expert, Bioinformatics Expert, Information Theory, Multimedia Compression Consultant, Computer Systems and Computer Communication Networks Consultant, analysis and design of algorithms, bioinformatics, information theory, multimedia compression, random structures, performance evaluation, analytic combinatorics, discrete mathematics, pattern matching, stability problems in distributed systems, modeling of computer systems and computer communication networks, queueing theory, and operations research | |
| Resume of CBL | information security, neural network, fuzzy logic, wireless expert consultant |
| Resume of YKN | neural network, data mining, information retrieval expert consultant |
| Resume of IBU | wireless, networking, audio, voip, internet expert consultant |
| Resume of ZXS | chemical process automation, modeling, optimization, expert consultant |
| Resume of IFT | design for manufacture, assembly, process improvement expert consultant |
To search for specific expertise, enter your search query (type of
expertise you are seeking) in the box below, choose to search the entire
Rapid-Response site or just resumes and brochures, then click the search button.
Please note that the list of resumes available online is a select subset of our
vast database. If your search of our site does not reveal the expertise you are
seeking, please call us toll-free (in the U.S.) at 1-800-367-5524 or
contact us for more information and we will gladly assist you in
locating the specific expertise you require.
Have an urgent litigation support or engineering and scientific consulting need? Contact KKAI now for world-class, expert rapid response.
1-800-FOR-KKAI (1-800-367-5524)
info@kkai.com
BACK TO THE TOP OF THIS PAGE
Kevin Kennedy & Associates, Inc.
Rapid Response Engineering® Solutions
3905 Vincennes Road, Suite 320
Indianapolis, Indiana 46268
(317) 536-7000 voice
(317) 536-7220 fax