By Topic

IEEE Signal Processing Letters

Issue 5 • Date May 2000

Filter Results

Displaying Results 1 - 9 of 9
  • Very fast JPEG compression using hierarchical vector quantization

    Publication Year: 2000, Page(s):97 - 99
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (135 KB)

    We derive a JPEG compliant image compressor, which is based on hierarchical vector quantization (HVQ). The goal is to reduce complexity while increasing compression speed. For each block, the DCT DC coefficient is encoded in the regular way, while the residual is mapped through HVQ to a precomputed bit stream corresponding to the compressed DCT AC coefficients. Approximation quality is generally g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Filterbanks design for multisensor data fusion

    Publication Year: 2000, Page(s):100 - 103
    Cited by:  Papers (25)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (110 KB)

    In this letter, we investigate the problem of fusion of data collected by sensors having different ground and wavelength resolutions. This is a typical problem encountered in the interpretation of remotely sensed images. The approach that is proposed here is based on the use of cosine-modulated uniform filter banks. We assume that the ratio of the sampling periods of the input data is not integer ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analysis on the effect of image features on lossy coding performance

    Publication Year: 2000, Page(s):104 - 107
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (177 KB)

    When a variety of multimedia images of different types (natural, synthetic, compound, medical, etc.) are compressed using a fixed wavelet filter, it is observed that the peak SNR (PSNR) values for a given compression ratio vary widely by as much as 30 dB from image to image. In this letter, it is shown that most of the gray-level histogram statistics of the images do not have any direct effect on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectral enhancement based on global soft decision

    Publication Year: 2000, Page(s):108 - 110
    Cited by:  Papers (88)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    In this letter, we propose a novel speech enhancement technique based on global soft decision. The proposed approach provides a unified framework for such procedures as speech absence probability (SAP) computation, spectral gain modification, and noise spectrum estimation using the same statistical model assumption. Performances of the proposed enhancement algorithm are evaluated by subjective tes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple and fast way of generating a harmonic signal

    Publication Year: 2000, Page(s):111 - 113
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (43 KB)

    Harmonic models are widely used for text-to-speech (TTS) systems based on a concatenation of acoustic units. The fast generation of a harmonic signal is an important issue in reducing the complexity of TTS systems based on these models. In this letter, we propose a novel method of generating a harmonic signal based on delayed multi-resampled cosine functions (DMRCs). The DMRC method is compared wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Strang-Fix interpolation error bound in an operator setting

    Publication Year: 2000, Page(s):114 - 115
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 KB)

    A generalization of the important Strang-Fix bound in the domain of L/sub 2/ interpolation and quasi-interpolation is presented. The results presented are obtained by straightforward and well-known operator and algebra norm techniques. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Orthogonal Oja algorithm

    Publication Year: 2000, Page(s):116 - 119
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    In this letter, we propose an orthogonalized version of the Oja algorithm (OOja) that can be used for the estimation of minor and principal subspaces of a vector sequence. The new algorithm offers, as compared to Oja, such advantages as orthogonality of the weight matrix, which is ensured at each iteration, numerical stability, and a quite similar computational complexity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A morphological estimator for clique potentials of binary Markov random fields

    Publication Year: 2000, Page(s):120 - 122
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (102 KB)

    The authors consider the problem of estimating the parameters of a binary Markov random field from a given realization. They propose a consistent estimator of the clique potentials that can be implemented by means of morphological erosions. Experimental results demonstrate the effectiveness of the proposed approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On complexity reduction of trellis-based scalar vector quantizers by signaling of regions

    Publication Year: 2000, Page(s):123 - 125
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (78 KB)

    This article presents a method to reduce the complexity of trellis-based scalar-vector quantizers. The proposed method partitions the reproduction alphabet into equal-area regions and shapes the codebook subject to a rate-reduced signaling of these regions. As the shaping bit rate reduces, the coder complexity can be significantly reduced without sacrificing any rate-distortion performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

The IEEE Signal Processing Letters is a monthly, archival publication designed to provide rapid dissemination of original, cutting-edge ideas and timely, significant contributions in signal, image, speech, language and audio processing.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Peter Willett
University of Connecticut
Storrs, CT 06269
peter.willett@uconn.edu