We introduce a simple and effective point descriptor, called 3D Laplacian Pyramid Signature (3DLPS), by extending and adapting the Laplacian Pyramid defined in 2D images to 3D shapes. The signature is represented as a high-dimensional feature vector recording the magnitudes of mean curvatures, which are captured through sequentially applying Laplacian of Gaussian (LOG) operators on each vertex ...

Surface creases provide us with important information about the shapes of objects and can be intuitively defined as curves on a surface along which the surface bends sharply. Our mathematical description of such surface creases is based on study of extrema of the principal curvatures along their curvature lines. On a smooth generic surface we define ridges to be the local positive maxima of the...

This paper presents a novel hybrid method for visual information retrieval (VIR) that combines shape analysis of objects in image with their automatic indexing by textual descriptions. The principal goal of proposed method is the applying semantic Web approaches for visual information description in systems which use the low-level image characteristics. In the proposed method the user-oriented ...

In this paper, we propose a set of free-form shape deformation techniques. The basic approach can be described as follows. Given a surface represented by a mesh and a control point, for every mesh vertex let us consider the difference between the control point and the vertex. The vertex is shifted by a displacement equal to the difference times a scale factor where the scale factor is given by ...

[email protected] (Lijun Yin) Abstract In this paper we propose a novel method for detecting and tracking facial landmark features on 3D static and 3D dynamic (a.k.a. 4D) range data. Our proposed method involves fitting a shape indexbased statistical shape model (SI-SSM) with both global and local constraints to the input range data. Our proposed model makes use of the global shape of the...

A static shape analysis is presented that can prove the absence of NULLand dangling pointer dereferences in standard algorithms on lists, trees and graphs. It is conceptually simpler than other analyses that use symbolically represented logic to describe the heap. Instead, it represents the heap as a single graph and a Boolean formula. The key idea is to summarize two nodes by calculating their...

This report documents the programme and the outcome of Dagstuhl Seminar 15451 “Verification of Evolving Graph Structures”. The aim was to bring together researchers from different communities (shape analysis, separation logic, graph transformation, verification of infinite-state systems) who are interested in developing techniques for the analysis of graph manipulations, i.e., methods that are ...

Fatigue describes the damage or failure of material under cyclic loading. Activation and deactivation operations of technical units are important examples in engineering where fatigue and especially low-cycle fatigue (LCF) play an essential role. A significant scatter in fatigue life for many materials results in the necessity of advanced probabilistic models for fatigue. Moreover, structural s...

Shape similarity assessment is a fundamental geometric reasoning problem that finds application in several different product design and manufacturing applications. A computationally efficient way to assess shape similarity is to first abstract 3D object shapes into shape signatures and use shape signatures to perform similarity assessment. Several different types of shape signatures have been d...

The problem of efficiently finding images that are similar to a target image has attracted much attention in the image processing community and is rightly considered an information retrieval task. However, the problem of finding structure and regularities in large image datasets is an area in which data mining is beginning to make fundamental contributions. In this work, we consider the new pro...