We present a new and efficient algorithm for decomposition of arbitrary triangle meshes into connected subsets of meshes called regions. Our method, based on discrete curvature analysis decomposes the object into almost constant curvature surfaces and not only “cut” the object along its hard edges like traditional methods. This algorithm is an hybrid approach vertex-triangle, it is based on thr...

Denoising is a cornerstone of image analysis and remains a very active research field. This paper deals with image filters that rely on similarity kernels to compute weighted pixel averages. Whereas similarities have been based on the comparison of isolated pixel values until recently, modern filters extend the paradigm to groups of pixels called patches. Significant quality improvements result...

We consider the following question, motivated by the enumeration of fullerenes. A fullerene patch is a 2-connected plane graph G in which inner faces have length 5 or 6, non-boundary vertices have degree 3, and boundary vertices have degree 2 or 3. The degree sequence along the boundary is called the boundary code of G. We show that the question whether a given sequence S is a boundary code of ...

Degradation of plant patches is considered as one of the indices for rangeland degrading health condition. Investigating the accuracy of triple indices (infiltration, stability and soil nutrient cycle) presented by LFA method seems necessary to determine its efficiency in semi-arid areas with the least cost. This study aims to investigate the role of vegetative species and growing forms on soil...

PCANet is an unsupervised Convolutional Neural Network (CNN), which uses Principal Component Analysis (PCA) to learn convolutional filters. One drawback of that linear PCA cannot capture nonlinear structures within data. To address this problem, a straightforward approach utilizing kernel methods by equipping the method in with function. However, practice leads network having cubic complexity r...