{"id":"https://openalex.org/W2072690750","doi":"https://doi.org/10.1109/icassp.2013.6638135","title":"A parallel implementation method of FFT-based full-search block matching algorithms","display_name":"A parallel implementation method of FFT-based full-search block matching algorithms","publication_year":2013,"publication_date":"2013-05-01","ids":{"openalex":"https://openalex.org/W2072690750","doi":"https://doi.org/10.1109/icassp.2013.6638135","mag":"2072690750"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2013.6638135","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2013.6638135","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Acoustics, Speech and Signal Processing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083616641","display_name":"Toshiyuki Dobashi","orcid":null},"institutions":[{"id":"https://openalex.org/I69740276","display_name":"Tokyo Metropolitan University","ror":"https://ror.org/00ws30h19","country_code":"JP","type":"education","lineage":["https://openalex.org/I69740276"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Toshiyuki Dobashi","raw_affiliation_strings":["Department of Information and Communication Systems, Tokyo Metropolitan University, Hino, Tokyo, Japan","Department of Information and Communication Systems, Tokyo Metropolitan University, Hino, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Information and Communication Systems, Tokyo Metropolitan University, Hino, Tokyo, Japan","institution_ids":["https://openalex.org/I69740276"]},{"raw_affiliation_string":"Department of Information and Communication Systems, Tokyo Metropolitan University, Hino, Japan","institution_ids":["https://openalex.org/I69740276"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015250468","display_name":"Hitoshi Kiya","orcid":"https://orcid.org/0000-0001-8061-3090"},"institutions":[{"id":"https://openalex.org/I69740276","display_name":"Tokyo Metropolitan University","ror":"https://ror.org/00ws30h19","country_code":"JP","type":"education","lineage":["https://openalex.org/I69740276"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hitoshi Kiya","raw_affiliation_strings":["Department of Information and Communication Systems, Tokyo Metropolitan University, Hino, Tokyo, Japan","Department of Information and Communication Systems, Tokyo Metropolitan University, Hino, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Information and Communication Systems, Tokyo Metropolitan University, Hino, Tokyo, Japan","institution_ids":["https://openalex.org/I69740276"]},{"raw_affiliation_string":"Department of Information and Communication Systems, Tokyo Metropolitan University, Hino, Japan","institution_ids":["https://openalex.org/I69740276"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083616641"],"corresponding_institution_ids":["https://openalex.org/I69740276"],"apc_list":null,"apc_paid":null,"fwci":0.88672943,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.76428166,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"46","issue":null,"first_page":"2644","last_page":"2648"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10741","display_name":"Video Coding and Compression Technologies","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10741","display_name":"Video Coding and Compression Technologies","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11105","display_name":"Advanced Image Processing Techniques","score":0.9872999787330627,"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/T10688","display_name":"Image and Signal Denoising Methods","score":0.9789000153541565,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.9271670579910278},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7182974815368652},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6545068621635437},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.6181883811950684},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.6066386699676514},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.5826287865638733},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.5426656603813171},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5231531858444214},{"id":"https://openalex.org/keywords/window","display_name":"Window (computing)","score":0.4996769428253174},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.36478662490844727},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.24399638175964355},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1761980950832367},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.1306348443031311}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.9271670579910278},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7182974815368652},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6545068621635437},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6181883811950684},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.6066386699676514},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.5826287865638733},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5426656603813171},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5231531858444214},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.4996769428253174},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.36478662490844727},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.24399638175964355},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1761980950832367},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.1306348443031311},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.2013.6638135","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2013.6638135","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Acoustics, Speech and Signal Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W136360197","https://openalex.org/W178701193","https://openalex.org/W1506809288","https://openalex.org/W1884193697","https://openalex.org/W1989121301","https://openalex.org/W1994685695","https://openalex.org/W1998319219","https://openalex.org/W2003884262","https://openalex.org/W2013943077","https://openalex.org/W2039181402","https://openalex.org/W2054484909","https://openalex.org/W2058460097","https://openalex.org/W2097073572","https://openalex.org/W2103046720","https://openalex.org/W2126451471","https://openalex.org/W2140036158","https://openalex.org/W2142738529","https://openalex.org/W2145251738","https://openalex.org/W2152716869","https://openalex.org/W2161135496","https://openalex.org/W2164490837","https://openalex.org/W6607201821","https://openalex.org/W6651416709","https://openalex.org/W6665260550","https://openalex.org/W6682697731"],"related_works":["https://openalex.org/W2031343199","https://openalex.org/W2977460836","https://openalex.org/W2200032781","https://openalex.org/W2356814585","https://openalex.org/W2144412928","https://openalex.org/W2113951268","https://openalex.org/W4362564158","https://openalex.org/W4246835537","https://openalex.org/W1984254719","https://openalex.org/W2144032791"],"abstract_inverted_index":{"One":[0],"category":[1],"of":[2,24,134],"fast":[3,13],"full-search":[4,26,30,38,49,78,158],"block":[5,136],"matching":[6],"algorithms":[7],"(BMAs)":[8],"is":[9,43,80,149],"based":[10],"on":[11,145],"the":[12,36,47,63,72,76,97,100,111,116,124,135,143,155],"Fourier":[14],"transformation":[15],"(FFT).":[16],"This":[17],"paper":[18],"proposes":[19],"a":[20],"parallel":[21,57],"implementation":[22],"method":[23,61,101,117,144],"FFT-based":[25,29,77,157],"BMAs.":[27],"The":[28,59,138],"BMAs":[31],"are":[32,53,91],"much":[33],"faster":[34,153],"than":[35,154],"direct":[37,48],"BMA,":[39],"and":[40,75],"its":[41],"accuracy":[42],"as":[44,46],"same":[45,125],"BMA.":[50,159],"However,":[51],"these":[52],"not":[54,103],"designed":[55],"for":[56],"processing.":[58],"proposed":[60],"divides":[62],"search":[64,69,85,89,98],"window":[65],"into":[66],"multiple":[67],"sub":[68,84,88],"windows":[70,90],"using":[71],"overlap-save":[73],"method,":[74],"BMA":[79],"applied":[81],"to":[82,131],"each":[83],"window.":[86],"These":[87,127],"processed":[92],"in":[93,106],"parallel.":[94],"By":[95],"dividing":[96],"window,":[99],"can":[102,118],"only":[104],"process":[105],"parallel,":[107],"but":[108],"also":[109,119,129],"select":[110],"efficient":[112],"FFT":[113],"size.":[114],"Furthermore,":[115],"calculate":[120],"two":[121],"cross-correlations":[122],"at":[123],"time.":[126],"properties":[128],"contribute":[130],"speeding":[132],"up":[133],"matching.":[137],"experimental":[139],"results":[140],"shows":[141],"that":[142],"6":[146],"cores":[147],"CPU":[148],"about":[150],"11":[151],"times":[152],"conventional":[156]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}