کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
11028856 | 1646701 | 2019 | 22 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Efficient solution of Otsu multilevel image thresholding: A comparative study
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Efficient solution of Otsu multilevel image thresholding: A comparative study Efficient solution of Otsu multilevel image thresholding: A comparative study](/preview/png/11028856.png)
چکیده انگلیسی
Multi-level thresholding of a gray image is one of the basic operations in computer vision, with applications in image enhancement and segmentation. Various criteria for the selection of threshold level values were proposed. One of these criterion is the Otsu criterion that uses maximization of between-class variance approach. Although applying multi-level thresholding to an image is a straightforward operation, computation of the threshold levels with Otsu criterion is a computationally expensive process. In this paper, we revisit a dynamic programming algorithm that provides exact and efficient solution to the problem and compare it with modern meta-heuristic algorithms. We provide a rigorous proof for the correctness of the algorithm. The algorithm computational cost is linear in the number of threshold levels. We compare the algorithm with state of the art algorithms and verify its superior performance. The experiments show that we could gain speedup up to 2.45â¯Ãâ¯.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Expert Systems with Applications - Volume 116, February 2019, Pages 299-309
Journal: Expert Systems with Applications - Volume 116, February 2019, Pages 299-309
نویسندگان
Mohamed H. Merzban, Mahmoud Elbayoumi,