FAST WATERSHED-BASED DILATION
1
Section of Computers Science, Department of Technical Sciences, Pope John Paul II State School of Higher Education in Biała Podlaska, Sidorska 95/97, 21-500 Biała Podlaska, Poland
Publication date: 2014-09-09
Adv. Sci. Technol. Res. J. 2014; 8(23):41-44
KEYWORDS
ABSTRACT
A watershed-based region growing image segmentation algorithm requires a fast watershed-based dilation implementation for effective operation. This paper presents a new way for watershed image representation and uses this representation for effective implementation of dilation. Methods for improving the algorithm speed are discussed. Presented solutions may also be used for solving other problems where fast set summation is required.
We process personal data collected when visiting the website. The function of obtaining information about users and their behavior is carried out by voluntarily entered information in forms and saving cookies in end devices. Data, including cookies, are used to provide services, improve the user experience and to analyze the traffic in accordance with the Privacy policy. Data are also collected and processed by Google Analytics tool (more).
You can change cookies settings in your browser. Restricted use of cookies in the browser configuration may affect some functionalities of the website.
You can change cookies settings in your browser. Restricted use of cookies in the browser configuration may affect some functionalities of the website.
