{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T07:14:22Z","timestamp":1772090062390,"version":"3.50.1"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2010,7,26]],"date-time":"2010-07-26T00:00:00Z","timestamp":1280102400000},"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":[[2010,7,26]]},"abstract":"<jats:p>Local image histograms contain a great deal of information useful for applications in computer graphics, computer vision and computational photography. Making use of that information has been challenging because of the expense of computing histogram properties over large neighborhoods. Efficient algorithms exist for some specific computations like the bilateral filter, but not others. Here, we present an efficient and practical method for computing accurate derivatives and integrals of locally-weighted histograms over large neighborhoods. The method allows us to compute the location, height, width and integral of all local histogram modes at interactive rates. Among other things, it enables the first constant-time isotropic median filter, robust isotropic image morphology operators, an efficient \"dominant mode\" filter and a non-iterative alternative to the mean shift. In addition, we present a method to combat the over-sharpening that is typical of histogram-based edge-preserving smoothing. This post-processing step should make histogram-based filters not only fast and efficient, but also suitable for a variety of new applications.<\/jats:p>","DOI":"10.1145\/1778765.1778837","type":"journal-article","created":{"date-parts":[[2010,7,15]],"date-time":"2010-07-15T12:48:46Z","timestamp":1279198126000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":118,"title":["Smoothed local histogram filters"],"prefix":"10.1145","volume":"29","author":[{"given":"Michael","family":"Kass","sequence":"first","affiliation":[{"name":"Pixar Animation Studios"}]},{"given":"Justin","family":"Solomon","sequence":"additional","affiliation":[{"name":"Pixar Animation Studios and Stanford University"}]}],"member":"320","published-online":{"date-parts":[[2010,7,26]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1531326.1531327"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1986.4767749"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2003.08.005"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276507"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1983.1095851"},{"key":"e_1_2_2_6_1","first-page":"532","article-title":"Fast filter transforms for image processing","volume":"16","author":"Burt P.","year":"1983","unstructured":"Burt , P. 1983 . Fast filter transforms for image processing . Computer Graphics and Image Processing 16 , 532 -- 540 . Burt, P. 1983. Fast filter transforms for image processing. Computer Graphics and Image Processing 16, 532--540.","journal-title":"Computer Graphics and Image Processing"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276506"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.1000236"},{"key":"e_1_2_2_10_1","volume-title":"Proc. SCIA '2003","author":"Dominguez G.","unstructured":"Dominguez , G. , Bischof , H. , and Beichel , R . 2003. Fast 3d mean shift filter for CT images. In Image Analysis , Proc. SCIA '2003 , Springer, 59--97. Dominguez, G., Bischof, H., and Beichel, R. 2003. Fast 3d mean shift filter for CT images. In Image Analysis, Proc. SCIA '2003, Springer, 59--97."},{"key":"e_1_2_2_11_1","unstructured":"Duda R. and Hart P. 1973. Pattern Classification and Scene Analysis. Wiley.  Duda R. and Hart P. 1973. Pattern Classification and Scene Analysis. Wiley."},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/566570.566574"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360666"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276441"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.29"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055330"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1987.4767941"},{"key":"e_1_2_2_18_1","volume-title":"Two-Dimensional Signal Processing II: Transforms and Median Filters","author":"Huang T.","unstructured":"Huang , T. 1975. Two-Dimensional Signal Processing II: Transforms and Median Filters . Springer Verlag , Berlin . Huang, T. 1975. Two-Dimensional Signal Processing II: Transforms and Median Filters. Springer Verlag, Berlin."},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008065931878"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11744085_44"},{"key":"e_1_2_2_21_1","volume-title":"Proc. IEEE conference on Computer Vision and Pattern Recognition (CVPR'07)","author":"Paris S.","unstructured":"Paris , S. , and Durand , F . 2007. A topological approach to hierarchical segmentation using mean shift . In Proc. IEEE conference on Computer Vision and Pattern Recognition (CVPR'07) . Paris, S., and Durand, F. 2007. A topological approach to hierarchical segmentation using mean shift. In Proc. IEEE conference on Computer Vision and Pattern Recognition (CVPR'07)."},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281500.1281602"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177704472"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2007.902329"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.188"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587843"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1661412.1618493"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/311535.311544"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(92)90069-C"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1179352.1141918"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1778765.1778837","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1778765.1778837","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:47Z","timestamp":1750246787000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1778765.1778837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,26]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,7,26]]}},"alternative-id":["10.1145\/1778765.1778837"],"URL":"https:\/\/doi.org\/10.1145\/1778765.1778837","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,26]]},"assertion":[{"value":"2010-07-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}