Research on detecting internal trunk-boring insects in living trees based on BP-UNet
Source abstract
Abstract
The invasion of trunk-boring insects halts tree growth and causes tree death, making it a key factor in forest destruction. To address the issue of low detection accuracy due to the small size and high concealment of trunk-boring insects, a combined driving algorithm based on BP-UNet is proposed. The BP algorithm exhibits high sensitivity to relative permittivity, enabling the detection of smaller insects. By learning the implicit geometric features from the BP results, UNet can accurately reconstruct the size and shape of the insects. To demonstrate the performance of the proposed algorithm, the BP-UNet is compared with the BP and UNet algorithms, and its generalisation ability in different scenarios is tested. Experimental results show that the BP-UNet algorithm has good generalisation and achieves a detection accuracy of over 80% even in the presence of noise, providing quantitative images of trunk-boring insects within 1 second.
Source: openalex_inverted_index · Quality: baseline
Research context
OpenAlex topics: Remote Sensing and LiDAR Applications · Industrial Vision Systems and Defect Detection · Wood and Agarwood Research
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Northeast Forestry University
Heilongjiang University
Funding
National Key Research and Development Program · Fundamental Research Funds for the Central Universities
References (39)
Show source-provided references
1. FAO. The state of the world's forests 2022. Forest pathways for green recovery and building inclusive, resilient and sustainable economies. Rome, FAO; 2022.
2. 10.1146/annurev-ento-120220-12541010.1146/annurev-ento-120220-125410 ↗
3. 10.1653/024.105.011110.1653/024.105.0111 ↗
4. 10.3390/rs1606100510.3390/rs16061005 ↗
5. 10.1364/AO.58.00606310.1364/AO.58.006063 ↗
6. 10.1016/j.compag.2008.02.00410.1016/j.compag.2008.02.004 ↗
7. 10.4039/tce.2015.5110.4039/tce.2015.51 ↗
8. 10.3390/insects1307059610.3390/insects13070596 ↗
9. 10.3390/insects1407063110.3390/insects14070631 ↗
10. 10.1007/s10967-011-1278-510.1007/s10967-011-1278-5 ↗
11. 10.1109/TMTT.2022.320589010.1109/TMTT.2022.3205890 ↗
12. 10.1080/10589759.2023.217375110.1080/10589759.2023.2173751 ↗
13. 10.1109/TMTT.2023.323446610.1109/TMTT.2023.3234466 ↗
14. 10.1080/10589759.2023.219564610.1080/10589759.2023.2195646 ↗
15. 10.3390/s2224984010.3390/s22249840 ↗
16. 10.1117/1.JMI.6.1.01400610.1117/1.JMI.6.1.014006 ↗
17. 10.1080/10589759.2023.223454810.1080/10589759.2023.2234548 ↗
18. 10.1080/10589759.2024.230532910.1080/10589759.2024.2305329 ↗
19. 10.1038/s41586-018-0631-z10.1038/s41586-018-0631-z ↗
20. 10.1109/TAP.2017.270522610.1109/TAP.2017.2705226 ↗
21. 10.1109/TGRS.2018.286922110.1109/TGRS.2018.2869221 ↗
22. 10.1109/TAP.2010.210302710.1109/TAP.2010.2103027 ↗
23. 10.1109/TAP.2018.288543710.1109/TAP.2018.2885437 ↗
24. 10.1109/ACCESS.2021.308602010.1109/ACCESS.2021.3086020 ↗
25. 10.1109/JSTARS.2022.314643010.1109/JSTARS.2022.3146430 ↗
26. 10.3390/axioms1101003410.3390/axioms11010034 ↗
27. 10.1002/stc.303610.1002/stc.3036 ↗
28. 10.1007/s00226-005-0060-710.1007/s00226-005-0060-7 ↗
29. 10.1016/0378-1127(87)90098-310.1016/0378-1127(87)90098-3 ↗
30. 10.1109/ICGPR.2014.697040510.1109/ICGPR.2014.6970405 ↗
31. 10.1109/TGRS.2009.202512210.1109/TGRS.2009.2025122 ↗
32. 10.1007/s11042-021-10704-710.1007/s11042-021-10704-7 ↗
33. Bergstra J, Bengio Y. Random search for hyper-parameter optimization. J Mach Learn Res. 2012;13:281–305.
34. Duchi JC, Hazan E, Singer Y. Adaptive subgradient methods for online learning and stochastic optimization. J Mach Learn Res. 2011;12:2121–2159.
35. 10.1109/TGRS.2022.315298410.1109/TGRS.2022.3152984 ↗
36. 10.1109/ACCESS.2019.293798210.1109/ACCESS.2019.2937982 ↗
37. 10.1109/TMTT.2024.338599610.1109/TMTT.2024.3385996 ↗
38. 10.1016/j.conbuildmat.2014.12.03010.1016/j.conbuildmat.2014.12.030 ↗
39. 10.1016/j.ndteint.2024.10318310.1016/j.ndteint.2024.103183 ↗