1,839 research outputs found

    Coupled non-parametric shape and moment-based inter-shape pose priors for multiple basal ganglia structure segmentation

    Get PDF
    This paper presents a new active contour-based, statistical method for simultaneous volumetric segmentation of multiple subcortical structures in the brain. In biological tissues, such as the human brain, neighboring structures exhibit co-dependencies which can aid in segmentation, if properly analyzed and modeled. Motivated by this observation, we formulate the segmentation problem as a maximum a posteriori estimation problem, in which we incorporate statistical prior models on the shapes and inter-shape (relative) poses of the structures of interest. This provides a principled mechanism to bring high level information about the shapes and the relationships of anatomical structures into the segmentation problem. For learning the prior densities we use a nonparametric multivariate kernel density estimation framework. We combine these priors with data in a variational framework and develop an active contour-based iterative segmentation algorithm. We test our method on the problem of volumetric segmentation of basal ganglia structures in magnetic resonance (MR) images. We present a set of 2D and 3D experiments as well as a quantitative performance analysis. In addition, we perform a comparison to several existent segmentation methods and demonstrate the improvements provided by our approach in terms of segmentation accuracy

    Texture Characteristic of Local Binary Pattern on Face Recognition with Probabilistic Linear Discriminant Analysis

    Get PDF
    Face recognition is an identification system that uses the characteristics of a person's face for processing. There is a feature in the face image so that it can be distinguished between one face and another face. One way to recognize face images is to analyze the texture of the face image. Texture analysis generally requires a feature extraction process. In different images, the characteristics will also differ. This characteristic will be the basis for the recognition of facial images. However, existing face recognition methods experience efficiency problems and rely heavily on the extraction of the right features. This study aims to study the texture characteristics of the extraction results using the Local Binary Pattern (LBP) method which is applied to deal with the introduction of Probabilistic Linear Discriminant Analysis (PLDA). The data used in this study are human face images from the AR Faces database, consisting of 136 objects (76 men and 60 women), each of which has 7 types of images Based on the results of testing shows the LBP method can produce the highest accuracy with a value of 95.53% in the introduction of PLDA

    Continuous Multiclass Labeling Approaches and Algorithms

    Get PDF
    We study convex relaxations of the image labeling problem on a continuous domain with regularizers based on metric interaction potentials. The generic framework ensures existence of minimizers and covers a wide range of relaxations of the originally combinatorial problem. We focus on two specific relaxations that differ in flexibility and simplicity -- one can be used to tightly relax any metric interaction potential, while the other one only covers Euclidean metrics but requires less computational effort. For solving the nonsmooth discretized problem, we propose a globally convergent Douglas-Rachford scheme, and show that a sequence of dual iterates can be recovered in order to provide a posteriori optimality bounds. In a quantitative comparison to two other first-order methods, the approach shows competitive performance on synthetical and real-world images. By combining the method with an improved binarization technique for nonstandard potentials, we were able to routinely recover discrete solutions within 1%--5% of the global optimum for the combinatorial image labeling problem

    Microtiming patterns and interactions with musical properties in Samba music

    Get PDF
    In this study, we focus on the interaction between microtiming patterns and several musical properties: intensity, meter and spectral characteristics. The data-set of 106 musical audio excerpts is processed by means of an auditory model and then divided into several spectral regions and metric levels. The resulting segments are described in terms of their musical properties, over which patterns of peak positions and their intensities are sought. A clustering algorithm is used to systematize the process of pattern detection. The results confirm previously reported anticipations of the third and fourth semiquavers in a beat. We also argue that these patterns of microtiming deviations interact with different profiles of intensities that change according to the metrical structure and spectral characteristics. In particular, we suggest two new findings: (i) a small delay of microtiming positions at the lower end of the spectrum on the first semiquaver of each beat and (ii) systematic forms of accelerando and ritardando at a microtiming level covering two-beat and four-beat phrases. The results demonstrate the importance of multidimensional interactions with timing aspects of music. However, more research is needed in order to find proper representations for rhythm and microtiming aspects in such contexts

    A Statistical Approach to Snakes for Bimodal and Trimodal Imagery

    Get PDF
    © 1999 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.DOI: 10.1109/ICCV.1999.790317In this paper, we describe a new region-based approach to active contours for segmenting images com- posed of two or three types of regions characterizable by a given statistic. The essential idea is to derive curve evolutions which separate two or more values of a pre- determined set of statistics computed over geometrically determined subsets of the image. Both global and local image information is used to evolve the active contour. Image derivatives, however, are avoided, thereby giving rise to a further degree of noise robust- ness compared to most edge-based snake algorithms
    corecore