Sciweavers

46 search results - page 4 / 10
» Total Variation Minimization with Separable Sensing Operator
Sort
View
CPAIOR
2010
Springer
13 years 10 months ago
Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
Elvin Coban, John N. Hooker
ECCV
2006
Springer
14 years 7 months ago
Interpolating Orientation Fields: An Axiomatic Approach
Abstract. We develop an axiomatic approach of vector field interpolation, which is useful as a feature extraction preprocessing step. Two operators will be singled out: the curvatu...
Anatole Chessel, Frédéric Cao, Ronan...
ICASSP
2008
IEEE
14 years 2 days ago
Sparse reconstruction by separable approximation
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
Stephen J. Wright, Robert D. Nowak, Mário A...
ICCCN
2008
IEEE
14 years 2 days ago
Energy Minimization through Network Coding for Lifetime Constrained Wireless Networks
— Energy management is the key issue in the design and operation of wireless network applications like sensor networks, pervasive computing and ubiquitous computing where the net...
Nishanth Gaddam, Sudha Anil Gathala, David Lastine...
SIGPRO
2010
135views more  SIGPRO 2010»
13 years 4 months ago
A short note on compressed sensing with partially known signal support
This short note studies a variation of the Compressed Sensing paradigm introduced recently by Vaswani et al., i.e. the recovery of sparse signals from a certain number of linear m...
Laurent Jacques