{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T15:20:34Z","timestamp":1771514434587,"version":"3.50.1"},"reference-count":16,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2006,7,1]],"date-time":"2006-07-01T00:00:00Z","timestamp":1151712000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2006,7]]},"abstract":"<jats:p>\n            Median filtering is a cornerstone of modern image processing and is used extensively in smoothing and de-noising applications. The fastest commercial implementations (e.g. in Adobe\u00ae Photoshop\u00ae CS2) exhibit\n            <jats:italic>O(r)<\/jats:italic>\n            runtime in the radius of the filter, which limits their usefulness in realtime or resolution-independent contexts. We introduce a CPU-based, vectorizable\n            <jats:italic>O<\/jats:italic>\n            (log\n            <jats:italic>r<\/jats:italic>\n            ) algorithm for median filtering, to our knowledge the most efficient yet developed. Our algorithm extends to images of any bit-depth, and can also be adapted to perform bilateral filtering. On 8-bit data our median filter outperforms Photoshop's implementation by up to a factor of fifty.\n          <\/jats:p>","DOI":"10.1145\/1141911.1141918","type":"journal-article","created":{"date-parts":[[2006,7,25]],"date-time":"2006-07-25T14:14:26Z","timestamp":1153836866000},"page":"519-526","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":236,"title":["Fast median and bilateral filtering"],"prefix":"10.1145","volume":"25","author":[{"given":"Ben","family":"Weiss","sequence":"first","affiliation":[{"name":"Shell &amp; Slate Software Corp."}]}],"member":"320","published-online":{"date-parts":[[2006,7]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0165-1684(94)90121-X"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/566570.566574"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/15886.15921"},{"key":"e_1_2_2_5_1","first-page":"209","volume-title":"Berlin: Springer-Verlag","author":"Huang T. S.","year":"1981"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.211471"},{"key":"e_1_2_2_7_1","unstructured":"Kabir I. 1996. High Performance Computer Imaging. Greenwich CT. Manning Publications. pp. 181--192.   Kabir I. 1996. High Performance Computer Imaging. Greenwich CT. Manning Publications. pp. 181--192."},{"key":"e_1_2_2_8_1","volume-title":"ECCV","author":"Paris S.","year":"2006"},{"key":"e_1_2_2_9_1","volume-title":"IEEE Int. Conf. on Multimedia & Expo. CD1-4.","author":"Pha T. Q."},{"key":"e_1_2_2_10_1","volume-title":"Proceeding 1989 International Conference on Parallel Processing, III-56--III-62","author":"Ranka S."},{"key":"e_1_2_2_11_1","unstructured":"Terdiman P. 2000. Radix Sort Revisited. &lt;http:\/\/www.codercorner.com\/RadixSortRevisited.htm&gt;  Terdiman P. 2000. Radix Sort Revisited. &lt;http:\/\/www.codercorner.com\/RadixSortRevisited.htm&gt;"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(95)00055-0"},{"key":"e_1_2_2_13_1","volume-title":"Proc. IEEE Int. Conf. on Computer Vision, 836--846","author":"Tomasi C."},{"key":"e_1_2_2_14_1","unstructured":"Tukey J. W. 1977. Exploratory Data Analysis. Reading MA. Addison-Wesley.  Tukey J. W. 1977. Exploratory Data Analysis. Reading MA. Addison-Wesley."},{"key":"e_1_2_2_15_1","first-page":"010","article-title":"Method and Apparatus for Processing Image Data","volume":"7","author":"Weiss B.","year":"2006","journal-title":"US Patent"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2003.1239867"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1141911.1141918","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1141911.1141918","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:14:23Z","timestamp":1750259663000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1141911.1141918"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["10.1145\/1141911.1141918"],"URL":"https:\/\/doi.org\/10.1145\/1141911.1141918","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7]]},"assertion":[{"value":"2006-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}