Seminarai, kursai

2025 m. spalio 27 d., 13 val.

Vilnius, Akademijos g. 4, 203 kab.
Nuotoliniu būdu „MS Teams“ aplinkoje (https://bit.ly/DMSTI_2025-10-27)

Ilja Jurčenko

(Išmaniųjų technologijų tyrimų grupė)

Glauco Endrigo Moura de Lima

(Blokų grandinių ir kvantinių technologijų grupė)

„Prisistatymas“

Kasparas Karlauskas

(doktorantūros studijų rezultatų pristatymas, vadovas: prof. dr. Povilas Treigys)

„Entropija pagrįstas didelio tankio miško taškų debesų išankstinis filtravimas atskirų medžių aptikimo algoritmui“

Pristatomas A lygio konferencijoje „SSTD'25: International Symposium on Spatial and Temporal Data, Osaka, Japan, August 25-27, 2025“ skaitytas pranešimas „Entropy-based pre-filtering of high-density forest point clouds for individual tree detection algorithms“ https://doi.org/10.1145/3748777.3748806  

Resume: Light Detection and Ranging have enabled the creation and analysis of highly detailed 3D point cloud representations of outdoor areas through Terrestrial Laser Scanning and Mobile Laser Scanning. In the field of forestry, one important spatial data processing task is detecting individual tree stems, which is often a prerequisite for individual tree location mapping, wood volume estimation, and other tree inventorization analysis. The high point densities achieved through Terrestrial Laser Scanning and Mobile Laser Scanning allow for high accuracy in delineating individual tree stems, but lead to a high computational cost due to the large point counts. This study proposes a computationally efficient approach for removing points unlikely to belong to tree stems, based on point distribution entropy within local regions. The approach is motivated by the observation that stems exhibit low entropy, whereas canopy regions tend to have higher entropy. The point filtering algorithm works in linear time and can lead to significant processing time gains while often maintaining accuracy for downstream digital forestry tasks.