Visual identification by signature tracking

We propose a new camera-based biometric: visual signature identification. We discuss the importance of the parameterization of the signatures in order to achieve good classification results, independently of variations in the position of the camera with respect to the writing surface. We show that affine arc-length parameterization performs better than conventional time and Euclidean arc-length ones. We find that the system verification performance is better than 4 percent error on skilled forgeries and 1 percent error on random forgeries, and that its recognition performance is better than 1 percent error rate, comparable to the best camera-based biometrics

Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization

In this paper, we propose a general framework for constructing IGA-suitable planar B-spline parameterizations from given complex CAD boundaries consisting of a set of B-spline curves. Instead of forming the computational domain by a simple boundary, planar domains with high genus and more complex boundary curves are considered. Firstly, some pre-processing operations including B\'ezier extraction and subdivision are performed on each boundary curve in order to generate a high-quality planar parameterization; then a robust planar domain partition framework is proposed to construct high-quality patch-meshing results with few singularities from the discrete boundary formed by connecting the end points of the resulting boundary segments. After the topology information generation of quadrilateral decomposition, the optimal placement of interior B\'ezier curves corresponding to the interior edges of the quadrangulation is constructed by a global optimization method to achieve a patch-partition with high quality. Finally, after the imposition of C1=G1-continuity constraints on the interface of neighboring B\'ezier patches with respect to each quad in the quadrangulation, the high-quality B\'ezier patch parameterization is obtained by a C1-constrained local optimization method to achieve uniform and orthogonal iso-parametric structures while keeping the continuity conditions between patches. The efficiency and robustness of the proposed method are demonstrated by several examples which are compared to results obtained by the skeleton-based parameterization approach

Morphological analysis of cells by means of an elastic metric in the shape space

Shape analysis is of great importance in many fields, such as computer vision, medical imaging, and computational biology. This analysis can be performed considering shapes as closed planar curves in the shape space. This approach has been used for the first time to obtain the morphological classification of erythrocytes in digital images of sickle cell disease considering the shape space S1, which has the property of being isometric to an infinite-dimensional Grassmann manifold of two-dimensional subspaces (Younes et al., 2008), without taking advantage of all the features offered by the elastic metric related to the possibility of stretching and bending of the curves. In this paper, we study this deformation in the shape space, S2, which is based on the representation of closed planar curves by means of the square-root velocity function (SRVF) (Srivastava et al., 2011), using the elastic metric of this space to obtain more efficient geodesics and geodesic lengths between planar curves. Supervised classification with this approach achieved an accuracy of 94.3%, classification using templates achieved 94.2% and unsupervised clustering in three groups achieved 94.7%, considering three classes of erythrocytes: normal, sickle, and with other deformations. These results are better than those previously achieved in the morphological analysis of erythrocytes and the method can be used in different applications related to the treatment of sickle cell disease, even in cases where it is necessary to study the process of evolution of the deformation, something that can not be done in a natural way in the feature space

Fluids confined in wedges and by edges: From cluster integrals to thermodynamic properties referred to different regions

Recently, new insights in the relation between the geometry of the vessel that confines a fluid and its thermodynamic properties were traced through the study of cluster integrals for inhomogeneous fluids. In this work I analyze the thermodynamic properties of fluids confined in wedges or by edges, emphasizing on the question of the region to which these properties refer. In this context, the relations between the line-thermodynamic properties referred to different regions are derived as analytic functions of the dihedral angle $\alpha$ , for $0<\alpha<2\pi$ , which enables a unified approach to both edges and wedges. As a simple application of these results, I analyze the properties of the confined gas in the low-density regime. Finally, using recent analytic results for the second cluster integral of the confined hard sphere fluid, the low density behavior of the line thermodynamic properties is analytically studied up to order two in the density for $0<\alpha<2\pi$ and by adopting different reference regions.Comment: 8 pages, 7 figure

Fluids confined in wedges and by edges: Virial series for the line-thermodynamic properties of hard spheres

This work is devoted to analyze the relation between the thermodynamic properties of a confined fluid and the shape of its confining vessel. Recently, new insights in this topic were found through the study of cluster integrals for inhomogeneous fluids that revealed the dependence on the vessel shape of the low density behavior of the system. Here, the statistical mechanics and thermodynamics of fluids confined in wedges or by edges is revisited, focusing on their cluster integrals. In particular, the well known hard sphere fluid, which was not studied in this framework so far, is analyzed under confinement and its thermodynamic properties are analytically studied up to order two in the density. Furthermore, the analysis is extended to the confinement produced by a corrugated wall. These results rely on the obtained analytic expression for the second cluster integral of the confined hard sphere system as a function of the opening dihedral angle 0 < β < 2π. It enables a unified approach to both wedges and edges.Fil: Urrutia, Ignacio. Comisión Nacional de Energía Atómica. Centro Atómico Constituyentes; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentin

Implicitization of curves and (hyper)surfaces using predicted support

We reduce implicitization of rational planar parametric curves and (hyper)surfaces to linear algebra, by interpolating the coefficients of the implicit equation. For predicting the implicit support, we focus on methods that exploit input and output structure in the sense of sparse (or toric) elimination theory, namely by computing the Newton polytope of the implicit polynomial, via sparse resultant theory. Our algorithm works even in the presence of base points but, in this case, the implicit equation shall be obtained as a factor of the produced polynomial. We implement our methods on Maple, and some on Matlab as well, and study their numerical stability and efficiency on several classes of curves and surfaces. We apply our approach to approximate implicitization, and quantify the accuracy of the approximate output, which turns out to be satisfactory on all tested examples; we also relate our measures to Hausdorff distance. In building a square or rectangular matrix, an important issue is (over)sampling the given curve or surface: we conclude that unitary complexes offer the best tradeoff between speed and accuracy when numerical methods are employed, namely SVD, whereas for exact kernel computation random integers is the method of choice. We compare our prototype to existing software and find that it is rather competitive

A relaxed approach for curve matching with elastic metrics

In this paper we study a class of Riemannian metrics on the space of unparametrized curves and develop a method to compute geodesics with given boundary conditions. It extends previous works on this topic in several important ways. The model and resulting matching algorithm integrate within one common setting both the family of $H^2$-metrics with constant coefficients and scale-invariant $H^2$-metrics on both open and closed immersed curves. These families include as particular cases the class of first-order elastic metrics. An essential difference with prior approaches is the way that boundary constraints are dealt with. By leveraging varifold-based similarity metrics we propose a relaxed variational formulation for the matching problem that avoids the necessity of optimizing over the reparametrization group. Furthermore, we show that we can also quotient out finite-dimensional similarity groups such as translation, rotation and scaling groups. The different properties and advantages are illustrated through numerical examples in which we also provide a comparison with related diffeomorphic methods used in shape registration.Comment: 27 page