z-logo
open-access-imgOpen Access
Waiting for Forcot: Accelerating FORC Processing 100× Using a Fast‐Fourier‐Transform Algorithm
Author(s) -
Berndt Thomas A.,
Chang Liao
Publication year - 2019
Publication title -
geochemistry, geophysics, geosystems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.928
H-Index - 136
ISSN - 1525-2027
DOI - 10.1029/2019gc008380
Subject(s) - smoothing , algorithm , computer science , fourier transform , noise (video) , software , computation , fast fourier transform , computer graphics (images) , mathematics , computer vision , mathematical analysis , programming language , image (mathematics)
First‐order reversal‐curves (FORC) are a widely used tool to analyze magnetic mineralogy and domain states, but require extensive processing—in particular, smoothing—to be plotted as FORC diagrams. Currently, smoothing is a computationally complex task involving repeated least squares surface optimization routines, sometimes taking minutes to compute for high‐resolution FORCs (leaving users with the feeling of “waiting for Godot,” who never comes). Here we show how the same computation can be carried out much more efficiently in Fourier space and present a new FORC processing software, called Forcot. The new algorithm, combined with an improved user interface enables users to create print quality FORC diagrams within a few seconds. Processing times are shown to be reduced by factors from 2 to 100 depending on size and smoothing factor compared to existing FORC smoothing algorithms. Additionally, optimal smoothing factor can be determined directly from the noise spectrum in Fourier space and does not require repeated smoothing of diagrams as in previous programs. Finally, formatting of figures is done automatically by our software such that diagrams can be directly used for print.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here