MétaCan
Menu
Back to cohort
Record W1989260478 · doi:10.1364/josaa.26.001767

Operational and convolution properties of two-dimensional Fourier transforms in polar coordinates

2009· article· en· W1989260478 on OpenAlexafffund
Natalie Baddour

Bibliographic record

VenueJournal of the Optical Society of America A · 2009
Typearticle
Languageen
FieldMathematics
TopicNumerical methods in inverse problems
Canadian institutionsUniversity of Ottawa
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsConvolution (computer science)Circular convolutionDiscrete-time Fourier transformPolar coordinate systemFourier transformSine and cosine transformsCartesian coordinate systemMultiplication (music)Fourier seriesOverlap–add methodConvolution theoremFourier inversion theoremLog-polar coordinatesDiscrete Fourier transform (general)PolarHankel transformMathematical analysisFourier analysisComputer scienceMathematicsFractional Fourier transformGeometryPhysicsArtificial intelligence

Abstract

fetched live from OpenAlex

For functions that are best described in terms of polar coordinates, the two-dimensional Fourier transform can be written in terms of polar coordinates as a combination of Hankel transforms and Fourier series-even if the function does not possess circular symmetry. However, to be as useful as its Cartesian counterpart, a polar version of the Fourier operational toolset is required for the standard operations of shift, multiplication, convolution, etc. This paper derives the requisite polar version of the standard Fourier operations. In particular, convolution-two dimensional, circular, and radial one dimensional-is discussed in detail. It is shown that standard multiplication/convolution rules do apply as long as the correct definition of convolution is applied.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.008
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.008
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.001
Science and technology studies0.0010.004
Scholarly communication0.0020.003
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0030.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.038
GPT teacher head0.306
Teacher spread0.268 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations83
Published2009
Admission routes2
Has abstractyes

Explore more

Same venueJournal of the Optical Society of America ASame topicNumerical methods in inverse problemsFrench-language works237,207