Filter banks with nonlinear lifting steps for lossless image compression

Masahiro Okuda, Sanjit K. Mitra, Masaaki Ikehara, Shin Ichi Takahashi

Research output: Contribution to journalConference article

2 Citations (Scopus)

Abstract

Most natural images are well modeled as smoothed areas segmented by edges. The smooth areas can be well represented by a wavelet transform with high regularity and with fewer coefficients which requires highpass filters with some vanishing moments. However for the regions around edges, short highpass filters are preferable. In one recently proposed approach, this problem was solved by switching filter banks using longer filters for smoothed areas of the images and shorter filters for areas with edges [1]. This approach was applied to lossy image coding resulting in a reduction of ringing artifacts. As edges were predicted using neighboring pixels, the nonlinear transforms made the decorrelation more flexible. In this paper we propose a time-varying filterbank and apply it to lossless image coding. In this scheme, we estimate the standard deviation of the neighboring pixels of the current pixel by solving the maximum likelihood problem. The filterbank is switched between three filter banks, depending on the estimated standard deviation.

Original languageEnglish
Pages (from-to)797-801
Number of pages5
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE84-A
Issue number3
Publication statusPublished - 2001 Mar
Externally publishedYes
Event13th Workshop on Circuits and Systems in Karuizawa - Karuizawa, Japan
Duration: 2000 Apr 242000 Apr 25

Keywords

  • Filter banks
  • Lifting
  • Lossless image compression

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Filter banks with nonlinear lifting steps for lossless image compression'. Together they form a unique fingerprint.

  • Cite this