Pattern analysis is a wide domain that has wide applicability in many fields. In fact, texture analysis is one of those fields, since the texture is defined as a set of repetitive or quasi-repetitive patterns. Despite its importance in analyzing 3D meshes, geometric texture analysis is less studied by geometry processing community. This paper presents a new efficient approach for geometric texture analysis on 3D triangular meshes. The proposed method is a scale-aware approach that takes as input a 3D mesh and a user-scale. It provides, as a result, a similarity-based clustering of texels in meaningful classes. Experimental results of the proposed algorithm are presented for both real-world and synthetic meshes within various textures. Furthermore, the efficiency of the proposed approach was experimentally demonstrated under mesh simplification and noise addition on the mesh surface. In this paper, we present a practical application for semantic annotation of 3D geometric salient texels.
Due to the increasing use of Terrestrial Laser Scanning (TLS) systems in the forestry domain for forest inventory, the development of software tools for the automatic measurement of forest inventory attributes from TLS data has become a major research field. Numerous research work on the measurement of attributes such as the localization of the trees, the Diameter at Breast Height (DBH), the height of the trees, and the volume of wood has been reported in the literature. However, to the best of our knowledge the problem of tree species recognition from TLS data has received very little attention from the scientific community. Most of the research work uses Airborne Laser Scanning (ALS) data and measures tree species attributes on large scales. In this paper we propose a method for individual tree species classification of five different species based on the analysis of the 3D geometric texture of the bark. The texture features are computed using a combination of the Complex Wavelet Transforms (CWT) and the Contourlet Transform (CT), and classification is done using the Random Forest (RF) classifier. The method has been tested using a dataset composed of 230 samples. The results obtained are very encouraging and promising. This article introduces a method for partial matching of surfaces represented by triangular meshes. Our method matches surface regions that are numerically and topologically dissimilar, but approximately similar regions. We introduce novel local surface descriptors which efficiently represent the geometry of local regions of the surface. The descriptors are defined independently of the underlying triangulation, and form a compatible representation that allows matching of surfaces with different triangulations. To cope with the combinatorial complexity of partial matching of large meshes, we introduce the abstraction of salient geometric features and present a method to construct them. A salient geometric feature is a compound high-level feature of nontrivial local shapes. We show that a relatively small number of such salient geometric features characterizes the surface well for various similarity applications. Matching salient geometric features is based on indexing rotation-invariant features and a voting scheme accelerated by geometric hashing. We demonstrate the effectiveness of our method with a number of applications, such as computing self-similarity, alignments, and subparts similarity. On the basis of minima rule from the cognitive theory, this paper presents an algorithm decomposing a mesh into smaller parts by feature contours, gotten from the minima negative curvature vertices. The algorithm is carried out in two steps. Firstly, to avoid over-segmentation, our method excludes unimportant local adjacent similar contours. Secondly, the remnant salient contours are automatically completed to form short loops around mesh's parts, constrained by two near parallel cutting planes that are determined by principal component analysis of all vertices. The algorithm has been demonstrated on many meshes, and the results show that it not only can perceptual group the adjacent self-similarity regions, but also can achieve reasonable segmentations. Geometry textures are a novel geometric representation for surfaces based on height maps. The visualization is done through a graphics processing unit (GPU) ray casting algorithm applied to the whole object. At rendering time, the fine-scale details (mesostructures) are reconstructed preserving original quality. Visualizing surfaces with geometry textures allows a natural level-of-detail (LOD) behaviour. There are numerous applications that can benefit from the use of geometry textures. In this paper, besides a mesostructure visualization survey, we present geometry textures with three possible applications: rendering of solid models, geological surfaces visualization and surface smoothing. Surface selection is one of the fundamental interactions in shape modeling. In the case of complex models, this task is often tedious for at least two reasons: firstly the local geometry of a given region may be hard to manually select and needs great accuracy; secondly the selection process may have to be repeated a large number of times for similar regions requiring similar subsequent editing. We propose SimSelect, a new system for interactive selection on 3D surfaces addressing these two issues. We cope with the accuracy issue by classifying selections in different types, namely components, parts and patches for which we independently optimize the selection process. Second, we address the repetitiveness issue by introducing an expansion process based on shape recognition which automatically retrieves potential selections similar to the user-defined one. As a result, our system provides the user with a compact set of simple interaction primitives providing a smooth select-and-edit workflow.