loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data Compression Conference (DCC '99)
Multiple Description Decoding of Overcomplete Expansions Using Projections onto Convex Sets
Snowbird, Utah
March 29-March 31
ISBN: 0-7695-0096-X
Philip A. Chou, Microsoft Corporation
Sanjeev Mehrotra, Microsoft Corporation
Albert Wang, Microsoft Corporation
This paper presents a POCS-based algorithm for consistent reconstruction of a signal x 2 R K from any subset of quantized coefficients y 2 R N 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 K using only the transforms and their inverses, rather than in the larger space R N 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.
Citation:
Philip A. Chou, Sanjeev Mehrotra, Albert Wang, "Multiple Description Decoding of Overcomplete Expansions Using Projections onto Convex Sets," dcc, pp.72, Data Compression Conference (DCC '99), 1999
Usage of this product signifies your acceptance of the Terms of Use.