Shape representation plays an important role to preserve shape geometry information of any object. The majority of existing shape representation methods used sphere to approximate 3D object. Sphere is divergence in nature and hence the mapping between sphere and object is noncompact and the resultant shape representation becomes less informative. In this paper, we propose a shape representation...

In this paper the use of a fast algorithm for implementing shape decomposition of 3D binary objects is proposed. Shape decomposition is performed by successive 3D erosions and dilations, using 3D structuring elements of arbitrary size and shape. The proposed fast shape decomposition algorithm is based on a fast implementation of the basic morphological operation of Minkowski addition for the sp...

We consider the hp–version interior penalty discontinuous Galerkin finite element method (hp–DGFEM) for semilinear parabolic equations with mixed Dirichlet and Neumann boundary conditions. Our main concern is the error analysis of the hp–DGFEM on shape–regular spatial meshes. We derive error bounds under various hypotheses on the regularity of the solution, for both the symmetric and non–symmet...

This paper provides a review of shape analysis methods. Shape analysis methods play an important role in systems for object recognition, matching, registration, and analysis. Research in shape analysis has been motivated, in part, by studies of human visual form perception systems. Several theories of visual form perception are brie y mentioned. Shape analysis methods are classi ed into several...

We consider the hp–version interior penalty discontinuous Galerkin finite element method (hp–DGFEM) for semilinear parabolic equations with mixed Dirichlet and Neumann boundary conditions. Our main concern is the error analysis of the hp–DGFEM on shape–regular spatial meshes. We derive error bounds under various hypotheses on the regularity of the solution, for both the symmetric and non–symmet...

With the increase in rate of unauthorized access and attacks security of confidential data is important. In this paper shape based data hiding algorithm is proposed for steganography as well as Steganalysis is done. In this algorithm, shape is taken to hide the data in an image. The secret information can be hidden only in the pixels which are available in the shape, instead of hiding secret in...

Given that most current Structure From Motion (SFM) algorithms cannot recover true motion estimates, it is important to understand the impact such motion errors have on the shape reconstruction. In this paper, we present a theoretical model to understand the impact that errors in the motion estimates have on shape recovery. Using this model, we focus on the recovery of second order shape under ...

Tree species proportions of forest stands were estimated using ranging scatterometer called HUTSCAT. Employed estimation method was multilayer perceptron neural network with error backpropagation training algorithm. Different methods based on intensity and/or shape of measured profiles were tested. The best classification accuracy of the main tree species was about 88% and the mean error of est...

This paper presents a method of shape chartification suitable for surface approximation. The innovation of this approach lies on the definition of an iterative refinement of the shape into a set of patches that are automatically tiled and used to approximate the original shape up to a prescribed error. The coding of the patches is supported by the Reeb graph and contains the rules to properly t...