Peaks detection and alignment for mass spectrometry data

The goal of this paper is to review existing methods for protein mass spectrometry data analysis, and to present a new methodology for automatic extraction of significant peaks (biomarkers). For the pre-processing step required for data from MALDI-TOF or SELDI- TOF spectra, we use a purely nonparametric approach that combines stationary invariant wavelet transform for noise removal and penalized spline quantile regression for baseline correction. We further present a multi-scale spectra alignment technique that is based on identification of statistically significant peaks from a set of spectra. This method allows one to find common peaks in a set of spectra that can subsequently be mapped to individual proteins. This may serve as useful biomarkers in medical applications, or as individual features for further multidimensional statistical analysis. MALDI-TOF spectra obtained from serum samples are used throughout the paper to illustrate the methodology

Parametric Regression on the Grassmannian

We address the problem of fitting parametric curves on the Grassmann manifold for the purpose of intrinsic parametric regression. As customary in the literature, we start from the energy minimization formulation of linear least-squares in Euclidean spaces and generalize this concept to general nonflat Riemannian manifolds, following an optimal-control point of view. We then specialize this idea to the Grassmann manifold and demonstrate that it yields a simple, extensible and easy-to-implement solution to the parametric regression problem. In fact, it allows us to extend the basic geodesic model to (1) a time-warped variant and (2) cubic splines. We demonstrate the utility of the proposed solution on different vision problems, such as shape regression as a function of age, traffic-speed estimation and crowd-counting from surveillance video clips. Most notably, these problems can be conveniently solved within the same framework without any specifically-tailored steps along the processing pipeline.Comment: 14 pages, 11 figure

Invariant higher-order variational problems II

Motivated by applications in computational anatomy, we consider a second-order problem in the calculus of variations on object manifolds that are acted upon by Lie groups of smooth invertible transformations. This problem leads to solution curves known as Riemannian cubics on object manifolds that are endowed with normal metrics. The prime examples of such object manifolds are the symmetric spaces. We characterize the class of cubics on object manifolds that can be lifted horizontally to cubics on the group of transformations. Conversely, we show that certain types of non-horizontal geodesics on the group of transformations project to cubics. Finally, we apply second-order Lagrange--Poincar\'e reduction to the problem of Riemannian cubics on the group of transformations. This leads to a reduced form of the equations that reveals the obstruction for the projection of a cubic on a transformation group to again be a cubic on its object manifold.Comment: 40 pages, 1 figure. First version -- comments welcome

3-D Face Analysis and Identification Based on Statistical Shape Modelling

This paper presents an effective method of statistical shape representation for automatic face analysis and identification in 3-D. The method combines statistical shape modelling techniques and the non-rigid deformation matching scheme. This work is distinguished by three key contributions. The first is the introduction of a new 3-D shape registration method using hierarchical landmark detection and multilevel B-spline warping technique, which allows accurate dense correspondence search for statistical model construction. The second is the shape representation approach, based on Laplacian Eigenmap, which provides a nonlinear submanifold that links underlying structure of facial data. The third contribution is a hybrid method for matching the statistical model and test dataset which controls the levels of the model’s deformation at different matching stages and so increases chance of the successful matching. The proposed method is tested on the public database, BU-3DFE. Results indicate that it can achieve extremely high verification rates in a series of tests, thus providing real-world practicality

Detecting Similarity of Rational Plane Curves

A novel and deterministic algorithm is presented to detect whether two given rational plane curves are related by means of a similarity, which is a central question in Pattern Recognition. As a by-product it finds all such similarities, and the particular case of equal curves yields all symmetries. A complete theoretical description of the method is provided, and the method has been implemented and tested in the Sage system for curves of moderate degrees.Comment: 22 page

Curve Matching by Using B-spline Curves

This paper presents an algorithm for estimating the control points of the B-spline and curve matching which are achieved by using the dissimilarity measure based on the knot associated with the B-spline curves. The B-splines stand as one of the most efficient curve representations and possess very attractive properties such as spatial uniqueness, boundedness and continuity, local shape controllability, and invariance to affine transformations. These properties made them very attractive for curve representation. Consequently, they have been extensively used in computer-aided design and computer graphics. The curve-matching program is shown in detail in this paper. Any input test object curve can be matched with the B-spline sample curve. The control points of sample curve are computed and stored in the program. The test object curve, a bitmap file, is thinned, then converted to B-spline curve and then to match with the sample curve