|
Scheda bibliografica proveniente da importazione di metadati da altro sistema |
Tipo: |
Testo a stampa, Risorsa analitica |
É contributo di: |
Graph-based representations in pattern recognition |
Titolo: |
A New Contour Filling Algorithm Based on 2D Topological Map |
Pubblicazione: |
Berlin ; Heidelberg ; New York : Springer, ©2007 |
Descrizione fisica: |
319-329 |
Titolo uniforme: |
Graph-based representations in pattern recognition |
Numeri standard: |
DOI 10.1007/978-3-540-72903-7_29 |
Sommario o abstract: |
In this paper, we present a topological algorithm which allows to fill contours images. The filling problem has been widely treated and it recently appeared that it can always be split into two different process : a generic topological process and a dedicated geometrical post-processing which depends on the application. Our algorithm, based on a 2D topological map description of the image, addresses the first step of processing. It is fast, generic and robust. Moreover, the complete topological description allows to easily integrate geometrical constrains and makes our approach an interesting basis for every filling process |
Altre responsabilitą: |
Guillaume Damiand Denis Arrivault |
Classificazione Dewey: |
006 ed.22 Metodi speciali di elaborazione |
Lingua della pubblicazione: |
Inglese |
Paese di pubblicazione: |
Germania ; Stati Uniti d'America |
Codice identificativo: |
IT/ItRC/00017369 |
data di importazione: |
01-01-2014 |
|
Full text |