2013
DOI: 10.1016/j.cag.2013.05.007
|View full text |Cite
|
Sign up to set email alerts
|

Grouping real functions defined on 3D surfaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2013
2013
2017
2017

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 36 publications
0
6
0
Order By: Relevance
“…The approach groups the functions in a completely unsupervised manner according to a distance defined on F . The results obtained in [9] show that for a given class of shapes it is possible to identify a (small) number of functions that are mutually independent. For a set F D ff 1 ; : : : ; f n g of n functions defined on a triangle mesh T representing a shape, the distance I .f i ; f j / between two functions f i and f j is given by:…”
Section: Selection Of Representative Functionsmentioning
confidence: 93%
See 2 more Smart Citations
“…The approach groups the functions in a completely unsupervised manner according to a distance defined on F . The results obtained in [9] show that for a given class of shapes it is possible to identify a (small) number of functions that are mutually independent. For a set F D ff 1 ; : : : ; f n g of n functions defined on a triangle mesh T representing a shape, the distance I .f i ; f j / between two functions f i and f j is given by:…”
Section: Selection Of Representative Functionsmentioning
confidence: 93%
“…In principle, this set of functions is very large; the space of the eigenfunctions of the Laplace-Beltrami operator or heat-kernel functions are possible examples as well as distance-based or geodesic-based functions [9]. We start from a set of 76 functions that in our idea reflects either intrinsic or extrinsic shape features (see [8] for a complete description of these functions), then we cluster them according to the method presented in Sect.…”
Section: Geometric Descriptionmentioning
confidence: 99%
See 1 more Smart Citation
“…To select functions, we performed several experiments with different choices of the clustering parameters. Not surprisingly we discovered that the performance of the MDM descriptor increases when discarding approximatively half functions; indeed we are removing redundant and, maybe overfitting, information, see also [BSF13] for more detailed discussions on the selection and grouping of real functions. We used the DBSCAN implementation described in [DWM01], run it on an approximation of the diffusion map obtained with the first three eigenvectors and select t = 3.…”
Section: Geometric Descriptionmentioning
confidence: 99%
“…The DBSCAN clustering technique for selecting representative geometric functions is replaced by the one used in [8], which is based on the replicator dynamics technique [55]. The modified geometric descriptors are compared via the EMD as well, after converting the M DM matrices into feature vectors.…”
Section: Phog: Photometric and Geometric Functions For Textured Shapementioning
confidence: 99%