scholarly journals Efficient contour detection in binary and label images

2008 ◽  
Author(s):  
Gaetan Lehmann

ly in ITK, the only way to find the contour of the objects in a binary image is to use the BinaryErodeImageFilter, with a kernel of radius 1. This filter is a generic filter, made to support any shape and size of structuring element, and thus is not optimized for the particular case needed to detect the contours. Moreover, that filter is not multithreaded, so it can’t get the performance improvements allowed by the multiprocessor systems. As a result, the contour detection can be quite time consuming currently – for example, in SignedMaurerDistanceMapImageFilter, the contour detection takes about 33% of the execution time. This contribution comes with a new filter which highly improve the performance of the contour detection in the binary image, and a second filter which allow the detection of the countours in label images with similar performance.

2013 ◽  
Vol 27 (1) ◽  
pp. 188-194 ◽  
Author(s):  
Irineu Loturco ◽  
Carlos Ugrinowitsch ◽  
Hamilton Roschel ◽  
Alan Lopes Mellinger ◽  
Filipe Gomes ◽  
...  

2005 ◽  
Author(s):  
Gaetan Lehmann

Binary morphological closing and opening image filters remove structures smaller than the structuring element in a binary image.


2015 ◽  
Vol 47 ◽  
pp. 786
Author(s):  
Emily L. Williams ◽  
Hollie S. Jones ◽  
S Andy Sparks ◽  
David C. Marchant ◽  
Adrian W. Midgely ◽  
...  

2018 ◽  
Vol 1 (1) ◽  
pp. 178-186 ◽  
Author(s):  
Sevil Serttaş ◽  
Veysel Harun Şahin

Real-time systems are widely used from the automotive industry to the aerospace industry. The scientists, researchers, and engineers who develop real-time platforms, worst-case execution time analysis methods and tools need to compare their solutions to alternatives. For this purpose, they use benchmark applications. Today many of our computing systems are multicore and/or multiprocessor systems. Therefore, to be able to compare the effectiveness of real-time platforms, worst-case execution time analysis methods and tools, the research community need multi-threaded benchmark applications which scale on multicore and/or multiprocessor systems. In this paper, we present the first version of PBench, a parallel, real-time benchmark suite. PBench includes different types of multi-threaded applications which implement various algorithms from searching to sorting, matrix multiplication to probability distribution calculation. In addition, PBench provides single-threaded versions of all programs to allow side by side comparisons.


2011 ◽  
Vol 271-273 ◽  
pp. 1-6
Author(s):  
Fang Jun Kuang ◽  
Wei Hong Xu ◽  
Yan Hua Wang

An efficient watershed algorithm is proposed in order to solve the problem that touching rice is difficult to process during consequent image segmentation. First, the binary image is ultra-eroded by using a different structuring element to form different distance image. Second, watershed image is obtained by using the watershed algorithm. Finally, the real watershed can be extracted. Compared with other watershed algorithms, the experiment results demonstrated that this method segmented out rice successfully in the touching rice image and improved the measurement accuracy, and also overcome over-segmentation effectively.


Sign in / Sign up

Export Citation Format

Share Document