Array Processing and Fast Optimization Algorithms for Distorted Circular Contour Retrieval

A specific formalism for virtual signal generation permits to transpose an image processing problem to an array processing problem. The existing method for straight-line characterization relies on the estimation of orientations and offsets of expected lines. This estimation is performed thanks to a...

Full description

Bibliographic Details
Main Authors: Salah Bourennane, Julien Marot
Format: Article
Language:English
Published: SpringerOpen 2007-01-01
Series:EURASIP Journal on Advances in Signal Processing
Online Access:http://dx.doi.org/10.1155/2007/57354
id doaj-b5c42e7bb3614485938ea8b29253573c
record_format Article
spelling doaj-b5c42e7bb3614485938ea8b29253573c2020-11-24T20:54:28ZengSpringerOpenEURASIP Journal on Advances in Signal Processing1687-61721687-61802007-01-01200710.1155/2007/57354Array Processing and Fast Optimization Algorithms for Distorted Circular Contour RetrievalSalah BourennaneJulien MarotA specific formalism for virtual signal generation permits to transpose an image processing problem to an array processing problem. The existing method for straight-line characterization relies on the estimation of orientations and offsets of expected lines. This estimation is performed thanks to a subspace-based algorithm called subspace-based line detection (SLIDE). In this paper, we propose to retrieve circular and nearly circular contours in images. We estimate the radius of circles and we extend the estimation of circles to the retrieval of circular-like distorted contours. For this purpose we develop a new model for virtual signal generation; we simulate a circular antenna, so that a high-resolution method can be employed for radius estimation. An optimization method permits to extend circle fitting to the segmentation of objects which have any shape. We evaluate the performances of the proposed methods, on hand-made and real-world images, and we compare them with generalized Hough transform (GHT) and gradient vector flow (GVF). http://dx.doi.org/10.1155/2007/57354
collection DOAJ
language English
format Article
sources DOAJ
author Salah Bourennane
Julien Marot
spellingShingle Salah Bourennane
Julien Marot
Array Processing and Fast Optimization Algorithms for Distorted Circular Contour Retrieval
EURASIP Journal on Advances in Signal Processing
author_facet Salah Bourennane
Julien Marot
author_sort Salah Bourennane
title Array Processing and Fast Optimization Algorithms for Distorted Circular Contour Retrieval
title_short Array Processing and Fast Optimization Algorithms for Distorted Circular Contour Retrieval
title_full Array Processing and Fast Optimization Algorithms for Distorted Circular Contour Retrieval
title_fullStr Array Processing and Fast Optimization Algorithms for Distorted Circular Contour Retrieval
title_full_unstemmed Array Processing and Fast Optimization Algorithms for Distorted Circular Contour Retrieval
title_sort array processing and fast optimization algorithms for distorted circular contour retrieval
publisher SpringerOpen
series EURASIP Journal on Advances in Signal Processing
issn 1687-6172
1687-6180
publishDate 2007-01-01
description A specific formalism for virtual signal generation permits to transpose an image processing problem to an array processing problem. The existing method for straight-line characterization relies on the estimation of orientations and offsets of expected lines. This estimation is performed thanks to a subspace-based algorithm called subspace-based line detection (SLIDE). In this paper, we propose to retrieve circular and nearly circular contours in images. We estimate the radius of circles and we extend the estimation of circles to the retrieval of circular-like distorted contours. For this purpose we develop a new model for virtual signal generation; we simulate a circular antenna, so that a high-resolution method can be employed for radius estimation. An optimization method permits to extend circle fitting to the segmentation of objects which have any shape. We evaluate the performances of the proposed methods, on hand-made and real-world images, and we compare them with generalized Hough transform (GHT) and gradient vector flow (GVF).
url http://dx.doi.org/10.1155/2007/57354
work_keys_str_mv AT salahbourennane arrayprocessingandfastoptimizationalgorithmsfordistortedcircularcontourretrieval
AT julienmarot arrayprocessingandfastoptimizationalgorithmsfordistortedcircularcontourretrieval
_version_ 1716794437150965760