Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Uniquely-determined thinning of the tie-zone watershed based on label frequency|
|Abstract:||There are many watershed transform algorithms in literature but most of them do not exactly correspond to their respective definition. The solution given by such algorithms depends on their implementation. Others fit with their definition which allows multiple solutions. The solution chosen by such algorithms depends on their implementation too. It is the case of the watershed by image foresting transform that consists in building a forest of trees with minimum path-costs. The recently introduced tie-zone watershed (TZW) has the advantage of not depending on arbitrary implementation choices: it provides a unique and, thereby, unbiased solution. Indeed, the TZW considers all possible solutions of the watershed transform and keeps only the common parts of them as catchment basins whereas parts that differ form a tie zone disputed by many solutions. Although the TZW insures the uniqueness of the solution, it does not prevent from possible large tie zones, sometimes unwanted in segmentation applications. This paper presents a special thinning of the tie zone that leads to a unique solution. Observing all the possible solutions of the watershed by image foresting transform, one can deduce the frequency of the labels associated with each pixel. The thinning consists in assigning the most frequent label while preserving the segmented region connectivity. We demonstrate that the label frequency can be computed both from an immersion-like recursive formula and the proposed fragmented drop paradigm. Finally, we propose an algorithm under the IFT framework that computes the TZW, the label frequency and the thinning simultaneously and without explicit calculation of all the watershed solutions.|
|Citation:||Journal Of Mathematical Imaging And Vision. Springer, v. 27, n. 2, n. 157, n. 173, 2007.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.