Methods for calculating gliding-box lacunarity efficiently on large datasets

Abstract Lacunarity has proven to be a useful, multifaceted tool for image analysis in several different scientific fields, from geography to virology, which has lent increasing importance to the lacunarity analysis of large datasets. It can be most reliably calculated with the so-called gliding-box method, but the evaluation process can be exceedingly time-consuming and unviable as this algorithm is not designed to operate on large datasets. Here we introduce two novel methods that can calculate gliding-box lacunarity orders of magnitude faster than the original method without any loss of accuracy. We compare these methods with the original as well as with two already existing optimized methods based on runtime memory usage and complexity. The application of all five methods for both 2D and 3D datasets analysis confirms that each of the four optimized methods are orders of magnitude faster than the original one, but each has its advantages and limitations.

Authors

Institutions

Publication Details

Journal
Pattern Analysis and Applications
Published
2024-09-13
DOI
https://doi.org/10.1007/s10044-024-01332-6
Citations
1
Primary Topic
Anomaly Detection Techniques and Applications
Type
article
Field-Weighted Citation Impact
0.35

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Methods for calculating gliding-box lacunarity efficiently on large datasets

Bálint Barna H. Kovács, Miklós Erdélyi
1 citations
Pattern Analysis and Applications
Anomaly Detection Techniques and Applications
0.35
article

Methods for calculating gliding-box lacunarity efficiently on large datasets

Bálint Barna H. Kovács, Miklós Erdélyi
article en
1 citations

Abstract

Abstract Lacunarity has proven to be a useful, multifaceted tool for image analysis in several different scientific fields, from geography to virology, which has lent increasing importance to the lacunarity analysis of large datasets. It can be most reliably calculated with the so-called gliding-box method, but the evaluation process can be exceedingly time-consuming and unviable as this algorithm is not designed to operate on large datasets. Here we introduce two novel methods that can calculate gliding-box lacunarity orders of magnitude faster than the original method without any loss of accuracy. We compare these methods with the original as well as with two already existing optimized methods based on runtime memory usage and complexity. The application of all five methods for both 2D and 3D datasets analysis confirms that each of the four optimized methods are orders of magnitude faster than the original one, but each has its advantages and limitations.

Pattern Analysis and ApplicationsVol. 27(4)
University of Szeged (HU)
Szegedi Tudományegyetem, Nemzeti Kutatási, Fejlesztési és Innovaciós Alap
Openalex Percentile: Top 34%
Anomaly Detection Techniques and Applications
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Methods for calculating gliding-box lacunarity efficiently on large datasets — Bálint Barna H. Kovács, Miklós Erdélyi · Pattern Analysis and Applications (2024) | TGRS Research Map | TGRS