Elementary algorithms for multiresolution geometric tomography with strip model of projections

Author

Gerard, Yan

Author_Institution

ISIT, Univ. d´Auvergne, Clermont-Ferrand, France

fYear

2013

fDate

4-6 Sept. 2013

Firstpage

600

Lastpage

605

Abstract

We consider a problem of geometric tomography whith a strip-based model of projections: the projections are the areas of the intersection between the shape and some strips. We investigate some elementary algorithms that allow to construct a shape with prescribed projections. We start with an exact algorithm based on Linear Programming which leads to practical difficulties. Then we investigate three practical heuristics based on a cell decomposition of the domain of interest: GA is a greedy algorithm, GAME its multiresolution derivative and MPH a multiresolution heuristic close to a parallel Simulated Annealing.

Keywords

geometry; greedy algorithms; image resolution; linear programming; simulated annealing; GAME; cell decomposition; elementary algorithms; greedy algorithm; linear programming; multiresolution geometric tomography; multiresolution heuristic; parallel simulated annealing; strip-based model of projections; Greedy algorithms; Image color analysis; Image resolution; Partitioning algorithms; Shape; Strips; Tomography;

fLanguage

English

Publisher

ieee

Conference_Titel

Image and Signal Processing and Analysis (ISPA), 2013 8th International Symposium on

Conference_Location

Trieste

Type

conf

DOI

10.1109/ISPA.2013.6703810

Filename

6703810