No abstract uploaded!

In a previous work [P. Crispel, P. Degond, and M.-H. Vignal, J. Comput. Phys., 223 (2007), pp. 208–234], a new numerical discretization of the Euler–Poisson system was proposed. This scheme is “asymptotic preserving” in the quasineutral limit (i.e., when the Debye length $\varepsilon$ tends to zero), which means that it becomes consistent with the limit model when $\varepsilon \to 0$. In the present work, we show that the stability domain of the present scheme is independent of $\varepsilon$. This stability analysis is performed on the Fourier transformed (with respect to the space variable) linearized system. We show that the stability property is more robust when a space-decentered scheme is used (which brings in some numerical dissipation) rather than a space-centered scheme. The linearization is first performed about a zero mean velocity and then about a nonzero mean velocity. At the various stages of the analysis, our scheme is compared with more classical schemes and its improved stability property is outlined. The analysis of a fully discrete (in space and time) version of the scheme is also given. Finally, some considerations about a model nonlinear problem, the Burgers–Poisson problem, are also discussed.

In this paper we give an explicit algorithm to construct the ordinary quiver of a finite EI category for which the endomorphism groups of all objects have orders invertible in the field k. We classify all finite EI categories with hereditary category algebras, characterizing them as free EI categories (in a sense which we define) for which all endomorphism groups of objects have invertible orders. Some applications on the representation types of finite EI categories are derived.

The Mumford–Shah model is one of the most important image segmentation models and has been studied extensively in the last twenty years. In this paper, we propose a two-stage segmentation method based on the Mumford–Shah model. The first stage of our method is to find a smooth solution g to a convex variant of the Mumford–Shah model. Once g is obtained, then in the second stage the segmentation is done by thresholding g into different phases. The thresholds can be given by the users or can be obtained automatically using any clustering methods. Because of the convexity of the model, g can be solved efficiently by techniques like the split-Bregman algorithm or the Chambolle–Pock method. We prove that our method is convergent and that the solution g is always unique. In our method, there is no need to specify the number of segments K (K ≥ 2) before finding g. We can obtain any K-phase segmentations by choosing (K − 1) thresholds after g is found in the first stage, and in the second stage there is no need to recompute g if the thresholds are changed to reveal different segmentation features in the image. Experimental results show that our two-stage method performs better than many standard two-phase or multiphase segmentation methods for very general images, including antimass, tubular, MRI, noisy, and blurry images.

In this paper, we propose a novel iterative convolution-thresholding method (ICTM) that is applicable to a range of variational models for image segmentation. A variational model usually minimizes an energy functional consisting of a fidelity term and a regularization term. In the ICTM, the interface between two different segment domains is implicitly represented by their characteristic functions. The fidelity term is usually written as a linear functional of the characteristic functions and the regularized term is approximated by a functional of characteristic functions in terms of heat kernel convolution. This allows us to design an iterative convolution-thresholding method to minimize the approximate energy. The method is simple, efficient and enjoys the energy-decaying property. Numerical experiments show that the method is easy to implement, robust and applicable to various image segmentation models.