Learning Tomography: DFR with Fourier - Part II

Second (and final) part of the implementation of the Direct Fourier Reconstruction with Fourier  − instead of Hartley − Transform...

Learning Tomography: Interpolation in Fourier Rec.

After zero-padding [Link], there is another kind of improvement of our Direct Fourier Reconstruction implementation: The interpolation scheme.
Indeed, during the polar/cartesian conversion, we need to interpolate the sinogram values to exactly fit the cartesian 2D Fourier space. The choice of an interpolation scheme can greatly improve the resulting 2D reconstruction.

Learning Tomography: DFR with Fourier Transform

In this series dedicated to Direct Fourier Reconstruction (DFR), here is a new version based on Discrete Fourier Transform rather than the Hartley Transform...

Programming in JavaScript

Table of Contents of a series dedicated to the use of JavaScript for developing scripts in ImageJ.

Hit-or-miss: Do It Yourself

After an introduction of the Hit-or-miss operator [Link], it is time to see how we can implement this kind of tool in ImageJ with JavaScript....

Hit-or-Miss in ImageJ

 Continuing the exploration of the Hit-or-Miss operator [Link], this second post shows how to use ImageJ for the detection of nodes and leaves in a graph using an approach similar to a Hit-or-Miss.

Hit-or-miss

In Mathematical morphology, the Hit-or-Miss operator is useful to describe the topology of a graph-like object. Even though this is not implemented − by default − in ImageJ, we can obtain a similar result...