Отрывок: Thus, the two arcs will be joined together and fitted by an ellipse to recon- struct the missing part. At this stage, the four arcs are matched to three candidate bubbles. The last step is deci- sion if these bubbles are well identified or not. Thus, the ratio between the length of joined arcs and the circumfer- ence of the fitted circle/ellipse is computed. If it is greater than 50 %, then the fitted circle/ellipse is taken as well identified bubble else it will be rejecte...
Название : An efficient algorithm for overlapping bubbles segmentation
Авторы/Редакторы : Bettaieb, Afef
Filali, Nabila
Filali, Taoufik
Ben Aissia, Habib
Ключевые слова : bubble images
highly overlapping bubbles
bubble recognition
image segmentation
digital image processing
Дата публикации : Июн-2020
Издательство : Самарский национальный исследовательский университет
Библиографическое описание : Bettaieb A, Filali N, Filali T, Ben Aissia H. An efficient algorithm for overlapping bubbles segmentation. Computer Optics 2020; 44(3): 363-374. DOI: 10.18287/2412-6179-CO-605.
Серия/номер : 44/3;
Аннотация : Image processing is an effective method for characterizing various two-phase gas/liquid flow systems. However, bubbly flows at a high void fraction impose significant challenges such as diverse bubble shapes and sizes, large overlapping bubble clusters occurrence, as well as out-of-focus bubbles. This study describes an efficient multi-level image processing algorithm for highly overlapping bubbles recognition. The proposed approach performs mainly in three steps: overlapping bubbles classification, contour segmentation and arcs grouping for bubble reconstruction. In the first step, we classify bubbles in the image into a solitary bubble and overlapping bubbles. The purpose of the second step is overlapping bubbles segmentation. This step is performed in two subsequent steps: at first, we classify bubble clusters into touching and communicating bubbles. Then, the boundaries of communicating bubbles are split into segments based on concave point extraction. The last step in our algorithm addresses segments grouping to merge all contour segments that belong to the same bubble and circle/ellipse fitting to reconstruct the missing part of each bubble. An application of the proposed technique to computer generated and high-speed real air bubble images is used to assess our algorithm. The developed method provides an accurate and computationally effective way for overlapping bubbles segmentation. The accuracy rate of well segmented bubbles we achieved is greater than 90 % in all cases. Moreover, a computation time equal to 12 seconds for a typical image (1 Mpx, 150 overlapping bubbles) is reached.
URI (Унифицированный идентификатор ресурса) : https://dx.doi.org/10.18287/2412-6179-CO-605
http://repo.ssau.ru/handle/Zhurnal-Komputernaya-optika/An-efficient-algorithm-for-overlapping-bubbles-segmentation-84745
Другие идентификаторы : Dspace\SGAU\20200728\84745
Располагается в коллекциях: Журнал "Компьютерная оптика"

Файлы этого ресурса:
Файл Описание Размер Формат  
440307.pdfОсновная статья1.9 MBAdobe PDFПросмотреть/Открыть



Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.