skip to main content
10.1145/3381271.3381289acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicmipConference Proceedingsconference-collections
research-article

Precise cable contour extraction method based on candidate point merge search

Published: 28 February 2020 Publication History

Abstract

Aiming at the problem that the existing image contour extraction algorithm can't be accurate to the pixel level, this paper proposes a cable contour extraction method based on candidate point merge search. The algorithm is divided into three steps: Firstly, the rough position of the target area is extracted by color, and the contour candidate points with larger gradients near the boundary are obtained; Then the adjacent candidate contour points are uniformly connected into several line segments and the angle of each line segment and the gradient sum through the pixel points are calculated; Finally define the target of the line segment merge and the principle of distance attenuation and angle attenuation and perform a merge search, by iterating until it merges into a complete contour. For contour sections where the correct candidate point cannot be found, it can be skipped by adding flag bit. The experimental results show that this algorithm can extract the cable contour at pixel level without manual parameter setting, which is of great significance for cable quality detection.

References

[1]
Canny J. A Computational Approach To Edge Detection[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1986, PAMI-8(6):679--698.
[2]
Yu X. Adaptive Canny Operator Based Digital Image Processing Scheme for Photoshop Filter Plugin Unit[C] International Conference on Intelligent Transportation. 2018.
[3]
Xu Deming, Wan Changlin. Noise-Proof Enhanced Canny Edge Detection Algorithm [J]. Computer Systems and Applications, 2017(1):201--205
[4]
Kass M, Witkin A, Terzopoulos D. Snakes: Active Contour Models[J]. International Journal of Computer Vision, 1988, 1(4):321--331.
[5]
Osher S. Fronts propagating with curvature dependent speed : Algorithms bose on Hamilton-Jacobi formulations[J]. J. Comput. Phys. 1988, 79.
[6]
Liu Chen, Chi Tao, LI Bingchun, etc. A Novel Image Segmentation Method Based on the Active Contour Model[J]. Advanced Engineering Sciences, 2017, 49(5): 101--108.
[7]
Cai Qing, Liu Huiying, Sun Jingfeng, etc. Active contour model based on adaptice segmentation and bisa field estimation [J]. Systems Engineering and Electronics, 2018, 40(5): 1148--1154.
[8]
Dollár, Piotr, Zitnick C L. Fast Edge Detection Using Structured Forests[J]. IEEE Transactions on Pattern Analysis & Machine Intelligence, 2014, 37(8):1558--1570.
[9]
Bertasius G, Shi J, Torresani L. DeepEdge: A multi-scale bifurcated deep network for top-down contour detection[C] 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2015.
[10]
Saining Xie, Zhuowen Tu Holistically-Nested Edge Detection[C] 2015 IEEE Conference on International Conference on Computer Vision(ICCV). IEEE, 2015.
[11]
Yu Z, Feng C, Liu M Y, et al. CASENet: Deep Category-Aware Semantic Edge Detection[J]. 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2017.
[12]
Haeb-Umbach R, Ney H. Improvements in beam search for 10000-word continuous-speech recognition[J]. IEEE Transactions on Speech & Audio Processing, 1994, 2(2):353--356.
[13]
Hokamp C, Liu Q. Lexically Constrained Decoding for Sequence Generation Using Grid Beam Search[J]. 2017.
[14]
Sun Peng, Wu Junsheng, Liao Mengchen, ect. Battlefield resource dynamic scheduling model and algorithm based on improved self-adaptive genetic algorithm [J]. Systems Engineering and Electronics, 2018.
[15]
Sholomon D, David O, Netanyahu N S. A Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles[J]. 2017.
[16]
Liu Wanfeng, Li xia. A fast multi-neighborhood iterated local search algorithm for vehicle routing problem [J]. Journal of Shenzhen University(Science and Engineering), 2015.

Index Terms

  1. Precise cable contour extraction method based on candidate point merge search

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    ICMIP '20: Proceedings of the 5th International Conference on Multimedia and Image Processing
    January 2020
    191 pages
    ISBN:9781450376648
    DOI:10.1145/3381271
    • Conference Chair:
    • Wanyang Dai,
    • Program Chairs:
    • Xiangyang Hao,
    • Ramayah T,
    • Fehmi Jaafar
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    • NJU: Nanjing University

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 28 February 2020

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. cable contour
    2. candidate point
    3. merge search
    4. pixel level
    5. sum of gradients

    Qualifiers

    • Research-article

    Conference

    ICMIP 2020
    Sponsor:
    • NJU

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 33
      Total Downloads
    • Downloads (Last 12 months)4
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 02 Mar 2025

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media