Results 31 to 40 of about 655,112 (194)
Conditional Random Field Features and Structure Assessment for Digital Terrain Modeling
IEEE Access, 2021 The conditional random field is a suitable framework for contextual classification of two-dimensional (images) and three-dimensional (point clouds) data.
Tito Arevalo-Ramirez +1 more
doaj +1 more source
Acta Scientiarum: Technology, 2023 Spectral Graph theory has been utilized frequently in the field of Computer Vision and Pattern Recognition to address challenges in the field of Image Segmentation and Image Classification.
Subramaniam Usha +3 more
doaj +1 more source
Delaunay triangulation based image enhancement for echocardiography images [PDF]
, 2009 A novel image enhancement approach for automatic echocardiography image processing is proposed. The main steps include undecimated wavelet based speckle noise reduction, edge detection, followed by a regional enhancement process that employs Delaunay ...
Ahanathapillai, V. +2 more
core +3 more sources
Mathematics, 2021 Every biological image contains quantitative data that can be used to test hypotheses about how patterns were formed, what entities are associated with one another, and whether standard mathematical methods inform our understanding of biological ...
John R. Jungck +3 more
doaj +1 more source
Similarity Invariant Delaunay Graph Matching [PDF]
, 2008 Delaunay tessellation describes a set of arbitrarily distributed points as unique triangular graphs which preserves most local point configuration called a clique regardless of noise addition and partial occlusion. In this paper, this structure is utilised in a matching method and proposed a clique-based Hausdorff Distance (HD) to address point pattern
Dongjoe Shin, Tardi Tjahjadi
openaire +2 more sources
Triangulations with Circular Arcs
Journal of Graph Algorithms and Applications, 2015 An important objective in the choice of a triangulation of a given point set is that the smallest angle becomes as large as possible. When triangulation edges are straight line segments, it is known that the Delaunay triangulation is the optimal solution.
Oswin Aichholzer +5 more
doaj +1 more source
Node Overlap Removal by Growing a Tree
Journal of Graph Algorithms and Applications, 2017 Node overlap removal is a necessary step in many scenarios including laying out a graph, or visualizing a tag cloud. Our contribution is a new overlap removal algorithm that iteratively builds a Minimum Spanning Tree on a Delaunay triangulation of the ...
Lev Nachmanson +4 more
doaj +1 more source
Model Graf Spasial Adaptif untuk Optimasi Jalur UAV pada Sistem Mitigasi Kebakaran Hutan
EdumaticDynamic wildfires require adaptive mitigation systems capable of responding in real time. Optimizing Unmanned Aerial Vehicle (UAV) routes is critical for effective fire mitigation.
Adinda Salsa Leviona +1 more
doaj +1 more source
On the Isomorphism between the Medial Axis and a Dual of the Delaunay Graph [PDF]
2009 Sixth International Symposium on Voronoi Diagrams, 2009 In this paper, we show a graph isomorphism between a dual graph of the Delaunay graph of the sampled points and the medial axis of the sampled features. This dual graph captures the fact that two Delaunay triangles share two vertices or an edge. Then, we apply it to the computation of the medial axis of the features selected in an image.
Ojaswa Sharma +2 more
openaire +3 more sources
ISPRS International Journal of Geo-InformationPedestrian trajectory prediction plays a vital role in autonomous driving and intelligent surveillance systems. Graph neural networks (GNNs) have shown remarkable effectiveness in this task by explicitly modeling social interactions among pedestrians ...
Lei Chen, Jiajia Li, Jun Xiao, Rui Liu
doaj +1 more source