Computing Reviews, the leading online review service for computing literature.

Search

Browse All Reviews > Computing Methodologies (I) > Image Processing And Computer Vision (I.4) > Compression (Coding) (I.4.2) > Approximate Methods (I.4.2...)

Options:

1-10 of 10 Reviews about "Approximate Methods (I.4.2...)":

Date Reviewed

JPEG2000 standard for image compression: concepts, algorithms and VLSI architectures
Acharya T., Tsai P., Wiley-Interscience, New York, NY, 2004. 296 pp. Type: Book (9780471484226), Reviews: (2 of 2)
Acharya and Tsai attempted to include a vast amount of information about the Joint Photographic Experts Group 2000 (JPEG 2000) standard in this book. Apparently, the goal was to write something like a self-contained introduction and re...

Jul 12 2005

JPEG2000 standard for image compression: concepts, algorithms and VLSI architectures
Acharya T., Tsai P., Wiley-Interscience, New York, NY, 2004. 296 pp. Type: Book (9780471484226), Reviews: (1 of 2)
This book contains a wealth of information about the JPEG2000 standard, co-authored by Acharya, who has years of involvement with the standards committee. It begins with background chapters on data and image compression, various coding...

Mar 2 2005

A work-optimal parallel implementation of lossless image compression by block matching
Cinque L., Liberati F., De Agostino S. Nordic Journal of Computing 10(1): 13-20, 2003. Type: Article
Earlier works [1,2], by mostly the same authors, presented sequential and parallel algorithms for lossless compression of bi-level images, using Lempel-Ziv-style greedy block matching. This paper presents a parallel random access machi...

Oct 2 2003

Context-based compression of binary images in parallel
Ageenko E., Forsell M., Fränti P. Software--Practice & Experience 32(13): 1223-1237, 2002. Type: Article
Digital images provide a powerful mechanism for conveying information. Because of their size, however, they are usually stored and transferred in compressed form. For interactive or real-time applications, compression and decompression...

Oct 2 2003

Coding of 3D virtual objects with NURBS
Santa-Cruz D., Ebrahimi T. Signal Processing 82(11): 1581-1593, 2002. Type: Article

This paper presents a method for compressing NURBS 3D models with a small and controllable loss. The scheme uses a differential pulse coded modulation coder with different predictors for knot values and control points, coup...

Apr 2 2003

Second-generation image coding
Reid M., Millar R., Black N. ACM Computing Surveys 29(1): 3-29, 1997. Type: Article
This paper gives an overview of a diverse selection of currently used second-generation image coding techniques that incorporate properties of the human visual system (HVS). These techniques are grouped into categories in order to allo...

Oct 1 1997

CD-I full-motion video encoding on a parallel computer
Sijstermans F., van der Meer J. Communications of the ACM 34(4): 81-91, 1991. Type: Article
For production of compact disc interactive (CD-I) with full-motion video, video sequences have to be coded. Implementation of the encoder on conventional computers appeared to be too slow. Therefore, for early production, a full-motion...

Sep 1 1992

Overview of the p×64 kbit/s video coding standard
Liou M. Communications of the ACM 34(4): 59-63, 1991. Type: Article
The Consultative Committee for International Telephone and Telegraph (CCITT) standard for visual telephony, including videoteleconferencing, using the ISDN network covers a range (p = 1,2,…,30) of bitspeeds; the higher...

Jan 1 1992

MPEG
Le Gall D. Communications of the ACM 34(4): 46-58, 1991. Type: Article
Digital video compression is used for a variety of telecommunications applications: teleconferencing, digital broadcast codec, and video telephony. Military and space systems have used image compression hardware for many years and will...

Sep 1 1991

Three adaptive discrete least squares cubic spline procedures for the compression of data
Prenter P., Westwater E. Computer Vision, Graphics, and Image Processing 33(3): 327-345, 1986. Type: Article
Three algorithms are developed for the compression of one-dimensional data by loosely coupled cubic splines. Spline knots are located by adaptive iterative searches. The methods are applied to the compression of profile retrieval coeff...

Feb 1 1987

Display

per page

Reproduction in whole or in part without permission is prohibited. Copyright 1999-2024 ThinkLoud^®
Terms of Use | Privacy Policy