52,054 research outputs found

    Convergence of Fuzzy Tori and Quantum Tori for the quantum Gromov-Hausdorff Propinquity: an explicit approach

    Full text link
    Quantum tori are limits of finite dimensional C*-algebras for the quantum Gromov-Hausdorff propinquity, a metric defined by the author as a strengthening of Rieffel's quantum Gromov-Hausdorff designed to retain the C*-algebraic structure. In this paper, we propose a proof of the continuity of the family of quantum and fuzzy tori which relies on explicit representations of the C*-algebras rather than on more abstract arguments, in a manner which takes full advantage of the notion of bridge defining the quantum propinquity.Comment: 41 Pages. This paper is the second half of ArXiv:1302.4058v2. The latter paper has been divided in two halves for publications purposes, with the first half now the current version of 1302.4058, which has been accepted in Trans. Amer. Math. Soc. This second half is now a stand-alone paper, with a brief summary of 1302.4058 and a new introductio

    Unsupervised Multi Class Segmentation of 3D Images with Intensity Inhomogeneities

    Full text link
    Intensity inhomogeneities in images constitute a considerable challenge in image segmentation. In this paper we propose a novel biconvex variational model to tackle this task. We combine a total variation approach for multi class segmentation with a multiplicative model to handle the inhomogeneities. Our method assumes that the image intensity is the product of a smoothly varying part and a component which resembles important image structures such as edges. Therefore, we penalize in addition to the total variation of the label assignment matrix a quadratic difference term to cope with the smoothly varying factor. A critical point of our biconvex functional is computed by a modified proximal alternating linearized minimization method (PALM). We show that the assumptions for the convergence of the algorithm are fulfilled by our model. Various numerical examples demonstrate the very good performance of our method. Particular attention is paid to the segmentation of 3D FIB tomographical images which was indeed the motivation of our work

    Adaptive particle swarm optimization

    Get PDF
    An adaptive particle swarm optimization (APSO) that features better search efficiency than classical particle swarm optimization (PSO) is presented. More importantly, it can perform a global search over the entire search space with faster convergence speed. The APSO consists of two main steps. First, by evaluating the population distribution and particle fitness, a real-time evolutionary state estimation procedure is performed to identify one of the following four defined evolutionary states, including exploration, exploitation, convergence, and jumping out in each generation. It enables the automatic control of inertia weight, acceleration coefficients, and other algorithmic parameters at run time to improve the search efficiency and convergence speed. Then, an elitist learning strategy is performed when the evolutionary state is classified as convergence state. The strategy will act on the globally best particle to jump out of the likely local optima. The APSO has comprehensively been evaluated on 12 unimodal and multimodal benchmark functions. The effects of parameter adaptation and elitist learning will be studied. Results show that APSO substantially enhances the performance of the PSO paradigm in terms of convergence speed, global optimality, solution accuracy, and algorithm reliability. As APSO introduces two new parameters to the PSO paradigm only, it does not introduce an additional design or implementation complexity
    corecore