i.fft(1grass)

๐Ÿ’– i.fft ๐Ÿ’–

okay bestie, so this is i.fft from the GRASS User's Manual โ€” and no, the "i" is not giving iPhone, it's giving imagery. Sit down, hydrate, we're doing Fourier transforms today. โœจ


๐ŸŒธ NAME ๐ŸŒธ

i.fft โ€” Fast Fourier Transform (FFT) for image processing. that's it, that's the whole name. iconic behavior honestly. ๐Ÿ‘‘


๐Ÿท๏ธ KEYWORDS ๐Ÿท๏ธ

imagery, transformation, Fast Fourier Transform

iykyk ๐Ÿ’…


โœจ SYNOPSIS โœจ

i.fft
i.fft --help
i.fft input=name real=name imaginary=name  [--overwrite]  [--help]
[--verbose]  [--quiet]  [--ui]

๐ŸŽ€ Flags: ๐ŸŽ€

  • --overwrite โ€” lets your output files just steamroll right over any existing files. no asking, no warning, it's giving bold.
  • --help โ€” prints the usage summary so you can read it and go "ohhh okay". ๐Ÿซถ
  • --verbose โ€” verbose module output. she talks a lot and we love her for it.
  • --quiet โ€” quiet module output. shhh. the opposite vibe.
  • --ui โ€” forces the GUI dialog to launch. for the girlies who like a little window moment. ๐ŸชŸ

๐ŸŒˆ Parameters: ๐ŸŒˆ

  • input=name โ€” [required] the name of your input raster map. mandatory bestie, you can't skip this one.
  • real=name โ€” [required] the name for output real part arrays, stored as a raster map.
  • imaginary=name โ€” [required] the name for output imaginary part arrays, stored as a raster map. yes it's really called imaginary, no that's not a typo, that's math. ๐Ÿ˜ญ

๐Ÿ’ซ DESCRIPTION ๐Ÿ’ซ

so i.fft is an image processing program, and it's built on the FFT algorithm given by Frigo et al. (1998) โ€” shoutout to them, legends fr fr. ๐Ÿ™Œ

What it does: it takes one single input raster map layer (input) and constructs the real and imaginary Fourier components in frequency space. one input, two beautiful components, main character energy all around. โœจ


๐Ÿ“ NOTES ๐Ÿ“

The real and imaginary components get stored into the real and imaginary raster map layers respectively. no cap.

And here's the layout you need to remember: in those raster map layers, the low frequency components are in the center and the high frequency components are toward the edges. center girlies = low freq, edge girlies = high freq. ๐Ÿ’…

The input need not be square โ€” she's flexible, she contains multitudes. Also, a color table is assigned to the resultant map layer, so it will look cute when you view it. ๐ŸŽ€

The current geographic region and mask settings are respected when reading the input file. periodt.

๐Ÿšจ okay important warning bestie: the presence of nulls or a mask will make the resulting fast Fourier transform invalid. like fully invalid. not "a little off", not "we'll fix it in post" โ€” INVALID. so clear your nulls and masks before you run this, or your output is gonna be a mess. ๐Ÿ’€

๐Ÿฆ‹ EXAMPLE ๐Ÿฆ‹

North Carolina example, our beloved:

g.region raster=lsat7_2002_70
i.fft input=lsat7_2002_70 real=lsat7_2002_70.real imaginary=lsat7_2002_70.imag
# set region to resulting FFT output map (due to new FFT coordinate space):
g.region raster=lsat7_2002_70.real -p
d.mon x0
d.rast lsat7_2002_70.real
d.rast lsat7_2002_70.imag

look at that flow. chef's kiss. ๐Ÿ‘จโ€๐Ÿณ๐Ÿ’‹


๐Ÿ“š REFERENCES ๐Ÿ“š

  • M. Frigo and S. G. Johnson (1998): "FFTW: An Adaptive Software Architecture for the FFT". See www.FFTW.org: FFTW is a C subroutine library for computing the Discrete Fourier Transform (DFT) in one or more dimensions, of both real and complex data, and of arbitrary input size. she does it ALL. ๐Ÿ”ฅ
  • John A. Richards, 1986. Remote Sensing Digital Image Analysis, Springer-Verlag.
  • Personal communication, between program author and Ali R. Vali, Space Research Center, University of Texas, Austin, 1990. vintage correspondence moment, we stan. ๐Ÿ“ฎ

๐Ÿ‘€ SEE ALSO ๐Ÿ‘€

i.cca, g.gui.iclass, i.ifft, i.pca

(if you liked this one, girl, you're gonna want the inverse โ€” that's i.ifft, go get her ๐ŸŒธ)


๐Ÿ‘‘ AUTHORS ๐Ÿ‘‘

David Satnik, GIS Laboratory, Central Washington University Glynn Clements (FFTW support)

two absolute icons. thank you for your service. ๐Ÿซก๐Ÿ’–


๐Ÿ’ป SOURCE CODE ๐Ÿ’ป

Available at: i.fft source code (history)

Latest change: Friday Jan 02 21:25:59 2026 in commit: 83362df5af36c1e7d95fad93dff0a57b4dfde476

Main index | Imagery index | Topics index | Keywords index | Graphical index | Full index

ยฉ 2003-2026 GRASS Development Team, GRASS 8.5.0 Reference Manual


okay and that's the whole page bestie!! ๐ŸŽ€ this was i.fft(1grass), served to you straight from the GRASS 8.5.0 Reference Manual โ€” ยฉ 2003-2026 GRASS Development Team, last touched Friday Jan 02 21:25:59 2026 in commit 83362df5af36c1e7d95fad93dff0a57b4dfde476. go do a Fourier transform, you're gonna slay. โœจ๐Ÿฆ‹๐Ÿ’œ

๐Ÿ“ฆ where this page comes from