Motivation: Gene transcription requires the orchestrated binding of various proteins to the promoter of a gene. The binding times and binding order of proteins allow to draw conclusions about the proteins’ exact function in the recruitment process. Time-resolved ChIP experiments are being used to analyze the order of protein binding for these processes. However, these ChIP signals do not repres...

In this paper, Shalvi and Weinstein’s super-exponential (SE) algorithm using higher order statistics for blind deconvolution of one-dimensional (1-D) linear time-invariant systems is extended to a two-dimensional (2-D) SE algorithm. Then, a 2-D frequency-domain blind system identification (BSI) algorithm for 2-D linear shift-invariant (LSI) systems using the computationally efficient 2-D SE alg...

Recovering an un-blurred image from a single motion-blurred picture has long been a fundamental research problem. If one assumes that the blur kernel – or point spread function (PSF) – is shift invariant, the problem reduces to that of image deconvolution. Image deconvolution can be further categorized as non-blind and blind. In non-blind deconvolution, the motion blur kernel is assumed to be k...

We propose easy-to-implement algorithms to perform blind deconvolution of nonnegative images in the presence of noise of Poisson type. Alternate minimization of a regularized Kullback-Leibler cost function is achieved via multiplicative update rules. The scheme allows to prove convergence of the iterates to a stationary point of the cost function. Numerical examples are reported to demonstrate ...

We present a fast unsupervised myopic deconvolution method dedicated to quasi-real time processing of video sequences such as angiograms. Our method is based on a Bayesian approach of which the tuning parameters are automatically set thanks to the marginalized likelihood of the observed image. We demonstrate the effectiveness of our approach on simulated and empirical images. 1. CONTEXT AND PRE...