Joint Graph Layouts for Visualizing Collections of Segmented Meshes

Handle URI:
http://hdl.handle.net/10754/625459
Title:
Joint Graph Layouts for Visualizing Collections of Segmented Meshes
Authors:
Ren, Jing; Schneider, Jens; Ovsjanikov, Maks; Wonka, Peter ( 0000-0003-0627-9746 )
Abstract:
We present a novel and efficient approach for computing joint graph layouts and then use it to visualize collections of segmented meshes. Our joint graph layout algorithm takes as input the adjacency matrices for a set of graphs along with partial, possibly soft, correspondences between nodes of different graphs. We then use a two stage procedure, where in the first step, we extend spectral graph drawing to include a consistency term so that a collection of graphs can be handled jointly. Our second step extends metric multi-dimensional scaling with stress majorization to the joint layout setting, while using the output of the spectral approach as initialization. Further, we discuss a user interface for exploring a collection of graphs. Finally, we show multiple example visualizations of graphs stemming from collections of segmented meshes and we present qualitative and quantitative comparisons with previous work.
KAUST Department:
Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Citation:
Ren J, Schneider J, Ovsjanikov M, Wonka P (2017) Joint Graph Layouts for Visualizing Collections of Segmented Meshes. IEEE Transactions on Visualization and Computer Graphics: 1–1. Available: http://dx.doi.org/10.1109/TVCG.2017.2751473.
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
IEEE Transactions on Visualization and Computer Graphics
Issue Date:
12-Sep-2017
DOI:
10.1109/TVCG.2017.2751473
Type:
Article
ISSN:
1077-2626
Sponsors:
M. Ovsjanikov’s work is funded through the following grants: Marie-Curie CIG-334283, a CNRS chaire d’excellence, chaire Jean Marjoulet from ´ Ecole Polytechnique, FUI project TANDEM 2, and a Google Focused Research Award. J. Ren, J. Schneider and P. Wonka are funded through the Visual Computing Center (VCC) at King Abdullah University of Science and Technology (KAUST).
Additional Links:
http://ieeexplore.ieee.org/document/8031987/
Appears in Collections:
Articles; Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorRen, Jingen
dc.contributor.authorSchneider, Jensen
dc.contributor.authorOvsjanikov, Maksen
dc.contributor.authorWonka, Peteren
dc.date.accessioned2017-09-14T06:03:52Z-
dc.date.available2017-09-14T06:03:52Z-
dc.date.issued2017-09-12en
dc.identifier.citationRen J, Schneider J, Ovsjanikov M, Wonka P (2017) Joint Graph Layouts for Visualizing Collections of Segmented Meshes. IEEE Transactions on Visualization and Computer Graphics: 1–1. Available: http://dx.doi.org/10.1109/TVCG.2017.2751473.en
dc.identifier.issn1077-2626en
dc.identifier.doi10.1109/TVCG.2017.2751473en
dc.identifier.urihttp://hdl.handle.net/10754/625459-
dc.description.abstractWe present a novel and efficient approach for computing joint graph layouts and then use it to visualize collections of segmented meshes. Our joint graph layout algorithm takes as input the adjacency matrices for a set of graphs along with partial, possibly soft, correspondences between nodes of different graphs. We then use a two stage procedure, where in the first step, we extend spectral graph drawing to include a consistency term so that a collection of graphs can be handled jointly. Our second step extends metric multi-dimensional scaling with stress majorization to the joint layout setting, while using the output of the spectral approach as initialization. Further, we discuss a user interface for exploring a collection of graphs. Finally, we show multiple example visualizations of graphs stemming from collections of segmented meshes and we present qualitative and quantitative comparisons with previous work.en
dc.description.sponsorshipM. Ovsjanikov’s work is funded through the following grants: Marie-Curie CIG-334283, a CNRS chaire d’excellence, chaire Jean Marjoulet from ´ Ecole Polytechnique, FUI project TANDEM 2, and a Google Focused Research Award. J. Ren, J. Schneider and P. Wonka are funded through the Visual Computing Center (VCC) at King Abdullah University of Science and Technology (KAUST).en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.relation.urlhttp://ieeexplore.ieee.org/document/8031987/en
dc.rights(c) 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.en
dc.subjectMulti-graph layouten
dc.subjectspectral graph layouten
dc.subjectmulti-dimensional scalingen
dc.subjecttopological explorationen
dc.titleJoint Graph Layouts for Visualizing Collections of Segmented Meshesen
dc.typeArticleen
dc.contributor.departmentVisual Computing Center (VCC)en
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalIEEE Transactions on Visualization and Computer Graphicsen
dc.eprint.versionPost-printen
dc.contributor.institutionLaboratoire d'Informatique (LIX), ecole Polytechnique, Palaiseau, lle-de-France Franceen
kaust.authorRen, Jingen
kaust.authorSchneider, Jensen
kaust.authorWonka, Peteren
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.