Time-varying convex optimization: Time-structured algorithms and applications
Optimization underpins many of the challenges that science and technology face on a daily
basis. Recent years have witnessed a major shift from traditional optimization paradigms …
basis. Recent years have witnessed a major shift from traditional optimization paradigms …
A survey of sparse representation: algorithms and applications
Sparse representation has attracted much attention from researchers in fields of signal
processing, image processing, computer vision, and pattern recognition. Sparse …
processing, image processing, computer vision, and pattern recognition. Sparse …
Recursive recovery of sparse signal sequences from compressive measurements: A review
In this overview article, we review the literature on design and analysis of recursive
algorithms for reconstructing a time sequence of sparse signals from compressive …
algorithms for reconstructing a time sequence of sparse signals from compressive …
Event-triggered state observers for sparse sensor noise/attacks
This paper describes two algorithms for state reconstruction from sensor measurements that
are corrupted with sparse, but otherwise arbitrary,“noise.” These results are motivated by the …
are corrupted with sparse, but otherwise arbitrary,“noise.” These results are motivated by the …
Enhanced group sparse regularized nonconvex regression for face recognition
Regression analysis based methods have shown strong robustness and achieved great
success in face recognition. In these methods, convex-norm and nuclear norm are usually …
success in face recognition. In these methods, convex-norm and nuclear norm are usually …
Hybrid photoacoustic and fast super-resolution ultrasound imaging
The combination of photoacoustic (PA) imaging and ultrasound localization microscopy
(ULM) with microbubbles has great potential in various fields such as oncology …
(ULM) with microbubbles has great potential in various fields such as oncology …
Underdetermined blind source separation using sparse coding
In an underdetermined mixture system with n unknown sources, it is a challenging task to
separate these sources from their m observed mixture signals, where mn By exploiting the …
separate these sources from their m observed mixture signals, where mn By exploiting the …
Prediction-correction algorithms for time-varying constrained optimization
A Simonetto, E Dall'Anese - IEEE Transactions on Signal …, 2017 - ieeexplore.ieee.org
This paper develops online algorithms to track solutions of time-varying constrained
optimization problems. Particularly, resembling workhorse Kalman filtering-based …
optimization problems. Particularly, resembling workhorse Kalman filtering-based …
A high-resolution DOA estimation method with a family of nonconvex penalties
The low-rank matrix reconstruction (LRMR) approach is widely used in direction-of-arrival
(DOA) estimation. As the rank norm penalty in an LRMR is NP-hard to compute, the nuclear …
(DOA) estimation. As the rank norm penalty in an LRMR is NP-hard to compute, the nuclear …
Sequential compressed sensing with progressive signal reconstruction in wireless sensor networks
M Leinonen, M Codreanu… - IEEE Transactions on …, 2014 - ieeexplore.ieee.org
This paper considers sequential compressed acquisition and progressive reconstruction of
spatially and temporally correlated sensor data streams in wireless sensor networks (WSNs) …
spatially and temporally correlated sensor data streams in wireless sensor networks (WSNs) …