The purpose of this paper is the assessment of a family of shape factors for oo-line signature veriication. The initial method, suggested in 1], which extracts geometric features, is modiied to assess the performance of veriication in the general case of forgery. W e c o n-tribute to the information coded by adapting the coding method to the image and by i n tegrating a spatial distance into th...

In previous documents we have outlined an approach for the analysis of 2 and 3D shape vectors using measurement covariances for the situation where the measurements are known to be independent. The purpose of this document is to explain the mathematics required to extend this approach to “pseudolandmarks”, where information is provided at a given 2 or 3D location only in 1D. We show that the us...

When we approach shape representation, we need to choose which modeling constructs to adopt, e.g., low-level geometric elements like edges and (sur)faces, or more general elements like protrusions, bumps and holes, among others. The latter can be described as spatial configurations of the former satisfying unity and, possibly, identity criteria. However, once these are brought into the picture,...

A generator of Lie point symmetries admitted by a Lane–Emden equation of the second-kind for arbitrary shape factor k is used to determine invariant boundary conditions admitted by the equation. The generator of Lie point symmetries is then used to reduce the order of the Lane–Emden equation. A phase plane analysis of the reduced equation indicates that the stability of the invariant boundary c...

The Problem: The goal of low-level vision is to estimate an underlying scene (e.g., albedos or shapes), given an observed image. Real-world scenes can be very complex, conventionally requiring high dimensional representations that are hard to estimate and store. In this work, we propose a low-dimensional representation, called a scene recipe, that relies on the image itself to describe the comp...

Geometric moment invariants (GMIs) have been widely used as basic tool in shape analysis and information retrieval. Their structure and characteristics determine efficiency and effectiveness. Two fundamental building blocks or generating functions (GFs) for invariants are discovered, which are dot product and vector product of point vectors in Euclidean space. The primitive invariants (PIs) can...

We present a novel method that uses shape skeletons, and associated quantities, for feature-preserving smoothing of shapes in digital images. We preserve, or smooth out, features based on a saliency measure that relates feature size to local object size, both computed using the shape’s skeleton. Low-saliency convex features (cusps) are smoothed out, and low-saliency concave features (dents) are...

In this paper we present a new approach for segmentation of 3D models. The goal of the proposed approach is the decomposition of a model into large simple and small complex components. The top-down decomposition is achieved through the iterative bisection of the model. The bisection process is represented in the hierarchical tree structure. Further the obtained segments are checked on the possi...