{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T07:36:55Z","timestamp":1648712215130},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2014,8]]},"abstract":"<jats:p> This paper presents a method for adapting the cost function in the Monge\u2013Kantorovich Problem (MKP) to a classification task. More specifically, we introduce a criterion that allows to learn a cost function which tends to produce large distance values for elements belonging to different classes and small distance values for elements belonging to the same class. Under some additional constraints (one of them being the well-known Monge condition), we show that the optimization of this criterion writes as a linear programming problem. Experimental results on synthetic data show that the output optimal cost function provides good retrieval performances in the presence of two types of perturbations commonly found in histograms. When compared to a set of various commonly used cost functions, our optimal cost function performs as good as the best cost function of the set, which shows that it can adapt well to the task. Promising results are also obtained on real data for two-class image retrieval based on grayscale intensity histograms. <\/jats:p>","DOI":"10.1142\/s0218001414510069","type":"journal-article","created":{"date-parts":[[2014,5,6]],"date-time":"2014-05-06T05:40:21Z","timestamp":1399354821000},"page":"1451006","source":"Crossref","is-referenced-by-count":0,"title":["OPTIMIZATION OF THE COST FUNCTION IN THE MONGE-KANTOROVICH PROBLEM (MKP) UNDER THE MONGE CONDITION"],"prefix":"10.1142","volume":"28","author":[{"given":"LAURENT","family":"OUDRE","sequence":"first","affiliation":[{"name":"Institut T\u00e9l\u00e9com, TELECOM ParisTech, CNRS\/LTCI, 37-39 rue Dareau - 75014 Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2014,7,31]]},"reference":[{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2008.04.008"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.12.001"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1058"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-011-0284-0"},{"key":"rf10","volume-title":"Mass Transportation Problems","volume":"1","author":"Rachev S.","year":"1998"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026543900054"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1978.1163055"},{"key":"rf14","volume-title":"Optimal Transport: Old and New","author":"Villani C.","year":"2008"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1109\/34.955109"}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001414510069","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T04:53:40Z","timestamp":1565153620000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001414510069"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,31]]},"references-count":9,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2014,7,31]]},"published-print":{"date-parts":[[2014,8]]}},"alternative-id":["10.1142\/S0218001414510069"],"URL":"https:\/\/doi.org\/10.1142\/s0218001414510069","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"value":"0218-0014","type":"print"},{"value":"1793-6381","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,31]]}}}