No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

Consider an age-dependent, single-species branching process defined by a progeny number distribution, and a lifetime distribution associated with each independent particle. In this paper, we focus on the associated inverse problem where one wishes to formally solve for the progeny number distribution or the lifetime distribution that defines the Bellman-Harris branching process. We derive results for the existence and uniqueness (the identifiability) of these two distributions given one of two types of information: the extinction time probability of the entire process (extinction time distribution), or the distribution of the total number of particles at one fixed time. We demonstrate that perfect knowledge of the distribution of extinction times allows us to formally determine either the progeny number distribution or the lifetime distribution. Furthermore, we show that these constructions are unique. We then consider “data” consisting of a perfectly known total number distribution given at one specific time. For a process with known progeny number distribution and exponentially distributed lifetimes, we show that the rate parameter is identifiable. For general lifetime distributions, we also show that the progeny distribution is globally unique. Our results are presented through four theorems, each describing the constructions in the four distinct cases.

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.