A fast skeleton algorithm on block represented binary images

Spiliotis, Iraklis M.; Mertzios, B.G.

doi:10.1109/icdsp.1997.628440

Cited by 3 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on this representation, the real-time moment computation on binary images using the coordinates of the upper left and lower right corner of each block is proposed in [22]. Other algorithms implemented on block represented binary images are: fast shift, scale and rotation of binary images [23], connected component labeling [23], logic operations [23], a fast parallel skeletonization algorithm [24], a fast thinning algorithm [25] and a fast algorithm for the computation of the Hough transform [26].…”

Section: Introductionmentioning

confidence: 99%

Parameterized real-time moment computation on gray images using block techniques

Spiliotis

Boutalis

2009

J Real-Time Image Proc

View full text Add to dashboard Cite

Moments constitute a well-known tool in the field of image analysis and pattern recognition, but they suffer from the drawback of high computational cost. Efforts for the reduction of the required computational complexity have been reported, mainly focused on binary images, but recently some approaches for gray images have been also presented. In this study, we propose a simple but effective approach for the computation of gray image moments. The gray image is decomposed in a set of binary images. Some of these binary images are substituted by an ideal image, which is called ''half-intensity'' image. The remaining binary images are represented using the image block representation concept and their moments are computed fast using block techniques. The proposed method computes approximated moment values with an error of 2-3% from the exact values and operates in real time (i.e., video rate). The procedure is parameterized by the number m of ''half-intensity'' images used, which controls the approximation error and the speed gain of the method. The computational complexity is O(kL 2 ), where k is the number of blocks and L is the moment order.

show abstract

Section: Introductionmentioning

confidence: 99%

Parameterized real-time moment computation on gray images using block techniques

Spiliotis

Boutalis

2009

J Real-Time Image Proc

View full text Add to dashboard Cite

show abstract

“…It is true that in certain cases, such as the image segmentation in certain environments (Cheng et al, 2001) or the detection and treatment of shadows (Prati et al, 2003), using color images eases the resolution of the problem and can not be used representations in gray-scale or purely binary. However, there are problems that can be solved using only binary images (Szolgay & Tomordi, 1996) (Spiliotis & Mertzios, 1997) (Rekeczky, 1999) (Tseng et al, 2002). Moreover, many algorithms, including those processing color images have modules that use binary images (Garcia & Apostolidis, 2000) (Hsu et al, 2002) (Vilariño & Rekeczky, 2005) (Park et al 2007).…”

Section: Why a Binary Image Computer?mentioning

confidence: 99%