6,280 research outputs found
Statistical Shape Analysis using Kernel PCA
©2006 SPIE--The International Society for Optical Engineering. One print or electronic copy may be made for personal use only. Systematic reproduction and distribution, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are prohibited.
The electronic version of this article is the complete one and can be found online at: http://dx.doi.org/10.1117/12.641417DOI:10.1117/12.641417Presented at Image Processing
Algorithms and Systems, Neural Networks, and Machine Learning, 16-18 January 2006, San Jose, California, USA.Mercer kernels are used for a wide range of image and signal processing tasks like de-noising, clustering, discriminant analysis etc. These algorithms construct their solutions in terms of the expansions in a high-dimensional feature space F. However, many applications like kernel PCA (principal component analysis) can be used more effectively if a pre-image of the projection in the feature space is available. In this paper, we propose a novel method to reconstruct a unique approximate pre-image of a feature vector and apply it for statistical shape analysis. We provide some experimental results to demonstrate the advantages of kernel PCA over linear PCA for shape learning, which include, but are not limited to, ability to learn and distinguish multiple geometries of shapes and robustness to occlusions
Polygonal Chains Cannot Lock in 4D
We prove that, in all dimensions d>=4, every simple open polygonal chain and
every tree may be straightened, and every simple closed polygonal chain may be
convexified. These reconfigurations can be achieved by algorithms that use
polynomial time in the number of vertices, and result in a polynomial number of
``moves.'' These results contrast to those known for d=2, where trees can
``lock,'' and for d=3, where open and closed chains can lock.Comment: Major revision of the Aug. 1999 version, including: Proof extended to
show trees cannot lock in 4D; new example of the implementation straightening
a chain of n=100 vertices; improved time complexity for chain to O(n^2);
fixed several minor technical errors. (Thanks to three referees.) 29 pages;
15 figures. v3: Reference update
Estimation of vector fields in unconstrained and inequality constrained variational problems for segmentation and registration
Vector fields arise in many problems of computer vision, particularly in non-rigid registration. In this paper, we develop coupled partial differential equations (PDEs) to estimate vector fields that define the deformation between
objects, and the contour or surface that defines the segmentation of the objects as well.We also explore the utility of inequality constraints applied to variational problems in vision such as estimation of deformation fields in non-rigid registration and tracking. To solve inequality constrained vector
field estimation problems, we apply tools from the Kuhn-Tucker theorem in optimization theory. Our technique differs from recently popular joint segmentation and registration algorithms, particularly in its coupled set of PDEs derived from the same set of energy terms for registration and
segmentation. We present both the theory and results that demonstrate our approach
A comprehensive analysis of the geometry of TDOA maps in localisation problems
In this manuscript we consider the well-established problem of TDOA-based
source localization and propose a comprehensive analysis of its solutions for
arbitrary sensor measurements and placements. More specifically, we define the
TDOA map from the physical space of source locations to the space of range
measurements (TDOAs), in the specific case of three receivers in 2D space. We
then study the identifiability of the model, giving a complete analytical
characterization of the image of this map and its invertibility. This analysis
has been conducted in a completely mathematical fashion, using many different
tools which make it valid for every sensor configuration. These results are the
first step towards the solution of more general problems involving, for
example, a larger number of sensors, uncertainty in their placement, or lack of
synchronization.Comment: 51 pages (3 appendices of 12 pages), 12 figure
Boundary-Conforming Free-Surface Flow Computations: Interface Tracking for Linear, Higher-Order and Isogeometric Finite Elements
The simulation of certain flow problems requires a means for modeling a free
fluid surface; examples being viscoelastic die swell or fluid sloshing in
tanks. In a finite-element context, this type of problem can, among many other
options, be dealt with using an interface-tracking approach with the
Deforming-Spatial-Domain/Stabilized-Space-Time (DSD/SST) formulation. A
difficult issue that is connected with this type of approach is the
determination of a suitable coupling mechanism between the fluid velocity at
the boundary and the displacement of the boundary mesh nodes. In order to avoid
large mesh distortions, one goal is to keep the nodal movements as small as
possible; but of course still compliant with the no-penetration boundary
condition. Standard displacement techniques are full velocity, velocity in a
specific coordinate direction, and velocity in normal direction. In this work,
we investigate how the interface-tracking approach can be combined with
isogeometric analysis for the spatial discretization. If NURBS basis functions
of sufficient order are used for both the geometry and the solution, both a
continuous normal vector as well as the velocity are available on the entire
boundary. This circumstance allows the weak imposition of the no-penetration
boundary condition. We compare this option with an alternative that relies on
strong imposition at discrete points. Furthermore, we examine several coupling
methods between the fluid equations, boundary conditions, and equations for the
adjustment of interior control point positions.Comment: 20 pages, 16 figure
- …