uirfftn(inarray, dim=None, shape=None)
This transform considers the Hermitian property of the transform from complex to real input.
The uirfft
function assumes that the output array is real-valued. Consequently, the input is assumed to have a Hermitian property and redundant values are implicit.
The array to transform.
The last axis along which to compute the transform. All axes by default.
The shape of the output. The shape of rfft
is ambiguous in case of odd-valued input shape. In this case, this parameter should be provided. See np.fft.irfftn
.
The unitary N-D inverse real Fourier transform of inarray
.
N-dimensional inverse real unitary Fourier transform.
>>> input = np.ones((5, 5, 5))This example is valid syntax, but we were not able to check execution
... output = uirfftn(urfftn(input), shape=input.shape)
... np.allclose(input, output) True
>>> output.shape (5, 5, 5)See :
The following pages refer to to this document either explicitly or contain code examples using this.
skimage.restoration.uft.uirfftn
skimage.restoration.uft.uifft2
skimage.restoration.uft.uirfft2
skimage.restoration.uft.ir2tf
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them