BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/582
DTSTAMP:20230914T125930Z
SUMMARY:Greedy Recovery Algorithms in Compressive Sensing: A Review and Som
 e New Results
DESCRIPTION:Speaker: Mrityunjoy Chakraborty (Indian Institute of Technology
 \nDepartment of Electronics & Electrtical\nCommunication Engineering\nKhar
 agpur 721302)\n\nAbstract: \nAbstract: Compressed sensing or compressive s
 ampling (CS) is a powerful technique to represent signals at a sub-Nyquist
  sampling rate while retaining the capacity of perfect (or near perfect) r
 econstruction of the signal\, provided the signal is known to be sparse in
  some domain. In last few years\, the CS technique has attracted considera
 ble attention from across a wide array of fields like applied mathematics\
 , statistics\, and engineering\, including signal processing areas like MR
  imaging\, speech processing\, analog to digital conversion etc. The frame
 work of CS essentially leads to finding the sparsest solution to a set of 
 under-determined linear equations\, say\, y = A x \, where A is a M  by N
  sensing matrix and y is a compressed measurement vector. The ideal approa
 ch to find the sparsest solution is based on minimization of the l0  norm
  of x under the condition y = A x . However\, due to non-convexity of the 
  l0  norm\, this leads to a NP hard problem and is thus not practical. I
 t has\, however\, been shown that one can obtain the same sparsest solutio
 n by replacing the  l0  norm of x by its  l1 norm provided the matrix A
  satisfies a so-called restricted isometry property (RIP). In recent years
 \, a class of algorithms called greedy CS recovery algorithms have come up
  that exploit the RIP and evaluate the above stated sparsest solution by i
 teratively constructing its true support.\n\nThis talk will introduce the 
 basics of compressed sensing to the audience and take a review of some of 
 the well known greedy recovery algorithms. This will then be followed up b
 y a presentation of some new results related to convergence of some of the
 se algorithms.\n
URL:https://www.tcs.tifr.res.in/web/events/582
DTSTART;TZID=Asia/Kolkata:20150302T143000
DTEND;TZID=Asia/Kolkata:20150302T153000
LOCATION:AG-69
END:VEVENT
END:VCALENDAR