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