Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Dynamic Sparse State Estimation Using ℓ1-ℓ1 Minimization: Adaptive-rate Measurement Bounds, Algorithms and Applications
 
conference paper

Dynamic Sparse State Estimation Using ℓ1-ℓ1 Minimization: Adaptive-rate Measurement Bounds, Algorithms and Applications

Mota, João
•
Deligiannis, Nikos
•
Sankaranarayanan, Aswin C.
Show more
2015
2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
40th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2015

We propose a recursive algorithm for estimating time-varying signals from a few linear measurements. The signals are assumed sparse, with unknown support, and are described by a dynamical model. In each iteration, the algorithm solves an ℓ1-ℓ1 minimization problem and estimates the number of measurements that it has to take at the next iteration. These estimates are computed based on recent theoretical results for ℓ1-ℓ1 minimization. We also provide sufficient conditions for perfect signal reconstruction at each time instant as a function of an algorithm parameter. The algorithm exhibits high performance in compressive tracking on a real video sequence, as shown in our experimental results. Index Terms— State estimation, sparsity, background subtraction, motion estimation, online algorithms

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

ICASSP 2015 paper.pdf

Access type

openaccess

Size

148.7 KB

Format

Adobe PDF

Checksum (MD5)

70a4165502c4f8b9d7b17953ed403f71

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés