Publication | Closed Access
Unsupervised Saliency Detection of Rail Surface Defects using Stereoscopic Images
144
Citations
34
References
2020
Year
EngineeringImage AnalysisPattern RecognitionSurface ProfilesPhotometric StereoEdge DetectionComputational GeometryGeometric ModelingMachine VisionAutomated InspectionStereoscopic ImagesComputer Vision3D VisionRail Surface DefectsNatural SciencesComputer Stereo VisionVisual InformationMulti-view GeometryStereoscopic Processing
Visual information is increasingly recognized as a useful method to detect rail surface defects due to its high efficiency and stability. However, it cannot sufficiently detect a complete defect in the complex background information. The addition of surface profiles can effectively improve this by including a 3-D information of defects. However, in high-speed detection, the traditional 3-D profile acquisition is difficult and separate from the image acquisition, which cannot satisfy the above-mentioned requirements effectively. Therefore, an unsupervised stereoscopic saliency detection method based on a binocular line-scanning system is proposed in this article. This method can simultaneously obtain a highly precise image as well as profile information while also avoids the decoding distortion of the structured light reconstruction method. In our method, a global low-rank nonnegative reconstruction algorithm with a background constraint is proposed. Unlike the low-rank recovery model, the algorithm has a more comprehensive low rank and background clustering properties. Furthermore, outlier detection based on the geometric properties of the rail surface is also proposed in this method. Finally, the image saliency results and depth outlier detection results are associated with the collaborative fusion, and a dataset (RSDDS-113) containing the rail surface defects is established for the experimental verification. The experimental results demonstrate that our method can obtain a mean absolute error of 0.09 and area under the ROC curve of 0.94, better than 15 state-of-the-art algorithms.
| Year | Citations | |
|---|---|---|
Page 1
Page 1