Discrete Geodesic Distribution-Based Graph Kernel for 3D Point Clouds

In the structural analysis of discrete geometric data, graph kernels have a great track record of performance. Using graph kernel functions provides two significant advantages. First, a graph kernel is capable of preserving the graph’s topological structures by describing graph properties in a high-...

Descripción completa

Detalles Bibliográficos
Autores principales: Balcı, Mehmet Ali, Akgüller, Ömer, Batrancea, Larissa M., Gaban, Lucian
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2023
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10007318/
https://www.ncbi.nlm.nih.gov/pubmed/36904604
http://dx.doi.org/10.3390/s23052398

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10007318/
https://www.ncbi.nlm.nih.gov/pubmed/36904604
http://dx.doi.org/10.3390/s23052398

Ejemplares similares