|
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: |
The Construction of Bounded Irregular Pyramids with a Union-Find Decimation Process |
Pubblicazione: |
Berlin ; Heidelberg ; New York : Springer, ©2007 |
Descrizione fisica: |
307-318 |
Titolo uniforme: |
Graph-based representations in pattern recognition |
Numeri standard: |
DOI 10.1007/978-3-540-72903-7_28 |
Sommario o abstract: |
The Bounded Irregular Pyramid (BIP) is a mixture of regular and irregular pyramids whose goal is to combine their advantages. Thus, its data structure combines a regular decimation process with a union-find strategy to build the successive levels of the structure. The irregular part of the BIP allows to solve the main problems of regular structures: their inability to preserve connectivity or to represent elongated objects. On the other hand, the BIP is computationally efficient because its height is constrained by its regular part. In this paper the features of the Bounded Irregular Pyramid are discussed, presenting a comparison with the main pyramids present in the literature when applied to a colour segmentation task |
Altre responsabilità: |
R. Marfil L. Molina-Tanco A. Bandera F. Sandoval |
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/00017368 |
data di importazione: |
01-01-2014 |
|
Full text  |