{"id":"https://openalex.org/W4412588082","doi":"https://doi.org/10.1145/3721238.3730709","title":"A Fast Parallel Median Filtering Algorithm Using Hierarchical Tiling","display_name":"A Fast Parallel Median Filtering Algorithm Using Hierarchical Tiling","publication_year":2025,"publication_date":"2025-07-23","ids":{"openalex":"https://openalex.org/W4412588082","doi":"https://doi.org/10.1145/3721238.3730709"},"language":"en","primary_location":{"id":"doi:10.1145/3721238.3730709","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3721238.3730709","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3721238.3730709","source":null,"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3721238.3730709","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056008538","display_name":"Louis Sugy","orcid":"https://orcid.org/0009-0005-2134-3453"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Louis Sugy","raw_affiliation_strings":["NVIDIA, Munich, Germany"],"raw_orcid":"https://orcid.org/0009-0005-2134-3453","affiliations":[{"raw_affiliation_string":"NVIDIA, Munich, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056008538"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19874059,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.998199999332428,"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/T11447","display_name":"Blind Source Separation Techniques","score":0.998199999332428,"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9918000102043152,"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/T10531","display_name":"Advanced Vision and Imaging","score":0.9853000044822693,"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/computer-science","display_name":"Computer science","score":0.7278804779052734},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49155721068382263},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.42419230937957764},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.39676254987716675}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7278804779052734},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49155721068382263},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.42419230937957764},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39676254987716675}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3721238.3730709","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3721238.3730709","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3721238.3730709","source":null,"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2507.19926","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.19926","pdf_url":"https://arxiv.org/pdf/2507.19926","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/3721238.3730709","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3721238.3730709","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3721238.3730709","source":null,"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4412588082.pdf","grobid_xml":"https://content.openalex.org/works/W4412588082.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W100509257","https://openalex.org/W1970603291","https://openalex.org/W1972292376","https://openalex.org/W1982981924","https://openalex.org/W2017461851","https://openalex.org/W2021586009","https://openalex.org/W2033959528","https://openalex.org/W2038647778","https://openalex.org/W2067681708","https://openalex.org/W2085248745","https://openalex.org/W2115083413","https://openalex.org/W2123139266","https://openalex.org/W2134696992","https://openalex.org/W2141389982","https://openalex.org/W2149415591","https://openalex.org/W2164882143","https://openalex.org/W2547543723","https://openalex.org/W2774462854","https://openalex.org/W2794556316","https://openalex.org/W2893120149","https://openalex.org/W2965862660","https://openalex.org/W3184405392","https://openalex.org/W4311805915"],"related_works":["https://openalex.org/W2393888177","https://openalex.org/W2544423928","https://openalex.org/W2117183908","https://openalex.org/W2115794623","https://openalex.org/W4406345323","https://openalex.org/W2067173559","https://openalex.org/W2148738811","https://openalex.org/W1613730747","https://openalex.org/W2541389358","https://openalex.org/W4318948887"],"abstract_inverted_index":{"Fig.":[0],"1.A":[1],"17":[2,3],"median":[4,87,207],"filter":[5,208],"is":[6,50,68,186,204],"applied":[7],"to":[8,22,61,72,106,141,188,224],"smooth":[9],"a":[10,23,51,128,148,159,178,200],"30-megapixel":[11],"photograph.The":[12],"8-bit":[13],"red,":[14],"green,":[15],"and":[16,26,158,173,203,215,219],"blue":[17],"channels":[18],"are":[19],"filtered":[20],"separately.Thanks":[21],"computationally":[24],"efficient":[25],"GPU-friendly":[27],"algorithm,":[28,130],"our":[29],"method":[30],"takes":[31],"only":[32],"2.2":[33],"ms":[34],"on":[35,199],"an":[36],"L40S":[37],"GPU":[38,202],"-3":[39],"times":[40,190],"faster":[41,191],"than":[42,192],"the":[43,47,82,122,132,135,193,197,205],"current":[44,194],"state":[45,195],"of":[46,86,134,168,196],"art.Median":[48],"filtering":[49,88],"non-linear":[52],"smoothing":[53],"technique":[54],"widely":[55],"used":[56],"in":[57,104,209],"digital":[58],"image":[59],"processing":[60],"remove":[62],"noise":[63],"while":[64],"retaining":[65],"sharp":[66],"edges.It":[67],"particularly":[69],"well":[70],"suited":[71],"removing":[73],"outliers":[74],"(impulse":[75],"noise)":[76],"or":[77,121],"granular":[78],"artifacts":[79],"(speckle":[80],"noise).However,":[81],"high":[83],"computational":[84],"cost":[85],"can":[89,153],"be":[90],"prohibitive.Sorting-based":[91],"algorithms":[92],"excel":[93],"with":[94,100],"small":[95],"kernels":[96,220],"but":[97,114],"scale":[98],"poorly":[99],"increasing":[101],"kernel":[102,179],"diameter,":[103],"contrast":[105],"constant-time":[107],"methods":[108],"characterized":[109],"by":[110],"higher":[111],"constant":[112],"factors":[113],"better":[115],"scalability,":[116],"such":[117],"as":[118],"histogram-based":[119],"approaches":[120],"2D":[123],"wavelet":[124],"matrix.This":[125],"paper":[126],"introduces":[127],"novel":[129],"leveraging":[131],"separability":[133],"sorting":[136],"problem":[137],"through":[138],"hierarchical":[139],"tiling":[140],"minimize":[142],"redundant":[143],"computations.We":[144],"propose":[145],"two":[146],"variants:":[147],"data-oblivious":[149],"selection":[150],"network":[151],"that":[152],"operate":[154],"entirely":[155],"within":[156],"registers,":[157],"data-aware":[160],"version":[161],"utilizing":[162],"randomaccess":[163],"memory.These":[164],"achieve":[165],"per-pixel":[166],"complexities":[167],"(":[169,174],"log(":[170],")":[171,172],"),":[175],"respectively,":[176],"for":[177,181,212],"-unprecedented":[180],"sorting-based":[182],"methods.Our":[183],"CUDA":[184],"implementation":[185],"up":[187],"5":[189],"art":[198],"modern":[201],"fastest":[206],"most":[210],"cases":[211],"8-,":[213],"16-,":[214],"32-bit":[216],"data":[217],"types":[218],"from":[221],"3":[222,223],"75":[225],"75.":[226],"CCS":[227],"Concepts:":[228]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}