A Length Penalized Probabilistic Principal Curve Algorithm With Applications To Handwritten Digits And Pharmacologic Colon Imaging (original) (raw)
Related papers
Principal Curves for Nonlinear Feature Extraction and Classification
… Applications of Artificial Neural Networks in …, 1998
We present an improved unbiased algorithm for determining principal curves in high dimensional spaces, and then propose two novel applications of principal curve to feature extraction and pattern classificationthe Principal Curve Feature Extractor (PCFE) and the Principal ...
Multiple Penalized Principal Curves: Analysis and Computation
Journal of Mathematical Imaging and Vision
We study the problem of determining the one-dimensional structure that best represents a given data set. More precisely, we take a variational approach to approximating a given measure (data) by curves. We consider an objective functional whose minimizers are a regularization of principal curves and introduce a new functional which allows for multiple curves. We prove existence of minimizers and investigate their properties. While both of the functionals used are non-convex, we show that enlarging the configuration space to allow for multiple curves leads to a simpler energy landscape with fewer undesirable (high-energy) local minima. We provide an efficient algorithm for approximating minimizers of the functional and demonstrate its performance on real and synthetic data. The numerical examples illustrate the effectiveness of the proposed approach in the presence of substantial noise, and the viability of the algorithm for high-dimensional data.
A polygonal line algorithm for constructing principal curves
1999
Principal curves have been defined as "self consistent" smooth curves which pass through the "middle" of a d-dimensional probability distribution or data cloud. Recently, we [1] have offered a new approach by defining principal curves as continuous curves of a given length which minimize the expected squared distance between the curve and points of the space randomly chosen according to a given distribution. The new definition made it possible to carry out a theoretical analysis of learning principal curves from training data. In this paper we propose a practical construction based on the new definition. Simulation results demonstrate that the new algorithm compares favorably with previous methods both in terms of performance and computational complexity.
Principal Component Analysis of a Finite Number of Curves
We introduce and discuss Principal Component Analysis (FPCA) of curves, using only relatively simple matrix algebra and optimization results. Different loss functions, and various ways to impose constraints on the solution, are also discussed. The techniques are applied first to some theoretical examples involving smooth curves, and subsequently to a data set with one year of hourly ozone measurements in Lebec, Kern County, California. R code for all functions, tables, and figures is included for reproducibility.
2020
We extend the classical approach in supervised classification based on the local likelihood estimation to the functional covariates case. The estimation procedure of the functional parameter (slope parameter) in the linear model when the covariate is of functional kind is investigated. We show, on simulated as well on real data, that classification error rates estimated using test samples, and the estimation procedure by local likelihood seem to lead to better estimators than the classical kernel estimation. In addition, this approach is no longer assuming that the linear predictors have a specific parametric form. However, this approach also has two drawbacks. Indeed, it was more expensive and slower than the kernel regression. Thus, as mentioned earlier, kernels other than the Gaussian kernel can lead to a divergence of the Newton-Raphson algorithm. In contrast, using a Gaussian kernel, 4 to 6 iterations are then sufficient to achieve convergence.
MIXTURES OF REGRESSION CURVE MODELS FOR ARABIC CHARACTER RECOGNITION
Computer Science & Information Technology (CS & IT), 2019
In this paper, we demonstrate how regression curves can be used to recognize 2D non-rigid handwritten shapes. Each shape is represented by a set of non-overlapping uniformly distributed landmarks. The underlying models utilize 2nd order of polynomials to model shapes within a training set. To estimate the regression models, we need to extract the required coefficients which describe the variations for a set of shape class. Hence, a least square method is used to estimate such modes. We proceed then, by training these coefficients using the apparatus Expectation Maximization algorithm. Recognition is carried out by finding the least error landmarks displacement with respect to the model curves. Handwritten isolated Arabic characters are used to evaluate our approach.
Learning Probabilistic Models of Contours
2010
We present a methodology for learning spline-based probabilistic models for sets of contours, proposing a new Monte Carlo variant of the EM algorithm to estimate the parameters of a family of distributions defined over the set of spline functions (with fixed complexity). The proposed model effectively captures the major morphological properties of the observed set of contours as well as its variability, as the simulation results presented demonstrate.
Shape Projectors for Landmark-Based Spline Curves
IEEE Signal Processing Letters, 2017
We present a generic method to construct orthogonal projectors for 2D landmark-based parametric spline curves. We construct vector spaces that define a geometric transformation (e.g., affine, similarity, scaling) that is applied to a reference curve. These vector spaces contain all parametric curves up to the chosen transformation. We define the vector spaces implicitly through an orthogonal projection operator and present a theorem that characterizes the projector for landmark-based spline curves which are popular for the user-interactive analysis of biomedical images. Finally, we show how shape priors are constructed with the spline projector and provide an example of application for the segmentation of microscopy images in biology.