Search

We consider the recovery of degraded videos without complete knowledge about the degradation. A spatially shift-invariant but temporally shift-varying video formation model is used. This leads to a simple multiframe degradation model that relates each original video frame with multiple observed frames and point spread functions (PSFs). We propose a variational method that simultaneously reconstructs each video frame and the associated PSFs from the corresponding observed frames. Total variation (TV) regularization is used on both the video frames and the PSFs to further reduce the ill-posedness and to better preserve edges. In order to make TV minimization practical for video sequences, we propose an efficient splitting method that generalizes some recent fast single-image TV minimization methods to the multiframe case. Both synthetic and real videos are used to show the performance of the proposed method. OCIS codes: 100.1455, 100.3020, 110.4155, 150.1135.

A total variation-based model with a non-negativity constraint is used for examining image deblurring problems. Findings reveal the speed, accuracy and effectiveness of the model in solving image deblurring problems.

Density-based clustering has the advantages for 1) allowing arbitrary shape of cluster and 2) hot requiring the number of clusters as input. However, when clusters touch each other, both the cluster centers and cluster boundaries (as the peaks and valleys of the density distribution) become fuzzy and difficult to determine. We introduce the notion of cluster intensity function (CIF) which captures the important characteristics of clusters. When clusters are well-separated, CIFs are similar to density functions. But, when clusters become closed to each other, CIFs still clearly reveal cluster centers, cluster boundaries, and degree of membership of each data point to the cluster that it belongs. Clustering through bump hunting and valley seeking based on these functions are more robust than that based on density functions obtained by kernel density estimation, which are often oscillatory or oversmoothed. These problems of kernel density estimation are resolved using Level Set Methods and related techniques. Comparisons with two existing density-based methods, valley seeking and DBSCAN, are presented which illustrate the advantages of our approach. Index Terms--Dynamic clustering, level set methods, cluster intensity functions, kernel density estimation, duster contours, partial differential equations.

Abstract Background Network methods are increasingly used to represent the interactions of genes and/or proteins. Genes or proteins that are directly linked may have a similar biological function or may be part of the same biological pathway. Since the information on the connection (adjacency) between 2 nodes may be noisy or incomplete, it can be desirable to consider alternative measures of pairwise interconnectedness. Here we study a class of measures that are proportional to the number of neighbors that a pair of nodes share in common. For example, the topological overlap measure by Ravasz et al. 1 can be interpreted as a measure of agreement between the m = 1 step neighborhoods of 2 nodes. Several studies have shown that two proteins having a higher topological overlap are more likely to belong to the same functional class than proteins having a lower topological overlap. Here we address the question whether a measure of topological overlap based on higher-order neighborhoods could give rise to a more robust and sensitive measure of interconnectedness. Results We generalize the topological overlap measure from m = 1 step neighborhoods to m ≥ 2 step neighborhoods. This allows us to define the m-th order generalized topological overlap measure (GTOM) by (i) counting the number of m-step neighbors that a pair of nodes share and (ii) normalizing it to take a value between 0 and 1. Using theoretical arguments, a yeast co-expression network application, and a fly protein network application, we illustrate the usefulness of the proposed measure for module detection and gene neighborhood analysis. Conclusion Topological overlap can serve as an important filter to counter the effects of spurious or missing connections between network nodes. The m-th order topological overlap measure allows one to trade-off sensitivity versus specificity when it comes to defining pairwise interconnectedness and network modules.

The soft additive segmentation model attempts to solve the problem related to the segmentation of overlapping objects with additive intensity value. An issue in optimizing the soft additive segmentation functional is that a high-order nonlinear partial differential equation needs to be solved, which, for most standard algorithms, involves high computational cost. In this paper, we propose a fast and efficient numerical algorithm to optimize the soft additive segmentation model. We reformulate the original minimization problem into a sequence of simpler minimization problems that can be solved efficiently by using the augmented Lagrangian method. Numerical tests on real and synthetic cases are presented to demonstrate the efficiency of our algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of segmentation of large collections of images. We propose a semisupervised optimization model that determines an efficient segmentation of many input images. The advantages of the model are twofold. First, the segmentation is highly controllable by the user so that the user can easily specify what he/she wants. This is done by allowing the user to provide, either offline or interactively, some (fully or partially) labeled pixels in images as strong priors for the model. Second, the model requires only minimal tuning of model parameters during the initial stage. Once initial tuning is done, the setup can be used to automatically segment a large collection of images that are distinct but share similar features. We will show the mathematical properties of the model such as existence and uniqueness of solution and establish a maximum/minimum principle for the solution of the model. Extensive experiments on various collections of biological images suggest that the proposed model is effective for segmentation and is computationally efficient. [ABSTRACT FROM AUTHOR]

Loss of information in a wavelet domain can occur during storage or transmission when the images are formatted and stored in terms of wavelet coefficients. This calls for image inpainting in wavelet domains. In this paper, a variational approach is used to formulate the reconstruction problem. We propose a simple but very efficient iterative scheme to calculate an optimal solution and prove its convergence. Numerical results are presented to show the performance of the proposed algorithm. [ABSTRACT FROM PUBLISHER]

We propose a variant of the Mumford–Shah model for the segmentation of a pair of overlapping objects with additive intensity value. Unlike standard segmentation models, it does not only determine distinct objects in the image, but also recover the possibly multiple membership of the pixels. To accomplish this, some a priori knowledge about the smoothness of the object boundary is integrated into the model. Additivity is imposed through a soft constraint which allows the user to control the degree of additivity and is more robust than the hard constraint. We also show analytically that the additivity parameter can be chosen to achieve some stability conditions. To solve the optimization problem involving geometric quantities efficiently, we apply a multiphase level set method. Segmentation results on synthetic and real images validate the good performance of our model, and demonstrate the model's applicability to images with multiple channels and multiple objects. [ABSTRACT FROM AUTHOR]

In this article, we consider a bilaterally constrained optimization model arising from the semisupervised multiple-class image segmentation problem. We prove that the solution of the corresponding unconstrained problem satisfies a discrete maximum principle. This implies that the bilateral constraints are satisfied automatically and that the solution is unique. Although the structure of the coefficient matrices arising from the optimality conditions of the segmentation problem is different for different input images, we show that they are M-matrices in general. Therefore, we study several numerical methods for solving such linear systems and demonstrate that domain decomposition with block relaxation methods are quite effective and outperform other tested methods. We also carry out a numerical study of condition numbers on the effect of boundary conditions on the optimization problems, which provides some insights into the specification of boundary conditions as an input knowledge in the learning context. © 2010 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 20, 191–201, 2010 [ABSTRACT FROM AUTHOR]

In this paper, we propose a discrepancy rule-based method to automatically choose the regularization parameters for total variation image restoration problems. The regularization parameters are adjusted dynamically in each iteration. Numerical results are shown to illustrate the performance of the proposed method. [ABSTRACT FROM AUTHOR]

We propose a total variation based model for simultaneous image inpainting and blind deconvolution. We demonstrate that the tasks are inherently coupled together and that solving them individually will lead to poor results. The main advantages of our model are that (i) boundary conditions for deconvolution required near the interface between observed and occluded regions are naturally generated through inpainting; (ii) inpainting results are enhanced through deconvolution (as opposed to inpainting blurry images). As a result, ringing effects due to imposing improper boundary conditions and errors due to imperfection of inpainting blurry images are reduced. Moreover, our model can also be used to generate boundary conditions for regular deconvolution problems that yields better results than previous methods.© 2005 Wiley Periodicals, Inc. © 2005 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 15, 92–102, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ima.20041 [ABSTRACT FROM AUTHOR]

The article focuses on various projects connected with restoration of image from one or several degraded images being worked on by the researchers at Centre of Wavelets, Approximation and Information Processing at the National University of Singapore in cooperation with the Agency for Science, Technology and Research Bioninformatics Institute, the DSO National Laboratories and the Defence Science and Technology Agency. Energy-minimization principles are the basis of variational methods as solutions to restoration problems.