{"id":"https://openalex.org/W1998230092","doi":"https://doi.org/10.1109/dicta.2013.6691496","title":"Efficient Digital FFT Convolution with Boundary Kernel Renormalisation","display_name":"Efficient Digital FFT Convolution with Boundary Kernel Renormalisation","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W1998230092","doi":"https://doi.org/10.1109/dicta.2013.6691496","mag":"1998230092"},"language":"en","primary_location":{"id":"doi:10.1109/dicta.2013.6691496","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dicta.2013.6691496","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/conference_contribution/Efficient_digital_FFT_convolution_with_boundary_kernel_renormalisation/23091908","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090918085","display_name":"Chris Jackett","orcid":"https://orcid.org/0000-0003-1132-1558"},"institutions":[{"id":"https://openalex.org/I129801699","display_name":"University of Tasmania","ror":"https://ror.org/01nfmeh72","country_code":"AU","type":"education","lineage":["https://openalex.org/I129801699"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Christopher J. Jackett","raw_affiliation_strings":["School of Computing and Information Systems, University of Tasmania, Hobart, Australia","Sch. of Comput. & Inf. Syst., Univ. of Tasmania, Hobart, TAS, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computing and Information Systems, University of Tasmania, Hobart, Australia","institution_ids":["https://openalex.org/I129801699"]},{"raw_affiliation_string":"Sch. of Comput. & Inf. Syst., Univ. of Tasmania, Hobart, TAS, Australia","institution_ids":["https://openalex.org/I129801699"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025648321","display_name":"Robert Ollington","orcid":"https://orcid.org/0000-0001-7533-2307"},"institutions":[{"id":"https://openalex.org/I129801699","display_name":"University of Tasmania","ror":"https://ror.org/01nfmeh72","country_code":"AU","type":"education","lineage":["https://openalex.org/I129801699"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Robert Ollington","raw_affiliation_strings":["School of Computing and Information Systems, University of Tasmania, Hobart, Australia","Sch. of Comput. & Inf. Syst., Univ. of Tasmania, Hobart, TAS, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computing and Information Systems, University of Tasmania, Hobart, Australia","institution_ids":["https://openalex.org/I129801699"]},{"raw_affiliation_string":"Sch. of Comput. & Inf. Syst., Univ. of Tasmania, Hobart, TAS, Australia","institution_ids":["https://openalex.org/I129801699"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006805737","display_name":"Jenny Lovell","orcid":"https://orcid.org/0000-0003-0182-2797"},"institutions":[{"id":"https://openalex.org/I1281210470","display_name":"CSIRO Oceans and Atmosphere","ror":"https://ror.org/026nh4520","country_code":"AU","type":"facility","lineage":["https://openalex.org/I1281210470","https://openalex.org/I1292875679","https://openalex.org/I2801453606","https://openalex.org/I4387156119"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Jenny L. Lovell","raw_affiliation_strings":["CSIRO Marine and Atmospheric Research, Hobart, Australia","Marine & Atmos. Res., CSIRO, Hobart, TAS, Australia"],"affiliations":[{"raw_affiliation_string":"CSIRO Marine and Atmospheric Research, Hobart, Australia","institution_ids":["https://openalex.org/I1281210470"]},{"raw_affiliation_string":"Marine & Atmos. Res., CSIRO, Hobart, TAS, Australia","institution_ids":["https://openalex.org/I1281210470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5090918085"],"corresponding_institution_ids":["https://openalex.org/I129801699"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07465344,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"114","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10688","display_name":"Image and Signal Denoising Methods","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10688","display_name":"Image and Signal Denoising Methods","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11206","display_name":"Model Reduction and Neural Networks","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10271","display_name":"Seismic Imaging and Inversion Techniques","score":0.9860000014305115,"subfield":{"id":"https://openalex.org/subfields/1908","display_name":"Geophysics"},"field":{"id":"https://openalex.org/fields/19","display_name":"Earth and Planetary Sciences"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/convolution","display_name":"Convolution (computer science)","score":0.7708086371421814},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.755862295627594},{"id":"https://openalex.org/keywords/overlap\u2013add-method","display_name":"Overlap\u2013add method","score":0.7116747498512268},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.7055572271347046},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6271565556526184},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5958641767501831},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.5855321884155273},{"id":"https://openalex.org/keywords/raders-fft-algorithm","display_name":"Rader's FFT algorithm","score":0.5472192764282227},{"id":"https://openalex.org/keywords/convolution-theorem","display_name":"Convolution theorem","score":0.5256109237670898},{"id":"https://openalex.org/keywords/circular-convolution","display_name":"Circular convolution","score":0.4981517791748047},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.4618133306503296},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.38718608021736145},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3053070306777954},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2252170443534851},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.1597481667995453},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.14495325088500977},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.09137788414955139},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.08216232061386108}],"concepts":[{"id":"https://openalex.org/C45347329","wikidata":"https://www.wikidata.org/wiki/Q5166604","display_name":"Convolution (computer science)","level":3,"score":0.7708086371421814},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.755862295627594},{"id":"https://openalex.org/C181002996","wikidata":"https://www.wikidata.org/wiki/Q1611641","display_name":"Overlap\u2013add method","level":5,"score":0.7116747498512268},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.7055572271347046},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6271565556526184},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5958641767501831},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5855321884155273},{"id":"https://openalex.org/C69598009","wikidata":"https://www.wikidata.org/wiki/Q7280126","display_name":"Rader's FFT algorithm","level":5,"score":0.5472192764282227},{"id":"https://openalex.org/C79587385","wikidata":"https://www.wikidata.org/wiki/Q2638931","display_name":"Convolution theorem","level":5,"score":0.5256109237670898},{"id":"https://openalex.org/C194980680","wikidata":"https://www.wikidata.org/wiki/Q245450","display_name":"Circular convolution","level":5,"score":0.4981517791748047},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.4618133306503296},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.38718608021736145},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3053070306777954},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2252170443534851},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.1597481667995453},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.14495325088500977},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.09137788414955139},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.08216232061386108},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/dicta.2013.6691496","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dicta.2013.6691496","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","raw_type":"proceedings-article"},{"id":"pmh:oai:ecite.utas.edu.au:88575","is_oa":false,"landing_page_url":"http://ecite.utas.edu.au/88575","pdf_url":null,"source":{"id":"https://openalex.org/S4306401569","display_name":"eCite Digital Repository (University of Tasmania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I129801699","host_organization_name":"University of Tasmania","host_organization_lineage":["https://openalex.org/I129801699"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Refereed Conference Paper"},{"id":"pmh:oai:figshare.com:article/23091908","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Efficient_digital_FFT_convolution_with_boundary_kernel_renormalisation/23091908","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/23091908","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Efficient_digital_FFT_convolution_with_boundary_kernel_renormalisation/23091908","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W785950572","https://openalex.org/W2011687187","https://openalex.org/W2017565215","https://openalex.org/W2061171222","https://openalex.org/W2168353136","https://openalex.org/W3149448910","https://openalex.org/W4213209490"],"related_works":["https://openalex.org/W4363675452","https://openalex.org/W2267589039","https://openalex.org/W4372260258","https://openalex.org/W2759540840","https://openalex.org/W4253408561","https://openalex.org/W2982446276","https://openalex.org/W4134551","https://openalex.org/W2049065832","https://openalex.org/W1570542763","https://openalex.org/W2162994284"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"a":[3,27],"correction":[4,24,82],"method":[5,25,83],"for":[6,96],"Fast":[7],"Fourier":[8],"Transform":[9],"(FFT)":[10],"convolution":[11,19,46,65],"that":[12,58],"limits":[13],"boundary":[14,30],"contamination":[15],"artefacts":[16],"resulting":[17],"from":[18],"padding":[20],"methods.":[21],"The":[22,81],"proposed":[23],"makes":[26],"single":[28],"data-driven":[29],"condition":[31],"assumption":[32],"and":[33,48,92,103],"only":[34,69],"uses":[35],"information":[36],"contained":[37],"within":[38],"the":[39,55,63,68,75],"original":[40],"input":[41],"signal":[42],"to":[43,62,90],"produce":[44],"consistent":[45],"results":[47],"maintain":[49],"data":[50,98,104],"integrity.":[51],"An":[52],"analysis":[53],"of":[54,77],"algorithm":[56,101],"shows":[57],"it":[59],"performs":[60],"identically":[61],"standard":[64],"approach":[66],"with":[67],"discernible":[70],"differences":[71],"being":[72],"resolved":[73],"at":[74,87],"level":[76],"machine":[78],"rounding":[79],"errors.":[80],"can":[84],"be":[85],"applied":[86],"minimal":[88],"cost":[89],"performance":[91],"has":[93],"valuable":[94],"applications":[95],"scientific":[97],"processing":[99],"where":[100],"efficiency":[102],"accuracy":[105],"are":[106],"imperative.":[107]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}