You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Ideally, should be possible to denoise using either a square or spherical kernel; generic code would fill the 2D data matrix with image data from the local neighbourhood, and know how to reconstruct image data for the voxel at the centre of the kernel from the PCA components.
Kernel should be spherical even in the presence of voxel anisotropy; the voxels chosen for inclusion in the kernel should be based on ordering of Euclidean distances from the kernel centre.
Command-line option to modulate the size of the spherical kernel. What makes most sense to me is to have the number of voxels as a minimal multiple of the number of volumes, but it should also be possible to specify an absolute size.
I say "minimal" deliberately: for a given Euclidean distance from the kernel centre there may be multiple voxels with an equivalent distance from the kernel centre. Where this happens I think that all such voxels should be included in the kernel, rather than selecting a subset of them arbitrarily in order to satisfy a kernel size target.
Been on my list for a long time but seemingly never listed.
As performed in https://www.sciencedirect.com/science/article/pii/S1053811919305348.
A spherical kernel should:
The text was updated successfully, but these errors were encountered: