JMLR
2010
13 years 6 months ago
2010
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
ICIP
2005
IEEE
14 years 5 months ago
2005
IEEE
A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm avoids the multiple passes of bit-plane coding for speed impro...