SearcharxivSearch

arXiv subjects

Onur Yorulmaz

Publications and source records attributed to Onur Yorulmaz.

3 recordsLinked to original sources

A Blind Deconvolution Technique Based on Projection Onto Convex Sets for Magnetic Particle Imaging

Magnetic Particle Imaging (MPI) is an emerging imaging modality that maps the spatial distribution of magnetic nanoparticles. The x-space reconstruction in MPI results in highly blurry images, where the resolution depends on both system parameters and nanoparticle type. Previous techniques to counteract this blurring rely on the knowledge of the imaging point spread function (PSF), which may not be available or may require additional measurements. This work proposes a blind deconvolution algorithm for MPI to recover the precise spatial distribution of nanoparticles. The proposed algorithm exploits the observation that the imaging PSF in MPI has zero phase in Fourier domain. Thus, even though the reconstructed images are highly blurred, phase remains unaltered. We leverage this powerful property to iteratively enforce consistency of phase and bounded l1 energy information, using an orthogonal Projections Onto Convex Sets (POCS) algorithm. To demonstrate the method, comprehensive simulations were performed without and with nanoparticle relaxation effects, and at various noise levels. In addition, imaging experiments were performed on an in-house MPI scanner using a three-vial phantom that contained different nanoparticle types. Image quality was compared with conventional deconvolution methods, Wiener deconvolution and Lucy-Richardson method, which explicitly rely on the knowledge of PSF. Both the simulation results and experimental imaging results show that the proposed blind deconvolution algorithm outperforms the conventional deconvolution methods. Without utilizing the imaging PSF, the proposed algorithm improves image quality and resolution even in the case of different nanoparticle types, while displaying reliable performance against loss of the fundamental harmonic, nanoparticle relaxation effects, and noise.

physics.med-ph

Optimized Sharing of Coefficients in Parallel Filter Banks

Filters are the basic and most important blocks of most signal processing applications. In many applications, a group of parallel filters are used as filter banks. Parallel filter banks naturally require much more computations. Especially on chip applications, the resources are limited and shared among many algorithms. For this purpose, many filter optimization schemes are proposed to reduce the number of resources that filtering operations require. In this work, a novel optimization algorithm is proposed to decrease the number of operations in a group of parallel filters. The filter coefficients are grouped in a two stage process which enables increased coefficient sharing between different filters. The algorithm is capable of decreasing the number of registers, look-up tables and DSP48s by up to 50\% of a regular parallel filter bank, without requiring increased sampling rate.

eess.SP

Phase and TV Based Convex Sets for Blind Deconvolution of Microscopic Images

In this article, two closed and convex sets for blind deconvolution problem are proposed. Most blurring functions in microscopy are symmetric with respect to the origin. Therefore, they do not modify the phase of the Fourier transform (FT) of the original image. As a result blurred image and the original image have the same FT phase. Therefore, the set of images with a prescribed FT phase can be used as a constraint set in blind deconvolution problems. Another convex set that can be used during the image reconstruction process is the epigraph set of Total Variation (TV) function. This set does not need a prescribed upper bound on the total variation of the image. The upper bound is automatically adjusted according to the current image of the restoration process. Both of these two closed and convex sets can be used as a part of any blind deconvolution algorithm. Simulation examples are presented.

math.OC