{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:13:25Z","timestamp":1759133605918},"reference-count":23,"publisher":"World Scientific Pub Co Pte Lt","issue":"08","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2008,12]]},"abstract":"<jats:p> We present an efficient algorithm for computing a sub-optimal Earth Movers' Distance (EMD) between multidimensional histograms called EMD- g <jats:sub>f<\/jats:sub>, which is not limited to any type of measurement. Some algorithms that find a cross-bin distance between histograms have been proposed in the literature. Nevertheless, most of this research has been applied on 1D-histograms or on nD-histograms but with limited types of measurements. The EMD is a cross-bin distance between nD-histograms with any ground distance. Experimental validation shows that it obtains good retrieval results although the main drawback of this method is its cubic computational cost, O(z<jats:sup>3<\/jats:sup>), z being the total number of bins. The worst-case complexity of EMD- g <jats:sub>f<\/jats:sub> is O(z<jats:sup>2<\/jats:sup>), although the obtained average computational cost in the experiments is near O(m<jats:sup>2<\/jats:sup>), where m represents the number of bins per dimension, which is clearly lower than the computational cost of the EMD algorithm. Moreover, the experiments using real data show similar retrieval results. <\/jats:p>","DOI":"10.1142\/s0218001408006880","type":"journal-article","created":{"date-parts":[[2009,1,14]],"date-time":"2009-01-14T05:00:13Z","timestamp":1231909213000},"page":"1539-1558","source":"Crossref","is-referenced-by-count":7,"title":["A FAST APPROXIMATION OF THE EARTH-MOVERS DISTANCE BETWEEN MULTIDIMENSIONAL HISTOGRAMS"],"prefix":"10.1142","volume":"22","author":[{"given":"FRANCESC","family":"SERRATOSA","sequence":"first","affiliation":[{"name":"Universitat Rovira i Virgili, Departament d'Enginyeria Inform\u00e0tica i Matem\u00e0tiques, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GERARD","family":"SANROM\u00c0","sequence":"additional","affiliation":[{"name":"Universitat Rovira i Virgili, Departament d'Enginyeria Inform\u00e0tica i Matem\u00e0tiques, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","volume-title":"Network Flows","author":"Ahuja R.","year":"1993"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(01)00118-2"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1109\/72.788646"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1109\/34.400571"},{"key":"rf5","first-page":"133","volume":"2","author":"Gong Y.","journal-title":"Multimed. Tools Appl."},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1109\/34.391417"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2003.10.005"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(03)00039-4"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1058"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(01)00107-6"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1107\/S0907444999010987"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1109\/34.192468"},{"key":"rf15","volume-title":"Numerical Recipes in C: The Art of Scientific Computing","author":"Press W. H."},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1006\/cviu.2001.0934"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026543900054"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.1.187"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003253"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001402001915"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.12.005"},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1016\/0734-189X(83)90112-3"},{"key":"rf25","doi-asserted-by":"publisher","DOI":"10.1007\/BF00130487"},{"key":"rf26","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001407005880"},{"key":"rf27","doi-asserted-by":"publisher","DOI":"10.1016\/0734-189X(85)90055-6"}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001408006880","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:20:00Z","timestamp":1565130000000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001408006880"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":23,"journal-issue":{"issue":"08","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2008,12]]}},"alternative-id":["10.1142\/S0218001408006880"],"URL":"https:\/\/doi.org\/10.1142\/s0218001408006880","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"value":"0218-0014","type":"print"},{"value":"1793-6381","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12]]}}}