scispace - formally typeset
W

William A. Pearlman

Researcher at Rensselaer Polytechnic Institute

Publications -  202
Citations -  13136

William A. Pearlman is an academic researcher from Rensselaer Polytechnic Institute. The author has contributed to research in topics: Data compression & Set partitioning in hierarchical trees. The author has an hindex of 36, co-authored 202 publications receiving 12924 citations. Previous affiliations of William A. Pearlman include Texas A&M University & University of Wisconsin-Madison.

Papers
More filters
Proceedings ArticleDOI

An efficient, low-complexity audio coder delivering multiple levels of quality for interactive applications

TL;DR: The experiment shows that this coder yields nearly transparent quality at bit rates 55-66 kbits/sec, and degrades only gradually at lower rates, which shows its potential for interactive applications with levels of quality from good to perceptually transparent.
Book

Digital Signal Compression: Principles and Practice

TL;DR: This book contains a wealth of illustrations, step-by-step descriptions of algorithms, examples and practice problems, which make it an ideal textbook for senior undergraduate and graduate students, as well as a useful self-study tool for researchers and professionals.
Proceedings ArticleDOI

Lossless volumetric medical image compression

TL;DR: An application of the Set Partitioning in Hierarchical Trees (SPIHT) algorithm to volumetric medical images, using a 3D wavelet decomposition and a3D spatial dependence tree.
Journal ArticleDOI

Edge-preserving noise filtering based on adaptive windowing

TL;DR: An adaptation procedure is introduced for determining in real-time the extent on the analysis window in point estimation of signals corrupted by additive noise and the visual results of the signal and image restorations exhibit superior preservation of edge and detail and suppression of noise for the filters with adaptive windows.
Proceedings ArticleDOI

A wavelet-based two-stage near-lossless coder

TL;DR: A simple method to estimate the optimal bit rate is proposed, with a theoretical justification based on the critical rate argument from the rate-distortion theory and the independence of the residual error.