[{"abstract":[{"text":"Graph matching problems for large displacement optical flow of RGB-D images.","lang":"eng"}],"oa":1,"doi":"10.15479/AT:ISTA:82","day":"04","date_published":"2018-01-04T00:00:00Z","type":"research_data","tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"date_updated":"2024-02-21T13:41:17Z","citation":{"mla":"Alhaija, Hassan, et al. <i>Graph Matching Problems for GraphFlow – 6D Large Displacement Scene Flow</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:82\">10.15479/AT:ISTA:82</a>.","short":"H. Alhaija, A. Sellent, D. Kondermann, C. Rother, (2018).","ista":"Alhaija H, Sellent A, Kondermann D, Rother C. 2018. Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:82\">10.15479/AT:ISTA:82</a>.","apa":"Alhaija, H., Sellent, A., Kondermann, D., &#38; Rother, C. (2018). Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:82\">https://doi.org/10.15479/AT:ISTA:82</a>","ama":"Alhaija H, Sellent A, Kondermann D, Rother C. Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:82\">10.15479/AT:ISTA:82</a>","chicago":"Alhaija, Hassan, Anita Sellent, Daniel Kondermann, and Carsten Rother. “Graph Matching Problems for GraphFlow – 6D Large Displacement Scene Flow.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:82\">https://doi.org/10.15479/AT:ISTA:82</a>.","ieee":"H. Alhaija, A. Sellent, D. Kondermann, and C. Rother, “Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow.” Institute of Science and Technology Austria, 2018."},"year":"2018","ddc":["001"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","related_material":{"link":[{"url":"https://doi.org/10.1007/978-3-319-24947-6_23","relation":"research_paper"}]},"file":[{"access_level":"open_access","relation":"main_file","creator":"system","file_id":"5600","checksum":"53c17082848e12f3c2e1b4185b578208","file_size":1737958,"date_created":"2018-12-12T13:02:34Z","content_type":"application/zip","file_name":"IST-2018-82-v1+1_GraphFlowMatchingProblems.zip","date_updated":"2020-07-14T12:47:05Z"}],"month":"01","title":"Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow","oa_version":"Published Version","date_created":"2018-12-12T12:31:36Z","department":[{"_id":"VlKo"}],"article_processing_charge":"No","author":[{"full_name":"Alhaija, Hassan","first_name":"Hassan","last_name":"Alhaija"},{"full_name":"Sellent, Anita","last_name":"Sellent","first_name":"Anita"},{"full_name":"Kondermann, Daniel","last_name":"Kondermann","first_name":"Daniel"},{"first_name":"Carsten","last_name":"Rother","full_name":"Rother, Carsten"}],"datarep_id":"82","_id":"5573","license":"https://creativecommons.org/publicdomain/zero/1.0/","has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","file_date_updated":"2020-07-14T12:47:05Z","contributor":[{"id":"446560C6-F248-11E8-B48F-1D18A9856A87","first_name":"Paul","contributor_type":"researcher","last_name":"Swoboda"}],"keyword":["graph matching","quadratic assignment problem<"]},{"keyword":["graph matching","feature matching","QAP","MAP-inference"],"file_date_updated":"2020-07-14T12:47:03Z","publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","_id":"5561","datarep_id":"57","author":[{"first_name":"Dagmar","last_name":"Kainmueller","full_name":"Kainmueller, Dagmar"},{"full_name":"Jug, Florian","first_name":"Florian","last_name":"Jug"},{"first_name":"Carsten","last_name":"Rother","full_name":"Rother, Carsten"},{"first_name":"Gene","last_name":"Meyers","full_name":"Meyers, Gene"}],"date_created":"2018-12-12T12:31:32Z","department":[{"_id":"VlKo"}],"article_processing_charge":"No","oa_version":"Published Version","month":"02","title":"Graph matching problems for annotating C. Elegans","file":[{"date_created":"2018-12-12T13:02:54Z","checksum":"3dc3e1306a66028a34181ebef2923139","file_size":327042819,"date_updated":"2020-07-14T12:47:03Z","content_type":"application/zip","file_name":"IST-2017-57-v1+1_wormMatchingProblems.zip","relation":"main_file","access_level":"open_access","file_id":"5614","creator":"system"}],"acknowledgement":"We thank Vladimir Kolmogorov and Stephan Saalfeld forinspiring discussions.","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","citation":{"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>","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>","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>.","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>."},"year":"2017","tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"date_updated":"2024-02-21T13:46:31Z","type":"research_data","date_published":"2017-02-13T00:00:00Z","day":"13","doi":"10.15479/AT:ISTA:57","oa":1,"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"}]}]