{"citation":{"ista":"Kainmueller D, Jug F, Rother C, Meyers G. 2017. Graph matching problems for annotating C. Elegans, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:57\">10.15479/AT:ISTA:57</a>.","ama":"Kainmueller D, Jug F, Rother C, Meyers G. Graph matching problems for annotating C. Elegans. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:57\">10.15479/AT:ISTA:57</a>","chicago":"Kainmueller, Dagmar, Florian Jug, Carsten Rother, and Gene Meyers. “Graph Matching Problems for Annotating C. Elegans.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:57\">https://doi.org/10.15479/AT:ISTA:57</a>.","ieee":"D. Kainmueller, F. Jug, C. Rother, and G. Meyers, “Graph matching problems for annotating C. Elegans.” Institute of Science and Technology Austria, 2017.","apa":"Kainmueller, D., Jug, F., Rother, C., &#38; Meyers, G. (2017). Graph matching problems for annotating C. Elegans. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:57\">https://doi.org/10.15479/AT:ISTA:57</a>","mla":"Kainmueller, Dagmar, et al. <i>Graph Matching Problems for Annotating C. Elegans</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:57\">10.15479/AT:ISTA:57</a>.","short":"D. Kainmueller, F. Jug, C. Rother, G. Meyers, (2017)."},"_id":"5561","oa":1,"type":"research_data","acknowledgement":"We thank Vladimir Kolmogorov and Stephan Saalfeld forinspiring discussions.","date_updated":"2024-02-21T13:46:31Z","title":"Graph matching problems for annotating C. Elegans","month":"02","department":[{"_id":"VlKo"}],"day":"13","oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","datarep_id":"57","year":"2017","tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"},"doi":"10.15479/AT:ISTA:57","license":"https://creativecommons.org/publicdomain/zero/1.0/","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","keyword":["graph matching","feature matching","QAP","MAP-inference"],"has_accepted_license":"1","file_date_updated":"2020-07-14T12:47:03Z","file":[{"creator":"system","checksum":"3dc3e1306a66028a34181ebef2923139","date_created":"2018-12-12T13:02:54Z","relation":"main_file","file_size":327042819,"content_type":"application/zip","file_name":"IST-2017-57-v1+1_wormMatchingProblems.zip","access_level":"open_access","date_updated":"2020-07-14T12:47:03Z","file_id":"5614"}],"article_processing_charge":"No","date_published":"2017-02-13T00:00:00Z","ddc":["000"],"author":[{"full_name":"Kainmueller, Dagmar","last_name":"Kainmueller","first_name":"Dagmar"},{"full_name":"Jug, Florian","last_name":"Jug","first_name":"Florian"},{"full_name":"Rother, Carsten","last_name":"Rother","first_name":"Carsten"},{"full_name":"Meyers, Gene","first_name":"Gene","last_name":"Meyers"}],"date_created":"2018-12-12T12:31:32Z","abstract":[{"text":"Graph matching problems as described in \"Active Graph Matching for Automatic Joint Segmentation and Annotation of C. Elegans.\" by Kainmueller, Dagmar and Jug, Florian and Rother, Carsten and Myers, Gene, MICCAI 2014. Problems are in OpenGM2 hdf5 format (see http://hciweb2.iwr.uni-heidelberg.de/opengm/) and a custom text format used by the feature matching solver described in \"Feature Correspondence via Graph Matching: Models and Global Optimization.\" by Lorenzo Torresani, Vladimir Kolmogorov and Carsten Rother, ECCV 2008, code at http://pub.ist.ac.at/~vnk/software/GraphMatching-v1.02.src.zip. ","lang":"eng"}],"status":"public"}