[Insight-developers] Problems with DanielssonDistanceMapImageFilter

[Joshua Cates]

Hi Luis,

If the results really are undefined at the boundaries then I agree that
option 1 is the better way.  If you are using neighborhood iterators,
however, you may be able to easily plug in a boundary condition to supply
out-of-bound pixels which make no contribution.

Josh.


______________________________
 Josh Cates
 School of Computer Science
 University of Utah
 Email: cates@sci.utah.edu
 Phone: (801) 587-7697
 URL:   www.cs.utk.edu/~cates


On Wed, 7 Aug 2002, Luis Ibanez wrote:

>
> Hi Josh,
>
> Yes, this is a current defect in our implementation of the
> DanielssonDistance filter.
>
> There is a border of 1 pixel all around the image in which the
> algorithm cannot be applied due to neighborhood constratints.
>
>
> At least two options seems to be reasonable here:
>
> 1) in the OutputInformation define that the output image will
>     be smaller than the input image by a 1-pixel wide border
>     and crop the image to remove the 0 value pixels.
>
> 2) Try to compute a value of distance for the pixels on the
>     border.
>
> Option (1) seems to be more consistent with the algorithm since
> it respect the neigborhood relationships in which the distances
> are computed.
>
>   Any preferences ?
>
>     Thanks
>
>       Luis
>
>
> ===============================================================
>
> Joshua Cates wrote:
> >>Hi,
> >>
> >>When using the DanielssonDistanceMapImageFilter, I find the first, last
> >>slices and voxels where x or y = 0 do not seem to be processed and are set
> >>to all 0 values.  Works great other than that.
> >>
> >>
> >
> > I'm referring to the "DistanceMap" output here.
> >
> > Josh.
> >
> > _______________________________________________
> > Insight-developers mailing list
> > Insight-developers@public.kitware.com
> > http://public.kitware.com/mailman/listinfo/insight-developers
> >
> >
>
>
>
>