data
dict |
|---|
{
"issue": {
"id": "12OmNz2C1BC",
"title": "July",
"year": "2012",
"issueNum": "07",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxcKzVj",
"doi": "10.1109/TVCG.2011.120",
"abstract": "We present a simple and efficient approach for continuous collision detection of deforming triangles based on conservative advancement. The efficiency of our approach is due to a sequence of simple collision-free conditions for deforming triangles. In our experiment, we show that our CCD algorithm achieves 2-30 times performance improvement over existing algorithms for triangle primitives.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a simple and efficient approach for continuous collision detection of deforming triangles based on conservative advancement. The efficiency of our approach is due to a sequence of simple collision-free conditions for deforming triangles. In our experiment, we show that our CCD algorithm achieves 2-30 times performance improvement over existing algorithms for triangle primitives.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a simple and efficient approach for continuous collision detection of deforming triangles based on conservative advancement. The efficiency of our approach is due to a sequence of simple collision-free conditions for deforming triangles. In our experiment, we show that our CCD algorithm achieves 2-30 times performance improvement over existing algorithms for triangle primitives.",
"title": "Simple Culling Methods for Continuous Collision Detection of Deforming Triangles",
"normalizedTitle": "Simple Culling Methods for Continuous Collision Detection of Deforming Triangles",
"fno": "ttg2012071146",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Continuous Collision Detection",
"Conservative Advancement",
"Distance Computation"
],
"authors": [
{
"givenName": "Xinyu",
"surname": "Zhang",
"fullName": "Xinyu Zhang",
"affiliation": "Ewha Womans University, Seoul",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Young J.",
"surname": "Kim",
"fullName": "Young J. Kim",
"affiliation": "Ewha Womans University, Seoul",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2012-07-01 00:00:00",
"pubType": "trans",
"pages": "1146-1155",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccet/2009/3521/2/3521b452",
"title": "The Research of Collision Detection Algorithm Based on Spatial Subdivision",
"doi": null,
"abstractUrl": "/proceedings-article/iccet/2009/3521b452/12OmNAY79bf",
"parentPublication": {
"id": "proceedings/iccet/2009/3521/1",
"title": "Computer Engineering and Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2015/8020/0/07450271",
"title": "A Simple Filtering Algorithm for Continuous Collision Detection Using Taylor Models",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2015/07450271/12OmNBTawni",
"parentPublication": {
"id": "proceedings/cad-graphics/2015/8020/0",
"title": "2015 14th International Conference on Computer-Aided Design and Computer Graphics (CAD/Graphics)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2008/3381/0/3381a575",
"title": "Research of Three Dimension Collision Technique in VRML Interactive Simulation Environment",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2008/3381a575/12OmNx7ov63",
"parentPublication": {
"id": "proceedings/cw/2008/3381/0",
"title": "2008 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a288",
"title": "Parallel Spatial Hashing for Collision Detection of Deformable Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a288/12OmNybfr5g",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2005/8929/0/01492754",
"title": "Quick-CULLIDE: fast inter- and intra-object collision culling using graphics hardware",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2005/01492754/12OmNznkJU4",
"parentPublication": {
"id": "proceedings/vr/2005/8929/0",
"title": "IEEE Virtual Reality 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/01/ttg2008010001",
"title": "Velocity-Aligned Discrete Oriented Polytopes for Dynamic Collision Detection",
"doi": null,
"abstractUrl": "/journal/tg/2008/01/ttg2008010001/13rRUIJuxvf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/02/v0143",
"title": "Fast and Reliable Collision Culling Using Graphics Hardware",
"doi": null,
"abstractUrl": "/journal/tg/2006/02/v0143/13rRUwgyOjb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/03/v0518",
"title": "Efficient Collision Detection within Deforming Spherical Sliding Contact",
"doi": null,
"abstractUrl": "/journal/tg/2007/03/v0518/13rRUwgyOje",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2006/01/mcg2006010064",
"title": "Hierarchical Spherical Distance Fields for Collision Detection",
"doi": null,
"abstractUrl": "/magazine/cg/2006/01/mcg2006010064/13rRUxBJhoR",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/04/ttg2009040544",
"title": "ICCD: Interactive Continuous Collision Detection between Deformable Models Using Connectivity-Based Culling",
"doi": null,
"abstractUrl": "/journal/tg/2009/04/ttg2009040544/13rRUyuegp3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012071135",
"articleId": "13rRUNvgz4d",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012071156",
"articleId": "13rRUwgQpDt",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzmclnG",
"title": "April-June",
"year": "2002",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "8",
"label": "April-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyuvRxf",
"doi": "10.1109/2945.998671",
"abstract": "We present a novel technique for texture mapping on arbitrary surfaces with minimal distortions by preserving the local and global structure of the texture. The recent introduction of the fast marching method on triangulated surfaces made it possible to compute a geodesic distance map from a given surface point in O( n \\lg n) operations, where n is the number of triangles that represent the surface. We use this method to design a surface flattening approach based on multidimensional scaling (MDS). MDS is a family of methods that map a set of points into a finite dimensional flat (Euclidean) domain, where the only given data is the corresponding distances between every pair of points. The MDS mapping yields minimal changes of the distances between the corresponding points. We then solve an inverse problem and map a flat texture patch onto the curved surface while preserving the structure of the texture.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a novel technique for texture mapping on arbitrary surfaces with minimal distortions by preserving the local and global structure of the texture. The recent introduction of the fast marching method on triangulated surfaces made it possible to compute a geodesic distance map from a given surface point in O( n \\lg n) operations, where n is the number of triangles that represent the surface. We use this method to design a surface flattening approach based on multidimensional scaling (MDS). MDS is a family of methods that map a set of points into a finite dimensional flat (Euclidean) domain, where the only given data is the corresponding distances between every pair of points. The MDS mapping yields minimal changes of the distances between the corresponding points. We then solve an inverse problem and map a flat texture patch onto the curved surface while preserving the structure of the texture.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a novel technique for texture mapping on arbitrary surfaces with minimal distortions by preserving the local and global structure of the texture. The recent introduction of the fast marching method on triangulated surfaces made it possible to compute a geodesic distance map from a given surface point in O( n \\lg n) operations, where n is the number of triangles that represent the surface. We use this method to design a surface flattening approach based on multidimensional scaling (MDS). MDS is a family of methods that map a set of points into a finite dimensional flat (Euclidean) domain, where the only given data is the corresponding distances between every pair of points. The MDS mapping yields minimal changes of the distances between the corresponding points. We then solve an inverse problem and map a flat texture patch onto the curved surface while preserving the structure of the texture.",
"title": "Texture Mapping Using Surface Flattening via Multidimensional Scaling",
"normalizedTitle": "Texture Mapping Using Surface Flattening via Multidimensional Scaling",
"fno": "v0198",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Texture Mapping",
"Multidimensional Scaling",
"Fast Marching Method",
"Geodesic Distance",
"Euclidean Distance"
],
"authors": [
{
"givenName": "G.",
"surname": "Zigelman",
"fullName": "G. Zigelman",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "R.",
"surname": "Kimmel",
"fullName": "R. Kimmel",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "N.",
"surname": "Kiryati",
"fullName": "N. Kiryati",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2002-04-01 00:00:00",
"pubType": "trans",
"pages": "198-207",
"year": "2002",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0183",
"articleId": "13rRUxASuG6",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwCJOG1",
"title": "June",
"year": "2012",
"issueNum": "06",
"idPrefix": "tp",
"pubType": "journal",
"volume": "34",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIIVllA",
"doi": "10.1109/TPAMI.2011.196",
"abstract": "Most recent approaches to monocular nonrigid 3D shape recovery rely on exploiting point correspondences and work best when the whole surface is well textured. The alternative is to rely on either contours or shading information, which has only been demonstrated in very restrictive settings. Here, we propose a novel approach to monocular deformable shape recovery that can operate under complex lighting and handle partially textured surfaces. At the heart of our algorithm are a learned mapping from intensity patterns to the shape of local surface patches and a principled approach to piecing together the resulting local shape estimates. We validate our approach quantitatively and qualitatively using both synthetic and real data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Most recent approaches to monocular nonrigid 3D shape recovery rely on exploiting point correspondences and work best when the whole surface is well textured. The alternative is to rely on either contours or shading information, which has only been demonstrated in very restrictive settings. Here, we propose a novel approach to monocular deformable shape recovery that can operate under complex lighting and handle partially textured surfaces. At the heart of our algorithm are a learned mapping from intensity patterns to the shape of local surface patches and a principled approach to piecing together the resulting local shape estimates. We validate our approach quantitatively and qualitatively using both synthetic and real data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Most recent approaches to monocular nonrigid 3D shape recovery rely on exploiting point correspondences and work best when the whole surface is well textured. The alternative is to rely on either contours or shading information, which has only been demonstrated in very restrictive settings. Here, we propose a novel approach to monocular deformable shape recovery that can operate under complex lighting and handle partially textured surfaces. At the heart of our algorithm are a learned mapping from intensity patterns to the shape of local surface patches and a principled approach to piecing together the resulting local shape estimates. We validate our approach quantitatively and qualitatively using both synthetic and real data.",
"title": "Monocular 3D Reconstruction of Locally Textured Surfaces",
"normalizedTitle": "Monocular 3D Reconstruction of Locally Textured Surfaces",
"fno": "06186734",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Surface Texture",
"Image Texture",
"Solid Modelling",
"Surface Reconstruction",
"Complex Lighting",
"Monocular 3 D Reconstruction",
"Locally Textured Surfaces",
"Monocular Nonrigid 3 D Shape Recovery",
"Shading Information",
"Monocular Deformable Shape Recovery",
"Local Surface Patches",
"Shape",
"Three Dimensional Displays",
"Surface Reconstruction",
"Surface Texture",
"Lighting",
"Training",
"Image Reconstruction",
"Shape From Shading",
"Deformable Surfaces",
"Shape Recovery"
],
"authors": [
{
"givenName": "M.",
"surname": "Salzmann",
"fullName": "M. Salzmann",
"affiliation": "NICTA, Canberra, ACT, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "A.",
"surname": "Shaji",
"fullName": "A. Shaji",
"affiliation": "EPFL-IC-Comput. Vision Lab., Lausanne, Switzerland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "A.",
"surname": "Varol",
"fullName": "A. Varol",
"affiliation": "EPFL-IC-Comput. Vision Lab., Lausanne, Switzerland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "P.",
"surname": "Fua",
"fullName": "P. Fua",
"affiliation": "EPFL-IC-Comput. Vision Lab., Lausanne, Switzerland",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2012-06-01 00:00:00",
"pubType": "trans",
"pages": "1118-1130",
"year": "2012",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/crv/2008/3153/0/3153a196",
"title": "Realtime Visualization of Monocular Data for 3D Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2008/3153a196/12OmNAMbZFV",
"parentPublication": {
"id": "proceedings/crv/2008/3153/0",
"title": "2008 Canadian Conference on Computer and Robot Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1997/8183/1/81831235",
"title": "Segmentation of 3D textured images using continuous wavelet transform",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1997/81831235/12OmNAqU4TX",
"parentPublication": {
"id": "proceedings/icip/1997/8183/1",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsa/2009/3701/0/3701a191",
"title": "Recovering 3D Shape of Weak Textured Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/iccsa/2009/3701a191/12OmNqBbHJB",
"parentPublication": {
"id": "proceedings/iccsa/2009/3701/0",
"title": "2009 International Conference on Computational Science and Its Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2009/4420/0/05459403",
"title": "Template-free monocular reconstruction of deformable surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2009/05459403/12OmNqJHFsI",
"parentPublication": {
"id": "proceedings/iccv/2009/4420/0",
"title": "2009 IEEE 12th International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391c273",
"title": "Dense Image Registration and Deformable Surface Reconstruction in Presence of Occlusions and Minimal Texture",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391c273/12OmNvqmUEa",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2011/0529/0/05981724",
"title": "Resolving occlusion in multiframe reconstruction of deformable surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2011/05981724/12OmNyUnEA0",
"parentPublication": {
"id": "proceedings/cvprw/2011/0529/0",
"title": "CVPR 2011 WORKSHOPS",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/05/ttp2011050931",
"title": "Linear Local Models for Monocular Reconstruction of Deformable Surfaces",
"doi": null,
"abstractUrl": "/journal/tp/2011/05/ttp2011050931/13rRUB6Sq1z",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/12/07150416",
"title": "Monocular 3D Reconstruction and Augmentation of Elastic Surfaces with Self-Occlusion Handling",
"doi": null,
"abstractUrl": "/journal/tg/2015/12/07150416/13rRUILLkDS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2016/02/07121014",
"title": "Texture Illumination Separation for Single-Shot Structured Light Reconstruction",
"doi": null,
"abstractUrl": "/journal/tp/2016/02/07121014/13rRUygBw8h",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2021/4899/0/489900b780",
"title": "Temporal Consistency Loss for High Resolution Textured and Clothed 3D Human Reconstruction from Monocular Video",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2021/489900b780/1yJYeTNJp1m",
"parentPublication": {
"id": "proceedings/cvprw/2021/4899/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06030877",
"articleId": "13rRUy0HYSK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06042880",
"articleId": "13rRUxly8Uc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCy2L3z",
"title": "Oct.",
"year": "2012",
"issueNum": "10",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILc8fa",
"doi": "10.1109/TVCG.2011.270",
"abstract": "Creating high-quality quad meshes from triangulated surfaces is a highly nontrivial task that necessitates consideration of various application specific metrics of quality. In our work, we follow the premise that automatic reconstruction techniques may not generate outputs meeting all the subjective quality expectations of the user. Instead, we put the user at the center of the process by providing a flexible, interactive approach to quadrangulation design. By combining scalar field topology and combinatorial connectivity techniques, we present a new framework, following a coarse to fine design philosophy, which allows for explicit control of the subjective quality criteria on the output quad mesh, at interactive rates. Our quadrangulation framework uses the new notion of Reeb atlas editing, to define with a small amount of interactions a coarse quadrangulation of the model, capturing the main features of the shape, with user prescribed extraordinary vertices and alignment. Fine grain tuning is easily achieved with the notion of connectivity texturing, which allows for additional extraordinary vertices specification and explicit feature alignment, to capture the high-frequency geometries. Experiments demonstrate the interactivity and flexibility of our approach, as well as its ability to generate quad meshes of arbitrary resolution with high-quality statistics, while meeting the user's own subjective requirements.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Creating high-quality quad meshes from triangulated surfaces is a highly nontrivial task that necessitates consideration of various application specific metrics of quality. In our work, we follow the premise that automatic reconstruction techniques may not generate outputs meeting all the subjective quality expectations of the user. Instead, we put the user at the center of the process by providing a flexible, interactive approach to quadrangulation design. By combining scalar field topology and combinatorial connectivity techniques, we present a new framework, following a coarse to fine design philosophy, which allows for explicit control of the subjective quality criteria on the output quad mesh, at interactive rates. Our quadrangulation framework uses the new notion of Reeb atlas editing, to define with a small amount of interactions a coarse quadrangulation of the model, capturing the main features of the shape, with user prescribed extraordinary vertices and alignment. Fine grain tuning is easily achieved with the notion of connectivity texturing, which allows for additional extraordinary vertices specification and explicit feature alignment, to capture the high-frequency geometries. Experiments demonstrate the interactivity and flexibility of our approach, as well as its ability to generate quad meshes of arbitrary resolution with high-quality statistics, while meeting the user's own subjective requirements.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Creating high-quality quad meshes from triangulated surfaces is a highly nontrivial task that necessitates consideration of various application specific metrics of quality. In our work, we follow the premise that automatic reconstruction techniques may not generate outputs meeting all the subjective quality expectations of the user. Instead, we put the user at the center of the process by providing a flexible, interactive approach to quadrangulation design. By combining scalar field topology and combinatorial connectivity techniques, we present a new framework, following a coarse to fine design philosophy, which allows for explicit control of the subjective quality criteria on the output quad mesh, at interactive rates. Our quadrangulation framework uses the new notion of Reeb atlas editing, to define with a small amount of interactions a coarse quadrangulation of the model, capturing the main features of the shape, with user prescribed extraordinary vertices and alignment. Fine grain tuning is easily achieved with the notion of connectivity texturing, which allows for additional extraordinary vertices specification and explicit feature alignment, to capture the high-frequency geometries. Experiments demonstrate the interactivity and flexibility of our approach, as well as its ability to generate quad meshes of arbitrary resolution with high-quality statistics, while meeting the user's own subjective requirements.",
"title": "Interactive Quadrangulation with Reeb Atlases and Connectivity Textures",
"normalizedTitle": "Interactive Quadrangulation with Reeb Atlases and Connectivity Textures",
"fno": "ttg2012101650",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Topology",
"Mesh Generation",
"Harmonic Analysis",
"Level Set",
"Linear Systems",
"Electronic Mail",
"Connectivity Operators",
"Quadrangulation",
"Reeb Graph"
],
"authors": [
{
"givenName": "Julien",
"surname": "Tierny",
"fullName": "Julien Tierny",
"affiliation": "CNRS at Telecom ParisTech, Paris",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Joel",
"surname": "Daniels II",
"fullName": "Joel Daniels II",
"affiliation": "NYU-Poly, New York City",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Luis Gustavo",
"surname": "Nonato",
"fullName": "Luis Gustavo Nonato",
"affiliation": "ICMC, Universidade de São Paulo, São Carlos",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Valerio",
"surname": "Pascucci",
"fullName": "Valerio Pascucci",
"affiliation": "University of Utah, Salt Lake City",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cláudio T.",
"surname": "Silva",
"fullName": "Cláudio T. Silva",
"affiliation": "NYU-Poly, New York City",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2012-10-01 00:00:00",
"pubType": "trans",
"pages": "1650-1663",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cscwd/2005/0002/1/01504152",
"title": "A new approach to constructing subdivision connectivity meshes",
"doi": null,
"abstractUrl": "/proceedings-article/cscwd/2005/01504152/12OmNAMbZEz",
"parentPublication": {
"id": "proceedings/cscwd/2005/0002/1",
"title": "International Conference on Computer Supported Cooperative Work in Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ghtc/2011/4595/0/4595a522",
"title": "Design for Sustainability: Rural Connectivity with Village Operators",
"doi": null,
"abstractUrl": "/proceedings-article/ghtc/2011/4595a522/12OmNANkobJ",
"parentPublication": {
"id": "proceedings/ghtc/2011/4595/0",
"title": "IEEE Global Humanitarian Technology Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msn/2008/3457/0/3457a001",
"title": "Connectivity in Multi-radio Multi-channel Wireless Mesh Networks",
"doi": null,
"abstractUrl": "/proceedings-article/msn/2008/3457a001/12OmNC943AU",
"parentPublication": {
"id": "proceedings/msn/2008/3457/0",
"title": "2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200isenburg",
"title": "Connectivity Shapes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200isenburg/12OmNCvLXY4",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipps/1992/2672/0/0223040",
"title": "Determining maximum k-width-connectivity on meshes",
"doi": null,
"abstractUrl": "/proceedings-article/ipps/1992/0223040/12OmNvlxJt7",
"parentPublication": {
"id": "proceedings/ipps/1992/2672/0",
"title": "Parallel Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2000/0868/0/08680235",
"title": "Efficient Coding of Non-Triangular Mesh Connectivity",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2000/08680235/12OmNwdtwaQ",
"parentPublication": {
"id": "proceedings/pg/2000/0868/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vv/2002/7641/0/76410037",
"title": "Interactive Visualization of Unstructured Grids Using Hierarchical 3D Textures",
"doi": null,
"abstractUrl": "/proceedings-article/vv/2002/76410037/12OmNx8Outc",
"parentPublication": {
"id": "proceedings/vv/2002/7641/0",
"title": "Volume Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icat/2006/2754/0/27540005",
"title": "Interpolatory Ternary Subdivision for Triangular Meshes with Arbitrary Topology",
"doi": null,
"abstractUrl": "/proceedings-article/icat/2006/27540005/12OmNxw5Byj",
"parentPublication": {
"id": "proceedings/icat/2006/2754/0",
"title": "16th International Conference on Artificial Reality and Telexistence--Workshops (ICAT'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2009/4442/0/05457481",
"title": "Spatio-temporal image-based texture atlases for dynamic 3-D models",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2009/05457481/12OmNzTH0ZC",
"parentPublication": {
"id": "proceedings/iccvw/2009/4442/0",
"title": "2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2010/8420/0/05720352",
"title": "Template-Based Remeshing for Image Decomposition",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2010/05720352/12OmNzVXNNm",
"parentPublication": {
"id": "proceedings/sibgrapi/2010/8420/0",
"title": "2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012101638",
"articleId": "13rRUwIF6dO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012101664",
"articleId": "13rRUwdIOUJ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet1O",
"name": "ttg2012101650s.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012101650s.mov",
"extension": "mov",
"size": "43.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzvhvFQ",
"title": "January",
"year": "2012",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "January",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwvBy8S",
"doi": "10.1109/TVCG.2011.37",
"abstract": "The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds or non-manifolds in any dimension. Key to the simplicity and efficiency of the algorithm is an alternate definition of the Reeb graph that considers equivalence classes of level sets instead of individual level sets. The algorithm works in two steps. The first step locates all critical points of the function in the domain. Critical points correspond to nodes in the Reeb graph. Arcs connecting the nodes are computed in the second step by a simple search procedure that works on a small subset of the domain that corresponds to a pair of critical points. The paper also describes a scheme for controlled simplification of the Reeb graph and two different graph layout schemes that help in the effective presentation of Reeb graphs for visual analysis of scalar fields. Finally, the Reeb graph is employed in four different applications—surface segmentation, spatially-aware transfer function design, visualization of interval volumes, and interactive exploration of time-varying data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds or non-manifolds in any dimension. Key to the simplicity and efficiency of the algorithm is an alternate definition of the Reeb graph that considers equivalence classes of level sets instead of individual level sets. The algorithm works in two steps. The first step locates all critical points of the function in the domain. Critical points correspond to nodes in the Reeb graph. Arcs connecting the nodes are computed in the second step by a simple search procedure that works on a small subset of the domain that corresponds to a pair of critical points. The paper also describes a scheme for controlled simplification of the Reeb graph and two different graph layout schemes that help in the effective presentation of Reeb graphs for visual analysis of scalar fields. Finally, the Reeb graph is employed in four different applications—surface segmentation, spatially-aware transfer function design, visualization of interval volumes, and interactive exploration of time-varying data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds or non-manifolds in any dimension. Key to the simplicity and efficiency of the algorithm is an alternate definition of the Reeb graph that considers equivalence classes of level sets instead of individual level sets. The algorithm works in two steps. The first step locates all critical points of the function in the domain. Critical points correspond to nodes in the Reeb graph. Arcs connecting the nodes are computed in the second step by a simple search procedure that works on a small subset of the domain that corresponds to a pair of critical points. The paper also describes a scheme for controlled simplification of the Reeb graph and two different graph layout schemes that help in the effective presentation of Reeb graphs for visual analysis of scalar fields. Finally, the Reeb graph is employed in four different applications—surface segmentation, spatially-aware transfer function design, visualization of interval volumes, and interactive exploration of time-varying data.",
"title": "Output-Sensitive Construction of Reeb Graphs",
"normalizedTitle": "Output-Sensitive Construction of Reeb Graphs",
"fno": "ttg2012010146",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Topology",
"Scalar Functions",
"Reeb Graphs",
"Level Set Topology",
"Simplification",
"Graph Layout"
],
"authors": [
{
"givenName": "Harish",
"surname": "Doraiswamy",
"fullName": "Harish Doraiswamy",
"affiliation": "Indian Institute of Science, Bangalore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vijay",
"surname": "Natarajan",
"fullName": "Vijay Natarajan",
"affiliation": "Indian Institute of Science, Bangalore",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2012-01-01 00:00:00",
"pubType": "trans",
"pages": "146-159",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2008/2339/0/04563018",
"title": "Anisotropic Laplace-Beltrami eigenmaps: Bridging Reeb graphs and skeletons",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2008/04563018/12OmNBO3K32",
"parentPublication": {
"id": "proceedings/cvprw/2008/2339/0",
"title": "2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209d981",
"title": "Kinematic Reeb Graph Extraction Based on Heat Diffusion",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209d981/12OmNBtCCLM",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2002/1862/0/18620465",
"title": "Topological Morphing Using Reeb Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2002/18620465/12OmNCwCLpE",
"parentPublication": {
"id": "proceedings/cw/2002/1862/0",
"title": "First International Symposium on Cyber Worlds, 2002. Proceedings.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2004/2075/0/20750157",
"title": "Augmented Reeb Graphs for Content-Based Retrieval of 3D Mesh Models",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2004/20750157/12OmNwKGAr5",
"parentPublication": {
"id": "proceedings/smi/2004/2075/0",
"title": "Proceedings. Shape Modeling International 2004",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/10/ttg2012101650",
"title": "Interactive Quadrangulation with Reeb Atlases and Connectivity Textures",
"doi": null,
"abstractUrl": "/journal/tg/2012/10/ttg2012101650/13rRUILc8fa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/02/ttg2013020249",
"title": "Computing Reeb Graphs as a Union of Contour Trees",
"doi": null,
"abstractUrl": "/journal/tg/2013/02/ttg2013020249/13rRUxDqS8h",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/04/ttg2009040583",
"title": "A Minimal Contouring Approach to the Computation of the Reeb Graph",
"doi": null,
"abstractUrl": "/journal/tg/2009/04/ttg2009040583/13rRUy0qnGf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061177",
"title": "Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061177/13rRUyY28Yo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/04/09677901",
"title": "Using Foliation Leaves to Extract Reeb Graphs on Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2023/04/09677901/1A4SvXrJO2k",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09448469",
"title": "A Topological Similarity Measure Between Multi-Resolution Reeb Spaces",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09448469/1ugE7gaINC8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012010132",
"articleId": "13rRUxASuvd",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012010160",
"articleId": "13rRUxASuGg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgyr",
"name": "ttg2012010146s.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012010146s.zip",
"extension": "zip",
"size": "6.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzICEF3",
"title": "July",
"year": "1983",
"issueNum": "04",
"idPrefix": "ts",
"pubType": "journal",
"volume": "9",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuHV",
"doi": "10.1109/TSE.1983.234958",
"abstract": "This paper shows that graph traversal techniques have fundamental differences between serial and distributed computations in their behaviors, computational complexities, and effects on the design of graph algorithms. It has three major parts. Section I describes the computational environment for the design and description of distributed graph algorithms in terms of an architectural model for message exchanges. The computational complexity is measured in terms of the number of messages transmitted. Section II presents several distributed algorithms for the pure traversal, depth-first search, and breadth-first search techniques. Their complexities are also given. Through these descriptions are brought out some of the intrinsic differences in the behaviors and complexities of the fundamental traversal techniques between a serial and a distributed computation environment. Section III gives the distributed version of the Ford and Fulkerson algorithm for the maximum flow problem by means of depth-first search, the largest-augmentation search and breadth-first search. The complexities of these methods are found to be 0(f*|A|), 0((l + logM/(M-1)f*|V||A|) and O(|V|6), respectively, where f* is the maximum flow value of the problem, M is the maximum number of ucs in a cut, |V| is the number of vertices, and |A| is the number of arcs. Lastly, it is shown that the largest augmentation search may be a better method than the other two. This is contrary to the known results in serial computation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper shows that graph traversal techniques have fundamental differences between serial and distributed computations in their behaviors, computational complexities, and effects on the design of graph algorithms. It has three major parts. Section I describes the computational environment for the design and description of distributed graph algorithms in terms of an architectural model for message exchanges. The computational complexity is measured in terms of the number of messages transmitted. Section II presents several distributed algorithms for the pure traversal, depth-first search, and breadth-first search techniques. Their complexities are also given. Through these descriptions are brought out some of the intrinsic differences in the behaviors and complexities of the fundamental traversal techniques between a serial and a distributed computation environment. Section III gives the distributed version of the Ford and Fulkerson algorithm for the maximum flow problem by means of depth-first search, the largest-augmentation search and breadth-first search. The complexities of these methods are found to be 0(f*|A|), 0((l + logM/(M-1)f*|V||A|) and O(|V|6), respectively, where f* is the maximum flow value of the problem, M is the maximum number of ucs in a cut, |V| is the number of vertices, and |A| is the number of arcs. Lastly, it is shown that the largest augmentation search may be a better method than the other two. This is contrary to the known results in serial computation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper shows that graph traversal techniques have fundamental differences between serial and distributed computations in their behaviors, computational complexities, and effects on the design of graph algorithms. It has three major parts. Section I describes the computational environment for the design and description of distributed graph algorithms in terms of an architectural model for message exchanges. The computational complexity is measured in terms of the number of messages transmitted. Section II presents several distributed algorithms for the pure traversal, depth-first search, and breadth-first search techniques. Their complexities are also given. Through these descriptions are brought out some of the intrinsic differences in the behaviors and complexities of the fundamental traversal techniques between a serial and a distributed computation environment. Section III gives the distributed version of the Ford and Fulkerson algorithm for the maximum flow problem by means of depth-first search, the largest-augmentation search and breadth-first search. The complexities of these methods are found to be 0(f*|A|), 0((l + logM/(M-1)f*|V||A|) and O(|V|6), respectively, where f* is the maximum flow value of the problem, M is the maximum number of ucs in a cut, |V| is the number of vertices, and |A| is the number of arcs. Lastly, it is shown that the largest augmentation search may be a better method than the other two. This is contrary to the known results in serial computation.",
"title": "Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation",
"normalizedTitle": "Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation",
"fno": "01703083",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Model",
"Distributed Computation",
"Distributed Graph Algorithms",
"Graph Traversal Techniques",
"Maximum Network Flow Problem"
],
"authors": [
{
"givenName": null,
"surname": "To-Yat Cheung",
"fullName": "To-Yat Cheung",
"affiliation": "Department of Computer Science, University of Ottawa",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "04",
"pubDate": "1983-07-01 00:00:00",
"pubType": "trans",
"pages": "504-512",
"year": "1983",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wetice/2008/3315/0/3315a139",
"title": "On NAT Traversal in Peer-to-Peer Applications",
"doi": null,
"abstractUrl": "/proceedings-article/wetice/2008/3315a139/12OmNrkBwss",
"parentPublication": {
"id": "proceedings/wetice/2008/3315/0",
"title": "2008 IEEE 17th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1991/2445/0/0185381",
"title": "Competitive algorithms for layered graph traversal",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1991/0185381/12OmNvAiSc8",
"parentPublication": {
"id": "proceedings/focs/1991/2445/0",
"title": "[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1989/1982/0/063504",
"title": "Network decomposition and locality in distributed computation",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1989/063504/12OmNwHQB7z",
"parentPublication": {
"id": "proceedings/focs/1989/1982/0",
"title": "30th Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2007/2928/0/29280205",
"title": "Shortest Traversal Path of n Circles in Layered Manufacturing Applications",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2007/29280205/12OmNy6Zs5Y",
"parentPublication": {
"id": "proceedings/cgiv/2007/2928/0",
"title": "Computer Graphics, Imaging and Visualisation (CGIV 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/1996/7398/0/73980385",
"title": "Data mining for path traversal patterns in a web environment",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/1996/73980385/12OmNz5apDd",
"parentPublication": {
"id": "proceedings/icdcs/1996/7398/0",
"title": "Proceedings of 16th International Conference on Distributed Computing Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciii/2011/4523/2/4523b557",
"title": "A Study of Advanced Hybrid Execution Using Reverse Traversal",
"doi": null,
"abstractUrl": "/proceedings-article/iciii/2011/4523b557/12OmNzDNtsu",
"parentPublication": {
"id": "proceedings/iciii/2011/4523/2",
"title": "International Conference on Information Management, Innovation Management and Industrial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/reconfig/2009/3917/0/3917a143",
"title": "A Traversal Cache Framework for FPGA Acceleration of Pointer Data Structures: A Case Study on Barnes-Hut N-body Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/reconfig/2009/3917a143/12OmNzh5yZa",
"parentPublication": {
"id": "proceedings/reconfig/2009/3917/0",
"title": "Reconfigurable Computing and FPGAs, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2012/4675/0/4675a378",
"title": "Fast and Efficient Graph Traversal Algorithm for CPUs: Maximizing Single-Node Efficiency",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2012/4675a378/12OmNzwHvbb",
"parentPublication": {
"id": "proceedings/ipdps/2012/4675/0",
"title": "Parallel and Distributed Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2012/4676/0/4676c019",
"title": "A Multi-source Message Passing Model to Improve the Parallelism Efficiency of Graph Mining on MapReduce",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2012/4676c019/12OmNzxgHtL",
"parentPublication": {
"id": "proceedings/ipdpsw/2012/4676/0",
"title": "2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/1998/02/k0209",
"title": "Efficient Data Mining for Path Traversal Patterns",
"doi": null,
"abstractUrl": "/journal/tk/1998/02/k0209/13rRUxBJhn0",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "01703082",
"articleId": "13rRUxNEqRy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01703084",
"articleId": "13rRUB6Sq1X",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwGqBqg",
"title": "November/December",
"year": "2009",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "15",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyY28Yo",
"doi": "10.1109/TVCG.2009.163",
"abstract": "This paper introduces an efficient algorithm for computing the Reeb graph of a scalar function f defined on a volumetric mesh M in Ropf3. We introduce a procedure called \"loop surgery\" that transforms M into a mesh M' by a sequence of cuts and guarantees the Reeb graph of f(M') to be loop free. Therefore, loop surgery reduces Reeb graph computation to the simpler problem of computing a contour tree, for which well-known algorithms exist that are theoretically efficient (O(n log n)) and fast in practice. Inverse cuts reconstruct the loops removed at the beginning. The time complexity of our algorithm is that of a contour tree computation plus a loop surgery overhead, which depends on the number of handles of the mesh. Our systematic experiments confirm that for real-life data, this overhead is comparable to the computation of the contour tree, demonstrating virtually linear scalability on meshes ranging from 70 thousand to 3.5 million tetrahedra. Performance numbers show that our algorithm, although restricted to volumetric data, has an average speedup factor of 6,500 over the previous fastest techniques, handling larger and more complex data-sets. We demonstrate the verstility of our approach by extending fast topologically clean isosurface extraction to non simply-connected domains. We apply this technique in the context of pressure analysis for mechanical design. In this case, our technique produces results in matter of seconds even for the largest meshes. For the same models, previous Reeb graph techniques do not produce a result.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper introduces an efficient algorithm for computing the Reeb graph of a scalar function f defined on a volumetric mesh M in Ropf3. We introduce a procedure called \"loop surgery\" that transforms M into a mesh M' by a sequence of cuts and guarantees the Reeb graph of f(M') to be loop free. Therefore, loop surgery reduces Reeb graph computation to the simpler problem of computing a contour tree, for which well-known algorithms exist that are theoretically efficient (O(n log n)) and fast in practice. Inverse cuts reconstruct the loops removed at the beginning. The time complexity of our algorithm is that of a contour tree computation plus a loop surgery overhead, which depends on the number of handles of the mesh. Our systematic experiments confirm that for real-life data, this overhead is comparable to the computation of the contour tree, demonstrating virtually linear scalability on meshes ranging from 70 thousand to 3.5 million tetrahedra. Performance numbers show that our algorithm, although restricted to volumetric data, has an average speedup factor of 6,500 over the previous fastest techniques, handling larger and more complex data-sets. We demonstrate the verstility of our approach by extending fast topologically clean isosurface extraction to non simply-connected domains. We apply this technique in the context of pressure analysis for mechanical design. In this case, our technique produces results in matter of seconds even for the largest meshes. For the same models, previous Reeb graph techniques do not produce a result.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper introduces an efficient algorithm for computing the Reeb graph of a scalar function f defined on a volumetric mesh M in Ropf3. We introduce a procedure called \"loop surgery\" that transforms M into a mesh M' by a sequence of cuts and guarantees the Reeb graph of f(M') to be loop free. Therefore, loop surgery reduces Reeb graph computation to the simpler problem of computing a contour tree, for which well-known algorithms exist that are theoretically efficient (O(n log n)) and fast in practice. Inverse cuts reconstruct the loops removed at the beginning. The time complexity of our algorithm is that of a contour tree computation plus a loop surgery overhead, which depends on the number of handles of the mesh. Our systematic experiments confirm that for real-life data, this overhead is comparable to the computation of the contour tree, demonstrating virtually linear scalability on meshes ranging from 70 thousand to 3.5 million tetrahedra. Performance numbers show that our algorithm, although restricted to volumetric data, has an average speedup factor of 6,500 over the previous fastest techniques, handling larger and more complex data-sets. We demonstrate the verstility of our approach by extending fast topologically clean isosurface extraction to non simply-connected domains. We apply this technique in the context of pressure analysis for mechanical design. In this case, our technique produces results in matter of seconds even for the largest meshes. For the same models, previous Reeb graph techniques do not produce a result.",
"title": "Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees",
"normalizedTitle": "Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees",
"fno": "ttg2009061177",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Surgery",
"Tree Graphs",
"Data Visualization",
"Isosurfaces",
"Data Mining",
"Topology",
"Algorithm Design And Analysis",
"Stress",
"Scalability",
"Level Set",
"Topological Simplification",
"Reeb Graph",
"Scalar Field Topology",
"Isosurfaces"
],
"authors": [
{
"givenName": "J.",
"surname": "Tierny",
"fullName": "J. Tierny",
"affiliation": "Sci. Comput. & Imaging Inst., Univ. of Utah, Salt Lake City, UT, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "A.",
"surname": "Gyulassy",
"fullName": "A. Gyulassy",
"affiliation": "Sci. Comput. & Imaging Inst., Univ. of Utah, Salt Lake City, UT, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "E.",
"surname": "Simon",
"fullName": "E. Simon",
"affiliation": "Dassault Syst., UT, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "V.",
"surname": "Pascucci",
"fullName": "V. Pascucci",
"affiliation": "Sci. Comput. & Imaging Inst., Univ. of Utah, Salt Lake City, UT, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2009-11-01 00:00:00",
"pubType": "trans",
"pages": "1177-1184",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/trustcom/2011/2135/0/06121000",
"title": "Nose Surgery Simulation Based on Volumetric Laplacian Deformation",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2011/06121000/12OmNvSbBqY",
"parentPublication": {
"id": "proceedings/trustcom/2011/2135/0",
"title": "2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498pascucci",
"title": "Efficient Computation of the Topology of Level Sets",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498pascucci/12OmNvkpl7Y",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2012/4814/0/4814a178",
"title": "Three Dimensional Sketch for a Landscape Using Morse Theory and Reeb Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2012/4814a178/12OmNwE9Oqe",
"parentPublication": {
"id": "proceedings/cw/2012/4814/0",
"title": "2012 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/10/ttg2012101650",
"title": "Interactive Quadrangulation with Reeb Atlases and Connectivity Textures",
"doi": null,
"abstractUrl": "/journal/tg/2012/10/ttg2012101650/13rRUILc8fa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/01/ttg2012010146",
"title": "Output-Sensitive Construction of Reeb Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2012/01/ttg2012010146/13rRUwvBy8S",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/02/ttg2013020249",
"title": "Computing Reeb Graphs as a Union of Contour Trees",
"doi": null,
"abstractUrl": "/journal/tg/2013/02/ttg2013020249/13rRUxDqS8h",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192700",
"title": "Interactive Visualization for Singular Fibers of Functions f : R3 → R2",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192700/13rRUxly9dW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/04/ttg2009040583",
"title": "A Minimal Contouring Approach to the Computation of the Reeb Graph",
"doi": null,
"abstractUrl": "/journal/tg/2009/04/ttg2009040583/13rRUy0qnGf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/02/04069241",
"title": "Topology-Controlled Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2007/02/04069241/13rRUytF41s",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09409737",
"title": "Identification and Classification of Off-Vertex Critical Points for Contour Tree Construction on Unstructured Meshes of Hexahedra",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09409737/1sXjFxDTLAQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009061057",
"articleId": "13rRUIJcWli",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2009061065",
"articleId": "13rRUynHuj4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAlvHDw",
"title": "May/June",
"year": "2009",
"issueNum": "03",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "11",
"label": "May/June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgarFd",
"doi": "10.1109/MCSE.2009.48",
"abstract": "Graphics processing units (GPUs) can provide excellent speedups on some, but not all, general-purpose workloads. Using a set of computational GPU kernels as examples, the authors show how to adapt kernels to utilize the architectural features of a GeForce 8800 GPU and what finally limits the achievable performance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Graphics processing units (GPUs) can provide excellent speedups on some, but not all, general-purpose workloads. Using a set of computational GPU kernels as examples, the authors show how to adapt kernels to utilize the architectural features of a GeForce 8800 GPU and what finally limits the achievable performance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Graphics processing units (GPUs) can provide excellent speedups on some, but not all, general-purpose workloads. Using a set of computational GPU kernels as examples, the authors show how to adapt kernels to utilize the architectural features of a GeForce 8800 GPU and what finally limits the achievable performance.",
"title": "Compute Unified Device Architecture Application Suitability",
"normalizedTitle": "Compute Unified Device Architecture Application Suitability",
"fno": "mcs2009030016",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"CUDA",
"GPGPU",
"Computer Architecture",
"Software Optimization",
"Benchmarks",
"Compute Unified Device Architecture",
"General Purpose Computing On GPU"
],
"authors": [
{
"givenName": "Wen-Mei",
"surname": "Hwu",
"fullName": "Wen-Mei Hwu",
"affiliation": "University of Illinois",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christopher",
"surname": "Rodrigues",
"fullName": "Christopher Rodrigues",
"affiliation": "University of Illinois",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shane",
"surname": "Ryoo",
"fullName": "Shane Ryoo",
"affiliation": "ZeroSoft",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Stratton",
"fullName": "John Stratton",
"affiliation": "University of Illinois",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2009-05-01 00:00:00",
"pubType": "mags",
"pages": "16-26",
"year": "2009",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wamca/2012/4916/0/4916a001",
"title": "A Load Distribution Algorithm Based on Profiling for Heterogeneous GPU Clusters",
"doi": null,
"abstractUrl": "/proceedings-article/wamca/2012/4916a001/12OmNB9bvfb",
"parentPublication": {
"id": "proceedings/wamca/2012/4916/0",
"title": "Architecture and Multi-Core Applications, Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gcc/2010/4313/0/4313a174",
"title": "Parallelization of RSA Algorithm Based on Compute Unified Device Architecture",
"doi": null,
"abstractUrl": "/proceedings-article/gcc/2010/4313a174/12OmNCdk2IV",
"parentPublication": {
"id": "proceedings/gcc/2010/4313/0",
"title": "Grid and Cloud Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbac-pad/2008/3423/0/3423a081",
"title": "Processing Neocognitron of Face Recognition on High Performance Environment Based on GPU with CUDA Architecture",
"doi": null,
"abstractUrl": "/proceedings-article/sbac-pad/2008/3423a081/12OmNCh0Pde",
"parentPublication": {
"id": "proceedings/sbac-pad/2008/3423/0",
"title": "Computer Architecture and High Performance Computing, Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsps/2009/3654/0/3654a556",
"title": "Hierarchical Agglomerative Clustering Using Graphics Processor with Compute Unified Device Architecture",
"doi": null,
"abstractUrl": "/proceedings-article/icsps/2009/3654a556/12OmNqFrGyO",
"parentPublication": {
"id": "proceedings/icsps/2009/3654/0",
"title": "2009 International Conference on Signal Processing Systems (ICSPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sccompanion/2012/4956/0/4956b496",
"title": "Abstract: Extended Abstract for Evaluating Asynchrony in Gibraltar RAID's GPU Reed-Solomon Coding Library",
"doi": null,
"abstractUrl": "/proceedings-article/sccompanion/2012/4956b496/12OmNwDSdGk",
"parentPublication": {
"id": "proceedings/sccompanion/2012/4956/0",
"title": "2012 SC Companion: High Performance Computing, Networking Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbac-pad/2007/3014/0/30140019",
"title": "Voice Command Recognition with Dynamic Time Warping (DTW) using Graphics Processing Units (GPU) with Compute Unified Device Architecture (CUDA)",
"doi": null,
"abstractUrl": "/proceedings-article/sbac-pad/2007/30140019/12OmNwtWfGJ",
"parentPublication": {
"id": "proceedings/sbac-pad/2007/3014/0",
"title": "Computer Architecture and High Performance Computing, Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdcat/2009/3914/0/3914a432",
"title": "Accurate Measurements and Precise Modeling of Power Dissipation of CUDA Kernels toward Power Optimized High Performance CPU-GPU Computing",
"doi": null,
"abstractUrl": "/proceedings-article/pdcat/2009/3914a432/12OmNxbmSCw",
"parentPublication": {
"id": "proceedings/pdcat/2009/3914/0",
"title": "2009 International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2012/4893/0/4893a208",
"title": "An Automatic Host and Device Memory Allocation Method for OpenMPC",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2012/4893a208/12OmNz5apIT",
"parentPublication": {
"id": "proceedings/icnc/2012/4893/0",
"title": "2012 Third International Conference on Networking and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wamca/2011/4613/0/4613a024",
"title": "Economical Two-fold Working Precision Matrix Multiplication on Consumer-Level CUDA GPUs",
"doi": null,
"abstractUrl": "/proceedings-article/wamca/2011/4613a024/12OmNzmLxI3",
"parentPublication": {
"id": "proceedings/wamca/2011/4613/0",
"title": "Architecture and Multi-Core Applications, Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2011/06/ttb2011061678",
"title": "CUDA-BLASTP: Accelerating BLASTP on CUDA-Enabled Graphics Hardware",
"doi": null,
"abstractUrl": "/journal/tb/2011/06/ttb2011061678/13rRUwInvHK",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcs2009030006",
"articleId": "13rRUxN5ex0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcs2009030027",
"articleId": "13rRUxZRbtb",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzZEAyi",
"title": "February",
"year": "2012",
"issueNum": "02",
"idPrefix": "td",
"pubType": "journal",
"volume": "23",
"label": "February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa55M",
"doi": "10.1109/TPDS.2011.157",
"abstract": "We explore two different threading approaches on a graphics processing unit (GPU) exploiting two different characteristics of the current GPU architecture. The fat thread approach tries to minimize data access time by relying on shared memory and registers potentially sacrificing parallelism. The thin thread approach maximizes parallelism and tries to hide access latencies. We apply these two approaches to the parallel stochastic simulation of chemical reaction systems using the stochastic simulation algorithm (SSA) by Gillespie [14]. In these cases, the proposed thin thread approach shows comparable performance while eliminating the limitation of the reaction system's size.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We explore two different threading approaches on a graphics processing unit (GPU) exploiting two different characteristics of the current GPU architecture. The fat thread approach tries to minimize data access time by relying on shared memory and registers potentially sacrificing parallelism. The thin thread approach maximizes parallelism and tries to hide access latencies. We apply these two approaches to the parallel stochastic simulation of chemical reaction systems using the stochastic simulation algorithm (SSA) by Gillespie [14]. In these cases, the proposed thin thread approach shows comparable performance while eliminating the limitation of the reaction system's size.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We explore two different threading approaches on a graphics processing unit (GPU) exploiting two different characteristics of the current GPU architecture. The fat thread approach tries to minimize data access time by relying on shared memory and registers potentially sacrificing parallelism. The thin thread approach maximizes parallelism and tries to hide access latencies. We apply these two approaches to the parallel stochastic simulation of chemical reaction systems using the stochastic simulation algorithm (SSA) by Gillespie [14]. In these cases, the proposed thin thread approach shows comparable performance while eliminating the limitation of the reaction system's size.",
"title": "Fat versus Thin Threading Approach on GPUs: Application to Stochastic Simulation of Chemical Reactions",
"normalizedTitle": "Fat versus Thin Threading Approach on GPUs: Application to Stochastic Simulation of Chemical Reactions",
"fno": "ttd2012020280",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Parallel Processing",
"Compute Unified Device Architecture CUDA",
"Graphics Processing Unit GPU"
],
"authors": [
{
"givenName": "Guido",
"surname": "Klingbeil",
"fullName": "Guido Klingbeil",
"affiliation": "University of Oxford, Oxford",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Radek",
"surname": "Erban",
"fullName": "Radek Erban",
"affiliation": "University of Oxford, Oxford",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mike",
"surname": "Giles",
"fullName": "Mike Giles",
"affiliation": "University of Oxford, Oxford",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Philip K.",
"surname": "Maini",
"fullName": "Philip K. Maini",
"affiliation": "University of Oxford, Oxford",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2012-02-01 00:00:00",
"pubType": "trans",
"pages": "280-287",
"year": "2012",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpads/2011/4576/0/4576b052",
"title": "Parallel Implementation of Edge-Directed Image Interpolation on a Graphics Processing Unit",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2011/4576b052/12OmNqBbHMj",
"parentPublication": {
"id": "proceedings/icpads/2011/4576/0",
"title": "Parallel and Distributed Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-icess/2012/4749/0/4749a843",
"title": "Implementation and Analysis of AES Encryption on GPU",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-icess/2012/4749a843/12OmNvDqsOk",
"parentPublication": {
"id": "proceedings/hpcc-icess/2012/4749/0",
"title": "High Performance Computing and Communication & IEEE International Conference on Embedded Software and Systems, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csnt/2011/4437/0/4437a536",
"title": "Performance Evaluation of Feature Extraction Algorithm on GPGPU",
"doi": null,
"abstractUrl": "/proceedings-article/csnt/2011/4437a536/12OmNvy257i",
"parentPublication": {
"id": "proceedings/csnt/2011/4437/0",
"title": "Communication Systems and Network Technologies, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icinis/2011/4543/0/4543a093",
"title": "Paralleling Euclidean Particle Swarm Optimization in CUDA",
"doi": null,
"abstractUrl": "/proceedings-article/icinis/2011/4543a093/12OmNwErpLH",
"parentPublication": {
"id": "proceedings/icinis/2011/4543/0",
"title": "Intelligent Networks and Intelligent Systems, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse/2010/4323/0/4323a168",
"title": "GPU-RMAP: Accelerating Short-Read Mapping on Graphics Processors",
"doi": null,
"abstractUrl": "/proceedings-article/cse/2010/4323a168/12OmNwF0C8B",
"parentPublication": {
"id": "proceedings/cse/2010/4323/0",
"title": "2010 13th IEEE International Conference on Computational Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2012/4676/0/4676c414",
"title": "Parallel Algorithms for Approximate String Matching with k Mismatches on CUDA",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2012/4676c414/12OmNwKoZcP",
"parentPublication": {
"id": "proceedings/ipdpsw/2012/4676/0",
"title": "2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-css-icess/2014/6123/0/07056886",
"title": "GPU Accelerated 3D Image Deformation Using Thin-Plate Splines",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-css-icess/2014/07056886/12OmNxHryf3",
"parentPublication": {
"id": "proceedings/hpcc-css-icess/2014/6123/0",
"title": "2014 IEEE International Conference on High Performance Computing and Communications (HPCC), 2014 IEEE 6th International Symposium on Cyberspace Safety and Security (CSS) and 2014 IEEE 11th International Conference on Embedded Software and Systems (ICESS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2012/4676/0/4676b397",
"title": "Evaluating Polynomials in Several Variables and their Derivatives on a GPU Computing Processor",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2012/4676b397/12OmNyqRnpC",
"parentPublication": {
"id": "proceedings/ipdpsw/2012/4676/0",
"title": "2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/saahpc/2012/4838/0/4838a001",
"title": "The Fat-Link Computation on Large GPU Clusters for Lattice QCD",
"doi": null,
"abstractUrl": "/proceedings-article/saahpc/2012/4838a001/12OmNz6iO82",
"parentPublication": {
"id": "proceedings/saahpc/2012/4838/0",
"title": "Application Accelerators in High-Performance Computing, Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2008/06/mcs2008060006",
"title": "Coming Soon: Research in a Cloud",
"doi": null,
"abstractUrl": "/magazine/cs/2008/06/mcs2008060006/13rRUwjoNDz",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttd2012020271",
"articleId": "13rRUwjXZRU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttd2012020288",
"articleId": "13rRUyYBlgc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesPM",
"name": "ttd2012020280s.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttd2012020280s.pdf",
"extension": "pdf",
"size": "228 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx57HSt",
"title": "March/April",
"year": "2008",
"issueNum": "02",
"idPrefix": "mi",
"pubType": "magazine",
"volume": "28",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUynpTa2",
"doi": "10.1109/MM.2008.31",
"abstract": "To enable flexible, programmable graphics and high-performance computing, NVIDIA has developed the Tesla scalable unified graphics and parallel computing architecture. Its scalable parallel array of processors is massively multithreaded and programmable in C or via graphics APIs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "To enable flexible, programmable graphics and high-performance computing, NVIDIA has developed the Tesla scalable unified graphics and parallel computing architecture. Its scalable parallel array of processors is massively multithreaded and programmable in C or via graphics APIs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "To enable flexible, programmable graphics and high-performance computing, NVIDIA has developed the Tesla scalable unified graphics and parallel computing architecture. Its scalable parallel array of processors is massively multithreaded and programmable in C or via graphics APIs.",
"title": "NVIDIA Tesla: A Unified Graphics and Computing Architecture",
"normalizedTitle": "NVIDIA Tesla: A Unified Graphics and Computing Architecture",
"fno": "mmi2008020039",
"hasPdf": true,
"idPrefix": "mi",
"keywords": [
"Hot Chips 19",
"GPU",
"Parallel Processor",
"SIMT",
"SIMD",
"Unified Graphics And Parallel Computing Architecture",
"Graphics Processing Unit",
"Cooperative Thread Array",
"Tesla"
],
"authors": [
{
"givenName": "Erik",
"surname": "Lindholm",
"fullName": "Erik Lindholm",
"affiliation": "NVIDIA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Nickolls",
"fullName": "John Nickolls",
"affiliation": "NVIDIA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stuart",
"surname": "Oberman",
"fullName": "Stuart Oberman",
"affiliation": "NVIDIA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Montrym",
"fullName": "John Montrym",
"affiliation": "NVIDIA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2008-03-01 00:00:00",
"pubType": "mags",
"pages": "39-55",
"year": "2008",
"issn": "0272-1732",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hpcc-css-icess/2015/8937/0/07336442",
"title": "Constructing a Mobility and Acceleration Computing Platform with NVIDIA Jetson TK1",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-css-icess/2015/07336442/12OmNBh8gZT",
"parentPublication": {
"id": "proceedings/hpcc-css-icess/2015/8937/0",
"title": "2015 IEEE 17th International Conference on High Performance Computing and Communications (HPCC), 2015 IEEE 7th International Symposium on Cyberspace Safety and Security (CSS) and 2015 IEEE 12th International Conf on Embedded Software and Systems (ICESS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdp/2009/3544/0/3544a111",
"title": "A Parallel Implementation of the 2D Wavelet Transform Using CUDA",
"doi": null,
"abstractUrl": "/proceedings-article/pdp/2009/3544a111/12OmNBhHtbV",
"parentPublication": {
"id": "proceedings/pdp/2009/3544/0",
"title": "2009 17th Euromicro International Conference on Parallel, Distributed and Network-based Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsps/2009/3654/0/3654a556",
"title": "Hierarchical Agglomerative Clustering Using Graphics Processor with Compute Unified Device Architecture",
"doi": null,
"abstractUrl": "/proceedings-article/icsps/2009/3654a556/12OmNqFrGyO",
"parentPublication": {
"id": "proceedings/icsps/2009/3654/0",
"title": "2009 International Conference on Signal Processing Systems (ICSPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2005/9313/0/01577219",
"title": "H.263 video decoding on programmable graphics hardware",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2005/01577219/12OmNscxj9a",
"parentPublication": {
"id": "proceedings/isspit/2005/9313/0",
"title": "2005 IEEE International Symposium on Signal Processing and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/splc/1994/6895/0/00377006",
"title": "MPE graphics-scalable X11 graphics in MPI",
"doi": null,
"abstractUrl": "/proceedings-article/splc/1994/00377006/12OmNy87Qu1",
"parentPublication": {
"id": "proceedings/splc/1994/6895/0",
"title": "Proceedings Scalable Parallel Libraries Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hldvt/2009/9999/0/05340175",
"title": "Fault table generation using Graphics Processing Units",
"doi": null,
"abstractUrl": "/proceedings-article/hldvt/2009/05340175/12OmNyqRnct",
"parentPublication": {
"id": "proceedings/hldvt/2009/9999/0",
"title": "2009 IEEE International High Level Design Validation and Test Workshop",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcabes/2010/4110/0/4110a548",
"title": "Fractal Graphics Parallel Design and Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/dcabes/2010/4110a548/12OmNyuyae4",
"parentPublication": {
"id": "proceedings/dcabes/2010/4110/0",
"title": "2010 Ninth International Symposium on Distributed Computing and Applications to Business, Engineering and Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2011/02/mmi2011020050",
"title": "Fermi GF100 GPU Architecture",
"doi": null,
"abstractUrl": "/magazine/mi/2011/02/mmi2011020050/13rRUILtJih",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/04/ttg2009040605",
"title": "A Compute Unified System Architecture for Graphics Clusters Incorporating Data Locality",
"doi": null,
"abstractUrl": "/journal/tg/2009/04/ttg2009040605/13rRUwI5U2A",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/03/ttg2009030436",
"title": "Equalizer: A Scalable Parallel Rendering Framework",
"doi": null,
"abstractUrl": "/journal/tg/2009/03/ttg2009030436/13rRUxAASVT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mmi2008020030",
"articleId": "13rRUwgyOd2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mmi2008020056",
"articleId": "13rRUwhpBAv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvTBBb5",
"title": "November",
"year": "2003",
"issueNum": "11",
"idPrefix": "tp",
"pubType": "journal",
"volume": "25",
"label": "November",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvBW",
"doi": "10.1109/TPAMI.2003.1240113",
"abstract": "Abstract—As a computational bridge between the high-level a priori knowledge of object shape and the low-level image data, active contours (or snakes) are useful models for the extraction of deformable objects. We propose an approach for manipulating multiple snakes iteratively, called interacting snakes, that minimizes the attraction energy functionals on both contours and enclosed regions of individual snakes and the repulsion energy functionals among multiple snakes that interact with each other. We implement the interacting snakes through explicit curve (parametric active contours) representation in the domain of face recognition. We represent human faces semantically via facial components such as eyes, mouth, face outline, and the hair outline. Each facial component is encoded by a closed (or open) snake that is drawn from a 3D generic face model. A collection of semantic facial components form a hypergraph, called semantic face graph, which employs interacting snakes to align the general facial topology onto the sensed face images. Experimental results show that a successful interaction among multiple snakes associated with facial components makes the semantic face graph a useful model for face representation, including cartoon faces and caricatures, and recognition.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—As a computational bridge between the high-level a priori knowledge of object shape and the low-level image data, active contours (or snakes) are useful models for the extraction of deformable objects. We propose an approach for manipulating multiple snakes iteratively, called interacting snakes, that minimizes the attraction energy functionals on both contours and enclosed regions of individual snakes and the repulsion energy functionals among multiple snakes that interact with each other. We implement the interacting snakes through explicit curve (parametric active contours) representation in the domain of face recognition. We represent human faces semantically via facial components such as eyes, mouth, face outline, and the hair outline. Each facial component is encoded by a closed (or open) snake that is drawn from a 3D generic face model. A collection of semantic facial components form a hypergraph, called semantic face graph, which employs interacting snakes to align the general facial topology onto the sensed face images. Experimental results show that a successful interaction among multiple snakes associated with facial components makes the semantic face graph a useful model for face representation, including cartoon faces and caricatures, and recognition.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—As a computational bridge between the high-level a priori knowledge of object shape and the low-level image data, active contours (or snakes) are useful models for the extraction of deformable objects. We propose an approach for manipulating multiple snakes iteratively, called interacting snakes, that minimizes the attraction energy functionals on both contours and enclosed regions of individual snakes and the repulsion energy functionals among multiple snakes that interact with each other. We implement the interacting snakes through explicit curve (parametric active contours) representation in the domain of face recognition. We represent human faces semantically via facial components such as eyes, mouth, face outline, and the hair outline. Each facial component is encoded by a closed (or open) snake that is drawn from a 3D generic face model. A collection of semantic facial components form a hypergraph, called semantic face graph, which employs interacting snakes to align the general facial topology onto the sensed face images. Experimental results show that a successful interaction among multiple snakes associated with facial components makes the semantic face graph a useful model for face representation, including cartoon faces and caricatures, and recognition.",
"title": "Generating Discriminating Cartoon Faces Using Interacting Snakes",
"normalizedTitle": "Generating Discriminating Cartoon Faces Using Interacting Snakes",
"fno": "i1388",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Active Contours",
"Snakes",
"Gradient Vector Field",
"Face Recognition",
"Semantic Face Graph",
"Face Modeling",
"Face Alignment",
"Cartoon Faces",
"Caricatures"
],
"authors": [
{
"givenName": "Rein-Lien",
"surname": "Hsu",
"fullName": "Rein-Lien Hsu",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anil K.",
"surname": "Jain",
"fullName": "Anil K. Jain",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2003-11-01 00:00:00",
"pubType": "trans",
"pages": "1388-1398",
"year": "2003",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i1380",
"articleId": "13rRUygT7a7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i1399",
"articleId": "13rRUxASucz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNz2C1BC",
"title": "July",
"year": "2012",
"issueNum": "07",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwgQpDt",
"doi": "10.1109/TVCG.2011.111",
"abstract": "We introduce the EXtract-and-COmplete Layering method (EXCOL)—a novel cartoon animation processing technique to convert a traditional animated cartoon video into multiple semantically meaningful layers. Our technique is inspired by vision-based layering techniques but focuses on shape cues in both the extraction and completion steps to reflect the unique characteristics of cartoon animation. For layer extraction, we define a novel similarity measure incorporating both shape and color of automatically segmented regions within individual frames and propagate a small set of user-specified layer labels among similar regions across frames. By clustering regions with the same labels, each frame is appropriately partitioned into different layers, with each layer containing semantically meaningful content. Then, a warping-based approach is used to fill missing parts caused by occlusion within the extracted layers to achieve a complete representation. EXCOL provides a flexible way to effectively reuse traditional cartoon animations with only a small amount of user interaction. It is demonstrated that our EXCOL method is effective and robust, and the layered representation benefits a variety of applications in cartoon animation processing.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We introduce the EXtract-and-COmplete Layering method (EXCOL)—a novel cartoon animation processing technique to convert a traditional animated cartoon video into multiple semantically meaningful layers. Our technique is inspired by vision-based layering techniques but focuses on shape cues in both the extraction and completion steps to reflect the unique characteristics of cartoon animation. For layer extraction, we define a novel similarity measure incorporating both shape and color of automatically segmented regions within individual frames and propagate a small set of user-specified layer labels among similar regions across frames. By clustering regions with the same labels, each frame is appropriately partitioned into different layers, with each layer containing semantically meaningful content. Then, a warping-based approach is used to fill missing parts caused by occlusion within the extracted layers to achieve a complete representation. EXCOL provides a flexible way to effectively reuse traditional cartoon animations with only a small amount of user interaction. It is demonstrated that our EXCOL method is effective and robust, and the layered representation benefits a variety of applications in cartoon animation processing.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We introduce the EXtract-and-COmplete Layering method (EXCOL)—a novel cartoon animation processing technique to convert a traditional animated cartoon video into multiple semantically meaningful layers. Our technique is inspired by vision-based layering techniques but focuses on shape cues in both the extraction and completion steps to reflect the unique characteristics of cartoon animation. For layer extraction, we define a novel similarity measure incorporating both shape and color of automatically segmented regions within individual frames and propagate a small set of user-specified layer labels among similar regions across frames. By clustering regions with the same labels, each frame is appropriately partitioned into different layers, with each layer containing semantically meaningful content. Then, a warping-based approach is used to fill missing parts caused by occlusion within the extracted layers to achieve a complete representation. EXCOL provides a flexible way to effectively reuse traditional cartoon animations with only a small amount of user interaction. It is demonstrated that our EXCOL method is effective and robust, and the layered representation benefits a variety of applications in cartoon animation processing.",
"title": "EXCOL: An EXtract-and-COmplete Layering Approach to Cartoon Animation Reusing",
"normalizedTitle": "EXCOL: An EXtract-and-COmplete Layering Approach to Cartoon Animation Reusing",
"fno": "ttg2012071156",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Cartoon Animation",
"Layer Extraction",
"Layer Completion",
"Label Propagation"
],
"authors": [
{
"givenName": "Lei",
"surname": "Zhang",
"fullName": "Lei Zhang",
"affiliation": "Beijing Institute of Technology, Beijing",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hua",
"surname": "Huang",
"fullName": "Hua Huang",
"affiliation": "Xi'an Jiaotong University, Xi'an",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongbo",
"surname": "Fu",
"fullName": "Hongbo Fu",
"affiliation": "City University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2012-07-01 00:00:00",
"pubType": "trans",
"pages": "1156-1169",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icicta/2015/7644/0/7644a265",
"title": "Cartoon Material Annotation and Retrieval System for Web-Interactive-Service Cartoon Making",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2015/7644a265/12OmNCdk2wA",
"parentPublication": {
"id": "proceedings/icicta/2015/7644/0",
"title": "2015 8th International Conference on Intelligent Computation Technology and Automation (ICICTA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacific-graphics/2010/4205/0/4205a001",
"title": "Procedural Modeling of Water Caustics and Foamy Water for Cartoon Animation",
"doi": null,
"abstractUrl": "/proceedings-article/pacific-graphics/2010/4205a001/12OmNCf1Dqs",
"parentPublication": {
"id": "proceedings/pacific-graphics/2010/4205/0",
"title": "Pacific Conference on Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2015/7673/0/7673a185",
"title": "Real-Time 2.5D Facial Cartoon Animation Based on Pose and Expression Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2015/7673a185/12OmNvSKNRM",
"parentPublication": {
"id": "proceedings/icvrv/2015/7673/0",
"title": "2015 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cicn/2014/6929/0/6929a697",
"title": "Design of an Automatic Cartoon Movie Builder (ACMB) System for Generation of a Cartoon Movie from a Given Story",
"doi": null,
"abstractUrl": "/proceedings-article/cicn/2014/6929a697/12OmNvjyxQU",
"parentPublication": {
"id": "proceedings/cicn/2014/6929/0",
"title": "2014 International Conference on Computational Intelligence and Communication Networks (CICN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ca/1996/7588/0/75880110",
"title": "On The Silhouette Cartoon Animation",
"doi": null,
"abstractUrl": "/proceedings-article/ca/1996/75880110/12OmNyNQSPN",
"parentPublication": {
"id": "proceedings/ca/1996/7588/0",
"title": "Computer Animation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2003/1946/0/19460144",
"title": "Rendering Artistic and Believable Trees for Cartoon Animation",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2003/19460144/12OmNz61ddn",
"parentPublication": {
"id": "proceedings/cgi/2003/1946/0",
"title": "Computer Graphics International Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/04/ttg2009040618",
"title": "Vectorizing Cartoon Animations",
"doi": null,
"abstractUrl": "/journal/tg/2009/04/ttg2009040618/13rRUIJcWlh",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/03/06910280",
"title": "2.5D Cartoon Hair Modeling and Manipulation",
"doi": null,
"abstractUrl": "/journal/tg/2015/03/06910280/13rRUIJuxpC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030488",
"title": "The Squash-and-Stretch Stylization for Character Motions",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030488/13rRUxC0SW7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2022/05/09773005",
"title": "View-Dependent Deformation for 2.5-D Cartoon Models",
"doi": null,
"abstractUrl": "/magazine/cg/2022/05/09773005/1DhYOweTNHG",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012071146",
"articleId": "13rRUxcKzVj",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06081857",
"articleId": "13rRUwInvyu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx4Q6DL",
"title": "Oct.",
"year": "2017",
"issueNum": "10",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxcbnHh",
"doi": "10.1109/TVCG.2016.2620467",
"abstract": "We present a system to combine arbitrary triangle mesh animations with physically based Finite Element Method (FEM) simulation, enabling control over the combination both in space and time. The input is a triangle mesh animation obtained using any method, such as keyframed animation, character rigging, 3D scanning, or geometric shape modeling. The input may be non-physical, crude or even incomplete. The user provides weights, specified using a minimal user interface, for how much physically based simulation should be allowed to modify the animation in any region of the model, and in time. Our system then computes a physically-based animation that is constrained to the input animation to the amount prescribed by these weights. This permits smoothly turning physics on and off over space and time, making it possible for the output to strictly follow the input, to evolve purely based on physically based simulation, and anything in between. Achieving such results requires a careful combination of several system components. We propose and analyze these components, including proper automatic creation of simulation meshes (even for non-manifold and self-colliding undeformed triangle meshes), converting triangle mesh animations into animations of the simulation mesh, and resolving collisions and self-collisions while following the input.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a system to combine arbitrary triangle mesh animations with physically based Finite Element Method (FEM) simulation, enabling control over the combination both in space and time. The input is a triangle mesh animation obtained using any method, such as keyframed animation, character rigging, 3D scanning, or geometric shape modeling. The input may be non-physical, crude or even incomplete. The user provides weights, specified using a minimal user interface, for how much physically based simulation should be allowed to modify the animation in any region of the model, and in time. Our system then computes a physically-based animation that is constrained to the input animation to the amount prescribed by these weights. This permits smoothly turning physics on and off over space and time, making it possible for the output to strictly follow the input, to evolve purely based on physically based simulation, and anything in between. Achieving such results requires a careful combination of several system components. We propose and analyze these components, including proper automatic creation of simulation meshes (even for non-manifold and self-colliding undeformed triangle meshes), converting triangle mesh animations into animations of the simulation mesh, and resolving collisions and self-collisions while following the input.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a system to combine arbitrary triangle mesh animations with physically based Finite Element Method (FEM) simulation, enabling control over the combination both in space and time. The input is a triangle mesh animation obtained using any method, such as keyframed animation, character rigging, 3D scanning, or geometric shape modeling. The input may be non-physical, crude or even incomplete. The user provides weights, specified using a minimal user interface, for how much physically based simulation should be allowed to modify the animation in any region of the model, and in time. Our system then computes a physically-based animation that is constrained to the input animation to the amount prescribed by these weights. This permits smoothly turning physics on and off over space and time, making it possible for the output to strictly follow the input, to evolve purely based on physically based simulation, and anything in between. Achieving such results requires a careful combination of several system components. We propose and analyze these components, including proper automatic creation of simulation meshes (even for non-manifold and self-colliding undeformed triangle meshes), converting triangle mesh animations into animations of the simulation mesh, and resolving collisions and self-collisions while following the input.",
"title": "Enriching Triangle Mesh Animations with Physically Based Simulation",
"normalizedTitle": "Enriching Triangle Mesh Animations with Physically Based Simulation",
"fno": "07636982",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Animation",
"Computational Modeling",
"Shape",
"Finite Element Analysis",
"Three Dimensional Displays",
"Dynamics",
"Computer Graphics",
"Animation",
"Physically Based Modeling",
"Animation System",
"Directable Simulation",
"FEM",
"Collisions"
],
"authors": [
{
"givenName": "Yijing",
"surname": "Li",
"fullName": "Yijing Li",
"affiliation": "Department of Computer Science, University of Southern California, Los Angeles, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongyi",
"surname": "Xu",
"fullName": "Hongyi Xu",
"affiliation": "Department of Computer Science, University of Southern California, Los Angeles, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jernej",
"surname": "Barbič",
"fullName": "Jernej Barbič",
"affiliation": "Department of Computer Science, University of Southern California, Los Angeles, CA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2017-10-01 00:00:00",
"pubType": "trans",
"pages": "2301-2313",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/smi/2010/7259/0/05521450",
"title": "Semantic-Preserving Mesh Direct Drilling",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2010/05521450/12OmNCdk2vo",
"parentPublication": {
"id": "proceedings/smi/2010/7259/0",
"title": "Shape Modeling International (SMI 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2004/2171/0/21710026",
"title": "Physically-Based Simulation of Objects Represented by Surface Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2004/21710026/12OmNCzb9z0",
"parentPublication": {
"id": "proceedings/cgi/2004/2171/0",
"title": "Proceedings. Computer Graphics International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2008/3381/0/3381a329",
"title": "A Novel Scheme for Fitting Subdivision Surface from Dense Triangle Mesh",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2008/3381a329/12OmNrH1PAs",
"parentPublication": {
"id": "proceedings/cw/2008/3381/0",
"title": "2008 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fccm/2002/1801/0/18010022",
"title": "An FPGA Implementation of Triangle Mesh Decompression",
"doi": null,
"abstractUrl": "/proceedings-article/fccm/2002/18010022/12OmNwHhoTc",
"parentPublication": {
"id": "proceedings/fccm/2002/1801/0",
"title": "Field-Programmable Custom Computing Machines, Annual IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdh/2012/4899/0/4899a432",
"title": "2D Shape Manipulation Using Equilateral Triangle Mesh",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2012/4899a432/12OmNxETa4O",
"parentPublication": {
"id": "proceedings/icdh/2012/4899/0",
"title": "4th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2012/4829/0/4829a198",
"title": "Representing and Manipulating Mesh-Based Character Animations",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2012/4829a198/12OmNznkKdG",
"parentPublication": {
"id": "proceedings/sibgrapi/2012/4829/0",
"title": "2012 25th SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl/1994/6660/0/00363603",
"title": "A framework for constructing animations via declarative mapping rules",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1994/00363603/12OmNzwpUpZ",
"parentPublication": {
"id": "proceedings/vl/1994/6660/0",
"title": "Proceedings of 1994 IEEE Symposium on Visual Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1991/07/i0715",
"title": "Closed-Form Solutions for Physically Based Shape Modeling and Recognition",
"doi": null,
"abstractUrl": "/journal/tp/1991/07/i0715/13rRUxcbnDk",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2012/03/mcg2012030059",
"title": "Sketch-n-Stretch: Sketching Animations Using Cutouts",
"doi": null,
"abstractUrl": "/magazine/cg/2012/03/mcg2012030059/13rRUyeTVks",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itca/2020/0378/0/037800a186",
"title": "Research on Physically-based Computer Animation",
"doi": null,
"abstractUrl": "/proceedings-article/itca/2020/037800a186/1tpBkCNeg9O",
"parentPublication": {
"id": "proceedings/itca/2020/0378/0",
"title": "2020 2nd International Conference on Information Technology and Computer Application (ITCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07593269",
"articleId": "13rRUwbaqUS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07593384",
"articleId": "13rRUxC0Sw1",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRKE",
"name": "ttg201710-07636982s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201710-07636982s1.zip",
"extension": "zip",
"size": "24.8 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRo",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1DjDpHtWZfa",
"doi": "10.1109/TVCG.2022.3174656",
"abstract": "Occluding effects have been frequently used to present weather conditions and environments in cartoon animations, such as raining, snowing, moving leaves, and moving petals. While these effects greatly enrich the visual appeal of the cartoon animations, they may also cause undesired occlusions on the content area, which significantly complicate the analysis and processing of the cartoon animations. In this paper, we make the first attempt to separate the occluding effects and content for cartoon animations. The major challenge of this problem is that, unlike natural effects that are realistic and small-sized, the effects of cartoons are usually stylistic and large-sized. Besides, effects in cartoons are manually drawn, so their motions are more unpredictable than realistic effects. To separate occluding effects and content for cartoon animations, we propose to leverage the difference in the motion patterns of the effects and the content, and capture the locations of the effects based on a multi-scale flow-based effect prediction (MFEP) module. A dual-task learning system is designed to extract the effect video and reconstruct the effect-removed content video at the same time. We apply our method on a large number of cartoon videos of different content and effects. Experiments show that our method significantly outperforms the existing methods. We further demonstrate how the separated effects and content facilitate the analysis and processing of cartoon videos through different applications, including segmentation, inpainting, and effect migration.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Occluding effects have been frequently used to present weather conditions and environments in cartoon animations, such as raining, snowing, moving leaves, and moving petals. While these effects greatly enrich the visual appeal of the cartoon animations, they may also cause undesired occlusions on the content area, which significantly complicate the analysis and processing of the cartoon animations. In this paper, we make the first attempt to separate the occluding effects and content for cartoon animations. The major challenge of this problem is that, unlike natural effects that are realistic and small-sized, the effects of cartoons are usually stylistic and large-sized. Besides, effects in cartoons are manually drawn, so their motions are more unpredictable than realistic effects. To separate occluding effects and content for cartoon animations, we propose to leverage the difference in the motion patterns of the effects and the content, and capture the locations of the effects based on a multi-scale flow-based effect prediction (MFEP) module. A dual-task learning system is designed to extract the effect video and reconstruct the effect-removed content video at the same time. We apply our method on a large number of cartoon videos of different content and effects. Experiments show that our method significantly outperforms the existing methods. We further demonstrate how the separated effects and content facilitate the analysis and processing of cartoon videos through different applications, including segmentation, inpainting, and effect migration.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Occluding effects have been frequently used to present weather conditions and environments in cartoon animations, such as raining, snowing, moving leaves, and moving petals. While these effects greatly enrich the visual appeal of the cartoon animations, they may also cause undesired occlusions on the content area, which significantly complicate the analysis and processing of the cartoon animations. In this paper, we make the first attempt to separate the occluding effects and content for cartoon animations. The major challenge of this problem is that, unlike natural effects that are realistic and small-sized, the effects of cartoons are usually stylistic and large-sized. Besides, effects in cartoons are manually drawn, so their motions are more unpredictable than realistic effects. To separate occluding effects and content for cartoon animations, we propose to leverage the difference in the motion patterns of the effects and the content, and capture the locations of the effects based on a multi-scale flow-based effect prediction (MFEP) module. A dual-task learning system is designed to extract the effect video and reconstruct the effect-removed content video at the same time. We apply our method on a large number of cartoon videos of different content and effects. Experiments show that our method significantly outperforms the existing methods. We further demonstrate how the separated effects and content facilitate the analysis and processing of cartoon videos through different applications, including segmentation, inpainting, and effect migration.",
"title": "Multi-scale Flow-based Occluding Effect and Content Separation for Cartoon Animations",
"normalizedTitle": "Multi-scale Flow-based Occluding Effect and Content Separation for Cartoon Animations",
"fno": "09774005",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Animation",
"Image Restoration",
"Rain",
"Adaptive Optics",
"Visualization",
"Optical Imaging",
"Deep Learning",
"Cartoon Effect Content Separation",
"Cartoon Effect Removal",
"Optical Flow"
],
"authors": [
{
"givenName": "Cheng",
"surname": "Xu",
"fullName": "Cheng Xu",
"affiliation": "School of Computer Science and Engineering, South China University of Technology, 26467 guangzhou, Guangdong, China, 510006",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Qu",
"fullName": "Wei Qu",
"affiliation": "Computer Science and engineering, South China University of Technology, 26467 Guangzhou, Guangdong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xuemiao",
"surname": "Xu",
"fullName": "Xuemiao Xu",
"affiliation": "Computer Science and Engineering, South China University of Technology, 26467 Guangzhou, Guangdong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xueting",
"surname": "Liu",
"fullName": "Xueting Liu",
"affiliation": "Computer Science and engineering, Caritas Institute of Higher Education, 66391 Hong Kong, Hong Kong, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-05-01 00:00:00",
"pubType": "trans",
"pages": "1-1",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacific-graphics/2010/4205/0/4205a001",
"title": "Procedural Modeling of Water Caustics and Foamy Water for Cartoon Animation",
"doi": null,
"abstractUrl": "/proceedings-article/pacific-graphics/2010/4205a001/12OmNCf1Dqs",
"parentPublication": {
"id": "proceedings/pacific-graphics/2010/4205/0",
"title": "Pacific Conference on Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sera/2007/2867/0/28670924",
"title": "An Efficient Expression on Cartoon Rendering Scheme in Game Characters",
"doi": null,
"abstractUrl": "/proceedings-article/sera/2007/28670924/12OmNqBKTX2",
"parentPublication": {
"id": "proceedings/sera/2007/2867/0",
"title": "5th ACIS International Conference on Software Engineering Research, Management & Applications (SERA 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cicn/2014/6929/0/6929a697",
"title": "Design of an Automatic Cartoon Movie Builder (ACMB) System for Generation of a Cartoon Movie from a Given Story",
"doi": null,
"abstractUrl": "/proceedings-article/cicn/2014/6929a697/12OmNvjyxQU",
"parentPublication": {
"id": "proceedings/cicn/2014/6929/0",
"title": "2014 International Conference on Computational Intelligence and Communication Networks (CICN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/siie/2012/7/0/06403185",
"title": "Adaptive program animations: A proposal based on learning styles",
"doi": null,
"abstractUrl": "/proceedings-article/siie/2012/06403185/12OmNx3q722",
"parentPublication": {
"id": "proceedings/siie/2012/7/0",
"title": "2012 International Symposium on Computers in Education (SIIE 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/04/ttg2009040618",
"title": "Vectorizing Cartoon Animations",
"doi": null,
"abstractUrl": "/journal/tg/2009/04/ttg2009040618/13rRUIJcWlh",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/03/06910280",
"title": "2.5D Cartoon Hair Modeling and Manipulation",
"doi": null,
"abstractUrl": "/journal/tg/2015/03/06910280/13rRUIJuxpC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/07/ttg2012071156",
"title": "EXCOL: An EXtract-and-COmplete Layering Approach to Cartoon Animation Reusing",
"doi": null,
"abstractUrl": "/journal/tg/2012/07/ttg2012071156/13rRUwgQpDt",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/05/v0540",
"title": "Stroke Surfaces: Temporally Coherent Artistic Animations from Video",
"doi": null,
"abstractUrl": "/journal/tg/2005/05/v0540/13rRUy0HYRf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/lt/2010/02/tlt2010020139",
"title": "Layered Architecture for Automatic Generation of Conflictive Animations in Programming Education",
"doi": null,
"abstractUrl": "/journal/lt/2010/02/tlt2010020139/13rRUynpT9H",
"parentPublication": {
"id": "trans/lt",
"title": "IEEE Transactions on Learning Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2020/6553/0/09093346",
"title": "Neural Puppet: Generative Layered Cartoon Characters",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2020/09093346/1jPbkInDnXy",
"parentPublication": {
"id": "proceedings/wacv/2020/6553/0",
"title": "2020 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09773959",
"articleId": "1DjDpvFkiwE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09779102",
"articleId": "1DvgCK2YAyQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Dqhdqm9K6Y",
"name": "ttg555501-09774005s1-supp2-3174656.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09774005s1-supp2-3174656.mp4",
"extension": "mp4",
"size": "30.1 MB",
"__typename": "WebExtraType"
},
{
"id": "1DqhdCWt2Gk",
"name": "ttg555501-09774005s1-supp1-3174656.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09774005s1-supp1-3174656.pdf",
"extension": "pdf",
"size": "2.05 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNz6iOyg",
"title": "March/April",
"year": "2003",
"issueNum": "02",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "5",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIJuxyT",
"doi": "10.1109/MCISE.2003.1182967",
"abstract": "\"The Lattice Boltzmann Equation: For Fluid Dynamics and Beyond\", by Sauro SucciOxford University Press, New York, 2001, ISBN: 0198503989, US$100During the past 10 years, a new class of algorithms based on the lattice Loltzmann equation (LBE) has been developed for computational fluid dynamics (CFD). These novel and fascinating algorithms were inspired by kinetic theory?a branch of statistical physics. They defy the conventional wisdom of CFD in that they provide stable, fully explicit differencing schemes, with no need for elliptic solvers or upwind differencing. Yet, they are also remarkably simple. In fact, the typical reaction of long-time CFDpractitioners when encountering lattice Boltzmann algorithms for the .rst time is often something like, \"that can?t possibly work. It's too easy.\" ",
"abstracts": [
{
"abstractType": "Regular",
"content": "\"The Lattice Boltzmann Equation: For Fluid Dynamics and Beyond\", by Sauro SucciOxford University Press, New York, 2001, ISBN: 0198503989, US$100During the past 10 years, a new class of algorithms based on the lattice Loltzmann equation (LBE) has been developed for computational fluid dynamics (CFD). These novel and fascinating algorithms were inspired by kinetic theory?a branch of statistical physics. They defy the conventional wisdom of CFD in that they provide stable, fully explicit differencing schemes, with no need for elliptic solvers or upwind differencing. Yet, they are also remarkably simple. In fact, the typical reaction of long-time CFDpractitioners when encountering lattice Boltzmann algorithms for the .rst time is often something like, \"that can?t possibly work. It's too easy.\" ",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "\"The Lattice Boltzmann Equation: For Fluid Dynamics and Beyond\", by Sauro SucciOxford University Press, New York, 2001, ISBN: 0198503989, US$100During the past 10 years, a new class of algorithms based on the lattice Loltzmann equation (LBE) has been developed for computational fluid dynamics (CFD). These novel and fascinating algorithms were inspired by kinetic theory?a branch of statistical physics. They defy the conventional wisdom of CFD in that they provide stable, fully explicit differencing schemes, with no need for elliptic solvers or upwind differencing. Yet, they are also remarkably simple. In fact, the typical reaction of long-time CFDpractitioners when encountering lattice Boltzmann algorithms for the .rst time is often something like, \"that can?t possibly work. It's too easy.\" ",
"title": "A Look at Lattice Boltzmann Equations",
"normalizedTitle": "A Look at Lattice Boltzmann Equations",
"fno": "c2086",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [],
"authors": [
{
"givenName": "Bruce M.",
"surname": "Boghosian",
"fullName": "Bruce M. Boghosian",
"affiliation": "Tufts University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2003-03-01 00:00:00",
"pubType": "mags",
"pages": "86-87",
"year": "2003",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "c2080",
"articleId": "13rRUwwJWIP",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "c2088",
"articleId": "13rRUxcKzSa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyxXlp9",
"title": "Aug.",
"year": "2018",
"issueNum": "08",
"idPrefix": "td",
"pubType": "journal",
"volume": "29",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIM2VBp",
"doi": "10.1109/TPDS.2018.2810237",
"abstract": "We describe a high-performance implementation of the lattice Boltzmann method (LBM) for sparse geometries on graphic processors. In our implementation we cover the whole geometry with a uniform mesh of small tiles and carry out calculations for each tile independently with proper data synchronization at the tile edges. For this method, we provide both a theoretical analysis of complexity and the results for real implementations involving two-dimensional (2D) and three-dimensional (3D) geometries. Based on the theoretical model, we show that tiles offer significantly smaller bandwidth overheads than solutions based on indirect addressing. For 2D lattice arrangements, a reduction in memory usage is also possible, although at the cost of diminished performance. We achieved a performance of 682 MLUPS on GTX Titan (72 percent of peak theoretical memory bandwidth) for the D3Q19 lattice arrangement and double-precision data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We describe a high-performance implementation of the lattice Boltzmann method (LBM) for sparse geometries on graphic processors. In our implementation we cover the whole geometry with a uniform mesh of small tiles and carry out calculations for each tile independently with proper data synchronization at the tile edges. For this method, we provide both a theoretical analysis of complexity and the results for real implementations involving two-dimensional (2D) and three-dimensional (3D) geometries. Based on the theoretical model, we show that tiles offer significantly smaller bandwidth overheads than solutions based on indirect addressing. For 2D lattice arrangements, a reduction in memory usage is also possible, although at the cost of diminished performance. We achieved a performance of 682 MLUPS on GTX Titan (72 percent of peak theoretical memory bandwidth) for the D3Q19 lattice arrangement and double-precision data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We describe a high-performance implementation of the lattice Boltzmann method (LBM) for sparse geometries on graphic processors. In our implementation we cover the whole geometry with a uniform mesh of small tiles and carry out calculations for each tile independently with proper data synchronization at the tile edges. For this method, we provide both a theoretical analysis of complexity and the results for real implementations involving two-dimensional (2D) and three-dimensional (3D) geometries. Based on the theoretical model, we show that tiles offer significantly smaller bandwidth overheads than solutions based on indirect addressing. For 2D lattice arrangements, a reduction in memory usage is also possible, although at the cost of diminished performance. We achieved a performance of 682 MLUPS on GTX Titan (72 percent of peak theoretical memory bandwidth) for the D3Q19 lattice arrangement and double-precision data.",
"title": "Sparse Geometries Handling in Lattice Boltzmann Method Implementation for Graphic Processors",
"normalizedTitle": "Sparse Geometries Handling in Lattice Boltzmann Method Implementation for Graphic Processors",
"fno": "08303717",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Geometry",
"Computational Modeling",
"Graphics Processing Units",
"Bandwidth",
"Memory Management",
"Lattice Boltzmann Methods",
"GPU",
"CUDA",
"LBM",
"CFD",
"Parallel Computing"
],
"authors": [
{
"givenName": "Tadeusz",
"surname": "Tomczak",
"fullName": "Tadeusz Tomczak",
"affiliation": "Faculty of Electronics, Computer Engineering at Wroclaw University of Science and Technology, Wroclaw, Poland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Roman G.",
"surname": "Szafran",
"fullName": "Roman G. Szafran",
"affiliation": "Faculty of Chemistry, Department of Chemical Engineering, Wroclaw University of Science and Technology, Wroclaw, Poland",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2018-08-01 00:00:00",
"pubType": "trans",
"pages": "1865-1878",
"year": "2018",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isise/2008/3494/1/3494a033",
"title": "High Performance Lattice Boltzmann Algorithms for Fluid Flows",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2008/3494a033/12OmNApu5CQ",
"parentPublication": {
"id": "proceedings/isise/2008/3494/1",
"title": "2008 International Symposium on Information Science and Engieering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdp/2015/8491/0/8491a604",
"title": "Lattice Boltzmann Simulations at Petascale on Multi-GPU Systems with Asynchronous Data Transfer and Strictly Enforced Memory Read Alignment",
"doi": null,
"abstractUrl": "/proceedings-article/pdp/2015/8491a604/12OmNvSKNYX",
"parentPublication": {
"id": "proceedings/pdp/2015/8491/0",
"title": "2015 23rd Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hipc/2015/8488/0/8488a315",
"title": "Memory-Efficient Parallelization of 3D Lattice Boltzmann Flow Solver on a GPU",
"doi": null,
"abstractUrl": "/proceedings-article/hipc/2015/8488a315/12OmNyRPgxl",
"parentPublication": {
"id": "proceedings/hipc/2015/8488/0",
"title": "2015 IEEE 22nd International Conference on High Performance Computing (HiPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icie/2009/3679/1/3679a107",
"title": "Parallel Lattice Boltzmann Simulation for Fluid Flow on Multicore Platform",
"doi": null,
"abstractUrl": "/proceedings-article/icie/2009/3679a107/12OmNyaoDxI",
"parentPublication": {
"id": "proceedings/icie/2009/3679/1",
"title": "2009 WASE International Conference on Information Engineering (ICIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcmp-ugc/2007/3088/0/30880052",
"title": "Lattice Boltzmann Algorithms for Fluid Turbulence",
"doi": null,
"abstractUrl": "/proceedings-article/hpcmp-ugc/2007/30880052/12OmNzBwGKy",
"parentPublication": {
"id": "proceedings/hpcmp-ugc/2007/3088/0",
"title": "HPCMP Users Group Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2018/4368/0/436801a825",
"title": "GPU Data Access on Complex Geometries for D3Q19 Lattice Boltzmann Method",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2018/436801a825/12OmNzd7bJy",
"parentPublication": {
"id": "proceedings/ipdps/2018/4368/0",
"title": "2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isise/2008/3494/2/3494b793",
"title": "Multiple-GPUs Algorithm for Lattice Boltzmann Method",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2008/3494b793/12OmNzvQI9e",
"parentPublication": {
"id": "proceedings/isise/2008/3494/2",
"title": "2008 International Symposium on Information Science and Engineering (ISISE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/02/v0164",
"title": "The Lattice-Boltzmann Method for Simulating Gaseous Phenomena",
"doi": null,
"abstractUrl": "/journal/tg/2004/02/v0164/13rRUwh80H2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/02/ttg2014020289",
"title": "Turbulence Simulation by Adaptive Multi-Relaxation Lattice Boltzmann Modeling",
"doi": null,
"abstractUrl": "/journal/tg/2014/02/ttg2014020289/13rRUxBrGgX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/03/09492751",
"title": "Propagation Pattern for Moment Representation of the Lattice Boltzmann Method",
"doi": null,
"abstractUrl": "/journal/td/2022/03/09492751/1vq0IzdZTna",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08295269",
"articleId": "13rRUytF41n",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08301559",
"articleId": "13rRUwgyOj5",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBBhN8N",
"title": "Dec.",
"year": "2020",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1ncguu1AZdS",
"doi": "10.1109/TVCG.2020.3023573",
"abstract": "Video portraits are common in a variety of applications, such as videoconferencing, news broadcasting, and virtual education and training. We present a novel method to synthesize photorealistic video portraits for an input portrait video, automatically driven by a person's voice. The main challenge in this task is the hallucination of plausible, photorealistic facial expressions from input speech audio. To address this challenge, we employ a parametric 3D face model represented by geometry, facial expression, illumination, etc., and learn a mapping from audio features to model parameters. The input source audio is first represented as a high-dimensional feature, which is used to predict facial expression parameters of the 3D face model. We then replace the expression parameters computed from the original target video with the predicted one, and rerender the reenacted face. Finally, we generate a photorealistic video portrait from the reenacted synthetic face sequence via a neural face renderer. One appealing feature of our approach is the generalization capability for various input speech audio, including synthetic speech audio from text-to-speech software. Extensive experimental results show that our approach outperforms previous general-purpose audio-driven video portrait methods. This includes a user study demonstrating that our results are rated as more realistic than previous methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Video portraits are common in a variety of applications, such as videoconferencing, news broadcasting, and virtual education and training. We present a novel method to synthesize photorealistic video portraits for an input portrait video, automatically driven by a person's voice. The main challenge in this task is the hallucination of plausible, photorealistic facial expressions from input speech audio. To address this challenge, we employ a parametric 3D face model represented by geometry, facial expression, illumination, etc., and learn a mapping from audio features to model parameters. The input source audio is first represented as a high-dimensional feature, which is used to predict facial expression parameters of the 3D face model. We then replace the expression parameters computed from the original target video with the predicted one, and rerender the reenacted face. Finally, we generate a photorealistic video portrait from the reenacted synthetic face sequence via a neural face renderer. One appealing feature of our approach is the generalization capability for various input speech audio, including synthetic speech audio from text-to-speech software. Extensive experimental results show that our approach outperforms previous general-purpose audio-driven video portrait methods. This includes a user study demonstrating that our results are rated as more realistic than previous methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Video portraits are common in a variety of applications, such as videoconferencing, news broadcasting, and virtual education and training. We present a novel method to synthesize photorealistic video portraits for an input portrait video, automatically driven by a person's voice. The main challenge in this task is the hallucination of plausible, photorealistic facial expressions from input speech audio. To address this challenge, we employ a parametric 3D face model represented by geometry, facial expression, illumination, etc., and learn a mapping from audio features to model parameters. The input source audio is first represented as a high-dimensional feature, which is used to predict facial expression parameters of the 3D face model. We then replace the expression parameters computed from the original target video with the predicted one, and rerender the reenacted face. Finally, we generate a photorealistic video portrait from the reenacted synthetic face sequence via a neural face renderer. One appealing feature of our approach is the generalization capability for various input speech audio, including synthetic speech audio from text-to-speech software. Extensive experimental results show that our approach outperforms previous general-purpose audio-driven video portrait methods. This includes a user study demonstrating that our results are rated as more realistic than previous methods.",
"title": "Photorealistic Audio-driven Video Portraits",
"normalizedTitle": "Photorealistic Audio-driven Video Portraits",
"fno": "09199560",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Image Representation",
"Image Sequences",
"Text To Speech Software",
"Input Speech Audio Synthesis",
"Synthetic Face Sequence",
"General Purpose Audio Driven Video Portrait Methods",
"Neural Face Renderer",
"Facial Expression Parameters",
"Parametric 3 D Face Model",
"Photorealistic Facial Expressions",
"Virtual Education",
"Photorealistic Audio Driven Video Portraits",
"Face Recognition",
"Three Dimensional Displays",
"Visualization",
"Streaming Media",
"Rendering Computer Graphics",
"Image Reconstruction",
"Training Data",
"Audio Driven Animation",
"Facial Reenactment",
"Generative Models",
"Talking Head Video Generation"
],
"authors": [
{
"givenName": "Xin",
"surname": "Wen",
"fullName": "Xin Wen",
"affiliation": "State Key Laboratory of Virtual Reality Technology and Systems, School of Computer Science and Engineering, Beihang University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Miao",
"surname": "Wang",
"fullName": "Miao Wang",
"affiliation": "State Key Laboratory of Virtual Reality Technology and Systems, Research Institute for Frontier Science, Beihang University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christian",
"surname": "Richardt",
"fullName": "Christian Richardt",
"affiliation": "Department of Computer Science, University of Bath, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ze-Yin",
"surname": "Chen",
"fullName": "Ze-Yin Chen",
"affiliation": "State Key Laboratory of Virtual Reality Technology and Systems, School of Computer Science and Engineering, Beihang University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shi-Min",
"surname": "Hu",
"fullName": "Shi-Min Hu",
"affiliation": "BNRist, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2020-12-01 00:00:00",
"pubType": "trans",
"pages": "3457-3466",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/imis/2011/4372/0/4372a136",
"title": "\"Memoxo\" - Browser-Based Prototype for the Audio/Video Messages Recording",
"doi": null,
"abstractUrl": "/proceedings-article/imis/2011/4372a136/12OmNyrqznF",
"parentPublication": {
"id": "proceedings/imis/2011/4372/0",
"title": "Innovative Mobile and Internet Services in Ubiquitous Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2011/348/0/06011841",
"title": "Automatic consumer video summarization by audio and visual analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2011/06011841/12OmNzvz6I2",
"parentPublication": {
"id": "proceedings/icme/2011/348/0",
"title": "2011 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200n3739",
"title": "PIRenderer: Controllable Portrait Image Generation via Semantic Neural Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200n3739/1BmG7WKSuR2",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600g114",
"title": "Volumetric Bundle Adjustment for Online Photorealistic Scene Capture",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600g114/1H1kcv3MPL2",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600u0332",
"title": "RigNeRF: Fully Controllable Neural 3D Portraits",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600u0332/1H1mHD2RrtS",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300h848",
"title": "Learning Perspective Undistortion of Portraits",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300h848/1hVl8HQ7A9q",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800g141",
"title": "StyleRig: Rigging StyleGAN for 3D Control Over Portrait Images",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800g141/1m3ng5xOC08",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2021/0477/0/047700b088",
"title": "Real-time Localized Photorealistic Video Style Transfer",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2021/047700b088/1uqGhhWte3S",
"parentPublication": {
"id": "proceedings/wacv/2021/0477/0",
"title": "2021 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2021/0477/0/047700a041",
"title": "Audio- and Gaze-driven Facial Animation of Codec Avatars",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2021/047700a041/1uqGiEGRWQ8",
"parentPublication": {
"id": "proceedings/wacv/2021/0477/0",
"title": "2021 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900o4075",
"title": "Audio-Driven Emotional Video Portraits",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900o4075/1yeIzfSGjw4",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09201064",
"articleId": "1niUpdweh2g",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09206143",
"articleId": "1npxM6fDN7i",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1BtbeKGFJzW",
"title": "April",
"year": "2022",
"issueNum": "04",
"idPrefix": "tp",
"pubType": "journal",
"volume": "44",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1oeZCjwg4MM",
"doi": "10.1109/TPAMI.2020.3033882",
"abstract": "Lensless imaging has emerged as a potential solution towards realizing ultra-miniature cameras by eschewing the bulky lens in a traditional camera. Without a focusing lens, the lensless cameras rely on computational algorithms to recover the scenes from multiplexed measurements. However, the current iterative-optimization-based reconstruction algorithms produce noisier and perceptually poorer images. In this work, we propose a non-iterative deep learning-based reconstruction approach that results in orders of magnitude improvement in image quality for lensless reconstructions. Our approach, called <italic>FlatNet</italic>, lays down a framework for reconstructing high-quality photorealistic images from mask-based lensless cameras, where the camera's forward model formulation is known. FlatNet consists of two stages: (1) an inversion stage that maps the measurement into a space of intermediate reconstruction by learning parameters within the forward model formulation, and (2) a perceptual enhancement stage that improves the perceptual quality of this intermediate reconstruction. These stages are trained together in an end-to-end manner. We show high-quality reconstructions by performing extensive experiments on real and challenging scenes using two different types of lensless prototypes: one which uses a separable forward model and another, which uses a more general non-separable cropped-convolution model. Our end-to-end approach is fast, produces photorealistic reconstructions, and is easy to adopt for other mask-based lensless cameras.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Lensless imaging has emerged as a potential solution towards realizing ultra-miniature cameras by eschewing the bulky lens in a traditional camera. Without a focusing lens, the lensless cameras rely on computational algorithms to recover the scenes from multiplexed measurements. However, the current iterative-optimization-based reconstruction algorithms produce noisier and perceptually poorer images. In this work, we propose a non-iterative deep learning-based reconstruction approach that results in orders of magnitude improvement in image quality for lensless reconstructions. Our approach, called <italic>FlatNet</italic>, lays down a framework for reconstructing high-quality photorealistic images from mask-based lensless cameras, where the camera's forward model formulation is known. FlatNet consists of two stages: (1) an inversion stage that maps the measurement into a space of intermediate reconstruction by learning parameters within the forward model formulation, and (2) a perceptual enhancement stage that improves the perceptual quality of this intermediate reconstruction. These stages are trained together in an end-to-end manner. We show high-quality reconstructions by performing extensive experiments on real and challenging scenes using two different types of lensless prototypes: one which uses a separable forward model and another, which uses a more general non-separable cropped-convolution model. Our end-to-end approach is fast, produces photorealistic reconstructions, and is easy to adopt for other mask-based lensless cameras.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Lensless imaging has emerged as a potential solution towards realizing ultra-miniature cameras by eschewing the bulky lens in a traditional camera. Without a focusing lens, the lensless cameras rely on computational algorithms to recover the scenes from multiplexed measurements. However, the current iterative-optimization-based reconstruction algorithms produce noisier and perceptually poorer images. In this work, we propose a non-iterative deep learning-based reconstruction approach that results in orders of magnitude improvement in image quality for lensless reconstructions. Our approach, called FlatNet, lays down a framework for reconstructing high-quality photorealistic images from mask-based lensless cameras, where the camera's forward model formulation is known. FlatNet consists of two stages: (1) an inversion stage that maps the measurement into a space of intermediate reconstruction by learning parameters within the forward model formulation, and (2) a perceptual enhancement stage that improves the perceptual quality of this intermediate reconstruction. These stages are trained together in an end-to-end manner. We show high-quality reconstructions by performing extensive experiments on real and challenging scenes using two different types of lensless prototypes: one which uses a separable forward model and another, which uses a more general non-separable cropped-convolution model. Our end-to-end approach is fast, produces photorealistic reconstructions, and is easy to adopt for other mask-based lensless cameras.",
"title": "FlatNet: Towards Photorealistic Scene Reconstruction From Lensless Measurements",
"normalizedTitle": "FlatNet: Towards Photorealistic Scene Reconstruction From Lensless Measurements",
"fno": "09239993",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Cameras",
"Deep Learning Artificial Intelligence",
"Image Reconstruction",
"Iterative Methods",
"Realistic Images",
"Lensless Measurements",
"Lensless Imaging",
"Ultra Miniature Cameras",
"Bulky Lens",
"Focusing Lens",
"Computational Algorithms",
"Multiplexed Measurements",
"Perceptually Poorer Images",
"Deep Learning Based Reconstruction",
"Image Quality",
"Lensless Reconstructions",
"High Quality Photorealistic Images",
"Mask Based Lensless Cameras",
"Forward Model Formulation",
"Perceptual Enhancement Stage",
"Perceptual Quality",
"High Quality Reconstructions",
"Lensless Prototypes",
"Flat Net",
"Iterative Optimization Based Reconstruction Algorithms",
"Photorealistic Scene Reconstruction",
"Cameras",
"Image Reconstruction",
"Lenses",
"Multiplexing",
"Computational Modeling",
"Mathematical Model",
"Lensless Imaging",
"Image Reconstruction"
],
"authors": [
{
"givenName": "Salman Siddique",
"surname": "Khan",
"fullName": "Salman Siddique Khan",
"affiliation": "Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai, Tamil Nadu, India",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Varun",
"surname": "Sundar",
"fullName": "Varun Sundar",
"affiliation": "Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai, Tamil Nadu, India",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vivek",
"surname": "Boominathan",
"fullName": "Vivek Boominathan",
"affiliation": "Rice University, Houston, TX, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ashok",
"surname": "Veeraraghavan",
"fullName": "Ashok Veeraraghavan",
"affiliation": "Rice University, Houston, TX, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kaushik",
"surname": "Mitra",
"fullName": "Kaushik Mitra",
"affiliation": "Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai, Tamil Nadu, India",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2022-04-01 00:00:00",
"pubType": "trans",
"pages": "1934-1948",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visapp/2014/8133/3/07295123",
"title": "3D reconstruction of dynamic scenes from two asynchronous video-streams",
"doi": null,
"abstractUrl": "/proceedings-article/visapp/2014/07295123/12OmNBr4eDn",
"parentPublication": {
"id": "proceedings/visapp/2014/8133/2",
"title": "2014 International Conference on Computer Vision Theory and Applications (VISAPP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391a900",
"title": "General Dynamic Scene Reconstruction from Multiple View Video",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391a900/12OmNrkT7KL",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1997/7822/0/78221067",
"title": "Photorealistic Scene Reconstruction by Voxel Coloring",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1997/78221067/12OmNzcPACL",
"parentPublication": {
"id": "proceedings/cvpr/1997/7822/0",
"title": "Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/04/ttg2009040654",
"title": "Photorealistic Large-Scale Urban City Model Reconstruction",
"doi": null,
"abstractUrl": "/journal/tg/2009/04/ttg2009040654/13rRUwj7cp7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200c583",
"title": "A Simple Framework for 3D Lensless Imaging with Programmable Masks",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200c583/1BmJgsD5xSw",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2019/3263/0/08747341",
"title": "Video from Stills: Lensless Imaging with Rolling Shutter",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2019/08747341/1bcJwMUIgh2",
"parentPublication": {
"id": "proceedings/iccp/2019/3263/0",
"title": "2019 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300h859",
"title": "Towards Photorealistic Reconstruction of Highly Multiplexed Lensless Images",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300h859/1hVlDgdiU2A",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2020/07/09064909",
"title": "SweepCam — Depth-Aware Lensless Imaging Using Programmable Masks",
"doi": null,
"abstractUrl": "/journal/tp/2020/07/09064909/1iZGvNAjnXi",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2020/07/09076617",
"title": "PhlatCam: Designed Phase-Mask Based Thin Lensless Camera",
"doi": null,
"abstractUrl": "/journal/tp/2020/07/09076617/1keqsbVyiaI",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2021/0477/0/047700a403",
"title": "Robust Lensless Image Reconstruction via PSF Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2021/047700a403/1uqGupYUGFa",
"parentPublication": {
"id": "proceedings/wacv/2021/0477/0",
"title": "2021 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09229517",
"articleId": "1o3njhZouys",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09207842",
"articleId": "1nuwrIVMy8U",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1BtbpDlMJna",
"name": "ttp202204-09239993s1-supp1-3033882.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp202204-09239993s1-supp1-3033882.pdf",
"extension": "pdf",
"size": "6.9 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyGtjf5",
"title": "April",
"year": "2019",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "181W9mA5cKk",
"doi": "10.1109/TVCG.2018.2818701",
"abstract": "Advances in high-throughput imaging allow researchers to collect three-dimensional images of whole organ microvascular networks. These extremely large images contain networks that are highly complex, time consuming to segment, and difficult to visualize. In this paper, we present a framework for segmenting and visualizing vascular networks from terabyte-sized three-dimensional images collected using high-throughput microscopy. While these images require terabytes of storage, the volume devoted to the fiber network is <inline-formula><tex-math notation=\"LaTeX\">Z_$\\approx 4$_Z</tex-math></inline-formula> percent of the total volume size. While the networks themselves are sparse, they are tremendously complex, interconnected, and vary widely in diameter. We describe a parallel GPU-based predictor-corrector method for tracing filaments that is robust to noise and sampling errors common in these data sets. We also propose a number of visualization techniques designed to convey the complex statistical descriptions of fibers across large tissue sections—including commonly studied microvascular characteristics, such as orientation and volume.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Advances in high-throughput imaging allow researchers to collect three-dimensional images of whole organ microvascular networks. These extremely large images contain networks that are highly complex, time consuming to segment, and difficult to visualize. In this paper, we present a framework for segmenting and visualizing vascular networks from terabyte-sized three-dimensional images collected using high-throughput microscopy. While these images require terabytes of storage, the volume devoted to the fiber network is <inline-formula><tex-math notation=\"LaTeX\">$\\approx 4$</tex-math><alternatives> <inline-graphic xlink:href=\"govyadinov-ieq1-2818701.gif\"/></alternatives></inline-formula> percent of the total volume size. While the networks themselves are sparse, they are tremendously complex, interconnected, and vary widely in diameter. We describe a parallel GPU-based predictor-corrector method for tracing filaments that is robust to noise and sampling errors common in these data sets. We also propose a number of visualization techniques designed to convey the complex statistical descriptions of fibers across large tissue sections—including commonly studied microvascular characteristics, such as orientation and volume.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Advances in high-throughput imaging allow researchers to collect three-dimensional images of whole organ microvascular networks. These extremely large images contain networks that are highly complex, time consuming to segment, and difficult to visualize. In this paper, we present a framework for segmenting and visualizing vascular networks from terabyte-sized three-dimensional images collected using high-throughput microscopy. While these images require terabytes of storage, the volume devoted to the fiber network is - percent of the total volume size. While the networks themselves are sparse, they are tremendously complex, interconnected, and vary widely in diameter. We describe a parallel GPU-based predictor-corrector method for tracing filaments that is robust to noise and sampling errors common in these data sets. We also propose a number of visualization techniques designed to convey the complex statistical descriptions of fibers across large tissue sections—including commonly studied microvascular characteristics, such as orientation and volume.",
"title": "Robust Tracing and Visualization of Heterogeneous Microvascular Networks",
"normalizedTitle": "Robust Tracing and Visualization of Heterogeneous Microvascular Networks",
"fno": "08326724",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Diseases",
"Robustness",
"Microscopy",
"Image Segmentation",
"Biomedical Imaging",
"Anisotropic Magnetoresistance",
"Microvessel",
"Network Tracking",
"Glyph Visualization",
"Predictor Corrector",
"Segmantation",
"Spherical Harmonics",
"Superquadrics",
"KESM"
],
"authors": [
{
"givenName": "Pavel A.",
"surname": "Govyadinov",
"fullName": "Pavel A. Govyadinov",
"affiliation": "Department of Computer Science, University of Houston, Houston, TX",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tasha",
"surname": "Womack",
"fullName": "Tasha Womack",
"affiliation": "Department of Pharmacological and Pharmaceutical Sciences, University of Houston, Houston, TX",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jason L.",
"surname": "Eriksen",
"fullName": "Jason L. Eriksen",
"affiliation": "Department of Pharmacological and Pharmaceutical Sciences, University of Houston, Houston, TX",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guoning",
"surname": "Chen",
"fullName": "Guoning Chen",
"affiliation": "Department of Computer Science, University of Houston, Houston, TX",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Mayerich",
"fullName": "David Mayerich",
"affiliation": "Department of Electrical and Computer Engineering, University of Houston, Houston, TX",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2019-04-01 00:00:00",
"pubType": "trans",
"pages": "1760-1773",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2008/06/ttg2008061611",
"title": "Visualization of Cellular and Microvascular Relationships",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061611/13rRUwghd4W",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/5555/01/09795863",
"title": "An Incentive Auction for Heterogeneous Client Selection in Federated Learning",
"doi": null,
"abstractUrl": "/journal/tm/5555/01/09795863/1EcpaqQI25y",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/5555/01/09933877",
"title": "Matrix-Based Secret Sharing for Reversible Data Hiding in Encrypted Images",
"doi": null,
"abstractUrl": "/journal/tq/5555/01/09933877/1HWLN6aNgDS",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/09965747",
"title": "<inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {X}$_Z</tex-math></inline-formula>-Metric: An N-Dimensional Information-Theoretic Framework for Groupwise Registration and Deep Combined Computing",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/09965747/1IHMPhf3uW4",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/5555/01/10093038",
"title": "Privacy-Preserving and Byzantine-Robust Federated Learning",
"doi": null,
"abstractUrl": "/journal/tq/5555/01/10093038/1M61YImr8dO",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933682",
"title": "Graph-Assisted Visualization of Microvascular Networks",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933682/1fTgIZDrG9O",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2022/01/09128029",
"title": "Queuing Over Ever-Changing Communication Scenarios in Tactical Networks",
"doi": null,
"abstractUrl": "/journal/tm/2022/01/09128029/1l3uixrN1eg",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/08/09210070",
"title": "Periodic Communities Mining in Temporal Networks: Concepts and Algorithms",
"doi": null,
"abstractUrl": "/journal/tk/2022/08/09210070/1nxQ8MeuyY0",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/08/09353253",
"title": "Deep Polynomial Neural Networks",
"doi": null,
"abstractUrl": "/journal/tp/2022/08/09353253/1r8kp3TeKGY",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09580703",
"title": "Efficient and Optimal Algorithms for Tree Summarization With Weighted Terminologies",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09580703/1xPnZzu3u9O",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08323196",
"articleId": "17YCN5yqdZm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08327892",
"articleId": "17YCN5yqdZn",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "181W9pUJbrk",
"name": "ttg201904-08326724s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201904-08326724s1.zip",
"extension": "zip",
"size": "292 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgK8",
"title": "Dec.",
"year": "2014",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUB7a1fS",
"doi": "10.1109/TVCG.2014.2346412",
"abstract": "Parallel vectors (PV), the loci where two vector fields are parallel, are commonly used to represent curvilinear features in 3D for data visualization. Methods for extracting PV usually operate on a 3D grid and start with detecting seed points on a cell face. We propose, to the best of our knowledge, the first provably correct test that determines the parity of the number of PV points on a cell face. The test only needs to sample along the face boundary and works for any choice of the two vector fields. A discretization of the test is described, validated, and compared with existing tests that are also based on boundary sampling. The test can guide PV-extraction algorithms to ensure closed curves wherever the input fields are continuous, which we exemplify in extracting ridges and valleys of scalar functions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Parallel vectors (PV), the loci where two vector fields are parallel, are commonly used to represent curvilinear features in 3D for data visualization. Methods for extracting PV usually operate on a 3D grid and start with detecting seed points on a cell face. We propose, to the best of our knowledge, the first provably correct test that determines the parity of the number of PV points on a cell face. The test only needs to sample along the face boundary and works for any choice of the two vector fields. A discretization of the test is described, validated, and compared with existing tests that are also based on boundary sampling. The test can guide PV-extraction algorithms to ensure closed curves wherever the input fields are continuous, which we exemplify in extracting ridges and valleys of scalar functions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Parallel vectors (PV), the loci where two vector fields are parallel, are commonly used to represent curvilinear features in 3D for data visualization. Methods for extracting PV usually operate on a 3D grid and start with detecting seed points on a cell face. We propose, to the best of our knowledge, the first provably correct test that determines the parity of the number of PV points on a cell face. The test only needs to sample along the face boundary and works for any choice of the two vector fields. A discretization of the test is described, validated, and compared with existing tests that are also based on boundary sampling. The test can guide PV-extraction algorithms to ensure closed curves wherever the input fields are continuous, which we exemplify in extracting ridges and valleys of scalar functions.",
"title": "A Robust Parity Test for Extracting Parallel Vectors in 3D",
"normalizedTitle": "A Robust Parity Test for Extracting Parallel Vectors in 3D",
"fno": "06875965",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Parity Check Codes",
"Parallel Processing",
"Vectors",
"Algorithm Design And Analysis",
"Three Dimensional Displays",
"Parity Test",
"Parallel Vectors",
"Feature Curve Extraction",
"Ridges And Valleys"
],
"authors": [
{
"givenName": "Tao",
"surname": "Ju",
"fullName": "Tao Ju",
"affiliation": ", Washington University in St. Louis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Minxin",
"surname": "Cheng",
"fullName": "Minxin Cheng",
"affiliation": ", University of Missouri at Columbia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xu",
"surname": "Wang",
"fullName": "Xu Wang",
"affiliation": ", University of Missouri at Columbia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ye",
"surname": "Duan",
"fullName": "Ye Duan",
"affiliation": ", University of Missouri at Columbia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "2526-2534",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ewdts/2008/3402/0/05580162",
"title": "Parity prediction method for on-line testing of a Barrel-shifter",
"doi": null,
"abstractUrl": "/proceedings-article/ewdts/2008/05580162/12OmNAlvI51",
"parentPublication": {
"id": "proceedings/ewdts/2008/3402/0",
"title": "IEEE East-West Design & Test Symposium (EWDTS 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccce/2016/2427/0/2427a470",
"title": "Low Rank Parity Check Codes Against Reed-Solomon Codes for Narrow-Band PLC Smart Grid Networks",
"doi": null,
"abstractUrl": "/proceedings-article/iccce/2016/2427a470/12OmNBRsVAD",
"parentPublication": {
"id": "proceedings/iccce/2016/2427/0",
"title": "2016 International Conference on Computer and Communication Engineering (ICCCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icece/2010/4031/0/4031f498",
"title": "Research on Encoding for Low-Density Parity-Check Codes",
"doi": null,
"abstractUrl": "/proceedings-article/icece/2010/4031f498/12OmNwt5sgU",
"parentPublication": {
"id": "proceedings/icece/2010/4031/0",
"title": "Electrical and Control Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/2004/2501/0/25010488",
"title": "Synthesizing Interconnect-Efficient Low Density Parity Check Codes",
"doi": null,
"abstractUrl": "/proceedings-article/dac/2004/25010488/12OmNxaw5dy",
"parentPublication": {
"id": "proceedings/dac/2004/2501/0",
"title": "Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccd/2017/2254/0/2254a681",
"title": "Exploiting Process Variation for Read Performance Improvement on LDPC Based Flash Memory Storage Systems",
"doi": null,
"abstractUrl": "/proceedings-article/iccd/2017/2254a681/12OmNxbmSza",
"parentPublication": {
"id": "proceedings/iccd/2017/2254/0",
"title": "2017 IEEE 35th International Conference on Computer Design (ICCD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/coginf/2010/8042/0/05599798",
"title": "Hiding secret in parity check bits by applying XOR Function",
"doi": null,
"abstractUrl": "/proceedings-article/coginf/2010/05599798/12OmNxwnckY",
"parentPublication": {
"id": "proceedings/coginf/2010/8042/0",
"title": "2010 9th IEEE International Conference on Cognitive Informatics (ICCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iolts/2011/1053/0/05993842",
"title": "Generalized parity-check matrices for SEC-DED codes with fixed parity",
"doi": null,
"abstractUrl": "/proceedings-article/iolts/2011/05993842/12OmNy5hRaU",
"parentPublication": {
"id": "proceedings/iolts/2011/1053/0",
"title": "2011 IEEE 17th International On-Line Testing Symposium (IOLTS 2011)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1973/10/01672207",
"title": "Augmented Parity Check Codes for Encoding of Asynchronous Sequential Machines",
"doi": null,
"abstractUrl": "/journal/tc/1973/10/01672207/13rRUEgarAb",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2015/09/06881677",
"title": "Simplified trellis min-max decoder architecture for nonbinary low-density parity-check codes",
"doi": null,
"abstractUrl": "/journal/si/2015/09/06881677/13rRUwjGoJc",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2013/11/06374266",
"title": "Relaxed Min-max Decoder Architectures for Nonbinary Low-density Parity-check Codes",
"doi": null,
"abstractUrl": "/journal/si/2013/11/06374266/13rRUyuegmL",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06875910",
"articleId": "13rRUxly95C",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06875993",
"articleId": "13rRUwbJD4L",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzZ5onU",
"title": "July-September",
"year": "2003",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "9",
"label": "July-September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjGoFP",
"doi": "10.1109/TVCG.2003.1207439",
"abstract": "Abstract—This paper describes a novel method for regional characterization of three-dimensional vector fields using a pattern matching approach. Given a three-dimensional vector field, the goal is to automatically locate, identify, and visualize a selected set of classes of structures or features. Rather than analytically defining the properties that must be fulfilled in a region in order to be classified as a specific structure, a set of idealized patterns for each structure type is constructed. Similarity to these patterns is then defined and calculated. Examples of structures of interest include vortices, swirling flow, diverging or converging flow, and parallel flow. Both medical and aerodynamic applications are presented in this paper.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—This paper describes a novel method for regional characterization of three-dimensional vector fields using a pattern matching approach. Given a three-dimensional vector field, the goal is to automatically locate, identify, and visualize a selected set of classes of structures or features. Rather than analytically defining the properties that must be fulfilled in a region in order to be classified as a specific structure, a set of idealized patterns for each structure type is constructed. Similarity to these patterns is then defined and calculated. Examples of structures of interest include vortices, swirling flow, diverging or converging flow, and parallel flow. Both medical and aerodynamic applications are presented in this paper.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—This paper describes a novel method for regional characterization of three-dimensional vector fields using a pattern matching approach. Given a three-dimensional vector field, the goal is to automatically locate, identify, and visualize a selected set of classes of structures or features. Rather than analytically defining the properties that must be fulfilled in a region in order to be classified as a specific structure, a set of idealized patterns for each structure type is constructed. Similarity to these patterns is then defined and calculated. Examples of structures of interest include vortices, swirling flow, diverging or converging flow, and parallel flow. Both medical and aerodynamic applications are presented in this paper.",
"title": "Three-Dimensional Flow Characterization Using Vector Pattern Matching",
"normalizedTitle": "Three-Dimensional Flow Characterization Using Vector Pattern Matching",
"fno": "v0313",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Flow Topology",
"Vortex Identification",
"Feature Detection",
"Noise Sensitivity"
],
"authors": [
{
"givenName": "Einar",
"surname": "Heiberg",
"fullName": "Einar Heiberg",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tino",
"surname": "Ebbers",
"fullName": "Tino Ebbers",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lars",
"surname": "Wigstr?",
"fullName": "Lars Wigstr?",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matts",
"surname": "Karlsson",
"fullName": "Matts Karlsson",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2003-07-01 00:00:00",
"pubType": "trans",
"pages": "313-319",
"year": "2003",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0298",
"articleId": "13rRUxjyX3L",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0320",
"articleId": "13rRUEgarBj",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqBKUfV",
"title": "May-June",
"year": "2013",
"issueNum": "03",
"idPrefix": "mi",
"pubType": "magazine",
"volume": "33",
"label": "May-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwvBy5Q",
"doi": "10.1109/MM.2013.25",
"abstract": "Parallel block vector profiles (PBVs) establish a mapping between a multithreaded application's basic blocks and the degree of parallelism the application exhibits each time a block executes. PBVs offer a new perspective that helps users both reason about parallel programs' hardware and software interactions and identify opportunities for performance improvements. Here, the authors present two PBV applications for architectural design and discuss further opportunities to apply PBVs in other fields. They also demonstrate how the open-source tool Harmony lets programmers collect PBVs with minimal programmer effort and application perturbation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Parallel block vector profiles (PBVs) establish a mapping between a multithreaded application's basic blocks and the degree of parallelism the application exhibits each time a block executes. PBVs offer a new perspective that helps users both reason about parallel programs' hardware and software interactions and identify opportunities for performance improvements. Here, the authors present two PBV applications for architectural design and discuss further opportunities to apply PBVs in other fields. They also demonstrate how the open-source tool Harmony lets programmers collect PBVs with minimal programmer effort and application perturbation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Parallel block vector profiles (PBVs) establish a mapping between a multithreaded application's basic blocks and the degree of parallelism the application exhibits each time a block executes. PBVs offer a new perspective that helps users both reason about parallel programs' hardware and software interactions and identify opportunities for performance improvements. Here, the authors present two PBV applications for architectural design and discuss further opportunities to apply PBVs in other fields. They also demonstrate how the open-source tool Harmony lets programmers collect PBVs with minimal programmer effort and application perturbation.",
"title": "Parallel Block Vectors: Collection, Analysis, and Uses",
"normalizedTitle": "Parallel Block Vectors: Collection, Analysis, and Uses",
"fno": "mmi2013030086",
"hasPdf": true,
"idPrefix": "mi",
"keywords": [
"Computer Architecture",
"Parallel Processing",
"System Performance",
"Computer Programs",
"Performance Evaluation",
"Programming",
"Hardware",
"Measurements",
"Parallel Block Vector",
"Parallel Programming",
"Programming Techniques",
"Software Engineering",
"Performance Analysis And Design Aids",
"Performance And Reliability",
"Hardware",
"Performance Measures",
"Metrics Measurement"
],
"authors": [
{
"givenName": "Melanie",
"surname": "Kambadur",
"fullName": "Melanie Kambadur",
"affiliation": "Columbia University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kui",
"surname": "Tang",
"fullName": "Kui Tang",
"affiliation": "Columbia University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Martha A.",
"surname": "Kim",
"fullName": "Martha A. Kim",
"affiliation": "Columbia University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2013-05-01 00:00:00",
"pubType": "mags",
"pages": "86-94",
"year": "2013",
"issn": "0272-1732",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isca/2012/0475/0/06237039",
"title": "Harmony: Collection and analysis of parallel block vectors",
"doi": null,
"abstractUrl": "/proceedings-article/isca/2012/06237039/12OmNAXPy91",
"parentPublication": {
"id": "proceedings/isca/2012/0475/0",
"title": "Computer Architecture, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/1994/6555/0/00590084",
"title": "Parallel block generalized WZ factorization",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/1994/00590084/12OmNBRsVuR",
"parentPublication": {
"id": "proceedings/icpads/1994/6555/0",
"title": "Proceedings of 1994 International Conference on Parallel and Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/blocks-and-beyond/2015/8367/0/07369006",
"title": "Block-based programming abstractions for explicit parallel computing",
"doi": null,
"abstractUrl": "/proceedings-article/blocks-and-beyond/2015/07369006/12OmNCm7BIZ",
"parentPublication": {
"id": "proceedings/blocks-and-beyond/2015/8367/0",
"title": "2015 IEEE Blocks and Beyond Workshop (Blocks and Beyond)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/1994/5090/2/00323242",
"title": "Block data decomposition for partial-homogeneous parallel networks",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1994/00323242/12OmNy6Zs0F",
"parentPublication": {
"id": "proceedings/hicss/1994/5090/2",
"title": "Proceedings of the Twenty-Seventh Annual Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-icess/2009/3738/0/3738a678",
"title": "A Parallel Refined Block Arnoldi Algorithm for Large Unsymmetric Matrices",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-icess/2009/3738a678/12OmNzV70Dd",
"parentPublication": {
"id": "proceedings/hpcc-icess/2009/3738/0",
"title": "High Performance Computing and Communication & IEEE International Conference on Embedded Software and Systems, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmpsac/1994/6705/0/00342786",
"title": "On porting sequential programs to parallel machines",
"doi": null,
"abstractUrl": "/proceedings-article/cmpsac/1994/00342786/12OmNzl3WT0",
"parentPublication": {
"id": "proceedings/cmpsac/1994/6705/0",
"title": "Proceedings Eighteenth Annual International Computer Software and Applications Conference (COMPSAC 94)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1993/4340/0/01263498",
"title": "An efficient block-oriented approach to parallel sparse Cholesky factorization",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1993/01263498/1D85nZnWGpa",
"parentPublication": {
"id": "proceedings/sc/1993/4340/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcabes/2019/2865/0/286500a176",
"title": "Research on Harmony Search BFGS Hybrid Parallel Algorithm Based on Cloud Computing",
"doi": null,
"abstractUrl": "/proceedings-article/dcabes/2019/286500a176/1fHlkw5DogE",
"parentPublication": {
"id": "proceedings/dcabes/2019/2865/0",
"title": "2019 18th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acsos-c/2020/8414/0/09196338",
"title": "An Efficient and Parallel Bad Block Checker for Parallelism of Storage Devices",
"doi": null,
"abstractUrl": "/proceedings-article/acsos-c/2020/09196338/1n90R5YWjcY",
"parentPublication": {
"id": "proceedings/acsos-c/2020/8414/0",
"title": "2020 IEEE International Conference on Autonomic Computing and Self-Organizing Systems Companion (ACSOS-C)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2021/3851/0/09637261",
"title": "BlocklyPar: from sequential to parallel with block-based visual programming",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2021/09637261/1zuw8dEuELe",
"parentPublication": {
"id": "proceedings/fie/2021/3851/0",
"title": "2021 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mmi2013030078",
"articleId": "13rRUxAStXw",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mmi2013030096",
"articleId": "13rRUwbaqX1",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAIMOaC",
"title": "December",
"year": "2011",
"issueNum": "12",
"idPrefix": "tk",
"pubType": "journal",
"volume": "23",
"label": "December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgaro8",
"doi": "10.1109/TKDE.2011.34",
"abstract": "Previous studies on supporting free-form keyword queries over RDBMSs provide users with linked structures (e.g., a set of joined tuples) that are relevant to a given keyword query. Most of them focus on ranking individual tuples from one table or joins of multiple tables containing a set of keywords. In this paper, we study the problem of keyword search in a data cube with text-rich dimension(s) (so-called text cube). The text cube is built on a multidimensional text database, where each row is associated with some text data (a document) and other structural dimensions (attributes). A cell in the text cube aggregates a set of documents with matching attribute values in a subset of dimensions. We define a keyword-based query language and an IR-style relevance model for scoring/ranking cells in the text cube. Given a keyword query, our goal is to find the top-k most relevant cells. We propose four approaches: inverted-index one-scan, document sorted-scan, bottom-up dynamic programming, and search-space ordering. The search-space ordering algorithm explores only a small portion of the text cube for finding the top-k answers, and enables early termination. Extensive experimental studies are conducted to verify the effectiveness and efficiency of the proposed approaches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Previous studies on supporting free-form keyword queries over RDBMSs provide users with linked structures (e.g., a set of joined tuples) that are relevant to a given keyword query. Most of them focus on ranking individual tuples from one table or joins of multiple tables containing a set of keywords. In this paper, we study the problem of keyword search in a data cube with text-rich dimension(s) (so-called text cube). The text cube is built on a multidimensional text database, where each row is associated with some text data (a document) and other structural dimensions (attributes). A cell in the text cube aggregates a set of documents with matching attribute values in a subset of dimensions. We define a keyword-based query language and an IR-style relevance model for scoring/ranking cells in the text cube. Given a keyword query, our goal is to find the top-k most relevant cells. We propose four approaches: inverted-index one-scan, document sorted-scan, bottom-up dynamic programming, and search-space ordering. The search-space ordering algorithm explores only a small portion of the text cube for finding the top-k answers, and enables early termination. Extensive experimental studies are conducted to verify the effectiveness and efficiency of the proposed approaches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Previous studies on supporting free-form keyword queries over RDBMSs provide users with linked structures (e.g., a set of joined tuples) that are relevant to a given keyword query. Most of them focus on ranking individual tuples from one table or joins of multiple tables containing a set of keywords. In this paper, we study the problem of keyword search in a data cube with text-rich dimension(s) (so-called text cube). The text cube is built on a multidimensional text database, where each row is associated with some text data (a document) and other structural dimensions (attributes). A cell in the text cube aggregates a set of documents with matching attribute values in a subset of dimensions. We define a keyword-based query language and an IR-style relevance model for scoring/ranking cells in the text cube. Given a keyword query, our goal is to find the top-k most relevant cells. We propose four approaches: inverted-index one-scan, document sorted-scan, bottom-up dynamic programming, and search-space ordering. The search-space ordering algorithm explores only a small portion of the text cube for finding the top-k answers, and enables early termination. Extensive experimental studies are conducted to verify the effectiveness and efficiency of the proposed approaches.",
"title": "Efficient Keyword-Based Search for Top-K Cells in Text Cube",
"normalizedTitle": "Efficient Keyword-Based Search for Top-K Cells in Text Cube",
"fno": "ttk2011121795",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Keyword Search",
"Multidimensional Text Data",
"Data Cube"
],
"authors": [
{
"givenName": "Bolin",
"surname": "Ding",
"fullName": "Bolin Ding",
"affiliation": "University of Illinois at Urbana-Champaign, Urbana",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bo",
"surname": "Zhao",
"fullName": "Bo Zhao",
"affiliation": "University of Illinois at Urbana-Champaign, Urbana",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cindy Xide",
"surname": "Lin",
"fullName": "Cindy Xide Lin",
"affiliation": "University of Illinois at Urbana-Champaign, Urbana",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiawei",
"surname": "Han",
"fullName": "Jiawei Han",
"affiliation": "University of Illinois at Urbana-Champaign, Urbana",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chengxiang",
"surname": "Zhai",
"fullName": "Chengxiang Zhai",
"affiliation": "University of Illinois at Urbana-Champaign, Urbana",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ashok",
"surname": "Srivastava",
"fullName": "Ashok Srivastava",
"affiliation": "NASA Ames Research Center, Moffett Field",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nikunj C.",
"surname": "Oza",
"fullName": "Nikunj C. Oza",
"affiliation": "NASA Ames Research Center, Moffett Field",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2011-12-01 00:00:00",
"pubType": "trans",
"pages": "1795-1810",
"year": "2011",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2010/5445/0/05447838",
"title": "TopCells: Keyword-based search of top-k aggregated documents in text cube",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2010/05447838/12OmNAWYKLt",
"parentPublication": {
"id": "proceedings/icde/2010/5445/0",
"title": "2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2008/3502/0/3502a905",
"title": "Text Cube: Computing IR Measures for Multidimensional Text Database Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2008/3502a905/12OmNAg7jXD",
"parentPublication": {
"id": "proceedings/icdm/2008/3502/0",
"title": "2008 Eighth IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icycs/2008/3398/0/3398b041",
"title": "Efficient Top-k Keyword Search on XML Streams",
"doi": null,
"abstractUrl": "/proceedings-article/icycs/2008/3398b041/12OmNqGA59U",
"parentPublication": {
"id": "proceedings/icycs/2008/3398/0",
"title": "2008 9th International Conference for Young Computer Scientists",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mdm/2014/5705/1/5705a235",
"title": "Social-Aware Top-k Spatial Keyword Search",
"doi": null,
"abstractUrl": "/proceedings-article/mdm/2014/5705a235/12OmNyKJiAW",
"parentPublication": {
"id": "proceedings/mdm/2014/5705/2",
"title": "2014 15th IEEE International Conference on Mobile Data Management (MDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccnt/2010/4042/0/4042a477",
"title": "Answer Aggregation for Keyword Search over Relational Databases",
"doi": null,
"abstractUrl": "/proceedings-article/iccnt/2010/4042a477/12OmNyVes1q",
"parentPublication": {
"id": "proceedings/iccnt/2010/4042/0",
"title": "Computer and Network Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdata-congress/2016/2622/0/07584961",
"title": "Distributed Top-k Keyword Search over Very Large Databases with MapReduce",
"doi": null,
"abstractUrl": "/proceedings-article/bigdata-congress/2016/07584961/12OmNz61dGK",
"parentPublication": {
"id": "proceedings/bigdata-congress/2016/2622/0",
"title": "2016 IEEE International Congress on Big Data (BigData Congress)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2013/4909/0/06544884",
"title": "Inverted linear quadtree: Efficient top k spatial keyword search",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2013/06544884/12OmNzVoBUL",
"parentPublication": {
"id": "proceedings/icde/2013/4909/0",
"title": "2013 29th IEEE International Conference on Data Engineering (ICDE 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2011/12/ttk2011121781",
"title": "Finding Top-k Answers in Keyword Search over Relational Databases Using Tuple Units",
"doi": null,
"abstractUrl": "/journal/tk/2011/12/ttk2011121781/13rRUwwJWG5",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2016/07/07407420",
"title": "Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search",
"doi": null,
"abstractUrl": "/journal/tk/2016/07/07407420/13rRUxBa5xJ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2011/12/ttk2011121763",
"title": "SPARK2: Top-k Keyword Query in Relational Databases",
"doi": null,
"abstractUrl": "/journal/tk/2011/12/ttk2011121763/13rRUxjQypy",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttk2011121781",
"articleId": "13rRUwwJWG5",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttk2011121811",
"articleId": "13rRUy3gn7U",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxdm4Ef",
"title": "May",
"year": "2003",
"issueNum": "05",
"idPrefix": "tc",
"pubType": "journal",
"volume": "52",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBJhun",
"doi": "10.1109/TC.2003.1197130",
"abstract": "Abstract—Due to its topological generality and flexibility, the k-ary n-cube architecture has been actively researched for various applications. However, the processor allocation problem has not been adequately addressed for the k-ary n-cube architecture, even though it has been studied extensively for hypercubes and meshes. The earlier k-ary n-cube allocation schemes based on conventional slice partitioning suffer from internal fragmentation of processors. In contrast, algorithms based on job-based partitioning alleviate the fragmentation problem but require higher time complexity. This paper proposes a new allocation scheme based on isomorphic partitioning, where the processor space is partitioned into higher dimensional isomorphic subcubes. The proposed scheme minimizes the fragmentation problem and is general in the sense that any size request can be supported and the host architecture need not be isomorphic. Extensive simulation study reveals that the proposed scheme significantly outperforms earlier schemes in terms of mean response time for practical size k-ary and n-cube architectures. The simulation results also show that reduction of external fragmentation is more substantial than internal fragmentation with the proposed scheme.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Due to its topological generality and flexibility, the k-ary n-cube architecture has been actively researched for various applications. However, the processor allocation problem has not been adequately addressed for the k-ary n-cube architecture, even though it has been studied extensively for hypercubes and meshes. The earlier k-ary n-cube allocation schemes based on conventional slice partitioning suffer from internal fragmentation of processors. In contrast, algorithms based on job-based partitioning alleviate the fragmentation problem but require higher time complexity. This paper proposes a new allocation scheme based on isomorphic partitioning, where the processor space is partitioned into higher dimensional isomorphic subcubes. The proposed scheme minimizes the fragmentation problem and is general in the sense that any size request can be supported and the host architecture need not be isomorphic. Extensive simulation study reveals that the proposed scheme significantly outperforms earlier schemes in terms of mean response time for practical size k-ary and n-cube architectures. The simulation results also show that reduction of external fragmentation is more substantial than internal fragmentation with the proposed scheme.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Due to its topological generality and flexibility, the k-ary n-cube architecture has been actively researched for various applications. However, the processor allocation problem has not been adequately addressed for the k-ary n-cube architecture, even though it has been studied extensively for hypercubes and meshes. The earlier k-ary n-cube allocation schemes based on conventional slice partitioning suffer from internal fragmentation of processors. In contrast, algorithms based on job-based partitioning alleviate the fragmentation problem but require higher time complexity. This paper proposes a new allocation scheme based on isomorphic partitioning, where the processor space is partitioned into higher dimensional isomorphic subcubes. The proposed scheme minimizes the fragmentation problem and is general in the sense that any size request can be supported and the host architecture need not be isomorphic. Extensive simulation study reveals that the proposed scheme significantly outperforms earlier schemes in terms of mean response time for practical size k-ary and n-cube architectures. The simulation results also show that reduction of external fragmentation is more substantial than internal fragmentation with the proposed scheme.",
"title": "Isomorphic Strategy for Processor Allocation in k-Ary n-Cube Systems",
"normalizedTitle": "Isomorphic Strategy for Processor Allocation in k-Ary n-Cube Systems",
"fno": "t0645",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"K Ary N Cube",
"Processor Allocation",
"Job Scheduling",
"Partitioning",
"Performance Evaluation"
],
"authors": [
{
"givenName": "Moonsoo",
"surname": "Kang",
"fullName": "Moonsoo Kang",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chansu",
"surname": "Yu",
"fullName": "Chansu Yu",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hee Yong",
"surname": "Youn",
"fullName": "Hee Yong Youn",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ben",
"surname": "Lee",
"fullName": "Ben Lee",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Myungchul",
"surname": "Kim",
"fullName": "Myungchul Kim",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2003-05-01 00:00:00",
"pubType": "trans",
"pages": "645-657",
"year": "2003",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "t0633",
"articleId": "13rRUx0gepa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "t0658",
"articleId": "13rRUygBw6s",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvsDHDY",
"title": "Jan.",
"year": "2020",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1dM2fkHbAVa",
"doi": "10.1109/TVCG.2019.2934415",
"abstract": "A Space-Time Cube enables analysts to clearly observe spatio-temporal features in movement trajectory datasets in geovisualization. However, its general usability is impacted by a lack of depth cues, a reported steep learning curve, and the requirement for efficient 3D navigation. In this work, we investigate a Space-Time Cube in the Immersive Analytics domain. Based on a review of previous work and selecting an appropriate exploration metaphor, we built a prototype environment where the cube is coupled to a virtual representation of the analyst's real desk, and zooming and panning in space and time are intuitively controlled using mid-air gestures. We compared our immersive environment to a desktop-based implementation in a user study with 20 participants across 7 tasks of varying difficulty, which targeted different user interface features. To investigate how performance is affected in the presence of clutter, we explored two scenarios with different numbers of trajectories. While the quantitative performance was similar for the majority of tasks, large differences appear when we analyze the patterns of interaction and consider subjective metrics. The immersive version of the Space-Time Cube received higher usability scores, much higher user preference, and was rated to have a lower mental workload, without causing participants discomfort in 25-minute-long VR sessions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A Space-Time Cube enables analysts to clearly observe spatio-temporal features in movement trajectory datasets in geovisualization. However, its general usability is impacted by a lack of depth cues, a reported steep learning curve, and the requirement for efficient 3D navigation. In this work, we investigate a Space-Time Cube in the Immersive Analytics domain. Based on a review of previous work and selecting an appropriate exploration metaphor, we built a prototype environment where the cube is coupled to a virtual representation of the analyst's real desk, and zooming and panning in space and time are intuitively controlled using mid-air gestures. We compared our immersive environment to a desktop-based implementation in a user study with 20 participants across 7 tasks of varying difficulty, which targeted different user interface features. To investigate how performance is affected in the presence of clutter, we explored two scenarios with different numbers of trajectories. While the quantitative performance was similar for the majority of tasks, large differences appear when we analyze the patterns of interaction and consider subjective metrics. The immersive version of the Space-Time Cube received higher usability scores, much higher user preference, and was rated to have a lower mental workload, without causing participants discomfort in 25-minute-long VR sessions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A Space-Time Cube enables analysts to clearly observe spatio-temporal features in movement trajectory datasets in geovisualization. However, its general usability is impacted by a lack of depth cues, a reported steep learning curve, and the requirement for efficient 3D navigation. In this work, we investigate a Space-Time Cube in the Immersive Analytics domain. Based on a review of previous work and selecting an appropriate exploration metaphor, we built a prototype environment where the cube is coupled to a virtual representation of the analyst's real desk, and zooming and panning in space and time are intuitively controlled using mid-air gestures. We compared our immersive environment to a desktop-based implementation in a user study with 20 participants across 7 tasks of varying difficulty, which targeted different user interface features. To investigate how performance is affected in the presence of clutter, we explored two scenarios with different numbers of trajectories. While the quantitative performance was similar for the majority of tasks, large differences appear when we analyze the patterns of interaction and consider subjective metrics. The immersive version of the Space-Time Cube received higher usability scores, much higher user preference, and was rated to have a lower mental workload, without causing participants discomfort in 25-minute-long VR sessions.",
"title": "Evaluating an Immersive Space-Time Cube Geovisualization for Intuitive Trajectory Data Exploration",
"normalizedTitle": "Evaluating an Immersive Space-Time Cube Geovisualization for Intuitive Trajectory Data Exploration",
"fno": "08854316",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Human Computer Interaction",
"User Interfaces",
"Virtual Reality",
"Intuitive Trajectory Data Exploration",
"Spatiotemporal Features",
"Movement Trajectory Datasets",
"User Interface Features",
"Immersive Space Time Cube Geovisualization",
"Immersive Analytics Domain",
"Exploration Metaphor",
"Virtual Representation",
"Task Analysis",
"Trajectory",
"Three Dimensional Displays",
"Data Visualization",
"Clutter",
"Two Dimensional Displays",
"Visualization",
"Space Time Cube",
"Trajectory Visualization",
"Immersive Analytics"
],
"authors": [
{
"givenName": "Jorge A. Wagner",
"surname": "Filho",
"fullName": "Jorge A. Wagner Filho",
"affiliation": "Federal University of Rio Grande do Sul",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wolfgang",
"surname": "Stuerzlinger",
"fullName": "Wolfgang Stuerzlinger",
"affiliation": "Simon Fraser University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Luciana",
"surname": "Nedel",
"fullName": "Luciana Nedel",
"affiliation": "Federal University of Rio Grande do Sul",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "514-524",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2017/5738/0/08031578",
"title": "Design space for spatio-data coordination: Tangible interaction devices for immersive information visualisation",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031578/12OmNC36tNM",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vs-games/2017/5812/0/08056613",
"title": "An immersive virtual environment for collaborative geovisualization",
"doi": null,
"abstractUrl": "/proceedings-article/vs-games/2017/08056613/12OmNvCi45l",
"parentPublication": {
"id": "proceedings/vs-games/2017/5812/0",
"title": "2017 9th International Conference on Virtual Worlds and Games for Serious Applications (VS-Games)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/t4e/2016/6115/0/6115a184",
"title": "Stereoscopic Three-Dimensional Visualization for Immersive and Intuitive Anatomy Learning",
"doi": null,
"abstractUrl": "/proceedings-article/t4e/2016/6115a184/12OmNx6PitG",
"parentPublication": {
"id": "proceedings/t4e/2016/6115/0",
"title": "2016 IEEE Eighth International Conference on Technology for Education (T4E)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539620",
"title": "Immersive Collaborative Analysis of Network Connectivity: CAVE-style or Head-Mounted Display?",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539620/13rRUwcS1D0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/10/08064721",
"title": "Summed Area Tables for Cube Maps",
"doi": null,
"abstractUrl": "/journal/tg/2018/10/08064721/13rRUx0xPZD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440844",
"title": "Origin-Destination Flow Maps in Immersive Environments",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440844/17D45Vw15vc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08797978",
"title": "IATK: An Immersive Analytics Toolkit",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08797978/1cJ0GweguUo",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2020/5608/0/09089446",
"title": "Graphical Perception for Immersive Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2020/09089446/1jIxfA3tlUk",
"parentPublication": {
"id": "proceedings/vr/2020/5608/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222346",
"title": "Shared Surfaces and Spaces: Collaborative Data Visualisation in a Co-located Immersive Environment",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222346/1nTqW9mGTrG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222313",
"title": "ShuttleSpace: Exploring and Analyzing Movement Trajectory in Immersive Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222313/1nTr29xEpkk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08805467",
"articleId": "1cG4z3ZA4k8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08836087",
"articleId": "1dia1nodZeM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04Q",
"title": "Jan.",
"year": "2017",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUytWF9q",
"doi": "10.1109/TVCG.2016.2598839",
"abstract": "Although data visualization tools continue to improve, during the data exploration process many of them require users to manually specify visualization techniques, mappings, and parameters. In response, we present the Visualization by Demonstration paradigm, a novel interaction method for visual data exploration. A system which adopts this paradigm allows users to provide visual demonstrations of incremental changes to the visual representation. The system then recommends potential transformations (Visual Representation, Data Mapping, Axes, and View Specification transformations) from the given demonstrations. The user and the system continue to collaborate, incrementally producing more demonstrations and refining the transformations, until the most effective possible visualization is created. As a proof of concept, we present VisExemplar, a mixed-initiative prototype that allows users to explore their data by recommending appropriate transformations in response to the given demonstrations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Although data visualization tools continue to improve, during the data exploration process many of them require users to manually specify visualization techniques, mappings, and parameters. In response, we present the Visualization by Demonstration paradigm, a novel interaction method for visual data exploration. A system which adopts this paradigm allows users to provide visual demonstrations of incremental changes to the visual representation. The system then recommends potential transformations (Visual Representation, Data Mapping, Axes, and View Specification transformations) from the given demonstrations. The user and the system continue to collaborate, incrementally producing more demonstrations and refining the transformations, until the most effective possible visualization is created. As a proof of concept, we present VisExemplar, a mixed-initiative prototype that allows users to explore their data by recommending appropriate transformations in response to the given demonstrations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Although data visualization tools continue to improve, during the data exploration process many of them require users to manually specify visualization techniques, mappings, and parameters. In response, we present the Visualization by Demonstration paradigm, a novel interaction method for visual data exploration. A system which adopts this paradigm allows users to provide visual demonstrations of incremental changes to the visual representation. The system then recommends potential transformations (Visual Representation, Data Mapping, Axes, and View Specification transformations) from the given demonstrations. The user and the system continue to collaborate, incrementally producing more demonstrations and refining the transformations, until the most effective possible visualization is created. As a proof of concept, we present VisExemplar, a mixed-initiative prototype that allows users to explore their data by recommending appropriate transformations in response to the given demonstrations.",
"title": "Visualization by Demonstration: An Interaction Paradigm for Visual Data Exploration",
"normalizedTitle": "Visualization by Demonstration: An Interaction Paradigm for Visual Data Exploration",
"fno": "07539327",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Visualization",
"Encoding",
"Bars",
"Image Color Analysis",
"Spatial Databases",
"Automobiles",
"Visual Data Exploration",
"Visualization By Demonstration",
"Visualization Tools"
],
"authors": [
{
"givenName": "Bahador",
"surname": "Saket",
"fullName": "Bahador Saket",
"affiliation": "Georgia Institute of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hannah",
"surname": "Kim",
"fullName": "Hannah Kim",
"affiliation": "Georgia Institute of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eli T.",
"surname": "Brown",
"fullName": "Eli T. Brown",
"affiliation": "DePaul University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alex",
"surname": "Endert",
"fullName": "Alex Endert",
"affiliation": "Georgia Institute of Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2017-01-01 00:00:00",
"pubType": "trans",
"pages": "331-340",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2018/1424/0/142401a225",
"title": "Exploring the Role of Sound in Augmenting Visualization to Enhance User Engagement",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2018/142401a225/12OmNCu4neC",
"parentPublication": {
"id": "proceedings/pacificvis/2018/1424/0",
"title": "2018 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2017/5738/0/08031580",
"title": "Interaction+: Interaction enhancement for web-based visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031580/12OmNyQ7FJe",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2002/1489/0/14890271",
"title": "Autostereoscopic and Haptic Visualization for Space Exploration and Mission Design",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2002/14890271/12OmNzUPphO",
"parentPublication": {
"id": "proceedings/haptics/2002/1489/0",
"title": "Haptic Interfaces for Virtual Environment and Teleoperator Systems, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192728",
"title": "Voyager: Exploratory Analysis via Faceted Browsing of Visualization Recommendations",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192728/13rRUILLkDU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/03/07875127",
"title": "Evaluating Interactive Graphical Encodings for Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2018/03/07875127/13rRUxly9e0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/05/mco2013050051",
"title": "Reimagining the Scientific Visualization Interaction Paradigm",
"doi": null,
"abstractUrl": "/magazine/co/2013/05/mco2013050051/13rRUy0ZzW0",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2018/5520/0/552000a101",
"title": "DeepEye: Towards Automatic Data Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2018/552000a101/14Fq0VI6tcV",
"parentPublication": {
"id": "proceedings/icde/2018/5520/0",
"title": "2018 IEEE 34th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08456575",
"title": "SRVis: Towards Better Spatial Integration in Ranking Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08456575/17D45VUZMTZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2022/02/09756627",
"title": "More Than Meets the Eye: A Closer Look at Encodings in Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2022/02/09756627/1CxvjdlL3TG",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904456",
"title": "Measuring Effects of Spatial Visualization and Domain on Visualization Task Performance: A Comparative Study",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904456/1H1gmktPnLa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07539341",
"articleId": "13rRUNvyatn",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07539624",
"articleId": "13rRUIJuxvn",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45WIXbOg",
"doi": "10.1109/TVCG.2018.2865241",
"abstract": "Applied visualization researchers often work closely with domain collaborators to explore new and useful applications of visualization. The early stages of collaborations are typically time consuming for all stakeholders as researchers piece together an understanding of domain challenges from disparate discussions and meetings. A number of recent projects, however, report on the use of creative visualization-opportunities (CVO) workshops to accelerate the early stages of applied work, eliciting a wealth of requirements in a few days of focused work. Yet, there is no established guidance for how to use such workshops effectively. In this paper, we present the results of a 2-year collaboration in which we analyzed the use of 17 workshops in 10 visualization contexts. Its primary contribution is a framework for CVO workshops that: 1) identifies a process model for using workshops; 2) describes a structure of what happens within effective workshops; 3) recommends 25 actionable guidelines for future workshops; and 4) presents an example workshop and workshop methods. The creation of this framework exemplifies the use of critical reflection to learn about visualization in practice from diverse studies and experience.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Applied visualization researchers often work closely with domain collaborators to explore new and useful applications of visualization. The early stages of collaborations are typically time consuming for all stakeholders as researchers piece together an understanding of domain challenges from disparate discussions and meetings. A number of recent projects, however, report on the use of creative visualization-opportunities (CVO) workshops to accelerate the early stages of applied work, eliciting a wealth of requirements in a few days of focused work. Yet, there is no established guidance for how to use such workshops effectively. In this paper, we present the results of a 2-year collaboration in which we analyzed the use of 17 workshops in 10 visualization contexts. Its primary contribution is a framework for CVO workshops that: 1) identifies a process model for using workshops; 2) describes a structure of what happens within effective workshops; 3) recommends 25 actionable guidelines for future workshops; and 4) presents an example workshop and workshop methods. The creation of this framework exemplifies the use of critical reflection to learn about visualization in practice from diverse studies and experience.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Applied visualization researchers often work closely with domain collaborators to explore new and useful applications of visualization. The early stages of collaborations are typically time consuming for all stakeholders as researchers piece together an understanding of domain challenges from disparate discussions and meetings. A number of recent projects, however, report on the use of creative visualization-opportunities (CVO) workshops to accelerate the early stages of applied work, eliciting a wealth of requirements in a few days of focused work. Yet, there is no established guidance for how to use such workshops effectively. In this paper, we present the results of a 2-year collaboration in which we analyzed the use of 17 workshops in 10 visualization contexts. Its primary contribution is a framework for CVO workshops that: 1) identifies a process model for using workshops; 2) describes a structure of what happens within effective workshops; 3) recommends 25 actionable guidelines for future workshops; and 4) presents an example workshop and workshop methods. The creation of this framework exemplifies the use of critical reflection to learn about visualization in practice from diverse studies and experience.",
"title": "A Framework for Creative Visualization-Opportunities Workshops",
"normalizedTitle": "A Framework for Creative Visualization-Opportunities Workshops",
"fno": "08440830",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Workshop Methods",
"Creative Visualization Opportunities Workshops",
"Applied Visualization Researchers",
"Domain Collaborators",
"Domain Challenges",
"CVO Workshops",
"Critical Reflection",
"Conferences",
"Data Visualization",
"Visualization",
"Collaboration",
"Stakeholders",
"Creativity",
"User Centered Visualization Design",
"Design Studies",
"Creativity Workshops",
"Critically Reflective Practice"
],
"authors": [
{
"givenName": "Ethan",
"surname": "Kerzner",
"fullName": "Ethan Kerzner",
"affiliation": "University of Utah",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sarah",
"surname": "Goodwin",
"fullName": "Sarah Goodwin",
"affiliation": "Royal Melbourne Institute of TechnologyMonash University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jason",
"surname": "Dykes",
"fullName": "Jason Dykes",
"affiliation": "City, University of London",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sara",
"surname": "Jones",
"fullName": "Sara Jones",
"affiliation": "City, University of London",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Miriah",
"surname": "Meyer",
"fullName": "Miriah Meyer",
"affiliation": "University of Utah",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "748-758",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sitis/2016/5698/0/07907529",
"title": "Ontology to Represent the Knowledge Domain of a Creative Workshop",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2016/07907529/12OmNyOq4QV",
"parentPublication": {
"id": "proceedings/sitis/2016/5698/0",
"title": "2016 12th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2015/9721/0/9721a693",
"title": "Multi-agent System to Support Creative Workshop",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2015/9721a693/12OmNyYDDDG",
"parentPublication": {
"id": "proceedings/sitis/2015/9721/0",
"title": "2015 11th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017594",
"title": "The Explanatory Visualization Framework: An Active Learning Framework for Teaching Creative Computing Using Explanatory Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017594/13rRUyY28YC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2018/1174/0/08659111",
"title": "Computer Programming Workshops with Playful Environments for Middle School Girls",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2018/08659111/18j96FF7ryw",
"parentPublication": {
"id": "proceedings/fie/2018/1174/0",
"title": "2018 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2018/7447/0/744701a466",
"title": "Multifaceted Workshops to Envision the Future of Open Science With Society",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2018/744701a466/19m3BFlAsA8",
"parentPublication": {
"id": "proceedings/iiai-aai/2018/7447/0",
"title": "2018 7th International Congress on Advanced Applied Informatics (IIAI-AAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/beliv/2022/9629/0/962900a011",
"title": "Creative Visualisation Opportunities Workshops: A Case Study in Population Health",
"doi": null,
"abstractUrl": "/proceedings-article/beliv/2022/962900a011/1J6hS5cbyvK",
"parentPublication": {
"id": "proceedings/beliv/2022/9629/0",
"title": "2022 IEEE Evaluation and Beyond - Methodological Approaches for Visualization (BELIV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/beliv/2020/9642/0/964200a081",
"title": "Extending Recommendations for Creative Visualization-Opportunities Workshops",
"doi": null,
"abstractUrl": "/proceedings-article/beliv/2020/964200a081/1q0FOGlFTyw",
"parentPublication": {
"id": "proceedings/beliv/2020/9642/0",
"title": "2020 IEEE Workshop on Evaluation and Beyond - Methodological Approaches to Visualization (BELIV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a550",
"title": "ColVis: Collaborative Visualization Design Workshops for Diverse User Groups",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a550/1rSRdQJMBk4",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2021/04/09500110",
"title": "The Collegeville Workshops on Scientific Software: Looking Back and Forward",
"doi": null,
"abstractUrl": "/magazine/cs/2021/04/09500110/1vBD0jkRQek",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/06/09551781",
"title": "Remote Instruction for Data Visualization Design—A Report From the Trenches",
"doi": null,
"abstractUrl": "/magazine/cg/2021/06/09551781/1xgx5Wl5THi",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440836",
"articleId": "17D45WWzW3c",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440080",
"articleId": "17D45XoXP4o",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRKH",
"name": "ttg201901-08440830s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08440830s1.zip",
"extension": "zip",
"size": "191 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1GZomJYdZQY",
"doi": "10.1109/TVCG.2022.3209490",
"abstract": "Examples are useful for inspiring ideas and facilitating implementation in visualization design. However, there is little understanding of how visualization designers use examples, and how computational tools may support such activities. In this paper, we contribute an exploratory study of current practices in incorporating visualization examples. We conducted semi-structured interviews with 15 university students and 15 professional designers. Our analysis focus on two core design activities: searching for examples and utilizing examples. We characterize observed strategies and tools for performing these activities, as well as major challenges that hinder designers' current workflows. In addition, we identify themes that cut across these two activities: criteria for determining example usefulness, curation practices, and design fixation. Given our findings, we discuss the implications for visualization design and authoring tools and highlight critical areas for future research.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Examples are useful for inspiring ideas and facilitating implementation in visualization design. However, there is little understanding of how visualization designers use examples, and how computational tools may support such activities. In this paper, we contribute an exploratory study of current practices in incorporating visualization examples. We conducted semi-structured interviews with 15 university students and 15 professional designers. Our analysis focus on two core design activities: searching for examples and utilizing examples. We characterize observed strategies and tools for performing these activities, as well as major challenges that hinder designers' current workflows. In addition, we identify themes that cut across these two activities: criteria for determining example usefulness, curation practices, and design fixation. Given our findings, we discuss the implications for visualization design and authoring tools and highlight critical areas for future research.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Examples are useful for inspiring ideas and facilitating implementation in visualization design. However, there is little understanding of how visualization designers use examples, and how computational tools may support such activities. In this paper, we contribute an exploratory study of current practices in incorporating visualization examples. We conducted semi-structured interviews with 15 university students and 15 professional designers. Our analysis focus on two core design activities: searching for examples and utilizing examples. We characterize observed strategies and tools for performing these activities, as well as major challenges that hinder designers' current workflows. In addition, we identify themes that cut across these two activities: criteria for determining example usefulness, curation practices, and design fixation. Given our findings, we discuss the implications for visualization design and authoring tools and highlight critical areas for future research.",
"title": "Understanding how Designers Find and Use Data Visualization Examples",
"normalizedTitle": "Understanding how Designers Find and Use Data Visualization Examples",
"fno": "09903579",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Aided Instruction",
"Data Visualisation",
"Design Engineering",
"15 Professional Designers",
"Core Design Activities",
"Data Visualization Examples",
"Design Fixation",
"Example Usefulness",
"Facilitating Implementation",
"Hinder Designers",
"Incorporating Visualization Examples",
"Utilizing Examples",
"Visualization Design",
"Visualization Designers",
"Data Visualization",
"Interviews",
"Creativity",
"Visualization",
"Task Analysis",
"Search Problems",
"Faces",
"Examples",
"Visualization Design",
"Idea Generation",
"Interview Study",
"Qualitative Research"
],
"authors": [
{
"givenName": "Hannah K.",
"surname": "Bako",
"fullName": "Hannah K. Bako",
"affiliation": "University of Maryland, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xinyi",
"surname": "Liu",
"fullName": "Xinyi Liu",
"affiliation": "University of Maryland, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Leilani",
"surname": "Battle",
"fullName": "Leilani Battle",
"affiliation": "University of Washington, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhicheng",
"surname": "Liu",
"fullName": "Zhicheng Liu",
"affiliation": "University of Maryland, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "1048-1058",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vizsec/2017/2693/0/08062202",
"title": "Adversarial-Playground: A visualization suite showing how adversarial examples fool deep learning",
"doi": null,
"abstractUrl": "/proceedings-article/vizsec/2017/08062202/12OmNBKmXmJ",
"parentPublication": {
"id": "proceedings/vizsec/2017/2693/0",
"title": "2017 IEEE Symposium on Visualization for Cyber Security (VizSec)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2011/0868/0/06004069",
"title": "Knowledge Visualization in Qualitative Methods -- Or How Can I See What I Say?",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2011/06004069/12OmNxA3YVI",
"parentPublication": {
"id": "proceedings/iv/2011/0868/0",
"title": "2011 15th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlhcc/2008/2528/0/04639081",
"title": "How designers design and program interactive behaviors",
"doi": null,
"abstractUrl": "/proceedings-article/vlhcc/2008/04639081/12OmNxRWIda",
"parentPublication": {
"id": "proceedings/vlhcc/2008/2528/0",
"title": "2008 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2015/02/06922572",
"title": "How Software Designers Interact with Sketches at the Whiteboard",
"doi": null,
"abstractUrl": "/journal/ts/2015/02/06922572/13rRUEgs2DI",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2012/06/mcg2012060088",
"title": "Understanding Visualization by Understanding Individual Users",
"doi": null,
"abstractUrl": "/magazine/cg/2012/06/mcg2012060088/13rRUNvya3t",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192668",
"title": "How do People Make Sense of Unfamiliar Visualizations?: A Grounded Model of Novice's Information Visualization Sensemaking",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192668/13rRUwhpBO5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903291",
"title": "Understanding Barriers to Network Exploration with Visualization: A Report from the Trenches",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903291/1GZojtBEfvi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09246308",
"title": "Guidelines For Pursuing and Revealing Data Abstractions",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09246308/1olDVqD8b0A",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/beliv/2020/9642/0/964200a019",
"title": "How to evaluate data visualizations across different levels of understanding",
"doi": null,
"abstractUrl": "/proceedings-article/beliv/2020/964200a019/1q0FOQPpIic",
"parentPublication": {
"id": "proceedings/beliv/2020/9642/0",
"title": "2020 IEEE Workshop on Evaluation and Beyond - Methodological Approaches to Visualization (BELIV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2021/3335/0/333500a076",
"title": "Fixation and Creativity in Data Visualization Design: Experiences and Perspectives of Practitioners",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2021/333500a076/1yXuiT4GCbK",
"parentPublication": {
"id": "proceedings/vis/2021/3335/0",
"title": "2021 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09904866",
"articleId": "1H2llxba9ws",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09904432",
"articleId": "1H0Gf7qlCU0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvsDHDY",
"title": "Jan.",
"year": "2020",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1cG66gYAFtS",
"doi": "10.1109/TVCG.2019.2934804",
"abstract": "Building data analysis skills is part of modern elementary school curricula. Recent research has explored how to facilitate children's understanding of visual data representations through completion exercises which highlight links between concrete and abstract mappings. This approach scaffolds visualization activities by presenting a target visualization to children. But how can we engage children in more free-form visual data mapping exercises that are driven by their own mapping ideas? How can we scaffold a creative exploration of visualization techniques and mapping possibilities? We present Construct-A-Vis, a tablet-based tool designed to explore the feasibility of free-form and constructive visualization activities with elementary school children. Construct-A-Vis provides adjustable levels of scaffolding visual mapping processes. It can be used by children individually or as part of collaborative activities. Findings from a study with elementary school children using Construct-A-Vis individually and in pairs highlight the potential of this free-form constructive approach, as visible in children's diverse visualization outcomes and their critical engagement with the data and mapping processes. Based on our study findings we contribute insights into the design of free-form visualization tools for children, including the role of tool-based scaffolding mechanisms and shared interactions to guide visualization activities with children.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Building data analysis skills is part of modern elementary school curricula. Recent research has explored how to facilitate children's understanding of visual data representations through completion exercises which highlight links between concrete and abstract mappings. This approach scaffolds visualization activities by presenting a target visualization to children. But how can we engage children in more free-form visual data mapping exercises that are driven by their own mapping ideas? How can we scaffold a creative exploration of visualization techniques and mapping possibilities? We present Construct-A-Vis, a tablet-based tool designed to explore the feasibility of free-form and constructive visualization activities with elementary school children. Construct-A-Vis provides adjustable levels of scaffolding visual mapping processes. It can be used by children individually or as part of collaborative activities. Findings from a study with elementary school children using Construct-A-Vis individually and in pairs highlight the potential of this free-form constructive approach, as visible in children's diverse visualization outcomes and their critical engagement with the data and mapping processes. Based on our study findings we contribute insights into the design of free-form visualization tools for children, including the role of tool-based scaffolding mechanisms and shared interactions to guide visualization activities with children.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Building data analysis skills is part of modern elementary school curricula. Recent research has explored how to facilitate children's understanding of visual data representations through completion exercises which highlight links between concrete and abstract mappings. This approach scaffolds visualization activities by presenting a target visualization to children. But how can we engage children in more free-form visual data mapping exercises that are driven by their own mapping ideas? How can we scaffold a creative exploration of visualization techniques and mapping possibilities? We present Construct-A-Vis, a tablet-based tool designed to explore the feasibility of free-form and constructive visualization activities with elementary school children. Construct-A-Vis provides adjustable levels of scaffolding visual mapping processes. It can be used by children individually or as part of collaborative activities. Findings from a study with elementary school children using Construct-A-Vis individually and in pairs highlight the potential of this free-form constructive approach, as visible in children's diverse visualization outcomes and their critical engagement with the data and mapping processes. Based on our study findings we contribute insights into the design of free-form visualization tools for children, including the role of tool-based scaffolding mechanisms and shared interactions to guide visualization activities with children.",
"title": "Construct-A-Vis: Exploring the Free-Form Visualization Processes of Children",
"normalizedTitle": "Construct-A-Vis: Exploring the Free-Form Visualization Processes of Children",
"fno": "08807271",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Aided Instruction",
"Data Analysis",
"Data Structures",
"Data Visualisation",
"Educational Courses",
"Educational Institutions",
"Free Form Visual Data Mapping Exercises",
"Constructive Visualization Activities",
"Elementary School Children",
"Visual Mapping Processes",
"Free Form Constructive Approach",
"Free Form Visualization Tools",
"Free Form Visualization Processes",
"Data Analysis Skills",
"Modern Elementary School Curricula",
"Visual Data Representations",
"Construct A Vis",
"Data Visualization",
"Visualization",
"Tools",
"Education",
"Problem Solving",
"Collaboration",
"Buildings",
"Visualization In Education",
"Visualization With Children",
"Qualitative Evaluation",
"Visualization System And Toolkit Design"
],
"authors": [
{
"givenName": "Fearn",
"surname": "Bishop",
"fullName": "Fearn Bishop",
"affiliation": "University of St Andrews, St Andrews, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Johannes",
"surname": "Zagermann",
"fullName": "Johannes Zagermann",
"affiliation": "University of Konstanz, Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ulrike",
"surname": "Pfeil",
"fullName": "Ulrike Pfeil",
"affiliation": "University of Konstanz, Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gemma",
"surname": "Sanderson",
"fullName": "Gemma Sanderson",
"affiliation": "Fife Council, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Harald",
"surname": "Reiterer",
"fullName": "Harald Reiterer",
"affiliation": "University of Konstanz, Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Uta",
"surname": "Hinrichs",
"fullName": "Uta Hinrichs",
"affiliation": "University of St Andrews, St Andrews, UK",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "451-460",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cgiv/2009/3789/0/3789a443",
"title": "Synthesis Vis: A Web Site Supporting Collaborative Information Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2009/3789a443/12OmNx5GU5l",
"parentPublication": {
"id": "proceedings/cgiv/2009/3789/0",
"title": "2009 Sixth International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dagstuhl/1997/0503/0/01423125",
"title": "Vis-à-Web: An On-line Distributed Visualization Service",
"doi": null,
"abstractUrl": "/proceedings-article/dagstuhl/1997/01423125/12OmNzgeLD5",
"parentPublication": {
"id": "proceedings/dagstuhl/1997/0503/0",
"title": "Dagstuhl '97 - Scientific Visualization Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2017/02/mcs2017020082",
"title": "A report from VIS 2016",
"doi": null,
"abstractUrl": "/magazine/cs/2017/02/mcs2017020082/13rRUwwaKmg",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/vispre",
"title": "Vis/InfoVis 2006 pre-pages",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/vispre/13rRUwwaKsX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/02/07390069",
"title": "Vis-A-Ware: Integrating Spatial and Non-Spatial Visualization for Visibility-Aware Urban Planning",
"doi": null,
"abstractUrl": "/journal/tg/2017/02/07390069/13rRUxAAT7I",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06935059",
"title": "Message from the VIS Paper Chairs and Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06935059/13rRUxBa564",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2015/06/mcg2015060006",
"title": "Slow Vis: Extending Opportunities for Insight and Understanding Over Time",
"doi": null,
"abstractUrl": "/magazine/cg/2015/06/mcg2015060006/13rRUyuegjp",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2019/1746/0/09028486",
"title": "Algorithmic Expressions for Assessing Algorithmic Thinking Ability of Elementary School Children",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2019/09028486/1iffanpQabu",
"parentPublication": {
"id": "proceedings/fie/2019/1746/0",
"title": "2019 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a761",
"title": "Developing Computational Thinking for Children with Autism using a Serious Game",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a761/1rSRclkCpzO",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl-hcc/2021/4592/0/09576171",
"title": "Exploring Machine Teaching with Children",
"doi": null,
"abstractUrl": "/proceedings-article/vl-hcc/2021/09576171/1y63oPpBxAY",
"parentPublication": {
"id": "proceedings/vl-hcc/2021/4592/0",
"title": "2021 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08807220",
"articleId": "1cG6bfa8KkM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08807226",
"articleId": "1cG65OkeVu8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBRKwCQ",
"title": "July-Aug.",
"year": "2020",
"issueNum": "04",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "40",
"label": "July-Aug.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1kHUNLgZhSM",
"doi": "10.1109/MCG.2020.2986902",
"abstract": "We discuss challenges and strategies for evaluating natural language interfaces (NLIs) for data visualization. Through an examination of prior studies and reflecting on own experiences in evaluating visualization NLIs, we highlight benefits and considerations of three task framing strategies: Jeopardy-style facts, open-ended tasks, and target replication tasks. We hope the discussions in this article can guide future researchers working on visualization NLIs and help them avoid common challenges and pitfalls when evaluating these systems. Finally, to motivate future research, we highlight topics that call for further investigation including development of new evaluation metrics, and considering the type of natural language input (spoken versus typed), among others.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We discuss challenges and strategies for evaluating natural language interfaces (NLIs) for data visualization. Through an examination of prior studies and reflecting on own experiences in evaluating visualization NLIs, we highlight benefits and considerations of three task framing strategies: Jeopardy-style facts, open-ended tasks, and target replication tasks. We hope the discussions in this article can guide future researchers working on visualization NLIs and help them avoid common challenges and pitfalls when evaluating these systems. Finally, to motivate future research, we highlight topics that call for further investigation including development of new evaluation metrics, and considering the type of natural language input (spoken versus typed), among others.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We discuss challenges and strategies for evaluating natural language interfaces (NLIs) for data visualization. Through an examination of prior studies and reflecting on own experiences in evaluating visualization NLIs, we highlight benefits and considerations of three task framing strategies: Jeopardy-style facts, open-ended tasks, and target replication tasks. We hope the discussions in this article can guide future researchers working on visualization NLIs and help them avoid common challenges and pitfalls when evaluating these systems. Finally, to motivate future research, we highlight topics that call for further investigation including development of new evaluation metrics, and considering the type of natural language input (spoken versus typed), among others.",
"title": "How to Ask What to Say?: Strategies for Evaluating Natural Language Interfaces for Data Visualization",
"normalizedTitle": "How to Ask What to Say?: Strategies for Evaluating Natural Language Interfaces for Data Visualization",
"fno": "09118800",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Visualisation",
"Natural Language Interfaces",
"Data Visualization",
"Visualization NL Is",
"Task Framing Strategies",
"Open Ended Tasks",
"Target Replication Tasks",
"Evaluation Metrics",
"Natural Language Input",
"Task Analysis",
"Data Visualization",
"Visualization",
"Tools",
"Natural Languages",
"Training",
"Measurement"
],
"authors": [
{
"givenName": "Arjun",
"surname": "Srinivasan",
"fullName": "Arjun Srinivasan",
"affiliation": "School of Interactive ComputingGeorgia Institute of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Stasko",
"fullName": "John Stasko",
"affiliation": "School of Interactive ComputingGeorgia Institute of Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2020-07-01 00:00:00",
"pubType": "mags",
"pages": "96-103",
"year": "2020",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2023/06/09699035",
"title": "Towards Natural Language Interfaces for Data Visualization: A Survey",
"doi": null,
"abstractUrl": "/journal/tg/2023/06/09699035/1ADJfMYBSCs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09910021",
"title": "FlowNL: Asking the Flow Data in Natural Languages",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09910021/1Hcj6hoXqkU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09912366",
"title": "Towards Natural Language-Based Visualization Authoring",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09912366/1HeiWkRN3tC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a006",
"title": "Facilitating Conversational Interaction in Natural Language Interfaces for Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a006/1J6hcTVtKNy",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10026499",
"title": "XNLI: Explaining and Diagnosing NLI-based Visual Data Analysis",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10026499/1KkXscJg6vm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv-2/2019/2850/0/285000a116",
"title": "Visual (dis)Confirmation: Validating Models and Hypotheses with Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/iv-2/2019/285000a116/1cMEOINHDQk",
"parentPublication": {
"id": "proceedings/iv-2/2019/2850/0",
"title": "2019 23rd International Conference in Information Visualization – Part II",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/06/08977320",
"title": "Touch? Speech? or Touch and Speech? Investigating Multimodal Interaction for Visual Network Exploration and Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2020/06/08977320/1h2AIkwYg4E",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222342",
"title": "NL4DV: A Toolkit for Generating Analytic Specifications for Data Visualization from Natural Language Queries",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222342/1nTqOo5NR3G",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a216",
"title": "Sentifiers: Interpreting Vague Intent Modifiers in Visual Analysis using Word Co-occurrence and Sentiment Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a216/1qRO5ZYmzfy",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09555469",
"title": "Accessible Visualization via Natural Language Descriptions: A Four-Level Model of Semantic Content",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09555469/1xjQSGhQDvO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09117084",
"articleId": "1kGgoDW7R2E",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzUgdjK",
"title": "July-Aug.",
"year": "2018",
"issueNum": "04",
"idPrefix": "tb",
"pubType": "journal",
"volume": "15",
"label": "July-Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwhHcHO",
"doi": "10.1109/TCBB.2017.2773477",
"abstract": "As a well-established computational framework, probabilistic Boolean networks (PBNs) are widely used for modelling, simulation, and analysis of biological systems. To analyze the steady-state dynamics of PBNs is of crucial importance to explore the characteristics of biological systems. However, the analysis of large PBNs, which often arise in systems biology, is prone to the infamous state-space explosion problem. Therefore, the employment of statistical methods often remains the only feasible solution. We present Z_${\\mathsf{ASSA-PBN}}$_Z , a software toolbox for modelling, simulation, and analysis of PBNs. Z_${\\mathsf{ASSA-PBN}}$_Z provides efficient statistical methods with three parallel techniques to speed up the computation of steady-state probabilities. Moreover, particle swarm optimisation (PSO) and differential evolution (DE) are implemented for the estimation of PBN parameters. Additionally, we implement in-depth analyses of PBNs, including long-run influence analysis, long-run sensitivity analysis, computation of one-parameter profile likelihoods, and the visualization of one-parameter profile likelihoods. A PBN model of apoptosis is used as a case study to illustrate the main functionalities of Z_${\\mathsf{ASSA-PBN}}$_Z and to demonstrate the capabilities of Z_${\\mathsf{ASSA-PBN}}$_Z to effectively analyse biological systems modelled as PBNs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As a well-established computational framework, probabilistic Boolean networks (PBNs) are widely used for modelling, simulation, and analysis of biological systems. To analyze the steady-state dynamics of PBNs is of crucial importance to explore the characteristics of biological systems. However, the analysis of large PBNs, which often arise in systems biology, is prone to the infamous state-space explosion problem. Therefore, the employment of statistical methods often remains the only feasible solution. We present ${\\mathsf{ASSA-PBN}}$ , a software toolbox for modelling, simulation, and analysis of PBNs. ${\\mathsf{ASSA-PBN}}$ provides efficient statistical methods with three parallel techniques to speed up the computation of steady-state probabilities. Moreover, particle swarm optimisation (PSO) and differential evolution (DE) are implemented for the estimation of PBN parameters. Additionally, we implement in-depth analyses of PBNs, including long-run influence analysis, long-run sensitivity analysis, computation of one-parameter profile likelihoods, and the visualization of one-parameter profile likelihoods. A PBN model of apoptosis is used as a case study to illustrate the main functionalities of ${\\mathsf{ASSA-PBN}}$ and to demonstrate the capabilities of ${\\mathsf{ASSA-PBN}}$ to effectively analyse biological systems modelled as PBNs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As a well-established computational framework, probabilistic Boolean networks (PBNs) are widely used for modelling, simulation, and analysis of biological systems. To analyze the steady-state dynamics of PBNs is of crucial importance to explore the characteristics of biological systems. However, the analysis of large PBNs, which often arise in systems biology, is prone to the infamous state-space explosion problem. Therefore, the employment of statistical methods often remains the only feasible solution. We present - , a software toolbox for modelling, simulation, and analysis of PBNs. - provides efficient statistical methods with three parallel techniques to speed up the computation of steady-state probabilities. Moreover, particle swarm optimisation (PSO) and differential evolution (DE) are implemented for the estimation of PBN parameters. Additionally, we implement in-depth analyses of PBNs, including long-run influence analysis, long-run sensitivity analysis, computation of one-parameter profile likelihoods, and the visualization of one-parameter profile likelihoods. A PBN model of apoptosis is used as a case study to illustrate the main functionalities of - and to demonstrate the capabilities of - to effectively analyse biological systems modelled as PBNs.",
"title": "ASSA-PBN: A Toolbox for Probabilistic Boolean Networks",
"normalizedTitle": "ASSA-PBN: A Toolbox for Probabilistic Boolean Networks",
"fno": "08107541",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Biological System Modeling",
"Computational Modeling",
"Analytical Models",
"Steady State",
"Biological Systems",
"Mathematical Model",
"Probabilistic Boolean Networks",
"Modelling",
"Simulation And Analysis Of Biological Networks",
"Discrete Time Markov Chains",
"Steady State Analysis",
"Parameter Estimation",
"Long Run Analysis"
],
"authors": [
{
"givenName": "Andrzej",
"surname": "Mizera",
"fullName": "Andrzej Mizera",
"affiliation": "Department of Infection and Immunity, Allergology - Immunology - Inflammation Research Unit, Luxembourg Institute of Health, Esch-sur-Alzette, Luxembourg",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jun",
"surname": "Pang",
"fullName": "Jun Pang",
"affiliation": "Computer Science and Communications Research Unit, University of Luxembourg, Esch-sur-Alzette, Luxembourg",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cui",
"surname": "Su",
"fullName": "Cui Su",
"affiliation": "Interdisciplinary Centre for Security, Reliability, and Trust, University of Luxembourg, Esch-sur-Alzette, Luxembourg",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qixia",
"surname": "Yuan",
"fullName": "Qixia Yuan",
"affiliation": "Computer Science and Communications Research Unit, University of Luxembourg, Esch-sur-Alzette, Luxembourg",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2018-07-01 00:00:00",
"pubType": "trans",
"pages": "1203-1216",
"year": "2018",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tb/2019/04/08329217",
"title": "A New Algorithm for Counting Independent Motifs in Probabilistic Networks",
"doi": null,
"abstractUrl": "/journal/tb/2019/04/08329217/13rRUwIF6jy",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2018/01/07588090",
"title": "Classification of State Trajectories in Gene Regulatory Networks",
"doi": null,
"abstractUrl": "/journal/tb/2018/01/07588090/13rRUxAASRJ",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2016/04/07265002",
"title": "Probabilistic Boolean Network Modelling and Analysis Framework for mRNA Translation",
"doi": null,
"abstractUrl": "/journal/tb/2016/04/07265002/13rRUxjQyas",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2013/03/ttb2013030584",
"title": "Boolean Networks with Multiexpressions and Parameters",
"doi": null,
"abstractUrl": "/journal/tb/2013/03/ttb2013030584/13rRUxly9cl",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2018/05/07929387",
"title": "Reviving the Two-State Markov Chain Approach",
"doi": null,
"abstractUrl": "/journal/tb/2018/05/07929387/14dcDXDJqxZ",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2019/01/08398459",
"title": "Taming Asynchrony for Attractor Detection in Large Boolean Networks",
"doi": null,
"abstractUrl": "/journal/tb/2019/01/08398459/17D45Xcttkw",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/08703112",
"title": "Towards Optimal Decomposition of Boolean Networks",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/08703112/19EqX6HzcpG",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2023/02/09870861",
"title": "Modeling mRNA Translation With Ribosome Abortions",
"doi": null,
"abstractUrl": "/journal/tb/2023/02/09870861/1GhRIjn3ygw",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2020/06/08823021",
"title": "FPGA Accelerated Analysis of Boolean Gene Regulatory Networks",
"doi": null,
"abstractUrl": "/journal/tb/2020/06/08823021/1d1yOChNYs0",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibmw/2008/2890/0/04686227",
"title": "A new sensitivity measure for probabilistic Boolean networks based on steady-state distributions",
"doi": null,
"abstractUrl": "/proceedings-article/bibmw/2008/04686227/1wMJ0vwz160",
"parentPublication": {
"id": "proceedings/bibmw/2008/2890/0",
"title": "2008 IEEE International Conference on Bioinformatics and Biomeidcine Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08057785",
"articleId": "13rRUxNEqUj",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08267489",
"articleId": "13rRUwfI0OD",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAPBbcB",
"title": "Jan.-Feb.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tb",
"pubType": "journal",
"volume": "16",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45XeKgmL",
"doi": "10.1109/TCBB.2017.2773083",
"abstract": "Parameter estimation in discrete or continuous deterministic cell cycle models is challenging for several reasons, including the nature of what can be observed, and the accuracy and quantity of those observations. The challenge is even greater for stochastic models, where the number of simulations and amount of empirical data must be even larger to obtain statistically valid parameter estimates. The two main contributions of this work are (1) stochastic model parameter estimation based on directly matching multivariate probability distributions, and (2) a new quasi-Newton algorithm class QNSTOP for stochastic optimization problems. QNSTOP directly uses the random objective function value samples rather than creating ensemble statistics. QNSTOP is used here to directly match empirical and simulated joint probability distributions rather than matching summary statistics. Results are given for a current state-of-the-art stochastic cell cycle model of budding yeast, whose predictions match well some summary statistics and one-dimensional distributions from empirical data, but do not match well the empirical joint distributions. The nature of the mismatch provides insight into the weakness in the stochastic model.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Parameter estimation in discrete or continuous deterministic cell cycle models is challenging for several reasons, including the nature of what can be observed, and the accuracy and quantity of those observations. The challenge is even greater for stochastic models, where the number of simulations and amount of empirical data must be even larger to obtain statistically valid parameter estimates. The two main contributions of this work are (1) stochastic model parameter estimation based on directly matching multivariate probability distributions, and (2) a new quasi-Newton algorithm class QNSTOP for stochastic optimization problems. QNSTOP directly uses the random objective function value samples rather than creating ensemble statistics. QNSTOP is used here to directly match empirical and simulated joint probability distributions rather than matching summary statistics. Results are given for a current state-of-the-art stochastic cell cycle model of budding yeast, whose predictions match well some summary statistics and one-dimensional distributions from empirical data, but do not match well the empirical joint distributions. The nature of the mismatch provides insight into the weakness in the stochastic model.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Parameter estimation in discrete or continuous deterministic cell cycle models is challenging for several reasons, including the nature of what can be observed, and the accuracy and quantity of those observations. The challenge is even greater for stochastic models, where the number of simulations and amount of empirical data must be even larger to obtain statistically valid parameter estimates. The two main contributions of this work are (1) stochastic model parameter estimation based on directly matching multivariate probability distributions, and (2) a new quasi-Newton algorithm class QNSTOP for stochastic optimization problems. QNSTOP directly uses the random objective function value samples rather than creating ensemble statistics. QNSTOP is used here to directly match empirical and simulated joint probability distributions rather than matching summary statistics. Results are given for a current state-of-the-art stochastic cell cycle model of budding yeast, whose predictions match well some summary statistics and one-dimensional distributions from empirical data, but do not match well the empirical joint distributions. The nature of the mismatch provides insight into the weakness in the stochastic model.",
"title": "Quasi-Newton Stochastic Optimization Algorithm for Parameter Estimation of a Stochastic Model of the Budding Yeast Cell Cycle",
"normalizedTitle": "Quasi-Newton Stochastic Optimization Algorithm for Parameter Estimation of a Stochastic Model of the Budding Yeast Cell Cycle",
"fno": "08107569",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Cellular Biophysics",
"Microorganisms",
"Newton Method",
"Optimisation",
"Parameter Estimation",
"Statistical Distributions",
"Stochastic Processes",
"Discrete Cell Cycle Models",
"Continuous Deterministic Cell Cycle Models",
"Empirical Data",
"Statistically Valid Parameter Estimates",
"Multivariate Probability Distributions",
"Quasi Newton Algorithm Class QNSTOP",
"Stochastic Optimization Problems",
"Joint Probability Distributions",
"Current State Of The Art Stochastic Cell Cycle Model",
"Empirical Joint Distributions",
"Quasi Newton Stochastic Optimization Algorithm",
"Budding Yeast Cell Cycle",
"Stochastic Model Parameter Estimation",
"One Dimensional Distributions",
"Stochastic Processes",
"Mathematical Model",
"Biological System Modeling",
"Data Models",
"Optimization",
"Proteins",
"Strain",
"Optimization",
"Biology And Genetics"
],
"authors": [
{
"givenName": "Minghan",
"surname": "Chen",
"fullName": "Minghan Chen",
"affiliation": "Department of Computer Science, Virginia Tech, Blacksburg, VA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Brandon D.",
"surname": "Amos",
"fullName": "Brandon D. Amos",
"affiliation": "Department of Computer Science, Virginia Tech, Blacksburg, VA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Layne T.",
"surname": "Watson",
"fullName": "Layne T. Watson",
"affiliation": "Department of Computer Science, Virginia Tech, Blacksburg, VA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John J.",
"surname": "Tyson",
"fullName": "John J. Tyson",
"affiliation": "Department of Biological Sciences, Virginia Tech, Blacksburg, VA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Young",
"surname": "Cao",
"fullName": "Young Cao",
"affiliation": "Department of Computer Science, Virginia Tech, Blacksburg, VA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Clifford A.",
"surname": "Shaffer",
"fullName": "Clifford A. Shaffer",
"affiliation": "Department of Computer Science, Virginia Tech, Blacksburg, VA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael W.",
"surname": "Trosset",
"fullName": "Michael W. Trosset",
"affiliation": "Department of, Statistics, Indiana University, Bloomington, IN",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cihan",
"surname": "Oguz",
"fullName": "Cihan Oguz",
"affiliation": "Department of Biological Sciences, Virginia Tech, Blacksburg, VA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gisella",
"surname": "Kakoti",
"fullName": "Gisella Kakoti",
"affiliation": "summer research intern in Virginia Tech, Blacksburg, VA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "301-311",
"year": "2019",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isuma/2003/1997/0/19970304",
"title": "Quasi-Newton Methods for Stochastic Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/isuma/2003/19970304/12OmNBr4eHW",
"parentPublication": {
"id": "proceedings/isuma/2003/1997/0",
"title": "Uncertainty Modeling and Analysis, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/1993/3230/1/00270675",
"title": "Protein alpha -helix region prediction based on stochastic-rule learning",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1993/00270675/12OmNqBKUaf",
"parentPublication": {
"id": "proceedings/hicss/1993/3230/1",
"title": "1993 The Twenty-sixth Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isuma/1993/3850/0/00366735",
"title": "Life cycle assessment of system availability and cash flow by stochastic modeling and simulation",
"doi": null,
"abstractUrl": "/proceedings-article/isuma/1993/00366735/12OmNs59JTB",
"parentPublication": {
"id": "proceedings/isuma/1993/3850/0",
"title": "1993 (2nd) International Symposium on Uncertainty Modeling and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2014/7434/0/7434a775",
"title": "Research and Application of a Stochastic Volatility Model with T-distribution Leveraged",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2014/7434a775/12OmNvDI3NN",
"parentPublication": {
"id": "proceedings/cis/2014/7434/0",
"title": "2014 Tenth International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2009/5949/0/05407538",
"title": "Quasi-Newton multimodulus blind equalization algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2009/05407538/12OmNwG90gs",
"parentPublication": {
"id": "proceedings/isspit/2009/5949/0",
"title": "2009 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2014/05/06355919",
"title": "Synthesis of Stochastic Flow Networks",
"doi": null,
"abstractUrl": "/journal/tc/2014/05/06355919/13rRUEgs2Lg",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1994/07/e0506",
"title": "A Characterization of the Stochastic Process Underlying a Stochastic Petri Net",
"doi": null,
"abstractUrl": "/journal/ts/1994/07/e0506/13rRUyfKIJI",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wsc/1996/3383/0/00873308",
"title": "Discrete stochastic optimization via a modification of the stochastic ruler method",
"doi": null,
"abstractUrl": "/proceedings-article/wsc/1996/00873308/1D89kv9bh3G",
"parentPublication": {
"id": "proceedings/wsc/1996/3383/0",
"title": "Winter Simulation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccabs/2017/2594/0/08114285",
"title": "Calibration of stochastic biochemical models against behavioral temporal logic specifications",
"doi": null,
"abstractUrl": "/proceedings-article/iccabs/2017/08114285/1DICcfZ88xO",
"parentPublication": {
"id": "proceedings/iccabs/2017/2594/0",
"title": "2017 IEEE 7th International Conference on Computational Advances in Bio- and Medical Sciences (ICCABS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2019/4328/0/09047425",
"title": "Accelerated Stochastic Variational Inference",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-bdcloud-socialcom-sustaincom/2019/09047425/1iC6rO3XnfG",
"parentPublication": {
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2019/4328/0",
"title": "2019 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08078207",
"articleId": "17D45VTRouL",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08089386",
"articleId": "17D45XacGi0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesNA",
"name": "ttb201901-08107569s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttb201901-08107569s1.zip",
"extension": "zip",
"size": "229 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04Q",
"title": "Jan.",
"year": "2017",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxAASVX",
"doi": "10.1109/TVCG.2016.2598828",
"abstract": "Performance analysis is critical in applied machine learning because it influences the models practitioners produce. Current performance analysis tools suffer from issues including obscuring important characteristics of model behavior and dissociating performance from data. In this work, we present Squares, a performance visualization for multiclass classification problems. Squares supports estimating common performance metrics while displaying instance-level distribution information necessary for helping practitioners prioritize efforts and access data. Our controlled study shows that practitioners can assess performance significantly faster and more accurately with Squares than a confusion matrix, a common performance analysis tool in machine learning.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Performance analysis is critical in applied machine learning because it influences the models practitioners produce. Current performance analysis tools suffer from issues including obscuring important characteristics of model behavior and dissociating performance from data. In this work, we present Squares, a performance visualization for multiclass classification problems. Squares supports estimating common performance metrics while displaying instance-level distribution information necessary for helping practitioners prioritize efforts and access data. Our controlled study shows that practitioners can assess performance significantly faster and more accurately with Squares than a confusion matrix, a common performance analysis tool in machine learning.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Performance analysis is critical in applied machine learning because it influences the models practitioners produce. Current performance analysis tools suffer from issues including obscuring important characteristics of model behavior and dissociating performance from data. In this work, we present Squares, a performance visualization for multiclass classification problems. Squares supports estimating common performance metrics while displaying instance-level distribution information necessary for helping practitioners prioritize efforts and access data. Our controlled study shows that practitioners can assess performance significantly faster and more accurately with Squares than a confusion matrix, a common performance analysis tool in machine learning.",
"title": "Squares: Supporting Interactive Performance Analysis for Multiclass Classifiers",
"normalizedTitle": "Squares: Supporting Interactive Performance Analysis for Multiclass Classifiers",
"fno": "07539404",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Performance Analysis",
"Data Models",
"Debugging",
"Analytical Models",
"Data Visualization",
"Measurement",
"Visualization",
"Usable Machine Learning",
"Performance Analysis",
"Classification"
],
"authors": [
{
"givenName": "Donghao",
"surname": "Ren",
"fullName": "Donghao Ren",
"affiliation": "University of California, Santa Barbara",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Saleema",
"surname": "Amershi",
"fullName": "Saleema Amershi",
"affiliation": "Microsoft Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bongshin",
"surname": "Lee",
"fullName": "Bongshin Lee",
"affiliation": "Microsoft Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jina",
"surname": "Suh",
"fullName": "Jina Suh",
"affiliation": "Microsoft Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jason D.",
"surname": "Williams",
"fullName": "Jason D. Williams",
"affiliation": "Microsoft Research",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2017-01-01 00:00:00",
"pubType": "trans",
"pages": "61-70",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/uic-atc-scalcom/2014/7646/0/7646a583",
"title": "Partial Least Squares Improvement and Research Principal Component Regression Extraction Methods",
"doi": null,
"abstractUrl": "/proceedings-article/uic-atc-scalcom/2014/7646a583/12OmNvAS4qN",
"parentPublication": {
"id": "proceedings/uic-atc-scalcom/2014/7646/0",
"title": "2014 IEEE 11th Intl Conf on Ubiquitous Intelligence & Computing and 2014 IEEE 11th Intl Conf on Autonomic & Trusted Computing and 2014 IEEE 14th Intl Conf on Scalable Computing and Communications and Its Associated Workshops (UIC-ATC-ScalCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2006/2591/0/25910023",
"title": "A Constrained Least Squares Approach to Interactive Mesh Deformation",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2006/25910023/12OmNxGSm5e",
"parentPublication": {
"id": "proceedings/smi/2006/2591/0",
"title": "IEEE International Conference on Shape Modeling and Applications 2006",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicic/2008/3161/0/31610085",
"title": "Multiclass Least Squares Auto-Correlation Wavelet Support Vector Machines",
"doi": null,
"abstractUrl": "/proceedings-article/icicic/2008/31610085/12OmNy3147z",
"parentPublication": {
"id": "proceedings/icicic/2008/3161/0",
"title": "Innovative Computing ,Information and Control, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/06/ttg2011060850",
"title": "Motion-Sensitive Anchor Identification of Least-Squares Meshes from Examples",
"doi": null,
"abstractUrl": "/journal/tg/2011/06/ttg2011060850/13rRUNvgz9F",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sera/2018/5886/0/08477214",
"title": "Least-Squares Support Vector Machine for Semi-Supervised Multi-Tasking",
"doi": null,
"abstractUrl": "/proceedings-article/sera/2018/08477214/144U9bzjxRV",
"parentPublication": {
"id": "proceedings/sera/2018/5886/0",
"title": "2018 IEEE 16th International Conference on Software Engineering Research, Management and Applications (SERA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/09/09795241",
"title": "Diagnosing Ensemble Few-Shot Classifiers",
"doi": null,
"abstractUrl": "/journal/tg/2022/09/09795241/1Eb192ypuzS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2022/5444/0/544400a921",
"title": "Boosting Performance Optimization with Interactive Data Movement Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2022/544400a921/1I0bT76v0hq",
"parentPublication": {
"id": "proceedings/sc/2022/5444/0/",
"title": "SC22: International Conference for High Performance Computing, Networking, Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807255",
"title": "The What-If Tool: Interactive Probing of Machine Learning Models",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807255/1cG6piAXFwQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2019/9226/0/922600a313",
"title": "ComDia+: An Interactive Visual Analytics System for Comparing, Diagnosing, and Improving Multiclass Classifiers",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2019/922600a313/1cMF6RynL68",
"parentPublication": {
"id": "proceedings/pacificvis/2019/9226/0",
"title": "2019 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/09/09321557",
"title": "Task-Based Visual Interactive Modeling: Decision Trees and Rule-Based Classifiers",
"doi": null,
"abstractUrl": "/journal/tg/2022/09/09321557/1qmbp8bk4FO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07534792",
"articleId": "13rRUxDIthg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07539314",
"articleId": "13rRUwbJD4P",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1qL5hsvvVkc",
"title": "Feb.",
"year": "2021",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1nTqeahejo4",
"doi": "10.1109/TVCG.2020.3030449",
"abstract": "In this paper, we present a visual analytics tool for enabling hypothesis-based evaluation of machine learning (ML) models. We describe a novel ML-testing framework that combines the traditional statistical hypothesis testing (commonly used in empirical research) with logical reasoning about the conclusions of multiple hypotheses. The framework defines a controlled configuration for testing a number of hypotheses as to whether and how some extra information about a “concept” or “feature” may benefit or hinder an ML model. Because reasoning multiple hypotheses is not always straightforward, we provide HypoML as a visual analysis tool, with which, the multi-thread testing results are first transformed to analytical results using statistical and logical inferences, and then to a visual representation for rapid observation of the conclusions and the logical flow between the testing results and hypotheses. We have applied HypoML to a number of hypothesized concepts, demonstrating the intuitive and explainable nature of the visual analysis.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present a visual analytics tool for enabling hypothesis-based evaluation of machine learning (ML) models. We describe a novel ML-testing framework that combines the traditional statistical hypothesis testing (commonly used in empirical research) with logical reasoning about the conclusions of multiple hypotheses. The framework defines a controlled configuration for testing a number of hypotheses as to whether and how some extra information about a “concept” or “feature” may benefit or hinder an ML model. Because reasoning multiple hypotheses is not always straightforward, we provide HypoML as a visual analysis tool, with which, the multi-thread testing results are first transformed to analytical results using statistical and logical inferences, and then to a visual representation for rapid observation of the conclusions and the logical flow between the testing results and hypotheses. We have applied HypoML to a number of hypothesized concepts, demonstrating the intuitive and explainable nature of the visual analysis.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present a visual analytics tool for enabling hypothesis-based evaluation of machine learning (ML) models. We describe a novel ML-testing framework that combines the traditional statistical hypothesis testing (commonly used in empirical research) with logical reasoning about the conclusions of multiple hypotheses. The framework defines a controlled configuration for testing a number of hypotheses as to whether and how some extra information about a “concept” or “feature” may benefit or hinder an ML model. Because reasoning multiple hypotheses is not always straightforward, we provide HypoML as a visual analysis tool, with which, the multi-thread testing results are first transformed to analytical results using statistical and logical inferences, and then to a visual representation for rapid observation of the conclusions and the logical flow between the testing results and hypotheses. We have applied HypoML to a number of hypothesized concepts, demonstrating the intuitive and explainable nature of the visual analysis.",
"title": "HypoML: Visual Analysis for Hypothesis-based Evaluation of Machine Learning Models",
"normalizedTitle": "HypoML: Visual Analysis for Hypothesis-based Evaluation of Machine Learning Models",
"fno": "09222284",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Inference Mechanisms",
"Learning Artificial Intelligence",
"Multi Threading",
"Program Testing",
"Hypo ML",
"Hypothesis Based Evaluation",
"Machine Learning Models",
"Visual Analytics Tool",
"Statistical Hypothesis Testing",
"Logical Reasoning",
"Statistical Inferences",
"Logical Inferences",
"Visual Representation",
"Logical Flow",
"ML Testing Framework",
"Multithread Testing",
"Analytical Models",
"Testing",
"Data Models",
"Computational Modeling",
"Tools",
"Visualization",
"Neurons",
"Visual Analytics",
"Model Developmental Visualization",
"Machine Learning",
"Neural Network",
"Hypothesis Test",
"Hypo ML"
],
"authors": [
{
"givenName": "Qianwen",
"surname": "Wang",
"fullName": "Qianwen Wang",
"affiliation": "Hong Kong University of Science and Technology, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "William",
"surname": "Alexander",
"fullName": "William Alexander",
"affiliation": "University of Oxford, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jack",
"surname": "Pegg",
"fullName": "Jack Pegg",
"affiliation": "University of Oxford, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Qu",
"fullName": "Huamin Qu",
"affiliation": "Hong Kong University of Science and Technology, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Min",
"surname": "Chen",
"fullName": "Min Chen",
"affiliation": "University of Oxford, UK",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "1417-1426",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2019/01/08440124",
"title": "VIS4ML: An Ontology for Visual Analytics Assisted Machine Learning",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440124/17D45XfSETS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aitest/2022/8737/0/873700a034",
"title": "ML4ML: Automated Invariance Testing for Machine Learning Models",
"doi": null,
"abstractUrl": "/proceedings-article/aitest/2022/873700a034/1GZjWnXipP2",
"parentPublication": {
"id": "proceedings/aitest/2022/8737/0",
"title": "2022 IEEE International Conference On Artificial Intelligence Testing (AITest)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805457",
"title": "Visual Interaction with Deep Learning Models through Collaborative Semantic Inference",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805457/1cG4J3z5PX2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807255",
"title": "The What-If Tool: Interactive Probing of Machine Learning Models",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807255/1cG6piAXFwQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv-2/2019/2850/0/285000a116",
"title": "Visual (dis)Confirmation: Validating Models and Hypotheses with Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/iv-2/2019/285000a116/1cMEOINHDQk",
"parentPublication": {
"id": "proceedings/iv-2/2019/2850/0",
"title": "2019 23rd International Conference in Information Visualization – Part II",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08812989",
"title": "Separating the Wheat from the Chaff: Comparative Visual Cues for Transparent Diagnostics of Competing Models",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08812989/1cOhCCWc1uU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2020/6876/0/09139875",
"title": "XSP: Across-Stack Profiling and Analysis of Machine Learning Models on GPUs",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2020/09139875/1lsrZoQ4wM0",
"parentPublication": {
"id": "proceedings/ipdps/2020/6876/0",
"title": "2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aitest/2020/6984/0/09176814",
"title": "Attribute-based Granular Evaluation for Performance of Machine Learning Models",
"doi": null,
"abstractUrl": "/proceedings-article/aitest/2020/09176814/1mA9Uli6oV2",
"parentPublication": {
"id": "proceedings/aitest/2020/6984/0",
"title": "2020 IEEE International Conference On Artificial Intelligence Testing (AITest)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-nier/2021/0140/0/014000a066",
"title": "What Are We Really Testing in Mutation Testing for Machine Learning? A Critical Reflection",
"doi": null,
"abstractUrl": "/proceedings-article/icse-nier/2021/014000a066/1sEXsoxizyU",
"parentPublication": {
"id": "proceedings/icse-nier/2021/0140/0/",
"title": "2021 IEEE/ACM 43rd International Conference on Software Engineering: New Ideas and Emerging Results (ICSE-NIER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2021/3931/0/393100a001",
"title": "Visual Analysis on Machine Learning Assisted Prediction of Ionic Conductivity for Solid-State Electrolytes",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2021/393100a001/1tTtpOLXIrK",
"parentPublication": {
"id": "proceedings/pacificvis/2021/3931/0",
"title": "2021 IEEE 14th Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09222338",
"articleId": "1nTrGnbsuYg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09222255",
"articleId": "1nTrQTppqhi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qL857a79NS",
"name": "ttg202102-09222284s1-supp1-3030449.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222284s1-supp1-3030449.pdf",
"extension": "pdf",
"size": "7.37 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNz5apwQ",
"title": "January/February",
"year": "2001",
"issueNum": "01",
"idPrefix": "so",
"pubType": "magazine",
"volume": "18",
"label": "January/February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxly9bM",
"doi": "10.1109/52.903174",
"abstract": "Goal-oriented requirements analysis techniques provide ways to refine organizational and technical objectives, to more effectively explore alternatives during requirements definition. After selecting a set of alternatives to achieve these objectives, you can elaborate on them during subsequent phases to make them more precise and complete. The authors argue that goal-oriented analysis complements and strengthens traditional requirements analysis techniques by offering a means for capturing and evaluating alternative ways of meeting business goals. They detail the five main steps that comprise goal-oriented analysis. These steps include goal analysis, softgoal analysis, softgoal correlation analysis, goal correlation analysis, and evaluation of alternatives. To illustrate the main elements of the proposed analysis technique, they explore a typical scenario that involves defining requirements for a meeting scheduling system.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Goal-oriented requirements analysis techniques provide ways to refine organizational and technical objectives, to more effectively explore alternatives during requirements definition. After selecting a set of alternatives to achieve these objectives, you can elaborate on them during subsequent phases to make them more precise and complete. The authors argue that goal-oriented analysis complements and strengthens traditional requirements analysis techniques by offering a means for capturing and evaluating alternative ways of meeting business goals. They detail the five main steps that comprise goal-oriented analysis. These steps include goal analysis, softgoal analysis, softgoal correlation analysis, goal correlation analysis, and evaluation of alternatives. To illustrate the main elements of the proposed analysis technique, they explore a typical scenario that involves defining requirements for a meeting scheduling system.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Goal-oriented requirements analysis techniques provide ways to refine organizational and technical objectives, to more effectively explore alternatives during requirements definition. After selecting a set of alternatives to achieve these objectives, you can elaborate on them during subsequent phases to make them more precise and complete. The authors argue that goal-oriented analysis complements and strengthens traditional requirements analysis techniques by offering a means for capturing and evaluating alternative ways of meeting business goals. They detail the five main steps that comprise goal-oriented analysis. These steps include goal analysis, softgoal analysis, softgoal correlation analysis, goal correlation analysis, and evaluation of alternatives. To illustrate the main elements of the proposed analysis technique, they explore a typical scenario that involves defining requirements for a meeting scheduling system.",
"title": "Exploring alternatives during requirements analysis",
"normalizedTitle": "Exploring alternatives during requirements analysis",
"fno": "s1092",
"hasPdf": true,
"idPrefix": "so",
"keywords": [
"Systems Analysis",
"Formal Specification",
"Business Data Processing",
"Goal Oriented Requirements Analysis",
"Organizational Objectives",
"Requirements Definition",
"Business Goals",
"Goal Analysis",
"Softgoal Analysis",
"Softgoal Correlation Analysis",
"Goal Correlation Analysis",
"Meeting Scheduling System",
"Scheduling",
"Software Systems",
"Object Oriented Modeling",
"Usability"
],
"authors": [
{
"givenName": "J.",
"surname": "Mylopoulos",
"fullName": "J. Mylopoulos",
"affiliation": "Toronto Univ., Ont., Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "L.",
"surname": "Chung",
"fullName": "L. Chung",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "S.",
"surname": "Liao",
"fullName": "S. Liao",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "H.",
"surname": "Wang",
"fullName": "H. Wang",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "E.",
"surname": "Yu",
"fullName": "E. Yu",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2001-01-01 00:00:00",
"pubType": "mags",
"pages": "92-96",
"year": "2001",
"issn": "0740-7459",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icisa/2014/4443/0/06847407",
"title": "Goal-Oriented Requirements Analysis Using Goal Accumulation RDF Graph",
"doi": null,
"abstractUrl": "/proceedings-article/icisa/2014/06847407/12OmNAlNiAl",
"parentPublication": {
"id": "proceedings/icisa/2014/4443/0",
"title": "2014 International Conference on Information Science and Applications (ICISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/re/2014/3031/0/06912274",
"title": "GUITAR: An ontology-based automated requirements analysis tool",
"doi": null,
"abstractUrl": "/proceedings-article/re/2014/06912274/12OmNBO3KbP",
"parentPublication": {
"id": "proceedings/re/2014/3031/0",
"title": "2014 IEEE 22nd International Requirements Engineering Conference (RE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icesd/1994/5780/0/00302305",
"title": "Knowledge acquisition or requirements analysis?",
"doi": null,
"abstractUrl": "/proceedings-article/icesd/1994/00302305/12OmNBTawkj",
"parentPublication": {
"id": "proceedings/icesd/1994/5780/0",
"title": "Proceedings of International Conference on Expert Systems for Development",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmpsac/1988/0873/0/00017210",
"title": "Object-oriented requirements analysis (OORA)",
"doi": null,
"abstractUrl": "/proceedings-article/cmpsac/1988/00017210/12OmNqyUUyt",
"parentPublication": {
"id": "proceedings/cmpsac/1988/0873/0",
"title": "Proceedings COMPSAC 88: The Twelfth Annual International Computer Software & Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cere/2006/2712/0/04019689",
"title": "Evaluating the Effectiveness of a Goal-Oriented Requirements Engineering Method",
"doi": null,
"abstractUrl": "/proceedings-article/cere/2006/04019689/12OmNsbY6RZ",
"parentPublication": {
"id": "proceedings/cere/2006/2712/0",
"title": "Fourth International Workshop on Comparative Evaluation in Requirements Engineering (CERE'06 - RE'06 Workshop)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2009/3891/0/3891a674",
"title": "A Tool for Attributed Goal-Oriented Requirements Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2009/3891a674/12OmNsbY6U8",
"parentPublication": {
"id": "proceedings/ase/2009/3891/0",
"title": "2009 IEEE/ACM International Conference on Automated Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwssd/1993/4360/0/00315514",
"title": "Bridging the requirements gap: policies, goals and domains",
"doi": null,
"abstractUrl": "/proceedings-article/iwssd/1993/00315514/12OmNwFRpb9",
"parentPublication": {
"id": "proceedings/iwssd/1993/4360/0",
"title": "Proceedings of 1993 IEEE 7th International Workshop on Software Specification and Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/re/2008/3309/0/3309a247",
"title": "A Case Study in Eliciting Scalability Requirements",
"doi": null,
"abstractUrl": "/proceedings-article/re/2008/3309a247/12OmNwGIcBJ",
"parentPublication": {
"id": "proceedings/re/2008/3309/0",
"title": "2008 16th IEEE International Requirements Engineering Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/re/2002/1465/0/14650013",
"title": "AGORA: Attributed Goal-Oriented Requirements Analysis Method",
"doi": null,
"abstractUrl": "/proceedings-article/re/2002/14650013/12OmNxGSlZa",
"parentPublication": {
"id": "proceedings/re/2002/1465/0",
"title": "Proceedings IEEE Joint International Conference on Requirements Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2005/963/0/01553579",
"title": "Goal-centric traceability for managing non-functional requirements",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2005/01553579/12OmNxWLTAz",
"parentPublication": {
"id": "proceedings/icse/2005/963/0",
"title": "27th International Conference on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "s1004",
"articleId": "13rRUxDItfn",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1KpxetXSh1u",
"title": "Jan.-Feb.",
"year": "2023",
"issueNum": "01",
"idPrefix": "sp",
"pubType": "magazine",
"volume": "21",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1Jgwd2Ue8o0",
"doi": "10.1109/MSEC.2022.3221058",
"abstract": "This article focuses on supporting artificial intelligence (AI)/machine learning (ML) security workers. It presents AI/ML adversarial techniques, tools, and common knowledge (AI/ML ATT&CK) framework to enable AI/ML security workers to intuitively explore offensive and defensive tactics.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This article focuses on supporting artificial intelligence (AI)/machine learning (ML) security workers. It presents AI/ML adversarial techniques, tools, and common knowledge (AI/ML ATT&CK) framework to enable AI/ML security workers to intuitively explore offensive and defensive tactics.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This article focuses on supporting artificial intelligence (AI)/machine learning (ML) security workers. It presents AI/ML adversarial techniques, tools, and common knowledge (AI/ML ATT&CK) framework to enable AI/ML security workers to intuitively explore offensive and defensive tactics.",
"title": "Supporting Artificial Intelligence/Machine Learning Security Workers Through an Adversarial Techniques, Tools, and Common Knowledge Framework",
"normalizedTitle": "Supporting Artificial Intelligence/Machine Learning Security Workers Through an Adversarial Techniques, Tools, and Common Knowledge Framework",
"fno": "09994631",
"hasPdf": true,
"idPrefix": "sp",
"keywords": [
"Security",
"Artificial Intelligence",
"Computer Security",
"Data Models",
"Task Analysis",
"Machine Learning",
"Robustness",
"Personnel"
],
"authors": [
{
"givenName": "Mohamad",
"surname": "Fazelnia",
"fullName": "Mohamad Fazelnia",
"affiliation": "Global Cybersecurity Institute, Rochester Institute of Technology, Rochester, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ahmet",
"surname": "Okutan",
"fullName": "Ahmet Okutan",
"affiliation": "Global Cybersecurity Institute, Rochester Institute of Technology, Rochester, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mehdi",
"surname": "Mirakhorli",
"fullName": "Mehdi Mirakhorli",
"affiliation": "Department of Software Engineering, Rochester Institute of Technology, Rochester, NY, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "mags",
"pages": "37-48",
"year": "2023",
"issn": "1540-7993",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "mags/sp/2019/06/08705390",
"title": "Cybersecurity in the Era of Data Science: Examining New Adversarial Models",
"doi": null,
"abstractUrl": "/magazine/sp/2019/06/08705390/19JqaoeD3QQ",
"parentPublication": {
"id": "mags/sp",
"title": "IEEE Security & Privacy",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ai/5555/01/09850373",
"title": "Evasion Generative Adversarial Network for Low Data Regimes",
"doi": null,
"abstractUrl": "/journal/ai/5555/01/09850373/1Fz4TFQbS6I",
"parentPublication": {
"id": "trans/ai",
"title": "IEEE Transactions on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/it/2022/04/09897138",
"title": "Adversarial Attacks and Defenses for Deployed AI Models",
"doi": null,
"abstractUrl": "/magazine/it/2022/04/09897138/1GQIRIavuJW",
"parentPublication": {
"id": "mags/it",
"title": "IT Professional",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020844",
"title": "Efficient Evaluation of AI Workers for the Human+AI Crowd Task Assignment",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020844/1KfRpVGPixi",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fnwf/2022/6250/0/625000a943",
"title": "Artificial Intelligence And Machine Learning",
"doi": null,
"abstractUrl": "/proceedings-article/fnwf/2022/625000a943/1LlH6T324E0",
"parentPublication": {
"id": "proceedings/fnwf/2022/6250/0",
"title": "2022 IEEE Future Networks World Forum (FNWF)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cogmi/2022/7406/0/740600a027",
"title": "Inference for Trustworthy Machine Intelligence: Challenges and Solutions",
"doi": null,
"abstractUrl": "/proceedings-article/cogmi/2022/740600a027/1Lu4j0krhzq",
"parentPublication": {
"id": "proceedings/cogmi/2022/7406/0",
"title": "2022 IEEE 4th International Conference on Cognitive Machine Intelligence (CogMI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2019/12/08909930",
"title": "Grand Challenge: Applying Artificial Intelligence and Machine Learning to Cybersecurity",
"doi": null,
"abstractUrl": "/magazine/co/2019/12/08909930/1f8KF8LI9JC",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issrew/2019/5138/0/513800a013",
"title": "Adapting SQuaRE for Quality Assessment of Artificial Intelligence Systems",
"doi": null,
"abstractUrl": "/proceedings-article/issrew/2019/513800a013/1hrL3kIp116",
"parentPublication": {
"id": "proceedings/issrew/2019/5138/0",
"title": "2019 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2021/05/09426997",
"title": "Adversarial Machine Learning: Attacks From Laboratories to the Real World",
"doi": null,
"abstractUrl": "/magazine/co/2021/05/09426997/1tuvFoGyzK0",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/it/2021/05/09568267",
"title": "Economics of Artificial Intelligence in Cybersecurity",
"doi": null,
"abstractUrl": "/magazine/it/2021/05/09568267/1xDLKuyAQko",
"parentPublication": {
"id": "mags/it",
"title": "IT Professional",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10034845",
"articleId": "1KpxeETZYLC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09904426",
"articleId": "1H1gy5YE4r6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1qL5hsvvVkc",
"title": "Feb.",
"year": "2021",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1nTrGnbsuYg",
"doi": "10.1109/TVCG.2020.3030380",
"abstract": "To mitigate the pain of manually tuning hyperparameters of deep neural networks, automated machine learning (AutoML) methods have been developed to search for an optimal set of hyperparameters in large combinatorial search spaces. However, the search results of AutoML methods significantly depend on initial configurations, making it a non-trivial task to find a proper configuration. Therefore, human intervention via a visual analytic approach bears huge potential in this task. In response, we propose HyperTendril, a web-based visual analytics system that supports user-driven hyperparameter tuning processes in a model-agnostic environment. HyperTendril takes a novel approach to effectively steering hyperparameter optimization through an iterative, interactive tuning procedure that allows users to refine the search spaces and the configuration of the AutoML method based on their own insights from given results. Using HyperTendril, users can obtain insights into the complex behaviors of various hyperparameter search algorithms and diagnose their configurations. In addition, HyperTendril supports variable importance analysis to help the users refine their search spaces based on the analysis of relative importance of different hyperparameters and their interaction effects. We present the evaluation demonstrating how HyperTendril helps users steer their tuning processes via a longitudinal user study based on the analysis of interaction logs and in-depth interviews while we deploy our system in a professional industrial environment.",
"abstracts": [
{
"abstractType": "Regular",
"content": "To mitigate the pain of manually tuning hyperparameters of deep neural networks, automated machine learning (AutoML) methods have been developed to search for an optimal set of hyperparameters in large combinatorial search spaces. However, the search results of AutoML methods significantly depend on initial configurations, making it a non-trivial task to find a proper configuration. Therefore, human intervention via a visual analytic approach bears huge potential in this task. In response, we propose HyperTendril, a web-based visual analytics system that supports user-driven hyperparameter tuning processes in a model-agnostic environment. HyperTendril takes a novel approach to effectively steering hyperparameter optimization through an iterative, interactive tuning procedure that allows users to refine the search spaces and the configuration of the AutoML method based on their own insights from given results. Using HyperTendril, users can obtain insights into the complex behaviors of various hyperparameter search algorithms and diagnose their configurations. In addition, HyperTendril supports variable importance analysis to help the users refine their search spaces based on the analysis of relative importance of different hyperparameters and their interaction effects. We present the evaluation demonstrating how HyperTendril helps users steer their tuning processes via a longitudinal user study based on the analysis of interaction logs and in-depth interviews while we deploy our system in a professional industrial environment.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "To mitigate the pain of manually tuning hyperparameters of deep neural networks, automated machine learning (AutoML) methods have been developed to search for an optimal set of hyperparameters in large combinatorial search spaces. However, the search results of AutoML methods significantly depend on initial configurations, making it a non-trivial task to find a proper configuration. Therefore, human intervention via a visual analytic approach bears huge potential in this task. In response, we propose HyperTendril, a web-based visual analytics system that supports user-driven hyperparameter tuning processes in a model-agnostic environment. HyperTendril takes a novel approach to effectively steering hyperparameter optimization through an iterative, interactive tuning procedure that allows users to refine the search spaces and the configuration of the AutoML method based on their own insights from given results. Using HyperTendril, users can obtain insights into the complex behaviors of various hyperparameter search algorithms and diagnose their configurations. In addition, HyperTendril supports variable importance analysis to help the users refine their search spaces based on the analysis of relative importance of different hyperparameters and their interaction effects. We present the evaluation demonstrating how HyperTendril helps users steer their tuning processes via a longitudinal user study based on the analysis of interaction logs and in-depth interviews while we deploy our system in a professional industrial environment.",
"title": "HyperTendril: Visual Analytics for User-Driven Hyperparameter Optimization of Deep Neural Networks",
"normalizedTitle": "HyperTendril: Visual Analytics for User-Driven Hyperparameter Optimization of Deep Neural Networks",
"fno": "09222338",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Combinatorial Mathematics",
"Data Analysis",
"Data Visualisation",
"Deep Learning Artificial Intelligence",
"Interactive Systems",
"Optimisation",
"Search Problems",
"Hyper Tendril",
"Interactive Tuning Procedure",
"Auto ML Method",
"Hyperparameter Search Algorithms",
"Hyperparameter Optimization",
"Deep Neural Networks",
"Automated Machine Learning",
"Combinatorial Search Spaces",
"Web Based Visual Analytics System",
"Hyperparameter Tuning Processes",
"Analytical Models",
"Optimization",
"Visual Analytics",
"Task Analysis",
"Computational Modeling",
"Neural Networks",
"Deep Learning",
"Visual Analytics",
"Deep Learning",
"Machine Learning",
"Automated Machine Learning",
"Human Centered Computing"
],
"authors": [
{
"givenName": "Heungseok",
"surname": "Park",
"fullName": "Heungseok Park",
"affiliation": "Clova AI Research, NAVER Corporation",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yoonsoo",
"surname": "Nam",
"fullName": "Yoonsoo Nam",
"affiliation": "Clova AI Research, NAVER Corporation",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ji-Hoon",
"surname": "Kim",
"fullName": "Ji-Hoon Kim",
"affiliation": "Clova AI Research, NAVER Corporation",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jaegul",
"surname": "Choo",
"fullName": "Jaegul Choo",
"affiliation": "KAIST",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "1407-1416",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wacv/2018/4886/0/488601a738",
"title": "SHADHO: Massively Scalable Hardware-Aware Distributed Hyperparameter Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2018/488601a738/12OmNAqU4X3",
"parentPublication": {
"id": "proceedings/wacv/2018/4886/0",
"title": "2018 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2015/9504/0/9504b033",
"title": "Sequential Model-Free Hyperparameter Tuning",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2015/9504b033/12OmNyQGShN",
"parentPublication": {
"id": "proceedings/icdm/2015/9504/0",
"title": "2015 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbac-pad/2018/7769/0/08645954",
"title": "HyperSpace: Distributed Bayesian Hyperparameter Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/sbac-pad/2018/08645954/17QjJeMNGbZ",
"parentPublication": {
"id": "proceedings/sbac-pad/2018/7769/0",
"title": "2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cogmi/2021/1621/0/162100a262",
"title": "Enabling Hyperparameter Tuning of Machine Learning Classifiers in Production",
"doi": null,
"abstractUrl": "/proceedings-article/cogmi/2021/162100a262/1CxzW7ldMWI",
"parentPublication": {
"id": "proceedings/cogmi/2021/1621/0",
"title": "2021 IEEE Third International Conference on Cognitive Machine Intelligence (CogMI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/5555/01/10018302",
"title": "Hyperparameter Learning for Deep Learning-based Recommender Systems",
"doi": null,
"abstractUrl": "/journal/sc/5555/01/10018302/1JYYVqmBdaE",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlui/2018/4063/0/10075647",
"title": "HyperTuner: Visual Analytics for Hyperparameter Tuning by Professionals",
"doi": null,
"abstractUrl": "/proceedings-article/mlui/2018/10075647/1LIRyBc2BXi",
"parentPublication": {
"id": "proceedings/mlui/2018/4063/0",
"title": "2018 IEEE Workshop on Machine Learning from User Interaction for Visualization and Analytics (MLUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2019/3798/0/379800a170",
"title": "Deep Reinforcement Learning with Model-Based Acceleration for Hyperparameter Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2019/379800a170/1hrLQucJsXK",
"parentPublication": {
"id": "proceedings/ictai/2019/3798/0",
"title": "2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2019/3798/0/379800b412",
"title": "Hyperparameter Tuning using Quantum Genetic Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2019/379800b412/1hrLUtbsdS8",
"parentPublication": {
"id": "proceedings/ictai/2019/3798/0",
"title": "2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2021/0296/0/029600a175",
"title": "Resource-Guided Configuration Space Reduction for Deep Learning Models",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2021/029600a175/1sEXnE3Bw9a",
"parentPublication": {
"id": "proceedings/icse/2021/0296/0/",
"title": "2021 IEEE/ACM 43rd International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iri/2021/3875/0/387500a348",
"title": "Impact of Hyperparameter Tuning in Classifying Highly Imbalanced Big Data",
"doi": null,
"abstractUrl": "/proceedings-article/iri/2021/387500a348/1yBG9g9WNKo",
"parentPublication": {
"id": "proceedings/iri/2021/3875/0",
"title": "2021 IEEE 22nd International Conference on Information Reuse and Integration for Data Science (IRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09222325",
"articleId": "1nTrMkbZAQg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09222284",
"articleId": "1nTqeahejo4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLgJtbIdZm",
"name": "ttg202102-09222338s1-supp1-3030380.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222338s1-supp1-3030380.mp4",
"extension": "mp4",
"size": "163 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1H2llxba9ws",
"doi": "10.1109/TVCG.2022.3209493",
"abstract": "During the COVID-19 pandemic, a number of data visualizations were created to inform the public about the rapidly evolving crisis. Data dashboards, a form of information dissemination used during the pandemic, have facilitated this process by visualizing statistics regarding the number of COVID-19 cases over time. Prior work on COVID-19 visualizations has primarily focused on the design and evaluation of specific visualization systems from technology-centered perspectives. However, little is known about what occurs behind the scenes during the visualization creation processes, given the complex sociotechnical contexts in which they are embedded. Yet, such ecological knowledge is necessary to help characterize the nuances and trajectories of visualization design practices in the wild, as well as generate insights into how creators come to understand and approach visualization design on their own terms and for their own situated purposes. In this research, we conducted a qualitative interview study among dashboard creators from federal agencies, state health departments, mainstream news media outlets, and other organizations that created (often widely-used) COVID-19 dashboards to answer the following questions: how did visualization creators engage in COVID-19 dashboard design, and what tensions, conflicts, and challenges arose during this process? Our findings detail the trajectory of design practices—from creation to expansion, maintenance, and termination—that are shaped by the complex interplay between design goals, tools and technologies, labor, emerging crisis contexts, and public engagement. We particularly examined the tensions between designers and the general public involved in these processes. These conflicts, which often materialized due to a divergence between public demands and standing policies, centered around the type and amount of information to be visualized, how public perceptions shape and are shaped by visualization design, and the strategies utilized to deal with (potential) misinterpretations and misuse of visualizations. Our findings and lessons learned shed light on new ways of thinking in visualization design, focusing on the bundled activities that are invariably involved in human and nonhuman participation throughout the entire trajectory of design practice.",
"abstracts": [
{
"abstractType": "Regular",
"content": "During the COVID-19 pandemic, a number of data visualizations were created to inform the public about the rapidly evolving crisis. Data dashboards, a form of information dissemination used during the pandemic, have facilitated this process by visualizing statistics regarding the number of COVID-19 cases over time. Prior work on COVID-19 visualizations has primarily focused on the design and evaluation of specific visualization systems from technology-centered perspectives. However, little is known about what occurs behind the scenes during the visualization creation processes, given the complex sociotechnical contexts in which they are embedded. Yet, such ecological knowledge is necessary to help characterize the nuances and trajectories of visualization design practices in the wild, as well as generate insights into how creators come to understand and approach visualization design on their own terms and for their own situated purposes. In this research, we conducted a qualitative interview study among dashboard creators from federal agencies, state health departments, mainstream news media outlets, and other organizations that created (often widely-used) COVID-19 dashboards to answer the following questions: how did visualization creators engage in COVID-19 dashboard design, and what tensions, conflicts, and challenges arose during this process? Our findings detail the trajectory of design practices—from creation to expansion, maintenance, and termination—that are shaped by the complex interplay between design goals, tools and technologies, labor, emerging crisis contexts, and public engagement. We particularly examined the tensions between designers and the general public involved in these processes. These conflicts, which often materialized due to a divergence between public demands and standing policies, centered around the type and amount of information to be visualized, how public perceptions shape and are shaped by visualization design, and the strategies utilized to deal with (potential) misinterpretations and misuse of visualizations. Our findings and lessons learned shed light on new ways of thinking in visualization design, focusing on the bundled activities that are invariably involved in human and nonhuman participation throughout the entire trajectory of design practice.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "During the COVID-19 pandemic, a number of data visualizations were created to inform the public about the rapidly evolving crisis. Data dashboards, a form of information dissemination used during the pandemic, have facilitated this process by visualizing statistics regarding the number of COVID-19 cases over time. Prior work on COVID-19 visualizations has primarily focused on the design and evaluation of specific visualization systems from technology-centered perspectives. However, little is known about what occurs behind the scenes during the visualization creation processes, given the complex sociotechnical contexts in which they are embedded. Yet, such ecological knowledge is necessary to help characterize the nuances and trajectories of visualization design practices in the wild, as well as generate insights into how creators come to understand and approach visualization design on their own terms and for their own situated purposes. In this research, we conducted a qualitative interview study among dashboard creators from federal agencies, state health departments, mainstream news media outlets, and other organizations that created (often widely-used) COVID-19 dashboards to answer the following questions: how did visualization creators engage in COVID-19 dashboard design, and what tensions, conflicts, and challenges arose during this process? Our findings detail the trajectory of design practices—from creation to expansion, maintenance, and termination—that are shaped by the complex interplay between design goals, tools and technologies, labor, emerging crisis contexts, and public engagement. We particularly examined the tensions between designers and the general public involved in these processes. These conflicts, which often materialized due to a divergence between public demands and standing policies, centered around the type and amount of information to be visualized, how public perceptions shape and are shaped by visualization design, and the strategies utilized to deal with (potential) misinterpretations and misuse of visualizations. Our findings and lessons learned shed light on new ways of thinking in visualization design, focusing on the bundled activities that are invariably involved in human and nonhuman participation throughout the entire trajectory of design practice.",
"title": "Visualization Design Practices in a Crisis: Behind the Scenes with COVID-19 Dashboard Creators",
"normalizedTitle": "Visualization Design Practices in a Crisis: Behind the Scenes with COVID-19 Dashboard Creators",
"fno": "09904866",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Aided Instruction",
"Data Visualisation",
"Ecology",
"Human Factors",
"Information Dissemination",
"COVID 19 Cases",
"COVID 19 Dashboard Creators",
"COVID 19 Dashboard Design",
"COVID 19 Dashboards",
"COVID 19 Pandemic",
"COVID 19 Visualizations",
"Data Dashboards",
"Data Visualizations",
"Design Practice",
"Design Practices From Creation",
"Misinterpretations",
"Rapidly Evolving Crisis",
"Specific Visualization Systems",
"Visualization Creation Processes",
"Visualization Creators",
"Visualization Design Practices",
"Data Visualization",
"COVID 19",
"Visualization",
"Pandemics",
"Trajectory",
"Production",
"Interviews",
"Design Practices",
"Data Visualization",
"COVID 19",
"Qualitative Research",
"General Public",
"Public Health",
"Crisis",
"Dashboard"
],
"authors": [
{
"givenName": "Yixuan",
"surname": "Zhang",
"fullName": "Yixuan Zhang",
"affiliation": "The Georgia Institute of Technology, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yifan",
"surname": "Sun",
"fullName": "Yifan Sun",
"affiliation": "The College of William & Mary, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Joseph D.",
"surname": "Gaggiano",
"fullName": "Joseph D. Gaggiano",
"affiliation": "The Georgia Institute of Technology, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Neha",
"surname": "Kumar",
"fullName": "Neha Kumar",
"affiliation": "The Georgia Institute of Technology, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Clio",
"surname": "Andris",
"fullName": "Clio Andris",
"affiliation": "The Georgia Institute of Technology, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrea G.",
"surname": "Parker",
"fullName": "Andrea G. Parker",
"affiliation": "The Georgia Institute of Technology, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "1037-1047",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/big-data/2021/3902/0/09671817",
"title": "Learning Domain-Specific Word Embeddings from COVID-19 Tweets",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2021/09671817/1A8h27XaO2Y",
"parentPublication": {
"id": "proceedings/big-data/2021/3902/0",
"title": "2021 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsec/2021/3784/0/378400a285",
"title": "Pandemic Software Development: The Student Experiences from Developing a COVID-19 Information Dashboard",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2021/378400a285/1B4mbivkAaQ",
"parentPublication": {
"id": "proceedings/apsec/2021/3784/0",
"title": "2021 28th Asia-Pacific Software Engineering Conference (APSEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ic/2022/02/09721272",
"title": "Unpacking Misinformation Amid the COVID-19 Pandemic: A Mixed Methods Study",
"doi": null,
"abstractUrl": "/magazine/ic/2022/02/09721272/1Bhz0cZpHOM",
"parentPublication": {
"id": "mags/ic",
"title": "IEEE Internet Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-seis/2022/9594/0/959400a149",
"title": "Software Engineers‘ Response to Public Crisis: Lessons Learnt from Spontaneously Building an Informative COVID-19 Dashboard",
"doi": null,
"abstractUrl": "/proceedings-article/icse-seis/2022/959400a149/1Emrjl5Ao7u",
"parentPublication": {
"id": "proceedings/icse-seis/2022/9594/0",
"title": "2022 IEEE/ACM 44th International Conference on Software Engineering: Software Engineering in Society (ICSE-SEIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2021/5841/0/584100a238",
"title": "Data Visualization Tool for Covid-19 and Crime Data",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2021/584100a238/1EpLLBX6oDe",
"parentPublication": {
"id": "proceedings/csci/2021/5841/0",
"title": "2021 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2022/5661/0/10068592",
"title": "Portuguese Twitter Dataset on COVID-19",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2022/10068592/1LKx0Zgn8be",
"parentPublication": {
"id": "proceedings/asonam/2022/5661/0",
"title": "2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/beliv/2020/9642/0/964200a065",
"title": "Understanding User Experience of COVID-19 Maps through Remote Elicitation Interviews",
"doi": null,
"abstractUrl": "/proceedings-article/beliv/2020/964200a065/1q0FOJPYeFG",
"parentPublication": {
"id": "proceedings/beliv/2020/9642/0",
"title": "2020 IEEE Workshop on Evaluation and Beyond - Methodological Approaches to Visualization (BELIV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2020/6251/0/09378301",
"title": "Mask Mandates and COVID-19 Infection Growth Rates",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09378301/1s656uoD0mA",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/it/2021/04/09520215",
"title": "Could Blockchain Help With COVID-19 Crisis?",
"doi": null,
"abstractUrl": "/magazine/it/2021/04/09520215/1wdNWWj4hgc",
"parentPublication": {
"id": "mags/it",
"title": "IT Professional",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2021/3851/0/09637439",
"title": "Online Yet More Personal: Professors Respond to COVID-19 Crisis",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2021/09637439/1zuvULnHMmQ",
"parentPublication": {
"id": "proceedings/fie/2021/3851/0",
"title": "2021 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09906559",
"articleId": "1H5F2wJXT4Q",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09903579",
"articleId": "1GZomJYdZQY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1J9yTLjNQaY",
"name": "ttg202301-09904866s1-supp1-3209493.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09904866s1-supp1-3209493.pdf",
"extension": "pdf",
"size": "87.4 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1qL5hsvvVkc",
"title": "Feb.",
"year": "2021",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1nTqCVWgoWk",
"doi": "10.1109/TVCG.2020.3030405",
"abstract": "Design study is an established approach of conducting problem-driven visualization research. The academic visualization community has produced a large body of work for reporting on design studies, informed by a handful of theoretical frameworks, and applied to a broad range of application areas. The result is an abundance of reported insights into visualization design, with an emphasis on novel visualization techniques and systems as the primary contribution of these studies. In recent work we proposed a new, interpretivist perspective on design study and six companion criteria for rigor that highlight the opportunities for researchers to contribute knowledge that extends beyond visualization idioms and software. In this work we conducted a year-long collaboration with evolutionary biologists to develop an interactive tool for visual exploration of multivariate datasets and phylogenetic trees. During this design study we experimented with methods to support three of the rigor criteria: ABUNDANT, REFLEXIVE, and TRANSPARENT. As a result we contribute two novel visualization techniques for the analysis of multivariate phylogenetic datasets, three methodological recommendations for conducting design studies drawn from reflections over our process of experimentation, and two writing devices for reporting interpretivist design study. We offer this work as an example for implementing the rigor criteria to produce a diverse range of knowledge contributions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Design study is an established approach of conducting problem-driven visualization research. The academic visualization community has produced a large body of work for reporting on design studies, informed by a handful of theoretical frameworks, and applied to a broad range of application areas. The result is an abundance of reported insights into visualization design, with an emphasis on novel visualization techniques and systems as the primary contribution of these studies. In recent work we proposed a new, interpretivist perspective on design study and six companion criteria for rigor that highlight the opportunities for researchers to contribute knowledge that extends beyond visualization idioms and software. In this work we conducted a year-long collaboration with evolutionary biologists to develop an interactive tool for visual exploration of multivariate datasets and phylogenetic trees. During this design study we experimented with methods to support three of the rigor criteria: ABUNDANT, REFLEXIVE, and TRANSPARENT. As a result we contribute two novel visualization techniques for the analysis of multivariate phylogenetic datasets, three methodological recommendations for conducting design studies drawn from reflections over our process of experimentation, and two writing devices for reporting interpretivist design study. We offer this work as an example for implementing the rigor criteria to produce a diverse range of knowledge contributions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Design study is an established approach of conducting problem-driven visualization research. The academic visualization community has produced a large body of work for reporting on design studies, informed by a handful of theoretical frameworks, and applied to a broad range of application areas. The result is an abundance of reported insights into visualization design, with an emphasis on novel visualization techniques and systems as the primary contribution of these studies. In recent work we proposed a new, interpretivist perspective on design study and six companion criteria for rigor that highlight the opportunities for researchers to contribute knowledge that extends beyond visualization idioms and software. In this work we conducted a year-long collaboration with evolutionary biologists to develop an interactive tool for visual exploration of multivariate datasets and phylogenetic trees. During this design study we experimented with methods to support three of the rigor criteria: ABUNDANT, REFLEXIVE, and TRANSPARENT. As a result we contribute two novel visualization techniques for the analysis of multivariate phylogenetic datasets, three methodological recommendations for conducting design studies drawn from reflections over our process of experimentation, and two writing devices for reporting interpretivist design study. We offer this work as an example for implementing the rigor criteria to produce a diverse range of knowledge contributions.",
"title": "Insights From Experiments With Rigor in an EvoBio Design Study",
"normalizedTitle": "Insights From Experiments With Rigor in an EvoBio Design Study",
"fno": "09222089",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Biology Computing",
"Data Visualisation",
"Evolution Biological",
"Genetics",
"Interactive Systems",
"Interactive Tool",
"Multivariate Phylogenetic Datasets",
"Phylogenetic Trees",
"Evolutionary Biologists",
"TRANSPARENT",
"REFLEXIVE",
"ABUNDANT",
"Visual Exploration",
"Academic Visualization Community",
"Problem Driven Visualization Research",
"Evo Bio Design Study",
"Visualization",
"Human Computer Interaction",
"Software",
"Collaboration",
"Tools",
"Phylogeny",
"Methodologies",
"Application Motivated Visualization",
"Guidelines",
"Life Sciences Visualization",
"Health",
"Medicine",
"Biology",
"Bioinformatics",
"Genomics"
],
"authors": [
{
"givenName": "Jen",
"surname": "Rogers",
"fullName": "Jen Rogers",
"affiliation": "University of Utah",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Austin H.",
"surname": "Patton",
"fullName": "Austin H. Patton",
"affiliation": "Washington State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Luke",
"surname": "Harmon",
"fullName": "Luke Harmon",
"affiliation": "University of Idaho",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alexander",
"surname": "Lex",
"fullName": "Alexander Lex",
"affiliation": "University of Utah",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Miriah",
"surname": "Meyer",
"fullName": "Miriah Meyer",
"affiliation": "University of Utah",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "1106-1116",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cluster/2014/5548/0/06968779",
"title": "Applying OpenMP-based parallel implementations of NSGA-II and SPEA2 to study phylogenetic relationships",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2014/06968779/12OmNqzu6Ro",
"parentPublication": {
"id": "proceedings/cluster/2014/5548/0",
"title": "2014 IEEE International Conference On Cluster Computing (CLUSTER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2012/4525/0/4525a373",
"title": "Designing for Distributed Scientific Collaboration: A Case Study in an Animal Health Laboratory",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2012/4525a373/12OmNwtn3vt",
"parentPublication": {
"id": "proceedings/hicss/2012/4525/0",
"title": "2012 45th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smartcity/2015/1893/0/1893a792",
"title": "SoTree: An Automated Phylogeny Assembly Tool for Ecologists from Big Tree",
"doi": null,
"abstractUrl": "/proceedings-article/smartcity/2015/1893a792/12OmNyaGeKY",
"parentPublication": {
"id": "proceedings/smartcity/2015/1893/0",
"title": "2015 IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017610",
"title": "Activity-Centered Domain Characterization for Problem-Driven Scientific Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017610/13rRUwhHcQX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539629",
"title": "VizItCards: A Card-Based Toolkit for Infovis Design Education",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539629/13rRUxOdD8l",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192692",
"title": "VEEVVIE: Visual Explorer for Empirical Visualization, VR and Interaction Experiments",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192692/13rRUyeTVi5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/09/08636969",
"title": "Aggregated Dendrograms for Visual Comparison between Many Phylogenetic Trees",
"doi": null,
"abstractUrl": "/journal/tg/2020/09/08636969/17D45WXIkG8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlhcc/2017/0443/0/08103461",
"title": "Gender HCl and microsoft: Highlights from a longitudinal study",
"doi": null,
"abstractUrl": "/proceedings-article/vlhcc/2017/08103461/17D45Xq6dA0",
"parentPublication": {
"id": "proceedings/vlhcc/2017/0443/0",
"title": "2017 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08809711",
"title": "Criteria for Rigor in Visualization Design Study",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08809711/1cHEhulnRJK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09286505",
"title": "Argus: Interactive a priori Power Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09286505/1por3E5EhCU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09229242",
"articleId": "1o3nvQqSIQ8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09237132",
"articleId": "1o8magPNnz2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCaLEju",
"title": "Jan.",
"year": "2018",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvyaf6",
"doi": "10.1109/TVCG.2017.2743939",
"abstract": "Evaluating the effectiveness of data visualizations is a challenging undertaking and often relies on one-off studies that test a visualization in the context of one specific task. Researchers across the fields of data science, visualization, and human-computer interaction are calling for foundational tools and principles that could be applied to assessing the effectiveness of data visualizations in a more rapid and generalizable manner. One possibility for such a tool is a model of visual saliency for data visualizations. Visual saliency models are typically based on the properties of the human visual cortex and predict which areas of a scene have visual features (e.g. color, luminance, edges) that are likely to draw a viewer's attention. While these models can accurately predict where viewers will look in a natural scene, they typically do not perform well for abstract data visualizations. In this paper, we discuss the reasons for the poor performance of existing saliency models when applied to data visualizations. We introduce the Data Visualization Saliency (DVS) model, a saliency model tailored to address some of these weaknesses, and we test the performance of the DVS model and existing saliency models by comparing the saliency maps produced by the models to eye tracking data obtained from human viewers. Finally, we describe how modified saliency models could be used as general tools for assessing the effectiveness of visualizations, including the strengths and weaknesses of this approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Evaluating the effectiveness of data visualizations is a challenging undertaking and often relies on one-off studies that test a visualization in the context of one specific task. Researchers across the fields of data science, visualization, and human-computer interaction are calling for foundational tools and principles that could be applied to assessing the effectiveness of data visualizations in a more rapid and generalizable manner. One possibility for such a tool is a model of visual saliency for data visualizations. Visual saliency models are typically based on the properties of the human visual cortex and predict which areas of a scene have visual features (e.g. color, luminance, edges) that are likely to draw a viewer's attention. While these models can accurately predict where viewers will look in a natural scene, they typically do not perform well for abstract data visualizations. In this paper, we discuss the reasons for the poor performance of existing saliency models when applied to data visualizations. We introduce the Data Visualization Saliency (DVS) model, a saliency model tailored to address some of these weaknesses, and we test the performance of the DVS model and existing saliency models by comparing the saliency maps produced by the models to eye tracking data obtained from human viewers. Finally, we describe how modified saliency models could be used as general tools for assessing the effectiveness of visualizations, including the strengths and weaknesses of this approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Evaluating the effectiveness of data visualizations is a challenging undertaking and often relies on one-off studies that test a visualization in the context of one specific task. Researchers across the fields of data science, visualization, and human-computer interaction are calling for foundational tools and principles that could be applied to assessing the effectiveness of data visualizations in a more rapid and generalizable manner. One possibility for such a tool is a model of visual saliency for data visualizations. Visual saliency models are typically based on the properties of the human visual cortex and predict which areas of a scene have visual features (e.g. color, luminance, edges) that are likely to draw a viewer's attention. While these models can accurately predict where viewers will look in a natural scene, they typically do not perform well for abstract data visualizations. In this paper, we discuss the reasons for the poor performance of existing saliency models when applied to data visualizations. We introduce the Data Visualization Saliency (DVS) model, a saliency model tailored to address some of these weaknesses, and we test the performance of the DVS model and existing saliency models by comparing the saliency maps produced by the models to eye tracking data obtained from human viewers. Finally, we describe how modified saliency models could be used as general tools for assessing the effectiveness of visualizations, including the strengths and weaknesses of this approach.",
"title": "Data Visualization Saliency Model: A Tool for Evaluating Abstract Data Visualizations",
"normalizedTitle": "Data Visualization Saliency Model: A Tool for Evaluating Abstract Data Visualizations",
"fno": "08017597",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Visualization",
"Measurement",
"Data Models",
"Brain Modeling",
"Predictive Models",
"Tools",
"Visual Saliency",
"Evaluation",
"Eye Tracking"
],
"authors": [
{
"givenName": "Laura E.",
"surname": "Matzen",
"fullName": "Laura E. Matzen",
"affiliation": "Sandia National Laboratories",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael J.",
"surname": "Haass",
"fullName": "Michael J. Haass",
"affiliation": "Sandia National Laboratories",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kristin M.",
"surname": "Divis",
"fullName": "Kristin M. Divis",
"affiliation": "Sandia National Laboratories",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhiyuan",
"surname": "Wang",
"fullName": "Zhiyuan Wang",
"affiliation": "University of Illinois, Urbana-Champaign",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrew T.",
"surname": "Wilson",
"fullName": "Andrew T. Wilson",
"affiliation": "Sandia National Laboratories",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "trans",
"pages": "563-573",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2018/01/08019855",
"title": "Conceptual and Methodological Issues in Evaluating Multidimensional Visualizations for Decision Support",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08019855/13rRUB6Sq0E",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2019/12/08444709",
"title": "Personalized Saliency and Its Prediction",
"doi": null,
"abstractUrl": "/journal/tp/2019/12/08444709/13rRUy3gn8N",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2018/6100/0/610000c081",
"title": "Audio-Visual Temporal Saliency Modeling Validated by fMRI Data",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2018/610000c081/17D45XeKgpt",
"parentPublication": {
"id": "proceedings/cvprw/2018/6100/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cost/2022/6248/0/624800a263",
"title": "Evaluation of Auditory Saliency Model Based on Saliency Map",
"doi": null,
"abstractUrl": "/proceedings-article/cost/2022/624800a263/1H2pgBgzDri",
"parentPublication": {
"id": "proceedings/cost/2022/6248/0",
"title": "2022 International Conference on Culture-Oriented Science and Technology (CoST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600g097",
"title": "CYBORG: Blending Human Saliency Into the Loss Improves Deep Learning-Based Synthetic Face Detection",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600g097/1KxV9JMgsNi",
"parentPublication": {
"id": "proceedings/wacv/2023/9346/0",
"title": "2023 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/05/08744242",
"title": "Data2Vis: Automatic Generation of Data Visualizations Using Sequence-to-Sequence Recurrent Neural Networks",
"doi": null,
"abstractUrl": "/magazine/cg/2019/05/08744242/1cFV5domibu",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2021/02/08805409",
"title": "Saliency Prediction in the Deep Learning Era: Successes and Limitations",
"doi": null,
"abstractUrl": "/journal/tp/2021/02/08805409/1cG4oumJbna",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv-2/2019/2850/0/285000a116",
"title": "Visual (dis)Confirmation: Validating Models and Hypotheses with Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/iv-2/2019/285000a116/1cMEOINHDQk",
"parentPublication": {
"id": "proceedings/iv-2/2019/2850/0",
"title": "2019 23rd International Conference in Information Visualization – Part II",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412308",
"title": "Classifying Eye-Tracking Data Using Saliency Maps",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412308/1tmiNBHZZDO",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552187",
"title": "Causal Support: Modeling Causal Inferences with Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552187/1xic7BF3mcE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08019864",
"articleId": "13rRUzphDy1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08019826",
"articleId": "13rRUwIF6la",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgPX",
"name": "ttg201801-08017597s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201801-08017597s1.zip",
"extension": "zip",
"size": "2.11 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgK8",
"title": "Dec.",
"year": "2014",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxDqS8j",
"doi": "10.1109/TVCG.2014.2346311",
"abstract": "In Human-Computer Interaction (HCI), experts seek to evaluate and compare the performance and ergonomics of user interfaces. Recently, a novel cost-efficient method for estimating physical ergonomics and performance has been introduced to HCI. It is based on optical motion capture and biomechanical simulation. It provides a rich source for analyzing human movements summarized in a multidimensional data set. Existing visualization tools do not sufficiently support the HCI experts in analyzing this data. We identified two shortcomings. First, appropriate visual encodings are missing particularly for the biomechanical aspects of the data. Second, the physical setup of the user interface cannot be incorporated explicitly into existing tools. We present MovExp, a versatile visualization tool that supports the evaluation of user interfaces. In particular, it can be easily adapted by the HCI experts to include the physical setup that is being evaluated, and visualize the data on top of it. Furthermore, it provides a variety of visual encodings to communicate muscular loads, movement directions, and other specifics of HCI studies that employ motion capture and biomechanical simulation. In this design study, we follow a problem-driven research approach. Based on a formalization of the visualization needs and the data structure, we formulate technical requirements for the visualization tool and present novel solutions to the analysis needs of the HCI experts. We show the utility of our tool with four case studies from the daily work of our HCI experts.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In Human-Computer Interaction (HCI), experts seek to evaluate and compare the performance and ergonomics of user interfaces. Recently, a novel cost-efficient method for estimating physical ergonomics and performance has been introduced to HCI. It is based on optical motion capture and biomechanical simulation. It provides a rich source for analyzing human movements summarized in a multidimensional data set. Existing visualization tools do not sufficiently support the HCI experts in analyzing this data. We identified two shortcomings. First, appropriate visual encodings are missing particularly for the biomechanical aspects of the data. Second, the physical setup of the user interface cannot be incorporated explicitly into existing tools. We present MovExp, a versatile visualization tool that supports the evaluation of user interfaces. In particular, it can be easily adapted by the HCI experts to include the physical setup that is being evaluated, and visualize the data on top of it. Furthermore, it provides a variety of visual encodings to communicate muscular loads, movement directions, and other specifics of HCI studies that employ motion capture and biomechanical simulation. In this design study, we follow a problem-driven research approach. Based on a formalization of the visualization needs and the data structure, we formulate technical requirements for the visualization tool and present novel solutions to the analysis needs of the HCI experts. We show the utility of our tool with four case studies from the daily work of our HCI experts.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In Human-Computer Interaction (HCI), experts seek to evaluate and compare the performance and ergonomics of user interfaces. Recently, a novel cost-efficient method for estimating physical ergonomics and performance has been introduced to HCI. It is based on optical motion capture and biomechanical simulation. It provides a rich source for analyzing human movements summarized in a multidimensional data set. Existing visualization tools do not sufficiently support the HCI experts in analyzing this data. We identified two shortcomings. First, appropriate visual encodings are missing particularly for the biomechanical aspects of the data. Second, the physical setup of the user interface cannot be incorporated explicitly into existing tools. We present MovExp, a versatile visualization tool that supports the evaluation of user interfaces. In particular, it can be easily adapted by the HCI experts to include the physical setup that is being evaluated, and visualize the data on top of it. Furthermore, it provides a variety of visual encodings to communicate muscular loads, movement directions, and other specifics of HCI studies that employ motion capture and biomechanical simulation. In this design study, we follow a problem-driven research approach. Based on a formalization of the visualization needs and the data structure, we formulate technical requirements for the visualization tool and present novel solutions to the analysis needs of the HCI experts. We show the utility of our tool with four case studies from the daily work of our HCI experts.",
"title": "MovExp: A Versatile Visualization Tool for Human-Computer Interaction Studies with 3D Performance and Biomechanical Data",
"normalizedTitle": "MovExp: A Versatile Visualization Tool for Human-Computer Interaction Studies with 3D Performance and Biomechanical Data",
"fno": "06876050",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Human Computer Interaction",
"Ergonomics",
"Biomechanics",
"Biological System Modeling",
"Human Computer Interaction",
"Information Visualization",
"Design Study"
],
"authors": [
{
"givenName": "Gregorio",
"surname": "Palmas",
"fullName": "Gregorio Palmas",
"affiliation": ", Max Planck Institute for Informatics",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Myroslav",
"surname": "Bachynskyi",
"fullName": "Myroslav Bachynskyi",
"affiliation": ", Max Planck Institute for Informatics",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Antti",
"surname": "Oulasvirta",
"fullName": "Antti Oulasvirta",
"affiliation": ", Max Planck Institute for Informatics",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hans-Peter",
"surname": "Seidel",
"fullName": "Hans-Peter Seidel",
"affiliation": ", Max Planck Institute for Informatics",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tina",
"surname": "Weinkauf",
"fullName": "Tina Weinkauf",
"affiliation": ", Max Planck Institute for Informatics",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "2359-2368",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/fg/2011/9140/0/05771346",
"title": "HCI⁁2 Workbench: A development tool for multimodal human-computer interaction systems",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2011/05771346/12OmNCu4nfe",
"parentPublication": {
"id": "proceedings/fg/2011/9140/0",
"title": "Face and Gesture 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2012/4525/0/4525a503",
"title": "Introduction to Human-Computer Interaction (HCI) Minitrack",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2012/4525a503/12OmNyuya1J",
"parentPublication": {
"id": "proceedings/hicss/2012/4525/0",
"title": "2012 45th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2015/7568/0/7568a083",
"title": "Natural User Interface Design in DA-TU: An Interactive Clustered Data Visualization System",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2015/7568a083/12OmNzVXNRE",
"parentPublication": {
"id": "proceedings/iv/2015/7568/0",
"title": "2015 19th International Conference on Information Visualisation (iV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446368",
"title": "Augmented Reality Visualization of Joint Movements for Physical Examination and Rehabilitation",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446368/13bd1gzWkQC",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2015/01/06952926",
"title": "Multiscale Layered Biomechanical Model of the Pacinian Corpuscle",
"doi": null,
"abstractUrl": "/journal/th/2015/01/06952926/13rRUwIF6e0",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061383",
"title": "Interactive Coordinated Multiple-View Visualization of Biomechanical Motion Data",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061383/13rRUwfI0Q3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aivr/2018/9269/0/926900a237",
"title": "Integrating Biomechanical and Animation Motion Capture Methods in the Production of Participant Specific, Scaled Avatars",
"doi": null,
"abstractUrl": "/proceedings-article/aivr/2018/926900a237/17D45XeKgqk",
"parentPublication": {
"id": "proceedings/aivr/2018/9269/0",
"title": "2018 IEEE International Conference on Artificial Intelligence and Virtual Reality (AIVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805424",
"title": "What is Interaction for Data Visualization?",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805424/1cG4MsovTO0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222287",
"title": "Data Comics for Reporting Controlled User Studies in Human-Computer Interaction",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222287/1nTq4rvK0g0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbdss/2020/9751/0/975100a101",
"title": "Bibliometric analysis of the core thesis system of Interaction Design Research on Human-Computer Interaction",
"doi": null,
"abstractUrl": "/proceedings-article/icbdss/2020/975100a101/1tROBd3G0De",
"parentPublication": {
"id": "proceedings/icbdss/2020/9751/0",
"title": "2020 International Conference on Big Data and Social Sciences (ICBDSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06876005",
"articleId": "13rRUwInvf8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06875935",
"articleId": "13rRUIM2VBJ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRGB",
"name": "ttg201412-06876050s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201412-06876050s1.zip",
"extension": "zip",
"size": "15.4 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNscfHUC",
"title": "September",
"year": "2008",
"issueNum": "09",
"idPrefix": "tp",
"pubType": "journal",
"volume": "30",
"label": "September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygBw8a",
"doi": "10.1109/TPAMI.2007.70821",
"abstract": "Analyzing spatiotemporal dependencies between different types of events is highly relevant to many biological phenomena (e.g., signaling and trafficking), especially as advances in probes and microscopy have facilitated the imaging of dynamic processes in living cells. For many types of events, the segmented areas can overlap spatially and temporally, forming random clumps. In this paper, we model the binary image sequences of two different event types as a realization of a bivariate temporal random set and propose a nonparametric approach to quantify spatial and spatiotemporal interrelations using the pair correlation, cross-covariance, and the Ripley K functions. Based on these summary statistics, we propose a randomization procedure to test independence between event types by applying random toroidal shifts and Monte Carlo tests. A simulation study assessed the performance of the proposed estimators and showed that these statistics capture the spatiotemporal dependencies accurately. The estimation of the spatiotemporal interval of interactions was also obtained. The method was successfully applied to analyze the interdependencies of several endocytic proteins using image sequences of living cells and validated the procedure as a new way to automatically quantify dependencies between proteins in a formal and robust manner.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Analyzing spatiotemporal dependencies between different types of events is highly relevant to many biological phenomena (e.g., signaling and trafficking), especially as advances in probes and microscopy have facilitated the imaging of dynamic processes in living cells. For many types of events, the segmented areas can overlap spatially and temporally, forming random clumps. In this paper, we model the binary image sequences of two different event types as a realization of a bivariate temporal random set and propose a nonparametric approach to quantify spatial and spatiotemporal interrelations using the pair correlation, cross-covariance, and the Ripley K functions. Based on these summary statistics, we propose a randomization procedure to test independence between event types by applying random toroidal shifts and Monte Carlo tests. A simulation study assessed the performance of the proposed estimators and showed that these statistics capture the spatiotemporal dependencies accurately. The estimation of the spatiotemporal interval of interactions was also obtained. The method was successfully applied to analyze the interdependencies of several endocytic proteins using image sequences of living cells and validated the procedure as a new way to automatically quantify dependencies between proteins in a formal and robust manner.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Analyzing spatiotemporal dependencies between different types of events is highly relevant to many biological phenomena (e.g., signaling and trafficking), especially as advances in probes and microscopy have facilitated the imaging of dynamic processes in living cells. For many types of events, the segmented areas can overlap spatially and temporally, forming random clumps. In this paper, we model the binary image sequences of two different event types as a realization of a bivariate temporal random set and propose a nonparametric approach to quantify spatial and spatiotemporal interrelations using the pair correlation, cross-covariance, and the Ripley K functions. Based on these summary statistics, we propose a randomization procedure to test independence between event types by applying random toroidal shifts and Monte Carlo tests. A simulation study assessed the performance of the proposed estimators and showed that these statistics capture the spatiotemporal dependencies accurately. The estimation of the spatiotemporal interval of interactions was also obtained. The method was successfully applied to analyze the interdependencies of several endocytic proteins using image sequences of living cells and validated the procedure as a new way to automatically quantify dependencies between proteins in a formal and robust manner.",
"title": "Measuring Spatiotemporal Dependencies in Bivariate Temporal Random Sets with Applications to Cell Biology",
"normalizedTitle": "Measuring Spatiotemporal Dependencies in Bivariate Temporal Random Sets with Applications to Cell Biology",
"fno": "ttp2008091659",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Binary Sequences",
"Biological Techniques",
"Biology Computing",
"Cellular Biophysics",
"Correlation Methods",
"Image Segmentation",
"Image Sequences",
"Molecular Biophysics",
"Monte Carlo Methods",
"Proteins",
"Random Processes",
"Set Theory",
"Statistical Testing",
"Spatiotemporal Dependencies",
"Bivariate Temporal Random Sets",
"Cell Biology",
"Binary Image Sequences",
"Nonparametric Approach",
"Pair Correlation",
"Ripley IK Functions",
"Cross Covariance",
"Random Toroidal Shifts",
"Monte Carlo Test",
"Endocytic Proteins",
"Image Segmentation",
"Spatiotemporal Phenomena",
"Biological Cells",
"Image Analysis",
"Image Sequences",
"Testing",
"Proteins",
"Signal Analysis",
"Signal Processing",
"Traffic Control",
"Probes",
"Pattern Analysis",
"Stochastic Processes",
"Image Models",
"Video Analysis",
"Applications",
"Biology And Genetics",
"Pattern Analysis",
"Stochastic Processes",
"Image Models",
"Video Analysis",
"Applications",
"Biology And Genetics"
],
"authors": [
{
"givenName": "Ester",
"surname": "Diaz",
"fullName": "Ester Diaz",
"affiliation": "Department of ComputerScience, University of Valencia, Avda. Vicente Andre´s Estelle´s, s/n, 46100Burjasot, Spain.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rafael",
"surname": "Sebastian",
"fullName": "Rafael Sebastian",
"affiliation": "Department of ComputerScience, University of Valencia, Avda. Vicente Andre´s Estelle´s, s/n, 46100Burjasot, Spain.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guillermo",
"surname": "Ayala",
"fullName": "Guillermo Ayala",
"affiliation": "Department of ComputerScience, University of Valencia, Avda. Vicente Andre´s Estelle´s, s/n, 46100Burjasot, Spain.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Maria Elena",
"surname": "Diaz",
"fullName": "Maria Elena Diaz",
"affiliation": "Departamento de Estadı´stica e Investigacio´nOperativa, University of Valencia, Avda. Vicente Andre´s Estelle´s, s/n,46100 Burjasot, Spain.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Roberto",
"surname": "Zoncu",
"fullName": "Roberto Zoncu",
"affiliation": "Department of Cell Biology, University of Yale, 333 Cedar Street, PO Box 208002, New Haven, CT 06520-8002",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Derek",
"surname": "Toomre",
"fullName": "Derek Toomre",
"affiliation": "Department of Cell Biology, University of Yale, 333 Cedar Street, PO Box 208002, New Haven, CT 06520-8002",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stephane",
"surname": "Gasman",
"fullName": "Stephane Gasman",
"affiliation": "De´partement Neurotransmission et Se´cre´tion Neuroendocrine, Institut des Neurosciences Cellulaires et Inte´gratives, CNRS-Universite´ Louis Pasteur, 5, rue Blaise Pascal, 67084 STRASBOURG Cedex France.",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2008-09-01 00:00:00",
"pubType": "trans",
"pages": "1659-1671",
"year": "2008",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2004/2128/1/01333991",
"title": "3D scanning using spatiotemporal orientation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2004/01333991/12OmNBC8Au8",
"parentPublication": {
"id": "proceedings/icpr/2004/2128/1",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ncm/2008/3322/2/3322b575",
"title": "OSTM: A Spatiotemporal Extension to Oracle",
"doi": null,
"abstractUrl": "/proceedings-article/ncm/2008/3322b575/12OmNCga1QI",
"parentPublication": {
"id": "proceedings/ncm/2008/3322/2",
"title": "Networked Computing and Advanced Information Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2007/3122/0/3122a010",
"title": "A Semantic Framework for Spatiotemporal Data Representation",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2007/3122a010/12OmNqJq4w5",
"parentPublication": {
"id": "proceedings/sitis/2007/3122/0",
"title": "2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2017/0560/0/08026300",
"title": "SpatioTemporal utilization of deep features for video saliency detection",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2017/08026300/12OmNwDACx6",
"parentPublication": {
"id": "proceedings/icmew/2017/0560/0",
"title": "2017 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2009/3994/0/05204263",
"title": "Modeling and exploiting the spatio-temporal facial action dependencies for robust spontaneous facial expression recognition",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2009/05204263/12OmNwMXnlQ",
"parentPublication": {
"id": "proceedings/cvprw/2009/3994/0",
"title": "2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2013/5053/0/06475019",
"title": "Wildfire smoke detection using spatiotemporal bag-of-features of smoke",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2013/06475019/12OmNyQYtbv",
"parentPublication": {
"id": "proceedings/wacv/2013/5053/0",
"title": "Applications of Computer Vision, IEEE Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1997/8183/1/81831093",
"title": "The analysis of motion in natural scenes using a spatiotemporal/spatiotemporal-frequency representation",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1997/81831093/12OmNyfdOQg",
"parentPublication": {
"id": "proceedings/icip/1997/8183/1",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2005/02/k0271",
"title": "Spatiotemporal Aggregate Computation: A Survey",
"doi": null,
"abstractUrl": "/journal/tk/2005/02/k0271/13rRUyfKII8",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/5555/01/09996962",
"title": "Multi-modal Reciprocal Spatiotemporal Framework for Predicting Usage Trend of Knowledge Services",
"doi": null,
"abstractUrl": "/journal/sc/5555/01/09996962/1Jju2EsGseY",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2021/07/09303420",
"title": "Learning Spatiotemporal Failure Dependencies for Resilient Edge Computing Services",
"doi": null,
"abstractUrl": "/journal/td/2021/07/09303420/1pLFTOeZSda",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "04378393",
"articleId": "13rRUyY28Zy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2008091505",
"articleId": "13rRUxAASXk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1D80ZaZz94I",
"title": "June",
"year": "2022",
"issueNum": "06",
"idPrefix": "tp",
"pubType": "journal",
"volume": "44",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1qkwyNyvvoI",
"doi": "10.1109/TPAMI.2021.3050750",
"abstract": "Supervised dimensionality reduction for sequence data learns a transformation that maps the observations in sequences onto a low-dimensional subspace by maximizing the separability of sequences in different classes. It is typically more challenging than conventional dimensionality reduction for static data, because measuring the separability of sequences involves non-linear procedures to manipulate the temporal structures. In this paper, we propose a linear method, called order-preserving Wasserstein discriminant analysis (OWDA), and its deep extension, namely DeepOWDA, to learn linear and non-linear discriminative subspace for sequence data, respectively. We construct novel separability measures between sequence classes based on the order-preserving Wasserstein (OPW) distance to capture the essential differences among their temporal structures. Specifically, for each class, we extract the OPW barycenter and construct the intra-class scatter as the dispersion of the training sequences around the barycenter. The inter-class distance is measured as the OPW distance between the corresponding barycenters. We learn the linear and non-linear transformations by maximizing the inter-class distance and minimizing the intra-class scatter. In this way, the proposed OWDA and DeepOWDA are able to concentrate on the distinctive differences among classes by lifting the geometric relations with temporal constraints. Experiments on four 3D action recognition datasets show the effectiveness of OWDA and DeepOWDA.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Supervised dimensionality reduction for sequence data learns a transformation that maps the observations in sequences onto a low-dimensional subspace by maximizing the separability of sequences in different classes. It is typically more challenging than conventional dimensionality reduction for static data, because measuring the separability of sequences involves non-linear procedures to manipulate the temporal structures. In this paper, we propose a linear method, called order-preserving Wasserstein discriminant analysis (OWDA), and its deep extension, namely DeepOWDA, to learn linear and non-linear discriminative subspace for sequence data, respectively. We construct novel separability measures between sequence classes based on the order-preserving Wasserstein (OPW) distance to capture the essential differences among their temporal structures. Specifically, for each class, we extract the OPW barycenter and construct the intra-class scatter as the dispersion of the training sequences around the barycenter. The inter-class distance is measured as the OPW distance between the corresponding barycenters. We learn the linear and non-linear transformations by maximizing the inter-class distance and minimizing the intra-class scatter. In this way, the proposed OWDA and DeepOWDA are able to concentrate on the distinctive differences among classes by lifting the geometric relations with temporal constraints. Experiments on four 3D action recognition datasets show the effectiveness of OWDA and DeepOWDA.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Supervised dimensionality reduction for sequence data learns a transformation that maps the observations in sequences onto a low-dimensional subspace by maximizing the separability of sequences in different classes. It is typically more challenging than conventional dimensionality reduction for static data, because measuring the separability of sequences involves non-linear procedures to manipulate the temporal structures. In this paper, we propose a linear method, called order-preserving Wasserstein discriminant analysis (OWDA), and its deep extension, namely DeepOWDA, to learn linear and non-linear discriminative subspace for sequence data, respectively. We construct novel separability measures between sequence classes based on the order-preserving Wasserstein (OPW) distance to capture the essential differences among their temporal structures. Specifically, for each class, we extract the OPW barycenter and construct the intra-class scatter as the dispersion of the training sequences around the barycenter. The inter-class distance is measured as the OPW distance between the corresponding barycenters. We learn the linear and non-linear transformations by maximizing the inter-class distance and minimizing the intra-class scatter. In this way, the proposed OWDA and DeepOWDA are able to concentrate on the distinctive differences among classes by lifting the geometric relations with temporal constraints. Experiments on four 3D action recognition datasets show the effectiveness of OWDA and DeepOWDA.",
"title": "Linear and Deep Order-Preserving Wasserstein Discriminant Analysis",
"normalizedTitle": "Linear and Deep Order-Preserving Wasserstein Discriminant Analysis",
"fno": "09321151",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Feature Extraction",
"Image Motion Analysis",
"Image Representation",
"Learning Artificial Intelligence",
"Matrix Algebra",
"Supervised Dimensionality Reduction",
"Sequence Data",
"Low Dimensional Subspace",
"Conventional Dimensionality Reduction",
"Static Data",
"Nonlinear Procedures",
"Temporal Structures",
"Linear Method",
"Called Order Preserving Wasserstein Discriminant Analysis",
"OWDA",
"Deep Extension",
"Deep OWDA",
"Nonlinear Discriminative Subspace",
"Separability Measures",
"Sequence Classes",
"Order Preserving Wasserstein Distance",
"Essential Differences",
"OPW Barycenter",
"Intra Class Scatter",
"Training Sequences",
"Inter Class Distance",
"OPW Distance",
"Nonlinear Transformations",
"Distinctive Differences",
"Hidden Markov Models",
"Feature Extraction",
"Dimensionality Reduction",
"Three Dimensional Displays",
"Joints",
"Training",
"Distortion Measurement",
"Optimal Transport",
"Order Preserving Wasserstein Distance",
"Barycenter",
"Dimensionality Reduction",
"Sequence Classification"
],
"authors": [
{
"givenName": "Bing",
"surname": "Su",
"fullName": "Bing Su",
"affiliation": "Beijing Key Laboratory of Big Data Management and Analysis Methods, Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiahuan",
"surname": "Zhou",
"fullName": "Jiahuan Zhou",
"affiliation": "Department of Electrical and Computer Engineering, Northwestern University, Evanston, IL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ji-Rong",
"surname": "Wen",
"fullName": "Ji-Rong Wen",
"affiliation": "Beijing Key Laboratory of Big Data Management and Analysis Methods, Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ying",
"surname": "Wu",
"fullName": "Ying Wu",
"affiliation": "Department of Electrical and Computer Engineering, Northwestern University, Evanston, IL, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2022-06-01 00:00:00",
"pubType": "trans",
"pages": "3123-3138",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iita/2009/3859/3/3859c031",
"title": "Supervised Locally Linear Embedding in Tensor Space",
"doi": null,
"abstractUrl": "/proceedings-article/iita/2009/3859c031/12OmNARRYpM",
"parentPublication": {
"id": "proceedings/iita/2009/3859/3",
"title": "2009 Third International Symposium on Intelligent Information Technology Application",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2013/2840/0/2840a889",
"title": "Linear Sequence Discriminant Analysis: A Model-Based Dimensionality Reduction Method for Vector Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2013/2840a889/12OmNC4wtKD",
"parentPublication": {
"id": "proceedings/iccv/2013/2840/0",
"title": "2013 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109a531",
"title": "Globally-Preserving Based Locally Linear Embedding",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109a531/12OmNCm7BMN",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109a539",
"title": "Extended Locality Preserving Discriminant Analysis for Face Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109a539/12OmNyS6Rzm",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457c906",
"title": "Order-Preserving Wasserstein Distance for Sequence Matching",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457c906/12OmNzTH0Lw",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2013/5053/0/06474998",
"title": "Heteroscedastic probabilistic linear discriminant analysis for manifold learning in video-based face recognition",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2013/06474998/12OmNzXFoJv",
"parentPublication": {
"id": "proceedings/wacv/2013/5053/0",
"title": "Applications of Computer Vision, IEEE Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2019/08/08424045",
"title": "Harmonic Mean Linear Discriminant Analysis",
"doi": null,
"abstractUrl": "/journal/tk/2019/08/08424045/13rRUILtJmE",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2022/5099/0/509900b047",
"title": "On Mean-Optimal Robust Linear Discriminant Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2022/509900b047/1KpClsAkrSw",
"parentPublication": {
"id": "proceedings/icdm/2022/5099/0",
"title": "2022 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300j884",
"title": "Order-Preserving Wasserstein Discriminant Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300j884/1hVlrVbrijC",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/01/09146191",
"title": "Visual Analysis of Class Separations With Locally Linear Segments",
"doi": null,
"abstractUrl": "/journal/tg/2021/01/09146191/1lFEXEfCDg4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09310246",
"articleId": "1pXhKTqNq5G",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09298962",
"articleId": "1pF1PMl0Z68",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1D810xYrpug",
"name": "ttp202206-09321151s1-supp1-3050750.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp202206-09321151s1-supp1-3050750.pdf",
"extension": "pdf",
"size": "1.21 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xlvYjicn7i",
"doi": "10.1109/TVCG.2021.3114839",
"abstract": "This paper presents a unified computational framework for the estimation of distances, geodesics and barycenters of merge trees. We extend recent work on the edit distance [104] and introduce a new metric, called the Wasserstein distance between merge trees, which is purposely designed to enable efficient computations of geodesics and barycenters. Specifically, our new distance is strictly equivalent to the Z_$L$_Z2-Wasserstein distance between extremum persistence diagrams, but it is restricted to a smaller solution space, namely, the space of rooted partial isomorphisms between branch decomposition trees. This enables a simple extension of existing optimization frameworks [110] for geodesics and barycenters from persistence diagrams to merge trees. We introduce a task-based algorithm which can be generically applied to distance, geodesic, barycenter or cluster computation. The task-based nature of our approach enables further accelerations with shared-memory parallelism. Extensive experiments on public ensembles and SciVis contest benchmarks demonstrate the efficiency of our approach - with barycenter computations in the orders of minutes for the largest examples - as well as its qualitative ability to generate representative barycenter merge trees, visually summarizing the features of interest found in the ensemble. We show the utility of our contributions with dedicated visualization applications: feature tracking, temporal reduction and ensemble clustering. We provide a lightweight C++ implementation that can be used to reproduce our results.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a unified computational framework for the estimation of distances, geodesics and barycenters of merge trees. We extend recent work on the edit distance [104] and introduce a new metric, called the Wasserstein distance between merge trees, which is purposely designed to enable efficient computations of geodesics and barycenters. Specifically, our new distance is strictly equivalent to the $L$2-Wasserstein distance between extremum persistence diagrams, but it is restricted to a smaller solution space, namely, the space of rooted partial isomorphisms between branch decomposition trees. This enables a simple extension of existing optimization frameworks [110] for geodesics and barycenters from persistence diagrams to merge trees. We introduce a task-based algorithm which can be generically applied to distance, geodesic, barycenter or cluster computation. The task-based nature of our approach enables further accelerations with shared-memory parallelism. Extensive experiments on public ensembles and SciVis contest benchmarks demonstrate the efficiency of our approach - with barycenter computations in the orders of minutes for the largest examples - as well as its qualitative ability to generate representative barycenter merge trees, visually summarizing the features of interest found in the ensemble. We show the utility of our contributions with dedicated visualization applications: feature tracking, temporal reduction and ensemble clustering. We provide a lightweight C++ implementation that can be used to reproduce our results.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a unified computational framework for the estimation of distances, geodesics and barycenters of merge trees. We extend recent work on the edit distance [104] and introduce a new metric, called the Wasserstein distance between merge trees, which is purposely designed to enable efficient computations of geodesics and barycenters. Specifically, our new distance is strictly equivalent to the -2-Wasserstein distance between extremum persistence diagrams, but it is restricted to a smaller solution space, namely, the space of rooted partial isomorphisms between branch decomposition trees. This enables a simple extension of existing optimization frameworks [110] for geodesics and barycenters from persistence diagrams to merge trees. We introduce a task-based algorithm which can be generically applied to distance, geodesic, barycenter or cluster computation. The task-based nature of our approach enables further accelerations with shared-memory parallelism. Extensive experiments on public ensembles and SciVis contest benchmarks demonstrate the efficiency of our approach - with barycenter computations in the orders of minutes for the largest examples - as well as its qualitative ability to generate representative barycenter merge trees, visually summarizing the features of interest found in the ensemble. We show the utility of our contributions with dedicated visualization applications: feature tracking, temporal reduction and ensemble clustering. We provide a lightweight C++ implementation that can be used to reproduce our results.",
"title": "Wasserstein Distances, Geodesics and Barycenters of Merge Trees",
"normalizedTitle": "Wasserstein Distances, Geodesics and Barycenters of Merge Trees",
"fno": "09555911",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Measurement",
"Task Analysis",
"Probability Density Function",
"Uncertainty",
"Market Research",
"Data Models",
"Topological Data Analysis",
"Merge Trees",
"Scalar Data",
"Ensemble Data"
],
"authors": [
{
"givenName": "Mathieu",
"surname": "Pont",
"fullName": "Mathieu Pont",
"affiliation": "Sorbonne Université and CNRS, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jules",
"surname": "Vidal",
"fullName": "Jules Vidal",
"affiliation": "Sorbonne Université and CNRS, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Julie",
"surname": "Delon",
"fullName": "Julie Delon",
"affiliation": "University of Paris, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Julien",
"surname": "Tierny",
"fullName": "Julien Tierny",
"affiliation": "Sorbonne Université and CNRS, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "291-301",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ldav/2017/0617/0/08231846",
"title": "Task-based augmented merge trees with Fibonacci heaps",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2017/08231846/12OmNzBwGrc",
"parentPublication": {
"id": "proceedings/ldav/2017/0617/0",
"title": "2017 IEEE 7th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/03/08481543",
"title": "Edit Distance between Merge Trees",
"doi": null,
"abstractUrl": "/journal/tg/2020/03/08481543/146z4GS1UPK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09744472",
"title": "Geometry Aware Merge Tree Comparisons for Time-Varying Data with Interleaving Distances",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09744472/1C8BFCieD2U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09912347",
"title": "Computing a Stable Distance on Merge Trees",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09912347/1HeiTQ2soFO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/02/09920234",
"title": "Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams)",
"doi": null,
"abstractUrl": "/journal/tg/2023/02/09920234/1HxSnktOqgU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/topoinvis/2022/9354/0/935400a029",
"title": "A Deformation-based Edit Distance for Merge Trees",
"doi": null,
"abstractUrl": "/proceedings-article/topoinvis/2022/935400a029/1J2XJrPDCgM",
"parentPublication": {
"id": "proceedings/topoinvis/2022/9354/0",
"title": "2022 Topological Data Analysis and Visualization (TopoInVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08794517",
"title": "Progressive Wasserstein Barycenters of Persistence Diagrams",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08794517/1cr2YZjGkPm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08794553",
"title": "A Structural Average of Labeled Merge Trees for Uncertainty Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08794553/1fe7uYD8R68",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/08/09420248",
"title": "Unordered Task-Parallel Augmented Merge Tree Construction",
"doi": null,
"abstractUrl": "/journal/tg/2021/08/09420248/1tdUMuQErm0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900q6780",
"title": "Wasserstein Barycenter for Multi-Source Domain Adaptation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900q6780/1yeKpVhavUk",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09556604",
"articleId": "1xlvXSp8cco",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09552880",
"articleId": "1xic21fTTva",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zBaupxe9Zm",
"name": "ttg202201-09555911s1-tvcg-3114839-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09555911s1-tvcg-3114839-mm.zip",
"extension": "zip",
"size": "183 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvSbBJO",
"title": "March",
"year": "2013",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxNEqPR",
"doi": "10.1109/TVCG.2012.120",
"abstract": "Analyzing high-dimensional point clouds is a classical challenge in visual analytics. Traditional techniques, such as projections or axis-based techniques, suffer from projection artifacts, occlusion, and visual complexity. We propose to split data analysis into two parts to address these shortcomings. First, a structural overview phase abstracts data by its density distribution. This phase performs topological analysis to support accurate and nonoverlapping presentation of the high-dimensional cluster structure as a topological landscape profile. Utilizing a landscape metaphor, it presents clusters and their nesting as hills whose height, width, and shape reflect cluster coherence, size, and stability, respectively. A second local analysis phase utilizes this global structural knowledge to select individual clusters or point sets for further, localized data analysis. Focusing on structural entities significantly reduces visual clutter in established geometric visualizations and permits a clearer, more thorough data analysis. This analysis complements the global topological perspective and enables the user to study subspaces or geometric properties, such as shape.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Analyzing high-dimensional point clouds is a classical challenge in visual analytics. Traditional techniques, such as projections or axis-based techniques, suffer from projection artifacts, occlusion, and visual complexity. We propose to split data analysis into two parts to address these shortcomings. First, a structural overview phase abstracts data by its density distribution. This phase performs topological analysis to support accurate and nonoverlapping presentation of the high-dimensional cluster structure as a topological landscape profile. Utilizing a landscape metaphor, it presents clusters and their nesting as hills whose height, width, and shape reflect cluster coherence, size, and stability, respectively. A second local analysis phase utilizes this global structural knowledge to select individual clusters or point sets for further, localized data analysis. Focusing on structural entities significantly reduces visual clutter in established geometric visualizations and permits a clearer, more thorough data analysis. This analysis complements the global topological perspective and enables the user to study subspaces or geometric properties, such as shape.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Analyzing high-dimensional point clouds is a classical challenge in visual analytics. Traditional techniques, such as projections or axis-based techniques, suffer from projection artifacts, occlusion, and visual complexity. We propose to split data analysis into two parts to address these shortcomings. First, a structural overview phase abstracts data by its density distribution. This phase performs topological analysis to support accurate and nonoverlapping presentation of the high-dimensional cluster structure as a topological landscape profile. Utilizing a landscape metaphor, it presents clusters and their nesting as hills whose height, width, and shape reflect cluster coherence, size, and stability, respectively. A second local analysis phase utilizes this global structural knowledge to select individual clusters or point sets for further, localized data analysis. Focusing on structural entities significantly reduces visual clutter in established geometric visualizations and permits a clearer, more thorough data analysis. This analysis complements the global topological perspective and enables the user to study subspaces or geometric properties, such as shape.",
"title": "Visualizing nD Point Clouds as Topological Landscape Profiles to Guide Local Data Analysis",
"normalizedTitle": "Visualizing nD Point Clouds as Topological Landscape Profiles to Guide Local Data Analysis",
"fno": "ttg2013030514",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Vegetation",
"Data Visualization",
"Shape",
"Density Functional Theory",
"Image Color Analysis",
"Topology",
"And Visual Metaphors",
"Point Clouds",
"High Dimensional Data",
"Cluster Analysis",
"Dimension Reduction",
"Scalar Topology"
],
"authors": [
{
"givenName": "P.",
"surname": "Oesterling",
"fullName": "P. Oesterling",
"affiliation": "Inst. fur Inf., Univ. Leipzig, Leipzig, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "C.",
"surname": "Heine",
"fullName": "C. Heine",
"affiliation": "Dept. of Comput. Sci., ETH Zurich, Zurich, Switzerland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "G. H.",
"surname": "Weber",
"fullName": "G. H. Weber",
"affiliation": "Comput. Res. Div., Lawrence Berkeley Nat. Lab., Berkeley, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "G.",
"surname": "Scheuermann",
"fullName": "G. Scheuermann",
"affiliation": "Inst. fur Inf., Univ. Leipzig, Leipzig, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2013-03-01 00:00:00",
"pubType": "trans",
"pages": "514-526",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cmc/2009/3501/3/3501c615",
"title": "Extended Statistical Landscape Features for Texture Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/cmc/2009/3501c615/12OmNA1VntM",
"parentPublication": {
"id": "proceedings/cmc/2009/3501/3",
"title": "2009 WRI International Conference on Communications and Mobile Computing. CMC 2009",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2010/7846/0/05571321",
"title": "A Theme Landscape for Tagged Data",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2010/05571321/12OmNAndipB",
"parentPublication": {
"id": "proceedings/iv/2010/7846/0",
"title": "2010 14th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2014/6636/0/6636a857",
"title": "The Study on Application of Natural Materials in Landscape Architecture Design Based on the Experimental Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2014/6636a857/12OmNCcKQeh",
"parentPublication": {
"id": "proceedings/icicta/2014/6636/0",
"title": "2014 7th International Conference on Intelligent Computation Technology and Automation (ICICTA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2010/6685/0/05429601",
"title": "Visual analysis of high dimensional point clouds using topological landscapes",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2010/05429601/12OmNyuya4Q",
"parentPublication": {
"id": "proceedings/pacificvis/2010/6685/0",
"title": "2010 IEEE Pacific Visualization Symposium (PacificVis 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2017/1230/0/1230a066",
"title": "The Landscape Plant as Spatial Element Used in the Construction of Parametric Configuration System",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2017/1230a066/12OmNzYNN34",
"parentPublication": {
"id": "proceedings/icicta/2017/1230/0",
"title": "2017 10th International Conference on Intelligent Computation Technology and Automation (ICICTA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ca/1995/7062/0/70620172",
"title": "Topological modeling of human anatomy using medical data",
"doi": null,
"abstractUrl": "/proceedings-article/ca/1995/70620172/12OmNzxyiLr",
"parentPublication": {
"id": "proceedings/ca/1995/7062/0",
"title": "Computer Animation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011121842",
"title": "Topological Spines: A Structure-preserving Visual Representation of Scalar Fields",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011121842/13rRUygT7mU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isaiam/2022/8541/0/854100a155",
"title": "Analysis of Urban Landscape Change Based on Remote Sensing",
"doi": null,
"abstractUrl": "/proceedings-article/isaiam/2022/854100a155/1MTTca4Izq8",
"parentPublication": {
"id": "proceedings/isaiam/2022/8541/0",
"title": "2022 2nd International Symposium on Artificial Intelligence and its Application on Media (ISAIAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icuems/2020/8832/0/09151452",
"title": "Study on Landscape Section Divisions in Highway Corridors : - Taking Jungar-Xinghe Freeway as an example",
"doi": null,
"abstractUrl": "/proceedings-article/icuems/2020/09151452/1lRlNZkwGNq",
"parentPublication": {
"id": "proceedings/icuems/2020/8832/0",
"title": "2020 International Conference on Urban Engineering and Management Science (ICUEMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciddt/2020/0367/0/036700a312",
"title": "Application of Color in Innovative Digital Landscape Design",
"doi": null,
"abstractUrl": "/proceedings-article/iciddt/2020/036700a312/1wutBO1YjFm",
"parentPublication": {
"id": "proceedings/iciddt/2020/0367/0",
"title": "2020 International Conference on Innovation Design and Digital Technology (ICIDDT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013030495",
"articleId": "13rRUwI5TXy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013030527",
"articleId": "13rRUyYSWsU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRNE",
"name": "ttg2013030514s.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013030514s.mp4",
"extension": "mp4",
"size": "11.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyeWdDk",
"title": "May-June",
"year": "2019",
"issueNum": "03",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "39",
"label": "May-June",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "19utOYR5h0k",
"doi": "10.1109/MCG.2019.2891277",
"abstract": "Vector graphics refers to the use of geometrical primitives, such as Bézier curves, to represent digital images. It is becoming increasingly popular among graphic designers who need to deliver resolution-independent content that looks sharp across all types of desktop and mobile devices, or need to support user interactivity and animation. Unfortunately, most vector graphics tools today have many limitations, such as the inability to represent shapes sharing a common edge. In my doctoral dissertation, we address this issue by developing a novel data structure, called the vector graphics complex, which supports fundamental topological modeling operations for vector graphics illustrations. We also extend this data structure to animation, allowing features of a connected drawing to merge, split, appear, or disappear at desired times via keyframes that introduce the desired topological change. The resulting space-time continuous complex directly captures the time-varying topological structure, and allows features to be readily edited in both space and time in a way that reflects the intent of the drawing.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Vector graphics refers to the use of geometrical primitives, such as Bézier curves, to represent digital images. It is becoming increasingly popular among graphic designers who need to deliver resolution-independent content that looks sharp across all types of desktop and mobile devices, or need to support user interactivity and animation. Unfortunately, most vector graphics tools today have many limitations, such as the inability to represent shapes sharing a common edge. In my doctoral dissertation, we address this issue by developing a novel data structure, called the vector graphics complex, which supports fundamental topological modeling operations for vector graphics illustrations. We also extend this data structure to animation, allowing features of a connected drawing to merge, split, appear, or disappear at desired times via keyframes that introduce the desired topological change. The resulting space-time continuous complex directly captures the time-varying topological structure, and allows features to be readily edited in both space and time in a way that reflects the intent of the drawing.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Vector graphics refers to the use of geometrical primitives, such as Bézier curves, to represent digital images. It is becoming increasingly popular among graphic designers who need to deliver resolution-independent content that looks sharp across all types of desktop and mobile devices, or need to support user interactivity and animation. Unfortunately, most vector graphics tools today have many limitations, such as the inability to represent shapes sharing a common edge. In my doctoral dissertation, we address this issue by developing a novel data structure, called the vector graphics complex, which supports fundamental topological modeling operations for vector graphics illustrations. We also extend this data structure to animation, allowing features of a connected drawing to merge, split, appear, or disappear at desired times via keyframes that introduce the desired topological change. The resulting space-time continuous complex directly captures the time-varying topological structure, and allows features to be readily edited in both space and time in a way that reflects the intent of the drawing.",
"title": "Topological Modeling for Vector Graphics",
"normalizedTitle": "Topological Modeling for Vector Graphics",
"fno": "08698354",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Computational Geometry",
"Computer Graphics",
"Data Structures",
"Image Representation",
"Topology",
"Geometrical Primitives",
"Be X 0301 Zier Curves",
"Graphic Designers",
"Resolution Independent Content",
"Desktop Devices",
"Mobile Devices",
"Animation",
"Vector Graphics Tools",
"Data Structure",
"Vector Graphics Complex",
"Fundamental Topological Modeling Operations",
"Time Varying Topological Structure",
"Digital Image Representation",
"Data Structures",
"Topology",
"Computer Graphics",
"Image Representation",
"Computational Geometry"
],
"authors": [
{
"givenName": "Boris",
"surname": "Dalstein",
"fullName": "Boris Dalstein",
"affiliation": "VGC Software",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2019-05-01 00:00:00",
"pubType": "mags",
"pages": "86-95",
"year": "2019",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/fcst/2015/9295/0/9295a153",
"title": "Diffusion Based Vector Graphics on Mobile Devices",
"doi": null,
"abstractUrl": "/proceedings-article/fcst/2015/9295a153/12OmNAlvI0g",
"parentPublication": {
"id": "proceedings/fcst/2015/9295/0",
"title": "2015 Ninth International Conference on Frontier of Computer Science and Technology (FCST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmc/2009/3501/3/3501c008",
"title": "Vector Graphics Rendering on Mobile Device",
"doi": null,
"abstractUrl": "/proceedings-article/cmc/2009/3501c008/12OmNBhZ4i8",
"parentPublication": {
"id": "proceedings/cmc/2009/3501/3",
"title": "2009 WRI International Conference on Communications and Mobile Computing. CMC 2009",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sccg/2001/1215/0/12150002",
"title": "Topological Graphics",
"doi": null,
"abstractUrl": "/proceedings-article/sccg/2001/12150002/12OmNwHhoPK",
"parentPublication": {
"id": "proceedings/sccg/2001/1215/0",
"title": "Proceedings Spring Conference on Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etcs/2010/3987/2/3987b535",
"title": "Study on Digital Watermarking for Vector Graphics",
"doi": null,
"abstractUrl": "/proceedings-article/etcs/2010/3987b535/12OmNzBOile",
"parentPublication": {
"id": "proceedings/etcs/2010/3987/2",
"title": "Education Technology and Computer Science, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532842",
"title": "Extracting higher order critical points and topological simplification of 3D vector fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532842/12OmNzlD9fo",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/1981/03/01667276",
"title": "Computer Graphics: Reaching the User",
"doi": null,
"abstractUrl": "/magazine/co/1981/03/01667276/13rRUxlgy6s",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/02/08449116",
"title": "Poisson Vector Graphics (PVG)",
"doi": null,
"abstractUrl": "/journal/tg/2020/02/08449116/13rRUyeCkaq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/macise/2020/6695/0/09195629",
"title": "Almost Alpha – Topological Vector Spaces",
"doi": null,
"abstractUrl": "/proceedings-article/macise/2020/09195629/1n7nKbXniFO",
"parentPublication": {
"id": "proceedings/macise/2020/6695/0",
"title": "2020 International Conference on Mathematics and Computers in Science and Engineering (MACISE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2021/4899/0/489900c124",
"title": "Im2Vec: Synthesizing Vector Graphics without Vector Supervision",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2021/489900c124/1yXsHiDLhSM",
"parentPublication": {
"id": "proceedings/cvprw/2021/4899/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900h338",
"title": "Im2Vec: Synthesizing Vector Graphics without Vector Supervision",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900h338/1yeJUXmEGti",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08681452",
"articleId": "18XhxGhBiCs",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08698263",
"articleId": "19utQPrDrB6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1vQz59P5p84",
"title": "July-Aug.",
"year": "2021",
"issueNum": "04",
"idPrefix": "tb",
"pubType": "journal",
"volume": "18",
"label": "July-Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1ezPhjeK6S4",
"doi": "10.1109/TCBB.2019.2950657",
"abstract": "Topological data analysis (TDA) is a powerful method for reducing data dimensionality, mining underlying data relationships, and intuitively representing the data structure. The Mapper algorithm is one such tool that projects high-dimensional data to 1-dimensional space by using a filter function that is subsequently used to reconstruct the data topology relationships. However, domain context information and prior knowledge have not been considered in current TDA modeling frameworks. Here, we report the development and evaluation of a semi-supervised topological analysis (STA) framework that incorporates discrete or continuously labeled data points and selects the most relevant filter functions accordingly. We validate the proposed STA framework with simulation data and then apply it to samples from Genotype-Tissue Expression data and ovarian cancer transcriptome datasets. The graphs generated by STA for these 2 datasets, based on gene expression profiles, are consistent with prior knowledge, thereby supporting the effectiveness of the proposed framework.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Topological data analysis (TDA) is a powerful method for reducing data dimensionality, mining underlying data relationships, and intuitively representing the data structure. The Mapper algorithm is one such tool that projects high-dimensional data to 1-dimensional space by using a filter function that is subsequently used to reconstruct the data topology relationships. However, domain context information and prior knowledge have not been considered in current TDA modeling frameworks. Here, we report the development and evaluation of a semi-supervised topological analysis (STA) framework that incorporates discrete or continuously labeled data points and selects the most relevant filter functions accordingly. We validate the proposed STA framework with simulation data and then apply it to samples from Genotype-Tissue Expression data and ovarian cancer transcriptome datasets. The graphs generated by STA for these 2 datasets, based on gene expression profiles, are consistent with prior knowledge, thereby supporting the effectiveness of the proposed framework.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Topological data analysis (TDA) is a powerful method for reducing data dimensionality, mining underlying data relationships, and intuitively representing the data structure. The Mapper algorithm is one such tool that projects high-dimensional data to 1-dimensional space by using a filter function that is subsequently used to reconstruct the data topology relationships. However, domain context information and prior knowledge have not been considered in current TDA modeling frameworks. Here, we report the development and evaluation of a semi-supervised topological analysis (STA) framework that incorporates discrete or continuously labeled data points and selects the most relevant filter functions accordingly. We validate the proposed STA framework with simulation data and then apply it to samples from Genotype-Tissue Expression data and ovarian cancer transcriptome datasets. The graphs generated by STA for these 2 datasets, based on gene expression profiles, are consistent with prior knowledge, thereby supporting the effectiveness of the proposed framework.",
"title": "Semi-Supervised Topological Analysis for Elucidating Hidden Structures in High-Dimensional Transcriptome Datasets",
"normalizedTitle": "Semi-Supervised Topological Analysis for Elucidating Hidden Structures in High-Dimensional Transcriptome Datasets",
"fno": "08888210",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Bioinformatics",
"Cancer",
"Data Analysis",
"Data Mining",
"Data Structures",
"Genetics",
"Graph Theory",
"Learning Artificial Intelligence",
"Medical Computing",
"Molecular Biophysics",
"Domain Context Information",
"Current TDA Modeling Frameworks",
"Semisupervised Topological Analysis Framework",
"Data Points",
"Relevant Filter Functions",
"STA Framework",
"Simulation Data",
"Genotype Tissue Expression Data",
"Ovarian Cancer Transcriptome Datasets",
"Hidden Structures",
"High Dimensional Transcriptome Datasets",
"Topological Data Analysis",
"Data Dimensionality",
"Underlying Data Relationships",
"Data Structure",
"Mapper Algorithm",
"Projects High Dimensional Data",
"1 Dimensional Space",
"Filter Function",
"Data Topology Relationships",
"Data Models",
"Data Analysis",
"Genomics",
"Data Mining",
"Data Structures",
"Data Visualization",
"Data And Knowledge Visualization",
"Data Mining",
"Bioinformatics Genome Or Protein Databases"
],
"authors": [
{
"givenName": "Tianshu",
"surname": "Feng",
"fullName": "Tianshu Feng",
"affiliation": "Department of Health Sciences Research, Mayo Clinic, Rochester, MN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jaime I.",
"surname": "Davila",
"fullName": "Jaime I. Davila",
"affiliation": "Department of Industrial and Systems Engineering, University of Washington, Seattle, WA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuanhang",
"surname": "Liu",
"fullName": "Yuanhang Liu",
"affiliation": "Department of Industrial and Systems Engineering, University of Washington, Seattle, WA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sangdi",
"surname": "Lin",
"fullName": "Sangdi Lin",
"affiliation": "Department of Health Sciences Research, Mayo Clinic, Rochester, MN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shuai",
"surname": "Huang",
"fullName": "Shuai Huang",
"affiliation": "Zillow Group, Seattle, WA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chen",
"surname": "Wang",
"fullName": "Chen Wang",
"affiliation": "Department of Industrial and Systems Engineering, University of Washington, Seattle, WA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2021-07-01 00:00:00",
"pubType": "trans",
"pages": "1620-1631",
"year": "2021",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2017/0831/0/0831a384",
"title": "Visualizing Dynamic Gene Interactions to Reverse Engineer Gene Regulatory Networks Using Topological Data Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2017/0831a384/12OmNwBT1sd",
"parentPublication": {
"id": "proceedings/iv/2017/0831/0",
"title": "2017 21st International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2018/07/08249544",
"title": "Sparse-TDA: Sparse Realization of Topological Data Analysis for Multi-Way Classification",
"doi": null,
"abstractUrl": "/journal/tk/2018/07/08249544/13rRUNvyafy",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2021/3902/0/09671368",
"title": "Activation Landscapes as a Topological Summary of Neural Network Performance",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2021/09671368/1A8hqpvSjn2",
"parentPublication": {
"id": "proceedings/big-data/2021/3902/0",
"title": "2021 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020423",
"title": "Stable Topological Feature Vectors via Hermite Function Expansion on Persistence Curves",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020423/1KfRC2DMiJy",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2019/4896/0/489600a238",
"title": "Topological Data Analysis for Portfolio Management of Cryptocurrencies",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2019/489600a238/1gAwW6q3Icw",
"parentPublication": {
"id": "proceedings/icdmw/2019/4896/0",
"title": "2019 International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2019/1867/0/08983312",
"title": "Topological Data Analysis on Magnetic Resonance Image Biomarkers",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2019/08983312/1hgugr5x9ZK",
"parentPublication": {
"id": "proceedings/bibm/2019/1867/0",
"title": "2019 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222093",
"title": "Localized Topological Simplification of Scalar Data",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222093/1nTrExzmT5e",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispds/2020/9668/0/966800a150",
"title": "Exploration of Topological Data Analysis In 3D Printing",
"doi": null,
"abstractUrl": "/proceedings-article/ispds/2020/966800a150/1oRiWPcsMtW",
"parentPublication": {
"id": "proceedings/ispds/2020/9668/0",
"title": "2020 International Conference on Information Science, Parallel and Distributed Systems (ISPDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbdss/2020/9751/0/975100a005",
"title": "The Plausibility of Topological Data Analysis in Providing Internet Services",
"doi": null,
"abstractUrl": "/proceedings-article/icbdss/2020/975100a005/1tROwnNVkyc",
"parentPublication": {
"id": "proceedings/icbdss/2020/9751/0",
"title": "2020 International Conference on Big Data and Social Sciences (ICBDSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbdss/2020/9751/0/975100a015",
"title": "Application of Topological Data Analysis in Co-infections and Its Effectiveness",
"doi": null,
"abstractUrl": "/proceedings-article/icbdss/2020/975100a015/1tROxvA7JZu",
"parentPublication": {
"id": "proceedings/icbdss/2020/9751/0",
"title": "2020 International Conference on Big Data and Social Sciences (ICBDSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08865617",
"articleId": "1e2DcmePW8w",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08880525",
"articleId": "1emy1ByuTXa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04Q",
"title": "Jan.",
"year": "2017",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILLkDW",
"doi": "10.1109/TVCG.2016.2598467",
"abstract": "In this work we address the problem of retrieving potentially interesting matrix views to support the exploration of networks. We introduce Matrix Diagnostics (or Magnostics), following in spirit related approaches for rating and ranking other visualization techniques, such as Scagnostics for scatter plots. Our approach ranks matrix views according to the appearance of specific visual patterns, such as blocks and lines, indicating the existence of topological motifs in the data, such as clusters, bi-graphs, or central nodes. Magnostics can be used to analyze, query, or search for visually similar matrices in large collections, or to assess the quality of matrix reordering algorithms. While many feature descriptors for image analyzes exist, there is no evidence how they perform for detecting patterns in matrices. In order to make an informed choice of feature descriptors for matrix diagnostics, we evaluate 30 feature descriptors—27 existing ones and three new descriptors that we designed specifically for MAGNOSTICS-with respect to four criteria: pattern response, pattern variability, pattern sensibility, and pattern discrimination. We conclude with an informed set of six descriptors as most appropriate for Magnostics and demonstrate their application in two scenarios; exploring a large collection of matrices and analyzing temporal networks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this work we address the problem of retrieving potentially interesting matrix views to support the exploration of networks. We introduce Matrix Diagnostics (or Magnostics), following in spirit related approaches for rating and ranking other visualization techniques, such as Scagnostics for scatter plots. Our approach ranks matrix views according to the appearance of specific visual patterns, such as blocks and lines, indicating the existence of topological motifs in the data, such as clusters, bi-graphs, or central nodes. Magnostics can be used to analyze, query, or search for visually similar matrices in large collections, or to assess the quality of matrix reordering algorithms. While many feature descriptors for image analyzes exist, there is no evidence how they perform for detecting patterns in matrices. In order to make an informed choice of feature descriptors for matrix diagnostics, we evaluate 30 feature descriptors—27 existing ones and three new descriptors that we designed specifically for MAGNOSTICS-with respect to four criteria: pattern response, pattern variability, pattern sensibility, and pattern discrimination. We conclude with an informed set of six descriptors as most appropriate for Magnostics and demonstrate their application in two scenarios; exploring a large collection of matrices and analyzing temporal networks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this work we address the problem of retrieving potentially interesting matrix views to support the exploration of networks. We introduce Matrix Diagnostics (or Magnostics), following in spirit related approaches for rating and ranking other visualization techniques, such as Scagnostics for scatter plots. Our approach ranks matrix views according to the appearance of specific visual patterns, such as blocks and lines, indicating the existence of topological motifs in the data, such as clusters, bi-graphs, or central nodes. Magnostics can be used to analyze, query, or search for visually similar matrices in large collections, or to assess the quality of matrix reordering algorithms. While many feature descriptors for image analyzes exist, there is no evidence how they perform for detecting patterns in matrices. In order to make an informed choice of feature descriptors for matrix diagnostics, we evaluate 30 feature descriptors—27 existing ones and three new descriptors that we designed specifically for MAGNOSTICS-with respect to four criteria: pattern response, pattern variability, pattern sensibility, and pattern discrimination. We conclude with an informed set of six descriptors as most appropriate for Magnostics and demonstrate their application in two scenarios; exploring a large collection of matrices and analyzing temporal networks.",
"title": "Magnostics: Image-Based Search of Interesting Matrix Views for Guided Network Exploration",
"normalizedTitle": "Magnostics: Image-Based Search of Interesting Matrix Views for Guided Network Exploration",
"fno": "07534849",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Data Visualization",
"Feature Extraction",
"Symmetric Matrices",
"Data Analysis",
"Layout",
"Density Measurement",
"Relational Data",
"Matrix Visualization",
"Visual Quality Measures",
"Quality Metrics",
"Feature Detection Selection"
],
"authors": [
{
"givenName": "Michael",
"surname": "Behrisch",
"fullName": "Michael Behrisch",
"affiliation": "University of Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Benjamin",
"surname": "Bach",
"fullName": "Benjamin Bach",
"affiliation": "Microsoft Research-Inria Joint Centre, Saclay, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Hund",
"fullName": "Michael Hund",
"affiliation": "University of Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Delz",
"fullName": "Michael Delz",
"affiliation": "University of Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Laura",
"surname": "Von Rüden",
"fullName": "Laura Von Rüden",
"affiliation": "Capgemini, RWTH Aachen University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jean-Daniel",
"surname": "Fekete",
"fullName": "Jean-Daniel Fekete",
"affiliation": "Inria, Saclay, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tobias",
"surname": "Schreck",
"fullName": "Tobias Schreck",
"affiliation": "Graz University of Technology, Austria",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2017-01-01 00:00:00",
"pubType": "trans",
"pages": "31-40",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vast/2014/6227/0/07042507",
"title": "Balanced layouts using the composite data-variable matrix",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042507/12OmNscOUg1",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispdc/2012/2599/0/06341487",
"title": "Performance of a Structure-Detecting SpMV Using the CSR Matrix Representation",
"doi": null,
"abstractUrl": "/proceedings-article/ispdc/2012/06341487/12OmNwErpIF",
"parentPublication": {
"id": "proceedings/ispdc/2012/2599/0",
"title": "2012 11th International Symposium on Parallel and Distributed Computing (ISPDC 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460757",
"title": "Jensen divergence based SPD matrix means and applications",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460757/12OmNylboLN",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cso/2012/1365/0/06274673",
"title": "The Reflexive Optimal Approximation Solution of Matrix Equation AXB + CYD = E",
"doi": null,
"abstractUrl": "/proceedings-article/cso/2012/06274673/12OmNzWfp9j",
"parentPublication": {
"id": "proceedings/cso/2012/1365/0",
"title": "2012 Fifth International Joint Conference on Computational Sciences and Optimization (CSO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2014/03/ttp2014030592",
"title": "Tensor Sparse Coding for Positive Definite Matrices",
"doi": null,
"abstractUrl": "/journal/tp/2014/03/ttp2014030592/13rRUEgarCx",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2018/7202/0/720200a344",
"title": "Visualizing Symmetric Square Matrices with Rainbow Boxes: Methods and Application to Character Co-occurrence Matrices in Literary Texts",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a344/17D45WgziTw",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2021/5841/0/584100b639",
"title": "Nonnegative Matrix Factorization Approach for Image Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2021/584100b639/1EpKWnABigw",
"parentPublication": {
"id": "proceedings/csci/2021/5841/0",
"title": "2021 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2022/5099/0/509900a695",
"title": "Rethinking Symmetric Matrix Factorization: A More General and Better Clustering Perspective",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2022/509900a695/1KpCDZgHS1y",
"parentPublication": {
"id": "proceedings/icdm/2022/5099/0",
"title": "2022 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2020/6251/0/09378361",
"title": "An Optimized Distributed Recursive Matrix Multiplication for Arbitrary Sized Matrices",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09378361/1s657OuXzXy",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09543530",
"title": "Block-Diagonal Guided Symmetric Nonnegative Matrix Factorization",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09543530/1x4UGS0CE3m",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07534787",
"articleId": "13rRUxcsYLV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07534759",
"articleId": "13rRUxE04tG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyq0zFI",
"title": "May",
"year": "2020",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1hrXgdu8Bkk",
"doi": "10.1109/TVCG.2020.2973076",
"abstract": "Point clouds-based 3D human pose estimation that aims to recover the 3D locations of human skeleton joints plays an important role in many AR/VR applications. The success of existing methods is generally built upon large scale data annotated with 3D human joints. However, it is a labor-intensive and error-prone process to annotate 3D human joints from input depth images or point clouds, due to the self-occlusion between body parts as well as the tedious annotation process on 3D point clouds. Meanwhile, it is easier to construct human pose datasets with 2D human joint annotations on depth images. To address this problem, we present a weakly supervised adversarial learning framework for 3D human pose estimation from point clouds. Compared to existing 3D human pose estimation methods from depth images or point clouds, we exploit both the weakly supervised data with only annotations of 2D human joints and fully supervised data with annotations of 3D human joints. In order to relieve the human pose ambiguity due to weak supervision, we adopt adversarial learning to ensure the recovered human pose is valid. Instead of using either 2D or 3D representations of depth images in previous methods, we exploit both point clouds and the input depth image. We adopt 2D CNN to extract 2D human joints from the input depth image, 2D human joints aid us in obtaining the initial 3D human joints and selecting effective sampling points that could reduce the computation cost of 3D human pose regression using point clouds network. The used point clouds network can narrow down the domain gap between the network input i.e. point clouds and 3D joints. Thanks to weakly supervised adversarial learning framework, our method can achieve accurate 3D human pose from point clouds. Experiments on the ITOP dataset and EVAL dataset demonstrate that our method can achieve state-of-the-art performance efficiently.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Point clouds-based 3D human pose estimation that aims to recover the 3D locations of human skeleton joints plays an important role in many AR/VR applications. The success of existing methods is generally built upon large scale data annotated with 3D human joints. However, it is a labor-intensive and error-prone process to annotate 3D human joints from input depth images or point clouds, due to the self-occlusion between body parts as well as the tedious annotation process on 3D point clouds. Meanwhile, it is easier to construct human pose datasets with 2D human joint annotations on depth images. To address this problem, we present a weakly supervised adversarial learning framework for 3D human pose estimation from point clouds. Compared to existing 3D human pose estimation methods from depth images or point clouds, we exploit both the weakly supervised data with only annotations of 2D human joints and fully supervised data with annotations of 3D human joints. In order to relieve the human pose ambiguity due to weak supervision, we adopt adversarial learning to ensure the recovered human pose is valid. Instead of using either 2D or 3D representations of depth images in previous methods, we exploit both point clouds and the input depth image. We adopt 2D CNN to extract 2D human joints from the input depth image, 2D human joints aid us in obtaining the initial 3D human joints and selecting effective sampling points that could reduce the computation cost of 3D human pose regression using point clouds network. The used point clouds network can narrow down the domain gap between the network input i.e. point clouds and 3D joints. Thanks to weakly supervised adversarial learning framework, our method can achieve accurate 3D human pose from point clouds. Experiments on the ITOP dataset and EVAL dataset demonstrate that our method can achieve state-of-the-art performance efficiently.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Point clouds-based 3D human pose estimation that aims to recover the 3D locations of human skeleton joints plays an important role in many AR/VR applications. The success of existing methods is generally built upon large scale data annotated with 3D human joints. However, it is a labor-intensive and error-prone process to annotate 3D human joints from input depth images or point clouds, due to the self-occlusion between body parts as well as the tedious annotation process on 3D point clouds. Meanwhile, it is easier to construct human pose datasets with 2D human joint annotations on depth images. To address this problem, we present a weakly supervised adversarial learning framework for 3D human pose estimation from point clouds. Compared to existing 3D human pose estimation methods from depth images or point clouds, we exploit both the weakly supervised data with only annotations of 2D human joints and fully supervised data with annotations of 3D human joints. In order to relieve the human pose ambiguity due to weak supervision, we adopt adversarial learning to ensure the recovered human pose is valid. Instead of using either 2D or 3D representations of depth images in previous methods, we exploit both point clouds and the input depth image. We adopt 2D CNN to extract 2D human joints from the input depth image, 2D human joints aid us in obtaining the initial 3D human joints and selecting effective sampling points that could reduce the computation cost of 3D human pose regression using point clouds network. The used point clouds network can narrow down the domain gap between the network input i.e. point clouds and 3D joints. Thanks to weakly supervised adversarial learning framework, our method can achieve accurate 3D human pose from point clouds. Experiments on the ITOP dataset and EVAL dataset demonstrate that our method can achieve state-of-the-art performance efficiently.",
"title": "Weakly Supervised Adversarial Learning for 3D Human Pose Estimation from Point Clouds",
"normalizedTitle": "Weakly Supervised Adversarial Learning for 3D Human Pose Estimation from Point Clouds",
"fno": "08998337",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Convolutional Neural Nets",
"Image Representation",
"Pose Estimation",
"Stereo Image Processing",
"Supervised Learning",
"Human Skeleton Joints",
"Depth Images",
"Weakly Supervised Adversarial Learning Framework",
"Point Clouds Based 3 D Human Pose Estimation",
"2 D CNN",
"2 D Human Joints",
"2 D Representations",
"3 D Representations",
"Three Dimensional Displays",
"Two Dimensional Displays",
"Pose Estimation",
"Heating Systems",
"Proposals",
"Training Data",
"Computers",
"Human Pose Estimation",
"Point Clouds",
"Depth Map"
],
"authors": [
{
"givenName": "Zihao",
"surname": "Zhang",
"fullName": "Zihao Zhang",
"affiliation": "Institute of Computing Technology, Chinese Academy of Sciences, University of Chinese Academy of Sciences",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lei",
"surname": "Hu",
"fullName": "Lei Hu",
"affiliation": "Institute of Computing Technology, Chinese Academy of Sciences, University of Chinese Academy of Sciences",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaoming",
"surname": "Deng",
"fullName": "Xiaoming Deng",
"affiliation": "Bejing Key Laboratory of Human Computer Interactions, Institute of Software, Chinese Academy of Sciences",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shihong",
"surname": "Xia",
"fullName": "Shihong Xia",
"affiliation": "Institute of Computing Technology, Chinese Academy of Sciences, University of Chinese Academy of Sciences",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2020-05-01 00:00:00",
"pubType": "trans",
"pages": "1851-1859",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2017/1032/0/1032c621",
"title": "Compositional Human Pose Regression",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032c621/12OmNqBtiU5",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2017/1034/0/1034a805",
"title": "Generating Multiple Diverse Hypotheses for Human 3D Pose Consistent with 2D Joint Detections",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034a805/12OmNxFsmrY",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032a398",
"title": "Towards 3D Human Pose Estimation in the Wild: A Weakly-Supervised Approach",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032a398/12OmNy3iFgU",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000f255",
"title": "3D Human Pose Estimation in the Wild by Adversarial Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000f255/17D45WHONlv",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300c344",
"title": "HEMlets Pose: Learning Part-Centric Heatmap Triplets for Accurate 3D Human Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300c344/1hQqygVk4TK",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800c197",
"title": "Fusing Wearable IMUs With Multi-View Images for Human Pose Estimation: A Geometric Approach",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800c197/1m3nJvdaX2U",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800g855",
"title": "PandaNet: Anchor-Based Single-Shot Multi-Person 3D Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800g855/1m3nlxOySyY",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2019/4752/0/09212996",
"title": "3D Human Pose Estimation with Adversarial Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2019/09212996/1nHRTVvYYVi",
"parentPublication": {
"id": "proceedings/icvrv/2019/4752/0",
"title": "2019 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/06/09320561",
"title": "HEMlets PoSh: Learning Part-Centric Heatmap Triplets for 3D Human Pose and Shape Estimation",
"doi": null,
"abstractUrl": "/journal/tp/2022/06/09320561/1qkwANyEXq8",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2020/8128/0/812800a898",
"title": "Error Bounds of Projection Models in Weakly Supervised 3D Human Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2020/812800a898/1qyxlY5L8jK",
"parentPublication": {
"id": "proceedings/3dv/2020/8128/0",
"title": "2020 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08998297",
"articleId": "1hrXhk9mu9W",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08998307",
"articleId": "1hpPBi8EjJe",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1yeDpGtSWLm",
"title": "Dec.",
"year": "2021",
"issueNum": "12",
"idPrefix": "tp",
"pubType": "journal",
"volume": "43",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1l3udiVJLpe",
"doi": "10.1109/TPAMI.2020.3005434",
"abstract": "Point cloud learning has lately attracted increasing attention due to its wide applications in many areas, such as computer vision, autonomous driving, and robotics. As a dominating technique in AI, deep learning has been successfully used to solve various 2D vision problems. However, deep learning on point clouds is still in its infancy due to the unique challenges faced by the processing of point clouds with deep neural networks. Recently, deep learning on point clouds has become even thriving, with numerous methods being proposed to address different problems in this area. To stimulate future research, this paper presents a comprehensive review of recent progress in deep learning methods for point clouds. It covers three major tasks, including 3D shape classification, 3D object detection and tracking, and 3D point cloud segmentation. It also presents comparative results on several publicly available datasets, together with insightful observations and inspiring future research directions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Point cloud learning has lately attracted increasing attention due to its wide applications in many areas, such as computer vision, autonomous driving, and robotics. As a dominating technique in AI, deep learning has been successfully used to solve various 2D vision problems. However, deep learning on point clouds is still in its infancy due to the unique challenges faced by the processing of point clouds with deep neural networks. Recently, deep learning on point clouds has become even thriving, with numerous methods being proposed to address different problems in this area. To stimulate future research, this paper presents a comprehensive review of recent progress in deep learning methods for point clouds. It covers three major tasks, including 3D shape classification, 3D object detection and tracking, and 3D point cloud segmentation. It also presents comparative results on several publicly available datasets, together with insightful observations and inspiring future research directions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Point cloud learning has lately attracted increasing attention due to its wide applications in many areas, such as computer vision, autonomous driving, and robotics. As a dominating technique in AI, deep learning has been successfully used to solve various 2D vision problems. However, deep learning on point clouds is still in its infancy due to the unique challenges faced by the processing of point clouds with deep neural networks. Recently, deep learning on point clouds has become even thriving, with numerous methods being proposed to address different problems in this area. To stimulate future research, this paper presents a comprehensive review of recent progress in deep learning methods for point clouds. It covers three major tasks, including 3D shape classification, 3D object detection and tracking, and 3D point cloud segmentation. It also presents comparative results on several publicly available datasets, together with insightful observations and inspiring future research directions.",
"title": "Deep Learning for 3D Point Clouds: A Survey",
"normalizedTitle": "Deep Learning for 3D Point Clouds: A Survey",
"fno": "09127813",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Computer Vision",
"Deep Learning Artificial Intelligence",
"Feature Extraction",
"Image Classification",
"Image Segmentation",
"Object Detection",
"Object Recognition",
"Solid Modelling",
"Deep Neural Networks",
"Deep Learning Methods",
"3 D Point Cloud Segmentation",
"Point Cloud Learning",
"2 D Vision Problems",
"3 D Shape Classification",
"3 D Object Detection",
"Three Dimensional Displays",
"Solid Modeling",
"Deep Learning",
"Object Detection",
"Laser Radar",
"Task Analysis",
"Sensors",
"Deep Learning",
"Point Clouds",
"3 D Data",
"Shape Classification",
"Shape Retrieval",
"Object Detection",
"Object Tracking",
"Scene Flow",
"Instance Segmentation",
"Semantic Segmentation",
"Part Segmentation"
],
"authors": [
{
"givenName": "Yulan",
"surname": "Guo",
"fullName": "Yulan Guo",
"affiliation": "School of Electronics and Communication Engineering, Sun Yat-sen University, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanyun",
"surname": "Wang",
"fullName": "Hanyun Wang",
"affiliation": "School of Surveying and Mapping, Information Engineering University, Zhengzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qingyong",
"surname": "Hu",
"fullName": "Qingyong Hu",
"affiliation": "Department of Computer Science, University of Oxford, Oxford, U.K",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hao",
"surname": "Liu",
"fullName": "Hao Liu",
"affiliation": "School of Electronics and Communication Engineering, Sun Yat-sen University, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Li",
"surname": "Liu",
"fullName": "Li Liu",
"affiliation": "College of System Engineering, National University of Defense Technology, Changsha, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mohammed",
"surname": "Bennamoun",
"fullName": "Mohammed Bennamoun",
"affiliation": "Department of Computer Science and Software Engineering, University of Western Australia, Crawley, WA, Australia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2021-12-01 00:00:00",
"pubType": "trans",
"pages": "4338-4364",
"year": "2021",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2004/2158/2/01315269",
"title": "Alignment of continuous video onto 3D point clouds",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2004/01315269/12OmNqBbHRu",
"parentPublication": {
"id": "proceedings/cvpr/2004/2158/2",
"title": "Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2005/08/i1305",
"title": "Alignment of Continuous Video onto 3D Point Clouds",
"doi": null,
"abstractUrl": "/journal/tp/2005/08/i1305/13rRUxASuHk",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsmt/2021/2063/0/206300a131",
"title": "Evaluating the Generalization of 3D Detectors with Hybrid Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/iccsmt/2021/206300a131/1E2wdlTDvji",
"parentPublication": {
"id": "proceedings/iccsmt/2021/2063/0",
"title": "2021 2nd International Conference on Computer Science and Management Technology (ICCSMT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdicn/2023/2136/0/213600a034",
"title": "Research on 3D Point Cloud Object Detection Methods Based on Deep Learning",
"doi": null,
"abstractUrl": "/proceedings-article/bdicn/2023/213600a034/1MIhreyj040",
"parentPublication": {
"id": "proceedings/bdicn/2023/2136/0",
"title": "2023 2nd International Conference on Big Data, Information and Computer Network (BDICN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805456",
"title": "LassoNet: Deep Lasso-Selection of 3D Point Clouds",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805456/1cG4x9FpdAI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2019/3293/0/329300a529",
"title": "FlowNet3D: Learning Scene Flow in 3D Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300a529/1gyrWW0i6A0",
"parentPublication": {
"id": "proceedings/cvpr/2019/3293/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2019/2506/0/250600b297",
"title": "Attentional PointNet for 3D-Object Detection in Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2019/250600b297/1iTvg6SK2dy",
"parentPublication": {
"id": "proceedings/cvprw/2019/2506/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412440",
"title": "Learning Interpretable Representation for 3D Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412440/1tmhN9Q0eg8",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900p5905",
"title": "PWCLO-Net: Deep LiDAR Odometry in 3D Point Clouds Using Hierarchical Embedding Mask Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900p5905/1yeKrD5i31m",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2021/2688/0/268800b196",
"title": "Geometric Adversarial Attacks and Defenses on 3D Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2021/268800b196/1zWElzlz47C",
"parentPublication": {
"id": "proceedings/3dv/2021/2688/0",
"title": "2021 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09119166",
"articleId": "1kHUHVxuNHi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09099404",
"articleId": "1k7oxhDZJM4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1D80ZaZz94I",
"title": "June",
"year": "2022",
"issueNum": "06",
"idPrefix": "tp",
"pubType": "journal",
"volume": "44",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1pA8gc6H8dO",
"doi": "10.1109/TPAMI.2020.3044712",
"abstract": "Machine learning models have been shown to be vulnerable to adversarial examples. While most of the existing methods for adversarial attack and defense work on the 2D image domain, a few recent attempts have been made to extend them to 3D point cloud data. However, adversarial results obtained by these methods typically contain point outliers, which are both noticeable and easy to defend against using the simple techniques of outlier removal. Motivated by the different mechanisms by which humans perceive 2D images and 3D shapes, in this paper we propose the new design of <italic>geometry-aware objectives</italic>, whose solutions favor (the discrete versions of) the desired surface properties of smoothness and fairness. To generate adversarial point clouds, we use a targeted attack misclassification loss that supports continuous pursuit of increasingly malicious signals. Regularizing the targeted attack loss with our proposed geometry-aware objectives results in our proposed method, <italic>Geometry-Aware Adversarial Attack (<inline-formula><tex-math notation=\"LaTeX\">Z_$GeoA^3$_Z</tex-math></inline-formula>)</italic>. The results of <inline-formula><tex-math notation=\"LaTeX\">Z_$GeoA^3$_Z</tex-math></inline-formula> tend to be more harmful, arguably harder to defend against, and of the key adversarial characterization of being imperceptible to humans. While the main focus of this paper is to learn to generate adversarial point clouds, we also present a simple but effective algorithm termed <inline-formula><tex-math notation=\"LaTeX\">Z_$Geo_{+}A^3$_Z</tex-math></inline-formula>-IterNormPro, with Iterative Normal Projection (IterNorPro) that solves a new objective function <inline-formula><tex-math notation=\"LaTeX\">Z_$Geo_{+}A^3$_Z</tex-math></inline-formula>, towards surface-level adversarial attacks via generation of adversarial point clouds. We quantitatively evaluate our methods on both synthetic and physical objects in terms of attack success rate and geometric regularity. For a qualitative evaluation, we conduct subjective studies by collecting human preferences from Amazon Mechanical Turk. Comparative results in comprehensive experiments confirm the advantages of our proposed methods. Our source codes are publicly available at <uri>https://github.com/Yuxin-Wen/GeoA3</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Machine learning models have been shown to be vulnerable to adversarial examples. While most of the existing methods for adversarial attack and defense work on the 2D image domain, a few recent attempts have been made to extend them to 3D point cloud data. However, adversarial results obtained by these methods typically contain point outliers, which are both noticeable and easy to defend against using the simple techniques of outlier removal. Motivated by the different mechanisms by which humans perceive 2D images and 3D shapes, in this paper we propose the new design of <italic>geometry-aware objectives</italic>, whose solutions favor (the discrete versions of) the desired surface properties of smoothness and fairness. To generate adversarial point clouds, we use a targeted attack misclassification loss that supports continuous pursuit of increasingly malicious signals. Regularizing the targeted attack loss with our proposed geometry-aware objectives results in our proposed method, <italic>Geometry-Aware Adversarial Attack (<inline-formula><tex-math notation=\"LaTeX\">$GeoA^3$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>G</mml:mi><mml:mi>e</mml:mi><mml:mi>o</mml:mi><mml:msup><mml:mi>A</mml:mi><mml:mn>3</mml:mn></mml:msup></mml:mrow></mml:math><inline-graphic xlink:href=\"wen-ieq1-3044712.gif\"/></alternatives></inline-formula>)</italic>. The results of <inline-formula><tex-math notation=\"LaTeX\">$GeoA^3$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>G</mml:mi><mml:mi>e</mml:mi><mml:mi>o</mml:mi><mml:msup><mml:mi>A</mml:mi><mml:mn>3</mml:mn></mml:msup></mml:mrow></mml:math><inline-graphic xlink:href=\"wen-ieq2-3044712.gif\"/></alternatives></inline-formula> tend to be more harmful, arguably harder to defend against, and of the key adversarial characterization of being imperceptible to humans. While the main focus of this paper is to learn to generate adversarial point clouds, we also present a simple but effective algorithm termed <inline-formula><tex-math notation=\"LaTeX\">$Geo_{+}A^3$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>G</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>o</mml:mi><mml:mo>+</mml:mo></mml:msub><mml:msup><mml:mi>A</mml:mi><mml:mn>3</mml:mn></mml:msup></mml:mrow></mml:math><inline-graphic xlink:href=\"wen-ieq3-3044712.gif\"/></alternatives></inline-formula>-IterNormPro, with Iterative Normal Projection (IterNorPro) that solves a new objective function <inline-formula><tex-math notation=\"LaTeX\">$Geo_{+}A^3$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>G</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>o</mml:mi><mml:mo>+</mml:mo></mml:msub><mml:msup><mml:mi>A</mml:mi><mml:mn>3</mml:mn></mml:msup></mml:mrow></mml:math><inline-graphic xlink:href=\"wen-ieq4-3044712.gif\"/></alternatives></inline-formula>, towards surface-level adversarial attacks via generation of adversarial point clouds. We quantitatively evaluate our methods on both synthetic and physical objects in terms of attack success rate and geometric regularity. For a qualitative evaluation, we conduct subjective studies by collecting human preferences from Amazon Mechanical Turk. Comparative results in comprehensive experiments confirm the advantages of our proposed methods. Our source codes are publicly available at <uri>https://github.com/Yuxin-Wen/GeoA3</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Machine learning models have been shown to be vulnerable to adversarial examples. While most of the existing methods for adversarial attack and defense work on the 2D image domain, a few recent attempts have been made to extend them to 3D point cloud data. However, adversarial results obtained by these methods typically contain point outliers, which are both noticeable and easy to defend against using the simple techniques of outlier removal. Motivated by the different mechanisms by which humans perceive 2D images and 3D shapes, in this paper we propose the new design of geometry-aware objectives, whose solutions favor (the discrete versions of) the desired surface properties of smoothness and fairness. To generate adversarial point clouds, we use a targeted attack misclassification loss that supports continuous pursuit of increasingly malicious signals. Regularizing the targeted attack loss with our proposed geometry-aware objectives results in our proposed method, Geometry-Aware Adversarial Attack (-). The results of - tend to be more harmful, arguably harder to defend against, and of the key adversarial characterization of being imperceptible to humans. While the main focus of this paper is to learn to generate adversarial point clouds, we also present a simple but effective algorithm termed --IterNormPro, with Iterative Normal Projection (IterNorPro) that solves a new objective function -, towards surface-level adversarial attacks via generation of adversarial point clouds. We quantitatively evaluate our methods on both synthetic and physical objects in terms of attack success rate and geometric regularity. For a qualitative evaluation, we conduct subjective studies by collecting human preferences from Amazon Mechanical Turk. Comparative results in comprehensive experiments confirm the advantages of our proposed methods. Our source codes are publicly available at https://github.com/Yuxin-Wen/GeoA3.",
"title": "Geometry-Aware Generation of Adversarial Point Clouds",
"normalizedTitle": "Geometry-Aware Generation of Adversarial Point Clouds",
"fno": "09294112",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Cloud Computing",
"Computational Geometry",
"Data Visualisation",
"Geometry",
"Iterative Methods",
"Learning Artificial Intelligence",
"Security Of Data",
"Solid Modelling",
"Telecommunication Security",
"Key Adversarial Characterization",
"Adversarial Point Clouds",
"Surface Level Adversarial Attacks",
"Geometry Aware Generation",
"Adversarial Examples",
"Defense Work",
"3 D Point Cloud Data",
"Adversarial Results",
"Point Outliers",
"Targeted Attack Misclassification Loss",
"Targeted Attack Loss",
"Geometry Aware Objectives Results",
"Geometry Aware Adversarial Attack",
"Three Dimensional Displays",
"Two Dimensional Displays",
"Shape",
"Image Reconstruction",
"Surface Reconstruction",
"Perturbation Methods",
"Surface Treatment",
"Adversarial Example",
"Point Cloud",
"Object Surface Geometry"
],
"authors": [
{
"givenName": "Yuxin",
"surname": "Wen",
"fullName": "Yuxin Wen",
"affiliation": "School of Electronic and Information Engineering, South China University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiehong",
"surname": "Lin",
"fullName": "Jiehong Lin",
"affiliation": "School of Electronic and Information Engineering, South China University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ke",
"surname": "Chen",
"fullName": "Ke Chen",
"affiliation": "School of Electronic and Information Engineering, South China University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "C. L. Philip",
"surname": "Chen",
"fullName": "C. L. Philip Chen",
"affiliation": "School of Computer Science and Engineering, South China University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kui",
"surname": "Jia",
"fullName": "Kui Jia",
"affiliation": "School of Electronic and Information Engineering, South China University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2022-06-01 00:00:00",
"pubType": "trans",
"pages": "2984-2999",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tp/2023/01/09681162",
"title": "Point Cloud Sampling via Graph Balancing and Gershgorin Disc Alignment",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09681162/1A8c6sY0Afe",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2022/02/09690063",
"title": "Algebraic Attacks on Block Ciphers Using Quantum Annealing",
"doi": null,
"abstractUrl": "/journal/ec/2022/02/09690063/1AlCiyYAakw",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/12/09732663",
"title": "Optimal Convex Hull Formation on a Grid by Asynchronous Robots With Lights",
"doi": null,
"abstractUrl": "/journal/td/2022/12/09732663/1BD8Qcr91gQ",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2020/02/08730423",
"title": "Predicting Carbon Spectrum in Heteronuclear Single Quantum Coherence Spectroscopy for Online Feedback During Surgery",
"doi": null,
"abstractUrl": "/journal/tb/2020/02/08730423/1aAwyubtkha",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2020/06/08976264",
"title": "Algorithms for Inversion Mod <inline-formula><tex-math notation="LaTeX">Z_$p^k$_Z</tex-math></inline-formula>",
"doi": null,
"abstractUrl": "/journal/tc/2020/06/08976264/1h0W7qmGRHO",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/01/09037115",
"title": "Aligning Points to Lines: Provable Approximations",
"doi": null,
"abstractUrl": "/journal/tk/2022/01/09037115/1igMO6tI3Is",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/03/09354558",
"title": "An Efficient CRT-Based Bit-Parallel Multiplier for Special Pentanomials",
"doi": null,
"abstractUrl": "/journal/tc/2022/03/09354558/1reXzOLMhX2",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/06/09445629",
"title": "Up to <inline-formula><tex-math notation=\"LaTeX\">Z_$8k$_Z</tex-math></inline-formula>-bit Modular Montgomery Multiplication in Residue Number Systems With Fast 16-bit Residue Channels",
"doi": null,
"abstractUrl": "/journal/tc/2022/06/09445629/1uaauvs6N0c",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/10/09448388",
"title": "A Hybrid Stochastic-Deterministic Minibatch Proximal Gradient Method for Efficient Optimization and Generalization",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09448388/1ugE3BTixLq",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/04/09650532",
"title": "A Variational Framework for Curve Shortening in Various Geometric Domains",
"doi": null,
"abstractUrl": "/journal/tg/2023/04/09650532/1zkoVsoJeow",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09328198",
"articleId": "1qutR6kaNSU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09320561",
"articleId": "1qkwANyEXq8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1D34Iu3iR1e",
"title": "June",
"year": "2022",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1o3nNOnFv7G",
"doi": "10.1109/TVCG.2020.3032123",
"abstract": "We present SSR-TVD, a novel deep learning framework that produces coherent spatial super-resolution (SSR) of time-varying data (TVD) using adversarial learning. In scientific visualization, SSR-TVD is the first work that applies the generative adversarial network (GAN) to generate high-resolution volumes for three-dimensional time-varying data sets. The design of SSR-TVD includes a generator and two discriminators (spatial and temporal discriminators). The generator takes a low-resolution volume as input and outputs a synthesized high-resolution volume. To capture spatial and temporal coherence in the volume sequence, the two discriminators take the synthesized high-resolution volume(s) as input and produce a score indicating the realness of the volume(s). Our method can work in the in situ visualization setting by downscaling volumetric data from selected time steps as the simulation runs and upscaling downsampled volumes to their original resolution during postprocessing. To demonstrate the effectiveness of SSR-TVD, we show quantitative and qualitative results with several time-varying data sets of different characteristics and compare our method against volume upscaling using bicubic interpolation and a solution solely based on CNN.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present SSR-TVD, a novel deep learning framework that produces coherent spatial super-resolution (SSR) of time-varying data (TVD) using adversarial learning. In scientific visualization, SSR-TVD is the first work that applies the generative adversarial network (GAN) to generate high-resolution volumes for three-dimensional time-varying data sets. The design of SSR-TVD includes a generator and two discriminators (spatial and temporal discriminators). The generator takes a low-resolution volume as input and outputs a synthesized high-resolution volume. To capture spatial and temporal coherence in the volume sequence, the two discriminators take the synthesized high-resolution volume(s) as input and produce a score indicating the realness of the volume(s). Our method can work in the in situ visualization setting by downscaling volumetric data from selected time steps as the simulation runs and upscaling downsampled volumes to their original resolution during postprocessing. To demonstrate the effectiveness of SSR-TVD, we show quantitative and qualitative results with several time-varying data sets of different characteristics and compare our method against volume upscaling using bicubic interpolation and a solution solely based on CNN.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present SSR-TVD, a novel deep learning framework that produces coherent spatial super-resolution (SSR) of time-varying data (TVD) using adversarial learning. In scientific visualization, SSR-TVD is the first work that applies the generative adversarial network (GAN) to generate high-resolution volumes for three-dimensional time-varying data sets. The design of SSR-TVD includes a generator and two discriminators (spatial and temporal discriminators). The generator takes a low-resolution volume as input and outputs a synthesized high-resolution volume. To capture spatial and temporal coherence in the volume sequence, the two discriminators take the synthesized high-resolution volume(s) as input and produce a score indicating the realness of the volume(s). Our method can work in the in situ visualization setting by downscaling volumetric data from selected time steps as the simulation runs and upscaling downsampled volumes to their original resolution during postprocessing. To demonstrate the effectiveness of SSR-TVD, we show quantitative and qualitative results with several time-varying data sets of different characteristics and compare our method against volume upscaling using bicubic interpolation and a solution solely based on CNN.",
"title": "SSR-TVD: Spatial Super-Resolution for Time-Varying Data Analysis and Visualization",
"normalizedTitle": "SSR-TVD: Spatial Super-Resolution for Time-Varying Data Analysis and Visualization",
"fno": "09229162",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Image Resolution",
"Interpolation",
"Learning Artificial Intelligence",
"SSR TVD",
"Spatial Super Resolution",
"Time Varying Data Analysis",
"Generative Adversarial Network",
"High Resolution Volumes",
"Three Dimensional Time Varying Data Sets",
"Temporal Discriminators",
"Low Resolution Volume",
"Synthesized High Resolution Volume",
"Spatial Coherence",
"Temporal Coherence",
"Simulation",
"Upscaling Downsampled Volumes",
"Original Resolution",
"Data Visualization",
"Coherence",
"Deep Learning",
"Generative Adversarial Networks",
"Training",
"Gallium Nitride",
"Time Varying Data Visualization",
"Deep Learning",
"Super Resolution",
"Generative Adversarial Network"
],
"authors": [
{
"givenName": "Jun",
"surname": "Han",
"fullName": "Jun Han",
"affiliation": "Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chaoli",
"surname": "Wang",
"fullName": "Chaoli Wang",
"affiliation": "Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2022-06-01 00:00:00",
"pubType": "trans",
"pages": "2445-2456",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isspit/2004/8689/0/01433713",
"title": "Analysis of SSR signals by super resolution algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2004/01433713/12OmNvjQ8IM",
"parentPublication": {
"id": "proceedings/isspit/2004/8689/0",
"title": "Proceedings of the Fourth IEEE International Symposium on Signal Processing and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000d994",
"title": "Feature Super-Resolution: Make Machine See More Clearly",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000d994/17D45VsBTYU",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08802285",
"title": "TSR-TVD: Temporal Super-Resolution for Time-Varying Data Analysis and Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08802285/1ds7kEn7Eru",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300c433",
"title": "Kernel Modeling Super-Resolution on Real Low-Resolution Images",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300c433/1hQqxkiAwjC",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2019/5023/0/502300d599",
"title": "Frequency Separation for Real-World Super-Resolution",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2019/502300d599/1i5mH5rN1UA",
"parentPublication": {
"id": "proceedings/iccvw/2019/5023/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2019/2506/0/250600b814",
"title": "Exemplar Guided Face Image Super-Resolution Without Facial Landmarks",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2019/250600b814/1iTveowyDuM",
"parentPublication": {
"id": "proceedings/cvprw/2019/2506/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2020/5697/0/09086293",
"title": "SSR-VFD: Spatial Super-Resolution for Vector Field Data Analysis and Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2020/09086293/1kuHkNHF4xG",
"parentPublication": {
"id": "proceedings/pacificvis/2020/5697/0",
"title": "2020 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2020/1331/0/09102779",
"title": "A Multi-Player Minimax Game for Generative Adversarial Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2020/09102779/1kwr6BsKnRu",
"parentPublication": {
"id": "proceedings/icme/2020/1331/0",
"title": "2020 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2020/1331/0/09102972",
"title": "Multiresolution Mixture Generative Adversarial Network For Image Super-Resolution",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2020/09102972/1kwrfPvRRkI",
"parentPublication": {
"id": "proceedings/icme/2020/1331/0",
"title": "2020 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2020/9360/0/09150661",
"title": "Real-World Super-Resolution using Generative Adversarial Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2020/09150661/1lPH66Ff2HS",
"parentPublication": {
"id": "proceedings/cvprw/2020/9360/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09234096",
"articleId": "1o546fdr6GA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09237128",
"articleId": "1o8mjRH4r3G",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1D35ehaI4jS",
"name": "ttg202206-09229162s1-supp1-3032123.wmv",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202206-09229162s1-supp1-3032123.wmv",
"extension": "wmv",
"size": "123 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1z98erbYoUw",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": "44",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1lNXsekD4ha",
"doi": "10.1109/TPAMI.2020.3012096",
"abstract": "Generative adversarial networks (GANs) have shown remarkable success in generating realistic data from some predefined prior distribution (e.g., Gaussian noises). However, such prior distribution is often independent of real data and thus may lose semantic information (e.g., geometric structure or content in images) of data. In practice, the semantic information might be represented by some latent distribution learned from data. However, such latent distribution may incur difficulties in data sampling for GAN methods. In this paper, rather than sampling from the predefined prior distribution, we propose a GAN model with local coordinate coding (LCC), termed LCCGAN, to improve the performance of the image generation. First, we propose an LCC sampling method in LCCGAN to sample meaningful points from the latent manifold. With the LCC sampling method, we can explicitly exploit the local information on the latent manifold and thus produce new data with promising quality. Second, we propose an improved version, namely LCCGAN++, by introducing a higher-order term in the generator approximation. This term is able to achieve better approximation and thus further improve the performance. More critically, we derive the generalization bound for both LCCGAN and LCCGAN++ and prove that a low-dimensional input is sufficient to achieve good generalization performance. Extensive experiments on several benchmark datasets demonstrate the superiority of the proposed method over existing GAN methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Generative adversarial networks (GANs) have shown remarkable success in generating realistic data from some predefined prior distribution (e.g., Gaussian noises). However, such prior distribution is often independent of real data and thus may lose semantic information (e.g., geometric structure or content in images) of data. In practice, the semantic information might be represented by some latent distribution learned from data. However, such latent distribution may incur difficulties in data sampling for GAN methods. In this paper, rather than sampling from the predefined prior distribution, we propose a GAN model with local coordinate coding (LCC), termed LCCGAN, to improve the performance of the image generation. First, we propose an LCC sampling method in LCCGAN to sample meaningful points from the latent manifold. With the LCC sampling method, we can explicitly exploit the local information on the latent manifold and thus produce new data with promising quality. Second, we propose an improved version, namely LCCGAN++, by introducing a higher-order term in the generator approximation. This term is able to achieve better approximation and thus further improve the performance. More critically, we derive the generalization bound for both LCCGAN and LCCGAN++ and prove that a low-dimensional input is sufficient to achieve good generalization performance. Extensive experiments on several benchmark datasets demonstrate the superiority of the proposed method over existing GAN methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Generative adversarial networks (GANs) have shown remarkable success in generating realistic data from some predefined prior distribution (e.g., Gaussian noises). However, such prior distribution is often independent of real data and thus may lose semantic information (e.g., geometric structure or content in images) of data. In practice, the semantic information might be represented by some latent distribution learned from data. However, such latent distribution may incur difficulties in data sampling for GAN methods. In this paper, rather than sampling from the predefined prior distribution, we propose a GAN model with local coordinate coding (LCC), termed LCCGAN, to improve the performance of the image generation. First, we propose an LCC sampling method in LCCGAN to sample meaningful points from the latent manifold. With the LCC sampling method, we can explicitly exploit the local information on the latent manifold and thus produce new data with promising quality. Second, we propose an improved version, namely LCCGAN++, by introducing a higher-order term in the generator approximation. This term is able to achieve better approximation and thus further improve the performance. More critically, we derive the generalization bound for both LCCGAN and LCCGAN++ and prove that a low-dimensional input is sufficient to achieve good generalization performance. Extensive experiments on several benchmark datasets demonstrate the superiority of the proposed method over existing GAN methods.",
"title": "Improving Generative Adversarial Networks With Local Coordinate Coding",
"normalizedTitle": "Improving Generative Adversarial Networks With Local Coordinate Coding",
"fno": "09149832",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Approximation Theory",
"Computer Vision",
"Image Sampling",
"Learning Artificial Intelligence",
"Neural Nets",
"Generative Adversarial Networks",
"Local Coordinate Coding",
"Latent Distribution",
"Image Generation",
"LCC Sampling Method",
"Latent Manifold",
"Higher Order Term",
"Generator Approximation",
"LCCGAN",
"Computer Vision",
"Gallium Nitride",
"Manifolds",
"Generative Adversarial Networks",
"Semantics",
"Encoding",
"Sampling Methods",
"Generators",
"Generative Adversarial Networks",
"Local Coordinate Coding",
"Latent Distribution",
"Generalization Bound"
],
"authors": [
{
"givenName": "Jiezhang",
"surname": "Cao",
"fullName": "Jiezhang Cao",
"affiliation": "School of Software Engineering, South China University of Technology, Guangzhou, Guangdong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yong",
"surname": "Guo",
"fullName": "Yong Guo",
"affiliation": "School of Software Engineering, South China University of Technology, Guangzhou, Guangdong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qingyao",
"surname": "Wu",
"fullName": "Qingyao Wu",
"affiliation": "University of Adelaide, Adelaide, SA, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chunhua",
"surname": "Shen",
"fullName": "Chunhua Shen",
"affiliation": "University of Adelaide, Adelaide, SA, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Junzhou",
"surname": "Huang",
"fullName": "Junzhou Huang",
"affiliation": "Tencent AI Laboratory, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mingkui",
"surname": "Tan",
"fullName": "Mingkui Tan",
"affiliation": "School of Software Engineering, South China University of Technology, Guangzhou, Guangdong, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "211-227",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2018/1737/0/08486594",
"title": "Syncgan: Synchronize the Latent Spaces of Cross-Modal Generative Adversarial Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2018/08486594/14jQfS7rpoT",
"parentPublication": {
"id": "proceedings/icme/2018/1737/0",
"title": "2018 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2018/1737/0/08486440",
"title": "Densely Stacked Generative Adversarial Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2018/08486440/14jQfSnkWGs",
"parentPublication": {
"id": "proceedings/icme/2018/1737/0",
"title": "2018 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000f657",
"title": "DA-GAN: Instance-Level Image Translation by Deep Attention Generative Adversarial Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000f657/17D45VObpNB",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08545881",
"title": "MMGAN: Manifold-Matching Generative Adversarial Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08545881/17D45WHONmN",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08545894",
"title": "Data Augmentation with Improved Generative Adversarial Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08545894/17D45WKWnJc",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000b498",
"title": "Duplex Generative Adversarial Network for Unsupervised Domain Adaptation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000b498/17D45WYQJ9i",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000j455",
"title": "ST-GAN: Spatial Transformer Generative Adversarial Networks for Image Compositing",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000j455/17D45XacGkf",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2019/1975/0/197500a848",
"title": "Style and Content Disentanglement in Generative Adversarial Networks",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2019/197500a848/18j8FazPuwM",
"parentPublication": {
"id": "proceedings/wacv/2019/1975/0",
"title": "2019 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdew/2019/0890/0/089000a161",
"title": "Collaborative Generative Adversarial Network for Recommendation Systems",
"doi": null,
"abstractUrl": "/proceedings-article/icdew/2019/089000a161/1bhJ8MxYi4g",
"parentPublication": {
"id": "proceedings/icdew/2019/0890/0",
"title": "2019 IEEE 35th International Conference on Data Engineering Workshops (ICDEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2020/9360/0/09150306",
"title": "Latent Fingerprint Image Enhancement Based on Progressive Generative Adversarial Network",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2020/09150306/1lPHiGvS7Vm",
"parentPublication": {
"id": "proceedings/cvprw/2020/9360/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09127821",
"articleId": "1l3uhnxjxaU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09137383",
"articleId": "1lk5bdPs4kE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1z98qWzho2Y",
"name": "ttp202201-09149832s1-supp1-3012096.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp202201-09149832s1-supp1-3012096.pdf",
"extension": "pdf",
"size": "272 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAPjA9P",
"title": "September/October",
"year": "2011",
"issueNum": "05",
"idPrefix": "tb",
"pubType": "journal",
"volume": "8",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxly94f",
"doi": "10.1109/TCBB.2011.18",
"abstract": "Deciphering the biological networks underlying complex phenotypic traits, e.g., human disease is undoubtedly crucial to understand the underlying molecular mechanisms and to develop effective therapeutics. Due to the network complexity and the relatively small number of available experiments, data-driven modeling is a great challenge for deducing the functions of genes/proteins in the network and in phenotype formation. We propose a novel knowledge-driven systems biology method that utilizes qualitative knowledge to construct a Dynamic Bayesian network (DBN) to represent the biological network underlying a specific phenotype. Edges in this network depict physical interactions between genes and/or proteins. A qualitative knowledge model first translates typical molecular interactions into constraints when resolving the DBN structure and parameters. Therefore, the uncertainty of the network is restricted to a subset of models which are consistent with the qualitative knowledge. All models satisfying the constraints are considered as candidates for the underlying network. These consistent models are used to perform quantitative inference. By in silico inference, we can predict phenotypic traits upon genetic interventions and perturbing in the network. We applied our method to analyze the puzzling mechanism of breast cancer cell proliferation network and we accurately predicted cancer cell growth rate upon manipulating (anti)cancerous marker genes/proteins.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Deciphering the biological networks underlying complex phenotypic traits, e.g., human disease is undoubtedly crucial to understand the underlying molecular mechanisms and to develop effective therapeutics. Due to the network complexity and the relatively small number of available experiments, data-driven modeling is a great challenge for deducing the functions of genes/proteins in the network and in phenotype formation. We propose a novel knowledge-driven systems biology method that utilizes qualitative knowledge to construct a Dynamic Bayesian network (DBN) to represent the biological network underlying a specific phenotype. Edges in this network depict physical interactions between genes and/or proteins. A qualitative knowledge model first translates typical molecular interactions into constraints when resolving the DBN structure and parameters. Therefore, the uncertainty of the network is restricted to a subset of models which are consistent with the qualitative knowledge. All models satisfying the constraints are considered as candidates for the underlying network. These consistent models are used to perform quantitative inference. By in silico inference, we can predict phenotypic traits upon genetic interventions and perturbing in the network. We applied our method to analyze the puzzling mechanism of breast cancer cell proliferation network and we accurately predicted cancer cell growth rate upon manipulating (anti)cancerous marker genes/proteins.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Deciphering the biological networks underlying complex phenotypic traits, e.g., human disease is undoubtedly crucial to understand the underlying molecular mechanisms and to develop effective therapeutics. Due to the network complexity and the relatively small number of available experiments, data-driven modeling is a great challenge for deducing the functions of genes/proteins in the network and in phenotype formation. We propose a novel knowledge-driven systems biology method that utilizes qualitative knowledge to construct a Dynamic Bayesian network (DBN) to represent the biological network underlying a specific phenotype. Edges in this network depict physical interactions between genes and/or proteins. A qualitative knowledge model first translates typical molecular interactions into constraints when resolving the DBN structure and parameters. Therefore, the uncertainty of the network is restricted to a subset of models which are consistent with the qualitative knowledge. All models satisfying the constraints are considered as candidates for the underlying network. These consistent models are used to perform quantitative inference. By in silico inference, we can predict phenotypic traits upon genetic interventions and perturbing in the network. We applied our method to analyze the puzzling mechanism of breast cancer cell proliferation network and we accurately predicted cancer cell growth rate upon manipulating (anti)cancerous marker genes/proteins.",
"title": "A Novel Knowledge-Driven Systems Biology Approach for Phenotype Prediction upon Genetic Intervention",
"normalizedTitle": "A Novel Knowledge-Driven Systems Biology Approach for Phenotype Prediction upon Genetic Intervention",
"fno": "ttb2011051170",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Dynamic Bayesian Network",
"Genetic Network",
"Phenotype Prediction",
"Genetic Intervention",
"Systems Biology",
"Breast Cancer",
"Cell Proliferation"
],
"authors": [
{
"givenName": "Rui",
"surname": "Chang",
"fullName": "Rui Chang",
"affiliation": "University of California, San Diego, San Diego",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert",
"surname": "Shoemaker",
"fullName": "Robert Shoemaker",
"affiliation": "University of California, San Diego, San Diego",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Wang",
"fullName": "Wei Wang",
"affiliation": "University of California, San Diego, San Diego",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2011-09-01 00:00:00",
"pubType": "trans",
"pages": "1170-1182",
"year": "2011",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/nsw/2011/1049/0/06004639",
"title": "Using meta-networks to identify key intervention points in nuclear WMD development",
"doi": null,
"abstractUrl": "/proceedings-article/nsw/2011/06004639/12OmNAq3hzN",
"parentPublication": {
"id": "proceedings/nsw/2011/1049/0",
"title": "IEEE Network Science Workshop",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibmw/2009/5121/0/05332070",
"title": "Discovery of cancer-related new drug target proteins from re-constructed human disease network based on protein-protein interaction netowk",
"doi": null,
"abstractUrl": "/proceedings-article/bibmw/2009/05332070/12OmNBJw9SK",
"parentPublication": {
"id": "proceedings/bibmw/2009/5121/0",
"title": "2009 IEEE International Conference on Bioinformatics and Biomedicine Workshop",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/micai/2006/2722/0/04022167",
"title": "Finding DNA Motifs Using Genetic Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/micai/2006/04022167/12OmNqGRGgD",
"parentPublication": {
"id": "proceedings/micai/2006/2722/0",
"title": "2006 Fifth Mexican International Conference on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2009/3885/0/3885a222",
"title": "Towards Identification of Human Disease Phenotype-Genotype Association via a Network-Module Based Method",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2009/3885a222/12OmNscOUim",
"parentPublication": {
"id": "proceedings/bibm/2009/3885/0",
"title": "2009 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2010/4083/0/4083a302",
"title": "Identifying Prostate Cancer-Related Networks from Microarray Data Based on Genotype-Phenotype Networks Using Markov Blanket Search",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2010/4083a302/12OmNylsZKa",
"parentPublication": {
"id": "proceedings/bibe/2010/4083/0",
"title": "2010 IEEE International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2012/2559/0/06392658",
"title": "Network-based inferring drug-disease associations from chemical, genomic and phenotype data",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2012/06392658/12OmNyyeWyn",
"parentPublication": {
"id": "proceedings/bibm/2012/2559/0",
"title": "2012 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2005/9313/0/01577066",
"title": "Biological significance of a novel biclustering technique on genetic expression data",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2005/01577066/12OmNzahc5m",
"parentPublication": {
"id": "proceedings/isspit/2005/9313/0",
"title": "2005 IEEE International Symposium on Signal Processing and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498baker",
"title": "GeneVis: Visualization Tools for Genetic Regulatory Network Dynamics",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498baker/12OmNzcxZrN",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2005/03/n0231",
"title": "Discovering Gene Networks with a Neural-Genetic Hybrid",
"doi": null,
"abstractUrl": "/journal/tb/2005/03/n0231/13rRUILLktX",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2011/05/ttb2011051208",
"title": "Continuous Cotemporal Probabilistic Modeling of Systems Biology Networks from Sparse Data",
"doi": null,
"abstractUrl": "/journal/tb/2011/05/ttb2011051208/13rRUxBa54C",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttb2011051153",
"articleId": "13rRUx0xPli",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttb2011051183",
"articleId": "13rRUxly8W1",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqG0SS0",
"title": "Sept.-Oct.",
"year": "2012",
"issueNum": "05",
"idPrefix": "tb",
"pubType": "journal",
"volume": "9",
"label": "Sept.-Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxbTMxB",
"doi": "10.1109/TCBB.2012.53",
"abstract": "Associating functional information with biological sequences remains a challenge for machine learning methods. The performance of these methods often depends on deriving predictive features from the sequences sought to be classified. Feature generation is a difficult problem, as the connection between the sequence features and the sought property is not known a priori. It is often the task of domain experts or exhaustive feature enumeration techniques to generate a few features whose predictive power is then tested in the context of classification. This paper proposes an evolutionary algorithm to effectively explore a large feature space and generate predictive features from sequence data. The effectiveness of the algorithm is demonstrated on an important component of the gene-finding problem, DNA splice site prediction. This application is chosen due to the complexity of the features needed to obtain high classification accuracy and precision. Our results test the effectiveness of the obtained features in the context of classification by Support Vector Machines and show significant improvement in accuracy and precision over state-of-the-art approaches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Associating functional information with biological sequences remains a challenge for machine learning methods. The performance of these methods often depends on deriving predictive features from the sequences sought to be classified. Feature generation is a difficult problem, as the connection between the sequence features and the sought property is not known a priori. It is often the task of domain experts or exhaustive feature enumeration techniques to generate a few features whose predictive power is then tested in the context of classification. This paper proposes an evolutionary algorithm to effectively explore a large feature space and generate predictive features from sequence data. The effectiveness of the algorithm is demonstrated on an important component of the gene-finding problem, DNA splice site prediction. This application is chosen due to the complexity of the features needed to obtain high classification accuracy and precision. Our results test the effectiveness of the obtained features in the context of classification by Support Vector Machines and show significant improvement in accuracy and precision over state-of-the-art approaches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Associating functional information with biological sequences remains a challenge for machine learning methods. The performance of these methods often depends on deriving predictive features from the sequences sought to be classified. Feature generation is a difficult problem, as the connection between the sequence features and the sought property is not known a priori. It is often the task of domain experts or exhaustive feature enumeration techniques to generate a few features whose predictive power is then tested in the context of classification. This paper proposes an evolutionary algorithm to effectively explore a large feature space and generate predictive features from sequence data. The effectiveness of the algorithm is demonstrated on an important component of the gene-finding problem, DNA splice site prediction. This application is chosen due to the complexity of the features needed to obtain high classification accuracy and precision. Our results test the effectiveness of the obtained features in the context of classification by Support Vector Machines and show significant improvement in accuracy and precision over state-of-the-art approaches.",
"title": "An Evolutionary Algorithm Approach for Feature Generation from Sequence Data and Its Application to DNA Splice Site Prediction",
"normalizedTitle": "An Evolutionary Algorithm Approach for Feature Generation from Sequence Data and Its Application to DNA Splice Site Prediction",
"fno": "ttb2012051387",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Support Vector Machines",
"Biological Techniques",
"DNA",
"Evolutionary Computation",
"Genetic Algorithms",
"Molecular Biophysics",
"Genetic Programming",
"Evolutionary Algorithm Approach",
"Feature Generation",
"DNA Splice Site Prediction",
"Biological Sequence Data",
"Machine Learning Methods",
"Gene Finding Problem",
"Support Vector Machines",
"State Of The Art Approach",
"DNA",
"Support Vector Machines",
"Bioinformatics",
"Accuracy",
"Training Data",
"Prediction Algorithms",
"DNA Splice Sites",
"Evolutionary Computation",
"Genetic Programming",
"Feature Extraction And Construction",
"Classifier Design And Evaluation",
"Data Mining"
],
"authors": [
{
"givenName": "Uday",
"surname": "Kamath",
"fullName": "Uday Kamath",
"affiliation": "Dept. of Comput. Sci., George Mason Univ., Ashburn, VA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jack",
"surname": "Compton",
"fullName": "Jack Compton",
"affiliation": "Barquin Int., Alexandria, VA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rezarta",
"surname": "Islamaj-Dogan",
"fullName": "Rezarta Islamaj-Dogan",
"affiliation": "Nat. Center for Biotechnol. Inf. (NCBI), Nat. Inst. of Health (NIH), Bethesda, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kenneth A.",
"surname": "De Jong",
"fullName": "Kenneth A. De Jong",
"affiliation": "Dept. of Comput. Sci., George Mason Univ., Fairfax, VA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Amarda",
"surname": "Shehu",
"fullName": "Amarda Shehu",
"affiliation": "Dept. of Comput. Sci., George Mason Univ., Fairfax, VA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2012-09-01 00:00:00",
"pubType": "trans",
"pages": "1387-1398",
"year": "2012",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ijsis/1996/7728/0/77280012",
"title": "Functional Site Prediction on the DNA sequence by Artificial Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/ijsis/1996/77280012/12OmNBcAGOG",
"parentPublication": {
"id": "proceedings/ijsis/1996/7728/0",
"title": "Intelligence and Systems, IEEE International Joint Symposia on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imsccs/2008/3430/0/3430a001",
"title": "Evolutionary Conservation and Interacting Preference for Identifying Protein-DNA Interactions",
"doi": null,
"abstractUrl": "/proceedings-article/imsccs/2008/3430a001/12OmNqOwQGm",
"parentPublication": {
"id": "proceedings/imsccs/2008/3430/0",
"title": "Computer and Computational Sciences, International Multi-Symposiums on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2013/2138/0/5070a085",
"title": "Undersampling Strategy Based on Clustering to Improve the Performance of Splice Site Classification in Human Genes",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2013/5070a085/12OmNs59JX9",
"parentPublication": {
"id": "proceedings/dexa/2013/2138/0",
"title": "2013 24th International Workshop on Database and Expert Systems Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisis/2008/3109/0/3109a687",
"title": "Splice Site Recognition in DNA Sequences Using K-mer Frequency Based Mapping for Support Vector Machine with Power Series Kernel",
"doi": null,
"abstractUrl": "/proceedings-article/cisis/2008/3109a687/12OmNvoWUWJ",
"parentPublication": {
"id": "proceedings/cisis/2008/3109/0",
"title": "2008 International Conference on Complex, Intelligent and Software Intensive Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1990/2082/0/089555",
"title": "Inferring evolutionary history from DNA sequences",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1990/089555/12OmNvzJGeY",
"parentPublication": {
"id": "proceedings/focs/1990/2082/0",
"title": "Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibmw/2009/5121/0/05332130",
"title": "Evaluation of Weight Matrix Models in the splice junction recognition problem",
"doi": null,
"abstractUrl": "/proceedings-article/bibmw/2009/05332130/12OmNxuXcAh",
"parentPublication": {
"id": "proceedings/bibmw/2009/5121/0",
"title": "2009 IEEE International Conference on Bioinformatics and Biomedicine Workshop",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2008/3305/4/3305d417",
"title": "Splice Site Prediction Based on Characteristic of Sequential Motifs and C4.5 Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2008/3305d417/12OmNzCWG5I",
"parentPublication": {
"id": "proceedings/fskd/2008/3305/4",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wism/2009/3817/0/3817a163",
"title": "Study on Constructing Generalized Decision Tree by Using DNA Coding Genetic Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/wism/2009/3817a163/12OmNzdoN7o",
"parentPublication": {
"id": "proceedings/wism/2009/3817/0",
"title": "Web Information Systems and Mining, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2009/3736/6/3736f082",
"title": "Predicting Splice Site by Improved Bayesian Classifier",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2009/3736f082/12OmNzlUKHd",
"parentPublication": {
"id": "proceedings/icnc/2009/3736/6",
"title": "2009 Fifth International Conference on Natural Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2012/06/ttb2012061766",
"title": "Sequence-Based Prediction of DNA-Binding Residues in Proteins with Conservation and Correlation Information",
"doi": null,
"abstractUrl": "/journal/tb/2012/06/ttb2012061766/13rRUxN5eC6",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttb2012051379",
"articleId": "13rRUypp56d",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttb2012051399",
"articleId": "13rRUyft7Bz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgPu",
"name": "ttb2012051387s.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttb2012051387s.pdf",
"extension": "pdf",
"size": "463 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45Wc1ILK",
"doi": "10.1109/TVCG.2018.2865044",
"abstract": "Neural sequence-to-sequence models have proven to be accurate and robust for many sequence prediction tasks, and have become the standard approach for automatic translation of text. The models work with a five-stage blackbox pipeline that begins with encoding a source sequence to a vector space and then decoding out to a new target sequence. This process is now standard, but like many deep learning methods remains quite difficult to understand or debug. In this work, we present a visual analysis tool that allows interaction and “what if”-style exploration of trained sequence-to-sequence models through each stage of the translation process. The aim is to identify which patterns have been learned, to detect model errors, and to probe the model with counterfactual scenario. We demonstrate the utility of our tool through several real-world sequence-to-sequence use cases on large-scale models.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Neural sequence-to-sequence models have proven to be accurate and robust for many sequence prediction tasks, and have become the standard approach for automatic translation of text. The models work with a five-stage blackbox pipeline that begins with encoding a source sequence to a vector space and then decoding out to a new target sequence. This process is now standard, but like many deep learning methods remains quite difficult to understand or debug. In this work, we present a visual analysis tool that allows interaction and “what if”-style exploration of trained sequence-to-sequence models through each stage of the translation process. The aim is to identify which patterns have been learned, to detect model errors, and to probe the model with counterfactual scenario. We demonstrate the utility of our tool through several real-world sequence-to-sequence use cases on large-scale models.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Neural sequence-to-sequence models have proven to be accurate and robust for many sequence prediction tasks, and have become the standard approach for automatic translation of text. The models work with a five-stage blackbox pipeline that begins with encoding a source sequence to a vector space and then decoding out to a new target sequence. This process is now standard, but like many deep learning methods remains quite difficult to understand or debug. In this work, we present a visual analysis tool that allows interaction and “what if”-style exploration of trained sequence-to-sequence models through each stage of the translation process. The aim is to identify which patterns have been learned, to detect model errors, and to probe the model with counterfactual scenario. We demonstrate the utility of our tool through several real-world sequence-to-sequence use cases on large-scale models.",
"title": "S<sc>eq</sc>2s<sc>eq</sc>-V<sc>is</sc>: A Visual Debugging Tool for Sequence-to-Sequence Models",
"normalizedTitle": "Seq2seq-Vis: A Visual Debugging Tool for Sequence-to-Sequence Models",
"fno": "08494828",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Learning Artificial Intelligence",
"Neural Nets",
"Program Debugging",
"Sequences",
"Seq 2 Seq Vis",
"Source Sequence",
"Target Sequence",
"Visual Debugging Tool",
"Neural Sequence To Sequence Models",
"Blackbox Pipeline",
"Vector Space",
"Deep Learning Methods",
"Visual Analysis Tool",
"Analytical Models",
"Visualization",
"Tools",
"Predictive Models",
"Machine Learning",
"Data Models",
"Atmosphere",
"Explainable AI",
"Visual Debugging",
"Visual Analytics",
"Machine Learning",
"Deep Learning",
"NLP"
],
"authors": [
{
"givenName": "Hendrik",
"surname": "Strobelt",
"fullName": "Hendrik Strobelt",
"affiliation": "IBM ReseatchMIT-IBM Watson AI Lab.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sebastian",
"surname": "Gehrmann",
"fullName": "Sebastian Gehrmann",
"affiliation": "Harvard NLP group",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Behrisch",
"fullName": "Michael Behrisch",
"affiliation": "Hatvatd Visual Computing group",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Adam",
"surname": "Perer",
"fullName": "Adam Perer",
"affiliation": "IBM ReseatchMIT-IBM Watson AI Lab.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanspeter",
"surname": "Pfister",
"fullName": "Hanspeter Pfister",
"affiliation": "Hatvatd Visual Computing group",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alexander M.",
"surname": "Rush",
"fullName": "Alexander M. Rush",
"affiliation": "Harvard NLP group",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "353-363",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bigcomp/2018/3649/0/364901a775",
"title": "A Clustering Based Adaptive Sequence-to-Sequence Model for Dialogue Systems",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2018/364901a775/12OmNvStcuR",
"parentPublication": {
"id": "proceedings/bigcomp/2018/3649/0",
"title": "2018 IEEE International Conference on Big Data and Smart Computing (BigComp)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08022871",
"title": "A<sc>cti</sc>V<sc>is</sc>: Visual Exploration of Industry-Scale Deep Neural Network Models",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08022871/13rRUyogGAh",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2023/02/09827583",
"title": "Explaining Black Box Drug Target Prediction Through Model Agnostic Counterfactual Samples",
"doi": null,
"abstractUrl": "/journal/tb/2023/02/09827583/1EWSqX96zF6",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-seip/2022/9590/0/959000a125",
"title": "Counterfactual Explanations for Models of Code",
"doi": null,
"abstractUrl": "/proceedings-article/icse-seip/2022/959000a125/1EhsbBawG2s",
"parentPublication": {
"id": "proceedings/icse-seip/2022/9590/0",
"title": "2022 IEEE/ACM 44th International Conference on Software Engineering: Software Engineering in Practice (ICSE-SEIP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciot/2019/2714/0/271400a108",
"title": "Forecasting Building Energy Consumption with Deep Learning: A Sequence to Sequence Approach",
"doi": null,
"abstractUrl": "/proceedings-article/iciot/2019/271400a108/1cTJhjBiWZO",
"parentPublication": {
"id": "proceedings/iciot/2019/2714/0",
"title": "2019 IEEE International Congress on Internet of Things (ICIOT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2019/5686/0/568600a296",
"title": "Translation of Sign Language Glosses to Text Using Sequence-to-Sequence Attention Models",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2019/568600a296/1j9xAXNumTm",
"parentPublication": {
"id": "proceedings/sitis/2019/5686/0",
"title": "2019 15th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09229232",
"title": "DECE: Decision Explorer with Counterfactual Explanations for Machine Learning Models",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09229232/1o3nAe6qces",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icfhr/2020/9966/0/996600a205",
"title": "Handwritten Historical Music Recognition by Sequence-to-Sequence with Attention Mechanism",
"doi": null,
"abstractUrl": "/proceedings-article/icfhr/2020/996600a205/1p2VwGCSNKE",
"parentPublication": {
"id": "proceedings/icfhr/2020/9966/0",
"title": "2020 17th International Conference on Frontiers in Handwriting Recognition (ICFHR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2021/08/09351648",
"title": "<sc>Silhouette</sc>: Efficient Cloud Configuration Exploration for Large-Scale Analytics",
"doi": null,
"abstractUrl": "/journal/td/2021/08/09351648/1r51c7Zx6uY",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900m2141",
"title": "Hierarchical Video Prediction using Relational Layouts for Human-Object Interactions",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900m2141/1yeLaX6KclG",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440085",
"articleId": "17D45WaTkjk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440091",
"articleId": "17D45WHONhM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i3JS7mY5OM",
"name": "ttg201901-08494828s1.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08494828s1.mov",
"extension": "mov",
"size": "167 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzV70s0",
"title": "May",
"year": "2015",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "21",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0xPn0",
"doi": "10.1109/TVCG.2014.2388208",
"abstract": "We present ThemeDelta, a visual analytics system for extracting and visualizing temporal trends, clustering, and reorganization in time-indexed textual datasets. ThemeDelta is supported by a dynamic temporal segmentation algorithm that integrates with topic modeling algorithms to identify change points where significant shifts in topics occur. This algorithm detects not only the clustering and associations of keywords in a time period, but also their convergence into topics (groups of keywords) that may later diverge into new groups. The visual representation of ThemeDelta uses sinuous, variable-width lines to show this evolution on a timeline, utilizing color for categories, and line width for keyword strength. We demonstrate how interaction with ThemeDelta helps capture the rise and fall of topics by analyzing archives of historical newspapers, of U.S. presidential campaign speeches, and of social messages collected through iNeighbors, a web-based social website. ThemeDelta is evaluated using a qualitative expert user study involving three researchers from rhetoric and history using the historical newspapers corpus.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present ThemeDelta, a visual analytics system for extracting and visualizing temporal trends, clustering, and reorganization in time-indexed textual datasets. ThemeDelta is supported by a dynamic temporal segmentation algorithm that integrates with topic modeling algorithms to identify change points where significant shifts in topics occur. This algorithm detects not only the clustering and associations of keywords in a time period, but also their convergence into topics (groups of keywords) that may later diverge into new groups. The visual representation of ThemeDelta uses sinuous, variable-width lines to show this evolution on a timeline, utilizing color for categories, and line width for keyword strength. We demonstrate how interaction with ThemeDelta helps capture the rise and fall of topics by analyzing archives of historical newspapers, of U.S. presidential campaign speeches, and of social messages collected through iNeighbors, a web-based social website. ThemeDelta is evaluated using a qualitative expert user study involving three researchers from rhetoric and history using the historical newspapers corpus.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present ThemeDelta, a visual analytics system for extracting and visualizing temporal trends, clustering, and reorganization in time-indexed textual datasets. ThemeDelta is supported by a dynamic temporal segmentation algorithm that integrates with topic modeling algorithms to identify change points where significant shifts in topics occur. This algorithm detects not only the clustering and associations of keywords in a time period, but also their convergence into topics (groups of keywords) that may later diverge into new groups. The visual representation of ThemeDelta uses sinuous, variable-width lines to show this evolution on a timeline, utilizing color for categories, and line width for keyword strength. We demonstrate how interaction with ThemeDelta helps capture the rise and fall of topics by analyzing archives of historical newspapers, of U.S. presidential campaign speeches, and of social messages collected through iNeighbors, a web-based social website. ThemeDelta is evaluated using a qualitative expert user study involving three researchers from rhetoric and history using the historical newspapers corpus.",
"title": "ThemeDelta: Dynamic Segmentations over Temporal Topic Models",
"normalizedTitle": "ThemeDelta: Dynamic Segmentations over Temporal Topic Models",
"fno": "07001093",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Market Research",
"Data Visualization",
"Tag Clouds",
"Layout",
"Visual Analytics",
"Heuristic Algorithms",
"Visual Representations",
"Language Models",
"Time Series Segmentation",
"Text Analytics",
"Visual Representations",
"Language Models",
"Time Series Segmentation",
"Text Analytics"
],
"authors": [
{
"givenName": "Samah",
"surname": "Gad",
"fullName": "Samah Gad",
"affiliation": "Virginia Tech, Blacksburg, VA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Waqas",
"surname": "Javed",
"fullName": "Waqas Javed",
"affiliation": "General Electric, San Ramon, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sohaib",
"surname": "Ghani",
"fullName": "Sohaib Ghani",
"affiliation": "KACST GIS Technology Innovation Center, Umm Al-Qura University, Makkah, Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Niklas",
"surname": "Elmqvist",
"fullName": "Niklas Elmqvist",
"affiliation": ", University of Maryland, College Park, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tom",
"surname": "Ewing",
"fullName": "Tom Ewing",
"affiliation": "Virginia Tech, Blacksburg, VA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Keith N.",
"surname": "Hampton",
"fullName": "Keith N. Hampton",
"affiliation": ", Rutgers University, New Brunswick, NJ, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Naren",
"surname": "Ramakrishnan",
"fullName": "Naren Ramakrishnan",
"affiliation": "Virginia Tech, Blacksburg, VA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2015-05-01 00:00:00",
"pubType": "trans",
"pages": "672-685",
"year": "2015",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wi-iat/2015/9618/3/9618c251",
"title": "NewsOpinionSummarizer: A Visualization and Predictive System for Opinion Pieces in Online News",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2015/9618c251/12OmNAoUToZ",
"parentPublication": {
"id": "proceedings/wi-iat/2015/9618/3",
"title": "2015 IEEE / WIC / ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2014/7100/0/07073215",
"title": "Hyper rectangular trend analysis application to Islamic rulings (fatwas)",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2014/07073215/12OmNqJq4va",
"parentPublication": {
"id": "proceedings/aiccsa/2014/7100/0",
"title": "2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdata-congress/2015/7278/0/07207297",
"title": "Supporting Data Driven Access through Automatic Keyword Extraction and Summarization",
"doi": null,
"abstractUrl": "/proceedings-article/bigdata-congress/2015/07207297/12OmNwlqhJy",
"parentPublication": {
"id": "proceedings/bigdata-congress/2015/7278/0",
"title": "2015 IEEE International Congress on Big Data (BigData Congress)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icrtccm/2017/4799/0/4799a306",
"title": "Generation of Word Clouds Using Document Topic Models",
"doi": null,
"abstractUrl": "/proceedings-article/icrtccm/2017/4799a306/12OmNy3RRFL",
"parentPublication": {
"id": "proceedings/icrtccm/2017/4799/0",
"title": "2017 Second International Conference on Recent Trends and Challenges in Computational Models (ICRTCCM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2012/4771/0/4771a013",
"title": "Three-level Visualization of Internet Discussion with Extruded Word Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2012/4771a013/12OmNyrIaxa",
"parentPublication": {
"id": "proceedings/iv/2012/4771/0",
"title": "2012 16th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2016/5661/0/07883520",
"title": "Visual analysis and coding of data-rich user behavior",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2016/07883520/12OmNzXFoyS",
"parentPublication": {
"id": "proceedings/vast/2016/5661/0",
"title": "2016 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2011/4408/0/4408a101",
"title": "SolarMap: Multifaceted Visual Analytics for Topic Exploration",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2011/4408a101/12OmNzw8j1t",
"parentPublication": {
"id": "proceedings/icdm/2011/4408/0",
"title": "2011 IEEE 11th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875992",
"title": "EvoRiver: Visual Analysis of Topic Coopetition on Social Media",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875992/13rRUxBa563",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006569",
"title": "Subject-Oriented Data Retrieval and Analysis on Sina Weibo",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006569/1hJrTuIgE6I",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlbdbi/2020/9638/0/963800a046",
"title": "Research on Chinese Movie Reviews Based on Latent Dirichlet Allocation Topic Model",
"doi": null,
"abstractUrl": "/proceedings-article/mlbdbi/2020/963800a046/1rxhzg4on7O",
"parentPublication": {
"id": "proceedings/mlbdbi/2020/9638/0",
"title": "2020 2nd International Conference on Machine Learning, Big Data and Business Intelligence (MLBDBI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06977984",
"articleId": "13rRUxASuvf",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgKL",
"name": "ttg201505-07001093s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201505-07001093s1.zip",
"extension": "zip",
"size": "30.4 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1As7ypQiOI0",
"title": "Jan.-Feb.",
"year": "2022",
"issueNum": "01",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "42",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1sLHcc8of04",
"doi": "10.1109/MCG.2021.3070303",
"abstract": "We present BitConduite, a visual analytics approach for explorative analysis of financial activity within the Bitcoin network, offering a view on transactions aggregated by entities, i.e., by individuals, companies, or other groups actively using Bitcoin. BitConduite makes Bitcoin data accessible to nontechnical experts through a guided workflow around entities analyzed according to several activity metrics. Analyses can be conducted at different scales, from large groups of entities down to single entities. BitConduite also enables analysts to cluster entities to identify groups of similar activities as well as to explore characteristics and temporal patterns of transactions. To assess the value of our approach, we collected feedback from domain experts.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present BitConduite, a visual analytics approach for explorative analysis of financial activity within the Bitcoin network, offering a view on transactions aggregated by entities, i.e., by individuals, companies, or other groups actively using Bitcoin. BitConduite makes Bitcoin data accessible to nontechnical experts through a guided workflow around entities analyzed according to several activity metrics. Analyses can be conducted at different scales, from large groups of entities down to single entities. BitConduite also enables analysts to cluster entities to identify groups of similar activities as well as to explore characteristics and temporal patterns of transactions. To assess the value of our approach, we collected feedback from domain experts.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present BitConduite, a visual analytics approach for explorative analysis of financial activity within the Bitcoin network, offering a view on transactions aggregated by entities, i.e., by individuals, companies, or other groups actively using Bitcoin. BitConduite makes Bitcoin data accessible to nontechnical experts through a guided workflow around entities analyzed according to several activity metrics. Analyses can be conducted at different scales, from large groups of entities down to single entities. BitConduite also enables analysts to cluster entities to identify groups of similar activities as well as to explore characteristics and temporal patterns of transactions. To assess the value of our approach, we collected feedback from domain experts.",
"title": "BitConduite: Exploratory Visual Analysis of Entity Activity on the Bitcoin Network",
"normalizedTitle": "BitConduite: Exploratory Visual Analysis of Entity Activity on the Bitcoin Network",
"fno": "09403400",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Cryptocurrencies",
"Data Analysis",
"Data Visualisation",
"Financial Data Processing",
"Pattern Clustering",
"Bit Conduite",
"Bitcoin Network",
"Visual Analytics Approach",
"Bitcoin Data",
"Financial Activity Metrics",
"Guided Workflow",
"Entity Clustering",
"Entity Activity Analysis",
"Portable Document Format",
"Visual Analytics",
"Bitcon",
"Class",
"IEE Etran",
"L A T E X",
"Paper",
"Style",
"Template",
"Typesetting"
],
"authors": [
{
"givenName": "Christoph",
"surname": "Kinkeldey",
"fullName": "Christoph Kinkeldey",
"affiliation": "Inria, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jean-Daniel",
"surname": "Fekete",
"fullName": "Jean-Daniel Fekete",
"affiliation": "University Paris-Saclay, CNRS, Inria, & LISN, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tanja",
"surname": "Blascheck",
"fullName": "Tanja Blascheck",
"affiliation": "Inria, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Petra",
"surname": "Isenberg",
"fullName": "Petra Isenberg",
"affiliation": "University Paris-Saclay, CNRS, Inria, & LISN, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "mags",
"pages": "84-94",
"year": "2022",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dsc/2018/4210/0/421001a858",
"title": "An Approach for Evaluating User Participation in Bitcoin",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2018/421001a858/12OmNrJRP1G",
"parentPublication": {
"id": "proceedings/dsc/2018/4210/0",
"title": "2018 IEEE Third International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2017/2715/0/08258365",
"title": "A first estimation of the proportion of cybercriminal entities in the bitcoin ecosystem using supervised machine learning",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08258365/17D45VsBTUN",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2018/9288/0/928800a055",
"title": "Characterizing Entities in the Bitcoin Blockchain",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2018/928800a055/18jXC7aAH2U",
"parentPublication": {
"id": "proceedings/icdmw/2018/9288/0",
"title": "2018 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2021/2427/0/242700a653",
"title": "Legal Entity Extraction using a Pointer Generator Network",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2021/242700a653/1AjSVHFR5h6",
"parentPublication": {
"id": "proceedings/icdmw/2021/2427/0",
"title": "2021 International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/blockchain/2021/1760/0/176000a388",
"title": "Diffusion: Analysis of Many-to-Many Transactions in Bitcoin",
"doi": null,
"abstractUrl": "/proceedings-article/blockchain/2021/176000a388/1Aqxu78h9UQ",
"parentPublication": {
"id": "proceedings/blockchain/2021/1760/0",
"title": "2021 IEEE International Conference on Blockchain (Blockchain)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600v1460",
"title": "V-Doc : Visual questions answers with Documents",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600v1460/1H1iekrSQ92",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/04/08984335",
"title": "PeckVis: A Visual Analytics Tool to Analyze Dominance Hierarchies in Small Groups",
"doi": null,
"abstractUrl": "/journal/tg/2020/04/08984335/1haTxOaV8eA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222068",
"title": "<italic>TaxThemis</italic>: Interactive Mining and Exploration of Suspicious Tax Evasion Groups",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222068/1nTqzVqnWU0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a336",
"title": "VaBank: Visual Analytics for Banking Transactions",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a336/1rSRewueIso",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09555925",
"title": "MiningVis: Visual Analytics of the Bitcoin Mining Economy",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09555925/1xlw1EdMc9i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09351649",
"articleId": "1r51fWoQ44o",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09351618",
"articleId": "1r51gAtoZB6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45WK5Aor",
"doi": "10.1109/TVCG.2018.2864806",
"abstract": "Atmospheric fronts play a central role in meteorology, as the boundaries between different air masses and as fundamental features of extra-tropical cyclones. They appear in numerous conceptual model depictions of extra-tropical weather systems. Conceptually, fronts are three-dimensional surfaces in space possessing an innate structural complexity, yet in meteorology, both manual and objective identification and depiction have historically focused on the structure in two dimensions. In this work, we -a team of visualization scientists and meteorologists-propose a novel visualization approach to analyze the three-dimensional structure of atmospheric fronts and related physical and dynamical processes. We build upon existing approaches to objectively identify fronts as lines in two dimensions and extend these to obtain frontal surfaces in three dimensions, using the magnitude of temperature change along the gradient of a moist potential temperature field as the primary identifying factor. We introduce the use of normal curves in the temperature gradient field to visualize a frontal zone (i.e., the transitional zone between the air masses) and the distribution of atmospheric variables in such zones. To enable for the first time a statistical analysis of frontal zones, we present a new approach to obtain the volume enclosed by a zone, by classifying grid boxes that intersect with normal curves emanating from a selected front. We introduce our method by means of an idealized numerical simulation and demonstrate its use with two real-world cases using numerical weather prediction data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Atmospheric fronts play a central role in meteorology, as the boundaries between different air masses and as fundamental features of extra-tropical cyclones. They appear in numerous conceptual model depictions of extra-tropical weather systems. Conceptually, fronts are three-dimensional surfaces in space possessing an innate structural complexity, yet in meteorology, both manual and objective identification and depiction have historically focused on the structure in two dimensions. In this work, we -a team of visualization scientists and meteorologists-propose a novel visualization approach to analyze the three-dimensional structure of atmospheric fronts and related physical and dynamical processes. We build upon existing approaches to objectively identify fronts as lines in two dimensions and extend these to obtain frontal surfaces in three dimensions, using the magnitude of temperature change along the gradient of a moist potential temperature field as the primary identifying factor. We introduce the use of normal curves in the temperature gradient field to visualize a frontal zone (i.e., the transitional zone between the air masses) and the distribution of atmospheric variables in such zones. To enable for the first time a statistical analysis of frontal zones, we present a new approach to obtain the volume enclosed by a zone, by classifying grid boxes that intersect with normal curves emanating from a selected front. We introduce our method by means of an idealized numerical simulation and demonstrate its use with two real-world cases using numerical weather prediction data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Atmospheric fronts play a central role in meteorology, as the boundaries between different air masses and as fundamental features of extra-tropical cyclones. They appear in numerous conceptual model depictions of extra-tropical weather systems. Conceptually, fronts are three-dimensional surfaces in space possessing an innate structural complexity, yet in meteorology, both manual and objective identification and depiction have historically focused on the structure in two dimensions. In this work, we -a team of visualization scientists and meteorologists-propose a novel visualization approach to analyze the three-dimensional structure of atmospheric fronts and related physical and dynamical processes. We build upon existing approaches to objectively identify fronts as lines in two dimensions and extend these to obtain frontal surfaces in three dimensions, using the magnitude of temperature change along the gradient of a moist potential temperature field as the primary identifying factor. We introduce the use of normal curves in the temperature gradient field to visualize a frontal zone (i.e., the transitional zone between the air masses) and the distribution of atmospheric variables in such zones. To enable for the first time a statistical analysis of frontal zones, we present a new approach to obtain the volume enclosed by a zone, by classifying grid boxes that intersect with normal curves emanating from a selected front. We introduce our method by means of an idealized numerical simulation and demonstrate its use with two real-world cases using numerical weather prediction data.",
"title": "Interactive 3D Visual Analysis of Atmospheric Fronts",
"normalizedTitle": "Interactive 3D Visual Analysis of Atmospheric Fronts",
"fno": "08440076",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Atmospheric Movements",
"Atmospheric Techniques",
"Atmospheric Temperature",
"Data Visualisation",
"Meteorology",
"Numerical Analysis",
"Statistical Analysis",
"Storms",
"Weather Forecasting",
"Wind",
"Moist Potential Temperature Field",
"Temperature Gradient Field",
"Frontal Zone",
"Atmospheric Variables",
"Interactive 3 D Visual Analysis",
"Atmospheric Fronts",
"Extra Tropical Cyclones",
"Extra Tropical Weather Systems",
"Three Dimensional Surfaces",
"Innate Structural Complexity",
"Objective Identification",
"Visualization Scientists",
"Meteorologists",
"Novel Visualization Approach",
"Three Dimensional Structure",
"Frontal Surfaces",
"Air Masses",
"Three Dimensional Displays",
"Visualization",
"Weather Forecasting",
"Cyclones",
"Ocean Temperature",
"Two Dimensional Displays",
"Meteorology",
"Atmospheric Fronts",
"Feature Detection"
],
"authors": [
{
"givenName": "Michael",
"surname": "Kern",
"fullName": "Michael Kern",
"affiliation": "Computer Graphics & Visualization Group, Technische Universität München, Garching, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tim",
"surname": "Hewson",
"fullName": "Tim Hewson",
"affiliation": "European Centre for Medium-Range Weather Forecasts, Reading, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andreas",
"surname": "Schätler",
"fullName": "Andreas Schätler",
"affiliation": "Deutsches Zentrum für Luft- und Raumfahrt (DLR), Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rüdiger",
"surname": "Westermann",
"fullName": "Rüdiger Westermann",
"affiliation": "Computer Graphics & Visualization Group, Technische Universität München, Garching, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marc",
"surname": "Rautenhaus",
"fullName": "Marc Rautenhaus",
"affiliation": "Computer Graphics & Visualization Group, Technische Universität München, Garching, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "1080-1090",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/aipr/2014/5921/0/07041938",
"title": "3D sparse point reconstructions of atmospheric nuclear detonations",
"doi": null,
"abstractUrl": "/proceedings-article/aipr/2014/07041938/12OmNCcbEl5",
"parentPublication": {
"id": "proceedings/aipr/2014/5921/0",
"title": "2014 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asap/2016/1503/0/07760771",
"title": "Unleashing the performance potential of CPU-GPU platforms for the 3D atmospheric Euler solver",
"doi": null,
"abstractUrl": "/proceedings-article/asap/2016/07760771/12OmNx6g6hR",
"parentPublication": {
"id": "proceedings/asap/2016/1503/0",
"title": "2016 IEEE 27th International Conference on Application-specific Systems, Architectures and Processors (ASAP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1993/3940/0/00398901",
"title": "Feature extraction for oceanographic data using a 3D edge operator",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1993/00398901/12OmNxFsmqF",
"parentPublication": {
"id": "proceedings/visual/1993/3940/0",
"title": "Proceedings Visualization '93",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2017/4822/0/07926711",
"title": "Robust 3D Patch-Based Face Hallucination",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2017/07926711/12OmNzayNBz",
"parentPublication": {
"id": "proceedings/wacv/2017/4822/0",
"title": "2017 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017585",
"title": "Robust Detection and Visualization of Jet-Stream Core Lines in Atmospheric Flow",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017585/13rRUwInvl6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539342",
"title": "Time-Hierarchical Clustering and Visualization of Weather Forecast Ensembles",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539342/13rRUxYIN4d",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1157",
"title": "An Atmospheric Visual Analysis and Exploration System",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1157/13rRUynHuj0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/2018/7308/0/08644628",
"title": "AGCM3D: A Highly Scalable Finite-Difference Dynamical Core of Atmospheric General Circulation Model Based on 3D Decomposition",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2018/08644628/17QjJcYowGl",
"parentPublication": {
"id": "proceedings/icpads/2018/7308/0",
"title": "2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805433",
"title": "Extraction and Visual Analysis of Potential Vorticity Banners around the Alps",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805433/1cG4Bp60IQU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis/2021/1893/0/09516859",
"title": "Weather Map Prediction Using RGB Metaphorical Feature Extraction for Atmospheric Pressure Patterns",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2021/09516859/1wiRAP7qmoo",
"parentPublication": {
"id": "proceedings/icis/2021/1893/0",
"title": "2021 IEEE/ACIS 19th International Conference on Computer and Information Science (ICIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440086",
"articleId": "17D45WHONqg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440052",
"articleId": "17D45XDIXW9",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i4QLyMw8P6",
"name": "ttg201901-08440076s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08440076s1.mp4",
"extension": "mp4",
"size": "91.8 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrIaebZ",
"title": "May/June",
"year": "1991",
"issueNum": "03",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "11",
"label": "May/June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0PqrK",
"doi": "10.1109/38.79452",
"abstract": "Methods for automating the analysis and display of vector field topology in general, and flow topology in particular, are described. By using techniques to extract and visualize topological information, it is possible to combine the simplicity of schematic depictions with the quantitative accuracy of curves and surfaces computed directly from the data. Two-dimensional vector field topology is discussed, covering critical points and time-dependent flows, to provide a basis for the examination of topology in three-dimensional separated flows. Surface topology and separation structures in three-dimensional flows are then addressed. The construction of representations of tangent surfaces that are accurate, as well as efficient to compute and display, is examined, covering tessellation, clipping, and refinement. Locating, characterizing, and displaying three-dimensional critical points are considered.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Methods for automating the analysis and display of vector field topology in general, and flow topology in particular, are described. By using techniques to extract and visualize topological information, it is possible to combine the simplicity of schematic depictions with the quantitative accuracy of curves and surfaces computed directly from the data. Two-dimensional vector field topology is discussed, covering critical points and time-dependent flows, to provide a basis for the examination of topology in three-dimensional separated flows. Surface topology and separation structures in three-dimensional flows are then addressed. The construction of representations of tangent surfaces that are accurate, as well as efficient to compute and display, is examined, covering tessellation, clipping, and refinement. Locating, characterizing, and displaying three-dimensional critical points are considered.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Methods for automating the analysis and display of vector field topology in general, and flow topology in particular, are described. By using techniques to extract and visualize topological information, it is possible to combine the simplicity of schematic depictions with the quantitative accuracy of curves and surfaces computed directly from the data. Two-dimensional vector field topology is discussed, covering critical points and time-dependent flows, to provide a basis for the examination of topology in three-dimensional separated flows. Surface topology and separation structures in three-dimensional flows are then addressed. The construction of representations of tangent surfaces that are accurate, as well as efficient to compute and display, is examined, covering tessellation, clipping, and refinement. Locating, characterizing, and displaying three-dimensional critical points are considered.",
"title": "Visualizing Vector Field Topology in Fluid Flows",
"normalizedTitle": "Visualizing Vector Field Topology in Fluid Flows",
"fno": "mcg1991030036",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [],
"authors": [
{
"givenName": "James L.",
"surname": "Helman",
"fullName": "James L. Helman",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lambertus",
"surname": "Hesselink",
"fullName": "Lambertus Hesselink",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "1991-05-01 00:00:00",
"pubType": "mags",
"pages": "36-46",
"year": "1991",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "mcg1991030028",
"articleId": "13rRUIJcWfR",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg1991030056",
"articleId": "13rRUB6Sq2I",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45WXIkH8",
"doi": "10.1109/TVCG.2018.2864828",
"abstract": "Vortices are one of the most-frequently studied phenomena in fluid flows. The center of the rotating motion is called the vortex coreline and its successful detection strongly depends on the choice of the reference frame. The optimal frame moves with the center of the vortex, which incidentally makes the observed fluid flow steady and thus standard vortex coreline extractors such as Sujudi-Haimes become applicable. Recently, an objective optimization framework was proposed that determines a near-steady reference frame for tracer particles. In this paper, we extend this technique to the detection of vortex corelines of inertial particles. An inertial particle is a finite-sized object that is carried by a fluid flow. In contrast to the usual tracer particles, they do not move tangentially with the flow, since they are subject to gravity and exhibit mass-dependent inertia. Their particle state is determined by their position and own velocity, which makes the search for the optimal frame a high-dimensional problem. We demonstrate in this paper that the objective detection of an inertial vortex coreline can be reduced in 2D to a critical point search in 2D. For 3D flows, however, the vortex coreline criterion remains a parallel vectors condition in 6D. To detect the vortex corelines we propose a recursive subdivision approach that is tailored to the underlying structure of the 6D vectors. The resulting algorithm is objective, and we demonstrate the vortex coreline extraction in a number of 2D and 3D vector fields.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Vortices are one of the most-frequently studied phenomena in fluid flows. The center of the rotating motion is called the vortex coreline and its successful detection strongly depends on the choice of the reference frame. The optimal frame moves with the center of the vortex, which incidentally makes the observed fluid flow steady and thus standard vortex coreline extractors such as Sujudi-Haimes become applicable. Recently, an objective optimization framework was proposed that determines a near-steady reference frame for tracer particles. In this paper, we extend this technique to the detection of vortex corelines of inertial particles. An inertial particle is a finite-sized object that is carried by a fluid flow. In contrast to the usual tracer particles, they do not move tangentially with the flow, since they are subject to gravity and exhibit mass-dependent inertia. Their particle state is determined by their position and own velocity, which makes the search for the optimal frame a high-dimensional problem. We demonstrate in this paper that the objective detection of an inertial vortex coreline can be reduced in 2D to a critical point search in 2D. For 3D flows, however, the vortex coreline criterion remains a parallel vectors condition in 6D. To detect the vortex corelines we propose a recursive subdivision approach that is tailored to the underlying structure of the 6D vectors. The resulting algorithm is objective, and we demonstrate the vortex coreline extraction in a number of 2D and 3D vector fields.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Vortices are one of the most-frequently studied phenomena in fluid flows. The center of the rotating motion is called the vortex coreline and its successful detection strongly depends on the choice of the reference frame. The optimal frame moves with the center of the vortex, which incidentally makes the observed fluid flow steady and thus standard vortex coreline extractors such as Sujudi-Haimes become applicable. Recently, an objective optimization framework was proposed that determines a near-steady reference frame for tracer particles. In this paper, we extend this technique to the detection of vortex corelines of inertial particles. An inertial particle is a finite-sized object that is carried by a fluid flow. In contrast to the usual tracer particles, they do not move tangentially with the flow, since they are subject to gravity and exhibit mass-dependent inertia. Their particle state is determined by their position and own velocity, which makes the search for the optimal frame a high-dimensional problem. We demonstrate in this paper that the objective detection of an inertial vortex coreline can be reduced in 2D to a critical point search in 2D. For 3D flows, however, the vortex coreline criterion remains a parallel vectors condition in 6D. To detect the vortex corelines we propose a recursive subdivision approach that is tailored to the underlying structure of the 6D vectors. The resulting algorithm is objective, and we demonstrate the vortex coreline extraction in a number of 2D and 3D vector fields.",
"title": "Objective Vortex Corelines of Finite-sized Objects in Fluid Flows",
"normalizedTitle": "Objective Vortex Corelines of Finite-sized Objects in Fluid Flows",
"fno": "08440096",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Fluid Dynamics",
"Flow Instability",
"Vortices",
"Objective Vortex Corelines",
"Optimal Frame Moves",
"Observed Fluid Flow",
"Inertial Particle",
"Particle State",
"Objective Detection",
"Inertial Vortex Coreline",
"Vortex Coreline Criterion",
"Vortex Coreline Extraction",
"Vortex Coreline Extractors",
"Three Dimensional Displays",
"Visualization",
"Two Dimensional Displays",
"Atmospheric Measurements",
"Particle Measurements",
"Tensile Stress",
"Feature Extraction",
"Vortex Extraction",
"Inertial Particles",
"Objectivity",
"Vortex Coreline"
],
"authors": [
{
"givenName": "Tobias",
"surname": "Günther",
"fullName": "Tobias Günther",
"affiliation": "Computer Graphics LaboratoryETH Zürich",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Holger",
"surname": "Theisel",
"fullName": "Holger Theisel",
"affiliation": "Visual Computing GroupUniversity of Magdeburg",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "956-966",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/csit/2017/2830/0/08312158",
"title": "Direct computational experiments in fluid mechanics using three-dimensional tensor mathematics",
"doi": null,
"abstractUrl": "/proceedings-article/csit/2017/08312158/12OmNB9KHth",
"parentPublication": {
"id": "proceedings/csit/2017/2830/0",
"title": "2017 Computer Science and Information Technologies (CSIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2015/6879/0/07156381",
"title": "An uncertainty-driven approach to vortex analysis using oracle consensus and spatial proximity",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156381/12OmNBtUdJY",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cdc/2000/6638/2/00912110",
"title": "Vortex models for the control of flows",
"doi": null,
"abstractUrl": "/proceedings-article/cdc/2000/00912110/12OmNxaNGj6",
"parentPublication": {
"id": "proceedings/cdc/2000/6638/4",
"title": "Proceedings of the 39th IEEE Conference on Decision and Control",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875993",
"title": "Vortex Cores of Inertial Particles",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875993/13rRUwbJD4L",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/02/ttg2014020303",
"title": "Vortical Inviscid Flows with Two-Way Solid-Fluid Coupling",
"doi": null,
"abstractUrl": "/journal/tg/2014/02/ttg2014020303/13rRUxAATgx",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539598",
"title": "Backward Finite-Time Lyapunov Exponents in Inertial Flows",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539598/13rRUxC0SOY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/03/08454764",
"title": "Hyper-Objective Vortices",
"doi": null,
"abstractUrl": "/journal/tg/2020/03/08454764/13rRUyeTVia",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/10015628",
"title": "Full-Volume 3D Fluid Flow Reconstruction With Light Field PIV",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/10015628/1JR6d0EQ2o8",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805446",
"title": "Vector Field Topology of Time-Dependent Flows in a Steady Reference Frame",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805446/1cG4GkzNRPG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222512",
"title": "Objective Observer-Relative Flow Visualization in Curved Spaces for Unsteady 2D Geophysical Flows",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222512/1nTq2foekVO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440089",
"articleId": "17D45Vw15xs",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08494830",
"articleId": "17D45XeKgwi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i4QTIBZwVa",
"name": "ttg201901-08440096s2.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08440096s2.mp4",
"extension": "mp4",
"size": "150 MB",
"__typename": "WebExtraType"
},
{
"id": "1i4QwsmYqvm",
"name": "ttg201901-08440096s1.txt",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08440096s1.txt",
"extension": "txt",
"size": "8.62 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRo",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1HcjhcNOxUI",
"doi": "10.1109/TVCG.2022.3211781",
"abstract": "Locating neck-like features, or locally narrow parts, of a surface is crucial in various applications such as segmentation, shape analysis, path planning, and robotics. Topological methods are often utilized to find the set of shortest loops around handles and tunnels. However, there are abundant neck-like features on genus-0 shapes without any handles. While 3D geometry-aware topological approaches exist to find neck loops, their construction can be cumbersome and may even lead to geometrically wide loops. Thus we propose a “topology-aware geometric approach” to compute the tightest loops around neck features on surfaces, including genus-0 surfaces. Our algorithm starts with a volumetric representation of an input surface and then calculates the distance function of mesh points to the boundary surface as a Morse function. All neck features induce critical points of this Morse function where the Hessian matrix has precisely one positive eigenvalue, i.e., type-2 saddles. As we focus on geometric neck features, we bypass a topological construction such as the Morse-Smale complex or a lower-star filtration. Instead, we directly create a cutting plane through each neck feature. Each resulting loop can then be tightened to form a closed geodesic representation of the neck feature. Moreover, we offer criteria to measure the significance of a neck feature through the evolution of critical points when smoothing the distance function. Furthermore, we speed up the detection process through mesh simplification without compromising the quality of the output loops.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Locating neck-like features, or locally narrow parts, of a surface is crucial in various applications such as segmentation, shape analysis, path planning, and robotics. Topological methods are often utilized to find the set of shortest loops around handles and tunnels. However, there are abundant neck-like features on genus-0 shapes without any handles. While 3D geometry-aware topological approaches exist to find neck loops, their construction can be cumbersome and may even lead to geometrically wide loops. Thus we propose a “topology-aware geometric approach” to compute the tightest loops around neck features on surfaces, including genus-0 surfaces. Our algorithm starts with a volumetric representation of an input surface and then calculates the distance function of mesh points to the boundary surface as a Morse function. All neck features induce critical points of this Morse function where the Hessian matrix has precisely one positive eigenvalue, i.e., type-2 saddles. As we focus on geometric neck features, we bypass a topological construction such as the Morse-Smale complex or a lower-star filtration. Instead, we directly create a cutting plane through each neck feature. Each resulting loop can then be tightened to form a closed geodesic representation of the neck feature. Moreover, we offer criteria to measure the significance of a neck feature through the evolution of critical points when smoothing the distance function. Furthermore, we speed up the detection process through mesh simplification without compromising the quality of the output loops.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Locating neck-like features, or locally narrow parts, of a surface is crucial in various applications such as segmentation, shape analysis, path planning, and robotics. Topological methods are often utilized to find the set of shortest loops around handles and tunnels. However, there are abundant neck-like features on genus-0 shapes without any handles. While 3D geometry-aware topological approaches exist to find neck loops, their construction can be cumbersome and may even lead to geometrically wide loops. Thus we propose a “topology-aware geometric approach” to compute the tightest loops around neck features on surfaces, including genus-0 surfaces. Our algorithm starts with a volumetric representation of an input surface and then calculates the distance function of mesh points to the boundary surface as a Morse function. All neck features induce critical points of this Morse function where the Hessian matrix has precisely one positive eigenvalue, i.e., type-2 saddles. As we focus on geometric neck features, we bypass a topological construction such as the Morse-Smale complex or a lower-star filtration. Instead, we directly create a cutting plane through each neck feature. Each resulting loop can then be tightened to form a closed geodesic representation of the neck feature. Moreover, we offer criteria to measure the significance of a neck feature through the evolution of critical points when smoothing the distance function. Furthermore, we speed up the detection process through mesh simplification without compromising the quality of the output loops.",
"title": "Fast Computation of Neck-like Features",
"normalizedTitle": "Fast Computation of Neck-like Features",
"fno": "09910018",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Neck",
"Shape",
"Laplace Equations",
"Filtration",
"Three Dimensional Displays",
"Smoothing Methods",
"Computational Modeling",
"Computer Graphics",
"Computational Geometry",
"And Object Modeling",
"Curve",
"Surface",
"Object Representations"
],
"authors": [
{
"givenName": "Hayam",
"surname": "Abdelrahman",
"fullName": "Hayam Abdelrahman",
"affiliation": "Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yiying",
"surname": "Tong",
"fullName": "Yiying Tong",
"affiliation": "Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-10-01 00:00:00",
"pubType": "trans",
"pages": "1-10",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/itme/2016/3906/0/3906a333",
"title": "The Features of Lymph Node Metastasis of Differentiated Thyroid Carcinoma and the Choice of Lateral Neck Lymph Nodes Dissection",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2016/3906a333/12OmNBO3K3F",
"parentPublication": {
"id": "proceedings/itme/2016/3906/0",
"title": "2016 8th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a049",
"title": "2D Vector Field Simplification Based on Robustness",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a049/12OmNwpoFGP",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2014/5118/0/5118c957",
"title": "Robust 3D Features for Matching between Distorted Range Scans Captured by Moving Systems",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118c957/12OmNy5hRg0",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/08/ttg2013081298",
"title": "Choking Loops on Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2013/08/ttg2013081298/13rRUNvyakN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/08/07117431",
"title": "Robustness-Based Simplification of 2D Steady and Unsteady Vector Fields",
"doi": null,
"abstractUrl": "/journal/tg/2015/08/07117431/13rRUwhHcJl",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/06/07018984",
"title": "Fast Edge-Aware Processing via First Order Proximal Approximation",
"doi": null,
"abstractUrl": "/journal/tg/2015/06/07018984/13rRUxAASTe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2020/01/08509134",
"title": "Efficient Inter-Geodesic Distance Computation and Fast Classical Scaling",
"doi": null,
"abstractUrl": "/journal/tp/2020/01/08509134/14Fq0W8dzaM",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/04/08540419",
"title": "Spectral Mesh Segmentation via <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _0$_Z</tex-math></inline-formula> Gradient Minimization",
"doi": null,
"abstractUrl": "/journal/tg/2020/04/08540419/17D45XoXP4p",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cyberc/2019/2542/0/254200a245",
"title": "A Method for Extracting Topological Features of Internet Testbeds Oriented to Equivalent Deduction",
"doi": null,
"abstractUrl": "/proceedings-article/cyberc/2019/254200a245/1gjRZ4ev0wo",
"parentPublication": {
"id": "proceedings/cyberc/2019/2542/0",
"title": "2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2021/9184/0/918400b691",
"title": "Fast Similarity Computation for t-SNE",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2021/918400b691/1uGXpqMZXag",
"parentPublication": {
"id": "proceedings/icde/2021/9184/0",
"title": "2021 IEEE 37th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09909994",
"articleId": "1Hcj8wIB6s8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09911682",
"articleId": "1HeiWQWKlTG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Hmgb4Bb3Ec",
"name": "ttg555501-09910018s1-tvcg-3211781-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09910018s1-tvcg-3211781-mm.zip",
"extension": "zip",
"size": "13.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCd2rtX",
"title": "Dec.",
"year": "2016",
"issueNum": "04",
"idPrefix": "bd",
"pubType": "journal",
"volume": "2",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxNmPFQ",
"doi": "10.1109/TBDATA.2016.2616148",
"abstract": "In a distributed stream data processing system, an application is usually modeled using a directed graph, in which each vertex corresponds to a data source or a processing unit, and edges indicate data flow. In this paper, we propose a novel predictive scheduling framework to enable fast and distributed stream data processing, which features topology-aware modeling for performance prediction and predictive scheduling. For prediction, we present a topology-aware method to accurately predict the average tuple processing time of an application for a given scheduling solution, according to the topology of the application graph and runtime statistics. For scheduling, we present an effective algorithm to assign threads to machines under the guidance of prediction results. To validate and evaluate the proposed framework, we implemented it based on a highly-regarded distributed stream data processing platform, Storm, and tested it with 3 representative applications: word count (stream version), log stream processing and continuous query. Extensive experimental results show 1) The topology-aware prediction method offers an average accuracy of 84.2 percent. 2) The predictive scheduling framework reduces the average tuple processing time by 24.9 percent on average, compared to Storm's default scheduler.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In a distributed stream data processing system, an application is usually modeled using a directed graph, in which each vertex corresponds to a data source or a processing unit, and edges indicate data flow. In this paper, we propose a novel predictive scheduling framework to enable fast and distributed stream data processing, which features topology-aware modeling for performance prediction and predictive scheduling. For prediction, we present a topology-aware method to accurately predict the average tuple processing time of an application for a given scheduling solution, according to the topology of the application graph and runtime statistics. For scheduling, we present an effective algorithm to assign threads to machines under the guidance of prediction results. To validate and evaluate the proposed framework, we implemented it based on a highly-regarded distributed stream data processing platform, Storm, and tested it with 3 representative applications: word count (stream version), log stream processing and continuous query. Extensive experimental results show 1) The topology-aware prediction method offers an average accuracy of 84.2 percent. 2) The predictive scheduling framework reduces the average tuple processing time by 24.9 percent on average, compared to Storm's default scheduler.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In a distributed stream data processing system, an application is usually modeled using a directed graph, in which each vertex corresponds to a data source or a processing unit, and edges indicate data flow. In this paper, we propose a novel predictive scheduling framework to enable fast and distributed stream data processing, which features topology-aware modeling for performance prediction and predictive scheduling. For prediction, we present a topology-aware method to accurately predict the average tuple processing time of an application for a given scheduling solution, according to the topology of the application graph and runtime statistics. For scheduling, we present an effective algorithm to assign threads to machines under the guidance of prediction results. To validate and evaluate the proposed framework, we implemented it based on a highly-regarded distributed stream data processing platform, Storm, and tested it with 3 representative applications: word count (stream version), log stream processing and continuous query. Extensive experimental results show 1) The topology-aware prediction method offers an average accuracy of 84.2 percent. 2) The predictive scheduling framework reduces the average tuple processing time by 24.9 percent on average, compared to Storm's default scheduler.",
"title": "Performance Modeling and Predictive Scheduling for Distributed Stream Data Processing",
"normalizedTitle": "Performance Modeling and Predictive Scheduling for Distributed Stream Data Processing",
"fno": "07587384",
"hasPdf": true,
"idPrefix": "bd",
"keywords": [
"Data Processing",
"Storms",
"Distributed Databases",
"Predictive Models",
"Queueing Analysis",
"Topology",
"Data Models",
"Prediction",
"Distributed Stream Data Processing",
"Scheduling",
"Storm"
],
"authors": [
{
"givenName": "Teng",
"surname": "Li",
"fullName": "Teng Li",
"affiliation": "Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jian",
"surname": "Tang",
"fullName": "Jian Tang",
"affiliation": "Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jielong",
"surname": "Xu",
"fullName": "Jielong Xu",
"affiliation": "Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2016-10-01 00:00:00",
"pubType": "trans",
"pages": "353-364",
"year": "2016",
"issn": "2332-7790",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ficloud/2015/8103/0/8103a800",
"title": "Stream Processing in Community Network Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/ficloud/2015/8103a800/12OmNBdJ5ix",
"parentPublication": {
"id": "proceedings/ficloud/2015/8103/0",
"title": "2015 3rd International Conference on Future Internet of Things and Cloud (FiCloud)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2015/9926/0/07363773",
"title": "A predictive scheduling framework for fast and distributed stream data processing",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2015/07363773/12OmNqFJhJI",
"parentPublication": {
"id": "proceedings/big-data/2015/9926/0",
"title": "2015 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisis/2014/4325/0/4325a614",
"title": "Scheduling Decisions in Stream Processing on Heterogeneous Clusters",
"doi": null,
"abstractUrl": "/proceedings-article/cisis/2014/4325a614/12OmNvAiSBO",
"parentPublication": {
"id": "proceedings/cisis/2014/4325/0",
"title": "2014 Eighth International Conference on Complex, Intelligent and Software Intensive Systems (CISIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scc/2018/7250/0/725001a278",
"title": "Reducing Tail Latencies While Improving Resiliency to Timing Errors for Stream Processing Workloads",
"doi": null,
"abstractUrl": "/proceedings-article/scc/2018/725001a278/13rRUwcS1we",
"parentPublication": {
"id": "proceedings/scc/2018/7250/0",
"title": "2018 IEEE International Conference on Services Computing (SCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cloud/2018/7235/0/723501a754",
"title": "Performance Analysis of Large-Scale Distributed Stream Processing Systems on the Cloud",
"doi": null,
"abstractUrl": "/proceedings-article/cloud/2018/723501a754/13xI8B5Z816",
"parentPublication": {
"id": "proceedings/cloud/2018/7235/0",
"title": "2018 IEEE 11th International Conference on Cloud Computing (CLOUD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ucc/2018/5504/0/550400a194",
"title": "Reducing Tail Latencies while Improving Resiliency to Timing Errors for Stream Processing Workloads",
"doi": null,
"abstractUrl": "/proceedings-article/ucc/2018/550400a194/17D45WK5Arh",
"parentPublication": {
"id": "proceedings/ucc/2018/5504/0",
"title": "2018 IEEE/ACM 11th International Conference on Utility and Cloud Computing (UCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-smartcity-dss/2017/2588/0/08291931",
"title": "Model-Based Scheduling for Stream Processing Systems",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2017/08291931/17D45X2fUH1",
"parentPublication": {
"id": "proceedings/hpcc-smartcity-dss/2017/2588/0",
"title": "2017 IEEE 19th International Conference on High Performance Computing and Communications; IEEE 15th International Conference on Smart City; IEEE 3rd International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-iucc-bdcloud-socialcom-sustaincom/2018/1141/0/114100a773",
"title": "An On-the-Fly Scheduling Strategy for Distributed Stream Processing Platform",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-iucc-bdcloud-socialcom-sustaincom/2018/114100a773/18AuNU2tqla",
"parentPublication": {
"id": "proceedings/ispa-iucc-bdcloud-socialcom-sustaincom/2018/1141/0",
"title": "2018 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2019/1246/0/124600a262",
"title": "A Deep Recurrent Neural Network Based Predictive Control Framework for Reliable Distributed Stream Data Processing",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2019/124600a262/1cYhQStZv7G",
"parentPublication": {
"id": "proceedings/ipdps/2019/1246/0",
"title": "2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/cc/2022/04/09233953",
"title": "POTUS: Predictive Online Tuple Scheduling for Data Stream Processing Systems",
"doi": null,
"abstractUrl": "/journal/cc/2022/04/09233953/1o52cAS9gK4",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07723926",
"articleId": "13rRUx0xPuX",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07592411",
"articleId": "13rRUx0Pquw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1HfCsYrtcas",
"doi": "10.1109/TVCG.2022.3209377",
"abstract": "Visualization research often focuses on perceptual accuracy or helping readers interpret key messages. However, we know very little about how chart designs might influence readers' perceptions of the people behind the data. Specifically, could designs interact with readers' social cognitive biases in ways that perpetuate harmful stereotypes? For example, when analyzing social inequality, bar charts are a popular choice to present outcome disparities between race, gender, or other groups. But bar charts may encourage deficit thinking, the perception that outcome disparities are caused by groups' personal strengths or deficiencies, rather than external factors. These faulty personal attributions can then reinforce stereotypes about the groups being visualized. We conducted four experiments examining design choices that influence attribution biases (and therefore deficit thinking). Crowdworkers viewed visualizations depicting social outcomes that either mask variability in data, such as bar charts or dot plots, or emphasize variability in data, such as jitter plots or prediction intervals. They reported their agreement with both personal and external explanations for the visualized disparities. Overall, when participants saw visualizations that hide within-group variability, they agreed more with personal explanations. When they saw visualizations that emphasize within-group variability, they agreed less with personal explanations. These results demonstrate that data visualizations about social inequity can be misinterpreted in harmful ways and lead to stereotyping. Design choices can influence these biases: Hiding variability tends to increase stereotyping while emphasizing variability reduces it.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visualization research often focuses on perceptual accuracy or helping readers interpret key messages. However, we know very little about how chart designs might influence readers' perceptions of the people behind the data. Specifically, could designs interact with readers' social cognitive biases in ways that perpetuate harmful stereotypes? For example, when analyzing social inequality, bar charts are a popular choice to present outcome disparities between race, gender, or other groups. But bar charts may encourage deficit thinking, the perception that outcome disparities are caused by groups' personal strengths or deficiencies, rather than external factors. These faulty personal attributions can then reinforce stereotypes about the groups being visualized. We conducted four experiments examining design choices that influence attribution biases (and therefore deficit thinking). Crowdworkers viewed visualizations depicting social outcomes that either mask variability in data, such as bar charts or dot plots, or emphasize variability in data, such as jitter plots or prediction intervals. They reported their agreement with both personal and external explanations for the visualized disparities. Overall, when participants saw visualizations that hide within-group variability, they agreed more with personal explanations. When they saw visualizations that emphasize within-group variability, they agreed less with personal explanations. These results demonstrate that data visualizations about social inequity can be misinterpreted in harmful ways and lead to stereotyping. Design choices can influence these biases: Hiding variability tends to increase stereotyping while emphasizing variability reduces it.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visualization research often focuses on perceptual accuracy or helping readers interpret key messages. However, we know very little about how chart designs might influence readers' perceptions of the people behind the data. Specifically, could designs interact with readers' social cognitive biases in ways that perpetuate harmful stereotypes? For example, when analyzing social inequality, bar charts are a popular choice to present outcome disparities between race, gender, or other groups. But bar charts may encourage deficit thinking, the perception that outcome disparities are caused by groups' personal strengths or deficiencies, rather than external factors. These faulty personal attributions can then reinforce stereotypes about the groups being visualized. We conducted four experiments examining design choices that influence attribution biases (and therefore deficit thinking). Crowdworkers viewed visualizations depicting social outcomes that either mask variability in data, such as bar charts or dot plots, or emphasize variability in data, such as jitter plots or prediction intervals. They reported their agreement with both personal and external explanations for the visualized disparities. Overall, when participants saw visualizations that hide within-group variability, they agreed more with personal explanations. When they saw visualizations that emphasize within-group variability, they agreed less with personal explanations. These results demonstrate that data visualizations about social inequity can be misinterpreted in harmful ways and lead to stereotyping. Design choices can influence these biases: Hiding variability tends to increase stereotyping while emphasizing variability reduces it.",
"title": "Dispersion vs Disparity: Hiding Variability Can Encourage Stereotyping When Visualizing Social Outcomes",
"normalizedTitle": "Dispersion vs Disparity: Hiding Variability Can Encourage Stereotyping When Visualizing Social Outcomes",
"fno": "09913065",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Human Factors",
"Visual Perception",
"Attribution Biases",
"Bar Charts",
"Crowdworkers",
"Data Visualizations",
"Deficit Thinking",
"Design Choices",
"Mask Variability",
"Outcome Disparities",
"Personal Attributions",
"Personal Explanations",
"Social Inequality",
"Social Inequity",
"Social Outcome Visualization",
"Stereotyping",
"Within Group Variability",
"Data Visualization",
"Bars",
"Jitter",
"Uncertainty",
"NASA",
"Dispersion",
"Systematics",
"Deficit Thinking",
"Fundamental Attribution Error",
"Correspondence Bias",
"Storytelling",
"Diversity",
"Equity"
],
"authors": [
{
"givenName": "Eli",
"surname": "Holder",
"fullName": "Eli Holder",
"affiliation": "3iap, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cindy",
"surname": "Xiong",
"fullName": "Cindy Xiong",
"affiliation": "UMass Amherst, United States",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "624-634",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "09903471",
"articleId": "1GZolxWTqPS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09904442",
"articleId": "1H1gpt871W8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xquNQMVFCM",
"doi": "10.1109/TVCG.2021.3114684",
"abstract": "Data can be visually represented using visual channels like position, length or luminance. An existing ranking of these visual channels is based on how accurately participants could report the ratio between two depicted values. There is an assumption that this ranking should hold for different tasks and for different numbers of marks. However, there is surprisingly little existing work that tests this assumption, especially given that visually computing ratios is relatively unimportant in real-world visualizations, compared to seeing, remembering, and comparing trends and motifs, across displays that almost universally depict more than two values. To simulate the information extracted from a glance at a visualization, we instead asked participants to immediately reproduce a set of values from memory after they were shown the visualization. These values could be shown in a bar graph (position (bar)), line graph (position (line)), heat map (luminance), bubble chart (area), misaligned bar graph (length), or ‘wind map’ (angle). With a Bayesian multilevel modeling approach, we show how the rank positions of visual channels shift across different numbers of marks (2, 4 or 8) and for bias, precision, and error measures. The ranking did not hold, even for reproductions of only 2 marks, and the new probabilistic ranking was highly inconsistent for reproductions of different numbers of marks. Other factors besides channel choice had an order of magnitude more influence on performance, such as the number of values in the series (e.g., more marks led to larger errors), or the value of each mark (e.g., small values were systematically overestimated). Every visual channel was worse for displays with 8 marks than 4, consistent with established limits on visual memory. These results point to the need for a body of empirical studies that move beyond two-value ratio judgments as a baseline for reliably ranking the quality of a visual channel, including testing new tasks (detection of trends or motifs), timescales (immediate computation, or later comparison), and the number of values (from a handful, to thousands).",
"abstracts": [
{
"abstractType": "Regular",
"content": "Data can be visually represented using visual channels like position, length or luminance. An existing ranking of these visual channels is based on how accurately participants could report the ratio between two depicted values. There is an assumption that this ranking should hold for different tasks and for different numbers of marks. However, there is surprisingly little existing work that tests this assumption, especially given that visually computing ratios is relatively unimportant in real-world visualizations, compared to seeing, remembering, and comparing trends and motifs, across displays that almost universally depict more than two values. To simulate the information extracted from a glance at a visualization, we instead asked participants to immediately reproduce a set of values from memory after they were shown the visualization. These values could be shown in a bar graph (position (bar)), line graph (position (line)), heat map (luminance), bubble chart (area), misaligned bar graph (length), or ‘wind map’ (angle). With a Bayesian multilevel modeling approach, we show how the rank positions of visual channels shift across different numbers of marks (2, 4 or 8) and for bias, precision, and error measures. The ranking did not hold, even for reproductions of only 2 marks, and the new probabilistic ranking was highly inconsistent for reproductions of different numbers of marks. Other factors besides channel choice had an order of magnitude more influence on performance, such as the number of values in the series (e.g., more marks led to larger errors), or the value of each mark (e.g., small values were systematically overestimated). Every visual channel was worse for displays with 8 marks than 4, consistent with established limits on visual memory. These results point to the need for a body of empirical studies that move beyond two-value ratio judgments as a baseline for reliably ranking the quality of a visual channel, including testing new tasks (detection of trends or motifs), timescales (immediate computation, or later comparison), and the number of values (from a handful, to thousands).",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Data can be visually represented using visual channels like position, length or luminance. An existing ranking of these visual channels is based on how accurately participants could report the ratio between two depicted values. There is an assumption that this ranking should hold for different tasks and for different numbers of marks. However, there is surprisingly little existing work that tests this assumption, especially given that visually computing ratios is relatively unimportant in real-world visualizations, compared to seeing, remembering, and comparing trends and motifs, across displays that almost universally depict more than two values. To simulate the information extracted from a glance at a visualization, we instead asked participants to immediately reproduce a set of values from memory after they were shown the visualization. These values could be shown in a bar graph (position (bar)), line graph (position (line)), heat map (luminance), bubble chart (area), misaligned bar graph (length), or ‘wind map’ (angle). With a Bayesian multilevel modeling approach, we show how the rank positions of visual channels shift across different numbers of marks (2, 4 or 8) and for bias, precision, and error measures. The ranking did not hold, even for reproductions of only 2 marks, and the new probabilistic ranking was highly inconsistent for reproductions of different numbers of marks. Other factors besides channel choice had an order of magnitude more influence on performance, such as the number of values in the series (e.g., more marks led to larger errors), or the value of each mark (e.g., small values were systematically overestimated). Every visual channel was worse for displays with 8 marks than 4, consistent with established limits on visual memory. These results point to the need for a body of empirical studies that move beyond two-value ratio judgments as a baseline for reliably ranking the quality of a visual channel, including testing new tasks (detection of trends or motifs), timescales (immediate computation, or later comparison), and the number of values (from a handful, to thousands).",
"title": "Rethinking the Ranks of Visual Channels",
"normalizedTitle": "Rethinking the Ranks of Visual Channels",
"fno": "09557878",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Task Analysis",
"Visualization",
"Bars",
"Data Visualization",
"Memory Management",
"Measurement Uncertainty",
"Correlation",
"Data Type Agnostic",
"Human Subjects Quantitative Studies",
"Perception Cognition",
"Charts Diagrams And Plots"
],
"authors": [
{
"givenName": "Caitlyn M.",
"surname": "McColeman",
"fullName": "Caitlyn M. McColeman",
"affiliation": "Northwestern University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fumeng",
"surname": "Yang",
"fullName": "Fumeng Yang",
"affiliation": "Brown University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Timothy F.",
"surname": "Brady",
"fullName": "Timothy F. Brady",
"affiliation": "University of San Diego, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Steven",
"surname": "Franconeri",
"fullName": "Steven Franconeri",
"affiliation": "Northwestern University, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "707-717",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2016/01/07192667",
"title": "Visual Encodings of Temporal Uncertainty: A Comparative User Study",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192667/13rRUwjGoLH",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122631",
"title": "Graphical Overlays: Using Layered Elements to Aid Chart Reading",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122631/13rRUyfKIHJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904487",
"title": "Studying Early Decision Making with Progressive Bar Charts",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904487/1H1geE4olvG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805448",
"title": "Illusion of Causality in Visualized Data",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805448/1cG4Az22lFe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807320",
"title": "The Perceptual Proxies of Visual Comparison",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807320/1cG6vb0dTG0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08836120",
"title": "Measures of the Benefit of Direct Encoding of Data Deltas for Data Pair Relation Perception",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08836120/1dia2KVa7g4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222047",
"title": "Truth or Square: Aspect Ratio Biases Recall of Position Encodings",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222047/1nTqj3fbFXq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09238508",
"title": "Revealing Perceptual Proxies with Adversarial Examples",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09238508/1oa15KNUtGg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09288884",
"title": "No mark is an island: Precision and category repulsion biases in data reproductions",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09288884/1pq6f5VhVF6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a344",
"title": "Comparison of four visual analytics techniques for the visualization of adverse drug event rates in clinical trials",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a344/1rSRc4omAj6",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552216",
"articleId": "1xic1HOWGli",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09552881",
"articleId": "1xibXzMLm9i",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zJiGlHefQc",
"name": "ttg202201-09557878s1-supp1-3114684.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09557878s1-supp1-3114684.pdf",
"extension": "pdf",
"size": "1.79 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwGqBqs",
"title": "June",
"year": "2017",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILtJzC",
"doi": "10.1109/TVCG.2017.2674978",
"abstract": "Designing a good scatterplot can be difficult for non-experts in visualization, because they need to decide on many parameters, such as marker size and opacity, aspect ratio, color, and rendering order. This paper contributes to research exploring the use of perceptual models and quality metrics to set such parameters automatically for enhanced visual quality of a scatterplot. A key consideration in this paper is the construction of a cost function to capture several relevant aspects of the human visual system, examining a scatterplot design for some data analysis task. We show how the cost function can be used in an optimizer to search for the optimal visual design for a user’s dataset and task objectives (e.g., “reliable linear correlation estimation is more important than class separation”). The approach is extensible to different analysis tasks. To test its performance in a realistic setting, we pre-calibrated it for correlation estimation, class separation, and outlier detection. The optimizer was able to produce designs that achieved a level of speed and success comparable to that of those using human-designed presets (e.g., in R or MATLAB). Case studies demonstrate that the approach can adapt a design to the data, to reveal patterns without user intervention.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Designing a good scatterplot can be difficult for non-experts in visualization, because they need to decide on many parameters, such as marker size and opacity, aspect ratio, color, and rendering order. This paper contributes to research exploring the use of perceptual models and quality metrics to set such parameters automatically for enhanced visual quality of a scatterplot. A key consideration in this paper is the construction of a cost function to capture several relevant aspects of the human visual system, examining a scatterplot design for some data analysis task. We show how the cost function can be used in an optimizer to search for the optimal visual design for a user’s dataset and task objectives (e.g., “reliable linear correlation estimation is more important than class separation”). The approach is extensible to different analysis tasks. To test its performance in a realistic setting, we pre-calibrated it for correlation estimation, class separation, and outlier detection. The optimizer was able to produce designs that achieved a level of speed and success comparable to that of those using human-designed presets (e.g., in R or MATLAB). Case studies demonstrate that the approach can adapt a design to the data, to reveal patterns without user intervention.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Designing a good scatterplot can be difficult for non-experts in visualization, because they need to decide on many parameters, such as marker size and opacity, aspect ratio, color, and rendering order. This paper contributes to research exploring the use of perceptual models and quality metrics to set such parameters automatically for enhanced visual quality of a scatterplot. A key consideration in this paper is the construction of a cost function to capture several relevant aspects of the human visual system, examining a scatterplot design for some data analysis task. We show how the cost function can be used in an optimizer to search for the optimal visual design for a user’s dataset and task objectives (e.g., “reliable linear correlation estimation is more important than class separation”). The approach is extensible to different analysis tasks. To test its performance in a realistic setting, we pre-calibrated it for correlation estimation, class separation, and outlier detection. The optimizer was able to produce designs that achieved a level of speed and success comparable to that of those using human-designed presets (e.g., in R or MATLAB). Case studies demonstrate that the approach can adapt a design to the data, to reveal patterns without user intervention.",
"title": "Towards Perceptual Optimization of the Visual Design of Scatterplots",
"normalizedTitle": "Towards Perceptual Optimization of the Visual Design of Scatterplots",
"fno": "07864468",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Measurement",
"Correlation",
"Cost Function",
"Data Analysis",
"Data Visualization",
"Scatterplot",
"Optimization",
"Perception",
"Crowdsourcing"
],
"authors": [
{
"givenName": "Luana",
"surname": "Micallef",
"fullName": "Luana Micallef",
"affiliation": "Department of Computer Science, Helsinki Institute for Information Technology HIIT, Aalto University, Espoo, Finland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gregorio",
"surname": "Palmas",
"fullName": "Gregorio Palmas",
"affiliation": "Department of Computational Science and Technology, School of Computer Science and Communication, KTH Royal Institute of Technology, Stockholm, Sweden",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Antti",
"surname": "Oulasvirta",
"fullName": "Antti Oulasvirta",
"affiliation": "Department of Communications and Networking, Aalto University, Espoo, Finland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tino",
"surname": "Weinkauf",
"fullName": "Tino Weinkauf",
"affiliation": "Department of Computational Science and Technology, School of Computer Science and Communication, KTH Royal Institute of Technology, Stockholm, Sweden",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2017-06-01 00:00:00",
"pubType": "trans",
"pages": "1588-1599",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2018/09/08047300",
"title": "Cluster-Based Visual Abstraction for Multivariate Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2018/09/08047300/13rRUILLkvy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017602",
"title": "Scatterplots: Tasks, Data, and Designs",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017602/13rRUy3gn7C",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875982",
"title": "Visual Abstraction and Exploration of Multi-class Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875982/13rRUygT7ye",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/03/08490694",
"title": "ScatterNet: A Deep Subjective Similarity Model for Visual Analysis of Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2020/03/08490694/14jQfPkRijD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09834145",
"title": "Visual Cue Effects on a Classification Accuracy Estimation Task in Immersive Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09834145/1FapOsLgEik",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08794768",
"title": "Evaluating Perceptual Bias During Geometric Scaling of Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08794768/1cr2ZlCC2xG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933670",
"title": "Disentangled Representation of Data Distributions in Scatterplots",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933670/1fTgGJvQB9e",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222295",
"title": "Modeling the Influence of Visual Density on Cluster Perception in Scatterplots Using Topology",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222295/1nTqtC45a12",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09226404",
"title": "Evaluation of Sampling Methods for Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09226404/1nYqk0TjyeY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/05/09495208",
"title": "Visual Clustering Factors in Scatterplots",
"doi": null,
"abstractUrl": "/magazine/cg/2021/05/09495208/1vyjCkbMBvW",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07864462",
"articleId": "13rRUyoPSP8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07864456",
"articleId": "13rRUxASuAz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet3Z",
"name": "ttg201706-07864468s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201706-07864468s1.zip",
"extension": "zip",
"size": "21.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrFBPWq",
"title": "September-October",
"year": "2006",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "12",
"label": "September-October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxcKzVd",
"doi": "10.1109/TVCG.2006.187",
"abstract": "Existing information-visualization techniques that target small screens are usually limited to exploring a few hundred items. In this article we present a scatterplot tool for Personal Digital Assistants that allows the handling of many thousands of items. The application's scalability is achieved by incorporating two alternative interaction techniques: a geometric-semantic zoom that provides smooth transition between overview and detail, and a fisheye distortion that displays the focus and context regions of the scatterplot in a single view. A user study with 24 participants was conducted to compare the usability and efficiency of both techniques when searching a book database containing 7500 items. The study was run on a pen-driven Wacom board simulating a PDA interface. While the results showed no significant difference in task-completion times, a clear majority of 20 users preferred the fisheye view over the zoom interaction. In addition, other dependent variables such as user satisfaction and subjective rating of orientation and navigation support revealed a preference for the fisheye distortion. These findings partly contradict related research and indicate that, when using a small screen, users place higher value on the ability to preserve navigational context than they do on the ease of use of a simplistic, metaphor-based interaction style.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Existing information-visualization techniques that target small screens are usually limited to exploring a few hundred items. In this article we present a scatterplot tool for Personal Digital Assistants that allows the handling of many thousands of items. The application's scalability is achieved by incorporating two alternative interaction techniques: a geometric-semantic zoom that provides smooth transition between overview and detail, and a fisheye distortion that displays the focus and context regions of the scatterplot in a single view. A user study with 24 participants was conducted to compare the usability and efficiency of both techniques when searching a book database containing 7500 items. The study was run on a pen-driven Wacom board simulating a PDA interface. While the results showed no significant difference in task-completion times, a clear majority of 20 users preferred the fisheye view over the zoom interaction. In addition, other dependent variables such as user satisfaction and subjective rating of orientation and navigation support revealed a preference for the fisheye distortion. These findings partly contradict related research and indicate that, when using a small screen, users place higher value on the ability to preserve navigational context than they do on the ease of use of a simplistic, metaphor-based interaction style.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Existing information-visualization techniques that target small screens are usually limited to exploring a few hundred items. In this article we present a scatterplot tool for Personal Digital Assistants that allows the handling of many thousands of items. The application's scalability is achieved by incorporating two alternative interaction techniques: a geometric-semantic zoom that provides smooth transition between overview and detail, and a fisheye distortion that displays the focus and context regions of the scatterplot in a single view. A user study with 24 participants was conducted to compare the usability and efficiency of both techniques when searching a book database containing 7500 items. The study was run on a pen-driven Wacom board simulating a PDA interface. While the results showed no significant difference in task-completion times, a clear majority of 20 users preferred the fisheye view over the zoom interaction. In addition, other dependent variables such as user satisfaction and subjective rating of orientation and navigation support revealed a preference for the fisheye distortion. These findings partly contradict related research and indicate that, when using a small screen, users place higher value on the ability to preserve navigational context than they do on the ease of use of a simplistic, metaphor-based interaction style.",
"title": "User Interaction with Scatterplots on Small Screens - A Comparative Evaluation of Geometric-Semantic Zoom and Fisheye Distortion",
"normalizedTitle": "User Interaction with Scatterplots on Small Screens - A Comparative Evaluation of Geometric-Semantic Zoom and Fisheye Distortion",
"fno": "v0829",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Scattering",
"Personal Digital Assistants",
"Books",
"Visual Databases",
"Displays",
"Marketing And Sales",
"Data Visualization",
"Usability",
"Spatial Databases",
"Navigation",
"Focus Context",
"Small Screen",
"PDA",
"Scatter Plot",
"Zoom",
"Fisheye"
],
"authors": [
{
"givenName": "Thorsten",
"surname": "Buering",
"fullName": "Thorsten Buering",
"affiliation": "University of Konstanz",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jens",
"surname": "Gerken",
"fullName": "Jens Gerken",
"affiliation": "University of Konstanz",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Harald",
"surname": "Reiterer",
"fullName": "Harald Reiterer",
"affiliation": "University of Konstanz",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "trans",
"pages": "829-836",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ipdps/2010/6442/0/05470360",
"title": "Fisheye lens distortion correction on multicore and hardware accelerator platforms",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2010/05470360/12OmNAJ4pdE",
"parentPublication": {
"id": "proceedings/ipdps/2010/6442/0",
"title": "2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fccm/2009/3716/0/3716a149",
"title": "Real-Time Fisheye Lens Distortion Correction Using Automatically Generated Streaming Accelerators",
"doi": null,
"abstractUrl": "/proceedings-article/fccm/2009/3716a149/12OmNBUS79F",
"parentPublication": {
"id": "proceedings/fccm/2009/3716/0",
"title": "Field-Programmable Custom Computing Machines, Annual IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2004/2131/0/01342728",
"title": "Modeling Web-based dialog flows for automatic dialog control",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2004/01342728/12OmNC2xhB5",
"parentPublication": {
"id": "proceedings/ase/2004/2131/0",
"title": "Proceedings. 19th International Conference on Automated Software Engineering, 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2012/2719/0/06337202",
"title": "A Framework for Segmenting Customers Based on Probability Density of Transaction Data",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2012/06337202/12OmNC4eSHu",
"parentPublication": {
"id": "proceedings/iiai-aai/2012/2719/0",
"title": "2012 IIAI International Conference on Advanced Applied Informatics (IIAIAAI 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rev/2007/3248/0/32480009",
"title": "An Improved Fisheye Zoom Algorithm for Visualizing and Editing Hierarchical Models",
"doi": null,
"abstractUrl": "/proceedings-article/rev/2007/32480009/12OmNClQ0qX",
"parentPublication": {
"id": "proceedings/rev/2007/3248/0",
"title": "Requirements Engineering Visualization, First International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/1993/3570/0/00344012",
"title": "Data quality requirements analysis and modeling",
"doi": null,
"abstractUrl": "/proceedings-article/icde/1993/00344012/12OmNvAiSMR",
"parentPublication": {
"id": "proceedings/icde/1993/3570/0",
"title": "Proceedings of IEEE 9th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2006/2701/0/04053172",
"title": "TOP-COP: Mining TOP-K Strongly Correlated Pairs in Large Databases",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2006/04053172/12OmNwErpAD",
"parentPublication": {
"id": "proceedings/icdm/2006/2701/0",
"title": "Sixth International Conference on Data Mining (ICDM'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sadfe/2010/4052/0/4052a056",
"title": "A Platform Independent Process Model for Smartphones Based on Invariants",
"doi": null,
"abstractUrl": "/proceedings-article/sadfe/2010/4052a056/12OmNyywxDC",
"parentPublication": {
"id": "proceedings/sadfe/2010/4052/0",
"title": "2010 Fifth International Workshop on Systematic Approaches to Digital Forensic Engineering (SADFE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0821",
"articleId": "13rRUNvyat8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0941",
"articleId": "13rRUxD9h4Z",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNy49sJl",
"title": "Nov.",
"year": "2013",
"issueNum": "11",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwI5Ug8",
"doi": "10.1109/TVCG.2013.93",
"abstract": "In this paper, we propose a new method for the visual reorganization of online analytical processing (OLAP) cubes that aims at improving their visualization. Our method addresses dimensions with hierarchically organized members. It uses a genetic algorithm that reorganizes k-ary trees. Genetic operators perform permutations of subtrees to optimize a visual homogeneity function. We propose several ways to reorganize an OLAP cube depending on which set of members is selected for the reorganization: all of the members, only the displayed members, or the members at a given level (level by level approach). The results that are evaluated by using optimization criteria show that our algorithm has a reliable performance even when it is limited to 1 minute runs. Our algorithm was integrated in an interactive 3D interface for OLAP. A user study was conducted to evaluate our approach with users. The results highlight the usefulness of reorganization in two OLAP tasks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we propose a new method for the visual reorganization of online analytical processing (OLAP) cubes that aims at improving their visualization. Our method addresses dimensions with hierarchically organized members. It uses a genetic algorithm that reorganizes k-ary trees. Genetic operators perform permutations of subtrees to optimize a visual homogeneity function. We propose several ways to reorganize an OLAP cube depending on which set of members is selected for the reorganization: all of the members, only the displayed members, or the members at a given level (level by level approach). The results that are evaluated by using optimization criteria show that our algorithm has a reliable performance even when it is limited to 1 minute runs. Our algorithm was integrated in an interactive 3D interface for OLAP. A user study was conducted to evaluate our approach with users. The results highlight the usefulness of reorganization in two OLAP tasks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we propose a new method for the visual reorganization of online analytical processing (OLAP) cubes that aims at improving their visualization. Our method addresses dimensions with hierarchically organized members. It uses a genetic algorithm that reorganizes k-ary trees. Genetic operators perform permutations of subtrees to optimize a visual homogeneity function. We propose several ways to reorganize an OLAP cube depending on which set of members is selected for the reorganization: all of the members, only the displayed members, or the members at a given level (level by level approach). The results that are evaluated by using optimization criteria show that our algorithm has a reliable performance even when it is limited to 1 minute runs. Our algorithm was integrated in an interactive 3D interface for OLAP. A user study was conducted to evaluate our approach with users. The results highlight the usefulness of reorganization in two OLAP tasks.",
"title": "Hierarchical Reorganization of Dimensions in OLAP Visualizations",
"normalizedTitle": "Hierarchical Reorganization of Dimensions in OLAP Visualizations",
"fno": "ttg2013111833",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Genetic Algorithms",
"Three Dimensional Displays",
"Data Visualization",
"Genetics",
"Sociology",
"Statistics",
"Interactive Knowledge Discovery",
"Dimension Reorganization",
"Visual OLAP"
],
"authors": [
{
"givenName": "S.",
"surname": "Lafon",
"fullName": "S. Lafon",
"affiliation": "Comput. Sci. Lab., Univ. Francois-Rabelais of Tours, Tours, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "F.",
"surname": "Bouali",
"fullName": "F. Bouali",
"affiliation": "Comput. Sci. Lab., Univ. Francois-Rabelais of Tours, Tours, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "C.",
"surname": "Guinot",
"fullName": "C. Guinot",
"affiliation": "Comput. Sci. Lab., Univ. Francois-Rabelais of Tours, Tours, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "G.",
"surname": "Venturini",
"fullName": "G. Venturini",
"affiliation": "Comput. Sci. Lab., Univ. Francois-Rabelais of Tours, Tours, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2013-11-01 00:00:00",
"pubType": "trans",
"pages": "1833-1845",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibe/2014/7502/0/7502a191",
"title": "Disease-Gene Association Using a Genetic Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2014/7502a191/12OmNAH5dk4",
"parentPublication": {
"id": "proceedings/bibe/2014/7502/0",
"title": "2014 IEEE International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2014/4261/0/4261a133",
"title": "Airfoil Aerodynamic Optimization Based on an Improved Genetic Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2014/4261a133/12OmNrkjVbm",
"parentPublication": {
"id": "proceedings/isdea/2014/4261/0",
"title": "2014 Fifth International Conference on Intelligent Systems Design and Engineering Applications (ISDEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigcomp/2016/8796/0/07425925",
"title": "A sentence clustering framework for opinion summarization using a modified genetic algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2016/07425925/12OmNvwC5uh",
"parentPublication": {
"id": "proceedings/bigcomp/2016/8796/0",
"title": "2016 International Conference on Big Data and Smart Computing (BigComp)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisce/2017/3013/0/3013a312",
"title": "Error Evaluation of Planar Curve Profile Based on an Improved Genetic Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2017/3013a312/12OmNy3iFl7",
"parentPublication": {
"id": "proceedings/icisce/2017/3013/0",
"title": "2017 4th International Conference on Information Science and Control Engineering (ICISCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisce/2017/3013/0/3013a756",
"title": "Trend Balanced Genetic Algorithm for Blending Optimization of Traditional Chinese Medicine",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2017/3013a756/12OmNyeECzv",
"parentPublication": {
"id": "proceedings/icisce/2017/3013/0",
"title": "2017 4th International Conference on Information Science and Control Engineering (ICISCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icci-cc/2012/2795/0/06311176",
"title": "Apply genetic algorithm with an adaptive stopping criterion to PCR-RFLP Primer Design",
"doi": null,
"abstractUrl": "/proceedings-article/icci-cc/2012/06311176/12OmNyo1nYk",
"parentPublication": {
"id": "proceedings/icci-cc/2012/2795/0",
"title": "2012 11th IEEE International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iri/2018/2659/0/265901a444",
"title": "Automatic Convolutional Neural Network Selection for Image Classification Using Genetic Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/iri/2018/265901a444/12OmNz6iOcZ",
"parentPublication": {
"id": "proceedings/iri/2018/2659/0",
"title": "2018 IEEE International Conference on Information Reuse and Integration (IRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2015/8660/0/8660a005",
"title": "Algorithm for Distance Constrained Aerial Vehicle Routing Problem: Based on Minimum Spanning Tree and Genetic Computation",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2015/8660a005/12OmNzUPpDB",
"parentPublication": {
"id": "proceedings/cis/2015/8660/0",
"title": "2015 11th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/uic-atc-scalcom/2015/7211/0/07518322",
"title": "Research on Tasks Satisfaction Type of Intelligent Planning Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/uic-atc-scalcom/2015/07518322/12OmNzUPpmy",
"parentPublication": {
"id": "proceedings/uic-atc-scalcom/2015/7211/0",
"title": "2015 IEEE 12th Intl Conf on Ubiquitous Intelligence and Computing and 2015 IEEE 12th Intl Conf on Autonomic and Trusted Computing and 2015 IEEE 15th Intl Conf on Scalable Computing and Communications and Its Associated Workshops (UIC-ATC-ScalCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccea/2020/5904/0/09103872",
"title": "Research on Terminal Path Selection Based on Hybrid Genetic-Ant Colony Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/iccea/2020/09103872/1kesweJnmOQ",
"parentPublication": {
"id": "proceedings/iccea/2020/5904/0",
"title": "2020 International Conference on Computer Engineering and Application (ICCEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013111820",
"articleId": "13rRUxjQybR",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013111846",
"articleId": "13rRUxcKzVk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAXPyf1",
"title": "January",
"year": "1980",
"issueNum": "01",
"idPrefix": "ts",
"pubType": "journal",
"volume": "6",
"label": "January",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxOdD4a",
"doi": "10.1109/TSE.1980.230464",
"abstract": "A program's working set is the collection of segments (or pages) recently referenced. This concept has led to efficient methods for measuring a program's intrinsic memory demand; it has assisted in undetstanding and in modeling program behavior; and it has been used as the basis of optimal multiprogrammed memory management. The total cost of a working set dispatcher is no larger than the total cost of other common dispatchers. This paper outlines the argument why it is unlikely that anyone will find a cheaper nonlookahead memory policy that delivers significantly better performance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A program's working set is the collection of segments (or pages) recently referenced. This concept has led to efficient methods for measuring a program's intrinsic memory demand; it has assisted in undetstanding and in modeling program behavior; and it has been used as the basis of optimal multiprogrammed memory management. The total cost of a working set dispatcher is no larger than the total cost of other common dispatchers. This paper outlines the argument why it is unlikely that anyone will find a cheaper nonlookahead memory policy that delivers significantly better performance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A program's working set is the collection of segments (or pages) recently referenced. This concept has led to efficient methods for measuring a program's intrinsic memory demand; it has assisted in undetstanding and in modeling program behavior; and it has been used as the basis of optimal multiprogrammed memory management. The total cost of a working set dispatcher is no larger than the total cost of other common dispatchers. This paper outlines the argument why it is unlikely that anyone will find a cheaper nonlookahead memory policy that delivers significantly better performance.",
"title": "Working Sets Past and Present",
"normalizedTitle": "Working Sets Past and Present",
"fno": "01702696",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Working Sets",
"Dispatchers",
"Lifetime Curves",
"Memory Management",
"Memory Space Time Product",
"Multiprogrammed Load Controllers",
"Multiprogramming",
"Optimal Multiprogramming",
"Phase Transition Behavior",
"Program Behavior",
"Program Locality",
"Program Measurement",
"Stochastic Program Models",
"Virtual Memory",
"Working Set Dispatchers"
],
"authors": [
{
"givenName": "P.J.",
"surname": "Denning",
"fullName": "P.J. Denning",
"affiliation": "Department of Computer Science, Purdue University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "1980-01-01 00:00:00",
"pubType": "trans",
"pages": "64-84",
"year": "1980",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cmpsac/1978/9999/0/00810322",
"title": "Working sets today",
"doi": null,
"abstractUrl": "/proceedings-article/cmpsac/1978/00810322/12OmNASraBS",
"parentPublication": {
"id": "proceedings/cmpsac/1978/9999/0",
"title": "COMPSAC '78 - The IEEE Computer Society's Second International Computer Software and Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hcs/2013/8881/0/07478291",
"title": "Flash's role in big data, past present, and future",
"doi": null,
"abstractUrl": "/proceedings-article/hcs/2013/07478291/12OmNy7yEfa",
"parentPublication": {
"id": "proceedings/hcs/2013/8881/0",
"title": "2013 IEEE Hot Chips 25 Symposium (HCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1988/11/e1640",
"title": "Compile-Time Program Restructuring in Multiprogrammed Virtual Memory Systems",
"doi": null,
"abstractUrl": "/journal/ts/1988/11/e1640/13rRUIJuxrh",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1978/08/01675177",
"title": "Working Set and Page Fault Frequency Paging Algorithms: A Performance Comparison",
"doi": null,
"abstractUrl": "/journal/tc/1978/08/01675177/13rRUwjGoKt",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1982/02/01702917",
"title": "Some Results on the Working Set Anomalies in Numerical Programs",
"doi": null,
"abstractUrl": "/journal/ts/1982/02/01702917/13rRUwvByaf",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1978/01/01702485",
"title": "Random Injection Control of Multiprogramming in Virtual Memory",
"doi": null,
"abstractUrl": "/journal/ts/1978/01/01702485/13rRUxNEqRv",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1983/01/01703014",
"title": "Experiments on the Knee Criterion in a Multiprogrammed Computer System",
"doi": null,
"abstractUrl": "/journal/ts/1983/01/01703014/13rRUxNEqRx",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1996/08/t0868",
"title": "The Effect of Program Behavior on Fault Observability",
"doi": null,
"abstractUrl": "/journal/tc/1996/08/t0868/13rRUxOdDbX",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1983/03/01703057",
"title": "VSWS: The Variable-Interval Sampled Working Set Policy",
"doi": null,
"abstractUrl": "/journal/ts/1983/03/01703057/13rRUxcsYIK",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1976/09/01674715",
"title": "A Modified Working Set Paging Algorithm",
"doi": null,
"abstractUrl": "/journal/tc/1976/09/01674715/13rRUxlgxNg",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "01702695",
"articleId": "13rRUwh80vW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01702697",
"articleId": "13rRUxBa5dj",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xibWySUs4U",
"doi": "10.1109/TVCG.2021.3114803",
"abstract": "As uncertainty visualizations for general audiences become increasingly common, designers must understand the full impact of uncertainty communication techniques on viewers' decision processes. Prior work demonstrates mixed performance outcomes with respect to how individuals make decisions using various visual and textual depictions of uncertainty. Part of the inconsistency across findings may be due to an over-reliance on task accuracy, which cannot, on its own, provide a comprehensive understanding of how uncertainty visualization techniques support reasoning processes. In this work, we advance the debate surrounding the efficacy of modern 1D uncertainty visualizations by conducting converging quantitative and qualitative analyses of both the effort and strategies used by individuals when provided with quantile dotplots, density plots, interval plots, mean plots, and textual descriptions of uncertainty. We utilize two approaches for examining effort across uncertainty communication techniques: a measure of individual differences in working-memory capacity known as an operation span (OSPAN) task and self-reports of perceived workload via the NASA-TLX. The results reveal that both visualization methods and working-memory capacity impact participants' decisions. Specifically, quantile dotplots and density plots (i.e., distributional annotations) result in more accurate judgments than interval plots, textual descriptions of uncertainty, and mean plots (i.e., summary annotations). Additionally, participants' open-ended responses suggest that individuals viewing distributional annotations are more likely to employ a strategy that explicitly incorporates uncertainty into their judgments than those viewing summary annotations. When comparing quantile dotplots to density plots, this work finds that both methods are equally effective for low-working-memory individuals. However, for individuals with high-working-memory capacity, quantile dotplots evoke more accurate responses with less perceived effort. Given these results, we advocate for the inclusion of converging behavioral and subjective workload metrics in addition to accuracy performance to further disambiguate meaningful differences among visualization techniques.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As uncertainty visualizations for general audiences become increasingly common, designers must understand the full impact of uncertainty communication techniques on viewers' decision processes. Prior work demonstrates mixed performance outcomes with respect to how individuals make decisions using various visual and textual depictions of uncertainty. Part of the inconsistency across findings may be due to an over-reliance on task accuracy, which cannot, on its own, provide a comprehensive understanding of how uncertainty visualization techniques support reasoning processes. In this work, we advance the debate surrounding the efficacy of modern 1D uncertainty visualizations by conducting converging quantitative and qualitative analyses of both the effort and strategies used by individuals when provided with quantile dotplots, density plots, interval plots, mean plots, and textual descriptions of uncertainty. We utilize two approaches for examining effort across uncertainty communication techniques: a measure of individual differences in working-memory capacity known as an operation span (OSPAN) task and self-reports of perceived workload via the NASA-TLX. The results reveal that both visualization methods and working-memory capacity impact participants' decisions. Specifically, quantile dotplots and density plots (i.e., distributional annotations) result in more accurate judgments than interval plots, textual descriptions of uncertainty, and mean plots (i.e., summary annotations). Additionally, participants' open-ended responses suggest that individuals viewing distributional annotations are more likely to employ a strategy that explicitly incorporates uncertainty into their judgments than those viewing summary annotations. When comparing quantile dotplots to density plots, this work finds that both methods are equally effective for low-working-memory individuals. However, for individuals with high-working-memory capacity, quantile dotplots evoke more accurate responses with less perceived effort. Given these results, we advocate for the inclusion of converging behavioral and subjective workload metrics in addition to accuracy performance to further disambiguate meaningful differences among visualization techniques.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As uncertainty visualizations for general audiences become increasingly common, designers must understand the full impact of uncertainty communication techniques on viewers' decision processes. Prior work demonstrates mixed performance outcomes with respect to how individuals make decisions using various visual and textual depictions of uncertainty. Part of the inconsistency across findings may be due to an over-reliance on task accuracy, which cannot, on its own, provide a comprehensive understanding of how uncertainty visualization techniques support reasoning processes. In this work, we advance the debate surrounding the efficacy of modern 1D uncertainty visualizations by conducting converging quantitative and qualitative analyses of both the effort and strategies used by individuals when provided with quantile dotplots, density plots, interval plots, mean plots, and textual descriptions of uncertainty. We utilize two approaches for examining effort across uncertainty communication techniques: a measure of individual differences in working-memory capacity known as an operation span (OSPAN) task and self-reports of perceived workload via the NASA-TLX. The results reveal that both visualization methods and working-memory capacity impact participants' decisions. Specifically, quantile dotplots and density plots (i.e., distributional annotations) result in more accurate judgments than interval plots, textual descriptions of uncertainty, and mean plots (i.e., summary annotations). Additionally, participants' open-ended responses suggest that individuals viewing distributional annotations are more likely to employ a strategy that explicitly incorporates uncertainty into their judgments than those viewing summary annotations. When comparing quantile dotplots to density plots, this work finds that both methods are equally effective for low-working-memory individuals. However, for individuals with high-working-memory capacity, quantile dotplots evoke more accurate responses with less perceived effort. Given these results, we advocate for the inclusion of converging behavioral and subjective workload metrics in addition to accuracy performance to further disambiguate meaningful differences among visualization techniques.",
"title": "Examining Effort in 1D Uncertainty Communication Using Individual Differences in Working Memory and NASA-TLX",
"normalizedTitle": "Examining Effort in 1D Uncertainty Communication Using Individual Differences in Working Memory and NASA-TLX",
"fno": "09552887",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Uncertainty",
"Data Visualization",
"Visualization",
"Task Analysis",
"Annotations",
"Measurement Uncertainty",
"Cognition",
"Uncertainty Visualization",
"Working Memory",
"Individual Differences",
"Online OSPAN",
"Effort",
"Workload",
"NASA TLX"
],
"authors": [
{
"givenName": "Spencer C.",
"surname": "Castro",
"fullName": "Spencer C. Castro",
"affiliation": "University of California Merced in Management of Complex Systems, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "P. Samuel",
"surname": "Quinan",
"fullName": "P. Samuel Quinan",
"affiliation": "University of Utah School of Computing, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Helia",
"surname": "Hosseinpour",
"fullName": "Helia Hosseinpour",
"affiliation": "University of California Merced in Cognitive and Information Sciences, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lace",
"surname": "Padilla",
"fullName": "Lace Padilla",
"affiliation": "University of California Merced in Cognitive and Information Sciences, United States",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "411-421",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2016/01/07192667",
"title": "Visual Encodings of Temporal Uncertainty: A Comparative User Study",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192667/13rRUwjGoLH",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010060980",
"title": "Matching Visual Saliency to Confidence in Plots of Uncertain Data",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010060980/13rRUxZRbnY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061209",
"title": "A User Study to Compare Four Uncertainty Visualization Methods for 1D and 2D Datasets",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061209/13rRUxcsYLI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440816",
"title": "Hypothetical Outcome Plots Help Untrained Observers Judge Trends in Ambiguous Data",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440816/17D45Xh13so",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200h396",
"title": "Scribble-Supervised Semantic Segmentation by Uncertainty Reduction on Neural Representation and Self-Supervision on Neural Eigenspace",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200h396/1BmLmd75nZS",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904433",
"title": "Evaluating the Use of Uncertainty Visualisations for Imputations of Data Missing At Random in Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904433/1H1gkkbe0hy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nicoint/2020/8771/0/09122371",
"title": "Visualization of Individual Variation of Multiple Annotators Working on Training Datasets for Machine Learning",
"doi": null,
"abstractUrl": "/proceedings-article/nicoint/2020/09122371/1kRSeLifK00",
"parentPublication": {
"id": "proceedings/nicoint/2020/8771/0",
"title": "2020 Nicograph International (NicoInt)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222364",
"title": "Visual Reasoning Strategies for Effect Size Judgments and Decisions",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222364/1nTrxuPw4UM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09572234",
"title": "Professional Differences: A Comparative Study of Visualization Task Performance and Spatial Ability Across Disciplines",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09572234/1xH5FXdMnoA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2021/0019/0/09597425",
"title": "Estimating continuous affect with label uncertainty",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2021/09597425/1yylaKqSpH2",
"parentPublication": {
"id": "proceedings/acii/2021/0019/0",
"title": "2021 9th International Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09557223",
"articleId": "1xlvZajdjmo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09552179",
"articleId": "1xic7sgAtig",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zJiDrkhums",
"name": "ttg202201-09552887s1-supp1-3114803.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09552887s1-supp1-3114803.pdf",
"extension": "pdf",
"size": "697 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1As7ypQiOI0",
"title": "Jan.-Feb.",
"year": "2022",
"issueNum": "01",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "42",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1As7zEHCGn6",
"doi": "10.1109/MCG.2021.3130314",
"abstract": "We introduce a new research area in visual analytics (VA) aiming to bridge existing gaps between methods of interactive machine learning (ML) and eXplainable Artificial Intelligence (XAI), on one side, and human minds, on the other side. The gaps are, first, a conceptual mismatch between ML/XAI outputs and human mental models and ways of reasoning, and second, a mismatch between the information quantity and level of detail and human capabilities to perceive and understand. A grand challenge is to adapt ML and XAI to human goals, concepts, values, and ways of thinking. Complementing the current efforts in XAI towards solving this challenge, VA can contribute by exploiting the potential of visualization as an effective way of communicating information to humans and a strong trigger of human abstractive perception and thinking. We propose a cross-disciplinary research framework and formulate research directions for VA.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We introduce a new research area in visual analytics (VA) aiming to bridge existing gaps between methods of interactive machine learning (ML) and eXplainable Artificial Intelligence (XAI), on one side, and human minds, on the other side. The gaps are, first, a conceptual mismatch between ML/XAI outputs and human mental models and ways of reasoning, and second, a mismatch between the information quantity and level of detail and human capabilities to perceive and understand. A grand challenge is to adapt ML and XAI to human goals, concepts, values, and ways of thinking. Complementing the current efforts in XAI towards solving this challenge, VA can contribute by exploiting the potential of visualization as an effective way of communicating information to humans and a strong trigger of human abstractive perception and thinking. We propose a cross-disciplinary research framework and formulate research directions for VA.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We introduce a new research area in visual analytics (VA) aiming to bridge existing gaps between methods of interactive machine learning (ML) and eXplainable Artificial Intelligence (XAI), on one side, and human minds, on the other side. The gaps are, first, a conceptual mismatch between ML/XAI outputs and human mental models and ways of reasoning, and second, a mismatch between the information quantity and level of detail and human capabilities to perceive and understand. A grand challenge is to adapt ML and XAI to human goals, concepts, values, and ways of thinking. Complementing the current efforts in XAI towards solving this challenge, VA can contribute by exploiting the potential of visualization as an effective way of communicating information to humans and a strong trigger of human abstractive perception and thinking. We propose a cross-disciplinary research framework and formulate research directions for VA.",
"title": "Visual Analytics for Human-Centered Machine Learning",
"normalizedTitle": "Visual Analytics for Human-Centered Machine Learning",
"fno": "09693359",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Cognitive Systems",
"Data Visualisation",
"Learning Artificial Intelligence",
"Visual Analytics",
"VA",
"Interactive Machine Learning",
"Explainable Artificial Intelligence",
"Human Abstractive Perception",
"Cross Disciplinary Research Framework",
"Human Centered Machine Learning",
"ML",
"XAI",
"Computer Science",
"Bridges",
"Computational Modeling",
"Visual Analytics",
"Human Intelligence",
"Buildings",
"Machine Learning"
],
"authors": [
{
"givenName": "Natalia",
"surname": "Andrienko",
"fullName": "Natalia Andrienko",
"affiliation": "City University of London, London, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gennady",
"surname": "Andrienko",
"fullName": "Gennady Andrienko",
"affiliation": "City University of London, London, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Linara",
"surname": "Adilova",
"fullName": "Linara Adilova",
"affiliation": "Ruhr University Bochum, Bochum, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefan",
"surname": "Wrobel",
"fullName": "Stefan Wrobel",
"affiliation": "University of Bonn, Bonn, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "mags",
"pages": "123-133",
"year": "2022",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/2015/7367/0/7367b138",
"title": "Interactivity in Visual Analytics: Use of Conceptual Frameworks to Support Human-Centered Design of a Decision-Support Tool",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2015/7367b138/12OmNB06l9m",
"parentPublication": {
"id": "proceedings/hicss/2015/7367/0",
"title": "2015 48th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2013/4892/0/4892c416",
"title": "Visual Analytics for Public Health: Supporting Knowledge Construction and Decision-Making",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2013/4892c416/12OmNrJiCNq",
"parentPublication": {
"id": "proceedings/hicss/2013/4892/0",
"title": "2013 46th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2014/04/mcg2014040008",
"title": "Semantic Interaction for Visual Analytics: Toward Coupling Cognition and Computation",
"doi": null,
"abstractUrl": "/magazine/cg/2014/04/mcg2014040008/13rRUwwslv3",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2012/04/mcg2012040063",
"title": "The Top 10 Challenges in Extreme-Scale Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2012/04/mcg2012040063/13rRUxC0SGA",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2015/02/mcg2015020016",
"title": "Preparing Undergraduates for Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2015/02/mcg2015020016/13rRUxjQyjN",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2012/04/mcg2012040023",
"title": "Extreme-Scale Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2012/04/mcg2012040023/13rRUxjQyxF",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/03/06908006",
"title": "Personal Visualization and Personal Visual Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2015/03/06908006/13rRUyYBlgA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440124",
"title": "VIS4ML: An Ontology for Visual Analytics Assisted Machine Learning",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440124/17D45XfSETS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trex/2020/8514/0/851400a009",
"title": "Beyond Trust Building — Calibrating Trust in Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/trex/2020/851400a009/1pXm2QUw2ek",
"parentPublication": {
"id": "proceedings/trex/2020/8514/0",
"title": "2020 IEEE Workshop on TRust and EXpertise in Visual Analytics (TREX)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trex/2021/1817/0/181700a014",
"title": "Making and Trusting Decisions in Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/trex/2021/181700a014/1yQB6h3HL6o",
"parentPublication": {
"id": "proceedings/trex/2021/1817/0",
"title": "2021 IEEE Workshop on TRust and EXpertise in Visual Analytics (TREX)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09693369",
"articleId": "1As7DDTGAow",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09693362",
"articleId": "1As7BDUnVLi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRo",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1KpxdALb4By",
"doi": "10.1109/TVCG.2023.3241581",
"abstract": "Analyzing user behavior from usability evaluation can be a challenging and time-consuming task, especially as the number of participants and the scale and complexity of the evaluation grows. We propose UXSENSE, a visual analytics system using machine learning methods to extract user behavior from audio and video recordings as parallel time-stamped data streams. Our implementation draws on pattern recognition, computer vision, natural language processing, and machine learning to extract user sentiment, actions, posture, spoken words, and other features from such recordings. These streams are visualized as parallel timelines in a web-based front-end, enabling the researcher to search, filter, and annotate data across time and space. We present the results of a user study involving professional UX researchers evaluating user data using uxSense. In fact, we used uxSense itself to evaluate their sessions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Analyzing user behavior from usability evaluation can be a challenging and time-consuming task, especially as the number of participants and the scale and complexity of the evaluation grows. We propose UXSENSE, a visual analytics system using machine learning methods to extract user behavior from audio and video recordings as parallel time-stamped data streams. Our implementation draws on pattern recognition, computer vision, natural language processing, and machine learning to extract user sentiment, actions, posture, spoken words, and other features from such recordings. These streams are visualized as parallel timelines in a web-based front-end, enabling the researcher to search, filter, and annotate data across time and space. We present the results of a user study involving professional UX researchers evaluating user data using uxSense. In fact, we used uxSense itself to evaluate their sessions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Analyzing user behavior from usability evaluation can be a challenging and time-consuming task, especially as the number of participants and the scale and complexity of the evaluation grows. We propose UXSENSE, a visual analytics system using machine learning methods to extract user behavior from audio and video recordings as parallel time-stamped data streams. Our implementation draws on pattern recognition, computer vision, natural language processing, and machine learning to extract user sentiment, actions, posture, spoken words, and other features from such recordings. These streams are visualized as parallel timelines in a web-based front-end, enabling the researcher to search, filter, and annotate data across time and space. We present the results of a user study involving professional UX researchers evaluating user data using uxSense. In fact, we used uxSense itself to evaluate their sessions.",
"title": "uxSense: Supporting User Experience Analysis with Visualization and Computer Vision",
"normalizedTitle": "uxSense: Supporting User Experience Analysis with Visualization and Computer Vision",
"fno": "10034833",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Annotations",
"Data Visualization",
"Feature Extraction",
"Usability",
"Visual Analytics",
"Measurement",
"Gaze Tracking",
"Visualization",
"Visual Analytics",
"Evaluation",
"Video Analytics",
"Machine Learning",
"Deep Learning",
"Computer Vision"
],
"authors": [
{
"givenName": "Andrea",
"surname": "Batch",
"fullName": "Andrea Batch",
"affiliation": "University of Maryland, College Park, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yipeng",
"surname": "Ji",
"fullName": "Yipeng Ji",
"affiliation": "University of Waterloo, ON, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mingming",
"surname": "Fan",
"fullName": "Mingming Fan",
"affiliation": "Hong Kong University of Science and Technology (Guangzhou) and Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jian",
"surname": "Zhao",
"fullName": "Jian Zhao",
"affiliation": "University of Waterloo, ON, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Niklas",
"surname": "Elmqvist",
"fullName": "Niklas Elmqvist",
"affiliation": "University of Maryland, College Park, MD, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "1-15",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/apsec/2013/2144/1/2144a535",
"title": "Designing User Experience for Mobile Apps: Long-Term Product Owner Perspective",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2013/2144a535/12OmNB7LvCm",
"parentPublication": {
"id": "proceedings/apsec/2013/2144/1",
"title": "2013 20th Asia-Pacific Software Engineering Conference (APSEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sose/2013/4944/0/4944a298",
"title": "Cloud Services for Improved User Experience in Sharing Mobile Videos",
"doi": null,
"abstractUrl": "/proceedings-article/sose/2013/4944a298/12OmNBt3qpi",
"parentPublication": {
"id": "proceedings/sose/2013/4944/0",
"title": "2013 IEEE Seventh International Symposium on Service-Oriented System Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicm/2013/5133/0/5133a013",
"title": "User Experience for Digitization and Preservation of Cultural Heritage",
"doi": null,
"abstractUrl": "/proceedings-article/icicm/2013/5133a013/12OmNwIHoAb",
"parentPublication": {
"id": "proceedings/icicm/2013/5133/0",
"title": "2013 International Conference on Informatics and Creative Multimedia (ICICM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2015/6775/0/6775a019",
"title": "User Experience (UX) of the Fall Risk Assessment Tool (FRAT-up)",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2015/6775a019/12OmNyr8YfB",
"parentPublication": {
"id": "proceedings/cbms/2015/6775/0",
"title": "2015 IEEE 28th International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciibms/2017/6664/0/08279761",
"title": "From usability to user experience",
"doi": null,
"abstractUrl": "/proceedings-article/iciibms/2017/08279761/12OmNzUPpHN",
"parentPublication": {
"id": "proceedings/iciibms/2017/6664/0",
"title": "2017 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aswec/2015/9390/0/9390a175",
"title": "The Next Level of User Experience of Cloud Storage Services: Supporting Collaboration with Social Features",
"doi": null,
"abstractUrl": "/proceedings-article/aswec/2015/9390a175/12OmNzmtWIv",
"parentPublication": {
"id": "proceedings/aswec/2015/9390/0",
"title": "2015 24th Australasian Software Engineering Conference (ASWEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciibms/2018/7516/3/08550019",
"title": "User Experience Evaluation on the Cryptocurrency Website by Trust Aspect",
"doi": null,
"abstractUrl": "/proceedings-article/iciibms/2018/08550019/17D45WZZ7C8",
"parentPublication": {
"id": "proceedings/iciibms/2018/7516/3",
"title": "2018 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-seet/2022/9592/0/959200a146",
"title": "Integrating User Experience into Agile : An Experience Report on Lean UX and Scrum",
"doi": null,
"abstractUrl": "/proceedings-article/icse-seet/2022/959200a146/1EaOSmZQWK4",
"parentPublication": {
"id": "proceedings/icse-seet/2022/9592/0",
"title": "2022 IEEE/ACM 44th International Conference on Software Engineering: Software Engineering Education and Training (ICSE-SEET)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsa/2019/2847/0/284700a065",
"title": "User Experience: A Case Study for Amphibious Operations",
"doi": null,
"abstractUrl": "/proceedings-article/iccsa/2019/284700a065/1dPoRduu3uw",
"parentPublication": {
"id": "proceedings/iccsa/2019/2847/0",
"title": "2019 19th International Conference on Computational Science and Its Applications (ICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icstw/2021/4456/0/445600a247",
"title": "Agents for Automated User Experience Testing",
"doi": null,
"abstractUrl": "/proceedings-article/icstw/2021/445600a247/1tYs8UDbsTC",
"parentPublication": {
"id": "proceedings/icstw/2021/4456/0",
"title": "2021 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10029921",
"articleId": "1KmyX4gJuMg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10034850",
"articleId": "1KpxdJPurhm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1qL5hsvvVkc",
"title": "Feb.",
"year": "2021",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1nTrpup4LZe",
"doi": "10.1109/TVCG.2020.3030361",
"abstract": "In recent years, a wide variety of automated machine learning (AutoML) methods have been proposed to generate end-to-end ML pipelines. While these techniques facilitate the creation of models, given their black-box nature, the complexity of the underlying algorithms, and the large number of pipelines they derive, they are difficult for developers to debug. It is also challenging for machine learning experts to select an AutoML system that is well suited for a given problem. In this paper, we present the Pipeline Profiler, an interactive visualization tool that allows the exploration and comparison of the solution space of machine learning (ML) pipelines produced by AutoML systems. PipelineProfiler is integrated with Jupyter Notebook and can be combined with common data science tools to enable a rich set of analyses of the ML pipelines, providing users a better understanding of the algorithms that generated them as well as insights into how they can be improved. We demonstrate the utility of our tool through use cases where PipelineProfiler is used to better understand and improve a real-world AutoML system. Furthermore, we validate our approach by presenting a detailed analysis of a think-aloud experiment with six data scientists who develop and evaluate AutoML tools.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In recent years, a wide variety of automated machine learning (AutoML) methods have been proposed to generate end-to-end ML pipelines. While these techniques facilitate the creation of models, given their black-box nature, the complexity of the underlying algorithms, and the large number of pipelines they derive, they are difficult for developers to debug. It is also challenging for machine learning experts to select an AutoML system that is well suited for a given problem. In this paper, we present the Pipeline Profiler, an interactive visualization tool that allows the exploration and comparison of the solution space of machine learning (ML) pipelines produced by AutoML systems. PipelineProfiler is integrated with Jupyter Notebook and can be combined with common data science tools to enable a rich set of analyses of the ML pipelines, providing users a better understanding of the algorithms that generated them as well as insights into how they can be improved. We demonstrate the utility of our tool through use cases where PipelineProfiler is used to better understand and improve a real-world AutoML system. Furthermore, we validate our approach by presenting a detailed analysis of a think-aloud experiment with six data scientists who develop and evaluate AutoML tools.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In recent years, a wide variety of automated machine learning (AutoML) methods have been proposed to generate end-to-end ML pipelines. While these techniques facilitate the creation of models, given their black-box nature, the complexity of the underlying algorithms, and the large number of pipelines they derive, they are difficult for developers to debug. It is also challenging for machine learning experts to select an AutoML system that is well suited for a given problem. In this paper, we present the Pipeline Profiler, an interactive visualization tool that allows the exploration and comparison of the solution space of machine learning (ML) pipelines produced by AutoML systems. PipelineProfiler is integrated with Jupyter Notebook and can be combined with common data science tools to enable a rich set of analyses of the ML pipelines, providing users a better understanding of the algorithms that generated them as well as insights into how they can be improved. We demonstrate the utility of our tool through use cases where PipelineProfiler is used to better understand and improve a real-world AutoML system. Furthermore, we validate our approach by presenting a detailed analysis of a think-aloud experiment with six data scientists who develop and evaluate AutoML tools.",
"title": "<italic>PipelineProfiler:</italic> A Visual Analytics Tool for the Exploration of AutoML Pipelines",
"normalizedTitle": "PipelineProfiler: A Visual Analytics Tool for the Exploration of AutoML Pipelines",
"fno": "09222086",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Learning Artificial Intelligence",
"Visual Analytics Tool",
"Auto ML Pipelines",
"Automated Machine Learning Methods",
"End To End ML Pipelines",
"Black Box Nature",
"Pipeline Profiler",
"Interactive Visualization Tool",
"Solution Space",
"Machine Learning Pipelines",
"Data Science Tools",
"Jupyter Notebook",
"Pipelines",
"Tools",
"Visual Analytics",
"Machine Learning",
"Data Visualization",
"Search Problems",
"Correlation",
"Automatic Machine Learning",
"Pipeline Visualization",
"Model Evaluation"
],
"authors": [
{
"givenName": "Jorge Piazentin",
"surname": "Ono",
"fullName": "Jorge Piazentin Ono",
"affiliation": "New York University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sonia",
"surname": "Castelo",
"fullName": "Sonia Castelo",
"affiliation": "New York University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Roque",
"surname": "Lopez",
"fullName": "Roque Lopez",
"affiliation": "New York University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Enrico",
"surname": "Bertini",
"fullName": "Enrico Bertini",
"affiliation": "New York University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Juliana",
"surname": "Freire",
"fullName": "Juliana Freire",
"affiliation": "New York University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Claudio",
"surname": "Silva",
"fullName": "Claudio Silva",
"affiliation": "New York University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "390-400",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bracis/2018/8023/0/802300a121",
"title": "Bandit-Based Automated Machine Learning",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2018/802300a121/17D45VTRoBx",
"parentPublication": {
"id": "proceedings/bracis/2018/8023/0",
"title": "2018 7th Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2021/2427/0/242700a238",
"title": "Stochastic Schemata Exploiter-Based AutoML",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2021/242700a238/1AjSENasAfK",
"parentPublication": {
"id": "proceedings/icdmw/2021/2427/0",
"title": "2021 International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2022/9221/0/922100b932",
"title": "SAPIENTML: Synthesizing Machine Learning Pipelines by Learning from Human-Written Solutions",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2022/922100b932/1Emsk8cWwaA",
"parentPublication": {
"id": "proceedings/icse/2022/9221/0",
"title": "2022 IEEE/ACM 44th International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dasc-picom-cbdcom-cyberscitech/2022/6297/0/09927837",
"title": "DataXc: Flexible and efficient communication in microservices-based stream analytics pipelines",
"doi": null,
"abstractUrl": "/proceedings-article/dasc-picom-cbdcom-cyberscitech/2022/09927837/1J4CxIUBcQw",
"parentPublication": {
"id": "proceedings/dasc-picom-cbdcom-cyberscitech/2022/6297/0",
"title": "2022 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/seaa/2022/6152/0/615200a021",
"title": "WALTS: Walmart AutoML Libraries, Tools and Services",
"doi": null,
"abstractUrl": "/proceedings-article/seaa/2022/615200a021/1JZ5iwD4ypq",
"parentPublication": {
"id": "proceedings/seaa/2022/6152/0",
"title": "2022 48th Euromicro Conference on Software Engineering and Advanced Applications (SEAA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/services/2019/3851/0/385100a335",
"title": "MLModelScope: Evaluate and Introspect Cognitive Pipelines",
"doi": null,
"abstractUrl": "/proceedings-article/services/2019/385100a335/1cTIbYtbuIE",
"parentPublication": {
"id": "proceedings/services/2019/3851/2642-939X",
"title": "2019 IEEE World Congress on Services (SERVICES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09005963",
"title": "Modeling and Forecasting Armed Conflict: AutoML with Human-Guided Machine Learning",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09005963/1hJs1JWYiOY",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2019/3798/0/379800b471",
"title": "Towards Automated Machine Learning: Evaluation and Comparison of AutoML Approaches and Tools",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2019/379800b471/1hrLRPyQ8co",
"parentPublication": {
"id": "proceedings/ictai/2019/3798/0",
"title": "2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2021/09/09321731",
"title": "AutoML for Multi-Label Classification: Overview and Empirical Evaluation",
"doi": null,
"abstractUrl": "/journal/tp/2021/09/09321731/1qmbhpPOIp2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2021/09/09388886",
"title": "Evolving Fully Automated Machine Learning via Life-Long Knowledge Anchors",
"doi": null,
"abstractUrl": "/journal/tp/2021/09/09388886/1smZJB1wYog",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09246282",
"articleId": "1olDLxl43Qc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09222038",
"articleId": "1nTq1lYLbEY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLfXxpJVbG",
"name": "ttg202102-09222086s1-supp1-3030361.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222086s1-supp1-3030361.mp4",
"extension": "mp4",
"size": "128 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xic1bREyqY",
"doi": "10.1109/TVCG.2021.3114822",
"abstract": "Reviewing a think-aloud video is both time-consuming and demanding as it requires UX (user experience) professionals to attend to many behavioral signals of the user in the video. Moreover, challenges arise when multiple UX professionals need to collaborate to reduce bias and errors. We propose a collaborative visual analytics tool, CoUX, to facilitate UX evaluators collectively reviewing think-aloud usability test videos of digital interfaces. CoUX seamlessly supports usability problem identification, annotation, and discussion in an integrated environment. To ease the discovery of usability problems, CoUX visualizes a set of problem-indicators based on acoustic, textual, and visual features extracted from the video and audio of a think-aloud session with machine learning. CoUX further enables collaboration amongst UX evaluators for logging, commenting, and consolidating the discovered problems with a chatbox-like user interface. We designed CoUX based on a formative study with two UX experts and insights derived from the literature. We conducted a user study with six pairs of UX practitioners on collaborative think-aloud video analysis tasks. The results indicate that CoUX is useful and effective in facilitating both problem identification and collaborative teamwork. We provide insights into how different features of CoUX were used to support both independent analysis and collaboration. Furthermore, our work highlights opportunities to improve collaborative usability test video analysis.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Reviewing a think-aloud video is both time-consuming and demanding as it requires UX (user experience) professionals to attend to many behavioral signals of the user in the video. Moreover, challenges arise when multiple UX professionals need to collaborate to reduce bias and errors. We propose a collaborative visual analytics tool, CoUX, to facilitate UX evaluators collectively reviewing think-aloud usability test videos of digital interfaces. CoUX seamlessly supports usability problem identification, annotation, and discussion in an integrated environment. To ease the discovery of usability problems, CoUX visualizes a set of problem-indicators based on acoustic, textual, and visual features extracted from the video and audio of a think-aloud session with machine learning. CoUX further enables collaboration amongst UX evaluators for logging, commenting, and consolidating the discovered problems with a chatbox-like user interface. We designed CoUX based on a formative study with two UX experts and insights derived from the literature. We conducted a user study with six pairs of UX practitioners on collaborative think-aloud video analysis tasks. The results indicate that CoUX is useful and effective in facilitating both problem identification and collaborative teamwork. We provide insights into how different features of CoUX were used to support both independent analysis and collaboration. Furthermore, our work highlights opportunities to improve collaborative usability test video analysis.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Reviewing a think-aloud video is both time-consuming and demanding as it requires UX (user experience) professionals to attend to many behavioral signals of the user in the video. Moreover, challenges arise when multiple UX professionals need to collaborate to reduce bias and errors. We propose a collaborative visual analytics tool, CoUX, to facilitate UX evaluators collectively reviewing think-aloud usability test videos of digital interfaces. CoUX seamlessly supports usability problem identification, annotation, and discussion in an integrated environment. To ease the discovery of usability problems, CoUX visualizes a set of problem-indicators based on acoustic, textual, and visual features extracted from the video and audio of a think-aloud session with machine learning. CoUX further enables collaboration amongst UX evaluators for logging, commenting, and consolidating the discovered problems with a chatbox-like user interface. We designed CoUX based on a formative study with two UX experts and insights derived from the literature. We conducted a user study with six pairs of UX practitioners on collaborative think-aloud video analysis tasks. The results indicate that CoUX is useful and effective in facilitating both problem identification and collaborative teamwork. We provide insights into how different features of CoUX were used to support both independent analysis and collaboration. Furthermore, our work highlights opportunities to improve collaborative usability test video analysis.",
"title": "CoUX: Collaborative Visual Analysis of Think-Aloud Usability Test Videos for Digital Interfaces",
"normalizedTitle": "CoUX: Collaborative Visual Analysis of Think-Aloud Usability Test Videos for Digital Interfaces",
"fno": "09552211",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Collaboration",
"Usability",
"Videos",
"Feature Extraction",
"Tools",
"Acoustics",
"Machine Learning",
"User Experience",
"Usability Problems",
"Think Aloud",
"Video Analysis",
"Machine Learning",
"Visual Analytics",
"Collaboration"
],
"authors": [
{
"givenName": "Ehsan Jahangirzadeh",
"surname": "Soure",
"fullName": "Ehsan Jahangirzadeh Soure",
"affiliation": "University of Waterloo, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Emily",
"surname": "Kuang",
"fullName": "Emily Kuang",
"affiliation": "Rochester Institute of Technology, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mingming",
"surname": "Fan",
"fullName": "Mingming Fan",
"affiliation": "Rochester Institute of Technology, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jian",
"surname": "Zhao",
"fullName": "Jian Zhao",
"affiliation": "University of Waterloo, Canada",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "643-653",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hcc/2002/1644/0/16440063",
"title": "Assertions in End-User Software Engineering: A Think-Aloud Study",
"doi": null,
"abstractUrl": "/proceedings-article/hcc/2002/16440063/12OmNqFJhX2",
"parentPublication": {
"id": "proceedings/hcc/2002/1644/0",
"title": "Proceedings IEEE 2002 Symposia on Human Centric Computing Languages and Environments",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipcc/2005/9027/0/01494192",
"title": "Analyzing the interaction between facilitator and participants in two variants of the think-aloud method",
"doi": null,
"abstractUrl": "/proceedings-article/ipcc/2005/01494192/12OmNqNos9s",
"parentPublication": {
"id": "proceedings/ipcc/2005/9027/0",
"title": "2005 IEEE International Professional Communication Conference (IPCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccea/2010/6079/1/05445788",
"title": "Why Thinking Aloud Matters for Usability Evaluation?",
"doi": null,
"abstractUrl": "/proceedings-article/iccea/2010/05445788/12OmNxEBzjY",
"parentPublication": {
"id": "proceedings/iccea/2010/6079/1",
"title": "2010 Second International Conference on Computer Engineering and Applications (ICCEA 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipcc/2005/9027/0/01494236",
"title": "Using eye tracking to address limitations in think-aloud protocol",
"doi": null,
"abstractUrl": "/proceedings-article/ipcc/2005/01494236/12OmNzUPpAh",
"parentPublication": {
"id": "proceedings/ipcc/2005/9027/0",
"title": "2005 IEEE International Professional Communication Conference (IPCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vs-games/2018/7123/0/08493446",
"title": "Using Think-Aloud Protocol in Looking at the Framing of One's Character with a Case Study on Terraria",
"doi": null,
"abstractUrl": "/proceedings-article/vs-games/2018/08493446/14tNJndEsts",
"parentPublication": {
"id": "proceedings/vs-games/2018/7123/0",
"title": "2018 10th International Conference on Virtual Worlds and Games for Serious Applications (VS-Games)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2022/6244/0/09962750",
"title": "Improving engineering students’ problem-solving skills through think-aloud exercises",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2022/09962750/1IHnBWIc9RC",
"parentPublication": {
"id": "proceedings/fie/2022/6244/0",
"title": "2022 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/conisoft/2022/6126/0/612600a168",
"title": "Using Think Aloud for Eliciting Requirements for a Reading Comprehension Software Tool",
"doi": null,
"abstractUrl": "/proceedings-article/conisoft/2022/612600a168/1LFLw98OgyQ",
"parentPublication": {
"id": "proceedings/conisoft/2022/6126/0",
"title": "2022 10th International Conference in Software Engineering Research and Innovation (CONISOFT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807301",
"title": "<bold>VisTA</bold>: Integrating Machine Intelligence with <bold>Vis</bold>ualization to Support the Investigation of <bold>T</bold>hink-<bold>A</bold>loud Sessions",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807301/1cG6uY7sFEs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2019/1746/0/09028567",
"title": "Engineering Ph.D. Students’ Research Experiences: A Think-Aloud Study",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2019/09028567/1iffvltOibK",
"parentPublication": {
"id": "proceedings/fie/2019/1746/0",
"title": "2019 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis-fall/2021/7679/0/09627365",
"title": "Assessing Computational Thinking Pedagogy in Serious Games Through Questionnaires, Think-aloud Testing, and Automated Data Logging",
"doi": null,
"abstractUrl": "/proceedings-article/icis-fall/2021/09627365/1z7dLTPd7nG",
"parentPublication": {
"id": "proceedings/icis-fall/2021/7679/0",
"title": "2021 IEEE/ACIS 20th International Fall Conference on Computer and Information Science (ICIS Fall)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552233",
"articleId": "1xic56YNRyU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09572234",
"articleId": "1xH5FXdMnoA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zBaETWukEM",
"name": "ttg202201-09552211s1-supp1-3114822.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09552211s1-supp1-3114822.mp4",
"extension": "mp4",
"size": "41.3 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAPBbfM",
"title": "Oct.",
"year": "2019",
"issueNum": "10",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1cYd7bZMLp6",
"doi": "10.1109/TVCG.2018.2859973",
"abstract": "Five years after the first state-of-the-art report on Commercial Visual Analytics Systems we present a reevaluation of the Big Data Analytics field. We build on the success of the 2012 survey, which was influential even beyond the boundaries of the InfoVis and Visual Analytics (VA) community. While the field has matured significantly since the original survey, we find that innovation and research-driven development are increasingly sacrificed to satisfy a wide range of user groups. We evaluate new product versions on established evaluation criteria, such as available features, performance, and usability, to extend on and assure comparability with the previous survey. We also investigate previously unavailable products to paint a more complete picture of the commercial VA landscape. Furthermore, we introduce novel measures, like suitability for specific user groups and the ability to handle complex data types, and undertake a new case study to highlight innovative features. We explore the achievements in the commercial sector in addressing VA challenges and propose novel developments that should be on systems' roadmaps in the coming years.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Five years after the first state-of-the-art report on Commercial Visual Analytics Systems we present a reevaluation of the Big Data Analytics field. We build on the success of the 2012 survey, which was influential even beyond the boundaries of the InfoVis and Visual Analytics (VA) community. While the field has matured significantly since the original survey, we find that innovation and research-driven development are increasingly sacrificed to satisfy a wide range of user groups. We evaluate new product versions on established evaluation criteria, such as available features, performance, and usability, to extend on and assure comparability with the previous survey. We also investigate previously unavailable products to paint a more complete picture of the commercial VA landscape. Furthermore, we introduce novel measures, like suitability for specific user groups and the ability to handle complex data types, and undertake a new case study to highlight innovative features. We explore the achievements in the commercial sector in addressing VA challenges and propose novel developments that should be on systems' roadmaps in the coming years.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Five years after the first state-of-the-art report on Commercial Visual Analytics Systems we present a reevaluation of the Big Data Analytics field. We build on the success of the 2012 survey, which was influential even beyond the boundaries of the InfoVis and Visual Analytics (VA) community. While the field has matured significantly since the original survey, we find that innovation and research-driven development are increasingly sacrificed to satisfy a wide range of user groups. We evaluate new product versions on established evaluation criteria, such as available features, performance, and usability, to extend on and assure comparability with the previous survey. We also investigate previously unavailable products to paint a more complete picture of the commercial VA landscape. Furthermore, we introduce novel measures, like suitability for specific user groups and the ability to handle complex data types, and undertake a new case study to highlight innovative features. We explore the achievements in the commercial sector in addressing VA challenges and propose novel developments that should be on systems' roadmaps in the coming years.",
"title": "Commercial Visual Analytics Systems–Advances in the Big Data Analytics Field",
"normalizedTitle": "Commercial Visual Analytics Systems–Advances in the Big Data Analytics Field",
"fno": "08423105",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Big Data",
"Data Analysis",
"Data Visualisation",
"Commercial Sector",
"Visual Analytics Systems",
"Big Data Analytics",
"Info Vis",
"Data Visualization",
"Visual Analytics",
"Big Data",
"Business",
"Data Analysis",
"Technological Innovation",
"Usability",
"System Comparison",
"Commercial Landscape",
"Visual Analytics Research",
"Advances",
"Development Roadmap"
],
"authors": [
{
"givenName": "Michael",
"surname": "Behrisch",
"fullName": "Michael Behrisch",
"affiliation": "Harvard University, Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dirk",
"surname": "Streeb",
"fullName": "Dirk Streeb",
"affiliation": "University of Konstanz, Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Florian",
"surname": "Stoffel",
"fullName": "Florian Stoffel",
"affiliation": "University of Konstanz, Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Seebacher",
"fullName": "Daniel Seebacher",
"affiliation": "University of Konstanz, Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Brian",
"surname": "Matejek",
"fullName": "Brian Matejek",
"affiliation": "Harvard University, Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefan Hagen",
"surname": "Weber",
"fullName": "Stefan Hagen Weber",
"affiliation": "Siemens AG, Corporate Research Germany, Munich, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sebastian",
"surname": "Mittelstadt",
"fullName": "Sebastian Mittelstadt",
"affiliation": "Siemens AG, Corporate Research Germany, Munich, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanspeter",
"surname": "Pfister",
"fullName": "Hanspeter Pfister",
"affiliation": "Harvard University, Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Keim",
"fullName": "Daniel Keim",
"affiliation": "University of Konstanz, Konstanz, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2019-10-01 00:00:00",
"pubType": "trans",
"pages": "3011-3031",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vast/2012/4752/0/06400554",
"title": "Visual analytics for the big data era — A comparative review of state-of-the-art commercial systems",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2012/06400554/12OmNBPc8qK",
"parentPublication": {
"id": "proceedings/vast/2012/4752/0",
"title": "2012 IEEE Conference on Visual Analytics Science and Technology (VAST 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/re/2013/5765/0/06636762",
"title": "Visual analytics for software requirements engineering",
"doi": null,
"abstractUrl": "/proceedings-article/re/2013/06636762/12OmNrJ11yp",
"parentPublication": {
"id": "proceedings/re/2013/5765/0",
"title": "2013 IEEE 21st International Requirements Engineering Conference (RE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2013/4892/0/4892c416",
"title": "Visual Analytics for Public Health: Supporting Knowledge Construction and Decision-Making",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2013/4892c416/12OmNrJiCNq",
"parentPublication": {
"id": "proceedings/hicss/2013/4892/0",
"title": "2013 46th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2012/04/mcg2012040026",
"title": "A Graph Algebra for Scalable Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2012/04/mcg2012040026/13rRUILLkpN",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2012/04/mcg2012040063",
"title": "The Top 10 Challenges in Extreme-Scale Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2012/04/mcg2012040063/13rRUxC0SGA",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2012/04/mcg2012040023",
"title": "Extreme-Scale Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2012/04/mcg2012040023/13rRUxjQyxF",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09906559",
"title": "In Defence of Visual Analytics Systems: Replies to Critics",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09906559/1H5F2wJXT4Q",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805439",
"title": "The Validity, Generalizability and Feasibility of Summative Evaluation Methods in Visual Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805439/1cG4DVd6FcQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trex/2020/8514/0/851400a009",
"title": "Beyond Trust Building — Calibrating Trust in Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/trex/2020/851400a009/1pXm2QUw2ek",
"parentPublication": {
"id": "proceedings/trex/2020/8514/0",
"title": "2020 IEEE Workshop on TRust and EXpertise in Visual Analytics (TREX)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a368",
"title": "A Characterization of Data Exchange between Visual Analytics Tools",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a368/1rSRaA2LJBK",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08425577",
"articleId": "1cYd84B0UEw",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08423201",
"articleId": "1cYd4WbM0mY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i4pC0zrpSM",
"name": "ttg201910-08423105s1.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201910-08423105s1.pdf",
"extension": "pdf",
"size": "320 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1D81g68Z5ra",
"title": "June",
"year": "2022",
"issueNum": "06",
"idPrefix": "tm",
"pubType": "journal",
"volume": "21",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1oiju70FzDG",
"doi": "10.1109/TMC.2020.3034354",
"abstract": "Among all the road accidents, speeding is the most deadly factor. To reduce speeding, it is essential to devise efficient schemes for ubiquitous speed monitoring. Traditional approaches either suffers from using special equipment(e.g., radar speed gun) or special deployment(e.g., position-fixed cameras). In this article, we propose SpeedTalker, a mobile phone-based approach to perform speed detection on automobiles. By leveraging the built-in microphones and camera from the mobile phone, SpeedTalker estimates the automobile speed by passively sensing the acoustic and image signals. We propose an integrated solution to effectively estimate the automobile’s speed based on COTS devices, and provide a platform for every pedestrian to help report the speeding event of automobiles. Specifically, we use the time difference of arrivals (TDOA) model based on acoustic signals to figure out the candidate trajectories of automobile, and use the pin-hole model based on image frames to figure out the vertical distance between the user’s position and the automobile’s trajectory, thus to estimate the unique trajectory. Combined with the time stamp of the trajectory, the automobile speed can be estimated. Besides, we propose a method to effectively mitigate the influence of the movement jitters of mobile phone. We implemented a system prototype for SpeedTalker and estimated the automobile speed with high accuracy. Experiment results show that in the scenario of single automobile, SpeedTalker can achieve an average estimation error of 6.1 percent compared to radar speed guns. In the scenario of multiple automobiles, SpeedTalker can achieve an average estimation error of 9.8 percent, which is acceptable for usage.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Among all the road accidents, speeding is the most deadly factor. To reduce speeding, it is essential to devise efficient schemes for ubiquitous speed monitoring. Traditional approaches either suffers from using special equipment(e.g., radar speed gun) or special deployment(e.g., position-fixed cameras). In this article, we propose SpeedTalker, a mobile phone-based approach to perform speed detection on automobiles. By leveraging the built-in microphones and camera from the mobile phone, SpeedTalker estimates the automobile speed by passively sensing the acoustic and image signals. We propose an integrated solution to effectively estimate the automobile’s speed based on COTS devices, and provide a platform for every pedestrian to help report the speeding event of automobiles. Specifically, we use the time difference of arrivals (TDOA) model based on acoustic signals to figure out the candidate trajectories of automobile, and use the pin-hole model based on image frames to figure out the vertical distance between the user’s position and the automobile’s trajectory, thus to estimate the unique trajectory. Combined with the time stamp of the trajectory, the automobile speed can be estimated. Besides, we propose a method to effectively mitigate the influence of the movement jitters of mobile phone. We implemented a system prototype for SpeedTalker and estimated the automobile speed with high accuracy. Experiment results show that in the scenario of single automobile, SpeedTalker can achieve an average estimation error of 6.1 percent compared to radar speed guns. In the scenario of multiple automobiles, SpeedTalker can achieve an average estimation error of 9.8 percent, which is acceptable for usage.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Among all the road accidents, speeding is the most deadly factor. To reduce speeding, it is essential to devise efficient schemes for ubiquitous speed monitoring. Traditional approaches either suffers from using special equipment(e.g., radar speed gun) or special deployment(e.g., position-fixed cameras). In this article, we propose SpeedTalker, a mobile phone-based approach to perform speed detection on automobiles. By leveraging the built-in microphones and camera from the mobile phone, SpeedTalker estimates the automobile speed by passively sensing the acoustic and image signals. We propose an integrated solution to effectively estimate the automobile’s speed based on COTS devices, and provide a platform for every pedestrian to help report the speeding event of automobiles. Specifically, we use the time difference of arrivals (TDOA) model based on acoustic signals to figure out the candidate trajectories of automobile, and use the pin-hole model based on image frames to figure out the vertical distance between the user’s position and the automobile’s trajectory, thus to estimate the unique trajectory. Combined with the time stamp of the trajectory, the automobile speed can be estimated. Besides, we propose a method to effectively mitigate the influence of the movement jitters of mobile phone. We implemented a system prototype for SpeedTalker and estimated the automobile speed with high accuracy. Experiment results show that in the scenario of single automobile, SpeedTalker can achieve an average estimation error of 6.1 percent compared to radar speed guns. In the scenario of multiple automobiles, SpeedTalker can achieve an average estimation error of 9.8 percent, which is acceptable for usage.",
"title": "SpeedTalker: Automobile Speed Estimation via Mobile Phones",
"normalizedTitle": "SpeedTalker: Automobile Speed Estimation via Mobile Phones",
"fno": "09242267",
"hasPdf": true,
"idPrefix": "tm",
"keywords": [
"Acoustic Signal Processing",
"Automobiles",
"Calibration",
"Cameras",
"Cellular Radio",
"Image Sensors",
"Jitter",
"Microphones",
"Mobile Computing",
"Mobile Handsets",
"Road Accidents",
"Road Safety",
"Road Vehicles",
"Time Of Arrival Estimation",
"Traffic Engineering Computing",
"Multiple Automobiles",
"Speed Talker",
"Average Estimation Error",
"Automobile Speed Estimation",
"Ubiquitous Speed Monitoring",
"Radar Speed Gun",
"Mobile Phone Based Approach",
"Speed Detection",
"Speeding Event",
"Single Automobile",
"Efficiency 6 1 Percent",
"Efficiency 9 8 Percent",
"Automobiles",
"Cameras",
"Mobile Handsets",
"Acoustics",
"Microphones",
"Trajectory",
"Sensors",
"Automobile Speed Estimation",
"Microphone",
"Camera",
"TDOA"
],
"authors": [
{
"givenName": "Xinran",
"surname": "Lu",
"fullName": "Xinran Lu",
"affiliation": "State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lei",
"surname": "Xie",
"fullName": "Lei Xie",
"affiliation": "State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yafeng",
"surname": "Yin",
"fullName": "Yafeng Yin",
"affiliation": "State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Wang",
"fullName": "Wei Wang",
"affiliation": "State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yanling",
"surname": "Bu",
"fullName": "Yanling Bu",
"affiliation": "State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qing",
"surname": "Guo",
"fullName": "Qing Guo",
"affiliation": "State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sanglu",
"surname": "Lu",
"fullName": "Sanglu Lu",
"affiliation": "State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2022-06-01 00:00:00",
"pubType": "trans",
"pages": "2210-2227",
"year": "2022",
"issn": "1536-1233",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icitbs/2015/0464/0/0464a637",
"title": "Research on Detection System of Automobile Flat Slab Brake Tester",
"doi": null,
"abstractUrl": "/proceedings-article/icitbs/2015/0464a637/12OmNAlvHRU",
"parentPublication": {
"id": "proceedings/icitbs/2015/0464/0",
"title": "2015 International Conference on Intelligent Transportation, Big Data & Smart City (ICITBS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icinis/2012/4855/0/4855a199",
"title": "Automobile Anti-theft System Based on GSM and GPS Module",
"doi": null,
"abstractUrl": "/proceedings-article/icinis/2012/4855a199/12OmNqBtiKt",
"parentPublication": {
"id": "proceedings/icinis/2012/4855/0",
"title": "Intelligent Networks and Intelligent Systems, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gcis/2009/3571/2/3571b228",
"title": "Control Strategy Research and Simulation Analysis of Electric Power Steering System for Automobile",
"doi": null,
"abstractUrl": "/proceedings-article/gcis/2009/3571b228/12OmNqzu6J2",
"parentPublication": {
"id": "proceedings/gcis/2009/3571/2",
"title": "2009 WRI Global Congress on Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2011/4296/3/4296e236",
"title": "Simulated Analysis on the Automobile Body Electrical Control System Based on CAN-LIN Bus",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2011/4296e236/12OmNrAv3XE",
"parentPublication": {
"id": "proceedings/icmtma/2011/4296/3",
"title": "2011 Third International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2010/4077/3/4077e568",
"title": "Study on the Automobile Safe Speed at Rapid Steering",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2010/4077e568/12OmNwEJ0X3",
"parentPublication": {
"id": "proceedings/icicta/2010/4077/3",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2014/4261/0/4261a238",
"title": "Automobile Motion Posture Monitoring Based on Stereo Vision Technology",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2014/4261a238/12OmNwseEVn",
"parentPublication": {
"id": "proceedings/isdea/2014/4261/0",
"title": "2014 Fifth International Conference on Intelligent Systems Design and Engineering Applications (ISDEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcsw/2004/2087/5/208750610",
"title": "An Adaptive Automobile Control System Using Scheduling by Imprecise Computation and Multiagent-Based Traffic Information Exchange and Its Experimental Evaluation",
"doi": null,
"abstractUrl": "/proceedings-article/icdcsw/2004/208750610/12OmNyv7mns",
"parentPublication": {
"id": "proceedings/icdcsw/2004/2087/5",
"title": "24th International Conference on Distributed Computing Systems Workshops, 2004. Proceedings.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wceea/2022/5952/0/595200a141",
"title": "Analysis on the Change of the Electromagnetic Compatibility Test Method of Automobile and Parts based on the of the Changes in ECE R10",
"doi": null,
"abstractUrl": "/proceedings-article/wceea/2022/595200a141/1J7WJHqDjuE",
"parentPublication": {
"id": "proceedings/wceea/2022/5952/0",
"title": "2022 International Conference on Wireless Communications, Electrical Engineering and Automation (WCEEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiotbdsc/2022/5455/0/545500a278",
"title": "Risk Warning and Prevention of Supply Chain in Automobile Industry Based on Data Mining Technology",
"doi": null,
"abstractUrl": "/proceedings-article/iiotbdsc/2022/545500a278/1LKwUOlMghi",
"parentPublication": {
"id": "proceedings/iiotbdsc/2022/5455/0",
"title": "2022 International Conference on Industrial IoT, Big Data and Supply Chain (IIoTBDSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fcsit/2022/6353/0/635300a225",
"title": "Brief Comments to Different Kinds of Hybrid systems of some Chinese Automobile Brands",
"doi": null,
"abstractUrl": "/proceedings-article/fcsit/2022/635300a225/1Ml2e1jagDe",
"parentPublication": {
"id": "proceedings/fcsit/2022/6353/0",
"title": "2022 Euro-Asia Conference on Frontiers of Computer Science and Information Technology (FCSIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09246290",
"articleId": "1olDyULxEek",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09240060",
"articleId": "1oeZCXPA94Q",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqzu6X1",
"title": "November/December",
"year": "2017",
"issueNum": "06",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "37",
"label": "November/December",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBJhoW",
"doi": "10.1109/MCG.2017.4031058",
"abstract": "The paper proposes a graphical method called the CI thermometer that facilitates the analysis of bivariate relations among many variables. The CI thermometer will help scientists present correlation matrices accompanied by additional information on confidence intervals.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The paper proposes a graphical method called the CI thermometer that facilitates the analysis of bivariate relations among many variables. The CI thermometer will help scientists present correlation matrices accompanied by additional information on confidence intervals.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The paper proposes a graphical method called the CI thermometer that facilitates the analysis of bivariate relations among many variables. The CI thermometer will help scientists present correlation matrices accompanied by additional information on confidence intervals.",
"title": "CI Thermometer: Visualizing Confidence Intervals in Correlation Analysis",
"normalizedTitle": "CI Thermometer: Visualizing Confidence Intervals in Correlation Analysis",
"fno": "mcg2017060103",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Matrix Algebra",
"Statistical Analysis",
"CI Thermometer",
"Bivariate Relations Analysis",
"Correlation Matrices",
"Confidence Intervals",
"Correlation Coefficient",
"Thermostats",
"Color",
"Data Visualization",
"Visualization",
"Computer Graphics",
"Visualization",
"CI Thermometer",
"Confidence Intervals",
"Correlation Analysis",
"Correlation Matrix"
],
"authors": [
{
"givenName": "Agnieszka",
"surname": "Wnuk",
"fullName": "Agnieszka Wnuk",
"affiliation": "Warsaw University of Life Sciences",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Konrad J.",
"surname": "Debski",
"fullName": "Konrad J. Debski",
"affiliation": "Polish Academy of Sciences",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marcin",
"surname": "Kozak",
"fullName": "Marcin Kozak",
"affiliation": "University of Information Technology and Management in Rzeszów",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2017-11-01 00:00:00",
"pubType": "mags",
"pages": "103-108",
"year": "2017",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vast/2014/6227/0/07042515",
"title": "Visualizing the effects of scale and geography in multivariate comparison",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042515/12OmNvEhfZc",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbd/2017/1072/0/1072a337",
"title": "PixVid: Capturing Temporal Correlated Changes in Time Series",
"doi": null,
"abstractUrl": "/proceedings-article/cbd/2017/1072a337/12OmNzTYCbj",
"parentPublication": {
"id": "proceedings/cbd/2017/1072/0",
"title": "2017 Fifth International Conference on Advanced Cloud and Big Data (CBD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2013/0015/0/06607444",
"title": "Background music recommendation for video based on multimodal latent semantic analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2013/06607444/12OmNzVXNIB",
"parentPublication": {
"id": "proceedings/icme/2013/0015/0",
"title": "2013 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2013/4797/0/06596146",
"title": "Visualizing edge-edge relations in graphs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2013/06596146/12OmNzsJ7ya",
"parentPublication": {
"id": "proceedings/pacificvis/2013/4797/0",
"title": "2013 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssiai/2018/6568/0/08470308",
"title": "On the Natural Statistics of Chromatic Images",
"doi": null,
"abstractUrl": "/proceedings-article/ssiai/2018/08470308/13WBGTItFGY",
"parentPublication": {
"id": "proceedings/ssiai/2018/6568/0",
"title": "2018 IEEE Southwest Symposium on Image Analysis and Interpretation (SSIAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192661",
"title": "Beyond Weber's Law: A Second Look at Ranking Visualizations of Correlation",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192661/13rRUxBa5c2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192624",
"title": "Visualizing Tensor Normal Distributions at Multiple Levels of Detail",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192624/13rRUxBrGh2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/11/ttg2013111948",
"title": "Visualizing the Variability of Gradients in Uncertain 2D Scalar Fields",
"doi": null,
"abstractUrl": "/journal/tg/2013/11/ttg2013111948/13rRUy0qnGm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a145",
"title": "Visualizing Confidence Intervals for Critical Point Probabilities in 2D Scalar Field Ensembles",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a145/1J6h7HNSI0g",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/04/09200781",
"title": "TimeTubesX: A Query-Driven Visual Exploration of Observable, Photometric, and Polarimetric Behaviors of Blazars",
"doi": null,
"abstractUrl": "/journal/tg/2022/04/09200781/1ndVp1lQ8eI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2017060102",
"articleId": "13rRUxBJhxM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg20170600c4",
"articleId": "13rRUxDItla",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyRxFj0",
"title": "March",
"year": "2018",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxZzAhK",
"doi": "10.1109/TVCG.2017.2661309",
"abstract": "Parallel coordinates plots (PCPs) are a well-studied technique for exploring multi-attribute datasets. In many situations, users find them a flexible method to analyze and interact with data. Unfortunately, using PCPs becomes challenging as the number of data items grows large or multiple trends within the data mix in the visualization. The resulting overdraw can obscure important features. A number of modifications to PCPs have been proposed, including using color, opacity, smooth curves, frequency, density, and animation to mitigate this problem. However, these modified PCPs tend to have their own limitations in the kinds of relationships they emphasize. We propose a new data scalable design for representing and exploring data relationships in PCPs. The approach exploits the point/line duality property of PCPs and a local linear assumption of data to extract and represent relationship summarizations. This approach simultaneously shows relationships in the data and the consistency of those relationships. Our approach supports various visualization tasks, including mixed linear and nonlinear pattern identification, noise detection, and outlier detection, all in large data. We demonstrate these tasks on multiple synthetic and real-world datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Parallel coordinates plots (PCPs) are a well-studied technique for exploring multi-attribute datasets. In many situations, users find them a flexible method to analyze and interact with data. Unfortunately, using PCPs becomes challenging as the number of data items grows large or multiple trends within the data mix in the visualization. The resulting overdraw can obscure important features. A number of modifications to PCPs have been proposed, including using color, opacity, smooth curves, frequency, density, and animation to mitigate this problem. However, these modified PCPs tend to have their own limitations in the kinds of relationships they emphasize. We propose a new data scalable design for representing and exploring data relationships in PCPs. The approach exploits the point/line duality property of PCPs and a local linear assumption of data to extract and represent relationship summarizations. This approach simultaneously shows relationships in the data and the consistency of those relationships. Our approach supports various visualization tasks, including mixed linear and nonlinear pattern identification, noise detection, and outlier detection, all in large data. We demonstrate these tasks on multiple synthetic and real-world datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Parallel coordinates plots (PCPs) are a well-studied technique for exploring multi-attribute datasets. In many situations, users find them a flexible method to analyze and interact with data. Unfortunately, using PCPs becomes challenging as the number of data items grows large or multiple trends within the data mix in the visualization. The resulting overdraw can obscure important features. A number of modifications to PCPs have been proposed, including using color, opacity, smooth curves, frequency, density, and animation to mitigate this problem. However, these modified PCPs tend to have their own limitations in the kinds of relationships they emphasize. We propose a new data scalable design for representing and exploring data relationships in PCPs. The approach exploits the point/line duality property of PCPs and a local linear assumption of data to extract and represent relationship summarizations. This approach simultaneously shows relationships in the data and the consistency of those relationships. Our approach supports various visualization tasks, including mixed linear and nonlinear pattern identification, noise detection, and outlier detection, all in large data. We demonstrate these tasks on multiple synthetic and real-world datasets.",
"title": "DSPCP: A Data Scalable Approach for Identifying Relationships in Parallel Coordinates",
"normalizedTitle": "DSPCP: A Data Scalable Approach for Identifying Relationships in Parallel Coordinates",
"fno": "07836349",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Market Research",
"Data Visualization",
"Correlation",
"Visualization",
"Shape",
"Histograms",
"Encoding",
"Correlation",
"Parallel Coordinates Plot",
"Large Data Visualization"
],
"authors": [
{
"givenName": "Hoa",
"surname": "Nguyen",
"fullName": "Hoa Nguyen",
"affiliation": "Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, UT",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Paul",
"surname": "Rosen",
"fullName": "Paul Rosen",
"affiliation": "Department of Computer Science and Engineering, University of South Florida, Tampa, FL",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2018-03-01 00:00:00",
"pubType": "trans",
"pages": "1301-1315",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2014/4103/0/4103a007",
"title": "Spectral-Based Contractible Parallel Coordinates",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2014/4103a007/12OmNCgrDcV",
"parentPublication": {
"id": "proceedings/iv/2014/4103/0",
"title": "2014 18th International Conference on Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2017/4822/0/482201a419",
"title": "Segmental Offset-Mapping Parallel Coordinates for Multidimensional Integer Dataset",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2017/482201a419/12OmNyrqzG9",
"parentPublication": {
"id": "proceedings/cis/2017/4822/0",
"title": "2017 13th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122080",
"title": "Interactive Exploration of Implicit and Explicit Relations in Faceted Datasets",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122080/13rRUwI5U2F",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192696",
"title": "Orientation-Enhanced Parallel Coordinate Plots",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192696/13rRUwkxc5q",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/09/ttg2013091526",
"title": "Splatterplots: Overcoming Overdraw in Scatter Plots",
"doi": null,
"abstractUrl": "/journal/tg/2013/09/ttg2013091526/13rRUxC0SEh",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061436",
"title": "Extensions of Parallel Coordinates for Interactive Exploration of Large Multi-Timepoint Data Sets",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061436/13rRUxjQyp8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875982",
"title": "Visual Abstraction and Exploration of Multi-class Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875982/13rRUygT7ye",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933632",
"title": "Conditional Parallel Coordinates",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933632/1fTgJgZx0go",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/escience/2019/2451/0/245100a339",
"title": "Enhanced Interactive Parallel Coordinates using Machine Learning and Uncertainty Propagation for Engineering Design",
"doi": null,
"abstractUrl": "/proceedings-article/escience/2019/245100a339/1ike4FtETzW",
"parentPublication": {
"id": "proceedings/escience/2019/2451/0",
"title": "2019 15th International Conference on eScience (eScience)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09555226",
"title": "SightBi: Exploring Cross-View Data Relationships with Biclusters",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09555226/1xjQVmm2wE0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07847429",
"articleId": "13rRUygBw7h",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07875127",
"articleId": "13rRUxly9e0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgRl",
"name": "ttg201803-07836349s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201803-07836349s1.zip",
"extension": "zip",
"size": "15.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBpEeNH",
"title": "Jan.",
"year": "2015",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "21",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyYjKah",
"doi": "10.1109/TVCG.2014.2329308",
"abstract": "GPS, RFID, and other technologies have made it increasingly common to track the positions of people and objects over time as they move through two-dimensional spaces. Visualizing such spatio-temporal movement data is challenging because each person or object involves three variables (two spatial variables as a function of the time variable), and simply plotting the data on a 2D geographic map can result in overplotting and occlusion that hides details. This also makes it difficult to understand correlations between space and time. Software such as GeoTime can display such data with a three-dimensional visualization, where the 3rd dimension is used for time. This allows for the disambiguation of spatially overlapping trajectories, and in theory, should make the data clearer. However, previous experimental comparisons of 2D and 3D visualizations have so far found little advantage in 3D visualizations, possibly due to the increased complexity of navigating and understanding a 3D view. We present a new controlled experimental comparison of 2D and 3D visualizations, involving commonly performed tasks that have not been tested before, and find advantages in 3D visualizations for more complex tasks. In particular, we tease out the effects of various basic interactions and find that the 2D view relies significantly on “scrubbing” the timeline, whereas the 3D view relies mainly on 3D camera navigation. Our work helps to improve understanding of 2D and 3D visualizations of spatio-temporal data, particularly with respect to interactivity.",
"abstracts": [
{
"abstractType": "Regular",
"content": "GPS, RFID, and other technologies have made it increasingly common to track the positions of people and objects over time as they move through two-dimensional spaces. Visualizing such spatio-temporal movement data is challenging because each person or object involves three variables (two spatial variables as a function of the time variable), and simply plotting the data on a 2D geographic map can result in overplotting and occlusion that hides details. This also makes it difficult to understand correlations between space and time. Software such as GeoTime can display such data with a three-dimensional visualization, where the 3rd dimension is used for time. This allows for the disambiguation of spatially overlapping trajectories, and in theory, should make the data clearer. However, previous experimental comparisons of 2D and 3D visualizations have so far found little advantage in 3D visualizations, possibly due to the increased complexity of navigating and understanding a 3D view. We present a new controlled experimental comparison of 2D and 3D visualizations, involving commonly performed tasks that have not been tested before, and find advantages in 3D visualizations for more complex tasks. In particular, we tease out the effects of various basic interactions and find that the 2D view relies significantly on “scrubbing” the timeline, whereas the 3D view relies mainly on 3D camera navigation. Our work helps to improve understanding of 2D and 3D visualizations of spatio-temporal data, particularly with respect to interactivity.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "GPS, RFID, and other technologies have made it increasingly common to track the positions of people and objects over time as they move through two-dimensional spaces. Visualizing such spatio-temporal movement data is challenging because each person or object involves three variables (two spatial variables as a function of the time variable), and simply plotting the data on a 2D geographic map can result in overplotting and occlusion that hides details. This also makes it difficult to understand correlations between space and time. Software such as GeoTime can display such data with a three-dimensional visualization, where the 3rd dimension is used for time. This allows for the disambiguation of spatially overlapping trajectories, and in theory, should make the data clearer. However, previous experimental comparisons of 2D and 3D visualizations have so far found little advantage in 3D visualizations, possibly due to the increased complexity of navigating and understanding a 3D view. We present a new controlled experimental comparison of 2D and 3D visualizations, involving commonly performed tasks that have not been tested before, and find advantages in 3D visualizations for more complex tasks. In particular, we tease out the effects of various basic interactions and find that the 2D view relies significantly on “scrubbing” the timeline, whereas the 3D view relies mainly on 3D camera navigation. Our work helps to improve understanding of 2D and 3D visualizations of spatio-temporal data, particularly with respect to interactivity.",
"title": "The Impact of Interactivity on Comprehending 2D and 3D Visualizations of Movement Data",
"normalizedTitle": "The Impact of Interactivity on Comprehending 2D and 3D Visualizations of Movement Data",
"fno": "06826569",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Three Dimensional Displays",
"Trajectory",
"Animation",
"Cameras",
"Mice",
"Visualization",
"Evaluation",
"Information Visualization",
"Spatio Temporal Data",
"Movement Data",
"Interactive Visualization"
],
"authors": [
{
"givenName": "Fereshteh",
"surname": "Amini",
"fullName": "Fereshteh Amini",
"affiliation": "Department of Computer Science, University of Manitoba, Winnipeg, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sebastien",
"surname": "Rufiange",
"fullName": "Sebastien Rufiange",
"affiliation": ", École de technologie supérieure, Montreal, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zahid",
"surname": "Hossain",
"fullName": "Zahid Hossain",
"affiliation": "Department of Computer Science, University of Manitoba, Winnipeg, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Quentin",
"surname": "Ventura",
"fullName": "Quentin Ventura",
"affiliation": ", École de technologie supérieure, Montreal, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pourang",
"surname": "Irani",
"fullName": "Pourang Irani",
"affiliation": "Department of Computer Science, University of Manitoba, Winnipeg, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael J.",
"surname": "McGuffin",
"fullName": "Michael J. McGuffin",
"affiliation": ", École de technologie supérieure, Montreal, Canada",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2015-01-01 00:00:00",
"pubType": "trans",
"pages": "122-135",
"year": "2015",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dui/2014/3624/0/06798869",
"title": "Poster: Investigating viewpoint visualizations for click & go navigation",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2014/06798869/12OmNAWpyuN",
"parentPublication": {
"id": "proceedings/3dui/2014/3624/0",
"title": "2014 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498preim",
"title": "Integration of Measurement Tools in Medical 3d Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498preim/12OmNvT2oKn",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dvis/2014/6826/0/07160097",
"title": "How to master challenges in experimental evaluation of 2D versus 3D software visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/3dvis/2014/07160097/12OmNzQR1nf",
"parentPublication": {
"id": "proceedings/3dvis/2014/6826/0",
"title": "2014 IEEE VIS International Workshop on 3DVis (3DVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/03/06919281",
"title": "VectorLens: Angular Selection of Curves within 2D Dense Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2015/03/06919281/13rRUxAAT7G",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/02/08281629",
"title": "Exploration Strategies for Discovery of Interactivity in Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2019/02/08281629/17D45WB0qaL",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a606",
"title": "3Dify: Extruding Common 2D Charts with Timeseries Data",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a606/1CJcH9IsHwk",
"parentPublication": {
"id": "proceedings/vrw/2022/8402/0",
"title": "2022 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2020/5608/0/09089606",
"title": "Design and Evaluation of a Tool to Support Air Traffic Control with 2D and 3D Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2020/09089606/1jIxdNYetj2",
"parentPublication": {
"id": "proceedings/vr/2020/5608/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/03/09172089",
"title": "Visualizing Movement Control Optimization Landscapes",
"doi": null,
"abstractUrl": "/journal/tg/2022/03/09172089/1mrN57MhqSI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222313",
"title": "ShuttleSpace: Exploring and Analyzing Movement Trajectory in Immersive Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222313/1nTr29xEpkk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09557225",
"title": "TIVEE: Visual Exploration and Explanation of Badminton Tactics in Immersive Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09557225/1xlvZlGiUsE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06851202",
"articleId": "13rRUEgarnL",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06966879",
"articleId": "13rRUB6Sq0B",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyoiZ12",
"title": "Feb.",
"year": "2015",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "21",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUytWF9l",
"doi": "10.1109/TVCG.2014.2350494",
"abstract": "Correlation analysis can reveal the complex relationships that often exist among the variables in multivariate data. However, as the number of variables grows, it can be difficult to gain a good understanding of the correlation landscape and important intricate relationships might be missed. We previously introduced a technique that arranged the variables into a 2D layout, encoding their pairwise correlations. We then used this layout as a network for the interactive ordering of axes in parallel coordinate displays. Our current work expresses the layout as a correlation map and employs it for visual correlation analysis. In contrast to matrix displays where correlations are indicated at intersections of rows and columns, our map conveys correlations by spatial proximity which is more direct and more focused on the variables in play. We make the following new contributions, some unique to our map: (1) we devise mechanisms that handle both categorical and numerical variables within a unified framework, (2) we achieve scalability for large numbers of variables via a multi-scale semantic zooming approach, (3) we provide interactive techniques for exploring the impact of value bracketing on correlations, and (4) we visualize data relations within the sub-spaces spanned by correlated variables by projecting the data into a corresponding tessellation of the map.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Correlation analysis can reveal the complex relationships that often exist among the variables in multivariate data. However, as the number of variables grows, it can be difficult to gain a good understanding of the correlation landscape and important intricate relationships might be missed. We previously introduced a technique that arranged the variables into a 2D layout, encoding their pairwise correlations. We then used this layout as a network for the interactive ordering of axes in parallel coordinate displays. Our current work expresses the layout as a correlation map and employs it for visual correlation analysis. In contrast to matrix displays where correlations are indicated at intersections of rows and columns, our map conveys correlations by spatial proximity which is more direct and more focused on the variables in play. We make the following new contributions, some unique to our map: (1) we devise mechanisms that handle both categorical and numerical variables within a unified framework, (2) we achieve scalability for large numbers of variables via a multi-scale semantic zooming approach, (3) we provide interactive techniques for exploring the impact of value bracketing on correlations, and (4) we visualize data relations within the sub-spaces spanned by correlated variables by projecting the data into a corresponding tessellation of the map.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Correlation analysis can reveal the complex relationships that often exist among the variables in multivariate data. However, as the number of variables grows, it can be difficult to gain a good understanding of the correlation landscape and important intricate relationships might be missed. We previously introduced a technique that arranged the variables into a 2D layout, encoding their pairwise correlations. We then used this layout as a network for the interactive ordering of axes in parallel coordinate displays. Our current work expresses the layout as a correlation map and employs it for visual correlation analysis. In contrast to matrix displays where correlations are indicated at intersections of rows and columns, our map conveys correlations by spatial proximity which is more direct and more focused on the variables in play. We make the following new contributions, some unique to our map: (1) we devise mechanisms that handle both categorical and numerical variables within a unified framework, (2) we achieve scalability for large numbers of variables via a multi-scale semantic zooming approach, (3) we provide interactive techniques for exploring the impact of value bracketing on correlations, and (4) we visualize data relations within the sub-spaces spanned by correlated variables by projecting the data into a corresponding tessellation of the map.",
"title": "Visual Correlation Analysis of Numerical and Categorical Data on the Correlation Map",
"normalizedTitle": "Visual Correlation Analysis of Numerical and Categorical Data on the Correlation Map",
"fno": "06881685",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Correlation Methods",
"Data Analysis",
"Data Visualisation",
"Interactive Systems",
"Visual Correlation Analysis",
"Categorical Data",
"Numerical Data",
"Correlation Map",
"Spatial Proximity",
"Multiscale Semantic Zooming",
"Interactive Techniques",
"Value Bracketing",
"Map Tessellation",
"Correlation",
"Visualization",
"Layout",
"Data Visualization",
"Correlation Coefficient",
"Optimization",
"Numerical Models",
"Visual Analytics",
"Visual Correlation Analysis",
"Categorical Data",
"Information Visualization",
"Interactive Interfaces"
],
"authors": [
{
"givenName": "Zhiyuan",
"surname": "Zhang",
"fullName": "Zhiyuan Zhang",
"affiliation": "Visual Analytics and Imaging Lab at the Computer Science Department, Stony Brook University, Stony Brook, NY",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kevin T.",
"surname": "McDonnell",
"fullName": "Kevin T. McDonnell",
"affiliation": "Department of Mathematics and Computer Science, Dowling College, Oakdale, NY",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Erez",
"surname": "Zadok",
"fullName": "Erez Zadok",
"affiliation": "Filesystems and Storage Lab at the Computer Science Department, Stony Brook University, Stony Brook, NY",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Klaus",
"surname": "Mueller",
"fullName": "Klaus Mueller",
"affiliation": "Visual Analytics and Imaging Lab at the Computer Science Department, Stony Brook University, Stony Brook, NY",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2015-02-01 00:00:00",
"pubType": "trans",
"pages": "289-303",
"year": "2015",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ictai/2017/3876/0/387601b037",
"title": "Correlation Heuristics for Constraint Programming",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2017/387601b037/12OmNAq3hOt",
"parentPublication": {
"id": "proceedings/ictai/2017/3876/0",
"title": "2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2004/2158/1/01315088",
"title": "Visual odometry and map correlation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2004/01315088/12OmNCwCLsI",
"parentPublication": {
"id": "proceedings/cvpr/2004/2158/1",
"title": "Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2011/9618/0/05718613",
"title": "Describing Temporal Correlation Spatially in a Visual Analytics Environment",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2011/05718613/12OmNvpNIoc",
"parentPublication": {
"id": "proceedings/hicss/2011/9618/0",
"title": "2011 44th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2010/3962/1/3962a856",
"title": "Correlation Analysis Based on Random Forest in Chinese Alcohol Market",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2010/3962a856/12OmNwDACv5",
"parentPublication": {
"id": "proceedings/icmtma/2010/3962/1",
"title": "2010 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460489",
"title": "Evaluation of canonical correlation analysis: A Correlation Generation Model",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460489/12OmNx19k1K",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192729",
"title": "The Visual Causality Analyst: An Interactive Interface for Causal Reasoning",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192729/13rRUwfZC0l",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2017/06/mcg2017060103",
"title": "CI Thermometer: Visualizing Confidence Intervals in Correlation Analysis",
"doi": null,
"abstractUrl": "/magazine/cg/2017/06/mcg2017060103/13rRUxBJhoW",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2006/04/k0493",
"title": "TAPER: A Two-Step Approach for All-Strong-Pairs Correlation Query in Large Databases",
"doi": null,
"abstractUrl": "/journal/tk/2006/04/k0493/13rRUxjQycd",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2018/05/08506386",
"title": "Multivariate Correlation Entropy and Law Discovery in Large Data Sets",
"doi": null,
"abstractUrl": "/magazine/ex/2018/05/08506386/17D45Xq6dz5",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06894217",
"articleId": "13rRUyoPSP7",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet27",
"name": "ttg201502-06881685s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201502-06881685s1.zip",
"extension": "zip",
"size": "3.9 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1qL5hsvvVkc",
"title": "Feb.",
"year": "2021",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1nL7qhcUKPe",
"doi": "10.1109/TVCG.2020.3029412",
"abstract": "Understanding correlation judgement is important to designing effective visualizations of bivariate data. Prior work on correlation perception has not considered how factors including prior beliefs and uncertainty representation impact such judgements. The present work focuses on the impact of uncertainty communication when judging bivariate visualizations. Specifically, we model how users update their beliefs about variable relationships after seeing a scatterplot with and without uncertainty representation. To model and evaluate the belief updating, we present three studies. Study 1 focuses on a proposed “Line + Cone” visual elicitation method for capturing users' beliefs in an accurate and intuitive fashion. The findings reveal that our proposed method of belief solicitation reduces complexity and accurately captures the users' uncertainty about a range of bivariate relationships. Study 2 leverages the “Line + Cone” elicitation method to measure belief updating on the relationship between different sets of variables when seeing correlation visualization with and without uncertainty representation. We compare changes in users beliefs to the predictions of Bayesian cognitive models which provide normative benchmarks for how users should update their prior beliefs about a relationship in light of observed data. The findings from Study 2 revealed that one of the visualization conditions with uncertainty communication led to users being slightly more confident about their judgement compared to visualization without uncertainty information. Study 3 builds on findings from Study 2 and explores differences in belief update when the bivariate visualization is congruent or incongruent with users' prior belief. Our results highlight the effects of incorporating uncertainty representation, and the potential of measuring belief updating on correlation judgement with Bayesian cognitive models.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Understanding correlation judgement is important to designing effective visualizations of bivariate data. Prior work on correlation perception has not considered how factors including prior beliefs and uncertainty representation impact such judgements. The present work focuses on the impact of uncertainty communication when judging bivariate visualizations. Specifically, we model how users update their beliefs about variable relationships after seeing a scatterplot with and without uncertainty representation. To model and evaluate the belief updating, we present three studies. Study 1 focuses on a proposed “Line + Cone” visual elicitation method for capturing users' beliefs in an accurate and intuitive fashion. The findings reveal that our proposed method of belief solicitation reduces complexity and accurately captures the users' uncertainty about a range of bivariate relationships. Study 2 leverages the “Line + Cone” elicitation method to measure belief updating on the relationship between different sets of variables when seeing correlation visualization with and without uncertainty representation. We compare changes in users beliefs to the predictions of Bayesian cognitive models which provide normative benchmarks for how users should update their prior beliefs about a relationship in light of observed data. The findings from Study 2 revealed that one of the visualization conditions with uncertainty communication led to users being slightly more confident about their judgement compared to visualization without uncertainty information. Study 3 builds on findings from Study 2 and explores differences in belief update when the bivariate visualization is congruent or incongruent with users' prior belief. Our results highlight the effects of incorporating uncertainty representation, and the potential of measuring belief updating on correlation judgement with Bayesian cognitive models.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Understanding correlation judgement is important to designing effective visualizations of bivariate data. Prior work on correlation perception has not considered how factors including prior beliefs and uncertainty representation impact such judgements. The present work focuses on the impact of uncertainty communication when judging bivariate visualizations. Specifically, we model how users update their beliefs about variable relationships after seeing a scatterplot with and without uncertainty representation. To model and evaluate the belief updating, we present three studies. Study 1 focuses on a proposed “Line + Cone” visual elicitation method for capturing users' beliefs in an accurate and intuitive fashion. The findings reveal that our proposed method of belief solicitation reduces complexity and accurately captures the users' uncertainty about a range of bivariate relationships. Study 2 leverages the “Line + Cone” elicitation method to measure belief updating on the relationship between different sets of variables when seeing correlation visualization with and without uncertainty representation. We compare changes in users beliefs to the predictions of Bayesian cognitive models which provide normative benchmarks for how users should update their prior beliefs about a relationship in light of observed data. The findings from Study 2 revealed that one of the visualization conditions with uncertainty communication led to users being slightly more confident about their judgement compared to visualization without uncertainty information. Study 3 builds on findings from Study 2 and explores differences in belief update when the bivariate visualization is congruent or incongruent with users' prior belief. Our results highlight the effects of incorporating uncertainty representation, and the potential of measuring belief updating on correlation judgement with Bayesian cognitive models.",
"title": "A Bayesian cognition approach for belief updating of correlation judgement through uncertainty visualizations",
"normalizedTitle": "A Bayesian cognition approach for belief updating of correlation judgement through uncertainty visualizations",
"fno": "09217952",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Bayes Methods",
"Belief Networks",
"Cognition",
"Data Visualisation",
"Human Factors",
"Regression Analysis",
"Visual Perception",
"Uncertainty Information",
"Belief Update",
"Bivariate Visualization",
"Belief Updating",
"Correlation Judgement",
"Bayesian Cognitive Models",
"Uncertainty Visualizations",
"Uncertainty Representation Impact",
"Uncertainty Communication",
"Line Cone Visual Elicitation Method",
"Belief Solicitation",
"Correlation Visualization",
"Users Beliefs",
"Data Visualization",
"Correlation",
"Uncertainty",
"Bayes Methods",
"Cognition",
"Data Models",
"Visualization",
"Information Visualization",
"Bayesian Modeling",
"Uncertainty Visualizations",
"Correlations",
"Belief Elicitation"
],
"authors": [
{
"givenName": "Alireza",
"surname": "Karduni",
"fullName": "Alireza Karduni",
"affiliation": "University of North Carolina, Charlotte",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Douglas",
"surname": "Markant",
"fullName": "Douglas Markant",
"affiliation": "University of North Carolina, Charlotte",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ryan",
"surname": "Wesslen",
"fullName": "Ryan Wesslen",
"affiliation": "University of North Carolina, Charlotte",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wenwen",
"surname": "Dou",
"fullName": "Wenwen Dou",
"affiliation": "University of North Carolina, Charlotte",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "978-988",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iciev/2016/1269/0/07760167",
"title": "A belief rule-based expert system to assess mental disorder under uncertainty",
"doi": null,
"abstractUrl": "/proceedings-article/iciev/2016/07760167/12OmNARRYgA",
"parentPublication": {
"id": "proceedings/iciev/2016/1269/0",
"title": "2016 International Conference on Informatics, Electronics and Vision (ICIEV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2016/3566/0/07839589",
"title": "Reasoning about Trust and Belief in Possibilistic Answer Set Programming",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2016/07839589/12OmNBVrjly",
"parentPublication": {
"id": "proceedings/bracis/2016/3566/0",
"title": "2016 5th Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icci/1992/2812/0/00227656",
"title": "Nonnumeric belief structures",
"doi": null,
"abstractUrl": "/proceedings-article/icci/1992/00227656/12OmNwfKjd8",
"parentPublication": {
"id": "proceedings/icci/1992/2812/0",
"title": "1992 Fourth International Conference on Computing and Information",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isuma/1995/7126/0/71260715",
"title": "Belief updating",
"doi": null,
"abstractUrl": "/proceedings-article/isuma/1995/71260715/12OmNy2Jt6v",
"parentPublication": {
"id": "proceedings/isuma/1995/7126/0",
"title": "Uncertainty Modeling and Analysis, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017624",
"title": "Imagining Replications: Graphical Prediction & Discrete Visualizations Improve Recall & Estimation of Effect Uncertainty",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017624/13rRUIM2VH5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09772276",
"title": "Practice improves performance of a 2D uncertainty integration task within and across visualizations",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09772276/1DgjDz35pfi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600o4371",
"title": "Multidimensional Belief Quantification for Label-Efficient Meta-Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600o4371/1H1j0az0WaY",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mise/2019/2231/0/223100a019",
"title": "Belief Uncertainty in Software Models",
"doi": null,
"abstractUrl": "/proceedings-article/mise/2019/223100a019/1ehBvfsOEAo",
"parentPublication": {
"id": "proceedings/mise/2019/2231/0",
"title": "2019 IEEE/ACM 11th International Workshop on Modelling in Software Engineering (MiSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09216507",
"title": "Bayesian-Assisted Inference from Visualized Data",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09216507/1nJsGTrLDPO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2020/1924/0/192400a211",
"title": "Graded Belief Revision for Jason: A Rule-Based Approach",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2020/192400a211/1uHhg069Nrq",
"parentPublication": {
"id": "proceedings/wi-iat/2020/1924/0",
"title": "2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09222287",
"articleId": "1nTq4rvK0g0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09216507",
"articleId": "1nJsGTrLDPO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLekG2lf2g",
"name": "ttg202102-09217952s1-tvcg-3029412-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09217952s1-tvcg-3029412-mm.zip",
"extension": "zip",
"size": "1.72 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgK8",
"title": "Dec.",
"year": "2014",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxD9gXK",
"doi": "10.1109/TVCG.2014.2346424",
"abstract": "Interactive visual applications often rely on animation to transition from one display state to another. There are multiple animation techniques to choose from, and it is not always clear which should produce the best visual correspondences between display elements. One major factor is whether the animation relies on staggering—an incremental delay in start times across the moving elements. It has been suggested that staggering may reduce occlusion, while also reducing display complexity and producing less overwhelming animations, though no empirical evidence has demonstrated these advantages. Work in perceptual psychology does show that reducing occlusion, and reducing inter-object proximity (crowding) more generally, improves performance in multiple object tracking. We ran simulations confirming that staggering can in some cases reduce crowding in animated transitions involving dot clouds (as found in, e.g., animated 2D scatterplots). We empirically evaluated the effect of two staggering techniques on tracking tasks, focusing on cases that should most favour staggering. We found that introducing staggering has a negligible, or even negative, impact on multiple object tracking performance. The potential benefits of staggering may be outweighed by strong costs: a loss of common-motion grouping information about which objects travel in similar paths, and less predictability about when any specific object would begin to move. Staggering may be beneficial in some conditions, but they have yet to be demonstrated. The present results are a significant step toward a better understanding of animation pacing, and provide direction for further research.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Interactive visual applications often rely on animation to transition from one display state to another. There are multiple animation techniques to choose from, and it is not always clear which should produce the best visual correspondences between display elements. One major factor is whether the animation relies on staggering—an incremental delay in start times across the moving elements. It has been suggested that staggering may reduce occlusion, while also reducing display complexity and producing less overwhelming animations, though no empirical evidence has demonstrated these advantages. Work in perceptual psychology does show that reducing occlusion, and reducing inter-object proximity (crowding) more generally, improves performance in multiple object tracking. We ran simulations confirming that staggering can in some cases reduce crowding in animated transitions involving dot clouds (as found in, e.g., animated 2D scatterplots). We empirically evaluated the effect of two staggering techniques on tracking tasks, focusing on cases that should most favour staggering. We found that introducing staggering has a negligible, or even negative, impact on multiple object tracking performance. The potential benefits of staggering may be outweighed by strong costs: a loss of common-motion grouping information about which objects travel in similar paths, and less predictability about when any specific object would begin to move. Staggering may be beneficial in some conditions, but they have yet to be demonstrated. The present results are a significant step toward a better understanding of animation pacing, and provide direction for further research.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Interactive visual applications often rely on animation to transition from one display state to another. There are multiple animation techniques to choose from, and it is not always clear which should produce the best visual correspondences between display elements. One major factor is whether the animation relies on staggering—an incremental delay in start times across the moving elements. It has been suggested that staggering may reduce occlusion, while also reducing display complexity and producing less overwhelming animations, though no empirical evidence has demonstrated these advantages. Work in perceptual psychology does show that reducing occlusion, and reducing inter-object proximity (crowding) more generally, improves performance in multiple object tracking. We ran simulations confirming that staggering can in some cases reduce crowding in animated transitions involving dot clouds (as found in, e.g., animated 2D scatterplots). We empirically evaluated the effect of two staggering techniques on tracking tasks, focusing on cases that should most favour staggering. We found that introducing staggering has a negligible, or even negative, impact on multiple object tracking performance. The potential benefits of staggering may be outweighed by strong costs: a loss of common-motion grouping information about which objects travel in similar paths, and less predictability about when any specific object would begin to move. Staggering may be beneficial in some conditions, but they have yet to be demonstrated. The present results are a significant step toward a better understanding of animation pacing, and provide direction for further research.",
"title": "The Not-so-Staggering Effect of Staggered Animated Transitions on Visual Tracking",
"normalizedTitle": "The Not-so-Staggering Effect of Staggered Animated Transitions on Visual Tracking",
"fno": "06876010",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Animation",
"Data Visualization",
"Complexity Theory",
"Target Tracking",
"Psychology",
"Tracking",
"Visual Tracking",
"Animated Transitions",
"Staggered Animation"
],
"authors": [
{
"givenName": "Fanny",
"surname": "Chevalier",
"fullName": "Fanny Chevalier",
"affiliation": ", Inria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pierre",
"surname": "Dragicevic",
"fullName": "Pierre Dragicevic",
"affiliation": ", Inria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Steven",
"surname": "Franconeri",
"fullName": "Steven Franconeri",
"affiliation": ", Northwestern University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "2241-2250",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icebe/2015/8002/0/8002a281",
"title": "Applying Augmented Reality Technology to Book Publication Business",
"doi": null,
"abstractUrl": "/proceedings-article/icebe/2015/8002a281/12OmNAfy7JF",
"parentPublication": {
"id": "proceedings/icebe/2015/8002/0",
"title": "2015 IEEE 12th International Conference on e-Business Engineering (ICEBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2015/7568/0/7568a075",
"title": "FATuM - Fast Animated Transitions Using Multi-buffers",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2015/7568a075/12OmNs59JK1",
"parentPublication": {
"id": "proceedings/iv/2015/7568/0",
"title": "2015 19th International Conference on Information Visualisation (iV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2001/1195/0/11950317",
"title": "Animated Illuminated Lines for Flow Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2001/11950317/12OmNwBT1mq",
"parentPublication": {
"id": "proceedings/iv/2001/1195/0",
"title": "Proceedings Fifth International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2000/0743/0/07430434",
"title": "Animated Texture Alpha-Masks for Flow Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2000/07430434/12OmNwp74Bm",
"parentPublication": {
"id": "proceedings/iv/2000/0743/0",
"title": "2000 IEEE Conference on Information Visualization. An International Conference on Computer Visualization and Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2005/2397/0/23970896",
"title": "Faster Is Better: Optimal Speed of Animated Visualizations for Decision Makers",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2005/23970896/12OmNywfKEC",
"parentPublication": {
"id": "proceedings/iv/2005/2397/0",
"title": "Ninth International Conference on Information Visualisation (IV'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2013/6097/0/06550198",
"title": "Expressing animated performances through puppeteering",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2013/06550198/12OmNzzP5AB",
"parentPublication": {
"id": "proceedings/3dui/2013/6097/0",
"title": "2013 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/09/08031015",
"title": "A Vector Field Design Approach to Animated Transitions",
"doi": null,
"abstractUrl": "/journal/tg/2018/09/08031015/13rRUB7a117",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805431",
"title": "Common Fate for Animated Transitions in Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805431/1cG4F76usA8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09234027",
"title": "Gemini: A Grammar and Recommender System for Animated Transitions in Statistical Graphics",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09234027/1o531wbxsSk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2021/3335/0/333500a201",
"title": "Gemini<sup>2</sup>: Generating Keyframe-Oriented Animated Transitions Between Statistical Graphics",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2021/333500a201/1yXuksPe8ne",
"parentPublication": {
"id": "proceedings/vis/2021/3335/0",
"title": "2021 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06876036",
"articleId": "13rRUxZ0o1D",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06875973",
"articleId": "13rRUwhHcQV",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRG0",
"name": "ttg201412-06876010s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201412-06876010s1.zip",
"extension": "zip",
"size": "80.2 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgK8",
"title": "Dec.",
"year": "2014",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwI5Ugd",
"doi": "10.1109/TVCG.2014.2346445",
"abstract": "Existing research efforts into tennis visualization have primarily focused on using ball and player tracking data to enhance professional tennis broadcasts and to aid coaches in helping their students. Gathering and analyzing this data typically requires the use of an array of synchronized cameras, which are expensive for non-professional tennis matches. In this paper, we propose TenniVis, a novel tennis match visualization system that relies entirely on data that can be easily collected, such as score, point outcomes, point lengths, service information, and match videos that can be captured by one consumer-level camera. It provides two new visualizations to allow tennis coaches and players to quickly gain insights into match performance. It also provides rich interactions to support ad hoc hypothesis development and testing. We first demonstrate the usefulness of the system by analyzing the 2007 Australian Open men's singles final. We then validate its usability by two pilot user studies where two college tennis coaches analyzed the matches of their own players. The results indicate that useful insights can quickly be discovered and ad hoc hypotheses based on these insights can conveniently be tested through linked match videos.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Existing research efforts into tennis visualization have primarily focused on using ball and player tracking data to enhance professional tennis broadcasts and to aid coaches in helping their students. Gathering and analyzing this data typically requires the use of an array of synchronized cameras, which are expensive for non-professional tennis matches. In this paper, we propose TenniVis, a novel tennis match visualization system that relies entirely on data that can be easily collected, such as score, point outcomes, point lengths, service information, and match videos that can be captured by one consumer-level camera. It provides two new visualizations to allow tennis coaches and players to quickly gain insights into match performance. It also provides rich interactions to support ad hoc hypothesis development and testing. We first demonstrate the usefulness of the system by analyzing the 2007 Australian Open men's singles final. We then validate its usability by two pilot user studies where two college tennis coaches analyzed the matches of their own players. The results indicate that useful insights can quickly be discovered and ad hoc hypotheses based on these insights can conveniently be tested through linked match videos.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Existing research efforts into tennis visualization have primarily focused on using ball and player tracking data to enhance professional tennis broadcasts and to aid coaches in helping their students. Gathering and analyzing this data typically requires the use of an array of synchronized cameras, which are expensive for non-professional tennis matches. In this paper, we propose TenniVis, a novel tennis match visualization system that relies entirely on data that can be easily collected, such as score, point outcomes, point lengths, service information, and match videos that can be captured by one consumer-level camera. It provides two new visualizations to allow tennis coaches and players to quickly gain insights into match performance. It also provides rich interactions to support ad hoc hypothesis development and testing. We first demonstrate the usefulness of the system by analyzing the 2007 Australian Open men's singles final. We then validate its usability by two pilot user studies where two college tennis coaches analyzed the matches of their own players. The results indicate that useful insights can quickly be discovered and ad hoc hypotheses based on these insights can conveniently be tested through linked match videos.",
"title": "TenniVis: Visualization for Tennis Match Analysis",
"normalizedTitle": "TenniVis: Visualization for Tennis Match Analysis",
"fno": "06876044",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Sport",
"Tenni Vis",
"Tennis Match Analysis Visualisation",
"Player Tracking Data",
"Ball Tracking Data",
"Professional Tennis",
"Synchronized Cameras",
"Consumer Level Camera",
"Ad Hoc Hypothesis Development",
"Ad Hoc Hypothesis Testing",
"Match Videos",
"Games",
"Entertainment",
"Data Visualization",
"Image Color Analysis",
"Cameras",
"Information Analysis",
"Visual Knowledge Discovery",
"Sports Analytics",
"Tennis Visualization"
],
"authors": [
{
"givenName": "Tom",
"surname": "Polk",
"fullName": "Tom Polk",
"affiliation": "University of North Carolina at Charlotte",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jing",
"surname": "Yang",
"fullName": "Jing Yang",
"affiliation": "University of North Carolina at Charlotte",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yueqi",
"surname": "Hu",
"fullName": "Yueqi Hu",
"affiliation": "University of North Carolina at Charlotte",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ye",
"surname": "Zhao",
"fullName": "Ye Zhao",
"affiliation": "Kent State University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "2339-2348",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bsn/2009/3644/0/3644a224",
"title": "A Sensing Platform for Physiological and Contextual Feedback to Tennis Athletes",
"doi": null,
"abstractUrl": "/proceedings-article/bsn/2009/3644a224/12OmNrJAe3b",
"parentPublication": {
"id": "proceedings/bsn/2009/3644/0",
"title": "2009 Sixth International Workshop on Wearable & Implantable Body Sensor Networks Conference (BSN 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2015/9711/0/5720a718",
"title": "Tennis Player Segmentation for Semantic Behavior Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2015/5720a718/12OmNx1qV4e",
"parentPublication": {
"id": "proceedings/iccvw/2015/9711/0",
"title": "2015 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/1996/7668/0/76680108",
"title": "Visualizing a tennis match",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/1996/76680108/12OmNz4Bdts",
"parentPublication": {
"id": "proceedings/ieee-infovis/1996/7668/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017600",
"title": "iTTVis: Interactive Visualization of Table Tennis Data",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017600/13rRUyY28YD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2019/2607/2/260702a097",
"title": "Micro-Level Analysis and Visualization of Tennis Shot Patterns with Fractal Tables",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2019/260702a097/1cYipyP6afS",
"parentPublication": {
"id": "compsac/2019/2607/2",
"title": "2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08795584",
"title": "CourtTime: Generating Actionable Insights into Tennis Matches Using Visual Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08795584/1csHUeq7TB6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/09411869",
"title": "Tac-Miner: Visual Tactic Mining for Multiple Table Tennis Matches",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/09411869/1t2ii7r7RcI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2021/3892/0/389200a632",
"title": "Tactical Decision System of Table Tennis Match based on C4.5 Decision Tree",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2021/389200a632/1t2nmIZ5RBe",
"parentPublication": {
"id": "proceedings/icmtma/2021/3892/0",
"title": "2021 13th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/tcs/2021/2910/0/291000a533",
"title": "A Study of Liu Shiwen’s Table Tennis Techniques and Tactics Based on Computer-aided Video",
"doi": null,
"abstractUrl": "/proceedings-article/tcs/2021/291000a533/1wRIl8gP8xW",
"parentPublication": {
"id": "proceedings/tcs/2021/2910/0",
"title": "2021 International Conference on Information Technology and Contemporary Sports (TCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/03/09626557",
"title": "SimuExplorer: Visual Exploration of Game Simulation in Table Tennis",
"doi": null,
"abstractUrl": "/journal/tg/2023/03/09626557/1yNd5vlQLrG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06875942",
"articleId": "13rRUwbJD4K",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06876005",
"articleId": "13rRUwInvf8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgDc",
"name": "ttg201412-06876044s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201412-06876044s1.zip",
"extension": "zip",
"size": "16.4 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRo",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1GIqpPbyH7y",
"doi": "10.1109/TVCG.2022.3207147",
"abstract": "Lineup selection is an essential and important task in soccer matches. To win a match, coaches must consider various factors and select appropriate players for a planned formation. Computation-based tools have been proposed to help coaches on this complex task, but they are usually based on over-simplified models on player performances, do not support interactive analysis, and overlook the inputs by coaches. In this paper, we propose a method for visual analytics of soccer lineup selection by tackling two challenges: characterizing essential factors involved in generating optimal lineup, and supporting coach-driven visual analytics of lineup selection. We develop a lineup selection model that integrates such important factors, such as spatial regions of player actions and defensive interactions with opponent players. A visualization system, Team-Builder, is developed to help coaches control the process of lineup generation, explanation, and comparison through multiple coordinated views. The usefulness and effectiveness of our system are demonstrated by two case studies on a real-world soccer event dataset.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Lineup selection is an essential and important task in soccer matches. To win a match, coaches must consider various factors and select appropriate players for a planned formation. Computation-based tools have been proposed to help coaches on this complex task, but they are usually based on over-simplified models on player performances, do not support interactive analysis, and overlook the inputs by coaches. In this paper, we propose a method for visual analytics of soccer lineup selection by tackling two challenges: characterizing essential factors involved in generating optimal lineup, and supporting coach-driven visual analytics of lineup selection. We develop a lineup selection model that integrates such important factors, such as spatial regions of player actions and defensive interactions with opponent players. A visualization system, Team-Builder, is developed to help coaches control the process of lineup generation, explanation, and comparison through multiple coordinated views. The usefulness and effectiveness of our system are demonstrated by two case studies on a real-world soccer event dataset.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Lineup selection is an essential and important task in soccer matches. To win a match, coaches must consider various factors and select appropriate players for a planned formation. Computation-based tools have been proposed to help coaches on this complex task, but they are usually based on over-simplified models on player performances, do not support interactive analysis, and overlook the inputs by coaches. In this paper, we propose a method for visual analytics of soccer lineup selection by tackling two challenges: characterizing essential factors involved in generating optimal lineup, and supporting coach-driven visual analytics of lineup selection. We develop a lineup selection model that integrates such important factors, such as spatial regions of player actions and defensive interactions with opponent players. A visualization system, Team-Builder, is developed to help coaches control the process of lineup generation, explanation, and comparison through multiple coordinated views. The usefulness and effectiveness of our system are demonstrated by two case studies on a real-world soccer event dataset.",
"title": "Team-Builder: Toward More Effective Lineup Selection in Soccer",
"normalizedTitle": "Team-Builder: Toward More Effective Lineup Selection in Soccer",
"fno": "09894103",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Sports",
"Data Visualization",
"Analytical Models",
"Trajectory",
"Computational Modeling",
"Visual Analytics",
"Videos",
"Design Study",
"Lineup Selection",
"Sports Visualization"
],
"authors": [
{
"givenName": "Anqi",
"surname": "Cao",
"fullName": "Anqi Cao",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ji",
"surname": "Lan",
"fullName": "Ji Lan",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiao",
"surname": "Xie",
"fullName": "Xiao Xie",
"affiliation": "Department of Sports Science, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongyu",
"surname": "Chen",
"fullName": "Hongyu Chen",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaolong",
"surname": "Zhang",
"fullName": "Xiaolong Zhang",
"affiliation": "College of Information Sciences and Technology, Pennsylvania State University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hui",
"surname": "Zhang",
"fullName": "Hui Zhang",
"affiliation": "Department of Sports Science, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yingcai",
"surname": "Wu",
"fullName": "Yingcai Wu",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-09-01 00:00:00",
"pubType": "trans",
"pages": "1-16",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vast/2014/6227/0/07042477",
"title": "Feature-driven visual analytics of soccer data",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042477/12OmNxcMSiK",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2015/9711/0/5720a774",
"title": "Injury Mechanism Classification in Soccer Videos",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2015/5720a774/12OmNyQYtu5",
"parentPublication": {
"id": "proceedings/iccvw/2015/9711/0",
"title": "2015 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2016/05/mcg2016050050",
"title": "Director's Cut: Analysis and Annotation of Soccer Matches",
"doi": null,
"abstractUrl": "/magazine/cg/2016/05/mcg2016050050/13rRUIJcWr3",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2018/6100/0/610000b830",
"title": "Soccer: Who Has the Ball? Generating Visual Analytics and Player Statistics",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2018/610000b830/17D45VObpOM",
"parentPublication": {
"id": "proceedings/cvprw/2018/6100/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdva/2018/9194/0/08534022",
"title": "Revealing the Invisible: Visual Analytics and Explanatory Storytelling for Advanced Team Sport Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2018/08534022/17D45WODasQ",
"parentPublication": {
"id": "proceedings/bdva/2018/9194/0",
"title": "2018 International Symposium on Big Data Visual and Immersive Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440804",
"title": "ForVizor: Visualizing Spatio-Temporal Team Formations in Soccer",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440804/17D45WXIkAs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000e738",
"title": "Soccer on Your Tabletop",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000e738/17D45WrVgfK",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/05/08735757",
"title": "Tackling Similarity Search for Soccer Match Analysis: Multimodal Distance Measure and Interactive Query Definition",
"doi": null,
"abstractUrl": "/magazine/cg/2019/05/08735757/1aNOsqnK0Gk",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08795584",
"title": "CourtTime: Generating Actionable Insights into Tennis Matches Using Visual Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08795584/1csHUeq7TB6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222314",
"title": "PassVizor: Toward Better Understanding of the Dynamics of Soccer Passes",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222314/1nTq1FTwhtC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09894094",
"articleId": "1GIqpC6j7na",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09894041",
"articleId": "1GIqrCx8RCE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1GQIKYT1TnG",
"name": "ttg555501-09894103s1-supp1-3207147.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09894103s1-supp1-3207147.mp4",
"extension": "mp4",
"size": "14.1 MB",
"__typename": "WebExtraType"
},
{
"id": "1GQIKRomxs4",
"name": "ttg555501-09894103s1-supp2-3207147.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09894103s1-supp2-3207147.pdf",
"extension": "pdf",
"size": "269 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1KmyNRPfdXG",
"title": "March",
"year": "2023",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1yNd5vlQLrG",
"doi": "10.1109/TVCG.2021.3130422",
"abstract": "We propose SimuExplorer, a visualization system to help analysts explore how player behaviors impact scoring rates in table tennis. Such analysis is indispensable for analysts and coaches, who aim to formulate training plans that can help players improve. However, it is challenging to identify the impacts of individual behaviors, as well as to understand how these impacts are generated and accumulated gradually over the course of a game. To address these challenges, we worked closely with experts who work for a top national table tennis team to design SimuExplorer. The SimuExplorer system integrates a Markov chain model to simulate individual and cumulative impacts of particular behaviors. It then provides flow and matrix views to help users visualize and interpret these impacts. We demonstrate the usefulness of the system with case studies and expert interviews. The experts think highly of the system and have obtained insights into players’ behaviors using it.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose SimuExplorer, a visualization system to help analysts explore how player behaviors impact scoring rates in table tennis. Such analysis is indispensable for analysts and coaches, who aim to formulate training plans that can help players improve. However, it is challenging to identify the impacts of individual behaviors, as well as to understand how these impacts are generated and accumulated gradually over the course of a game. To address these challenges, we worked closely with experts who work for a top national table tennis team to design SimuExplorer. The SimuExplorer system integrates a Markov chain model to simulate individual and cumulative impacts of particular behaviors. It then provides flow and matrix views to help users visualize and interpret these impacts. We demonstrate the usefulness of the system with case studies and expert interviews. The experts think highly of the system and have obtained insights into players’ behaviors using it.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose SimuExplorer, a visualization system to help analysts explore how player behaviors impact scoring rates in table tennis. Such analysis is indispensable for analysts and coaches, who aim to formulate training plans that can help players improve. However, it is challenging to identify the impacts of individual behaviors, as well as to understand how these impacts are generated and accumulated gradually over the course of a game. To address these challenges, we worked closely with experts who work for a top national table tennis team to design SimuExplorer. The SimuExplorer system integrates a Markov chain model to simulate individual and cumulative impacts of particular behaviors. It then provides flow and matrix views to help users visualize and interpret these impacts. We demonstrate the usefulness of the system with case studies and expert interviews. The experts think highly of the system and have obtained insights into players’ behaviors using it.",
"title": "SimuExplorer: Visual Exploration of Game Simulation in Table Tennis",
"normalizedTitle": "SimuExplorer: Visual Exploration of Game Simulation in Table Tennis",
"fno": "09626557",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Games",
"Data Analysis",
"Data Mining",
"Data Visualisation",
"Markov Processes",
"Sport",
"Cumulative Impacts",
"Game Simulation",
"Impact Scoring Rates",
"Individual Behaviors",
"Individual Impacts",
"Markov Chain Model",
"National Table Tennis Team",
"Particular Behaviors",
"Players",
"Simu Explorer System",
"Training Plans",
"Visual Exploration",
"Visualization System",
"Sports",
"Markov Processes",
"Visualization",
"Analytical Models",
"Tools",
"Task Analysis",
"Software",
"Sports Visualization",
"Game Simulation",
"Model Interpretation",
"Etc"
],
"authors": [
{
"givenName": "Ji",
"surname": "Lan",
"fullName": "Ji Lan",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, Zhejiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zheng",
"surname": "Zhou",
"fullName": "Zheng Zhou",
"affiliation": "Department of Sport Science, Zhejiang University, Hangzhou, Zhejiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiachen",
"surname": "Wang",
"fullName": "Jiachen Wang",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, Zhejiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hui",
"surname": "Zhang",
"fullName": "Hui Zhang",
"affiliation": "Department of Sport Science, Zhejiang University, Hangzhou, Zhejiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiao",
"surname": "Xie",
"fullName": "Xiao Xie",
"affiliation": "Department of Sport Science, Zhejiang University, Hangzhou, Zhejiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yingcai",
"surname": "Wu",
"fullName": "Yingcai Wu",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, Zhejiang, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2023-03-01 00:00:00",
"pubType": "trans",
"pages": "1719-1732",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2018/01/08017600",
"title": "iTTVis: Interactive Visualization of Table Tennis Data",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017600/13rRUyY28YD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icise-ie/2021/3829/0/382900b210",
"title": "Application of Micro-lecture in Table Tennis Teaching for Children",
"doi": null,
"abstractUrl": "/proceedings-article/icise-ie/2021/382900b210/1C8GamvUKGI",
"parentPublication": {
"id": "proceedings/icise-ie/2021/3829/0",
"title": "2021 2nd International Conference on Information Science and Education (ICISE-IE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiars/2022/5457/0/545700a135",
"title": "Intelligent Repair System of Table Tennis Server Based on Data Analysis Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/aiars/2022/545700a135/1J2XPikx7b2",
"parentPublication": {
"id": "proceedings/aiars/2022/5457/0",
"title": "2022 International Conference on Artificial Intelligence and Autonomous Robot Systems (AIARS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807264",
"title": "Tac-Simur: Tactic-based Simulative Visual Analytics of Table Tennis",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807264/1cG6vo24hRC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08795584",
"title": "CourtTime: Generating Actionable Insights into Tennis Matches Using Visual Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08795584/1csHUeq7TB6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpai/2020/4262/0/426200a058",
"title": "Stress Level Classifier: Taiwanese College Table Tennis Athletes’ Electroencephalography Analysis Based on Decision Trees",
"doi": null,
"abstractUrl": "/proceedings-article/icpai/2020/426200a058/1pZ17Yuv70Y",
"parentPublication": {
"id": "proceedings/icpai/2020/4262/0",
"title": "2020 International Conference on Pervasive Artificial Intelligence (ICPAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/09411869",
"title": "Tac-Miner: Visual Tactic Mining for Multiple Table Tennis Matches",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/09411869/1t2ii7r7RcI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2021/3892/0/389200a632",
"title": "Tactical Decision System of Table Tennis Match based on C4.5 Decision Tree",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2021/389200a632/1t2nmIZ5RBe",
"parentPublication": {
"id": "proceedings/icmtma/2021/3892/0",
"title": "2021 13th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/tcs/2021/2910/0/291000a533",
"title": "A Study of Liu Shiwen’s Table Tennis Techniques and Tactics Based on Computer-aided Video",
"doi": null,
"abstractUrl": "/proceedings-article/tcs/2021/291000a533/1wRIl8gP8xW",
"parentPublication": {
"id": "proceedings/tcs/2021/2910/0",
"title": "2021 International Conference on Information Technology and Contemporary Sports (TCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmu/2021/48/0/09638855",
"title": "Toward the Perfect Stroke: A Multimodal Approach for Table Tennis Stroke Evaluation",
"doi": null,
"abstractUrl": "/proceedings-article/icmu/2021/09638855/1zktfg0C87u",
"parentPublication": {
"id": "proceedings/icmu/2021/48/0",
"title": "2021 Thirteenth International Conference on Mobile Computing and Ubiquitous Network (ICMU)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09625765",
"articleId": "1yLTqDGZSOQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09627526",
"articleId": "1yORLIqoJnq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1KmyTvrF5Ys",
"name": "ttg202303-09626557s1-supp1-3130422.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202303-09626557s1-supp1-3130422.pdf",
"extension": "pdf",
"size": "199 kB",
"__typename": "WebExtraType"
},
{
"id": "1KmyTpbV2ik",
"name": "ttg202303-09626557s1-supp2-3130422.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202303-09626557s1-supp2-3130422.mp4",
"extension": "mp4",
"size": "44.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqBKUfM",
"title": "March",
"year": "2006",
"issueNum": "03",
"idPrefix": "tp",
"pubType": "journal",
"volume": "28",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgarkw",
"doi": "10.1109/TPAMI.2006.56",
"abstract": "Understanding the structure of multidimensional patterns, especially in unsupervised cases, is of fundamental importance in data mining, pattern recognition, and machine learning. Several algorithms have been proposed to analyze the structure of high-dimensional data based on the notion of manifold learning. These algorithms have been used to extract the intrinsic characteristics of different types of high-dimensional data by performing nonlinear dimensionality reduction. Most of these algorithms operate in a \"batch” mode and cannot be efficiently applied when data are collected sequentially. In this paper, we describe an incremental version of ISOMAP, one of the key manifold learning algorithms. Our experiments on synthetic data as well as real world images demonstrate that our modified algorithm can maintain an accurate low-dimensional representation of the data in an efficient manner.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Understanding the structure of multidimensional patterns, especially in unsupervised cases, is of fundamental importance in data mining, pattern recognition, and machine learning. Several algorithms have been proposed to analyze the structure of high-dimensional data based on the notion of manifold learning. These algorithms have been used to extract the intrinsic characteristics of different types of high-dimensional data by performing nonlinear dimensionality reduction. Most of these algorithms operate in a \"batch” mode and cannot be efficiently applied when data are collected sequentially. In this paper, we describe an incremental version of ISOMAP, one of the key manifold learning algorithms. Our experiments on synthetic data as well as real world images demonstrate that our modified algorithm can maintain an accurate low-dimensional representation of the data in an efficient manner.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Understanding the structure of multidimensional patterns, especially in unsupervised cases, is of fundamental importance in data mining, pattern recognition, and machine learning. Several algorithms have been proposed to analyze the structure of high-dimensional data based on the notion of manifold learning. These algorithms have been used to extract the intrinsic characteristics of different types of high-dimensional data by performing nonlinear dimensionality reduction. Most of these algorithms operate in a \"batch” mode and cannot be efficiently applied when data are collected sequentially. In this paper, we describe an incremental version of ISOMAP, one of the key manifold learning algorithms. Our experiments on synthetic data as well as real world images demonstrate that our modified algorithm can maintain an accurate low-dimensional representation of the data in an efficient manner.",
"title": "Incremental Nonlinear Dimensionality Reduction by Manifold Learning",
"normalizedTitle": "Incremental Nonlinear Dimensionality Reduction by Manifold Learning",
"fno": "i0377",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Incremental Learning",
"Dimensionality Reduction",
"ISOMAP",
"Manifold Learning",
"Unsupervised Learning"
],
"authors": [
{
"givenName": "Martin H.C.",
"surname": "Law",
"fullName": "Martin H.C. Law",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anil K.",
"surname": "Jain",
"fullName": "Anil K. Jain",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2006-03-01 00:00:00",
"pubType": "trans",
"pages": "377-391",
"year": "2006",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bsn/2012/4698/0/4698a161",
"title": "Dimensionality Reduction for Anomaly Detection in Electrocardiography: A Manifold Approach",
"doi": null,
"abstractUrl": "/proceedings-article/bsn/2012/4698a161/12OmNAJDBtS",
"parentPublication": {
"id": "proceedings/bsn/2012/4698/0",
"title": "Wearable and Implantable Body Sensor Networks, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aici/2010/4225/1/4225a438",
"title": "Supervised Non-Linear Dimensionality Reduction Techniques for Classification in Intrusion Detection",
"doi": null,
"abstractUrl": "/proceedings-article/aici/2010/4225a438/12OmNAPjA7q",
"parentPublication": {
"id": "proceedings/aici/2010/4225/1",
"title": "Artificial Intelligence and Computational Intelligence, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2012/4905/0/4905a241",
"title": "Isometric Multi-manifold Learning for Feature Extraction",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2012/4905a241/12OmNBO3Kj7",
"parentPublication": {
"id": "proceedings/icdm/2012/4905/0",
"title": "2012 IEEE 12th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2008/3508/1/3508a041",
"title": "Performance Comparison of Nonlinear Dimensionality Reduction Methods for Image Data Using Different Distance Measures",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2008/3508a041/12OmNBqdr9i",
"parentPublication": {
"id": "proceedings/cis/2008/3508/1",
"title": "2008 International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2006/2521/2/252120447",
"title": "Robust Nonlinear Dimensionality Reduction for Manifold Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2006/252120447/12OmNrNh0Dn",
"parentPublication": {
"id": "proceedings/icpr/2006/2521/2",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2008/3357/2/3357c181",
"title": "Sorting 4DCT Images Based on Manifold Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2008/3357c181/12OmNvA1hDh",
"parentPublication": {
"id": "icicta/2008/3357/2",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icrccs/2009/3927/0/3927a104",
"title": "An Adaptive Manifold Learning Algorithm Based on ISOMAP",
"doi": null,
"abstractUrl": "/proceedings-article/icrccs/2009/3927a104/12OmNwIHotk",
"parentPublication": {
"id": "proceedings/icrccs/2009/3927/0",
"title": "Research Challenges in Computer Science, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2011/4501/0/4501a026",
"title": "Two-Level-Granularity Manifold Learning Algorithm for Video Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2011/4501a026/12OmNzA6GQ5",
"parentPublication": {
"id": "proceedings/iccis/2011/4501/0",
"title": "2011 International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/devlrn/2005/9226/0/01490986",
"title": "Kernel Isomap on Noisy Manifold",
"doi": null,
"abstractUrl": "/proceedings-article/devlrn/2005/01490986/12OmNzdoN78",
"parentPublication": {
"id": "proceedings/devlrn/2005/9226/0",
"title": "International Conference on Development and Learning",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2009/3736/3/3736c443",
"title": "A New Robust Manifold Learning Algorithm Based on Self-Organizing Map",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2009/3736c443/12OmNzkMlFx",
"parentPublication": {
"id": "proceedings/icnc/2009/3736/3",
"title": "2009 Fifth International Conference on Natural Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "i0364",
"articleId": "13rRUB7a125",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0392",
"articleId": "13rRUxASuqp",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgKk",
"title": "Nov.",
"year": "2020",
"issueNum": "11",
"idPrefix": "tp",
"pubType": "journal",
"volume": "42",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1aqKRzAZSow",
"doi": "10.1109/TPAMI.2019.2919597",
"abstract": "This paper introduces Memory-limited Online Subspace Estimation Scheme (MOSES) for both estimating the principal components of streaming data and reducing its dimension. More specifically, in various applications such as sensor networks, the data vectors are presented sequentially to a user who has limited storage and processing time available. Applied to such problems, MOSES can provide a running estimate of leading principal components of the data that has arrived so far and also reduce its dimension. MOSES generalises the popular incremental Singular Vale Decomposition (iSVD) to handle thin blocks of data, rather than just vectors. This minor generalisation in part allows us to complement MOSES with a comprehensive statistical analysis, thus providing the first theoretically-sound variant of iSVD, which has been lacking despite the empirical success of this method. This generalisation also enables us to concretely interpret MOSES as an approximate solver for the underlying non-convex optimisation program. We find that MOSES consistently surpasses the state of the art in our numerical experiments with both synthetic and real-world datasets, while being computationally inexpensive.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper introduces Memory-limited Online Subspace Estimation Scheme (MOSES) for both estimating the principal components of streaming data and reducing its dimension. More specifically, in various applications such as sensor networks, the data vectors are presented sequentially to a user who has limited storage and processing time available. Applied to such problems, MOSES can provide a running estimate of leading principal components of the data that has arrived so far and also reduce its dimension. MOSES generalises the popular incremental Singular Vale Decomposition (iSVD) to handle thin blocks of data, rather than just vectors. This minor generalisation in part allows us to complement MOSES with a comprehensive statistical analysis, thus providing the first theoretically-sound variant of iSVD, which has been lacking despite the empirical success of this method. This generalisation also enables us to concretely interpret MOSES as an approximate solver for the underlying non-convex optimisation program. We find that MOSES consistently surpasses the state of the art in our numerical experiments with both synthetic and real-world datasets, while being computationally inexpensive.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper introduces Memory-limited Online Subspace Estimation Scheme (MOSES) for both estimating the principal components of streaming data and reducing its dimension. More specifically, in various applications such as sensor networks, the data vectors are presented sequentially to a user who has limited storage and processing time available. Applied to such problems, MOSES can provide a running estimate of leading principal components of the data that has arrived so far and also reduce its dimension. MOSES generalises the popular incremental Singular Vale Decomposition (iSVD) to handle thin blocks of data, rather than just vectors. This minor generalisation in part allows us to complement MOSES with a comprehensive statistical analysis, thus providing the first theoretically-sound variant of iSVD, which has been lacking despite the empirical success of this method. This generalisation also enables us to concretely interpret MOSES as an approximate solver for the underlying non-convex optimisation program. We find that MOSES consistently surpasses the state of the art in our numerical experiments with both synthetic and real-world datasets, while being computationally inexpensive.",
"title": "MOSES: A Streaming Algorithm for Linear Dimensionality Reduction",
"normalizedTitle": "MOSES: A Streaming Algorithm for Linear Dimensionality Reduction",
"fno": "08723614",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Approximation Theory",
"Convex Programming",
"Iterative Methods",
"Principal Component Analysis",
"Singular Value Decomposition",
"Storage Management",
"Streaming Algorithm",
"Linear Dimensionality Reduction",
"MOSES",
"Data Vectors",
"Running Estimate",
"Generalisation",
"Memory Limited Online Subspace Estimation Scheme",
"Popular Incremental Singular Vale Decomposition",
"Dimensionality Reduction",
"Estimation",
"Optimization",
"Approximation Algorithms",
"Principal Component Analysis",
"Ear",
"Principal Component Analysis",
"Linear Dimensionality Reduction",
"Subspace Identification",
"Streaming Algorithms",
"Non Convex Optimisation"
],
"authors": [
{
"givenName": "Armin",
"surname": "Eftekhari",
"fullName": "Armin Eftekhari",
"affiliation": "Institute of Electrical Engineering, École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Raphael A.",
"surname": "Hauser",
"fullName": "Raphael A. Hauser",
"affiliation": "Mathematical Institute, University of Oxford, Oxford, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andreas",
"surname": "Grammenos",
"fullName": "Andreas Grammenos",
"affiliation": "Department of Computer Science, University of Cambridge, Cambridge, United Kingdom",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2020-11-01 00:00:00",
"pubType": "trans",
"pages": "2901-2911",
"year": "2020",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cluster/2001/1116/0/11160102",
"title": "Parallel and Adaptive Reduction of Hyperspectral Data to Intrinsic Dimensionality",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2001/11160102/12OmNs0C9CE",
"parentPublication": {
"id": "proceedings/cluster/2001/1116/0",
"title": "Third IEEE International Conference on Cluster Computing (CLUSTER'01)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/04/v0459",
"title": "Robust Linear Dimensionality Reduction",
"doi": null,
"abstractUrl": "/journal/tg/2004/04/v0459/13rRUxBJhFl",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2018/8023/0/802300a318",
"title": "Dimensionality Reduction for the Algorithm Recommendation Problem",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2018/802300a318/17D45VUZMXu",
"parentPublication": {
"id": "proceedings/bracis/2018/8023/0",
"title": "2018 7th Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08545832",
"title": "Efficient Text Classification Using Tree-structured Multi-linear Principal Component Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08545832/17D45VVho3q",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2018/5488/0/08621556",
"title": "Comparison of dimensionality reduction methods for TCM symptom information",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2018/08621556/17D45Xbl4O3",
"parentPublication": {
"id": "proceedings/bibm/2018/5488/0",
"title": "2018 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08546198",
"title": "Maximum Gradient Dimensionality Reduction",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08546198/17D45XzbnLm",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08809834",
"title": "An Incremental Dimensionality Reduction Method for Visualizing Streaming Multidimensional Data",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08809834/1cHEiLzaKw8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnisc/2017/1618/0/161800a126",
"title": "Local Linear Dimensionality Reduction Algorithm Based on Nonlinear Manifolds Decomposition",
"doi": null,
"abstractUrl": "/proceedings-article/icnisc/2017/161800a126/1dUn9oRfDAk",
"parentPublication": {
"id": "proceedings/icnisc/2017/1618/0",
"title": "2017 International Conference on Network and Information Systems for Computers (ICNISC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2019/5686/0/568600a577",
"title": "Autoencoder Based Dimensionality Reduction of Feature Vectors for Object Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2019/568600a577/1j9xB188lAk",
"parentPublication": {
"id": "proceedings/sitis/2019/5686/0",
"title": "2019 15th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlbdbi/2020/9638/0/963800a392",
"title": "Research on PCA Data Dimension Reduction Algorithm Based on Entropy Weight Method",
"doi": null,
"abstractUrl": "/proceedings-article/mlbdbi/2020/963800a392/1rxhB3Eau88",
"parentPublication": {
"id": "proceedings/mlbdbi/2020/9638/0",
"title": "2020 2nd International Conference on Machine Learning, Big Data and Business Intelligence (MLBDBI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08705338",
"articleId": "19JpVC20LFS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08718406",
"articleId": "1nzv2pdVAqY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1GZokjZcWFq",
"doi": "10.1109/TVCG.2022.3209476",
"abstract": "The visual analytics community has proposed several user modeling algorithms to capture and analyze users' interaction behavior in order to assist users in data exploration and insight generation. For example, some can detect exploration biases while others can predict data points that the user will interact with before that interaction occurs. Researchers believe this collection of algorithms can help create more intelligent visual analytics tools. However, the community lacks a rigorous evaluation and comparison of these existing techniques. As a result, there is limited guidance on which method to use and when. Our paper seeks to fill in this missing gap by comparing and ranking eight user modeling algorithms based on their performance on a diverse set of four user study datasets. We analyze exploration bias detection, data interaction prediction, and algorithmic complexity, among other measures. Based on our findings, we highlight open challenges and new directions for analyzing user interactions and visualization provenance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The visual analytics community has proposed several user modeling algorithms to capture and analyze users' interaction behavior in order to assist users in data exploration and insight generation. For example, some can detect exploration biases while others can predict data points that the user will interact with before that interaction occurs. Researchers believe this collection of algorithms can help create more intelligent visual analytics tools. However, the community lacks a rigorous evaluation and comparison of these existing techniques. As a result, there is limited guidance on which method to use and when. Our paper seeks to fill in this missing gap by comparing and ranking eight user modeling algorithms based on their performance on a diverse set of four user study datasets. We analyze exploration bias detection, data interaction prediction, and algorithmic complexity, among other measures. Based on our findings, we highlight open challenges and new directions for analyzing user interactions and visualization provenance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The visual analytics community has proposed several user modeling algorithms to capture and analyze users' interaction behavior in order to assist users in data exploration and insight generation. For example, some can detect exploration biases while others can predict data points that the user will interact with before that interaction occurs. Researchers believe this collection of algorithms can help create more intelligent visual analytics tools. However, the community lacks a rigorous evaluation and comparison of these existing techniques. As a result, there is limited guidance on which method to use and when. Our paper seeks to fill in this missing gap by comparing and ranking eight user modeling algorithms based on their performance on a diverse set of four user study datasets. We analyze exploration bias detection, data interaction prediction, and algorithmic complexity, among other measures. Based on our findings, we highlight open challenges and new directions for analyzing user interactions and visualization provenance.",
"title": "A Unified Comparison of User Modeling Techniques for Predicting Data Interaction and Detecting Exploration Bias",
"normalizedTitle": "A Unified Comparison of User Modeling Techniques for Predicting Data Interaction and Detecting Exploration Bias",
"fno": "09903515",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"User Modelling",
"Algorithmic Complexity",
"Data Exploration",
"Data Interaction Prediction",
"Data Points",
"Detecting Exploration Bias",
"Exploration Bias Detection",
"Exploration Biases",
"Insight Generation",
"Intelligent Visual Analytics Tools",
"Predicting Data Interaction",
"Rigorous Evaluation",
"Unified Comparison",
"User Interactions",
"User Modeling Algorithms",
"User Modeling Techniques",
"User Study Datasets",
"Users",
"Visual Analytics Community",
"Visualization Provenance",
"Data Models",
"Prediction Algorithms",
"Analytical Models",
"Hidden Markov Models",
"Visual Analytics",
"Task Analysis",
"Predictive Models",
"Visual Analytics",
"Analytic Provenance",
"User Interaction Modeling",
"Machine Learning",
"Benchmark Study"
],
"authors": [
{
"givenName": "Sunwoo",
"surname": "Ha",
"fullName": "Sunwoo Ha",
"affiliation": "Washington University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shayan",
"surname": "Monadjemi",
"fullName": "Shayan Monadjemi",
"affiliation": "Washington University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Roman",
"surname": "Garnett",
"fullName": "Roman Garnett",
"affiliation": "Washington University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alvitta",
"surname": "Ottley",
"fullName": "Alvitta Ottley",
"affiliation": "Washington University, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "483-492",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "mags/cg/2018/05/mcg2018050038",
"title": "VitalVizor: A Visual Analytics System for Studying Urban Vitality",
"doi": null,
"abstractUrl": "/magazine/cg/2018/05/mcg2018050038/13WBGNxhc5X",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2014/02/mcg2014020048",
"title": "Visual Exploration of Parameter Influence on Phylogenetic Trees",
"doi": null,
"abstractUrl": "/magazine/cg/2014/02/mcg2014020048/13rRUIJuxxX",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07534759",
"title": "A Grammar-based Approach for Modeling User Interactions and Generating Suggestions During the Data Exploration Process",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07534759/13rRUxE04tG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2015/04/mcg2015040094",
"title": "Semantic Interaction: Coupling Cognition and Computation through Usable Interactive Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2015/04/mcg2015040094/13rRUxOveck",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539597",
"title": "TopicLens: Efficient Multi-Level Visual Topic Exploration of Large-Scale Document Collections",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539597/13rRUy0qnLK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192717",
"title": "Reducing Snapshots to Points: A Visual Analytics Approach to Dynamic Network Exploration",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192717/13rRUyp7tWY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903295",
"title": "LargeNetVis: Visual Exploration of Large Temporal Networks Based on Community Taxonomies",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903295/1GZokLgYdTW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlui/2018/4063/0/10075648",
"title": "Using Hidden Markov Models to Determine Cognitive States of Visual Analytic Users",
"doi": null,
"abstractUrl": "/proceedings-article/mlui/2018/10075648/1LIRyUMEbxm",
"parentPublication": {
"id": "proceedings/mlui/2018/4063/0",
"title": "2018 IEEE Workshop on Machine Learning from User Interaction for Visualization and Analytics (MLUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09224186",
"title": "Competing Models: Inferring Exploration Patterns and Information Relevance via Bayesian Model Selection",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09224186/1nV8hTleAOk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09230430",
"title": "II-20: Intelligent and pragmatic analytic categorization of image collections",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09230430/1o3nARHsQes",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09903601",
"articleId": "1GZonB2mwwM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09904491",
"articleId": "1H1gs8qCjdu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Jgw3BmSnII",
"name": "ttg202301-09903515s1-tvcg-3209476-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09903515s1-tvcg-3209476-mm.zip",
"extension": "zip",
"size": "17 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCaLEju",
"title": "Jan.",
"year": "2018",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwkxc5r",
"doi": "10.1109/TVCG.2017.2745320",
"abstract": "Event sequence data such as electronic health records, a person's academic records, or car service records, are ordered series of events which have occurred over a period of time. Analyzing collections of event sequences can reveal common or semantically important sequential patterns. For example, event sequence analysis might reveal frequently used care plans for treating a disease, typical publishing patterns of professors, and the patterns of service that result in a well-maintained car. It is challenging, however, to visually explore large numbers of event sequences, or sequences with large numbers of event types. Existing methods focus on extracting explicitly matching patterns of events using statistical analysis to create stages of event progression over time. However, these methods fail to capture latent clusters of similar but not identical evolutions of event sequences. In this paper, we introduce a novel visualization system named EventThread which clusters event sequences into threads based on tensor analysis and visualizes the latent stage categories and evolution patterns by interactively grouping the threads by similarity into time-specific clusters. We demonstrate the effectiveness of EventThread through usage scenarios in three different application domains and via interviews with an expert user.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Event sequence data such as electronic health records, a person's academic records, or car service records, are ordered series of events which have occurred over a period of time. Analyzing collections of event sequences can reveal common or semantically important sequential patterns. For example, event sequence analysis might reveal frequently used care plans for treating a disease, typical publishing patterns of professors, and the patterns of service that result in a well-maintained car. It is challenging, however, to visually explore large numbers of event sequences, or sequences with large numbers of event types. Existing methods focus on extracting explicitly matching patterns of events using statistical analysis to create stages of event progression over time. However, these methods fail to capture latent clusters of similar but not identical evolutions of event sequences. In this paper, we introduce a novel visualization system named EventThread which clusters event sequences into threads based on tensor analysis and visualizes the latent stage categories and evolution patterns by interactively grouping the threads by similarity into time-specific clusters. We demonstrate the effectiveness of EventThread through usage scenarios in three different application domains and via interviews with an expert user.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Event sequence data such as electronic health records, a person's academic records, or car service records, are ordered series of events which have occurred over a period of time. Analyzing collections of event sequences can reveal common or semantically important sequential patterns. For example, event sequence analysis might reveal frequently used care plans for treating a disease, typical publishing patterns of professors, and the patterns of service that result in a well-maintained car. It is challenging, however, to visually explore large numbers of event sequences, or sequences with large numbers of event types. Existing methods focus on extracting explicitly matching patterns of events using statistical analysis to create stages of event progression over time. However, these methods fail to capture latent clusters of similar but not identical evolutions of event sequences. In this paper, we introduce a novel visualization system named EventThread which clusters event sequences into threads based on tensor analysis and visualizes the latent stage categories and evolution patterns by interactively grouping the threads by similarity into time-specific clusters. We demonstrate the effectiveness of EventThread through usage scenarios in three different application domains and via interviews with an expert user.",
"title": "EventThread: Visual Summarization and Stage Analysis of Event Sequence Data",
"normalizedTitle": "EventThread: Visual Summarization and Stage Analysis of Event Sequence Data",
"fno": "08017612",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Visualization",
"Automobiles",
"Hidden Markov Models",
"Algorithm Design And Analysis",
"Semantics",
"Clustering Algorithms",
"Visual Knowledge Representation",
"Visual Knowledge Discovery",
"Data Clustering",
"Time Series Data",
"Illustrative Visualization"
],
"authors": [
{
"givenName": "Shunan",
"surname": "Guo",
"fullName": "Shunan Guo",
"affiliation": "East China Normal University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ke",
"surname": "Xu",
"fullName": "Ke Xu",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rongwen",
"surname": "Zhao",
"fullName": "Rongwen Zhao",
"affiliation": "iDVx LabTongji University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Gotz",
"fullName": "David Gotz",
"affiliation": "University of North Carolina, Chapel Hill",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongyuan",
"surname": "Zha",
"fullName": "Hongyuan Zha",
"affiliation": "East China Normal University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nan",
"surname": "Cao",
"fullName": "Nan Cao",
"affiliation": "iDVx LabTongji University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "trans",
"pages": "56-65",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vast/2016/5661/0/07883512",
"title": "EventAction: Visual analytics for temporal event sequence recommendation",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2016/07883512/12OmNBDQbnR",
"parentPublication": {
"id": "proceedings/vast/2016/5661/0",
"title": "2016 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2012/4752/0/06400494",
"title": "Visual cluster exploration of web clickstream data",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2012/06400494/12OmNxHJ9t7",
"parentPublication": {
"id": "proceedings/vast/2012/4752/0",
"title": "2012 IEEE Conference on Visual Analytics Science and Technology (VAST 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2014/6227/0/07042504",
"title": "Visual process mining: Event data exploration and analysis",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042504/12OmNzcPAxM",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122227",
"title": "Temporal Event Sequence Simplification",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122227/13rRUwjXZSd",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vds/2017/3185/0/08573439",
"title": "Clear Visual Separation of Temporal Event Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/vds/2017/08573439/17D45W9KVGv",
"parentPublication": {
"id": "proceedings/vds/2017/3185/0",
"title": "2017 IEEE Visualization in Data Science (VDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440811",
"title": "Visual Progression Analysis of Event Sequence Data",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440811/17D45WXIkG6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933770",
"title": "Analyzing Time Attributes in Temporal Event Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933770/1fTgG41zCqA",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222294",
"title": "Visual Causality Analysis of Event Sequence Data",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222294/1nTqOCPOdTq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2021/03/09272840",
"title": "Anomalous Event Sequence Detection",
"doi": null,
"abstractUrl": "/magazine/ex/2021/03/09272840/1p6aQYYP55e",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09497654",
"title": "Survey on Visual Analysis of Event Sequence Data",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09497654/1vzYfkJCG64",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08025640",
"articleId": "13rRUyft7D8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08022969",
"articleId": "13rRUygBw7g",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFv2",
"name": "ttg201801-08017612s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201801-08017612s1.zip",
"extension": "zip",
"size": "55.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCaLEju",
"title": "Jan.",
"year": "2018",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyft7D8",
"doi": "10.1109/TVCG.2017.2745083",
"abstract": "Event sequences analysis plays an important role in many application domains such as customer behavior analysis, electronic health record analysis and vehicle fault diagnosis. Real-world event sequence data is often noisy and complex with high event cardinality, making it a challenging task to construct concise yet comprehensive overviews for such data. In this paper, we propose a novel visualization technique based on the minimum description length (MDL) principle to construct a coarse-level overview of event sequence data while balancing the information loss in it. The method addresses a fundamental trade-off in visualization design: reducing visual clutter vs. increasing the information content in a visualization. The method enables simultaneous sequence clustering and pattern extraction and is highly tolerant to noises such as missing or additional events in the data. Based on this approach we propose a visual analytics framework with multiple levels-of-detail to facilitate interactive data exploration. We demonstrate the usability and effectiveness of our approach through case studies with two real-world datasets. One dataset showcases a new application domain for event sequence visualization, i.e., fault development path analysis in vehicles for predictive maintenance. We also discuss the strengths and limitations of the proposed method based on user feedback.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Event sequences analysis plays an important role in many application domains such as customer behavior analysis, electronic health record analysis and vehicle fault diagnosis. Real-world event sequence data is often noisy and complex with high event cardinality, making it a challenging task to construct concise yet comprehensive overviews for such data. In this paper, we propose a novel visualization technique based on the minimum description length (MDL) principle to construct a coarse-level overview of event sequence data while balancing the information loss in it. The method addresses a fundamental trade-off in visualization design: reducing visual clutter vs. increasing the information content in a visualization. The method enables simultaneous sequence clustering and pattern extraction and is highly tolerant to noises such as missing or additional events in the data. Based on this approach we propose a visual analytics framework with multiple levels-of-detail to facilitate interactive data exploration. We demonstrate the usability and effectiveness of our approach through case studies with two real-world datasets. One dataset showcases a new application domain for event sequence visualization, i.e., fault development path analysis in vehicles for predictive maintenance. We also discuss the strengths and limitations of the proposed method based on user feedback.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Event sequences analysis plays an important role in many application domains such as customer behavior analysis, electronic health record analysis and vehicle fault diagnosis. Real-world event sequence data is often noisy and complex with high event cardinality, making it a challenging task to construct concise yet comprehensive overviews for such data. In this paper, we propose a novel visualization technique based on the minimum description length (MDL) principle to construct a coarse-level overview of event sequence data while balancing the information loss in it. The method addresses a fundamental trade-off in visualization design: reducing visual clutter vs. increasing the information content in a visualization. The method enables simultaneous sequence clustering and pattern extraction and is highly tolerant to noises such as missing or additional events in the data. Based on this approach we propose a visual analytics framework with multiple levels-of-detail to facilitate interactive data exploration. We demonstrate the usability and effectiveness of our approach through case studies with two real-world datasets. One dataset showcases a new application domain for event sequence visualization, i.e., fault development path analysis in vehicles for predictive maintenance. We also discuss the strengths and limitations of the proposed method based on user feedback.",
"title": "Sequence Synopsis: Optimize Visual Summary of Temporal Event Data",
"normalizedTitle": "Sequence Synopsis: Optimize Visual Summary of Temporal Event Data",
"fno": "08025640",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Data Mining",
"Algorithm Design And Analysis",
"Data Models",
"Visual Analytics",
"Noise Measurement",
"Time Series Data",
"Data Transformation And Representation",
"Visual Knowledge Representation",
"Visual Analytics"
],
"authors": [
{
"givenName": "Yuanzhe",
"surname": "Chen",
"fullName": "Yuanzhe Chen",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Panpan",
"surname": "Xu",
"fullName": "Panpan Xu",
"affiliation": "Bosch Research North America, Palo Alto, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Liu",
"surname": "Ren",
"fullName": "Liu Ren",
"affiliation": "Bosch Research North America, Palo Alto, CA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "trans",
"pages": "45-55",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bigcomp/2018/3649/0/364901a009",
"title": "Visual Analysis of Spatio-Temporal Distribution and Retweet Relation in Weibo Event",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2018/364901a009/12OmNxFaLCs",
"parentPublication": {
"id": "proceedings/bigcomp/2018/3649/0",
"title": "2018 IEEE International Conference on Big Data and Smart Computing (BigComp)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/12/07368928",
"title": "What May Visualization Processes Optimize?",
"doi": null,
"abstractUrl": "/journal/tg/2016/12/07368928/13rRUILLkDV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440811",
"title": "Visual Progression Analysis of Event Sequence Data",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440811/17D45WXIkG6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807220",
"title": "Visual Analysis of High-Dimensional Event Sequence Data via Dynamic Hierarchical Aggregation",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807220/1cG6bfa8KkM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933770",
"title": "Analyzing Time Attributes in Temporal Event Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933770/1fTgG41zCqA",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222294",
"title": "Visual Causality Analysis of Event Sequence Data",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222294/1nTqOCPOdTq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2020/8009/0/800900a036",
"title": "Visual Analytics of Multivariate Event Sequence Data in Racquet Sports",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2020/800900a036/1q7jwkJx00U",
"parentPublication": {
"id": "proceedings/vast/2020/8009/0",
"title": "2020 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/08/09316994",
"title": "Visual Drift Detection for Event Sequence Data of Business Processes",
"doi": null,
"abstractUrl": "/journal/tg/2022/08/09316994/1qdT8aC5c1q",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09497654",
"title": "Survey on Visual Analysis of Event Sequence Data",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09497654/1vzYfkJCG64",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09557226",
"title": "Sequen-C: A Multilevel Overview of Temporal Event Sequences",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09557226/1xlw03gAaKQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08017616",
"articleId": "13rRUyY294H",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08017612",
"articleId": "13rRUwkxc5r",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRJs",
"name": "ttg201801-08025640s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201801-08025640s1.zip",
"extension": "zip",
"size": "77.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1qL5hsvvVkc",
"title": "Feb.",
"year": "2021",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1nTqOCPOdTq",
"doi": "10.1109/TVCG.2020.3030465",
"abstract": "Causality is crucial to understanding the mechanisms behind complex systems and making decisions that lead to intended outcomes. Event sequence data is widely collected from many real-world processes, such as electronic health records, web clickstreams, and financial transactions, which transmit a great deal of information reflecting the causal relations among event types. Unfortunately, recovering causalities from observational event sequences is challenging, as the heterogeneous and high-dimensional event variables are often connected to rather complex underlying event excitation mechanisms that are hard to infer from limited observations. Many existing automated causal analysis techniques suffer from poor explainability and fail to include an adequate amount of human knowledge. In this paper, we introduce a visual analytics method for recovering causalities in event sequence data. We extend the Granger causality analysis algorithm on Hawkes processes to incorporate user feedback into causal model refinement. The visualization system includes an interactive causal analysis framework that supports bottom-up causal exploration, iterative causal verification and refinement, and causal comparison through a set of novel visualizations and interactions. We report two forms of evaluation: a quantitative evaluation of the model improvements resulting from the user-feedback mechanism, and a qualitative evaluation through case studies in different application domains to demonstrate the usefulness of the system.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Causality is crucial to understanding the mechanisms behind complex systems and making decisions that lead to intended outcomes. Event sequence data is widely collected from many real-world processes, such as electronic health records, web clickstreams, and financial transactions, which transmit a great deal of information reflecting the causal relations among event types. Unfortunately, recovering causalities from observational event sequences is challenging, as the heterogeneous and high-dimensional event variables are often connected to rather complex underlying event excitation mechanisms that are hard to infer from limited observations. Many existing automated causal analysis techniques suffer from poor explainability and fail to include an adequate amount of human knowledge. In this paper, we introduce a visual analytics method for recovering causalities in event sequence data. We extend the Granger causality analysis algorithm on Hawkes processes to incorporate user feedback into causal model refinement. The visualization system includes an interactive causal analysis framework that supports bottom-up causal exploration, iterative causal verification and refinement, and causal comparison through a set of novel visualizations and interactions. We report two forms of evaluation: a quantitative evaluation of the model improvements resulting from the user-feedback mechanism, and a qualitative evaluation through case studies in different application domains to demonstrate the usefulness of the system.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Causality is crucial to understanding the mechanisms behind complex systems and making decisions that lead to intended outcomes. Event sequence data is widely collected from many real-world processes, such as electronic health records, web clickstreams, and financial transactions, which transmit a great deal of information reflecting the causal relations among event types. Unfortunately, recovering causalities from observational event sequences is challenging, as the heterogeneous and high-dimensional event variables are often connected to rather complex underlying event excitation mechanisms that are hard to infer from limited observations. Many existing automated causal analysis techniques suffer from poor explainability and fail to include an adequate amount of human knowledge. In this paper, we introduce a visual analytics method for recovering causalities in event sequence data. We extend the Granger causality analysis algorithm on Hawkes processes to incorporate user feedback into causal model refinement. The visualization system includes an interactive causal analysis framework that supports bottom-up causal exploration, iterative causal verification and refinement, and causal comparison through a set of novel visualizations and interactions. We report two forms of evaluation: a quantitative evaluation of the model improvements resulting from the user-feedback mechanism, and a qualitative evaluation through case studies in different application domains to demonstrate the usefulness of the system.",
"title": "Visual Causality Analysis of Event Sequence Data",
"normalizedTitle": "Visual Causality Analysis of Event Sequence Data",
"fno": "09222294",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Bayes Methods",
"Causality",
"Data Analysis",
"Data Mining",
"Data Visualisation",
"Interactive Systems",
"Iterative Methods",
"Observational Event Sequences",
"Heterogeneous Event Variables",
"High Dimensional Event Variables",
"Event Excitation Mechanisms",
"Event Sequence Data",
"Granger Causality Analysis Algorithm",
"Causal Model Refinement",
"Visualization System",
"Interactive Causal Analysis Framework",
"Bottom Up Causal Exploration",
"Iterative Causal Verification",
"Visual Causality Analysis",
"Causal Relations",
"Hawkes Processes",
"User Feedback",
"Analytical Models",
"Visual Analytics",
"Data Visualization",
"Data Models",
"Layout",
"Computational Modeling",
"Event Sequence Data",
"Causality Analysis",
"Visual Analytics"
],
"authors": [
{
"givenName": "Zhuochen",
"surname": "Jin",
"fullName": "Zhuochen Jin",
"affiliation": "iDVx Lab at Tongji University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shunan",
"surname": "Guo",
"fullName": "Shunan Guo",
"affiliation": "iDVx Lab at Tongji University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nan",
"surname": "Chen",
"fullName": "Nan Chen",
"affiliation": "iDVx Lab at Tongji University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Weiskopf",
"fullName": "Daniel Weiskopf",
"affiliation": "University of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Gotz",
"fullName": "David Gotz",
"affiliation": "University of North Carolina at Chapel Hill",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nan",
"surname": "Cao",
"fullName": "Nan Cao",
"affiliation": "iDVx Lab at Tongji University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "1343-1352",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3pgcic/2014/4171/0/4171a316",
"title": "Discovering Many-to-One Causality in Software Project Risk Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/3pgcic/2014/4171a316/12OmNBNM8Rx",
"parentPublication": {
"id": "proceedings/3pgcic/2014/4171/0",
"title": "2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2010/6984/0/05539871",
"title": "Temporal causality for the analysis of visual events",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2010/05539871/12OmNzYNN5s",
"parentPublication": {
"id": "proceedings/cvpr/2010/6984/0",
"title": "2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08025640",
"title": "Sequence Synopsis: Optimize Visual Summary of Temporal Event Data",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08025640/13rRUyft7D8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2017/3163/0/08585647",
"title": "Visual Causality Analysis Made Practical",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2017/08585647/17D45VTRouU",
"parentPublication": {
"id": "proceedings/vast/2017/3163/0",
"title": "2017 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vissoft/2022/8092/0/809200a005",
"title": "ViSRE: A Unified Visual Analysis Dashboard for Proactive Cloud Outage Management",
"doi": null,
"abstractUrl": "/proceedings-article/vissoft/2022/809200a005/1JeEHP20yRy",
"parentPublication": {
"id": "proceedings/vissoft/2022/8092/0",
"title": "2022 Working Conference on Software Visualization (VISSOFT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2022/5099/0/509900a091",
"title": "Causality Enhanced Societal Event Forecasting With Heterogeneous Graph Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2022/509900a091/1KpCwzogmt2",
"parentPublication": {
"id": "proceedings/icdm/2022/5099/0",
"title": "2022 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807220",
"title": "Visual Analysis of High-Dimensional Event Sequence Data via Dynamic Hierarchical Aggregation",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807220/1cG6bfa8KkM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdcat/2019/2616/0/261600a352",
"title": "Event Causality Detection in Tweets by Context Word Extension and Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/pdcat/2019/261600a352/1iff472TreE",
"parentPublication": {
"id": "proceedings/pdcat/2019/2616/0",
"title": "2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09497654",
"title": "Survey on Visual Analysis of Event Sequence Data",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09497654/1vzYfkJCG64",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09557222",
"title": "Compass: Towards Better Causal Analysis of Urban Time Series",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09557222/1xlvZ1jrwLC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09222357",
"articleId": "1nTqwapYWYw",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09231271",
"articleId": "1o3nzyjYTbG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLeAmfkxos",
"name": "ttg202102-09222294s1-supp1-3030465.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222294s1-supp1-3030465.mp4",
"extension": "mp4",
"size": "74 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyr8Ysi",
"title": "Mar.-Apr.",
"year": "2017",
"issueNum": "02",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "19",
"label": "Mar.-Apr.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwwaKmg",
"doi": "10.1109/MCSE.2017.38",
"abstract": "IEEE VIS 2016 brought together researchers and practitioners to discuss the latest developments in visualization and visual analytics research and their applications. The authors describe the highlights of the 2016 event.",
"abstracts": [
{
"abstractType": "Regular",
"content": "IEEE VIS 2016 brought together researchers and practitioners to discuss the latest developments in visualization and visual analytics research and their applications. The authors describe the highlights of the 2016 event.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "IEEE VIS 2016 brought together researchers and practitioners to discuss the latest developments in visualization and visual analytics research and their applications. The authors describe the highlights of the 2016 event.",
"title": "A report from VIS 2016",
"normalizedTitle": "A report from VIS 2016",
"fno": "mcs2017020082",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Data Visualization",
"Scientific Computing",
"Market Research",
"Visual Analytics",
"Algorithm Design And Analysis",
"Encoding",
"Image Color Analysis",
"Visualization",
"IEEE VIS 2016",
"Scientific Computing"
],
"authors": [
{
"givenName": "Joao",
"surname": "Comba",
"fullName": "Joao Comba",
"affiliation": "Federal University of Rio Grande do Sul",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Filip",
"surname": "Sadlo",
"fullName": "Filip Sadlo",
"affiliation": "Heidelberg University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Weiskopf",
"fullName": "Daniel Weiskopf",
"affiliation": "University of Stuttgart",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": false,
"isOpenAccess": true,
"issueNum": "02",
"pubDate": "2017-03-01 00:00:00",
"pubType": "mags",
"pages": "82-90",
"year": "2017",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "mcs2017020079",
"articleId": "13rRUwh80OH",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcs2017020091",
"articleId": "13rRUxBJhz9",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrFBPWq",
"title": "September-October",
"year": "2006",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "12",
"label": "September-October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwwaKsX",
"doi": "10.1109/TVCG.2006.191",
"abstract": "These pre-pages to the issue contain a table of contents, a list of supporting organizations, a message from the Editor-in-Chief, the preface, committee and reviewer listings, 2005 visualization awards, and the keynote and capstone addressess for Vis and InfoVis.",
"abstracts": [
{
"abstractType": "Regular",
"content": "These pre-pages to the issue contain a table of contents, a list of supporting organizations, a message from the Editor-in-Chief, the preface, committee and reviewer listings, 2005 visualization awards, and the keynote and capstone addressess for Vis and InfoVis.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "These pre-pages to the issue contain a table of contents, a list of supporting organizations, a message from the Editor-in-Chief, the preface, committee and reviewer listings, 2005 visualization awards, and the keynote and capstone addressess for Vis and InfoVis.",
"title": "Vis/InfoVis 2006 pre-pages",
"normalizedTitle": "Vis/InfoVis 2006 pre-pages",
"fno": "vispre",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Visualization",
"Conferences",
"Social Networking Online",
"Time Varying Systems",
"Pipelines"
],
"authors": [],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "trans",
"pages": "vispre-vispre",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2006/06/v1461",
"title": "A Visualization System for Space-Time and Multivariate Patterns (VIS-STAMP)",
"doi": null,
"abstractUrl": "/journal/tg/2006/06/v1461/13rRUwgQpDk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2022/8563/0/09859600",
"title": "Source-ID-Tracker: Source Face Identity Protection in Face Swapping",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2022/09859600/1G9DSLVRz1K",
"parentPublication": {
"id": "proceedings/icme/2022/8563/0",
"title": "2022 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600d971",
"title": "Pix2NeRF: Unsupervised Conditional <tex>Z_$\\pi$_Z</tex>-GAN for Single Image to Neural Radiance Fields Translation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600d971/1H0Ncx9nVbW",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020314",
"title": "Pre-train Graph Neural Networks for Brain Network Analysis (Extended Abstract)",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020314/1KfSe5Vmi88",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aciiw/2022/5490/0/10086020",
"title": "AI Training for Thunderstorm Training: Better Situational Awareness for Disaster Tweets Using Context and Emotions",
"doi": null,
"abstractUrl": "/proceedings-article/aciiw/2022/10086020/1M666XlYYak",
"parentPublication": {
"id": "proceedings/aciiw/2022/5490/0",
"title": "2022 10th International Conference on Affective Computing and Intelligent Interaction Workshops and Demos (ACIIW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2018/6861/0/08802415",
"title": "Segue: Overviewing Evolution Patterns of Egocentric Networks by Interactive Construction of Spatial Layouts",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2018/08802415/1cJ6WDNOqXK",
"parentPublication": {
"id": "proceedings/vast/2018/6861/0",
"title": "2018 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2010/9488/0/05649054",
"title": "VAST 2010 Challenge: Arms dealings and pandemics",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2010/05649054/1iCAmnTV5Uk",
"parentPublication": {
"id": "proceedings/vast/2010/9488/0",
"title": "2010 IEEE Symposium on Visual Analytics Science and Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/sp/2020/06/09134384",
"title": "Forensic Event Analysis: From Seemingly Unrelated Data to Understanding",
"doi": null,
"abstractUrl": "/magazine/sp/2020/06/09134384/1lgLuuW9Pna",
"parentPublication": {
"id": "mags/sp",
"title": "IEEE Security & Privacy",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "v0669",
"articleId": "13rRUwkfAZ7",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAgY7py",
"title": "Nov.-Dec.",
"year": "2015",
"issueNum": "06",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "35",
"label": "Nov.-Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyuegjp",
"doi": "10.1109/MCG.2015.124",
"abstract": "Andrea Polli has been working at the intersection of art, science, and technology since 1999. With degrees in both art and computing, she comes to collaborations with a solid art training and extensive practical experience. Her projects focus on creating opportunities for collaborators and student researchers to participate in public projects that express environmental data and information in new ways. In this interview with department editors Bruce Campbell and Francesca Samsel, Polli discusses how she has implemented a \"slow vis\" approach to real-time visualization in large-scale public art installations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Andrea Polli has been working at the intersection of art, science, and technology since 1999. With degrees in both art and computing, she comes to collaborations with a solid art training and extensive practical experience. Her projects focus on creating opportunities for collaborators and student researchers to participate in public projects that express environmental data and information in new ways. In this interview with department editors Bruce Campbell and Francesca Samsel, Polli discusses how she has implemented a \"slow vis\" approach to real-time visualization in large-scale public art installations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Andrea Polli has been working at the intersection of art, science, and technology since 1999. With degrees in both art and computing, she comes to collaborations with a solid art training and extensive practical experience. Her projects focus on creating opportunities for collaborators and student researchers to participate in public projects that express environmental data and information in new ways. In this interview with department editors Bruce Campbell and Francesca Samsel, Polli discusses how she has implemented a \"slow vis\" approach to real-time visualization in large-scale public art installations.",
"title": "Slow Vis: Extending Opportunities for Insight and Understanding Over Time",
"normalizedTitle": "Slow Vis: Extending Opportunities for Insight and Understanding Over Time",
"fno": "mcg2015060006",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Visualization",
"Art",
"Collaboration",
"Media",
"Visualization",
"Climate Data",
"Computer Graphics",
"Art Science Collaborations",
"Slow Vis",
"Real Time Visualization",
"Soundscapes",
"Sonification"
],
"authors": [
{
"givenName": "Bruce D.",
"surname": "Campbell",
"fullName": "Bruce D. Campbell",
"affiliation": "Rhode Island School of Design",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Francesca",
"surname": "Samsel",
"fullName": "Francesca Samsel",
"affiliation": "University of Texas-Austin",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2015-11-01 00:00:00",
"pubType": "mags",
"pages": "6-10",
"year": "2015",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2015/7568/0/7568z026",
"title": "D-Art Gallery 2015",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2015/7568z026/12OmNz6iOK6",
"parentPublication": {
"id": "proceedings/iv/2015/7568/0",
"title": "2015 19th International Conference on Information Visualisation (iV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2016/8942/0/8942a294",
"title": "Case Studies of Digital and Media Art 56°56'51\"N 24°6'23\"E",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2016/8942a294/12OmNzVXNWE",
"parentPublication": {
"id": "proceedings/iv/2016/8942/0",
"title": "2016 20th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2014/4677/0/4677a399",
"title": "Folding Pattern: A Study about Perception",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2014/4677a399/12OmNzYeB0r",
"parentPublication": {
"id": "proceedings/cw/2014/4677/0",
"title": "2014 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisis/2014/4325/0/4325a558",
"title": "Ontology-Based Visualisation of Cultural Heritage",
"doi": null,
"abstractUrl": "/proceedings-article/cisis/2014/4325a558/12OmNzaQox0",
"parentPublication": {
"id": "proceedings/cisis/2014/4325/0",
"title": "2014 Eighth International Conference on Complex, Intelligent and Software Intensive Systems (CISIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mu/2015/02/mmu2015020018",
"title": "Machines Learning Culture",
"doi": null,
"abstractUrl": "/magazine/mu/2015/02/mmu2015020018/13rRUwInvi4",
"parentPublication": {
"id": "mags/mu",
"title": "IEEE MultiMedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2015/04/mcg2015040008",
"title": "Murmurations: Drawing Together Art, Visualization, and Physical Phenomena",
"doi": null,
"abstractUrl": "/magazine/cg/2015/04/mcg2015040008/13rRUzphDsy",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/02/08673007",
"title": "Lance Gharavi: Performance Inspired Science + Technology",
"doi": null,
"abstractUrl": "/magazine/cg/2019/02/08673007/18BI2phTXCE",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2022/01/09693361",
"title": "Nathalie Miebach: Sculpted Data Infused With Craftsmanship",
"doi": null,
"abstractUrl": "/magazine/cg/2022/01/09693361/1As7BQ6zkha",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/04/08739138",
"title": "Victoria Vesna: Inviting Meaningful Organic Art–Science Collaboration",
"doi": null,
"abstractUrl": "/magazine/cg/2019/04/08739138/1aXM6zchJRu",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis/2019/0801/0/08940301",
"title": "Visualization Analysis of Academic Social Network Based on Three Art Universities",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2019/08940301/1gjRPpUDcGY",
"parentPublication": {
"id": "proceedings/icis/2019/0801/0",
"title": "2019 IEEE/ACIS 18th International Conference on Computer and Information Science (ICIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2015060005",
"articleId": "13rRUwInv6V",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2015060011",
"articleId": "13rRUwwslyJ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyPQ4Dx",
"title": "Dec.",
"year": "2012",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvgyWm",
"doi": "10.1109/TVCG.2012.244",
"abstract": "Interactive visualizations can allow science museum visitors to explore new worlds by seeing and interacting with scientific data. However, designing interactive visualizations for informal learning environments, such as museums, presents several challenges. First, visualizations must engage visitors on a personal level. Second, visitors often lack the background to interpret visualizations of scientific data. Third, visitors have very limited time at individual exhibits in museums. This paper examines these design considerations through the iterative development and evaluation of an interactive exhibit as a visualization tool that gives museumgoers access to scientific data generated and used by researchers. The exhibit prototype, Living Liquid, encourages visitors to ask and answer their own questions while exploring the time-varying global distribution of simulated marine microbes using a touchscreen interface. Iterative development proceeded through three rounds of formative evaluations using think-aloud protocols and interviews, each round informing a key visualization design decision: (1) what to visualize to initiate inquiry, (2) how to link data at the microscopic scale to global patterns, and (3) how to include additional data that allows visitors to pursue their own questions. Data from visitor evaluations suggests that, when designing visualizations for public audiences, one should (1) avoid distracting visitors from data that they should explore, (2) incorporate background information into the visualization, (3) favor understandability over scientific accuracy, and (4) layer data accessibility to structure inquiry. Lessons learned from this case study add to our growing understanding of how to use visualizations to actively engage learners with scientific data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Interactive visualizations can allow science museum visitors to explore new worlds by seeing and interacting with scientific data. However, designing interactive visualizations for informal learning environments, such as museums, presents several challenges. First, visualizations must engage visitors on a personal level. Second, visitors often lack the background to interpret visualizations of scientific data. Third, visitors have very limited time at individual exhibits in museums. This paper examines these design considerations through the iterative development and evaluation of an interactive exhibit as a visualization tool that gives museumgoers access to scientific data generated and used by researchers. The exhibit prototype, Living Liquid, encourages visitors to ask and answer their own questions while exploring the time-varying global distribution of simulated marine microbes using a touchscreen interface. Iterative development proceeded through three rounds of formative evaluations using think-aloud protocols and interviews, each round informing a key visualization design decision: (1) what to visualize to initiate inquiry, (2) how to link data at the microscopic scale to global patterns, and (3) how to include additional data that allows visitors to pursue their own questions. Data from visitor evaluations suggests that, when designing visualizations for public audiences, one should (1) avoid distracting visitors from data that they should explore, (2) incorporate background information into the visualization, (3) favor understandability over scientific accuracy, and (4) layer data accessibility to structure inquiry. Lessons learned from this case study add to our growing understanding of how to use visualizations to actively engage learners with scientific data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Interactive visualizations can allow science museum visitors to explore new worlds by seeing and interacting with scientific data. However, designing interactive visualizations for informal learning environments, such as museums, presents several challenges. First, visualizations must engage visitors on a personal level. Second, visitors often lack the background to interpret visualizations of scientific data. Third, visitors have very limited time at individual exhibits in museums. This paper examines these design considerations through the iterative development and evaluation of an interactive exhibit as a visualization tool that gives museumgoers access to scientific data generated and used by researchers. The exhibit prototype, Living Liquid, encourages visitors to ask and answer their own questions while exploring the time-varying global distribution of simulated marine microbes using a touchscreen interface. Iterative development proceeded through three rounds of formative evaluations using think-aloud protocols and interviews, each round informing a key visualization design decision: (1) what to visualize to initiate inquiry, (2) how to link data at the microscopic scale to global patterns, and (3) how to include additional data that allows visitors to pursue their own questions. Data from visitor evaluations suggests that, when designing visualizations for public audiences, one should (1) avoid distracting visitors from data that they should explore, (2) incorporate background information into the visualization, (3) favor understandability over scientific accuracy, and (4) layer data accessibility to structure inquiry. Lessons learned from this case study add to our growing understanding of how to use visualizations to actively engage learners with scientific data.",
"title": "Living Liquid: Design and Evaluation of an Exploratory Visualization Tool for Museum Visitors",
"normalizedTitle": "Living Liquid: Design and Evaluation of an Exploratory Visualization Tool for Museum Visitors",
"fno": "ttg2012122799",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Touch Sensitive Screens",
"Data Visualisation",
"Interactive Systems",
"Museums",
"Natural Sciences Computing",
"Think Aloud Protocols",
"Exploratory Visualization Tool",
"Interactive Visualizations",
"Science Museum Visitors",
"Informal Learning Environments",
"Iterative Development",
"Living Liquid",
"Time Varying Global Distribution",
"Simulated Marine Microbes",
"Touchscreen Interface",
"Data Visualization",
"Learning Systems",
"Performance Evaluation",
"Motion Pictures",
"Prototypes",
"Information Analysis",
"Image Color Analysis",
"Informal Learning Environments",
"Information Visualization",
"User Interaction",
"Evaluation",
"User Studies",
"Science Museums"
],
"authors": [
{
"givenName": "J.",
"surname": "Ma",
"fullName": "J. Ma",
"affiliation": "Exploratorium, San Francisco, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "I.",
"surname": "Liao",
"fullName": "I. Liao",
"affiliation": "Univ. of California, Davis, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Kwan-Liu Ma",
"fullName": "Kwan-Liu Ma",
"affiliation": "Univ. of California, Davis, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "J.",
"surname": "Frazier",
"fullName": "J. Frazier",
"affiliation": "Exploratorium, San Francisco, CA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2799-2808",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/2015/7367/0/7367c075",
"title": "Perspectives of Emerging Museum Professionals on the Role of Big Data in Museums",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2015/7367c075/12OmNApculv",
"parentPublication": {
"id": "proceedings/hicss/2015/7367/0",
"title": "2015 48th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2009/3711/0/3711a655",
"title": "Uncovering the Richness of an Authentic Living Museum through Pervasive Learning Environment",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2009/3711a655/12OmNx57HOa",
"parentPublication": {
"id": "proceedings/icalt/2009/3711/0",
"title": "Advanced Learning Technologies, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/pc/2017/02/mpc2017020026",
"title": "Noninvasive Bluetooth Monitoring of Visitors' Length of Stay at the Louvre",
"doi": null,
"abstractUrl": "/magazine/pc/2017/02/mpc2017020026/13rRUwcS1w8",
"parentPublication": {
"id": "mags/pc",
"title": "IEEE Pervasive Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/it/2011/02/mit2011020025",
"title": "RFID-Based Guide Gives Museum Visitors More Freedom",
"doi": null,
"abstractUrl": "/magazine/it/2011/02/mit2011020025/13rRUwjGoCB",
"parentPublication": {
"id": "mags/it",
"title": "IT Professional",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061181",
"title": "EMDialog: Bringing Information Visualization into the Museum",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061181/13rRUxBJhvp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2016/06/mcs2016060068",
"title": "Audience-Targeted Design Considerations for Effective Scientific Storytelling",
"doi": null,
"abstractUrl": "/magazine/cs/2016/06/mcs2016060068/13rRUxZRbvI",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiars/2022/5457/0/545700a237",
"title": "Realization of Digital Museum Design System Based on 3D Technology",
"doi": null,
"abstractUrl": "/proceedings-article/aiars/2022/545700a237/1J2XXMgp9qo",
"parentPublication": {
"id": "proceedings/aiars/2022/5457/0",
"title": "2022 International Conference on Artificial Intelligence and Autonomous Robot Systems (AIARS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ici2st/2022/5517/0/551700a049",
"title": "Evaluating Extended Reality Application for a Virtual Museum. Case Study: Remigio Crespo Museum",
"doi": null,
"abstractUrl": "/proceedings-article/ici2st/2022/551700a049/1Lz2fp83zPi",
"parentPublication": {
"id": "proceedings/ici2st/2022/5517/0",
"title": "2022 Third International Conference on Information Systems and Software Technologies (ICI2ST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805458",
"title": "Decoding a Complex Visualization in a Science Museum – An Empirical Study",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805458/1cG4DDXy75K",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2019/3485/0/348500a357",
"title": "Towards Enhancing User Experience through a Web-Based Augmented Reality Museum",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2019/348500a357/1cYi0fAR90A",
"parentPublication": {
"id": "proceedings/icalt/2019/3485/2161-377X",
"title": "2019 IEEE 19th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012122789",
"articleId": "13rRUxBa5bW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122809",
"articleId": "13rRUwI5TXx",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgMe",
"name": "ttg2012122799s1.doc",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012122799s1.doc",
"extension": "doc",
"size": "43.5 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1qLhZwxtEmA",
"title": "March",
"year": "2021",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1bTRatYkzoA",
"doi": "10.1109/TVCG.2019.2929033",
"abstract": "Immersive analytics (IA) is a new term referring to the use of immersive technologies for data analysis. Yet such applications are not new, and numerous contributions have been made in the last three decades. However, no survey reviewing all these contributions is available. Here we propose a survey of IA from the early nineties until the present day, describing how rendering technologies, data, sensory mapping, and interaction means have been used to build IA systems, as well as how these systems have been evaluated. The conclusions that emerge from our analysis are that: multi-sensory aspects of IA are under-exploited, the 3DUI and VR community knowledge regarding immersive interaction is not sufficiently utilised, the IA community should focus on converging towards best practices, as well as aim for real life IA systems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Immersive analytics (IA) is a new term referring to the use of immersive technologies for data analysis. Yet such applications are not new, and numerous contributions have been made in the last three decades. However, no survey reviewing all these contributions is available. Here we propose a survey of IA from the early nineties until the present day, describing how rendering technologies, data, sensory mapping, and interaction means have been used to build IA systems, as well as how these systems have been evaluated. The conclusions that emerge from our analysis are that: multi-sensory aspects of IA are under-exploited, the 3DUI and VR community knowledge regarding immersive interaction is not sufficiently utilised, the IA community should focus on converging towards best practices, as well as aim for real life IA systems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Immersive analytics (IA) is a new term referring to the use of immersive technologies for data analysis. Yet such applications are not new, and numerous contributions have been made in the last three decades. However, no survey reviewing all these contributions is available. Here we propose a survey of IA from the early nineties until the present day, describing how rendering technologies, data, sensory mapping, and interaction means have been used to build IA systems, as well as how these systems have been evaluated. The conclusions that emerge from our analysis are that: multi-sensory aspects of IA are under-exploited, the 3DUI and VR community knowledge regarding immersive interaction is not sufficiently utilised, the IA community should focus on converging towards best practices, as well as aim for real life IA systems.",
"title": "Survey of Immersive Analytics",
"normalizedTitle": "Survey of Immersive Analytics",
"fno": "08770302",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Human Computer Interaction",
"Rendering Computer Graphics",
"User Interfaces",
"Immersive Interaction",
"Sensory Mapping",
"Rendering Technologies",
"Visual Data Analysis",
"Immersive Technologies",
"Immersive Analytics",
"IA Systems",
"Data Visualization",
"Three Dimensional Displays",
"Data Analysis",
"Rendering Computer Graphics",
"Visualization",
"Data Mining",
"Task Analysis",
"Immersive Analytics",
"Survey",
"Virtual Environments",
"Immersive Environments",
"Data Visualization",
"Information Visualization",
"Scientific Visualization",
"Visual Data Mining"
],
"authors": [
{
"givenName": "Adrien",
"surname": "Fonnet",
"fullName": "Adrien Fonnet",
"affiliation": "LS2N UMR6004 CNRS Univ. of Nantes, Nantes, Loire-Atlantique, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yannick",
"surname": "Prié",
"fullName": "Yannick Prié",
"affiliation": "LS2N UMR6004 CNRS Univ. of Nantes, Nantes, Loire-Atlantique, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2021-03-01 00:00:00",
"pubType": "trans",
"pages": "2101-2122",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2011/935/0/05742364",
"title": "Keynote address: Immersive exploration of large datasets",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742364/12OmNrNh0EJ",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2015/1727/0/07223318",
"title": "Scalability limits of large immersive high-resolution displays",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2015/07223318/12OmNx3HI9C",
"parentPublication": {
"id": "proceedings/vr/2015/1727/0",
"title": "2015 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdva/2015/7343/0/07314296",
"title": "Immersive Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2015/07314296/12OmNzVXNSO",
"parentPublication": {
"id": "proceedings/bdva/2015/7343/0",
"title": "2015 Big Data Visual Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdva/2018/9194/0/08533892",
"title": "Axes and Coordinate Systems Representations for Immersive Analytics of Multi-Dimensional Data",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2018/08533892/17D45WYQJ8j",
"parentPublication": {
"id": "proceedings/bdva/2018/9194/0",
"title": "2018 International Symposium on Big Data Visual and Immersive Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/03/08698351",
"title": "Immersive Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2019/03/08698351/19utOsQX9Nm",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2022/5365/0/536500a131",
"title": "Immersive WYSIWYG virtual meteorological sandbox",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2022/536500a131/1J7Ws6Omo3S",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2022/5365/0",
"title": "2022 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a216",
"title": "Compositional Microservices for Immersive Social Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a216/1cMFalENINq",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2020/5608/0/09089446",
"title": "Graphical Perception for Immersive Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2020/09089446/1jIxfA3tlUk",
"parentPublication": {
"id": "proceedings/vr/2020/5608/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2020/6532/0/09090617",
"title": "Get the job! An immersive simulation of sensory overload",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090617/1jIxiD0E0h2",
"parentPublication": {
"id": "proceedings/vrw/2020/6532/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a086",
"title": "Visualization of similarity queries in an immersive virtual reality environment",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a086/1rSR9H8wsE0",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08839414",
"articleId": "1dqsrINsJsk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09149736",
"articleId": "1lNXGaE3KcU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1vg3jumzhF6",
"title": "July-Aug.",
"year": "2021",
"issueNum": "04",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "41",
"label": "July-Aug.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1vg3n8rdAEU",
"doi": "10.1109/MCG.2021.3075258",
"abstract": "In recent years, research on immersive environments has experienced a new wave of interest, and immersive analytics has been established as a new research field. Every year, a vast amount of different techniques, applications, and user studies are published that focus on employing immersive environments for visualizing and analyzing data. Nevertheless, immersive analytics is still a relatively unexplored field that needs more basic research in many aspects and is still viewed with skepticism. Rightly so, because in our opinion, many researchers do not fully exploit the possibilities offered by immersive environments and, on the contrary, sometimes even overestimate the power of immersive visualizations. Although a growing body of papers has demonstrated individual advantages of immersive analytics for specific tasks and problems, the general benefit of using immersive environments for effective analytic tasks remains controversial. In this article, we reflect on when and how immersion may be appropriate for the analysis and present four guiding scenarios. We report on our experiences, discuss the landscape of assessment strategies, and point out the directions where we believe immersive visualizations have the greatest potential.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In recent years, research on immersive environments has experienced a new wave of interest, and immersive analytics has been established as a new research field. Every year, a vast amount of different techniques, applications, and user studies are published that focus on employing immersive environments for visualizing and analyzing data. Nevertheless, immersive analytics is still a relatively unexplored field that needs more basic research in many aspects and is still viewed with skepticism. Rightly so, because in our opinion, many researchers do not fully exploit the possibilities offered by immersive environments and, on the contrary, sometimes even overestimate the power of immersive visualizations. Although a growing body of papers has demonstrated individual advantages of immersive analytics for specific tasks and problems, the general benefit of using immersive environments for effective analytic tasks remains controversial. In this article, we reflect on when and how immersion may be appropriate for the analysis and present four guiding scenarios. We report on our experiences, discuss the landscape of assessment strategies, and point out the directions where we believe immersive visualizations have the greatest potential.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In recent years, research on immersive environments has experienced a new wave of interest, and immersive analytics has been established as a new research field. Every year, a vast amount of different techniques, applications, and user studies are published that focus on employing immersive environments for visualizing and analyzing data. Nevertheless, immersive analytics is still a relatively unexplored field that needs more basic research in many aspects and is still viewed with skepticism. Rightly so, because in our opinion, many researchers do not fully exploit the possibilities offered by immersive environments and, on the contrary, sometimes even overestimate the power of immersive visualizations. Although a growing body of papers has demonstrated individual advantages of immersive analytics for specific tasks and problems, the general benefit of using immersive environments for effective analytic tasks remains controversial. In this article, we reflect on when and how immersion may be appropriate for the analysis and present four guiding scenarios. We report on our experiences, discuss the landscape of assessment strategies, and point out the directions where we believe immersive visualizations have the greatest potential.",
"title": "The Value of Immersive Visualization",
"normalizedTitle": "The Value of Immersive Visualization",
"fno": "09487524",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Human Computer Interaction",
"Virtual Reality",
"Immersive Analytics",
"Immersive Environments",
"Immersive Visualization",
"Data Analysis",
"Data Visualization",
"Immersion",
"Human Computer Interaction",
"Virtual Reality",
"Data Analysis",
"Data Visualization",
"Tools",
"Spatial Databases",
"Software",
"Hardware",
"Haptic Interfaces"
],
"authors": [
{
"givenName": "Matthias",
"surname": "Kraus",
"fullName": "Matthias Kraus",
"affiliation": "University of Konstanz, Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Karsten",
"surname": "Klein",
"fullName": "Karsten Klein",
"affiliation": "University of Konstanz, Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Johannes",
"surname": "Fuchs",
"fullName": "Johannes Fuchs",
"affiliation": "University of Konstanz, Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel A.",
"surname": "Keim",
"fullName": "Daniel A. Keim",
"affiliation": "University of Konstanz, Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Falk",
"surname": "Schreiber",
"fullName": "Falk Schreiber",
"affiliation": "University of Konstanz, Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Sedlmair",
"fullName": "Michael Sedlmair",
"affiliation": "University of Stuttgart, Stuttgart, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2021-07-01 00:00:00",
"pubType": "mags",
"pages": "125-132",
"year": "2021",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2015/6879/0/07156357",
"title": "Spherical layout and rendering methods for immersive graph visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156357/12OmNrFTr4v",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2017/2089/0/2089a142",
"title": "Building Immersive Data Visualizations for the Web",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2017/2089a142/12OmNx6PiB6",
"parentPublication": {
"id": "proceedings/cw/2017/2089/0",
"title": "2017 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdva/2015/7343/0/07314296",
"title": "Immersive Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2015/07314296/12OmNzVXNSO",
"parentPublication": {
"id": "proceedings/bdva/2015/7343/0",
"title": "2015 Big Data Visual Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/03/08640251",
"title": "A Walk Among the Data",
"doi": null,
"abstractUrl": "/magazine/cg/2019/03/08640251/17D45XERmlw",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440858",
"title": "DXR: A Toolkit for Building Immersive Data Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440858/17D45XeKgxQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/05/08642297",
"title": "Immersive Virtual Colonoscopy",
"doi": null,
"abstractUrl": "/journal/tg/2019/05/08642297/17PYElZaeVr",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2020/5608/0/09089446",
"title": "Graphical Perception for Immersive Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2020/09089446/1jIxfA3tlUk",
"parentPublication": {
"id": "proceedings/vr/2020/5608/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2020/5697/0/09086291",
"title": "A Study of Mental Maps in Immersive Network Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2020/09086291/1kuHlHoJlSw",
"parentPublication": {
"id": "proceedings/pacificvis/2020/5697/0",
"title": "2020 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl-hcc/2020/6901/0/09127197",
"title": "Exploring Immersive and Non-Immersive Techniques for Geographic Data Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vl-hcc/2020/09127197/1lvQ0gGzBRe",
"parentPublication": {
"id": "proceedings/vl-hcc/2020/6901/0",
"title": "2020 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222313",
"title": "ShuttleSpace: Exploring and Analyzing Movement Trajectory in Immersive Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222313/1nTr29xEpkk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09487519",
"articleId": "1vg3kbPKzHG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09487509",
"articleId": "1vg3l6XnHCE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04Q",
"title": "Jan.",
"year": "2017",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwcS1D0",
"doi": "10.1109/TVCG.2016.2599107",
"abstract": "High-quality immersive display technologies are becoming mainstream with the release of head-mounted displays (HMDs) such as the Oculus Rift. These devices potentially represent an affordable alternative to the more traditional, centralised CAVE-style immersive environments. One driver for the development of CAVE-style immersive environments has been collaborative sense-making. Despite this, there has been little research on the effectiveness of collaborative visualisation in CAVE-style facilities, especially with respect to abstract data visualisation tasks. Indeed, very few studies have focused on the use of these displays to explore and analyse abstract data such as networks and there have been no formal user studies investigating collaborative visualisation of abstract data in immersive environments. In this paper we present the results of the first such study. It explores the relative merits of HMD and CAVE-style immersive environments for collaborative analysis of network connectivity, a common and important task involving abstract data. We find significant differences between the two conditions in task completion time and the physical movements of the participants within the space: participants using the HMD were faster while the CAVE2 condition introduced an asymmetry in movement between collaborators. Otherwise, affordances for collaborative data analysis offered by the low-cost HMD condition were not found to be different for accuracy and communication with the CAVE2. These results are notable, given that the latest HMDs will soon be accessible (in terms of cost and potentially ubiquity) to a massive audience.",
"abstracts": [
{
"abstractType": "Regular",
"content": "High-quality immersive display technologies are becoming mainstream with the release of head-mounted displays (HMDs) such as the Oculus Rift. These devices potentially represent an affordable alternative to the more traditional, centralised CAVE-style immersive environments. One driver for the development of CAVE-style immersive environments has been collaborative sense-making. Despite this, there has been little research on the effectiveness of collaborative visualisation in CAVE-style facilities, especially with respect to abstract data visualisation tasks. Indeed, very few studies have focused on the use of these displays to explore and analyse abstract data such as networks and there have been no formal user studies investigating collaborative visualisation of abstract data in immersive environments. In this paper we present the results of the first such study. It explores the relative merits of HMD and CAVE-style immersive environments for collaborative analysis of network connectivity, a common and important task involving abstract data. We find significant differences between the two conditions in task completion time and the physical movements of the participants within the space: participants using the HMD were faster while the CAVE2 condition introduced an asymmetry in movement between collaborators. Otherwise, affordances for collaborative data analysis offered by the low-cost HMD condition were not found to be different for accuracy and communication with the CAVE2. These results are notable, given that the latest HMDs will soon be accessible (in terms of cost and potentially ubiquity) to a massive audience.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "High-quality immersive display technologies are becoming mainstream with the release of head-mounted displays (HMDs) such as the Oculus Rift. These devices potentially represent an affordable alternative to the more traditional, centralised CAVE-style immersive environments. One driver for the development of CAVE-style immersive environments has been collaborative sense-making. Despite this, there has been little research on the effectiveness of collaborative visualisation in CAVE-style facilities, especially with respect to abstract data visualisation tasks. Indeed, very few studies have focused on the use of these displays to explore and analyse abstract data such as networks and there have been no formal user studies investigating collaborative visualisation of abstract data in immersive environments. In this paper we present the results of the first such study. It explores the relative merits of HMD and CAVE-style immersive environments for collaborative analysis of network connectivity, a common and important task involving abstract data. We find significant differences between the two conditions in task completion time and the physical movements of the participants within the space: participants using the HMD were faster while the CAVE2 condition introduced an asymmetry in movement between collaborators. Otherwise, affordances for collaborative data analysis offered by the low-cost HMD condition were not found to be different for accuracy and communication with the CAVE2. These results are notable, given that the latest HMDs will soon be accessible (in terms of cost and potentially ubiquity) to a massive audience.",
"title": "Immersive Collaborative Analysis of Network Connectivity: CAVE-style or Head-Mounted Display?",
"normalizedTitle": "Immersive Collaborative Analysis of Network Connectivity: CAVE-style or Head-Mounted Display?",
"fno": "07539620",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Collaboration",
"Data Visualization",
"Three Dimensional Displays",
"Visualization",
"Two Dimensional Displays",
"Virtual Reality",
"Navigation",
"3 D Network",
"Oculus Rift",
"CAVE",
"Immersive Analytics",
"Collaboration"
],
"authors": [
{
"givenName": "Maxime",
"surname": "Cordeil",
"fullName": "Maxime Cordeil",
"affiliation": "Monash University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tim",
"surname": "Dwyer",
"fullName": "Tim Dwyer",
"affiliation": "Monash University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Karsten",
"surname": "Klein",
"fullName": "Karsten Klein",
"affiliation": "Monash University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bireswar",
"surname": "Laha",
"fullName": "Bireswar Laha",
"affiliation": "Stanford University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kim",
"surname": "Marriott",
"fullName": "Kim Marriott",
"affiliation": "Monash University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bruce H.",
"surname": "Thomas",
"fullName": "Bruce H. Thomas",
"affiliation": "University of South Australia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2017-01-01 00:00:00",
"pubType": "trans",
"pages": "441-450",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/svr/2016/4149/0/4149a178",
"title": "A CAVE/Desktop Collaborative Virtual Environment for Offshore Oil Platform Training",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2016/4149a178/12OmNrJiCGH",
"parentPublication": {
"id": "proceedings/svr/2016/4149/0",
"title": "2016 XVIII Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2017/6647/0/07892342",
"title": "Uni-CAVE: A Unity3D plugin for non-head mounted VR display systems",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2017/07892342/12OmNs5rkSv",
"parentPublication": {
"id": "proceedings/vr/2017/6647/0",
"title": "2017 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/svr/2017/3588/0/3588a029",
"title": "Navigation and Interaction in a CAVE through Microsoft Kinect Device Integration",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2017/3588a029/12OmNxisQW0",
"parentPublication": {
"id": "proceedings/svr/2017/3588/0",
"title": "2017 19th Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08447558",
"title": "Immersive Visualization of Abstract Information: An Evaluation on Dimensionally-Reduced Data Scatterplots",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08447558/13bd1tMztYK",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2014/05/mcg2014050014",
"title": "Quo Vadis CAVE: Does Immersive Visualization Still Matter?",
"doi": null,
"abstractUrl": "/magazine/cg/2014/05/mcg2014050014/13rRUNvgzcu",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030381",
"title": "Autocalibration of Multiprojector CAVE-Like Immersive Environments",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030381/13rRUy0qnLF",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09847102",
"title": "<italic>MD-Cave</italic>: An Immersive Visualization Workbench for Radiologists",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09847102/1Fu4IEH0oAU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08797978",
"title": "IATK: An Immersive Analytics Toolkit",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08797978/1cJ0GweguUo",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2020/01/08821384",
"title": "A Compelling Virtual Tour of the Dunhuang Cave With an Immersive Head-Mounted Display",
"doi": null,
"abstractUrl": "/magazine/cg/2020/01/08821384/1eTOS0wFeY8",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222346",
"title": "Shared Surfaces and Spaces: Collaborative Data Visualisation in a Co-located Immersive Environment",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222346/1nTqW9mGTrG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07539585",
"articleId": "13rRUxcsYLW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07542185",
"articleId": "13rRUzpzeB8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCaLEmH",
"title": "Oct.",
"year": "2018",
"issueNum": "10",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0xPZD",
"doi": "10.1109/TVCG.2017.2761869",
"abstract": "The original Summed Area Table (SAT) structure is designed for handling 2D rectangular data. Due to the nature of spherical functions, the SAT structure cannot handle cube maps directly. This paper proposes a new SAT structure for cube maps and develops the corresponding lookup algorithm. Our formulation starts by considering a cube map as part of an auxiliary 3D function defined in a 3D rectangular space. We interpret the 2D integration process over the cube map surface as a 3D integration over the auxiliary 3D function. One may suggest that we can create a 3D SAT for this auxiliary function, and then use the 3D SAT to achieve the 3D integration. However, it is not practical to generate or store this special 3D SAT directly. This 3D SAT has some nice properties that allow us to store it in a storage-friendly data structure, namely Summed Area Cube Map (SACM). A SACM can be stored in a standard cube map texture. The lookup algorithm of our SACM structure can be implemented efficiently on current graphics hardware. In addition, the SACM structure inherits the favorable properties of the original SAT structure.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The original Summed Area Table (SAT) structure is designed for handling 2D rectangular data. Due to the nature of spherical functions, the SAT structure cannot handle cube maps directly. This paper proposes a new SAT structure for cube maps and develops the corresponding lookup algorithm. Our formulation starts by considering a cube map as part of an auxiliary 3D function defined in a 3D rectangular space. We interpret the 2D integration process over the cube map surface as a 3D integration over the auxiliary 3D function. One may suggest that we can create a 3D SAT for this auxiliary function, and then use the 3D SAT to achieve the 3D integration. However, it is not practical to generate or store this special 3D SAT directly. This 3D SAT has some nice properties that allow us to store it in a storage-friendly data structure, namely Summed Area Cube Map (SACM). A SACM can be stored in a standard cube map texture. The lookup algorithm of our SACM structure can be implemented efficiently on current graphics hardware. In addition, the SACM structure inherits the favorable properties of the original SAT structure.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The original Summed Area Table (SAT) structure is designed for handling 2D rectangular data. Due to the nature of spherical functions, the SAT structure cannot handle cube maps directly. This paper proposes a new SAT structure for cube maps and develops the corresponding lookup algorithm. Our formulation starts by considering a cube map as part of an auxiliary 3D function defined in a 3D rectangular space. We interpret the 2D integration process over the cube map surface as a 3D integration over the auxiliary 3D function. One may suggest that we can create a 3D SAT for this auxiliary function, and then use the 3D SAT to achieve the 3D integration. However, it is not practical to generate or store this special 3D SAT directly. This 3D SAT has some nice properties that allow us to store it in a storage-friendly data structure, namely Summed Area Cube Map (SACM). A SACM can be stored in a standard cube map texture. The lookup algorithm of our SACM structure can be implemented efficiently on current graphics hardware. In addition, the SACM structure inherits the favorable properties of the original SAT structure.",
"title": "Summed Area Tables for Cube Maps",
"normalizedTitle": "Summed Area Tables for Cube Maps",
"fno": "08064721",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Graphics",
"2 D Integration Process",
"Cube Map Surface",
"Auxiliary 3 D Function",
"Storage Friendly Data Structure",
"Standard Cube Map Texture",
"SACM Structure",
"2 D Rectangular Data",
"3 D Rectangular Space",
"Summed Area Cube Map",
"3 D SAT Structure",
"Summed Area Table Structure",
"Three Dimensional Displays",
"Rendering Computer Graphics",
"Kernel",
"Two Dimensional Displays",
"Algorithm Design And Analysis",
"Hardware",
"Cube Map",
"Summed Area Table",
"Prefiltering",
"Environment Mapping",
"Soft Shadow"
],
"authors": [
{
"givenName": "Yi",
"surname": "Xiao",
"fullName": "Yi Xiao",
"affiliation": "College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan Sheng, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tze-Yiu",
"surname": "Ho",
"fullName": "Tze-Yiu Ho",
"affiliation": "Department of Electronic Engineering, City University of Hong Kong, Kowloon Tong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chi-Sing",
"surname": "Leung",
"fullName": "Chi-Sing Leung",
"affiliation": "Department of Electronic Engineering, City University of Hong Kong, Kowloon Tong, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2018-10-01 00:00:00",
"pubType": "trans",
"pages": "2773-2786",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2017/6067/0/08019311",
"title": "Cube surface modeling for human detection in crowd",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2017/08019311/12OmNAgGwf4",
"parentPublication": {
"id": "proceedings/icme/2017/6067/0",
"title": "2017 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2018/8319/0/831900a482",
"title": "Efficient Algorithms for the Summed Area Tables Primitive on GPUs",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2018/831900a482/17D45VsBTZK",
"parentPublication": {
"id": "proceedings/cluster/2018/8319/0",
"title": "2018 IEEE International Conference on Cluster Computing (CLUSTER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000b420",
"title": "Cube Padding for Weakly-Supervised Saliency Prediction in 360° Videos",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000b420/17D45WB0qcO",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200b836",
"title": "SAT: 2D Semantics Assisted Training for 3D Visual Grounding",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200b836/1BmEKYN6gbS",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08797812",
"title": "GeoGate: Correlating Geo-Temporal Datasets Using an Augmented Reality Space-Time Cube and Tangible Interactions",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08797812/1cJ0WfKtMje",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08854316",
"title": "Evaluating an Immersive Space-Time Cube Geovisualization for Intuitive Trajectory Data Exploration",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08854316/1dM2fkHbAVa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnp/2019/2700/0/08888135",
"title": "CoRE: Non-Linear 3D Sampling for Robust 360° Video Streaming",
"doi": null,
"abstractUrl": "/proceedings-article/icnp/2019/08888135/1ezRKG5Cp32",
"parentPublication": {
"id": "proceedings/icnp/2019/2700/0",
"title": "2019 IEEE 27th International Conference on Network Protocols (ICNP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2020/6553/0/09093505",
"title": "Blended Convolution and Synthesis for Efficient Discrimination of 3D Shapes",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2020/09093505/1jPbfCoY1IQ",
"parentPublication": {
"id": "proceedings/wacv/2020/6553/0",
"title": "2020 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800a896",
"title": "Deep Kinematics Analysis for Monocular 3D Human Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800a896/1m3nmjQb31K",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222053",
"title": "VC-Net: Deep Volume-Composition Networks for Segmentation and Visualization of Highly Sparse and Noisy Image Data",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222053/1nTqERroa6k",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08074775",
"articleId": "13rRUy3xY2X",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08082529",
"articleId": "13rRUxAATgB",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgQK",
"name": "ttg201810-08064721s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201810-08064721s1.zip",
"extension": "zip",
"size": "8.14 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04Q",
"title": "Jan.",
"year": "2017",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjQyvp",
"doi": "10.1109/TVCG.2016.2598796",
"abstract": "We present an interactive visual analytics framework, GazeDx (abbr. of GazeDiagnosis), for the comparative analysis of gaze data from multiple readers examining volumetric images while integrating important contextual information with the gaze data. Gaze pattern comparison is essential to understanding how radiologists examine medical images, and to identifying factors influencing the examination. Most prior work depended upon comparisons with manually juxtaposed static images of gaze tracking results. Comparative gaze analysis with volumetric images is more challenging due to the additional cognitive load on 3D perception. A recent study proposed a visualization design based on direct volume rendering (DVR) for visualizing gaze patterns in volumetric images; however, effective and comprehensive gaze pattern comparison is still challenging due to a lack of interactive visualization tools for comparative gaze analysis. We take the challenge with GazeDx while integrating crucial contextual information such as pupil size and windowing into the analysis process for more in-depth and ecologically valid findings. Among the interactive visualization components in GazeDx, a context-embedded interactive scatterplot is especially designed to help users examine abstract gaze data in diverse contexts by embedding medical imaging representations well known to radiologists in it. We present the results from two case studies with two experienced radiologists, where they compared the gaze patterns of 14 radiologists reading two patients' volumetric CT images.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present an interactive visual analytics framework, GazeDx (abbr. of GazeDiagnosis), for the comparative analysis of gaze data from multiple readers examining volumetric images while integrating important contextual information with the gaze data. Gaze pattern comparison is essential to understanding how radiologists examine medical images, and to identifying factors influencing the examination. Most prior work depended upon comparisons with manually juxtaposed static images of gaze tracking results. Comparative gaze analysis with volumetric images is more challenging due to the additional cognitive load on 3D perception. A recent study proposed a visualization design based on direct volume rendering (DVR) for visualizing gaze patterns in volumetric images; however, effective and comprehensive gaze pattern comparison is still challenging due to a lack of interactive visualization tools for comparative gaze analysis. We take the challenge with GazeDx while integrating crucial contextual information such as pupil size and windowing into the analysis process for more in-depth and ecologically valid findings. Among the interactive visualization components in GazeDx, a context-embedded interactive scatterplot is especially designed to help users examine abstract gaze data in diverse contexts by embedding medical imaging representations well known to radiologists in it. We present the results from two case studies with two experienced radiologists, where they compared the gaze patterns of 14 radiologists reading two patients' volumetric CT images.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present an interactive visual analytics framework, GazeDx (abbr. of GazeDiagnosis), for the comparative analysis of gaze data from multiple readers examining volumetric images while integrating important contextual information with the gaze data. Gaze pattern comparison is essential to understanding how radiologists examine medical images, and to identifying factors influencing the examination. Most prior work depended upon comparisons with manually juxtaposed static images of gaze tracking results. Comparative gaze analysis with volumetric images is more challenging due to the additional cognitive load on 3D perception. A recent study proposed a visualization design based on direct volume rendering (DVR) for visualizing gaze patterns in volumetric images; however, effective and comprehensive gaze pattern comparison is still challenging due to a lack of interactive visualization tools for comparative gaze analysis. We take the challenge with GazeDx while integrating crucial contextual information such as pupil size and windowing into the analysis process for more in-depth and ecologically valid findings. Among the interactive visualization components in GazeDx, a context-embedded interactive scatterplot is especially designed to help users examine abstract gaze data in diverse contexts by embedding medical imaging representations well known to radiologists in it. We present the results from two case studies with two experienced radiologists, where they compared the gaze patterns of 14 radiologists reading two patients' volumetric CT images.",
"title": "GazeDx: Interactive Visual Analytics Framework for Comparative Gaze Analysis with Volumetric Medical Images",
"normalizedTitle": "GazeDx: Interactive Visual Analytics Framework for Comparative Gaze Analysis with Volumetric Medical Images",
"fno": "07539334",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Embedded Systems",
"Gaze Tracking",
"Graphical User Interfaces",
"Interactive Systems",
"Medical Image Processing",
"Radiology",
"Rendering Computer Graphics",
"Gaze Dx",
"Interactive Visual Analytics Framework",
"Gaze Data Analysis",
"Volumetric Medical Images",
"Contextual Information",
"Gaze Pattern Comparison",
"Static Images",
"Gaze Tracking",
"Cognitive Load",
"3 D Perception",
"Direct Volume Rendering",
"DVR",
"Gaze Pattern Visualization Design",
"Interactive Visualization Tools",
"Pupil Size",
"Context Embedded Interactive Scatterplot",
"Medical Imaging Representations",
"Patient Volumetric CT Images",
"Gaze Diagnosis",
"Three Dimensional Displays",
"Data Visualization",
"Gaze Tracking",
"Medical Diagnostic Imaging",
"Visualization",
"Two Dimensional Displays",
"Eye Tracking",
"Gaze Visualization",
"Gaze Pattern Comparison",
"Volumetric Medical Images",
"Context Embedded Interactive Scatterplot",
"Interactive Temporal Chart"
],
"authors": [
{
"givenName": "Hyunjoo",
"surname": "Song",
"fullName": "Hyunjoo Song",
"affiliation": "Seoul National University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeongjin",
"surname": "Lee",
"fullName": "Jeongjin Lee",
"affiliation": "Soongsil University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tae Jung",
"surname": "Kim",
"fullName": "Tae Jung Kim",
"affiliation": "Samsung Medical Center",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kyoung Ho",
"surname": "Lee",
"fullName": "Kyoung Ho Lee",
"affiliation": "Bundang Hospital, Seoul National University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bohyoung",
"surname": "Kim",
"fullName": "Bohyoung Kim",
"affiliation": "Hankuk University of Foreign Studies",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jinwook",
"surname": "Seo",
"fullName": "Jinwook Seo",
"affiliation": "Seoul National University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2017-01-01 00:00:00",
"pubType": "trans",
"pages": "311-320",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vs-games/2017/5812/0/08056614",
"title": "Serious gaze",
"doi": null,
"abstractUrl": "/proceedings-article/vs-games/2017/08056614/12OmNwDACge",
"parentPublication": {
"id": "proceedings/vs-games/2017/5812/0",
"title": "2017 9th International Conference on Virtual Worlds and Games for Serious Applications (VS-Games)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etvis/2016/4731/0/07851160",
"title": "Hilbert attention maps for visualizing spatiotemporal gaze data",
"doi": null,
"abstractUrl": "/proceedings-article/etvis/2016/07851160/12OmNzVoBuv",
"parentPublication": {
"id": "proceedings/etvis/2016/4731/0",
"title": "2016 IEEE Second Workshop on Eye Tracking and Visualization (ETVIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/irc/2017/6724/0/07926555",
"title": "Gaze Tracking and Object Recognition from Eye Images",
"doi": null,
"abstractUrl": "/proceedings-article/irc/2017/07926555/12OmNzvz6Lc",
"parentPublication": {
"id": "proceedings/irc/2017/6724/0",
"title": "2017 First IEEE International Conference on Robotic Computing (IRC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mu/2014/04/mmu2014040028",
"title": "Real-Time Gaze Estimation with Online Calibration",
"doi": null,
"abstractUrl": "/magazine/mu/2014/04/mmu2014040028/13rRUx0geby",
"parentPublication": {
"id": "mags/mu",
"title": "IEEE MultiMedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/05/06687159",
"title": "GazeVis: Interactive 3D Gaze Visualization for Contiguous Cross-Sectional Medical Images",
"doi": null,
"abstractUrl": "/journal/tg/2014/05/06687159/13rRUyfbwqK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aipr/2017/1235/0/08457962",
"title": "Gaze Tracking in 3D Space with a Convolution Neural Network “See What I See”",
"doi": null,
"abstractUrl": "/proceedings-article/aipr/2017/08457962/13xI8AAc3rr",
"parentPublication": {
"id": "proceedings/aipr/2017/1235/0",
"title": "2017 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/5555/01/09802919",
"title": "Continuous Gaze Tracking With Implicit Saliency-Aware Calibration on Mobile Devices",
"doi": null,
"abstractUrl": "/journal/tm/5555/01/09802919/1Eo1vvDggH6",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08797852",
"title": "Perception of Volumetric Characters' Eye-Gaze Direction in Head-Mounted Displays",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08797852/1cJ0UskDCRa",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800e725",
"title": "A Spatiotemporal Volumetric Interpolation Network for 4D Dynamic Medical Image",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800e725/1m3o6jEDHEY",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/06/09325929",
"title": "In the Eye of the Beholder: Gaze and Actions in First Person Video",
"doi": null,
"abstractUrl": "/journal/tp/2023/06/09325929/1qpv4fOGLEA",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07539297",
"articleId": "13rRUyv53Fx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07539341",
"articleId": "13rRUNvyatn",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.