Timber Knot Detector with Low False-Positive Results by Integrating an Overlapping Bounding Box Filter with Faster R-CNN Algorithm

Knot detection is an important aspect of timber grading. Reducing the false-positive frequency of knot detection will improve the accuracy of the predicted grade, as well as the utilization of the graded timber. In this study, a framework for timber knot detection was proposed. Faster R-CNN, a state-of-the-art defect identification algorithm, was first employed to detect timber knots because of its high true-positive frequency. Then, an overlapping bounding box filter was proposed to lower the false positive frequency achieved by Faster R-CNN, where a single knot is sometimes marked several times. The filter merges the overlapping bounding boxes for one actual knot into one box and ensures that each knot is marked only once. The main advantage of this framework is that it reduces the false positive frequency with a small computational cost and a small impact on the true positive frequency. The experimental results showed that the detection precision improved from 90.9% to 97.5% by filtering the overlapping bounding box. The framework proposed in this study is competitive and has potential applications for detecting timber knots for timber grading.

Automated summary

A framework for timber knot detection is proposed in this study. Faster R-CNN algorithm is employed for detecting timber knots, and an overlapping bounding box filter is proposed to reduce the false positive frequency. The experimental results showed an improvement in detection precision from 90.9% to 97.5% by filtering the overlapping bounding box. This framework is competitive and has potential applications for timber grading.