Skip to Main Content
Advances in Visual Data Compression and Communication
book

Advances in Visual Data Compression and Communication

by Feng Wu
July 2014
Intermediate to advanced content levelIntermediate to advanced
513 pages
16h 40m
English
Auerbach Publications
Content preview from Advances in Visual Data Compression and Communication
i
i
i
i
i
i
i
i
13.4 Network Capacity of Compressive Data Gathering 279
sparsity and favorable structure of the overcomplete system. Moreover, they also
proved that stable recovery of the sparse signal in an overcomplete dictionary also
works for noisy data, and the optimally sparse approximation to the noisy data, to
within the noise level, differs from the optimally sparse decomposition of the ideal
noiseless signal by at most a constant multiple of the noise level.
Suppose
˜
x is a vector of length 2N, and is the solution to the l
1
-minimization
problem defined in Eq. (13.8) when an overcomplete dictionary is used. Similarly,
the original sensor readings can be reconstructed by
˜
d = Ψ
0
˜
x. Denote
˜
x
s
as an N-
dimensional vector composed of the last N elements of ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

The Magic of Computer Graphics

The Magic of Computer Graphics

Noriko Kurachi

Publisher Resources

ISBN: 9781482234138