BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//EE - ECPv5.10.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:EE
X-ORIGINAL-URL:https://ee.iisc.ac.in
X-WR-CALDESC:Events for EE
BEGIN:VTIMEZONE
TZID:Asia/Kolkata
BEGIN:STANDARD
TZOFFSETFROM:+0530
TZOFFSETTO:+0530
TZNAME:IST
DTSTART:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20240326T090000
DTEND;TZID=Asia/Kolkata:20240326T110000
DTSTAMP:20260526T042755
CREATED:20240325T061036Z
LAST-MODIFIED:20240325T061324Z
UID:241418-1711443600-1711450800@ee.iisc.ac.in
SUMMARY:PhD Thesis defence on Imaging Inverse Problems
DESCRIPTION:Title : Improved Derivative-based Regularizations for Imaging Inverse   problems\n\nStudent : Manu Ghulyani\n\nAdvisor : Prof. Muthuvel Arigovindan\n\nThesis Examiner:  Prof.  Ajit Rajwade\nDepartment of Computer Science and Engineering\,\nIIT Bombay.\n\nDate and Time:   26.03.2024 (Tuesday)\,  :.9:00  am\n\nVenue :  MMCR\, Department of Electrical Engineering\n\nAlso online in Teams\n\n\n\nAbstract:\n\n\nImages undergo degradation during the capturing process due to physical limitations inherent to the capturing devices. Addressing this degradation and recovering high-quality images constitute the image recovery problem\, a crucial concern with diverse applications across various fields such as biology\, astronomy\, and medicine. The enhancement of captured image resolution significantly influences these disciplines. Examples of this problem include tasks like reconstructing computed tomography images\, magnetic resonance imaging\, image deconvolution\, and microscopic image reconstruction.\n\nImage recovery is frequently approached using regularization techniques\, with derivative-based regularizations being popular due to their ability to exploit image smoothness\, yielding interpretable results devoid of introduced artifacts. Total Variation regularization (TV)\, proposed by Rudin\, Osher\, and Fatemi\, is a seminal approach for image recovery. TV involves the norm of the image’s gradient\, aggregated over all pixel locations. As TV encourages minimal values in the derivative norm\, it leads to piece-wise constant solutions\, resulting in what is known as the “staircase effect.” To mitigate this effect\, the Hessian Schatten norm regularization (HSN) employs second-order derivatives\, represented by the pth norm of eigenvalues in the image hessian vector\, summed across all pixels. HSN demonstrates superior structure-preserving properties compared to TV. However\, HSN solutions tend to be overly smoothed. To address this\, we introduce a non-convex shrinkage penalty applied to the Hessian’s eigenvalues\, deviating from the convex lp norm. While the analytical form of this penalty was unknown\, we derived the algorithm using proximal operations. We established that the proposed regularization adhered to restricted proximal regularity\, ensuring the algorithm’s convergence. The images recovered by this regularization were sharper than the convex counterparts.\n\nIn the subsequent work\, we extend the concept of the Hessian-Schatten norm. By encompassing Schatten norms of the Hessian and introducing a smoothness constraint\, we broaden the scope of Hessian Schatten norm. The resulting regularization can be derived as a Lagrange dual of the Hessian Schatten norm\, akin to the total generalized variation. Furthermore\, we present an efficient variable splitting scheme for solving image restoration challenges.\n\nTotal Generalized Variation (TGV) represents an important generalization of Total Variation. TGV involves multiple orders of derivatives\, with higher-order TGV leading to improved recovered image quality. This enhancement has been validated through numerical experiments in image denoising. Consequently\, a demand arises for an algorithm capable of solving TGV for any order. While various methods address TGV regularization\, many are confined to second-order TGV\, and only a few explore orders greater than three for image recovery with TGV regularization. To our knowledge\, no algorithm resolves image recovery challenges employing TGV regularization for orders exceeding three under a general forward model. This challenge arises from the intricate nature of TGV representation. We surmount this obstacle by presenting two simple matrix based representations of TGV: the direct and compact forms. We prove the equivalence of both forms with the original TGV definition. Leveraging the compact representation\, we propose a generalized ADMM-based algorithm to solve TGV regularization for any order.\n\nALL ARE WECOME.
URL:https://ee.iisc.ac.in/event/phd-thesis-defence-on-imaging-inverse-problems/
LOCATION:Multi-Media Class Room (MMCR)\, EE Department (Hybrid mode)
END:VEVENT
END:VCALENDAR