作者: Tasneem G. Brutch , Bor-Yiing Su
DOI:
关键词: Pixel 、 Merge (version control) 、 Theoretical computer science 、 Algorithm 、 Finite set 、 Label propagation 、 Computer science 、 Grid 、 Gray level
摘要: An image represented by multiple nodes can be processed determining whether labels propagated to a node from another of the image. Conceptually, an presented as “structured grid” (e.g., structured grid pixels image). In grid,” two or more same level in gray level) determine parallel propagate label one its neighboring that are labeled and accordingly. iteratively repeating this process for successive levels. It will appreciated disclosed techniques allow parallelism without requiring partitioning having merge partitioned images. The especially suited watershed algorithms.