date: 2021-06-14T09:22:32Z
pdf:unmappedUnicodeCharsPerPage: 0
pdf:PDFVersion: 1.3
pdf:docinfo:title: A Convex Relaxation for Multi-Graph Matching
dc:description: IEEE Conference on Computer Vision and Pattern Recognition
access_permission:modify_annotations: true
access_permission:can_print_degraded: true
subject: IEEE Conference on Computer Vision and Pattern Recognition
dc:creator: Paul Swoboda
description: IEEE Conference on Computer Vision and Pattern Recognition
Last-Modified: 2021-06-14T09:22:32Z
dcterms:modified: 2021-06-14T09:22:32Z
dc:format: application/pdf; version=1.3
title: A Convex Relaxation for Multi-Graph Matching
xmpMM:DocumentID: uuid:cba90edd-8040-4e11-9dfa-53b52bca9088
Last-Save-Date: 2021-06-14T09:22:32Z
access_permission:fill_in_form: true
pdf:docinfo:modified: 2021-06-14T09:22:32Z
meta:save-date: 2021-06-14T09:22:32Z
pdf:encrypted: false
dc:title: A Convex Relaxation for Multi-Graph Matching
modified: 2021-06-14T09:22:32Z
cp:subject: IEEE Conference on Computer Vision and Pattern Recognition
pdf:docinfo:subject: IEEE Conference on Computer Vision and Pattern Recognition
Content-Type: application/pdf
pdf:docinfo:creator: Paul Swoboda,  Dagmar Kainm"uller,  Ashkan Mokarian,  Christian Theobalt,  Florian Bernard
X-Parsed-By: org.apache.tika.parser.DefaultParser
creator: Paul Swoboda
meta:author: Paul Swoboda
access_permission:extract_for_accessibility: true
access_permission:assemble_document: true
xmpTPg:NPages: 10
pdf:charsPerPage: 2933
access_permission:extract_content: true
access_permission:can_print: true
Author: Paul Swoboda
producer: PyPDF2
access_permission:can_modify: true
pdf:docinfo:producer: PyPDF2