Fast Search Using k-d Trees with Fine Search for Spectral Data Identification
Sign Up to like & getrecommendations! Published in 2025 at "Mathematics"
DOI: 10.3390/math13040574
Abstract: Spectral identification is an essential technology in various spectroscopic applications, often requiring large spectral databases. However, the reliance on large databases significantly increases computational complexity. To address this issue, we propose a novel fast search… read more here.
Keywords: using trees; fine search; search; fast search ... See more keywords