Multiple Description Decoding of Overcomplete Expansions Using Projections onto Convex Sets

نویسندگان

  • Philip A. Chou
  • Sanjeev Mehrotra
  • Albert Wang
چکیده

This paper presents a POCS-based algorithm for consistent reconstruction of a signal x 2 R from any subset of quantized coe cients y 2 R in an N K overcomplete frame expansion y = Fx, N = 2K. By choosing the frame operator F to be the concatenation of two K K invertible transforms, the projections may be computed in R using only the transforms and their inverses, rather than in the larger space R using the pseudo-inverse as proposed in earlier work. This enables practical reconstructions from overcomplete frame expansions based on wavelet, subband, or lapped transforms of an entire image, which has heretofore not been possible.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fractal Image Coding as Projections Onto Convex Sets

We show how fractal image coding can be viewed and generalized in terms of the method of projections onto convex sets (POCS). In this approach, the fractal code defines a set of spatial domain similarity constraints. We also show how such a reformulation in terms of POCS allows additional contraints to be imposed during fractal image decoding. Two applications are presented: image construction ...

متن کامل

Image De-Quantizing via Enforcing Sparseness in Overcomplete Representations

We describe a method for removing quantization artifacts (de-quantizing) in the image domain, by enforcing a high degree of sparseness in its representation with an overcomplete oriented pyramid. For this purpose we devise a linear operator that returns the minimum L2-norm image preserving a set of significant coefficients, and estimate the original by minimizing the cardinality of that subset,...

متن کامل

Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces

We present a modification of Dykstra’s algorithm which allows us to avoid projections onto general convex sets. Instead, we calculate projections onto either a halfspace or onto the intersection of two halfspaces. Convergence of the algorithm is established and special choices of the halfspaces are proposed. The option to project onto halfspaces instead of general convex sets makes the algorith...

متن کامل

Quantization Design for Structured Overcomplete Expansions

The study of quantized overcomplete (redundant) expansions is relevant to severalimportant applications such as oversampled A/D conversion of band-limited sig-nals, multiple description quantization, joint source-channel coding and content-based retrieval for image databases. The problem of quantization of overcompleteexpansions is not as well understood as that of quantization ...

متن کامل

Removal of compression artifacts using projections onto convex sets and line process modeling

We present a new image recovery algorithm to remove, in addition to blocking, ringing artifacts from compressed images and video. This new algorithm is based on the theory of projections onto convex sets (POCS). A new family of directional smoothness constraint sets is defined based on line processes modeling of the image edge structure. The definition of these smoothness sets also takes into a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999