{"title":"Graph matching problems for annotating C. Elegans","keyword":["graph matching","feature matching","QAP","MAP-inference"],"file":[{"date_created":"2018-12-12T13:02:54Z","checksum":"3dc3e1306a66028a34181ebef2923139","access_level":"open_access","file_name":"IST-2017-57-v1+1_wormMatchingProblems.zip","file_id":"5614","creator":"system","date_updated":"2020-07-14T12:47:03Z","content_type":"application/zip","relation":"main_file","file_size":327042819}],"tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"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>.","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>","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.","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>","short":"D. Kainmueller, F. Jug, C. Rother, G. Meyers, (2017).","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>."},"date_published":"2017-02-13T00:00:00Z","month":"02","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","year":"2017","day":"13","publisher":"Institute of Science and Technology Austria","datarep_id":"57","department":[{"_id":"VlKo"}],"date_created":"2018-12-12T12:31:32Z","license":"https://creativecommons.org/publicdomain/zero/1.0/","status":"public","author":[{"full_name":"Kainmueller, Dagmar","last_name":"Kainmueller","first_name":"Dagmar"},{"first_name":"Florian","last_name":"Jug","full_name":"Jug, Florian"},{"full_name":"Rother, Carsten","last_name":"Rother","first_name":"Carsten"},{"first_name":"Gene","last_name":"Meyers","full_name":"Meyers, Gene"}],"oa_version":"Published Version","date_updated":"2024-02-21T13:46:31Z","file_date_updated":"2020-07-14T12:47:03Z","abstract":[{"lang":"eng","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. "}],"_id":"5561","oa":1,"doi":"10.15479/AT:ISTA:57","has_accepted_license":"1","type":"research_data","ddc":["000"],"acknowledgement":"We thank Vladimir Kolmogorov and Stephan Saalfeld forinspiring discussions."}