Minimisation of sparse higher-order energies for large-scale problems in imaging

Duration: 1 hour 13 mins 28 secs

Share this media item:

Embed this media item:

<iframe width="_width_" height="_height_" src="https://sms.cam.ac.uk/media/1119137/embed" frameborder="0" scrolling="no" allowfullscreen></iframe>

Choose size:

About this item

Available Formats

About this item

Description:	Schönlieb, CB (Cambridge) Wednesday 23 March 2011, 16:00-17:00

Created:

2011-03-25 15:37

Collection:

Compressed Sensing LMS Series 2011

Publisher:

Isaac Newton Institute

Schönlieb, CB

Language:

eng (English)

Credits:

Author:	Schönlieb, CB
Director:	Steve Greenham


Abstract:	In this talk we discuss the numerical solution of minimisation problems promoting higher-order sparsity properties. In particular, we are interested in total variation minimisation, which enforces sparsity on the gradient of the solution. There are several methods presented in the literature for performing very efficiently total variation minimisation, e.g., for image processing problems of small or medium size. Because of their iterative-sequential formulation, none of them is able to address in real-time extremely large problems, such as 4D imaging (spatial plus temporal dimensions) for functional magnetic-resonance in nuclear medical imaging, astronomical imaging or global terrestrial seismic tomography. For these cases, we propose subspace splitting techniques, which accelerate the numerics by dimension reduction and preconditioning. A careful analysis of these algorithms is furnished with a presentation of their application to some imaging tasks.

Abstract:

In this talk we discuss the numerical solution of minimisation problems promoting higher-order sparsity properties. In particular, we are interested in total variation minimisation, which enforces sparsity on the gradient of the solution. There are several methods presented in the literature for performing very efficiently total variation minimisation, e.g., for image processing problems of small or medium size. Because of their iterative-sequential formulation, none of them is able to address in real-time extremely large problems, such as 4D imaging (spatial plus temporal dimensions) for functional magnetic-resonance in nuclear medical imaging, astronomical imaging or global terrestrial seismic tomography. For these cases, we propose subspace splitting techniques, which accelerate the numerics by dimension reduction and preconditioning. A careful analysis of these algorithms is furnished with a presentation of their application to some imaging tasks.

Available Formats

Format	Quality	Bitrate	Size
MPEG-4 Video	640x360	1.85 Mbits/sec	1.00 GB	View	Download
WebM	640x360	1.47 Mbits/sec	806.46 MB	View	Download
Flash Video	484x272	568.8 kbits/sec	306.07 MB	View	Download
iPod Video	480x270	506.18 kbits/sec	272.43 MB	View	Download
MP3	44100 Hz	125.0 kbits/sec	67.08 MB	Listen	Download
Auto *	(Allows browser to choose a format it supports)