Execution time optimization analysis on multiple algorithms performance of moving object edge detection

Syed Zahurul Islam, Syed Zahidul Islam, Razali Jidin, Mohd Alauddin Mohd. Ali

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Citations (Scopus)

    Abstract

    Computer vision and digital image processing comprises varieties of applications, where some of these used in image processing include convolution, edge detection as well as contrast enhancement. This paper analyzes execution time optimization analysis between Sobel and Canny image processing algorithms in terms of moving objects edge detection. Sobel and Canny edge detection algorithms have been described with pseudo code and detailed flow chart and implemented in C and MATLAB respectively on different platforms to evaluate performance and execution time for moving cars. It is shown that Sobel algorithm is very effective in case of moving multiple cars and blurs images with efficient execution time. Moreover, convolution operation of Canny takes 94-95% time of total execution time with thin and smooth but redundant edges. This also makes more robust of Sobel to detect moving cars edges.

    Original languageEnglish
    Title of host publicationAIP Conference Proceedings
    Pages289-295
    Number of pages7
    Volume1239
    DOIs
    Publication statusPublished - 2010
    Event3rd Global Conference on Power Control and Optimization, PCO 2010 - Gold Coast, QLD
    Duration: 2 Feb 20104 Feb 2010

    Other

    Other3rd Global Conference on Power Control and Optimization, PCO 2010
    CityGold Coast, QLD
    Period2/2/104/2/10

    Fingerprint

    edge detection
    optimization
    image processing
    convolution integrals
    flow charts
    computer vision
    platforms
    augmentation

    Keywords

    • Canny algorithm
    • edge detection
    • image processing
    • Sobel operator

    ASJC Scopus subject areas

    • Physics and Astronomy(all)

    Cite this

    Islam, S. Z., Islam, S. Z., Jidin, R., & Mohd. Ali, M. A. (2010). Execution time optimization analysis on multiple algorithms performance of moving object edge detection. In AIP Conference Proceedings (Vol. 1239, pp. 289-295) https://doi.org/10.1063/1.3459762

    Execution time optimization analysis on multiple algorithms performance of moving object edge detection. / Islam, Syed Zahurul; Islam, Syed Zahidul; Jidin, Razali; Mohd. Ali, Mohd Alauddin.

    AIP Conference Proceedings. Vol. 1239 2010. p. 289-295.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Islam, SZ, Islam, SZ, Jidin, R & Mohd. Ali, MA 2010, Execution time optimization analysis on multiple algorithms performance of moving object edge detection. in AIP Conference Proceedings. vol. 1239, pp. 289-295, 3rd Global Conference on Power Control and Optimization, PCO 2010, Gold Coast, QLD, 2/2/10. https://doi.org/10.1063/1.3459762
    Islam SZ, Islam SZ, Jidin R, Mohd. Ali MA. Execution time optimization analysis on multiple algorithms performance of moving object edge detection. In AIP Conference Proceedings. Vol. 1239. 2010. p. 289-295 https://doi.org/10.1063/1.3459762
    Islam, Syed Zahurul ; Islam, Syed Zahidul ; Jidin, Razali ; Mohd. Ali, Mohd Alauddin. / Execution time optimization analysis on multiple algorithms performance of moving object edge detection. AIP Conference Proceedings. Vol. 1239 2010. pp. 289-295
    @inproceedings{e0fef520159043e193db1baaca413c62,
    title = "Execution time optimization analysis on multiple algorithms performance of moving object edge detection",
    abstract = "Computer vision and digital image processing comprises varieties of applications, where some of these used in image processing include convolution, edge detection as well as contrast enhancement. This paper analyzes execution time optimization analysis between Sobel and Canny image processing algorithms in terms of moving objects edge detection. Sobel and Canny edge detection algorithms have been described with pseudo code and detailed flow chart and implemented in C and MATLAB respectively on different platforms to evaluate performance and execution time for moving cars. It is shown that Sobel algorithm is very effective in case of moving multiple cars and blurs images with efficient execution time. Moreover, convolution operation of Canny takes 94-95{\%} time of total execution time with thin and smooth but redundant edges. This also makes more robust of Sobel to detect moving cars edges.",
    keywords = "Canny algorithm, edge detection, image processing, Sobel operator",
    author = "Islam, {Syed Zahurul} and Islam, {Syed Zahidul} and Razali Jidin and {Mohd. Ali}, {Mohd Alauddin}",
    year = "2010",
    doi = "10.1063/1.3459762",
    language = "English",
    isbn = "9780735407855",
    volume = "1239",
    pages = "289--295",
    booktitle = "AIP Conference Proceedings",

    }

    TY - GEN

    T1 - Execution time optimization analysis on multiple algorithms performance of moving object edge detection

    AU - Islam, Syed Zahurul

    AU - Islam, Syed Zahidul

    AU - Jidin, Razali

    AU - Mohd. Ali, Mohd Alauddin

    PY - 2010

    Y1 - 2010

    N2 - Computer vision and digital image processing comprises varieties of applications, where some of these used in image processing include convolution, edge detection as well as contrast enhancement. This paper analyzes execution time optimization analysis between Sobel and Canny image processing algorithms in terms of moving objects edge detection. Sobel and Canny edge detection algorithms have been described with pseudo code and detailed flow chart and implemented in C and MATLAB respectively on different platforms to evaluate performance and execution time for moving cars. It is shown that Sobel algorithm is very effective in case of moving multiple cars and blurs images with efficient execution time. Moreover, convolution operation of Canny takes 94-95% time of total execution time with thin and smooth but redundant edges. This also makes more robust of Sobel to detect moving cars edges.

    AB - Computer vision and digital image processing comprises varieties of applications, where some of these used in image processing include convolution, edge detection as well as contrast enhancement. This paper analyzes execution time optimization analysis between Sobel and Canny image processing algorithms in terms of moving objects edge detection. Sobel and Canny edge detection algorithms have been described with pseudo code and detailed flow chart and implemented in C and MATLAB respectively on different platforms to evaluate performance and execution time for moving cars. It is shown that Sobel algorithm is very effective in case of moving multiple cars and blurs images with efficient execution time. Moreover, convolution operation of Canny takes 94-95% time of total execution time with thin and smooth but redundant edges. This also makes more robust of Sobel to detect moving cars edges.

    KW - Canny algorithm

    KW - edge detection

    KW - image processing

    KW - Sobel operator

    UR - http://www.scopus.com/inward/record.url?scp=77955739840&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=77955739840&partnerID=8YFLogxK

    U2 - 10.1063/1.3459762

    DO - 10.1063/1.3459762

    M3 - Conference contribution

    AN - SCOPUS:77955739840

    SN - 9780735407855

    VL - 1239

    SP - 289

    EP - 295

    BT - AIP Conference Proceedings

    ER -