2012 **Abstract:** In this paper we propose an adaptation of the Eikonal equation on weighted graphs, using the framework of Partial difference Equations, and with the motivation of extending this equation's applications to any discrete data that can be represented by graphs. This adaptation leads to a finite difference equation defined on weighted graphs and a new efficient algorithm for multiple labels simultaneous propagation on graphs, based on such equation. We will show that such approach enables the resolution of many app…

Help me understand this report

Search citation statements

Paper Sections

Select...

1

1

1

1

Citation Types

0

78

0

Year Published

2014

2016

Publication Types

Select...

2

Relationship

2

0

Authors

Journals

(78 citation statements)

(74 reference statements)

0

78

0

“…In comparison to traditional gradient-based approaches [3] where F(p) = ‖∇I ‖, the proposed formulation favors the grouping of similar pixels, even for pixels that are far from the initial seeds (Fig. 2).…”

confidence: 99%

“…In comparison to traditional gradient-based approaches [3] where F(p) = ‖∇I ‖, the proposed formulation favors the grouping of similar pixels, even for pixels that are far from the initial seeds (Fig. 2).…”

confidence: 99%

“…Perform a full pass of ERGC with the seeds placed on a grid, 2. add a new seed to the location of the maximum geodesic distance found at the previous step, 3. let R i be the superpixel in which there is the new seed (red superpixel of Fig.…”

confidence: 99%

“…Based on the previous definition of discrete dilation and erosion on graphs [9,37], the front propagation can be expressed as a morphological process with the following sum of dilation and erosion:…”

confidence: 99%

“…Then, the algorithm consists of sorting increasingly the values a i and computing temporary solution x m until the condition x m ≤ a m+1 is satisfied. To compute the solution of Eikonal equation at each vertex, we used Fast Marching's updating scheme [37].…”

confidence: 99%