#include <DTransportFMM.hpp>
Inheritance diagram for DTransportFMM:
Purpose: Define a Fast Marching Method applied for direct distance maps
and distance based data feeding.
Novelty: Bernard De Cuyper inpainting simplification(14/07/2002, Belgium)
1) Transport is important in inpainting.
2) Diffusion has reduced strength in long range cases.
Multiresolution speed up through diffusion range reduction.
3) Oliveira Fast inpainting shows that isotropic diffusive inpainting can
be fast. But fails on large inpaintings.
We overcome and speedup with multiresolution.
We found out that other speedup is possible:
A ONE SHOT FORWARD inpainting must be possible, using the Fast Marching
we can get transport the best alive pixels into the selected pixel.
To get an analog form of Oliveira but faster, we can average the alive
pixels.
Speed is 7 to 20 times FASTER than Oliveira Fast Inpainting.
Paper: "Optimal Algorithm for Shape from Shading and Path Planning.",
Ron Kimmel, James A. Sethian, Kluweer Academic Publishers 2001 , Netherlands.
@ Copyrights: Bernard De Cuyper & Eddy Fraiha 2002, Eggs & Pictures. MIT/Open BSD copyright model.
Public Methods | |
| DTransportFMM (bool average, bool aconnected4) | |
| virtual | ~DTransportFMM () |
| virtual AnImage * | selectedFilter (AnImage *mask, AnImage *src, AnImage *dest=0) |
| transporte pixels with sorted distances from the borders | |
Protected Methods | |
| virtual Psi2DValue * | select () |
| selection | |
| virtual void | getAliveNeighbour (int x, int y) |
| find pixel values from alive neigbour | |
Private Attributes | |
| bool | connected4 |
| bool | averageValues |
| int | xSelectedAlive |
| int | ySelectedAlive |
| int | redAliveEstimate |
| int | greenAliveEstimate |
| int | blueAliveEstimate |
| AnImage * | image |
 |
