An important concept in combinatorial image analysis is that of gap. In this paper we derive a simple formula for the number of gaps in a 2D binary picture. Our approach is based on introducing the notions of free vertex and free edge and studying their properties from point of view of combinatorial topology. The number of gaps characterizes the topological structure of a binary picture and is of potential interest in property-based image analysis.
Counting Gaps in Binary Pictures
MAIMONE, ANGELOInvestigation
;NORDO, GiorgioInvestigation
2006-01-01
Abstract
An important concept in combinatorial image analysis is that of gap. In this paper we derive a simple formula for the number of gaps in a 2D binary picture. Our approach is based on introducing the notions of free vertex and free edge and studying their properties from point of view of combinatorial topology. The number of gaps characterizes the topological structure of a binary picture and is of potential interest in property-based image analysis.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Counting Gaps in Binary Pictures.pdf
solo gestori archivio
Tipologia:
Versione Editoriale (PDF)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
386.57 kB
Formato
Adobe PDF
|
386.57 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
