Sciweavers

1391 search results - page 171 / 279
» Optimally Sparse Frames
Sort
View
ICIP
2009
IEEE
15 years 2 months ago
Informative sensing of natural images
The theory of compressed sensing tells a dramatic story that sparse signals can be reconstructed near-perfectly from a small number of random measurements. However, recent work ha...
Hyun Sung Chang, Yair Weiss, William T. Freeman
118
Voted
ICIP
2010
IEEE
15 years 2 months ago
Filterbank-based universal demosaicking
Recent advances in spatio-spectral sampling and panchromatic pixels have contributed to increased spatial resolution and enhanced noise performance. As such, it is necessary to co...
Jing Gu, Patrick J. Wolfe, Keigo Hirakawa
132
Voted
IJRR
2010
132views more  IJRR 2010»
15 years 2 months ago
LQR-trees: Feedback Motion Planning via Sums-of-Squares Verification
Advances in the direct computation of Lyapunov functions using convex optimization make it possible to efficiently evaluate regions of attraction for smooth nonlinear systems. Her...
Russ Tedrake, Ian R. Manchester, Mark Tobenkin, Jo...
IOR
2011
175views more  IOR 2011»
14 years 12 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....
INTERSPEECH
2010
14 years 11 months ago
Convexity and fast speech extraction by split bregman method
A fast speech extraction (FSE) method is presented using convex optimization made possible by pause detection of the speech sources. Sparse unmixing filters are sought by l1 regul...
Meng Yu, Wenye Ma, Jack Xin, Stanley Osher