Fourier synthesis via partially finite convex programming

Authors:
Pierre MaréChal;Daphné Wallach
Affiliations:
Université Paul Sabatier, Toulouse, France;Université Paul Sabatier, Toulouse, France
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2009

Citing 3
Cited 0

Partially finite convex programming, part I: quasi relative interiors and duality theory

Mathematical Programming: Series A and B
Convex analysis and variational problems

Convex analysis and variational problems
Non-quadratic convex regularized reconstruction of MR images from spiral acquisitions

Signal Processing - Signal processing in UWB communications

Quantified Score

Hi-index	0.98

Visualization

Abstract

A dual algorithm for problems of Fourier Synthesis is proposed. Partially finite convex programming provides tools for a formulation which enables to elude static pixelization of the object to be reconstructed. This leads to a regularized reconstruction-interpolation formula for problems in which finitely many and possibly irregularly spaced samples of the Fourier transform of the unknown object are known, as is the case in Magnetic Resonance Imaging with non-Cartesian and sparse acquisitions.