On arbitrary-level IIR and FIR filters

A recently published method for designing IIR (infinite-impulse-response) digital filters with multilevel magnitude responses is reinterpreted from a different viewpoint. On the basis of this interpretation, techniques for extending these results to the case of finite-impulse-response (FIR) filters are developed. An advantage of the authors' method is that, when the arbitrary-level filter is implemented, its power-complementary filter, which may be required in specific applications, is obtained simultaneously. Also, by means of a tuning factor (a parameter of the scaling matrix), it is possible to generate a whole family of arbitrary-level filters

An Efficient Algorithm for Video Super-Resolution Based On a Sequential Model

In this work, we propose a novel procedure for video super-resolution, that is the recovery of a sequence of high-resolution images from its low-resolution counterpart. Our approach is based on a "sequential" model (i.e., each high-resolution frame is supposed to be a displaced version of the preceding one) and considers the use of sparsity-enforcing priors. Both the recovery of the high-resolution images and the motion fields relating them is tackled. This leads to a large-dimensional, non-convex and non-smooth problem. We propose an algorithmic framework to address the latter. Our approach relies on fast gradient evaluation methods and modern optimization techniques for non-differentiable/non-convex problems. Unlike some other previous works, we show that there exists a provably-convergent method with a complexity linear in the problem dimensions. We assess the proposed optimization method on {several video benchmarks and emphasize its good performance with respect to the state of the art.}Comment: 37 pages, SIAM Journal on Imaging Sciences, 201

Robust Kalman filtering for discrete time-varying uncertain systems with multiplicative noises

Copyright [2002] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this paper, a robust finite-horizon Kalman filter is designed for discrete time-varying uncertain systems with both additive and multiplicative noises. The system under consideration is subject to both deterministic and stochastic uncertainties. Sufficient conditions for the filter to guarantee an optimized upper bound on the state estimation error variance for admissible uncertainties are established in terms of two discrete Riccati difference equations. A numerical example is given to show the applicability of the presented method

Recursive learning of image parameters and restoration of images using EM based learning algorithm

Birçok klasik görüntü onarım tekniği bulanıklık işlevinin bilindiği varsayımı altında çalışır. Ancak, gerçek hayat problemlerinde sadece gözlem verisi elde edilebilmekte bozucu sistemler hakkında yeterli bilgi sağlanamamaktadır. Bu yüzden görüntü onarımının ilk adımı bozucunun öğrenilmesi (tanınması) işlemidir. Geçmişte, görüntü ve bulanıklık parametrelerinin öğrenilmesi Enbüyük Olabilirlik (EO) problemi olarak ele alınmış ve Beklenti Enbüyükleme (BE) yordamı ile çözülmüştür. Özellikle BE yordamının E adımında kapalı yapıda bir çözüm bulunması bu yordamı daha cazip bir hale getirmektedir. Görüntü ve bulanıklık parametrelerinin tüm görüntü verisi kullanılarak öğrenilmesi geçmişte çalışılmış olmakla birlikte, parametrelerin yinelemeli BE’ye dayalı öğrenilmesi daha önce çalışılmamıştır. Yinelemeli teknikler dinamik işlem yetenekleri sayesinde tüm veri üzerinde işlem yapan yöntemlere nispetle çok daha az bellek ihtiyacı duyarlar. Daha az bellek ihtiyacı ise özellikle görüntü işleme alanında çok önemlidir. Bu çalışmada yeni bir eşzamanlı yinelemeli parametre öğrenme ve görüntü onarım yöntemi sunulmuştur. Dinamik Bayesçi Ağ (DBA) yapısında yeni bir çözüm önerilmiştir. Sunulan yöntem EO parametre tanıma ve durum kestirimi için en iyi Kalman yumuşatma ifadelerini içerir. Kalman yumuşatma ifadelerinin yoğun hesaplama gerektirmesi sebebi ile Kalman süzgeç yaklaşıklığı kullanılmıştır. Aynı zamanda, onarılmış görüntü eş zamanlı olarak bu süzgeç çıkışından elde edilmektedir. Görüntü ve bulanıklık parametrelerinin BE öğrenme problemi kapalı yapıda çözümlenmesi başarılmıştır.  Yöntemin başarımı gerçek görüntüler üzerinde yapılan benzetim ve denemeler ile verilmiştir.  Anahtar Kelimeler: Beklenti enbüyükleme, bulanıklık ve görüntü tanıma, yinelemeli işleme, kalman yumuşatma ve süzgeçleme.The image restoration problem can be defined as the general problem of estimating the ideal image from its blurred and noisy version. Many classical image restoration techniques have been reported under the assumption that the blur operation is exactly known. In real life applications, the corruption mechanism of any system is not known because only observed data is available, so it is necessary to handle uncertain events and observations. The image restoration problem is in general ill-posed; a small perturbation on the given data produces large deviations in the solution. The direct inversion of the blur transfer function usually has a large magnitude at high frequencies, therefore excessive amplification of noise results at those frequencies. Clearly, this is not an acceptable solution for noisy images. To overcome the noise sensitivity problem of the inverse filter, some filters have been developed based on the least-squares structure. The Wiener filter is based on batch processing which is usually implemented in the frequency domain. The Kalman filter is based on recursive processing which is usually implemented in the spatial domain. Both solutions only work when blur, image and noise parameters are known. The first step for image restoration is the identification of degradation. Consequently, modeling uncertain relationships among many kinds of variables and learning (identification) such variables are important topics. The blur and image parameter identification problem was formerly formulated as a constrained Maximum Likelihood (ML) estimation procedure which was based on optimizing the probability density function (pdf) of the observed image with respect to the unknown parameters. But, the direct optimization of the likelihood function is not feasible, because of its highly nonlinear character. The Expectation Maximization (EM) algorithm is a very popular and widely used algorithm for the computation of ML estimates. There are two steps in EM algorithm, as E (Expectation) and M (Maximization). The EM algorithm finds the conditional expectation of the log-likelihood of complete data given the observed incomplete data. In the E-step, the conditional expectation of the "hidden variables" is calculated.  In the M-step, this expectation is maximized with respect to the parameters. The advantage of the EM method is such that it avoids operating directly on the nonlinear likelihood function. The EM algorithm becomes more attractive if its maximization step can be formulated analytically. Even though batch processing of the EM based blur identification and restoration problem needs large memory size, recursive techniques allow dynamic processing with modest storage requirements. Although the EM learning was applied to learning of unknown image and blur parameters based on batch image processing before, recursive EM learning of unknown image and blur parameters has not been studied as much as necessary. Many time series models, including the Hidden Markov Models (HMM) and Kalman Filter Models (KFM) used in filtering and control applications, can be viewed as examples of Dynamic Bayesian Network DBNs. Since, a Bayesian Network is a graphical way to represent a particular factorization of joint distribution; we propose that state space image model can be represented as a DBN. In this work, we introduce a new simultaneous recursive parameter learning and image restoration method based on the ML parameter identification and state estimation for images. We present a new formulation which is given in a Dynamic Bayesian Network (DBN) framework. We focus on the problem of learning the parameters of a Bayesian network. This technique incorporates optimal Kalman smoothing equations for ML parameter identification and state estimation. The use of Kalman filtering instead of Kalman smoothing is employed because of the computationally extensive processing of smoothing. In addition, a restored image is obtained simultaneously as the output of the Kalman filter. We manage to solve the EM learning problem for image and blur parameters in closed form. Although our proposed method processes huge data, because of the recursive structure it does not need large size storage. Performance evaluation of the method is given based on experiments carried out upon real images.  Keywords: Expectation-Maximization, Blur and Image Identification, Recursive Processing,  Kalman Smoothing and Filtering

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.Comment: Submitted to IEEE Selected Topics in Signal Processin