Proceedings IEEE International Conference on Application-Specific Systems, Architectures and Processors
DOI: 10.1109/asap.1997.606811
|View full text |Cite
|
Sign up to set email alerts
|

A massively parallel implementation of the watershed based on cellular automata

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(11 citation statements)
references
References 18 publications
0
11
0
Order By: Relevance
“…Since the gradient operation and flooding operation can be both implemented in this reconfigurable accelerator, and the accelerator supports self-control ability, the software control loading is lighter. In addition, the hardware cost is much smaller than Noguet's work [22]. Therefore, the proposed accelerator can support both gradient and flooding operations with less gate count.…”
Section: System Performancementioning
confidence: 85%
See 1 more Smart Citation
“…Since the gradient operation and flooding operation can be both implemented in this reconfigurable accelerator, and the accelerator supports self-control ability, the software control loading is lighter. In addition, the hardware cost is much smaller than Noguet's work [22]. Therefore, the proposed accelerator can support both gradient and flooding operations with less gate count.…”
Section: System Performancementioning
confidence: 85%
“…It is implied that the software control loading is high, and it is hard to achieve realtime requirement. Noguet's work [22] use a large array processor for watershed transform, where each pixel is processed with a PE. It can achieve real-time; however, the hardware cost is enormous.…”
Section: System Performancementioning
confidence: 99%
“…In [5], an approach based on cellular automata was proposed. Each pixel in a given image is mapped onto a cell in a cell array (N 9 N cells are necessary to process images of N 9 N pixels), and labels given to local minima are propagated on the array.…”
Section: Previous Workmentioning
confidence: 99%
“…4, our algorithm is described in detail, and its FPGA implementation is described in Sect. 5. Experimental results are discussed in Sect.…”
Section: Introductionmentioning
confidence: 99%
“…This intuitive concept leaves room for various formalizations, watershed definitions, algorithms and implementation but in practice, it can be divided into two classes, one based on the specification of a recursive algorithm by Vincent and Soille [9], and another one based on distance functions by Meyer [10]. Moreover, watershed methods are usually based on sequential algorithms but during the last decade serious efforts were made to find parallel implementation strategies [15] [11]. Unfortunately, despite the use of all the techniques and architectures, there is always a stage in the watershed transform which remains a global operation.…”
Section: Introductionmentioning
confidence: 99%