Results 141 to 150 of about 1,258 (196)
Some of the next articles are maybe not open access.
A progressive Lossless/Near-Lossless image compression algorithm
IEEE Signal Processing Letters, 2002A novel image compression technique is presented that incorporates progressive transmission and near-lossless compression in a single framework. Experimental performance of the proposed coder proves to be competitive with the state-of-the-art compression schemes.
N Memon, B Sankur
exaly +2 more sources
Near-Lossless Compression of Hyperspectral Images
2006 International Conference on Image Processing, 2006Research Supported By National Science Foundation Grant Number Ccr-0104800. Richard Ladner was supported in part by the Boeing Professor-ship in Computer Science and Engineering. Contact Information: Professor Agnieszka Miguel, Department of Electrical & Computer Engineering Seattle University, 901 12th Avenue, P.O. Box 222000, Seattle, WA 98122-1090, (
Agnieszka C. Miguel +4 more
openaire +1 more source
Near-lossless compression of medical images
1995 International Conference on Acoustics, Speech, and Signal Processing, 2002This paper studies the characteristic properties of a specific class of near-lossless image compression schemes which consists of a lossless coder followed by a uniform scalar quantizer. Three specific instances of such schemes are investigated; namely, differential pulse code modulation, hierarchical interpolation, and two-dimensional space-varying ...
Manohar Das, David L. Neuhoff, C. L. Lin
openaire +1 more source
Near-lossless compression of coherent image data
Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205), 2002Near-lossless compression yielding strictly bounded reconstruction error, is extended to preserved the radiometric resolution of data produced by coherent imaging systems. A noncausal DPCM, based on the Rational Laplacian Pyramid (RLP), recently introduced by the authors for despeckling, is adjusted to this purpose. The baseband icon of the RLP is DPCM
Bruno Aiazzi +2 more
openaire +4 more sources
Near-Lossless Compression of Mass Spectra for Proteomics
2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07, 2007Recent improvements in mass spectrometry (MS) technology led to an explosive amount of MS data collected and shared. A typical liquid chromatography/mass spectrometry (LC/MS) "image" from the instrument used in this study consists of 4 GB of data.
Agnieszka C. Miguel +5 more
openaire +1 more source
A Novel Near Lossless Image Compression Method
2019 IEEE International Symposium on Circuits and Systems (ISCAS), 2019A novel near lossless image compression method is proposed in this paper. In the proposed method, a redundant representation of the image is firstly obtained by pixel level shifting and then partitioned into image blocks with the same size. Next, the image blocks are classified into smooth image blocks and non-smooth image blocks.
Fulin Li, Shaohua Hong, Lin Wang 0003
openaire +1 more source
Near‐lossless compression methods for spectral images
Color Research & Application, 2011AbstractIn this work, several near‐lossless compression methods for spectral images have been analyzed and compared. These methods are based both on the principal component analysis (PCA) and on the choice of a minimum number of spectral points, selected following different criteria.
CIPRIAN, Roberta, Carbucicchio, M.
openaire +2 more sources
NEAR-LOSSLESS COMPRESSION OF REMOTE-SENSING DATA
2003This paper describes data compression algorithms capable to preserve the scientific quality of remote-sensing data, yet allowing a considerable bandwidth reduction to be achieved. Unlike lossless techniques, by which a moderate compression ratio (CR) is attainable, due to the intrinsic noisiness of the data, and conventional lossy techniques, in which ...
Bruno Aiazzi +3 more
openaire +4 more sources
Near-lossless compression of large alphabet sources
2012 46th Annual Conference on Information Sciences and Systems (CISS), 2012We study universal compression of independent and identically distributed sources over large alphabets using fixed-rate codes. To model large alphabets, we use sequences of discrete alphabets that increase in size with the blocklength. We show that universal compression is possible using deterministic codes provided that the alphabet growth is sub ...
Benjamin G. Kelly, Aaron B. Wagner
openaire +1 more source
Near-lossless compression of 3-D optical data
IEEE Transactions on Geoscience and Remote Sensing, 2001In this work, near-lossless compression yielding strictly bounded reconstruction error is proposed for high-quality compression of remote sensing images. A classified causal DPCM scheme is presented for optical data, either multi/hyperspectral three-dimensional (3-D) or panchromatic two-dimensional (2-D) observations. It is based on a classified linear-
Bruno Aiazzi +2 more
openaire +3 more sources