Skip to main content

Fast Feature Extraction Method for Faults Detection System

  • Conference paper
  • First Online:
  • 1303 Accesses

Abstract

The feature extraction based on machine learning is significant in the detection system. The boundary information, the circumference and the area are the essential features in the identification and the classification of flaws. In order to get those information, this paper proposed a novel algorithm to get the boundary information using the boundary tracking, and to make each flaw independent by establishing a balanced binary search tree for data storage. By scanning the image and the image boundaries based on binarization transformation, there is no need to fill the region, nor need to use the chain code to count the number of regions and the boundary information. According to the established balanced binary search tree, we can calculate the number of the pixel of the area of each fault, the edge information of the boundary, and the circumference. The algorithm has the advantages of fast speed, less computation, better noise suppression and accurate results.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Liu, H., Shen, J., Guo, S.: Digital image processing using Visual C++. China Mach. Press 6, 154–156 (2010)

    Google Scholar 

  2. Chen, Y., Shang, L.: Improved SIFT image registration algorithm on characteristic statistical distributions and consistency constraint. Optik-Int. J. Light Electron Opt. 127(2), 900–911 (2016)

    Article  Google Scholar 

  3. Lin, H., Du, P., Zhao, W., et al.: Image registration based on corner detection and affine transformation. In: 2010 3rd International Congress on Image and Signal Processing (CISP), vol. 5, pp. 2184–2188. IEEE (2010)

    Google Scholar 

  4. Goodman, J., Weare, J.: Ensemble samplers with affine invariance. Commun. Appl. Math. Comput. Sci. 5(1), 65–80 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Wang, W., Zhang, D., Zhang, Y., et al.: Robust spatial matching for object retrieval and its parallel implementation on GPU. IEEE Trans. Multimedia 13(6), 1308–1318 (2011)

    Article  Google Scholar 

  6. Wang, P., Chen, Q., Chen, H., et al.: A new affine-invariant image matching method based on SIFT. In: International Symposium on Photoelectronic Detection and Imaging 2013: Infrared Imaging and Applications. International Society for Optics and Photonics, vol. 8907, p. 89072D (2013)

    Google Scholar 

  7. Yeh, J.P.: Detecting edge using support vector machine. Adv. Mater. Res. 588, 974–977 (2012). Trans Tech Publications

    Article  Google Scholar 

  8. Sun, X.H.: Digital image processing: the principle and algorithm (2010). (in Chinese). 孙燮华. 数字图像处理: 原理与算法 (2010)

    Google Scholar 

  9. Liu, L.L.: New algorithm and its application for edge detection in morphology. J. Infrared Millimeter Waves 17(5), 386–390 (1998)

    Google Scholar 

  10. Zhao, J., Xu, Y., Jiao, Y.: The fast arithmetic study of image edge detection based on the order morphology. Acta Electronica Sinica 36(11), 2195–2199 (2008)

    Google Scholar 

  11. Chuang, C.H., Lie, W.N.: A downstream algorithm based on extended gradient vector flow field for object segmentation. IEEE Trans. Image Process. 13(10), 1379–1392 (2004)

    Article  Google Scholar 

  12. Zhao, Y., Chen, H., Wang, S., et al.: An improved method of detecting edge direction for spatial error concealment. J. Multimedia 7(3), 262–268 (2012)

    Article  Google Scholar 

  13. Jie, H.: The Annotated STL Source. Huazhong University of Science and Technology Press, WuHan (2002). (in Chinese). 侯捷. STL 源码剖析. 华中科技大学出版社 (2002)

    Google Scholar 

  14. Tang, J., Millington, S., Acton, S.T., et al.: Surface extraction and thickness measurement of the articular cartilage from MR images using directional gradient vector flow snakes. IEEE Trans. Biomed. Eng. 53(5), 896–907 (2006)

    Article  Google Scholar 

  15. Xie, J., Li, S., Lin, G.: The method of calculating the area and circumference based on the boundary trace. Electron. Technol. Softw. Eng. (9), 119–120 (2014). (in Chinese). 谢家龙, 李林升, 林国湘. 基于边界跟踪的多连通区域面积和周长的计算方法. 电子技术 与软 件工程 (9), 119–120 (2014)

    Google Scholar 

  16. Zhou, X., Chen, Y., Hu, W.: Tree traversal binary image boundary tracing algorithm based on cross-point. Comput. Appl. Softw. 31(2), 230–232 (2014). (in Chinese). 周秀芝, 陈洋, 胡文婷. 基于交叉点的树遍历二值图像边界跟踪算法. 计算机应用与软件 31(2), 230–232 (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaohui Zhu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, H., Zhu, X., Niu, X., Xue, P. (2018). Fast Feature Extraction Method for Faults Detection System. In: Sun, G., Liu, S. (eds) Advanced Hybrid Information Processing. ADHIP 2017. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 219. Springer, Cham. https://doi.org/10.1007/978-3-319-73317-3_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-73317-3_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-73316-6

  • Online ISBN: 978-3-319-73317-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics