data
dict |
|---|
{
"issue": {
"id": "12OmNBOUxmQ",
"title": "November/December",
"year": "2008",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "14",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwfI0Q1",
"doi": "10.1109/TVCG.2008.169",
"abstract": "Visualization of volumetric data faces the difficult task of finding effective parameters for the transfer functions. Those parameters can determine the effectiveness and accuracy of the visualization. Frequently, volumetric data includes multiple structures and features that need to be differentiated. However, if those features have the same intensity and gradient values, existing transferfunctions are limited at effectively illustrating those similar features with different rendering properties. We introduce texture-based transfer functions for direct volume rendering. In our approach, the voxel’s resulting opacity and color are based on local textural properties rather than individual intensity values. For example, if the intensity values of the vessels are similar to those on the boundary of the lungs, our texture-based transfer function will analyze the textural properties in those regions and color them differently even though they have the same intensity values in the volume. The use of texture-based transfer functions has several benefits. First, structures and features with the same intensity and gradient values can be automatically visualized with different rendering properties. Second, segmentation or prior knowledge of the specific features within the volume is not required for classifying these features differently. Third, textural metrics can be combined and/or maximized to capture and better differentiate similar structures. We demonstrate our texture-based transfer function for direct volume rendering with synthetic and real-world medical data to show the strength of our technique.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visualization of volumetric data faces the difficult task of finding effective parameters for the transfer functions. Those parameters can determine the effectiveness and accuracy of the visualization. Frequently, volumetric data includes multiple structures and features that need to be differentiated. However, if those features have the same intensity and gradient values, existing transferfunctions are limited at effectively illustrating those similar features with different rendering properties. We introduce texture-based transfer functions for direct volume rendering. In our approach, the voxel’s resulting opacity and color are based on local textural properties rather than individual intensity values. For example, if the intensity values of the vessels are similar to those on the boundary of the lungs, our texture-based transfer function will analyze the textural properties in those regions and color them differently even though they have the same intensity values in the volume. The use of texture-based transfer functions has several benefits. First, structures and features with the same intensity and gradient values can be automatically visualized with different rendering properties. Second, segmentation or prior knowledge of the specific features within the volume is not required for classifying these features differently. Third, textural metrics can be combined and/or maximized to capture and better differentiate similar structures. We demonstrate our texture-based transfer function for direct volume rendering with synthetic and real-world medical data to show the strength of our technique.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visualization of volumetric data faces the difficult task of finding effective parameters for the transfer functions. Those parameters can determine the effectiveness and accuracy of the visualization. Frequently, volumetric data includes multiple structures and features that need to be differentiated. However, if those features have the same intensity and gradient values, existing transferfunctions are limited at effectively illustrating those similar features with different rendering properties. We introduce texture-based transfer functions for direct volume rendering. In our approach, the voxel’s resulting opacity and color are based on local textural properties rather than individual intensity values. For example, if the intensity values of the vessels are similar to those on the boundary of the lungs, our texture-based transfer function will analyze the textural properties in those regions and color them differently even though they have the same intensity values in the volume. The use of texture-based transfer functions has several benefits. First, structures and features with the same intensity and gradient values can be automatically visualized with different rendering properties. Second, segmentation or prior knowledge of the specific features within the volume is not required for classifying these features differently. Third, textural metrics can be combined and/or maximized to capture and better differentiate similar structures. We demonstrate our texture-based transfer function for direct volume rendering with synthetic and real-world medical data to show the strength of our technique.",
"title": "Texture-based Transfer Functions for Direct Volume Rendering",
"normalizedTitle": "Texture-based Transfer Functions for Direct Volume Rendering",
"fno": "ttg2008061364",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Visualization",
"Statistical Analysis",
"Volume Rendering",
"Data Variability",
"Medical Imaging"
],
"authors": [
{
"givenName": "Jesus J.",
"surname": "Caban",
"fullName": "Jesus J. Caban",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Penny",
"surname": "Rheingans",
"fullName": "Penny Rheingans",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1364-1371",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vv/2002/7641/0/76410115",
"title": "Accelerating Volume Rendering with Texture Hulls",
"doi": null,
"abstractUrl": "/proceedings-article/vv/2002/76410115/12OmNB6D70H",
"parentPublication": {
"id": "proceedings/vv/2002/7641/0",
"title": "Volume Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300039",
"title": "Compression Domain Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300039/12OmNBWi6GJ",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscid/2008/3311/2/3311b030",
"title": "Real-time Medical Image Volume Rendering Based on GPU Accelerated Method",
"doi": null,
"abstractUrl": "/proceedings-article/iscid/2008/3311b030/12OmNvjgWRZ",
"parentPublication": {
"id": "proceedings/iscid/2008/3311/2",
"title": "2008 International Symposium on Computational Intelligence and Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vv/2004/8781/0/87810033",
"title": "Interactive Transfer Function Control for Monte Carlo Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/vv/2004/87810033/12OmNwGqBoE",
"parentPublication": {
"id": "proceedings/vv/2004/8781/0",
"title": "Volume Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1996/3673/0/36730073",
"title": "Deformable Volume Rendering by 3D Texture Mapping and Octree Encoding",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1996/36730073/12OmNwsNRcc",
"parentPublication": {
"id": "proceedings/ieee-vis/1996/3673/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/esiat/2009/3682/2/3682b575",
"title": "Rapid Texture-based Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/esiat/2009/3682b575/12OmNx7G5VW",
"parentPublication": {
"id": "esiat/2009/3682/2",
"title": "Environmental Science and Information Application Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300065",
"title": "Gaussian Transfer Functions for Multi-Field Volume Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300065/12OmNy6HQVj",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300067",
"title": "Curvature-Based Transfer Functions for Direct Volume Rendering: Methods and Applications",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300067/12OmNz61d84",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061380",
"title": "Size-based Transfer Functions: A New Volume Exploration Technique",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061380/13rRUwIF6l1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2002/02/v0183",
"title": "Designing Effective Transfer Functions for Volume Rendering from Photographic Volumes",
"doi": null,
"abstractUrl": "/journal/tg/2002/02/v0183/13rRUxASuG6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061491",
"articleId": "13rRUwgyOjg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061372",
"articleId": "13rRUx0xPZu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRYW",
"name": "ttg2008061364.avi",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2008061364.avi",
"extension": "avi",
"size": "51.4 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyvY9o5",
"title": "February",
"year": "2011",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwwaKt3",
"doi": "10.1109/TVCG.2010.35",
"abstract": "Direct volume rendering is an important tool for visualizing complex data sets. However, in the process of generating 2D images from 3D data, information is lost in the form of attenuation and occlusion. The lack of a feedback mechanism to quantify the loss of information in the rendering process makes the design of good transfer functions a difficult and time consuming task. In this paper, we present the general notion of visibility histograms, which are multidimensional graphical representations of the distribution of visibility in a volume-rendered image. In this paper, we explore the 1D and 2D transfer functions that result from intensity values and gradient magnitude. With the help of these histograms, users can manage a complex set of transfer function parameters that maximize the visibility of the intervals of interest and provide high quality images of volume data. We present a semiautomated method for generating transfer functions, which progressively explores the transfer function space toward the goal of maximizing visibility of important structures. Our methodology can be easily deployed in most visualization systems and can be used together with traditional 1D and 2D opacity transfer functions based on scalar values, as well as with other more sophisticated rendering algorithms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Direct volume rendering is an important tool for visualizing complex data sets. However, in the process of generating 2D images from 3D data, information is lost in the form of attenuation and occlusion. The lack of a feedback mechanism to quantify the loss of information in the rendering process makes the design of good transfer functions a difficult and time consuming task. In this paper, we present the general notion of visibility histograms, which are multidimensional graphical representations of the distribution of visibility in a volume-rendered image. In this paper, we explore the 1D and 2D transfer functions that result from intensity values and gradient magnitude. With the help of these histograms, users can manage a complex set of transfer function parameters that maximize the visibility of the intervals of interest and provide high quality images of volume data. We present a semiautomated method for generating transfer functions, which progressively explores the transfer function space toward the goal of maximizing visibility of important structures. Our methodology can be easily deployed in most visualization systems and can be used together with traditional 1D and 2D opacity transfer functions based on scalar values, as well as with other more sophisticated rendering algorithms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Direct volume rendering is an important tool for visualizing complex data sets. However, in the process of generating 2D images from 3D data, information is lost in the form of attenuation and occlusion. The lack of a feedback mechanism to quantify the loss of information in the rendering process makes the design of good transfer functions a difficult and time consuming task. In this paper, we present the general notion of visibility histograms, which are multidimensional graphical representations of the distribution of visibility in a volume-rendered image. In this paper, we explore the 1D and 2D transfer functions that result from intensity values and gradient magnitude. With the help of these histograms, users can manage a complex set of transfer function parameters that maximize the visibility of the intervals of interest and provide high quality images of volume data. We present a semiautomated method for generating transfer functions, which progressively explores the transfer function space toward the goal of maximizing visibility of important structures. Our methodology can be easily deployed in most visualization systems and can be used together with traditional 1D and 2D opacity transfer functions based on scalar values, as well as with other more sophisticated rendering algorithms.",
"title": "Visibility Histograms and Visibility-Driven Transfer Functions",
"normalizedTitle": "Visibility Histograms and Visibility-Driven Transfer Functions",
"fno": "ttg2011020192",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Transfer Functions",
"Volume Rendering",
"Visibility",
"View Point Dependent Rendering",
"Histograms"
],
"authors": [
{
"givenName": "Carlos D.",
"surname": "Correa",
"fullName": "Carlos D. Correa",
"affiliation": "University of California at Davis, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kwan-Liu",
"surname": "Ma",
"fullName": "Kwan-Liu Ma",
"affiliation": "University of California at Davis, Davis",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2011-02-01 00:00:00",
"pubType": "trans",
"pages": "192-204",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2004/8788/0/87880147",
"title": "Visibility Culling for Time-Varying Volume Rendering Using Temporal Occlusion Coherence",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880147/12OmNAY79mS",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300045",
"title": "Visibility Culling Using Plenoptic Opacity Functions for Large Volume Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300045/12OmNBhZ4fE",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300065",
"title": "Gaussian Transfer Functions for Multi-Field Volume Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300065/12OmNy6HQVj",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498zhang3",
"title": "Visibility-Guided Simplification",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498zhang3/12OmNyKrHaa",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2009/4404/0/04906854",
"title": "Visibility-driven transfer functions",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2009/04906854/12OmNzkuKIc",
"parentPublication": {
"id": "proceedings/pacificvis/2009/4404/0",
"title": "2009 IEEE Pacific Visualization Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780002",
"title": "A Visibility Determination Algorithm for Interactive Virtual Endoscopy",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780002/12OmNzl3WPW",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2003/02/mcg2003020022",
"title": "Enabling View-Dependent Progressive Volume Visualization on the Grid",
"doi": null,
"abstractUrl": "/magazine/cg/2003/02/mcg2003020022/13rRUwhpBSv",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030447",
"title": "Efficient Visibility Encoding for Dynamic Illumination in Direct Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030447/13rRUxAATgu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/04/ttg2011040475",
"title": "Analyzing Visibility Configurations",
"doi": null,
"abstractUrl": "/journal/tg/2011/04/ttg2011040475/13rRUy3gn7t",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/06/v0695",
"title": "Image-Space Visibility Ordering for Cell Projection Volume Rendering of Unstructured Data",
"doi": null,
"abstractUrl": "/journal/tg/2004/06/v0695/13rRUyY294t",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011020182",
"articleId": "13rRUyfKIHF",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011020205",
"articleId": "13rRUwfI0Q5",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesTJ",
"name": "ttg2011020192s1.wmv",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2011020192s1.wmv",
"extension": "wmv",
"size": "32.2 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUx0xPIE",
"doi": "10.1109/TVCG.2012.203",
"abstract": "Computed Tomography Angiography (CTA) is commonly used in clinical routine for diagnosing vascular diseases. The procedure involves the injection of a contrast agent into the blood stream to increase the contrast between the blood vessels and the surrounding tissue in the image data. CTA is often visualized with Direct Volume Rendering (DVR) where the enhanced image contrast is important for the construction of Transfer Functions (TFs). For increased efficiency, clinical routine heavily relies on preset TFs to simplify the creation of such visualizations for a physician. In practice, however, TF presets often do not yield optimal images due to variations in mixture concentration of contrast agent in the blood stream. In this paper we propose an automatic, optimizationbased method that shifts TF presets to account for general deviations and local variations of the intensity of contrast enhanced blood vessels. Some of the advantages of this method are the following. It computationally automates large parts of a process that is currently performed manually. It performs the TF shift locally and can thus optimize larger portions of the image than is possible with manual interaction. The method is based on a well known vesselness descriptor in the definition of the optimization criterion. The performance of the method is illustrated by clinically relevant CT angiography datasets displaying both improved structural overviews of vessel trees and improved adaption to local variations of contrast concentration.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Computed Tomography Angiography (CTA) is commonly used in clinical routine for diagnosing vascular diseases. The procedure involves the injection of a contrast agent into the blood stream to increase the contrast between the blood vessels and the surrounding tissue in the image data. CTA is often visualized with Direct Volume Rendering (DVR) where the enhanced image contrast is important for the construction of Transfer Functions (TFs). For increased efficiency, clinical routine heavily relies on preset TFs to simplify the creation of such visualizations for a physician. In practice, however, TF presets often do not yield optimal images due to variations in mixture concentration of contrast agent in the blood stream. In this paper we propose an automatic, optimizationbased method that shifts TF presets to account for general deviations and local variations of the intensity of contrast enhanced blood vessels. Some of the advantages of this method are the following. It computationally automates large parts of a process that is currently performed manually. It performs the TF shift locally and can thus optimize larger portions of the image than is possible with manual interaction. The method is based on a well known vesselness descriptor in the definition of the optimization criterion. The performance of the method is illustrated by clinically relevant CT angiography datasets displaying both improved structural overviews of vessel trees and improved adaption to local variations of contrast concentration.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Computed Tomography Angiography (CTA) is commonly used in clinical routine for diagnosing vascular diseases. The procedure involves the injection of a contrast agent into the blood stream to increase the contrast between the blood vessels and the surrounding tissue in the image data. CTA is often visualized with Direct Volume Rendering (DVR) where the enhanced image contrast is important for the construction of Transfer Functions (TFs). For increased efficiency, clinical routine heavily relies on preset TFs to simplify the creation of such visualizations for a physician. In practice, however, TF presets often do not yield optimal images due to variations in mixture concentration of contrast agent in the blood stream. In this paper we propose an automatic, optimizationbased method that shifts TF presets to account for general deviations and local variations of the intensity of contrast enhanced blood vessels. Some of the advantages of this method are the following. It computationally automates large parts of a process that is currently performed manually. It performs the TF shift locally and can thus optimize larger portions of the image than is possible with manual interaction. The method is based on a well known vesselness descriptor in the definition of the optimization criterion. The performance of the method is illustrated by clinically relevant CT angiography datasets displaying both improved structural overviews of vessel trees and improved adaption to local variations of contrast concentration.",
"title": "Automatic Tuning of Spatially Varying Transfer Functions for Blood Vessel Visualization",
"normalizedTitle": "Automatic Tuning of Spatially Varying Transfer Functions for Blood Vessel Visualization",
"fno": "ttg2012122345",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Optimization",
"Data Visualization",
"Rendering Computer Graphics",
"Blood Vessels",
"Biomedical Imaging",
"Vessel Visualization",
"Direct Volume Rendering",
"Transfer Functions"
],
"authors": [
{
"givenName": "Gunnar",
"surname": "Lathen",
"fullName": "Gunnar Lathen",
"affiliation": "Linköping University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefan",
"surname": "Lindholm",
"fullName": "Stefan Lindholm",
"affiliation": "Linköping University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Reiner",
"surname": "Lenz",
"fullName": "Reiner Lenz",
"affiliation": "Linköping University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anders",
"surname": "Persson",
"fullName": "Anders Persson",
"affiliation": "Linköping University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Magnus",
"surname": "Borga",
"fullName": "Magnus Borga",
"affiliation": "Linköping University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2345-2354",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icip/1995/7310/2/73102500",
"title": "An approach for detecting blood vessel diseases from cone-beam CT image",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1995/73102500/12OmNAu1FlK",
"parentPublication": {
"id": "proceedings/icip/1995/7310/2",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2012/2559/0/06392730",
"title": "An automated blood vessel extraction algorithm in fundus images",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2012/06392730/12OmNqBKTNd",
"parentPublication": {
"id": "proceedings/bibm/2012/2559/0",
"title": "2012 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880385",
"title": "The VesselGlyph: Focus & Context Visualization in CT-Angiography",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880385/12OmNqFJhQU",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iih-msp/2009/3762/0/3762a299",
"title": "A Novel Retinal Blood Vessel Segmentation Method Based on Line Operator and Edge Detector",
"doi": null,
"abstractUrl": "/proceedings-article/iih-msp/2009/3762a299/12OmNxGAKZN",
"parentPublication": {
"id": "proceedings/iih-msp/2009/3762/0",
"title": "Intelligent Information Hiding and Multimedia Signal Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cine/2015/7548/0/7549a166",
"title": "A Survey on Blood Vessel Detection Methodologies in Retinal Images",
"doi": null,
"abstractUrl": "/proceedings-article/cine/2015/7549a166/12OmNxRWI9C",
"parentPublication": {
"id": "proceedings/cine/2015/7548/0",
"title": "2015 International Conference on Computational Intelligence & Networks (CINE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1997/8262/0/82620443",
"title": "An interactive cerebral blood vessel exploration system",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1997/82620443/12OmNxeut7s",
"parentPublication": {
"id": "proceedings/ieee-vis/1997/8262/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209d392",
"title": "Extraction of Retinal Blood Vessel Using Curvelet Transform and Fuzzy C-Means",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209d392/12OmNy3RRL7",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdip/2009/3565/0/3565a034",
"title": "Blood Vessel Enhancement and Segmentation Using Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/icdip/2009/3565a034/12OmNzcxYWG",
"parentPublication": {
"id": "proceedings/icdip/2009/3565/0",
"title": "Digital Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2021/9489/0/948900a151",
"title": "CAGU-Net: Category Attention Guidance U-Net for Retinal Blood Vessel Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2021/948900a151/1AUpC6B2G3u",
"parentPublication": {
"id": "proceedings/cis/2021/9489/0",
"title": "2021 17th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2022/8739/0/873900b863",
"title": "Blood Vessel Segmentation from Low-Contrast and Wide-Field Optical Microscopic Images of Cranial Window by Attention-Gate-Based Network",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2022/873900b863/1G55Z9YvtxC",
"parentPublication": {
"id": "proceedings/cvprw/2022/8739/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012122335",
"articleId": "13rRUyeTVi0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122355",
"articleId": "13rRUwjoNx2",
"__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": "1nV71j9G3yo",
"doi": "10.1109/TVCG.2020.3030394",
"abstract": "We present a nonparametric statistical framework for the quantification, analysis, and propagation of data uncertainty in direct volume rendering (DVR). The state-of-the-art statistical DVR framework allows for preserving the transfer function (TF) of the ground truth function when visualizing uncertain data; however, the existing framework is restricted to parametric models of uncertainty. In this paper, we address the limitations of the existing DVR framework by extending the DVR framework for nonparametric distributions. We exploit the quantile interpolation technique to derive probability distributions representing uncertainty in viewing-ray sample intensities in closed form, which allows for accurate and efficient computation. We evaluate our proposed nonparametric statistical models through qualitative and quantitative comparisons with the mean-field and parametric statistical models, such as uniform and Gaussian, as well as Gaussian mixtures. In addition, we present an extension of the state-of-the-art rendering parametric framework to 2D TFs for improved DVR classifications. We show the applicability of our uncertainty quantification framework to ensemble, downsampled, and bivariate versions of scalar field datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a nonparametric statistical framework for the quantification, analysis, and propagation of data uncertainty in direct volume rendering (DVR). The state-of-the-art statistical DVR framework allows for preserving the transfer function (TF) of the ground truth function when visualizing uncertain data; however, the existing framework is restricted to parametric models of uncertainty. In this paper, we address the limitations of the existing DVR framework by extending the DVR framework for nonparametric distributions. We exploit the quantile interpolation technique to derive probability distributions representing uncertainty in viewing-ray sample intensities in closed form, which allows for accurate and efficient computation. We evaluate our proposed nonparametric statistical models through qualitative and quantitative comparisons with the mean-field and parametric statistical models, such as uniform and Gaussian, as well as Gaussian mixtures. In addition, we present an extension of the state-of-the-art rendering parametric framework to 2D TFs for improved DVR classifications. We show the applicability of our uncertainty quantification framework to ensemble, downsampled, and bivariate versions of scalar field datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a nonparametric statistical framework for the quantification, analysis, and propagation of data uncertainty in direct volume rendering (DVR). The state-of-the-art statistical DVR framework allows for preserving the transfer function (TF) of the ground truth function when visualizing uncertain data; however, the existing framework is restricted to parametric models of uncertainty. In this paper, we address the limitations of the existing DVR framework by extending the DVR framework for nonparametric distributions. We exploit the quantile interpolation technique to derive probability distributions representing uncertainty in viewing-ray sample intensities in closed form, which allows for accurate and efficient computation. We evaluate our proposed nonparametric statistical models through qualitative and quantitative comparisons with the mean-field and parametric statistical models, such as uniform and Gaussian, as well as Gaussian mixtures. In addition, we present an extension of the state-of-the-art rendering parametric framework to 2D TFs for improved DVR classifications. We show the applicability of our uncertainty quantification framework to ensemble, downsampled, and bivariate versions of scalar field datasets.",
"title": "Direct Volume Rendering with Nonparametric Models of Uncertainty",
"normalizedTitle": "Direct Volume Rendering with Nonparametric Models of Uncertainty",
"fno": "09224194",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Interpolation",
"Nonparametric Statistics",
"Pattern Classification",
"Rendering Computer Graphics",
"Statistical Distributions",
"Transfer Functions",
"Uncertainty Handling",
"Nonparametric Distributions",
"Quantile Interpolation Technique",
"Probability Distributions",
"Uncertainty Quantification Framework",
"Direct Volume Rendering",
"Nonparametric Statistical Framework",
"Data Uncertainty",
"DVR Framework",
"Transfer Function",
"Ground Truth Function",
"Data Visualization",
"Rendering Parametric Framework",
"DVR Classifications",
"Uncertainty",
"Data Visualization",
"Interpolation",
"Probability Density Function",
"Rendering Computer Graphics",
"Two Dimensional Displays",
"Pipelines",
"Volumes",
"Uncertainty",
"Nonparametric",
"2 D Transfer Function"
],
"authors": [
{
"givenName": "Tushar M.",
"surname": "Athawale",
"fullName": "Tushar M. Athawale",
"affiliation": "University of Utah, Scientific Computing & Imaging (SCI) Institute, Salt Lake City",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bo",
"surname": "Ma",
"fullName": "Bo Ma",
"affiliation": "Department of CISEGainesvilleUniversity of Florida",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Elham",
"surname": "Sakhaee",
"fullName": "Elham Sakhaee",
"affiliation": "Department of CISEGainesvilleUniversity of Florida",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chris R.",
"surname": "Johnson",
"fullName": "Chris R. Johnson",
"affiliation": "University of Utah, Scientific Computing & Imaging (SCI) Institute, Salt Lake City",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alireza",
"surname": "Entezari",
"fullName": "Alireza Entezari",
"affiliation": "Department of CISEGainesvilleUniversity of Florida",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "1797-1807",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icvrv/2011/4602/0/4602a275",
"title": "Direct Volume Rendering and Clipping Technology of Radar Beams",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2011/4602a275/12OmNApLGRp",
"parentPublication": {
"id": "proceedings/icvrv/2011/4602/0",
"title": "2011 International Conference on Virtual Reality and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dagstuhl/1997/0503/0/05030137",
"title": "Ray-Based Data Level Comparisons of Direct Volume Rendering Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/dagstuhl/1997/05030137/12OmNzvQHVf",
"parentPublication": {
"id": "proceedings/dagstuhl/1997/0503/0",
"title": "Dagstuhl '97 - Scientific Visualization Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2007/01/l0003",
"title": "Hypergraph-Partitioning-Based Remapping Models for Image-Space-Parallel Direct Volume Rendering of Unstructured Grids",
"doi": null,
"abstractUrl": "/journal/td/2007/01/l0003/13rRUIJcWl5",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192629",
"title": "Isosurface Visualization of Data with Nonparametric Models for Uncertainty",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192629/13rRUwd9CLQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1648",
"title": "Uncertainty Visualization in Medical Volume Rendering Using Probabilistic Animation",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1648/13rRUwh80H4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/12/07778257",
"title": "A Statistical Direct Volume Rendering Framework for Visualization of Uncertain Data",
"doi": null,
"abstractUrl": "/journal/tg/2017/12/07778257/13rRUxCitJj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2007/01/04020508",
"title": "Hypergraph-Partitioning-Based Remapping Models for Image-Space-Parallel Direct Volume Rendering of Unstructured Grids",
"doi": null,
"abstractUrl": "/journal/td/2007/01/04020508/13rRUygT7eL",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903471",
"title": "Fiber Uncertainty Visualization for Bivariate Data With Parametric and Nonparametric Noise Models",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903471/1GZolxWTqPS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dagstuhl/1997/0503/0/01423111",
"title": "Ray-Based Data Level Comparisons of Direct Volume Rendering Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/dagstuhl/1997/01423111/1h0N3aF69Lq",
"parentPublication": {
"id": "proceedings/dagstuhl/1997/0503/0",
"title": "Dagstuhl '97 - Scientific Visualization Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a106",
"title": "FAVR - Accelerating Direct Volume Rendering for Virtual RealitySystems",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a106/1qRNBEWTyEw",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09228893",
"articleId": "1nYqgO1jK8w",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09222092",
"articleId": "1nTqGJRtSIU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLfdDPSVIk",
"name": "ttg202102-09224194s1-supp2-3030394.m4v",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09224194s1-supp2-3030394.m4v",
"extension": "m4v",
"size": "3.14 MB",
"__typename": "WebExtraType"
},
{
"id": "1qLfdOfEmD6",
"name": "ttg202102-09224194s1-supp1-3030394.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09224194s1-supp1-3030394.pdf",
"extension": "pdf",
"size": "3.4 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": "1nWK2KRnd60",
"doi": "10.1109/TVCG.2020.3030451",
"abstract": "In this paper, we present a novel data structure, called the Mixture Graph. This data structure allows us to compress, render, and query segmentation histograms. Such histograms arise when building a mipmap of a volume containing segmentation IDs. Each voxel in the histogram mipmap contains a convex combination (mixture) of segmentation IDs. Each mixture represents the distribution of IDs in the respective voxel's children. Our method factorizes these mixtures into a series of linear interpolations between exactly two segmentation IDs. The result is represented as a directed acyclic graph (DAG) whose nodes are topologically ordered. Pruning replicate nodes in the tree followed by compression allows us to store the resulting data structure efficiently. During rendering, transfer functions are propagated from sources (leafs) through the DAG to allow for efficient, pre-filtered rendering at interactive frame rates. Assembly of histogram contributions across the footprint of a given volume allows us to efficiently query partial histograms, achieving up to 178 x speed-up over naive parallelized range queries. Additionally, we apply the Mixture Graph to compute correctly pre-filtered volume lighting and to interactively explore segments based on shape, geometry, and orientation using multi-dimensional transfer functions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present a novel data structure, called the Mixture Graph. This data structure allows us to compress, render, and query segmentation histograms. Such histograms arise when building a mipmap of a volume containing segmentation IDs. Each voxel in the histogram mipmap contains a convex combination (mixture) of segmentation IDs. Each mixture represents the distribution of IDs in the respective voxel's children. Our method factorizes these mixtures into a series of linear interpolations between exactly two segmentation IDs. The result is represented as a directed acyclic graph (DAG) whose nodes are topologically ordered. Pruning replicate nodes in the tree followed by compression allows us to store the resulting data structure efficiently. During rendering, transfer functions are propagated from sources (leafs) through the DAG to allow for efficient, pre-filtered rendering at interactive frame rates. Assembly of histogram contributions across the footprint of a given volume allows us to efficiently query partial histograms, achieving up to 178 x speed-up over naive parallelized range queries. Additionally, we apply the Mixture Graph to compute correctly pre-filtered volume lighting and to interactively explore segments based on shape, geometry, and orientation using multi-dimensional transfer functions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present a novel data structure, called the Mixture Graph. This data structure allows us to compress, render, and query segmentation histograms. Such histograms arise when building a mipmap of a volume containing segmentation IDs. Each voxel in the histogram mipmap contains a convex combination (mixture) of segmentation IDs. Each mixture represents the distribution of IDs in the respective voxel's children. Our method factorizes these mixtures into a series of linear interpolations between exactly two segmentation IDs. The result is represented as a directed acyclic graph (DAG) whose nodes are topologically ordered. Pruning replicate nodes in the tree followed by compression allows us to store the resulting data structure efficiently. During rendering, transfer functions are propagated from sources (leafs) through the DAG to allow for efficient, pre-filtered rendering at interactive frame rates. Assembly of histogram contributions across the footprint of a given volume allows us to efficiently query partial histograms, achieving up to 178 x speed-up over naive parallelized range queries. Additionally, we apply the Mixture Graph to compute correctly pre-filtered volume lighting and to interactively explore segments based on shape, geometry, and orientation using multi-dimensional transfer functions.",
"title": "The Mixture Graph-A Data Structure for Compressing, Rendering, and Querying Segmentation Histograms",
"normalizedTitle": "The Mixture Graph-A Data Structure for Compressing, Rendering, and Querying Segmentation Histograms",
"fno": "09224646",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Structures",
"Directed Graphs",
"Image Segmentation",
"Interpolation",
"Query Processing",
"Rendering Computer Graphics",
"Transfer Functions",
"Trees Mathematics",
"Mixture Graph",
"Segmentation I Ds",
"Histogram Mipmap",
"Respective Voxel",
"Directed Acyclic Graph",
"Data Structure",
"Histogram Contributions",
"Partial Histograms",
"Naive Parallelized Range Queries",
"Segmentation Histogram Compression",
"Querying Segmentation Rendering",
"Segmentation Histogram Querying",
"Multidimensional Transfer Functions",
"Linear Interpolations",
"Rendering Computer Graphics",
"Histograms",
"Data Structures",
"Semantics",
"Encoding",
"Transfer Functions",
"Interpolation",
"Segmented Volumes",
"Data Structures",
"Sparse Data"
],
"authors": [
{
"givenName": "Khaled",
"surname": "Al-Thelaya",
"fullName": "Khaled Al-Thelaya",
"affiliation": "Hamad Bin Khalifa University (HBKU), College of Science and Engineering (CSE), Education City, Doha, Qatar",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marco",
"surname": "Agus",
"fullName": "Marco Agus",
"affiliation": "Hamad Bin Khalifa University (HBKU), College of Science and Engineering (CSE), Education City, Doha, Qatar",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jens",
"surname": "Schneider",
"fullName": "Jens Schneider",
"affiliation": "Hamad Bin Khalifa University (HBKU), College of Science and Engineering (CSE), Education City, Doha, Qatar",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "645-655",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2004/2128/4/212840549",
"title": "Mixture Clustering Using Multidimensional Histograms for Skin Detection",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2004/212840549/12OmNBtl1EX",
"parentPublication": {
"id": "proceedings/icpr/2004/2128/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/viz/2009/3734/0/3734a153",
"title": "3D Visualization of Medical Image Data Employing 2D Histograms",
"doi": null,
"abstractUrl": "/proceedings-article/viz/2009/3734a153/12OmNzt0IxY",
"parentPublication": {
"id": "proceedings/viz/2009/3734/0",
"title": "Visualisation, International Conference in",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/06/v1570",
"title": "Local Histograms for Design of Transfer Functions in Direct Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2006/06/v1570/13rRUwInvsC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/02/v0208",
"title": "Visualization of Boundaries in Volumetric Data Sets Using LH Histograms",
"doi": null,
"abstractUrl": "/journal/tg/2006/02/v0208/13rRUwbs2aT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/02/06908014",
"title": "Exploring Brushlet Based 3D Textures in Transfer Function Specification for Direct Volume Rendering of Abdominal Organs",
"doi": null,
"abstractUrl": "/journal/tg/2015/02/06908014/13rRUwjoNx6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/02/ttg2011020192",
"title": "Visibility Histograms and Visibility-Driven Transfer Functions",
"doi": null,
"abstractUrl": "/journal/tg/2011/02/ttg2011020192/13rRUwwaKt3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2002/02/v0183",
"title": "Designing Effective Transfer Functions for Volume Rendering from Photographic Volumes",
"doi": null,
"abstractUrl": "/journal/tg/2002/02/v0183/13rRUxASuG6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1259",
"title": "On Histograms and Isosurface Statistics",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1259/13rRUzp02of",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/11/08727480",
"title": "Ray-Based Exploration of Large Time-Varying Volume Data Using Per-Ray Proxy Distributions",
"doi": null,
"abstractUrl": "/journal/tg/2020/11/08727480/1atT1OfeATu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2020/6553/0/09093484",
"title": "HistoNet: Predicting size histograms of object instances",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2020/09093484/1jPbqkqYrug",
"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": "09222562",
"articleId": "1nTqvh6tnr2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09222261",
"articleId": "1nTr2r0gvqo",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLdwTjXECQ",
"name": "ttg202102-09224646s1-supp1-3030451.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09224646s1-supp1-3030451.mp4",
"extension": "mp4",
"size": "148 MB",
"__typename": "WebExtraType"
},
{
"id": "1qLdC4W3dYY",
"name": "ttg202102-09224646s1-supp2-3030451.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09224646s1-supp2-3030451.mp4",
"extension": "mp4",
"size": "74.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAle6Qx",
"title": "November/December",
"year": "2007",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwhpBE1",
"doi": "10.1109/TVCG.2007.70559",
"abstract": "We present the results of two controlled studies comparing layered surface visualizations under various texture conditions. The task was to estimate surface normals, measured by accuracy of a hand-set surface normal probe. A single surface visualization was compared with the two-surfaces case under conditions of no texture and with projected grid textures. Variations in relative texture spacing on top and bottom surfaces were compared, as well as opacity of the top surface. Significant improvements are found for the textured cases over non-textured surfaces. Either larger or thinner top-surface textures, and lower top surface opacities are shown to give less bottom surface error. Top surface error appears to be highly resilient to changes in texture. Given the results we also present an example of how appropriate textures might be useful in volume visualization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present the results of two controlled studies comparing layered surface visualizations under various texture conditions. The task was to estimate surface normals, measured by accuracy of a hand-set surface normal probe. A single surface visualization was compared with the two-surfaces case under conditions of no texture and with projected grid textures. Variations in relative texture spacing on top and bottom surfaces were compared, as well as opacity of the top surface. Significant improvements are found for the textured cases over non-textured surfaces. Either larger or thinner top-surface textures, and lower top surface opacities are shown to give less bottom surface error. Top surface error appears to be highly resilient to changes in texture. Given the results we also present an example of how appropriate textures might be useful in volume visualization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present the results of two controlled studies comparing layered surface visualizations under various texture conditions. The task was to estimate surface normals, measured by accuracy of a hand-set surface normal probe. A single surface visualization was compared with the two-surfaces case under conditions of no texture and with projected grid textures. Variations in relative texture spacing on top and bottom surfaces were compared, as well as opacity of the top surface. Significant improvements are found for the textured cases over non-textured surfaces. Either larger or thinner top-surface textures, and lower top surface opacities are shown to give less bottom surface error. Top surface error appears to be highly resilient to changes in texture. Given the results we also present an example of how appropriate textures might be useful in volume visualization.",
"title": "Grid With a View: Optimal Texturing for Perception of Layered Surface Shape",
"normalizedTitle": "Grid With a View: Optimal Texturing for Perception of Layered Surface Shape",
"fno": "v1656",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Grid Computing",
"Image Texture",
"Optimal Texturing",
"Layered Surface Shape Perception",
"Layered Surface Visualizations",
"Projected Grid Textures",
"Relative Texture Spacing",
"Surface Texture",
"Shape Control",
"Humans",
"Data Visualization",
"Geologic Measurements",
"Probes",
"Biomedical Imaging",
"Geology",
"Isosurfaces",
"Pediatrics",
"Perception",
"Optimal Visualization",
"Texturing",
"Layered Surfaces"
],
"authors": [
{
"givenName": "Alethea",
"surname": "Bair",
"fullName": "Alethea Bair",
"affiliation": "Texas A&M University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Donald",
"surname": "House",
"fullName": "Donald House",
"affiliation": "Texas A&M University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2007-11-01 00:00:00",
"pubType": "trans",
"pages": "1656-1663",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sibgrapi/2010/8420/0/05720356",
"title": "Geotextures: A Multi-source Geodesic Distance Field Approach for Procedural Texturing of Complex Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2010/05720356/12OmNBOUxso",
"parentPublication": {
"id": "proceedings/sibgrapi/2010/8420/0",
"title": "2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscsct/2008/3498/2/3498b230",
"title": "3D Surface Texture Synthesis Based on Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/iscsct/2008/3498b230/12OmNBRsVxV",
"parentPublication": {
"id": "proceedings/iscsct/2008/3498/1",
"title": "2008 International Symposium on Computer Science and Computational Technology (ISCSCT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2006/0226/0/02260001",
"title": "Discrimination of Real and Virtual High-Definition Textured Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2006/02260001/12OmNwsNRdN",
"parentPublication": {
"id": "proceedings/haptics/2006/0226/0",
"title": "2006 14th Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2007/1016/0/04284896",
"title": "Hole Filling on Three-Dimensional Surface Texture",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2007/04284896/12OmNy4IF6j",
"parentPublication": {
"id": "proceedings/icme/2007/1016/0",
"title": "2007 International Conference on Multimedia & Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1125",
"title": "Texturing of Layered Surfaces for Optimal Viewing",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1125/13rRUILtJlX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/05/v0939",
"title": "Texturing Fluids",
"doi": null,
"abstractUrl": "/journal/tg/2007/05/v0939/13rRUwbs20O",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1989/12/i1233",
"title": "Shape From Texture: Integrating Texture-Element Extraction and Surface Estimation",
"doi": null,
"abstractUrl": "/journal/tp/1989/12/i1233/13rRUwfZBW3",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/06/v1580",
"title": "RotoTexture: Automated Tools for Texturing Raw Video",
"doi": null,
"abstractUrl": "/journal/tg/2006/06/v1580/13rRUxCitJ4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2011/02/tth2011020122",
"title": "Roughness Perception in Virtual Textures",
"doi": null,
"abstractUrl": "/journal/th/2011/02/tth2011020122/13rRUxYINfp",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/02/ttg2008020277",
"title": "Geometric Texturing Using Level Sets",
"doi": null,
"abstractUrl": "/journal/tg/2008/02/ttg2008020277/13rRUxly8SQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1648",
"articleId": "13rRUwh80H4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1664",
"articleId": "13rRUwj7cp5",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAoDih4",
"title": "April",
"year": "2002",
"issueNum": "04",
"idPrefix": "tp",
"pubType": "journal",
"volume": "24",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuBp",
"doi": "10.1109/34.993560",
"abstract": "This paper studies the recovery of shape from texture under perspective projection. We regard Shape from Texture as a statistical estimation problem, the texture being the realization of a stochastic process. We introduce warplets, which generalize wavelets over the 2D affine group. At fine scales, the warpogram of the image obeys a transport equation, called Texture Gradient Equation. In order to recover the 3D shape of the surface, one must estimate the deformation gradient, which measures metric changes in the image. This is made possible by imposing a notion of homogeneity for the original texture, according to which the deformation gradient is equal to the velocity of the Texture Gradient Equation. By measuring the warplet transform of the image at different scales, we obtain a deformation gradient estimator.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper studies the recovery of shape from texture under perspective projection. We regard Shape from Texture as a statistical estimation problem, the texture being the realization of a stochastic process. We introduce warplets, which generalize wavelets over the 2D affine group. At fine scales, the warpogram of the image obeys a transport equation, called Texture Gradient Equation. In order to recover the 3D shape of the surface, one must estimate the deformation gradient, which measures metric changes in the image. This is made possible by imposing a notion of homogeneity for the original texture, according to which the deformation gradient is equal to the velocity of the Texture Gradient Equation. By measuring the warplet transform of the image at different scales, we obtain a deformation gradient estimator.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper studies the recovery of shape from texture under perspective projection. We regard Shape from Texture as a statistical estimation problem, the texture being the realization of a stochastic process. We introduce warplets, which generalize wavelets over the 2D affine group. At fine scales, the warpogram of the image obeys a transport equation, called Texture Gradient Equation. In order to recover the 3D shape of the surface, one must estimate the deformation gradient, which measures metric changes in the image. This is made possible by imposing a notion of homogeneity for the original texture, according to which the deformation gradient is equal to the velocity of the Texture Gradient Equation. By measuring the warplet transform of the image at different scales, we obtain a deformation gradient estimator.",
"title": "The Texture Gradient Equation for Recovering Shape from Texture",
"normalizedTitle": "The Texture Gradient Equation for Recovering Shape from Texture",
"fno": "i0536",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Shape From Texture",
"Texture Gradient",
"Warplets",
"Wavelets"
],
"authors": [
{
"givenName": "M.",
"surname": "Clerc",
"fullName": "M. Clerc",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "S.",
"surname": "Mallat",
"fullName": "S. Mallat",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2002-04-01 00:00:00",
"pubType": "trans",
"pages": "536-549",
"year": "2002",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0523",
"articleId": "13rRUyv53Gn",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0550",
"articleId": "13rRUxASuNy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyxXloT",
"title": "March/April",
"year": "2008",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "14",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxly8SQ",
"doi": "10.1109/TVCG.2007.70408",
"abstract": "Abstract—We present techniques for warping and blending (or subtracting) geometric textures onto surfaces represented by high resolution level sets. The geometric texture itself can be represented either explicitly as a polygonal mesh or implicitly as a level set. Unlike previous approaches, we can produce topologically connected surfaces with smooth blending and low distortion. Specifically, we offer two different solutions to the problem of adding fine-scale geometric detail to surfaces. Both solutions assume a level set representation of the base surface which is easily achieved by means of a mesh-to-level-set scan conversion. To facilitate our mapping, we parameterize the embedding space of the base level set surface using fast particle advection. We can then warp explicit texture meshes onto this surface at nearly interactive speeds or blend level set representations of the texture to produce high-quality surfaces with smooth transitions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—We present techniques for warping and blending (or subtracting) geometric textures onto surfaces represented by high resolution level sets. The geometric texture itself can be represented either explicitly as a polygonal mesh or implicitly as a level set. Unlike previous approaches, we can produce topologically connected surfaces with smooth blending and low distortion. Specifically, we offer two different solutions to the problem of adding fine-scale geometric detail to surfaces. Both solutions assume a level set representation of the base surface which is easily achieved by means of a mesh-to-level-set scan conversion. To facilitate our mapping, we parameterize the embedding space of the base level set surface using fast particle advection. We can then warp explicit texture meshes onto this surface at nearly interactive speeds or blend level set representations of the texture to produce high-quality surfaces with smooth transitions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—We present techniques for warping and blending (or subtracting) geometric textures onto surfaces represented by high resolution level sets. The geometric texture itself can be represented either explicitly as a polygonal mesh or implicitly as a level set. Unlike previous approaches, we can produce topologically connected surfaces with smooth blending and low distortion. Specifically, we offer two different solutions to the problem of adding fine-scale geometric detail to surfaces. Both solutions assume a level set representation of the base surface which is easily achieved by means of a mesh-to-level-set scan conversion. To facilitate our mapping, we parameterize the embedding space of the base level set surface using fast particle advection. We can then warp explicit texture meshes onto this surface at nearly interactive speeds or blend level set representations of the texture to produce high-quality surfaces with smooth transitions.",
"title": "Geometric Texturing Using Level Sets",
"normalizedTitle": "Geometric Texturing Using Level Sets",
"fno": "ttg2008020277",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Geometric Texture Mapping",
"Parameterization",
"Implicit Surfaces",
"Volume Texturing",
"Geometric Modeling"
],
"authors": [
{
"givenName": "Anders",
"surname": "Brodersen",
"fullName": "Anders Brodersen",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ken",
"surname": "Museth",
"fullName": "Ken Museth",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Serban",
"surname": "Porumbescu",
"fullName": "Serban Porumbescu",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Brian",
"surname": "Budge",
"fullName": "Brian Budge",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2008-03-01 00:00:00",
"pubType": "trans",
"pages": "277-288",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pg/2000/0868/0/08680213",
"title": "Dynamic PDE Surfaces with Flexible and General Geometric Constraints",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2000/08680213/12OmNBkxspv",
"parentPublication": {
"id": "proceedings/pg/2000/0868/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/1999/0185/0/01850025",
"title": "A Field Interpolated Texture Mapping Algorithm for Skeletal Implicit Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/1999/01850025/12OmNBuL1dv",
"parentPublication": {
"id": "proceedings/cgi/1999/0185/0",
"title": "Computer Graphics International Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2003/1845/0/18450013",
"title": "Generalized Functional and Decorative Filleting and Blending Operations",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2003/18450013/12OmNqzcvA0",
"parentPublication": {
"id": "proceedings/smi/2003/1845/0",
"title": "Shape Modeling and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gmp/2000/0562/0/05620321",
"title": "Interval Methods in Geometric Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/gmp/2000/05620321/12OmNwMob8s",
"parentPublication": {
"id": "proceedings/gmp/2000/0562/0",
"title": "Geometric Modeling and Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2006/2606/0/26060534",
"title": "Implicit Blends with an Individual Blending Range Control on Every Primitive?s Subsequent Blend",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2006/26060534/12OmNxGj9Kb",
"parentPublication": {
"id": "proceedings/cgiv/2006/2606/0",
"title": "International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/05/v0939",
"title": "Texturing Fluids",
"doi": null,
"abstractUrl": "/journal/tg/2007/05/v0939/13rRUwbs20O",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2005/02/mcg2005020036",
"title": "Bounded Blending for Function-Based Shape Modeling",
"doi": null,
"abstractUrl": "/magazine/cg/2005/02/mcg2005020036/13rRUwjoNCb",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/03/v0549",
"title": "Free-Form Geometric Modeling by Integrating Parametric and Implicit PDEs",
"doi": null,
"abstractUrl": "/journal/tg/2007/03/v0549/13rRUwkfAZc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2002/04/v0346",
"title": "Robust Creation of Implicit Surfaces from Polygonal Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2002/04/v0346/13rRUxD9h4Y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2000/05/i0445",
"title": "Snake Pedals: Compact and Versatile Geometric Models with Physics-Based Control",
"doi": null,
"abstractUrl": "/journal/tp/2000/05/i0445/13rRUy0HYKQ",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008020468",
"articleId": "13rRUEgs2BO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008020289",
"articleId": "13rRUxYIMUR",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxb5hpF",
"title": "Sept.",
"year": "2014",
"issueNum": "09",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvyA",
"doi": "10.1109/TVCG.2014.2314666",
"abstract": "The feed-forward pipeline based on projection followed by rasterization handles the rays that leave the eye efficiently: these first-order rays are modeled with a simple camera that projects geometry to screen. Second-order rays however, as, for example, those resulting from specular reflections, are challenging for the feed-forward approach. We propose an extension of the feed-forward pipeline to handle second-order rays resulting from specular and glossy reflections. The coherence of second-order rays is leveraged through clustering, the geometry reflected by a cluster is approximated with a depth image, and the color samples captured by the second-order rays of a cluster are computed by intersection with the depth image. We achieve quality specular and glossy reflections at interactive rates in fully dynamic scenes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The feed-forward pipeline based on projection followed by rasterization handles the rays that leave the eye efficiently: these first-order rays are modeled with a simple camera that projects geometry to screen. Second-order rays however, as, for example, those resulting from specular reflections, are challenging for the feed-forward approach. We propose an extension of the feed-forward pipeline to handle second-order rays resulting from specular and glossy reflections. The coherence of second-order rays is leveraged through clustering, the geometry reflected by a cluster is approximated with a depth image, and the color samples captured by the second-order rays of a cluster are computed by intersection with the depth image. We achieve quality specular and glossy reflections at interactive rates in fully dynamic scenes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The feed-forward pipeline based on projection followed by rasterization handles the rays that leave the eye efficiently: these first-order rays are modeled with a simple camera that projects geometry to screen. Second-order rays however, as, for example, those resulting from specular reflections, are challenging for the feed-forward approach. We propose an extension of the feed-forward pipeline to handle second-order rays resulting from specular and glossy reflections. The coherence of second-order rays is leveraged through clustering, the geometry reflected by a cluster is approximated with a depth image, and the color samples captured by the second-order rays of a cluster are computed by intersection with the depth image. We achieve quality specular and glossy reflections at interactive rates in fully dynamic scenes.",
"title": "Second-Order Feed-Forward Renderingfor Specular and Glossy Reflections",
"normalizedTitle": "Second-Order Feed-Forward Renderingfor Specular and Glossy Reflections",
"fno": "06803934",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Reflection",
"Cameras",
"Rendering Computer Graphics",
"Approximation Methods",
"Geometry",
"Ray Tracing",
"Image Color Analysis"
],
"authors": [
{
"givenName": null,
"surname": "Lili Wang",
"fullName": "Lili Wang",
"affiliation": "State Key Lab. of Virtual Reality Technol. & Syst, Beihang Univ., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Naiwen Xie",
"fullName": "Naiwen Xie",
"affiliation": "State Key Lab. of Virtual Reality Technol. & Syst, Beihang Univ., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Wei Ke",
"fullName": "Wei Ke",
"affiliation": "Comput. Sci. Dept., Macao Polytech. Inst., Macau, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Voicu",
"surname": "Popescu",
"fullName": "Voicu Popescu",
"affiliation": "Comput. Sci. Dept., Purdue Univ., West Lafayette, IN, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2014-09-01 00:00:00",
"pubType": "trans",
"pages": "1316-1329",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2002/1695/3/169530573",
"title": "Multibaseline Stereo in the Presence of Specular Reflections",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2002/169530573/12OmNA0MZ8q",
"parentPublication": {
"id": "proceedings/icpr/2002/1695/3",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2011/1101/0/06126291",
"title": "Pose estimation from reflections for specular surface recovery",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2011/06126291/12OmNAXxX7s",
"parentPublication": {
"id": "proceedings/iccv/2011/1101/0",
"title": "2011 IEEE International Conference on Computer Vision (ICCV 2011)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2009/3992/0/05206820",
"title": "3D pose estimation and segmentation using specular cues",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206820/12OmNrMZpHb",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visapp/2014/8133/1/07294821",
"title": "Generic and real-time detection of specular reflections in images",
"doi": null,
"abstractUrl": "/proceedings-article/visapp/2014/07294821/12OmNxETaga",
"parentPublication": {
"id": "proceedings/visapp/2014/8133/1",
"title": "2014 International Conference on Computer Vision Theory and Applications (VISAPP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csit/2013/2460/0/06710353",
"title": "Automatic detection and concealment of specular reflections for endoscopic images",
"doi": null,
"abstractUrl": "/proceedings-article/csit/2013/06710353/12OmNyKa5Zo",
"parentPublication": {
"id": "proceedings/csit/2013/2460/0",
"title": "2013 Computer Science and Information Technologies (CSIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dpvt/2002/1521/0/15210356",
"title": "Second order local analysis for 3D reconstruction of specular surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/3dpvt/2002/15210356/12OmNzayNvZ",
"parentPublication": {
"id": "proceedings/3dpvt/2002/1521/0",
"title": "3D Data Processing Visualization and Transmission, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2000/03/v0253",
"title": "Perturbation Methods for Interactive Specular Reflections",
"doi": null,
"abstractUrl": "/journal/tg/2000/03/v0253/13rRUwj7coZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/01/v0046",
"title": "Interactive Approximate Rendering of Reflections, Refractions, and Caustics",
"doi": null,
"abstractUrl": "/journal/tg/2007/01/v0046/13rRUxBJhmJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/06/v1590",
"title": "Sample-Based Cameras for Feed Forward Reflection Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2006/06/v1590/13rRUxjQyp5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2022/9617/0/961700a483",
"title": "Interactive Mixed Reality Rendering on Holographic Pyramid",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2022/961700a483/1CJcsRpGDQI",
"parentPublication": {
"id": "proceedings/vr/2022/9617/0",
"title": "2022 IEEE on Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06702519",
"articleId": "13rRUwkfAZi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06684150",
"articleId": "13rRUwgQpqK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyq0zFB",
"title": "May",
"year": "2016",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "22",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgs2C0",
"doi": "10.1109/TVCG.2015.2440252",
"abstract": "Measuring the similarity of integral curves is fundamental to many important flow data analysis and visualization tasks such as feature detection, pattern querying, streamline clustering, and hierarchical exploration. In this paper, we introduce FlowString, a novel vocabulary approach that extracts shape invariant features from streamlines and utilizes a string-based method for exploratory streamline analysis and visualization. Our solution first resamples streamlines by considering their local feature scales. We then classify resampled points along streamlines based on the shape similarity around their local neighborhoods. We encode each streamline into a string of well-selected shape characters, from which we construct meaningful words for querying and retrieval. A unique feature of our approach is that it captures intrinsic streamline similarity that is invariant under translation, rotation and scaling. We design an intuitive interface and user interactions to support flexible querying, allowing exact and approximate searches for partial streamline matching. Users can perform queries at either the character level or the word level, and define their own characters or words conveniently for customized search. We demonstrate the effectiveness of FlowString with several flow field data sets of different sizes and characteristics. We also extend FlowString to handle multiple data sets and perform an empirical expert evaluation to confirm the usefulness of this approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Measuring the similarity of integral curves is fundamental to many important flow data analysis and visualization tasks such as feature detection, pattern querying, streamline clustering, and hierarchical exploration. In this paper, we introduce FlowString, a novel vocabulary approach that extracts shape invariant features from streamlines and utilizes a string-based method for exploratory streamline analysis and visualization. Our solution first resamples streamlines by considering their local feature scales. We then classify resampled points along streamlines based on the shape similarity around their local neighborhoods. We encode each streamline into a string of well-selected shape characters, from which we construct meaningful words for querying and retrieval. A unique feature of our approach is that it captures intrinsic streamline similarity that is invariant under translation, rotation and scaling. We design an intuitive interface and user interactions to support flexible querying, allowing exact and approximate searches for partial streamline matching. Users can perform queries at either the character level or the word level, and define their own characters or words conveniently for customized search. We demonstrate the effectiveness of FlowString with several flow field data sets of different sizes and characteristics. We also extend FlowString to handle multiple data sets and perform an empirical expert evaluation to confirm the usefulness of this approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Measuring the similarity of integral curves is fundamental to many important flow data analysis and visualization tasks such as feature detection, pattern querying, streamline clustering, and hierarchical exploration. In this paper, we introduce FlowString, a novel vocabulary approach that extracts shape invariant features from streamlines and utilizes a string-based method for exploratory streamline analysis and visualization. Our solution first resamples streamlines by considering their local feature scales. We then classify resampled points along streamlines based on the shape similarity around their local neighborhoods. We encode each streamline into a string of well-selected shape characters, from which we construct meaningful words for querying and retrieval. A unique feature of our approach is that it captures intrinsic streamline similarity that is invariant under translation, rotation and scaling. We design an intuitive interface and user interactions to support flexible querying, allowing exact and approximate searches for partial streamline matching. Users can perform queries at either the character level or the word level, and define their own characters or words conveniently for customized search. We demonstrate the effectiveness of FlowString with several flow field data sets of different sizes and characteristics. We also extend FlowString to handle multiple data sets and perform an empirical expert evaluation to confirm the usefulness of this approach.",
"title": "A Vocabulary Approach to Partial Streamline Matching and Exploratory Flow Visualization",
"normalizedTitle": "A Vocabulary Approach to Partial Streamline Matching and Exploratory Flow Visualization",
"fno": "07117453",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Shape",
"Feature Extraction",
"Vocabulary",
"Spirals",
"Data Visualization",
"Windings",
"Diffusion Tensor Imaging",
"User Interface",
"Streamline Similarity",
"Shape Invariant Features",
"Partial Matching",
"Exploratory Flow Visualization",
"User Interface",
"Streamline Similarity",
"Shape Invariant Features",
"Partial Matching",
"Exploratory Flow Visualization"
],
"authors": [
{
"givenName": "Jun",
"surname": "Tao",
"fullName": "Jun Tao",
"affiliation": "Department of Computer Science, Michigan Technological University, 1400 Townsend Drive, Houghton, MI",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chaoli",
"surname": "Wang",
"fullName": "Chaoli Wang",
"affiliation": "Department of Computer Science & Engineering, University of Notre Dame, Notre Dame, IN",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ching-Kuang",
"surname": "Shene",
"fullName": "Ching-Kuang Shene",
"affiliation": "Department of Computer Science, Michigan Technological University, 1400 Townsend Drive, Houghton, MI",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Raymond A.",
"surname": "Shaw",
"fullName": "Raymond A. Shaw",
"affiliation": "Department of Physics, Michigan Technological University, 1400 Townsend Drive, Houghton, MI",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2016-05-01 00:00:00",
"pubType": "trans",
"pages": "1503-1516",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cad-graphics/2015/8020/0/07450407",
"title": "Feature-Based Streamline Selection Method for 2D Flow Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2015/07450407/12OmNBEYzMf",
"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/icdm/2012/4905/0/4905b014",
"title": "A Similarity Model and Segmentation Algorithm for White Matter Fiber Tracts",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2012/4905b014/12OmNBpVPYF",
"parentPublication": {
"id": "proceedings/icdm/2012/4905/0",
"title": "2012 IEEE 12th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2013/4797/0/06596153",
"title": "Exploring vector fields with distribution-based streamline analysis",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2013/06596153/12OmNvAiSjV",
"parentPublication": {
"id": "proceedings/pacificvis/2013/4797/0",
"title": "2013 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a009",
"title": "FlowString: Partial Streamline Matching Using Shape Invariant Similarity Measure for Exploratory Flow Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a009/12OmNvjQ8PN",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1448",
"title": "Similarity-Guided Streamline Placement with Error Evaluation",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1448/13rRUEgs2BN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/08/ttg2013081342",
"title": "Similarity Measures for Enhancing Interactive Streamline Seeding",
"doi": null,
"abstractUrl": "/journal/tg/2013/08/ttg2013081342/13rRUwInvB3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1181",
"title": "Hybrid Visualization for White Matter Tracts using Triangle Strips and Point Sprites",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1181/13rRUwInvyo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/10/06767149",
"title": "Exploring Flow Fields Using Space-Filling Analysis of Streamlines",
"doi": null,
"abstractUrl": "/journal/tg/2014/10/06767149/13rRUx0xPTT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/04376178",
"title": "Visualizing Whole-Brain DTI Tractography with GPU-based Tuboids and LoD Management",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/04376178/13rRUxCitJ6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/06025348",
"title": "Hierarchical Streamline Bundles",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/06025348/13rRUyY28Yt",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07127055",
"articleId": "13rRUygT7sG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07118240",
"articleId": "13rRUwInvl4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx4gUpl",
"title": "September",
"year": "1985",
"issueNum": "09",
"idPrefix": "co",
"pubType": "magazine",
"volume": "18",
"label": "September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUB6SpOA",
"doi": "10.1109/MC.1985.1663002",
"abstract": null,
"abstracts": [
{
"abstractType": "Regular",
"content": "",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": null,
"title": "Advance Announcement Pacific Computer Communication Symposium",
"normalizedTitle": "Advance Announcement Pacific Computer Communication Symposium",
"fno": "01663002",
"hasPdf": true,
"idPrefix": "co",
"keywords": [],
"authors": [],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": false,
"isOpenAccess": true,
"issueNum": "09",
"pubDate": "1985-09-01 00:00:00",
"pubType": "mags",
"pages": "35-38",
"year": "1985",
"issn": "0018-9162",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "01663008",
"articleId": "13rRUwcS1zr",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01663003",
"articleId": "13rRUwwaKmN",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNz6iObk",
"title": "July",
"year": "1985",
"issueNum": "07",
"idPrefix": "co",
"pubType": "magazine",
"volume": "18",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvyanS",
"doi": "10.1109/MC.1985.1662950",
"abstract": null,
"abstracts": [
{
"abstractType": "Regular",
"content": "",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": null,
"title": "Advance Announcement Pacific Computer Communication Symposium",
"normalizedTitle": "Advance Announcement Pacific Computer Communication Symposium",
"fno": "01662950",
"hasPdf": true,
"idPrefix": "co",
"keywords": [],
"authors": [],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": false,
"isOpenAccess": true,
"issueNum": "07",
"pubDate": "1985-07-01 00:00:00",
"pubType": "mags",
"pages": "68",
"year": "1985",
"issn": "0018-9162",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "01662949",
"articleId": "13rRUygT7AN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01662951",
"articleId": "13rRUxYrbP2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAtstbj",
"title": "Sept.",
"year": "2012",
"issueNum": "09",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjGoLD",
"doi": "10.1109/TVCG.2012.157",
"abstract": null,
"abstracts": [
{
"abstractType": "Regular",
"content": "",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": null,
"title": "Guest Editor's Introduction: Special Section on the IEEE Pacific Visualization Symposium",
"normalizedTitle": "Guest Editor's Introduction: Special Section on the IEEE Pacific Visualization Symposium",
"fno": "ttg2012091381",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [
{
"givenName": "Giuseppe",
"surname": "Di Battista",
"fullName": "Giuseppe Di Battista",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jean-Daniel",
"surname": "Fekete",
"fullName": "Jean-Daniel Fekete",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Qu",
"fullName": "Huamin Qu",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "09",
"pubDate": "2012-09-01 00:00:00",
"pubType": "trans",
"pages": "1381-1382",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2016/07/07478595",
"title": "Guest Editors’ Introduction: Special Section on the IEEE Pacific Visualization Symposium 2015",
"doi": null,
"abstractUrl": "/journal/tg/2016/07/07478595/13rRUEgarsL",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/06/ttg2013060898",
"title": "Guest Editors' Introduction: Special Section on the IEEE Pacific Visualization Symposium 2012",
"doi": null,
"abstractUrl": "/journal/tg/2013/06/ttg2013060898/13rRUNvgziD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2000/02/v0097",
"title": "Guest Editor's Introduction: Special Section on Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2000/02/v0097/13rRUwI5U7Q",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/08/07138667",
"title": "Guest Editors’ Introduction: Special Section on the IEEE Pacific Visualization Symposium 2014",
"doi": null,
"abstractUrl": "/journal/tg/2015/08/07138667/13rRUwI5Ugf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/04/ttg2008040725",
"title": "Guest Editor's Introduction: Special Section on EuroVis",
"doi": null,
"abstractUrl": "/journal/tg/2008/04/ttg2008040725/13rRUxASuAq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/11/ttg2011111545",
"title": "Guest Editor's Introduction: Special Section on the IEEE Pacific Visualization Symposium",
"doi": null,
"abstractUrl": "/journal/tg/2011/11/ttg2011111545/13rRUxASuGe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/08/06847259",
"title": "Guest Editors' Introduction: Special Section on the IEEE Pacific Visualization Symposium",
"doi": null,
"abstractUrl": "/journal/tg/2014/08/06847259/13rRUxD9gXJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/06/07462316",
"title": "Guest Editor’s Introduction to the Special Section on the 2016 IEEE Pacific Visualization Symposium",
"doi": null,
"abstractUrl": "/journal/tg/2016/06/07462316/13rRUxcbnHe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1999/02/00773802",
"title": "Guest Editor's introduction: special section on visualization",
"doi": null,
"abstractUrl": "/journal/tg/1999/02/00773802/13rRUyfKIHw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1999/04/e0435",
"title": "Guest Editor's Special Section Introduction",
"doi": null,
"abstractUrl": "/journal/ts/1999/04/e0435/13rRUygT7gS",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "06065731",
"articleId": "13rRUyv53Fn",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzXFovR",
"title": "November",
"year": "2011",
"issueNum": "11",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "November",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuGe",
"doi": "10.1109/TVCG.2011.149",
"abstract": null,
"abstracts": [
{
"abstractType": "Regular",
"content": "",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": null,
"title": "Guest Editor's Introduction: Special Section on the IEEE Pacific Visualization Symposium",
"normalizedTitle": "Guest Editor's Introduction: Special Section on the IEEE Pacific Visualization Symposium",
"fno": "ttg2011111545",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [
{
"givenName": "Stephen",
"surname": "North",
"fullName": "Stephen North",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Han-Wei",
"surname": "Shen",
"fullName": "Han-Wei Shen",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jarke J.",
"surname": "van Wijk",
"fullName": "Jarke J. van Wijk",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "11",
"pubDate": "2011-11-01 00:00:00",
"pubType": "trans",
"pages": "1545-1546",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2016/07/07478595",
"title": "Guest Editors’ Introduction: Special Section on the IEEE Pacific Visualization Symposium 2015",
"doi": null,
"abstractUrl": "/journal/tg/2016/07/07478595/13rRUEgarsL",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/06/ttg2013060898",
"title": "Guest Editors' Introduction: Special Section on the IEEE Pacific Visualization Symposium 2012",
"doi": null,
"abstractUrl": "/journal/tg/2013/06/ttg2013060898/13rRUNvgziD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2000/02/v0097",
"title": "Guest Editor's Introduction: Special Section on Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2000/02/v0097/13rRUwI5U7Q",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/08/07138667",
"title": "Guest Editors’ Introduction: Special Section on the IEEE Pacific Visualization Symposium 2014",
"doi": null,
"abstractUrl": "/journal/tg/2015/08/07138667/13rRUwI5Ugf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/09/ttg2012091381",
"title": "Guest Editor's Introduction: Special Section on the IEEE Pacific Visualization Symposium",
"doi": null,
"abstractUrl": "/journal/tg/2012/09/ttg2012091381/13rRUwjGoLD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/04/ttg2008040725",
"title": "Guest Editor's Introduction: Special Section on EuroVis",
"doi": null,
"abstractUrl": "/journal/tg/2008/04/ttg2008040725/13rRUxASuAq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/08/06847259",
"title": "Guest Editors' Introduction: Special Section on the IEEE Pacific Visualization Symposium",
"doi": null,
"abstractUrl": "/journal/tg/2014/08/06847259/13rRUxD9gXJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/06/07462316",
"title": "Guest Editor’s Introduction to the Special Section on the 2016 IEEE Pacific Visualization Symposium",
"doi": null,
"abstractUrl": "/journal/tg/2016/06/07462316/13rRUxcbnHe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1999/02/00773802",
"title": "Guest Editor's introduction: special section on visualization",
"doi": null,
"abstractUrl": "/journal/tg/1999/02/00773802/13rRUyfKIHw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1999/04/e0435",
"title": "Guest Editor's Special Section Introduction",
"doi": null,
"abstractUrl": "/journal/ts/1999/04/e0435/13rRUygT7gS",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "ttg2011111547",
"articleId": "13rRUx0Pqpu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAoDihr",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tk",
"pubType": "journal",
"volume": "31",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45XzbnJ9",
"doi": "10.1109/TKDE.2018.2876580",
"abstract": null,
"abstracts": [],
"normalizedAbstract": null,
"title": "Special Section on the International Conference on Data Engineering 2016",
"normalizedTitle": "Special Section on the International Conference on Data Engineering 2016",
"fno": "08566026",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [],
"authors": [
{
"givenName": "Meichun",
"surname": "Hsu",
"fullName": "Meichun Hsu",
"affiliation": "Oracle Corp., Redwood City, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alfons",
"surname": "Kemper",
"fullName": "Alfons Kemper",
"affiliation": "Department of Informatics, Technische Universität München, Garching, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Timos",
"surname": "Sellis",
"fullName": "Timos Sellis",
"affiliation": "Data Science Research Institute, Swinburne University of Technology, Melbourne, Australia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "1-2",
"year": "2019",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tk/2015/07/07116678",
"title": "Guest Editorial: Special Section on the International Conference on Data Engineering",
"doi": null,
"abstractUrl": "/journal/tk/2015/07/07116678/13rRUEgarBN",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2018/04/08428603",
"title": "Guest Editors’ Introduction to the Special Section on the 14th International Conference on Computational Methods in Systems Biology (CMSB 2016)",
"doi": null,
"abstractUrl": "/journal/tb/2018/04/08428603/13rRUwI5TPA",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2000/05/k0673",
"title": "Guest Editors' Introduction: Special Section on the 15th International Conference on Data Engineering",
"doi": null,
"abstractUrl": "/journal/tk/2000/05/k0673/13rRUwInuWI",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2009/04/tts2009040450",
"title": "Guest Editors' Introduction to the Special Section from the International Conference on Software Maintenance",
"doi": null,
"abstractUrl": "/journal/ts/2009/04/tts2009040450/13rRUwInvgQ",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2003/03/01218204",
"title": "Special section on the 2001 International Conference on Computer Design (ICCD)",
"doi": null,
"abstractUrl": "/journal/si/2003/03/01218204/13rRUwcS1wj",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2016/02/07310872",
"title": "Guest Editorial: Special Section on the International Conference on Data Engineering",
"doi": null,
"abstractUrl": "/journal/tk/2016/02/07310872/13rRUxAASWn",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2017/03/07842742",
"title": "Special Section on the International Conference on Data Engineering 2015",
"doi": null,
"abstractUrl": "/journal/tk/2017/03/07842742/13rRUxASu15",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2014/06/06824893",
"title": "Guest Editorial: Special Section on the International Conference on Data Engineering",
"doi": null,
"abstractUrl": "/journal/tk/2014/06/06824893/13rRUxjQyhJ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2018/05/08485532",
"title": "Guest Editorial for Special Section on the 12th International Conference on Intelligent Computing (ICIC)",
"doi": null,
"abstractUrl": "/journal/tb/2018/05/08485532/14dcEePSN6e",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/06/09976406",
"title": "Guest Editorial for Special Section on the 16th International Conference on Intelligent Computing (ICIC)",
"doi": null,
"abstractUrl": "/journal/tb/2022/06/09976406/1IWfy9tMnio",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "07913668",
"articleId": "17D45X0yjSq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBOUxmQ",
"title": "November/December",
"year": "2008",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "14",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILLkDJ",
"doi": "10.1109/TVCG.2008.166",
"abstract": "In February 2008, the New York Times published an unusual chart of box office revenues for 7500 movies over 21 years. The chart was based on a similar visualization, developed by the first author, that displayed trends in music listening. This paper describes the design decisions and algorithms behind these graphics, and discusses the reaction on the Web. We suggest that this type of complex layered graph is effective for displaying large data sets to a mass audience. We provide a mathematical analysis of how this layered graph relates to traditional stacked graphs and to techniques such as ThemeRiver, showing how each method is optimizing a different “energy function”. Finally, we discuss techniques for coloring and ordering the layers of such graphs. Throughout the paper, we emphasize the interplay between considerations of aesthetics and legibility. \r",
"abstracts": [
{
"abstractType": "Regular",
"content": "In February 2008, the New York Times published an unusual chart of box office revenues for 7500 movies over 21 years. The chart was based on a similar visualization, developed by the first author, that displayed trends in music listening. This paper describes the design decisions and algorithms behind these graphics, and discusses the reaction on the Web. We suggest that this type of complex layered graph is effective for displaying large data sets to a mass audience. We provide a mathematical analysis of how this layered graph relates to traditional stacked graphs and to techniques such as ThemeRiver, showing how each method is optimizing a different “energy function”. Finally, we discuss techniques for coloring and ordering the layers of such graphs. Throughout the paper, we emphasize the interplay between considerations of aesthetics and legibility. \r",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In February 2008, the New York Times published an unusual chart of box office revenues for 7500 movies over 21 years. The chart was based on a similar visualization, developed by the first author, that displayed trends in music listening. This paper describes the design decisions and algorithms behind these graphics, and discusses the reaction on the Web. We suggest that this type of complex layered graph is effective for displaying large data sets to a mass audience. We provide a mathematical analysis of how this layered graph relates to traditional stacked graphs and to techniques such as ThemeRiver, showing how each method is optimizing a different “energy function”. Finally, we discuss techniques for coloring and ordering the layers of such graphs. Throughout the paper, we emphasize the interplay between considerations of aesthetics and legibility. \r",
"title": "Stacked Graphs – Geometry & Aesthetics",
"normalizedTitle": "Stacked Graphs – Geometry & Aesthetics",
"fno": "ttg2008061245",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Streamgraph",
"Theme River",
"Listening History",
"Last Fm",
"Aesthetics",
"Communication Minded Visualization",
"Time Series"
],
"authors": [
{
"givenName": "Lee",
"surname": "Byron",
"fullName": "Lee Byron",
"affiliation": "The New York Times",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Martin",
"surname": "Wattenberg",
"fullName": "Martin Wattenberg",
"affiliation": "Visual Communication Lab at IBM",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1245-1252",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2005/04/v0457",
"title": "Topological Fisheye Views for Visualizing Large Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2005/04/v0457/13rRUIM2VGU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061277",
"title": "Geometry-Based Edge Clustering for Graph Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061277/13rRUNvyakF",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1968/04/01687343",
"title": "Irreducible Decompositions of Transformation Graphs by Assignment Techniques",
"doi": null,
"abstractUrl": "/journal/tc/1968/04/01687343/13rRUwvBy7u",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/06/07419266",
"title": "PieceStack: Toward Better Understanding of Stacked Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2016/06/07419266/13rRUxD9gXM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061237",
"articleId": "13rRUwbaqUM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061253",
"articleId": "13rRUygT7f5",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBOUxmQ",
"title": "November/December",
"year": "2008",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "14",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvyakF",
"doi": "10.1109/TVCG.2008.135",
"abstract": "Graphs have been widely used to model relationships among data. For large graphs, excessive edge crossings make the display visually cluttered and thus difficult to explore. In this paper, we propose a novel geometry-based edge-clustering framework that can group edges into bundles to reduce the overall edge crossings. Our method uses a control mesh to guide the edge-clustering process; edge bundles can be formed by forcing all edges to pass through some control points on the mesh. The control mesh can be generated at different levels of detail either manually or automatically based on underlying graph patterns. Users can further interact with the edge-clustering results through several advanced visualization techniques such as color and opacity enhancement. Compared with other edge-clustering methods, our approach is intuitive, flexible, and efficient. The experiments on some large graphs demonstrate the effectiveness of our method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Graphs have been widely used to model relationships among data. For large graphs, excessive edge crossings make the display visually cluttered and thus difficult to explore. In this paper, we propose a novel geometry-based edge-clustering framework that can group edges into bundles to reduce the overall edge crossings. Our method uses a control mesh to guide the edge-clustering process; edge bundles can be formed by forcing all edges to pass through some control points on the mesh. The control mesh can be generated at different levels of detail either manually or automatically based on underlying graph patterns. Users can further interact with the edge-clustering results through several advanced visualization techniques such as color and opacity enhancement. Compared with other edge-clustering methods, our approach is intuitive, flexible, and efficient. The experiments on some large graphs demonstrate the effectiveness of our method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Graphs have been widely used to model relationships among data. For large graphs, excessive edge crossings make the display visually cluttered and thus difficult to explore. In this paper, we propose a novel geometry-based edge-clustering framework that can group edges into bundles to reduce the overall edge crossings. Our method uses a control mesh to guide the edge-clustering process; edge bundles can be formed by forcing all edges to pass through some control points on the mesh. The control mesh can be generated at different levels of detail either manually or automatically based on underlying graph patterns. Users can further interact with the edge-clustering results through several advanced visualization techniques such as color and opacity enhancement. Compared with other edge-clustering methods, our approach is intuitive, flexible, and efficient. The experiments on some large graphs demonstrate the effectiveness of our method.",
"title": "Geometry-Based Edge Clustering for Graph Visualization",
"normalizedTitle": "Geometry-Based Edge Clustering for Graph Visualization",
"fno": "ttg2008061277",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Graph Visualization",
"Visual Clutter",
"Mesh",
"Edge Clustering"
],
"authors": [
{
"givenName": "Weiwei",
"surname": "Cui",
"fullName": "Weiwei Cui",
"affiliation": "the Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hong",
"surname": "Zhou",
"fullName": "Hong Zhou",
"affiliation": "the Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Qu",
"fullName": "Huamin Qu",
"affiliation": "the Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pak Chung",
"surname": "Wong",
"fullName": "Pak Chung Wong",
"affiliation": "Pacific Northwest National Laboratory",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaoming",
"surname": "Li",
"fullName": "Xiaoming Li",
"affiliation": "Peking University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1277-1284",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2010/7846/0/05571244",
"title": "3D Edge Bundling for Geographical Data Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2010/05571244/12OmNqzu6LL",
"parentPublication": {
"id": "proceedings/iv/2010/7846/0",
"title": "2010 14th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2011/935/0/05742389",
"title": "Multilevel agglomerative edge bundling for visualizing large graphs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742389/12OmNxj233Y",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192715",
"title": "BiSet: Semantic Edge Bundling with Biclusters for Sensemaking",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192715/13rRUNvgz9T",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539373",
"title": "Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539373/13rRUwcS1CZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122364",
"title": "Skeleton-Based Edge Bundling for Graph Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122364/13rRUxjyX3W",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061651",
"title": "Edge Groups: An Approach to Understanding the Mesh Quality of Marching Methods",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061651/13rRUxly8XA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061333",
"title": "Perceptual Organization in User-Generated Graph Layouts",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061333/13rRUyeCkac",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/10/08423100",
"title": "The Effect of Edge Bundling and Seriation on Sensemaking of Biclusters in Bipartite Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2019/10/08423100/1d3e5UbWqis",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a248",
"title": "Time-Aligned Edge Plots for Dynamic Graph Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a248/1rSR9vG2u4w",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2023/01/09599491",
"title": "Visual Analysis of Multidimensional Big Data: A Scalable Lightweight Bundling Method for Parallel Coordinates",
"doi": null,
"abstractUrl": "/journal/bd/2023/01/09599491/1yeC5mmD996",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061404",
"articleId": "13rRUwjXZS7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061285",
"articleId": "13rRUwbs2aV",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgP4",
"name": "ttg2008061277.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2008061277.mov",
"extension": "mov",
"size": "37.9 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUxASuhx",
"doi": "10.1109/TVCG.2012.189",
"abstract": "Recently there has been increasing research interest in displaying graphs with curved edges to produce more readable visualizations. While there are several automatic techniques, little has been done to evaluate their effectiveness empirically. In this paper we present two experiments studying the impact of edge curvature on graph readability. The goal is to understand the advantages and disadvantages of using curved edges for common graph tasks compared to straight line segments, which are the conventional choice for showing edges in node-link diagrams. We included several edge variations: straight edges, edges with different curvature levels, and mixed straight and curved edges. During the experiments, participants were asked to complete network tasks including determination of connectivity, shortest path, node degree, and common neighbors. We also asked the participants to provide subjective ratings of the aesthetics of different edge types. The results show significant performance differences between the straight and curved edges and clear distinctions between variations of curved edges.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recently there has been increasing research interest in displaying graphs with curved edges to produce more readable visualizations. While there are several automatic techniques, little has been done to evaluate their effectiveness empirically. In this paper we present two experiments studying the impact of edge curvature on graph readability. The goal is to understand the advantages and disadvantages of using curved edges for common graph tasks compared to straight line segments, which are the conventional choice for showing edges in node-link diagrams. We included several edge variations: straight edges, edges with different curvature levels, and mixed straight and curved edges. During the experiments, participants were asked to complete network tasks including determination of connectivity, shortest path, node degree, and common neighbors. We also asked the participants to provide subjective ratings of the aesthetics of different edge types. The results show significant performance differences between the straight and curved edges and clear distinctions between variations of curved edges.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recently there has been increasing research interest in displaying graphs with curved edges to produce more readable visualizations. While there are several automatic techniques, little has been done to evaluate their effectiveness empirically. In this paper we present two experiments studying the impact of edge curvature on graph readability. The goal is to understand the advantages and disadvantages of using curved edges for common graph tasks compared to straight line segments, which are the conventional choice for showing edges in node-link diagrams. We included several edge variations: straight edges, edges with different curvature levels, and mixed straight and curved edges. During the experiments, participants were asked to complete network tasks including determination of connectivity, shortest path, node degree, and common neighbors. We also asked the participants to provide subjective ratings of the aesthetics of different edge types. The results show significant performance differences between the straight and curved edges and clear distinctions between variations of curved edges.",
"title": "A User Study on Curved Edges in Graph Visualization",
"normalizedTitle": "A User Study on Curved Edges in Graph Visualization",
"fno": "ttg2012122449",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Layout",
"Educational Institutions",
"Optimization",
"Software",
"Analysis Of Variance",
"User Interfaces",
"Evaluation",
"Graph",
"Visualization",
"Curved Edges"
],
"authors": [
{
"givenName": "Kai",
"surname": "Xu",
"fullName": "Kai Xu",
"affiliation": "Middlesex University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chris",
"surname": "Rooney",
"fullName": "Chris Rooney",
"affiliation": "Middlesex University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter",
"surname": "Passmore",
"fullName": "Peter Passmore",
"affiliation": "Middlesex University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dong-Han",
"surname": "Ham",
"fullName": "Dong-Han Ham",
"affiliation": "Chonnam National University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Phong H.",
"surname": "Nguyen",
"fullName": "Phong H. Nguyen",
"affiliation": "Middlesex University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2449-2456",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sitis/2009/3959/0/3959a016",
"title": "An Algorithm to Construct 3D Triangles with Circular Edges",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2009/3959a016/12OmNARRYCC",
"parentPublication": {
"id": "proceedings/sitis/2009/3959/0",
"title": "2009 Fifth International Conference on Signal Image Technology and Internet Based Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icec/2009/3655/0/3655a193",
"title": "Exact Solutions for In-Plane Displacements of Curved Beams under Thermo Load",
"doi": null,
"abstractUrl": "/proceedings-article/icec/2009/3655a193/12OmNwcl7KE",
"parentPublication": {
"id": "proceedings/icec/2009/3655/0",
"title": "Engineering Computation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2017/6647/0/07892269",
"title": "Turn physically curved paths into virtual curved paths",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2017/07892269/12OmNwogh7T",
"parentPublication": {
"id": "proceedings/vr/2017/6647/0",
"title": "2017 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851a213",
"title": "Fast Detection of Curved Edges at Low SNR",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851a213/12OmNxWLTvX",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a001",
"title": "Exploring Curved Schematization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a001/12OmNz6iOBx",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/svr/2012/4725/0/4725a246",
"title": "Local Quadrics Surface Approximation for Real-Time Tracking of Textureless 3D Rigid Curved Objects",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2012/4725a246/12OmNzC5SP9",
"parentPublication": {
"id": "proceedings/svr/2012/4725/0",
"title": "2012 14th Symposium on Virtual and Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2011/4520/0/4520b399",
"title": "Recognition of Multi-oriented, Multi-sized, and Curved Text",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2011/4520b399/12OmNzYNN5x",
"parentPublication": {
"id": "proceedings/icdar/2011/4520/0",
"title": "2011 International Conference on Document Analysis and Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/08/07035078",
"title": "Exploring Curved Schematization of Territorial Outlines",
"doi": null,
"abstractUrl": "/journal/tg/2015/08/07035078/13rRUwh80Hf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1994/07/i0726",
"title": "On the Location Error of Curved Edges in Low-Pass Filtered 2-D and 3-D Images",
"doi": null,
"abstractUrl": "/journal/tp/1994/07/i0726/13rRUxcsYMU",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2020/04/08607091",
"title": "On Detection of Faint Edges in Noisy Images",
"doi": null,
"abstractUrl": "/journal/tp/2020/04/08607091/17D45WWzW3h",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012122441",
"articleId": "13rRUy0qnGj",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122457",
"articleId": "13rRUNvyakM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwCJOFF",
"title": "January",
"year": "1989",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": "11",
"label": "January",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxCitz9",
"doi": "10.1109/34.23112",
"abstract": "It is shown that zero-crossing edge detection algorithms can produce edges that do not correspond to significant image intensity changes. Such edges are called phantom or spurious. A method for classifying zero crossings as corresponding to authentic or phantom edges is presented. The contrast of an authentic edge is shown to increase and the contrast of phantom edges to decrease with a decrease in the filter scale. Thus, a phantom edge is truly a phantom in that the closer one examines it, the weaker it becomes. The results of applying the classification schemes described to synthetic and authentic signals in one and two dimensions are given. The significance of the phantom edges is examined with respect to their frequency and strength relative to the authentic edges, and it is seen that authentic edges are denser and stronger, on the average, than phantom edges.",
"abstracts": [
{
"abstractType": "Regular",
"content": "It is shown that zero-crossing edge detection algorithms can produce edges that do not correspond to significant image intensity changes. Such edges are called phantom or spurious. A method for classifying zero crossings as corresponding to authentic or phantom edges is presented. The contrast of an authentic edge is shown to increase and the contrast of phantom edges to decrease with a decrease in the filter scale. Thus, a phantom edge is truly a phantom in that the closer one examines it, the weaker it becomes. The results of applying the classification schemes described to synthetic and authentic signals in one and two dimensions are given. The significance of the phantom edges is examined with respect to their frequency and strength relative to the authentic edges, and it is seen that authentic edges are denser and stronger, on the average, than phantom edges.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "It is shown that zero-crossing edge detection algorithms can produce edges that do not correspond to significant image intensity changes. Such edges are called phantom or spurious. A method for classifying zero crossings as corresponding to authentic or phantom edges is presented. The contrast of an authentic edge is shown to increase and the contrast of phantom edges to decrease with a decrease in the filter scale. Thus, a phantom edge is truly a phantom in that the closer one examines it, the weaker it becomes. The results of applying the classification schemes described to synthetic and authentic signals in one and two dimensions are given. The significance of the phantom edges is examined with respect to their frequency and strength relative to the authentic edges, and it is seen that authentic edges are denser and stronger, on the average, than phantom edges.",
"title": "Authenticating Edges Produced by Zero-Crossing Algorithms",
"normalizedTitle": "Authenticating Edges Produced by Zero-Crossing Algorithms",
"fno": "i0043",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Edge Authentication Picture Processing Pattern Recognition Zero Crossing Edge Detection Algorithms Phantom Edges Authentic Edges Pattern Recognition Picture Processing"
],
"authors": [
{
"givenName": "J.J.",
"surname": "Clark",
"fullName": "J.J. Clark",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "1989-01-01 00:00:00",
"pubType": "trans",
"pages": "43-57",
"year": "1989",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0031",
"articleId": "13rRUxcKzW9",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0058",
"articleId": "13rRUypp58r",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBqdrhX",
"title": "April",
"year": "2004",
"issueNum": "04",
"idPrefix": "tp",
"pubType": "journal",
"volume": "26",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy2YLTR",
"doi": "10.1109/TPAMI.2004.1265863",
"abstract": "Abstract—This paper presents a new Bayesian framework for motion segmentation—dividing a frame from an image sequence into layers representing different moving objects—by tracking edges between frames. Edges are found using the Canny edge detector, and the Expectation-Maximization algorithm is then used to fit motion models to these edges and also to calculate the probabilities of the edges obeying each motion model. The edges are also used to segment the image into regions of similar color. The most likely labeling for these regions is then calculated by using the edge probabilities, in association with a Markov Random Field-style prior. The identification of the relative depth ordering of the different motion layers is also determined, as an integral part of the process. An efficient implementation of this framework is presented for segmenting two motions (foreground and background) using two frames. It is then demonstrated how, by tracking the edges into further frames, the probabilities may be accumulated to provide an even more accurate and robust estimate, and segment an entire sequence. Further extensions are then presented to address the segmentation of more than two motions. Here, a hierarchical method of initializing the Expectation-Maximization algorithm is described, and it is demonstrated that the Minimum Description Length principle may be used to automatically select the best number of motion layers. The results from over 30 sequences (demonstrating both two and three motions) are presented and discussed.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—This paper presents a new Bayesian framework for motion segmentation—dividing a frame from an image sequence into layers representing different moving objects—by tracking edges between frames. Edges are found using the Canny edge detector, and the Expectation-Maximization algorithm is then used to fit motion models to these edges and also to calculate the probabilities of the edges obeying each motion model. The edges are also used to segment the image into regions of similar color. The most likely labeling for these regions is then calculated by using the edge probabilities, in association with a Markov Random Field-style prior. The identification of the relative depth ordering of the different motion layers is also determined, as an integral part of the process. An efficient implementation of this framework is presented for segmenting two motions (foreground and background) using two frames. It is then demonstrated how, by tracking the edges into further frames, the probabilities may be accumulated to provide an even more accurate and robust estimate, and segment an entire sequence. Further extensions are then presented to address the segmentation of more than two motions. Here, a hierarchical method of initializing the Expectation-Maximization algorithm is described, and it is demonstrated that the Minimum Description Length principle may be used to automatically select the best number of motion layers. The results from over 30 sequences (demonstrating both two and three motions) are presented and discussed.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—This paper presents a new Bayesian framework for motion segmentation—dividing a frame from an image sequence into layers representing different moving objects—by tracking edges between frames. Edges are found using the Canny edge detector, and the Expectation-Maximization algorithm is then used to fit motion models to these edges and also to calculate the probabilities of the edges obeying each motion model. The edges are also used to segment the image into regions of similar color. The most likely labeling for these regions is then calculated by using the edge probabilities, in association with a Markov Random Field-style prior. The identification of the relative depth ordering of the different motion layers is also determined, as an integral part of the process. An efficient implementation of this framework is presented for segmenting two motions (foreground and background) using two frames. It is then demonstrated how, by tracking the edges into further frames, the probabilities may be accumulated to provide an even more accurate and robust estimate, and segment an entire sequence. Further extensions are then presented to address the segmentation of more than two motions. Here, a hierarchical method of initializing the Expectation-Maximization algorithm is described, and it is demonstrated that the Minimum Description Length principle may be used to automatically select the best number of motion layers. The results from over 30 sequences (demonstrating both two and three motions) are presented and discussed.",
"title": "Layered Motion Segmentation and Depth Ordering by Tracking Edges",
"normalizedTitle": "Layered Motion Segmentation and Depth Ordering by Tracking Edges",
"fno": "i0479",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Video Analysis",
"Motion",
"Segmentation",
"Depth Cues"
],
"authors": [
{
"givenName": "Paul",
"surname": "Smith",
"fullName": "Paul Smith",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tom",
"surname": "Drummond",
"fullName": "Tom Drummond",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Roberto",
"surname": "Cipolla",
"fullName": "Roberto Cipolla",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2004-04-01 00:00:00",
"pubType": "trans",
"pages": "479-494",
"year": "2004",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0466",
"articleId": "13rRUxNEqR7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0495",
"articleId": "13rRUyeTVj6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqG0SSe",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "cg",
"pubType": "magazine",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1M80M7nF2Mg",
"doi": "10.1109/MCG.2023.3264244",
"abstract": "Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines (layers), and their relationships (edges) are represented by segments connecting vertices.Methods for constructing 2-layer drawings often try to minimize the number of edge crossings. We use vertex splitting to reduce the number of crossings, by replacing selected vertices on one layer by two (or more) copies and suitably distributing their incident edges among these copies. We study several optimization problems related to vertex splitting, either minimizing the number of crossings or removing all crossings with fewest splits. While we prove that some variants are <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathsf {NP}$_Z</tex-math></inline-formula>-complete, we obtain polynomial-time algorithms for others. We run our algorithms on a benchmark set of bipartite graphs representing the relationships between human anatomical structures and cell types.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines (layers), and their relationships (edges) are represented by segments connecting vertices.Methods for constructing 2-layer drawings often try to minimize the number of edge crossings. We use vertex splitting to reduce the number of crossings, by replacing selected vertices on one layer by two (or more) copies and suitably distributing their incident edges among these copies. We study several optimization problems related to vertex splitting, either minimizing the number of crossings or removing all crossings with fewest splits. While we prove that some variants are <inline-formula><tex-math notation=\"LaTeX\">$\\mathsf {NP}$</tex-math></inline-formula>-complete, we obtain polynomial-time algorithms for others. We run our algorithms on a benchmark set of bipartite graphs representing the relationships between human anatomical structures and cell types.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines (layers), and their relationships (edges) are represented by segments connecting vertices.Methods for constructing 2-layer drawings often try to minimize the number of edge crossings. We use vertex splitting to reduce the number of crossings, by replacing selected vertices on one layer by two (or more) copies and suitably distributing their incident edges among these copies. We study several optimization problems related to vertex splitting, either minimizing the number of crossings or removing all crossings with fewest splits. While we prove that some variants are --complete, we obtain polynomial-time algorithms for others. We run our algorithms on a benchmark set of bipartite graphs representing the relationships between human anatomical structures and cell types.",
"title": "Splitting Vertices in 2-Layer Graph Drawings",
"normalizedTitle": "Splitting Vertices in 2-Layer Graph Drawings",
"fno": "10093949",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Bipartite Graph",
"Graph Drawing",
"Optimization",
"Visualization",
"Layout",
"Approximation Algorithms",
"Minimization"
],
"authors": [
{
"givenName": "Reyan",
"surname": "Ahmed",
"fullName": "Reyan Ahmed",
"affiliation": "Colgate University, Hamilton, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Patrizio",
"surname": "Angelini",
"fullName": "Patrizio Angelini",
"affiliation": "John Cabot University, Rome, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael A.",
"surname": "Bekos",
"fullName": "Michael A. Bekos",
"affiliation": "University of Ioannina, Ioannina, Greece",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Giuseppe Di",
"surname": "Battista",
"fullName": "Giuseppe Di Battista",
"affiliation": "Roma Tre University, Rome, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Kaufmann",
"fullName": "Michael Kaufmann",
"affiliation": "Universität Tübingen, Tübingen, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Philipp",
"surname": "Kindermann",
"fullName": "Philipp Kindermann",
"affiliation": "Universität Trier, Trier, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stephen",
"surname": "Kobourov",
"fullName": "Stephen Kobourov",
"affiliation": "University of Arizona, Tucson, AZ, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Martin",
"surname": "Nöllenburg",
"fullName": "Martin Nöllenburg",
"affiliation": "TU Wien, Vienna, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Antonios",
"surname": "Symvonis",
"fullName": "Antonios Symvonis",
"affiliation": "NTUA, Athens, Greece",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anaïs",
"surname": "Villedieu",
"fullName": "Anaïs Villedieu",
"affiliation": "TU Wien, Vienna, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Markus",
"surname": "Wallinger",
"fullName": "Markus Wallinger",
"affiliation": "TU Wien, Vienna, Austria",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-04-01 00:00:00",
"pubType": "mags",
"pages": "1-13",
"year": "5555",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/apvis/2007/0808/0/04126227",
"title": "Straight-line grid drawings of planar graphs with linear area",
"doi": null,
"abstractUrl": "/proceedings-article/apvis/2007/04126227/12OmNBOCWfN",
"parentPublication": {
"id": "proceedings/apvis/2007/0808/0",
"title": "Asia-Pacific Symposium on Visualisation 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2010/7846/0/05571375",
"title": "Drawing Clustered Bipartite Graphs in Multi-circular Style",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2010/05571375/12OmNvEhfYC",
"parentPublication": {
"id": "proceedings/iv/2010/7846/0",
"title": "2010 14th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis/2010/4147/0/4147a341",
"title": "An Attribute Graph Grammar Enabling Narrower Drawings of Trees",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2010/4147a341/12OmNvT2pi6",
"parentPublication": {
"id": "proceedings/icis/2010/4147/0",
"title": "Computer and Information Science, ACIS International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apvis/2007/0808/0/04126225",
"title": "Using eye tracking to investigate graph layout effects",
"doi": null,
"abstractUrl": "/proceedings-article/apvis/2007/04126225/12OmNxEjXQl",
"parentPublication": {
"id": "proceedings/apvis/2007/0808/0",
"title": "Asia-Pacific Symposium on Visualisation 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cccm/2008/3290/1/3290a336",
"title": "Research and Design of Drawings Retrieval System Based on Spatial Relationships and Shape",
"doi": null,
"abstractUrl": "/proceedings-article/cccm/2008/3290a336/12OmNxFaLpD",
"parentPublication": {
"id": "cccm/2008/3290/1",
"title": "Computing, Communication, Control and Management, ISECS International Colloquium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2009/3725/0/3725a341",
"title": "Detecting Printed and Handwritten Partial Copies of Line Drawings Embedded in Complex Backgrounds",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2009/3725a341/12OmNxUMHoK",
"parentPublication": {
"id": "proceedings/icdar/2009/3725/0",
"title": "2009 10th International Conference on Document Analysis and Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/06/07422136",
"title": "Minimizing the Number of Edges via Edge Concentration in Dense Layered Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2016/06/07422136/13rRUyv53Fu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/02/08269823",
"title": "A Coloring Algorithm for Disambiguating Graph and Map Drawings",
"doi": null,
"abstractUrl": "/journal/tg/2019/02/08269823/17D45Xtvpay",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/10/08423100",
"title": "The Effect of Edge Bundling and Seriation on Sensemaking of Biclusters in Bipartite Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2019/10/08423100/1d3e5UbWqis",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933546",
"title": "Interactive Bicluster Aggregation in Bipartite Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933546/1fTgJv5NwT6",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10091124",
"articleId": "1M2ILm8imYM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10107759",
"articleId": "1MDGmTM8oOA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1M9lOp1tg76",
"name": "mcg555501-010093949s1-supp1-3264244.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/mcg555501-010093949s1-supp1-3264244.pdf",
"extension": "pdf",
"size": "5.56 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBpEeNK",
"title": "Aug.",
"year": "2016",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "22",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxcsYLU",
"doi": "10.1109/TVCG.2015.2480059",
"abstract": "In this paper, we address the problem of constraint detection for layout regularization. The layout we consider is a set of two-dimensional elements where each element is represented by its bounding box. Layout regularization is important in digitizing plans or images, such as floor plans and facade images, and in the improvement of user-created contents, such as architectural drawings and slide layouts. To regularize a layout, we aim to improve the input by detecting and subsequently enforcing alignment, size, and distance constraints between layout elements. Similar to previous work, we formulate layout regularization as a quadratic programming problem. In addition, we propose a novel optimization algorithm that automatically detects constraints. We evaluate the proposed framework using a variety of input layouts from different applications. Our results demonstrate that our method has superior performance to the state of the art.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we address the problem of constraint detection for layout regularization. The layout we consider is a set of two-dimensional elements where each element is represented by its bounding box. Layout regularization is important in digitizing plans or images, such as floor plans and facade images, and in the improvement of user-created contents, such as architectural drawings and slide layouts. To regularize a layout, we aim to improve the input by detecting and subsequently enforcing alignment, size, and distance constraints between layout elements. Similar to previous work, we formulate layout regularization as a quadratic programming problem. In addition, we propose a novel optimization algorithm that automatically detects constraints. We evaluate the proposed framework using a variety of input layouts from different applications. Our results demonstrate that our method has superior performance to the state of the art.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we address the problem of constraint detection for layout regularization. The layout we consider is a set of two-dimensional elements where each element is represented by its bounding box. Layout regularization is important in digitizing plans or images, such as floor plans and facade images, and in the improvement of user-created contents, such as architectural drawings and slide layouts. To regularize a layout, we aim to improve the input by detecting and subsequently enforcing alignment, size, and distance constraints between layout elements. Similar to previous work, we formulate layout regularization as a quadratic programming problem. In addition, we propose a novel optimization algorithm that automatically detects constraints. We evaluate the proposed framework using a variety of input layouts from different applications. Our results demonstrate that our method has superior performance to the state of the art.",
"title": "Automatic Constraint Detection for 2D Layout Regularization",
"normalizedTitle": "Automatic Constraint Detection for 2D Layout Regularization",
"fno": "07272131",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Layout",
"Shape",
"Optimization",
"Three Dimensional Displays",
"Electronic Mail",
"Complexity Theory",
"Standards",
"Linear Integer Programming",
"Layout Regularization",
"Constraint Detection",
"Constraint Analysis"
],
"authors": [
{
"givenName": "Haiyong",
"surname": "Jiang",
"fullName": "Haiyong Jiang",
"affiliation": "National Laboratory of Pattern Recognition (NLPR), Institute of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Liangliang",
"surname": "Nan",
"fullName": "Liangliang Nan",
"affiliation": "KAUST, Thuwal, Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dong-Ming",
"surname": "Yan",
"fullName": "Dong-Ming Yan",
"affiliation": "KAUST, Thuwal, Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Weiming",
"surname": "Dong",
"fullName": "Weiming Dong",
"affiliation": "National Laboratory of Pattern Recognition (NLPR), Institute of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaopeng",
"surname": "Zhang",
"fullName": "Xiaopeng Zhang",
"affiliation": "National Laboratory of Pattern Recognition (NLPR), Institute of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter",
"surname": "Wonka",
"fullName": "Peter Wonka",
"affiliation": "KAUST, Thuwal, Saudi Arabia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2016-08-01 00:00:00",
"pubType": "trans",
"pages": "1933-1944",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/caia/1995/7070/0/70700038",
"title": "Constraint-based approach for automatic spatial layout planning",
"doi": null,
"abstractUrl": "/proceedings-article/caia/1995/70700038/12OmNApu5KL",
"parentPublication": {
"id": "proceedings/caia/1995/7070/0",
"title": "Artificial Intelligence for Applications, Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2015/8020/0/07450427",
"title": "Facade Layout Symmetrization",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2015/07450427/12OmNviHKiH",
"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/vl/1993/3970/0/00269619",
"title": "Constraint-driven diagram layout",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1993/00269619/12OmNwvVrCN",
"parentPublication": {
"id": "proceedings/vl/1993/3970/0",
"title": "Proceedings 1993 IEEE Symposium on Visual Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2013/4797/0/06596149",
"title": "A generative layout approach for rooted tree drawings",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2013/06596149/12OmNxXCGLc",
"parentPublication": {
"id": "proceedings/pacificvis/2013/4797/0",
"title": "2013 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlhcc/2011/1246/0/06070379",
"title": "Automatic diagram layout support for the Marama meta-toolset",
"doi": null,
"abstractUrl": "/proceedings-article/vlhcc/2011/06070379/12OmNy4r3Sw",
"parentPublication": {
"id": "proceedings/vlhcc/2011/1246/0",
"title": "2011 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC 2011)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122586",
"title": "Automatic Layout of Structured Hierarchical Reports",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122586/13rRUwh80Hb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlhcc/2018/4235/0/08506571",
"title": "Automatic Layout and Label Management for Compact UML Sequence Diagrams",
"doi": null,
"abstractUrl": "/proceedings-article/vlhcc/2018/08506571/17D45WUj90b",
"parentPublication": {
"id": "proceedings/vlhcc/2018/4235/0",
"title": "2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200g670",
"title": "Generative Layout Modeling using Constraint Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200g670/1BmIILGrL1u",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/10/09106863",
"title": "Attribute-Conditioned Layout GAN for Automatic Graphic Design",
"doi": null,
"abstractUrl": "/journal/tg/2021/10/09106863/1kkFGfMRO36",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09477202",
"title": "fCoSE: A Fast Compound Graph Layout Algorithm with Constraint Support",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09477202/1v2MaDZG6fC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07501981",
"articleId": "13rRUyYjK5k",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07272134",
"articleId": "13rRUxYrbUL",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFwl",
"name": "ttg201608-07272131s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201608-07272131s1.zip",
"extension": "zip",
"size": "23.7 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": "1xibXgJW32U",
"doi": "10.1109/TVCG.2021.3114795",
"abstract": "Edge bundling techniques cluster edges with similar attributes (i.e. similarity in direction and proximity) together to reduce the visual clutter. All edge bundling techniques to date implicitly or explicitly cluster groups of individual edges, or parts of them, together based on these attributes. These clusters can result in ambiguous connections that do not exist in the data. Confluent drawings of networks do not have these ambiguities, but require the layout to be computed as part of the bundling process. We devise a new bundling method, Edge-Path bundling, to simplify edge clutter while greatly reducing ambiguities compared to previous bundling techniques. Edge-Path bundling takes a layout as input and clusters each edge along a weighted, shortest path to limit its deviation from a straight line. Edge-Path bundling does not incur independent edge ambiguities typically seen in all edge bundling methods, and the level of bundling can be tuned through shortest path distances, Euclidean distances, and combinations of the two. Also, directed edge bundling naturally emerges from the model. Through metric evaluations, we demonstrate the advantages of Edge-Path bundling over other techniques.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Edge bundling techniques cluster edges with similar attributes (i.e. similarity in direction and proximity) together to reduce the visual clutter. All edge bundling techniques to date implicitly or explicitly cluster groups of individual edges, or parts of them, together based on these attributes. These clusters can result in ambiguous connections that do not exist in the data. Confluent drawings of networks do not have these ambiguities, but require the layout to be computed as part of the bundling process. We devise a new bundling method, Edge-Path bundling, to simplify edge clutter while greatly reducing ambiguities compared to previous bundling techniques. Edge-Path bundling takes a layout as input and clusters each edge along a weighted, shortest path to limit its deviation from a straight line. Edge-Path bundling does not incur independent edge ambiguities typically seen in all edge bundling methods, and the level of bundling can be tuned through shortest path distances, Euclidean distances, and combinations of the two. Also, directed edge bundling naturally emerges from the model. Through metric evaluations, we demonstrate the advantages of Edge-Path bundling over other techniques.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Edge bundling techniques cluster edges with similar attributes (i.e. similarity in direction and proximity) together to reduce the visual clutter. All edge bundling techniques to date implicitly or explicitly cluster groups of individual edges, or parts of them, together based on these attributes. These clusters can result in ambiguous connections that do not exist in the data. Confluent drawings of networks do not have these ambiguities, but require the layout to be computed as part of the bundling process. We devise a new bundling method, Edge-Path bundling, to simplify edge clutter while greatly reducing ambiguities compared to previous bundling techniques. Edge-Path bundling takes a layout as input and clusters each edge along a weighted, shortest path to limit its deviation from a straight line. Edge-Path bundling does not incur independent edge ambiguities typically seen in all edge bundling methods, and the level of bundling can be tuned through shortest path distances, Euclidean distances, and combinations of the two. Also, directed edge bundling naturally emerges from the model. Through metric evaluations, we demonstrate the advantages of Edge-Path bundling over other techniques.",
"title": "Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach",
"normalizedTitle": "Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach",
"fno": "09552919",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Geometry",
"Data Visualisation",
"Edge Detection",
"Graph Theory",
"Pattern Clustering",
"Edge Path Bundling",
"Independent Edge Ambiguities",
"Edge Bundling Methods",
"Directed Edge Bundling",
"Ambiguous Edge Bundling Approach",
"Edge Bundling Techniques",
"Edge Clutter",
"Previous Bundling Techniques",
"Layout",
"Image Edge Detection",
"Clutter",
"Windings",
"Roads",
"Visualization",
"Lakes",
"Graph Network And Tree Data",
"Algorithms",
"Edge Bundling"
],
"authors": [
{
"givenName": "Markus",
"surname": "Wallinger",
"fullName": "Markus Wallinger",
"affiliation": "TU Wien, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Archambault",
"fullName": "Daniel Archambault",
"affiliation": "Swansea University, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Auber",
"fullName": "David Auber",
"affiliation": "University of Bordeaux, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Martin",
"surname": "Nöllenburg",
"fullName": "Martin Nöllenburg",
"affiliation": "TU Wien, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jaakko",
"surname": "Peltonen",
"fullName": "Jaakko Peltonen",
"affiliation": "Tampere University, Finland",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "313-323",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2015/6879/0/07156354",
"title": "Attribute-driven edge bundling for general graphs with applications in trail analysis",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156354/12OmNCaLEnG",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2016/1451/0/07465267",
"title": "Multilayer graph edge bundling",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2016/07465267/12OmNCbCrKh",
"parentPublication": {
"id": "proceedings/pacificvis/2016/1451/0",
"title": "2016 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2010/7846/0/05571244",
"title": "3D Edge Bundling for Geographical Data Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2010/05571244/12OmNqzu6LL",
"parentPublication": {
"id": "proceedings/iv/2010/7846/0",
"title": "2010 14th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a057",
"title": "An Edge-Bundling Layout for Interactive Parallel Coordinates",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a057/12OmNwEJ0Cx",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2011/935/0/05742389",
"title": "Multilevel agglomerative edge bundling for visualizing large graphs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742389/12OmNxj233Y",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2016/1192/0/1192a466",
"title": "Research on Network Simplification by Edge Bundling",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2016/1192a466/12OmNyQpgKZ",
"parentPublication": {
"id": "proceedings/dsc/2016/1192/0",
"title": "2016 IEEE First International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2013/5049/0/5049a028",
"title": "Edge Bundling by Rapidly-Exploring Random Trees",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2013/5049a028/12OmNz5s0F9",
"parentPublication": {
"id": "proceedings/iv/2013/5049/0",
"title": "2013 17th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2017/5738/0/08031594",
"title": "FFTEB: Edge bundling of huge graphs by the Fast Fourier Transform",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031594/12OmNzuZUEs",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539373",
"title": "Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539373/13rRUwcS1CZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122354",
"title": "Divided Edge Bundling for Directional Network Data",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122354/13rRUzpzeB1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552880",
"articleId": "1xic21fTTva",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09556579",
"articleId": "1xlw0LJ4OTm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zBaquRkllC",
"name": "ttg202201-09552919s1-tvcg-3114795-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09552919s1-tvcg-3114795-mm.zip",
"extension": "zip",
"size": "367 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUxZ0o1y",
"doi": "10.1109/TVCG.2012.243",
"abstract": "Room air flow and air exchange are important aspects for the design of energy-efficient buildings. As a result, simulations are increasingly used prior to construction to achieve an energy-efficient design. We present a visual analysis of air flow generated at building entrances, which uses a combination of revolving doors and air curtains. The resulting flow pattern is challenging because of two interacting flow patterns: On the one hand, the revolving door acts as a pump, on the other hand, the air curtain creates a layer of uniformly moving warm air between the interior of the building and the revolving door. Lagrangian coherent structures (LCS), which by definition are flow barriers, are the method of choice for visualizing the separation and recirculation behavior of warm and cold air flow. The extraction of LCS is based on the finite-time Lyapunov exponent (FTLE) and makes use of a ridge definition which is consistent with the concept of weak LCS. Both FTLE computation and ridge extraction are done in a robust and efficient way by making use of the fast Fourier transform for computing scale-space derivatives.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Room air flow and air exchange are important aspects for the design of energy-efficient buildings. As a result, simulations are increasingly used prior to construction to achieve an energy-efficient design. We present a visual analysis of air flow generated at building entrances, which uses a combination of revolving doors and air curtains. The resulting flow pattern is challenging because of two interacting flow patterns: On the one hand, the revolving door acts as a pump, on the other hand, the air curtain creates a layer of uniformly moving warm air between the interior of the building and the revolving door. Lagrangian coherent structures (LCS), which by definition are flow barriers, are the method of choice for visualizing the separation and recirculation behavior of warm and cold air flow. The extraction of LCS is based on the finite-time Lyapunov exponent (FTLE) and makes use of a ridge definition which is consistent with the concept of weak LCS. Both FTLE computation and ridge extraction are done in a robust and efficient way by making use of the fast Fourier transform for computing scale-space derivatives.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Room air flow and air exchange are important aspects for the design of energy-efficient buildings. As a result, simulations are increasingly used prior to construction to achieve an energy-efficient design. We present a visual analysis of air flow generated at building entrances, which uses a combination of revolving doors and air curtains. The resulting flow pattern is challenging because of two interacting flow patterns: On the one hand, the revolving door acts as a pump, on the other hand, the air curtain creates a layer of uniformly moving warm air between the interior of the building and the revolving door. Lagrangian coherent structures (LCS), which by definition are flow barriers, are the method of choice for visualizing the separation and recirculation behavior of warm and cold air flow. The extraction of LCS is based on the finite-time Lyapunov exponent (FTLE) and makes use of a ridge definition which is consistent with the concept of weak LCS. Both FTLE computation and ridge extraction are done in a robust and efficient way by making use of the fast Fourier transform for computing scale-space derivatives.",
"title": "Lagrangian Coherent Structures for Design Analysis of Revolving Doors",
"normalizedTitle": "Lagrangian Coherent Structures for Design Analysis of Revolving Doors",
"fno": "ttg2012122159",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Structural Engineering Computing",
"Building Management Systems",
"Computational Fluid Dynamics",
"Data Visualisation",
"Design Engineering",
"Doors",
"Fast Fourier Transforms",
"HVAC",
"Computational Fluid Dynamics",
"Lagrangian Coherent Structures",
"Design Analysis",
"Revolving Doors",
"Room Air Flow",
"Air Exchange",
"Energy Efficient Buildings",
"Energy Efficient Design",
"Air Flow Visual Analysis",
"Building Entrances",
"Air Curtains",
"Building Interior",
"LCS",
"Flow Barriers",
"Recirculation Behavior",
"Finite Time Lyapunov Exponent",
"FTLE Computation",
"Ridge Definition",
"Fast Fourier Transform",
"Scale Space Derivatives",
"Flow Control",
"Atmospheric Modeling",
"Tensile Stress",
"Lyapunov Methods",
"Energy Efficiency",
"Meteorology",
"Heating",
"Vector Field Data",
"Visualization In Physical Sciences And Engineering",
"Topology Based Techniques"
],
"authors": [
{
"givenName": "B.",
"surname": "Schindler",
"fullName": "B. Schindler",
"affiliation": "ETH Zurich, Zurich, Switzerland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "R.",
"surname": "Fuchs",
"fullName": "R. Fuchs",
"affiliation": "ETH Zurich, Zurich, Switzerland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "S.",
"surname": "Barp",
"fullName": "S. Barp",
"affiliation": "Air Flow Consulting AG Zurich, Zurich, Switzerland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "J.",
"surname": "Waser",
"fullName": "J. Waser",
"affiliation": "VRVis Vienna, Vienna, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "A.",
"surname": "Pobitzer",
"fullName": "A. Pobitzer",
"affiliation": "Univ. of Bergen, Bergen, Norway",
"__typename": "ArticleAuthorType"
},
{
"givenName": "R.",
"surname": "Carnecky",
"fullName": "R. Carnecky",
"affiliation": "ETH Zurich, Zurich, Switzerland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "K.",
"surname": "Matkovic",
"fullName": "K. Matkovic",
"affiliation": "VRVis Vienna, Vienna, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "R.",
"surname": "Peikert",
"fullName": "R. Peikert",
"affiliation": "ETH Zurich, Zurich, Switzerland",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2159-2168",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/avss/2012/4797/0/4797a398",
"title": "Detecting People Carrying Objects Utilizing Lagrangian Dynamics",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2012/4797a398/12OmNB1eJzR",
"parentPublication": {
"id": "proceedings/avss/2012/4797/0",
"title": "2012 IEEE Ninth International Conference on Advanced Video and Signal-Based Surveillance",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsssm/2005/8971/1/01499474",
"title": "A Lagrangian relaxation approach for solving short-term air traffic flow management model",
"doi": null,
"abstractUrl": "/proceedings-article/icsssm/2005/01499474/12OmNBZpHaS",
"parentPublication": {
"id": "proceedings/icsssm/2005/8971/1",
"title": "2005 International Conference on Services Systems and Services Management",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2012/4608/0/4608b003",
"title": "Application on Energy Saving Control Technology of Building Air Conditioning",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2012/4608b003/12OmNC2xhEC",
"parentPublication": {
"id": "proceedings/isdea/2012/4608/0",
"title": "2012 Second International Conference on Intelligent System Design and Engineering Application",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2007/1179/0/04270002",
"title": "A Lagrangian Particle Dynamics Approach for Crowd Flow Segmentation and Stability Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2007/04270002/12OmNroijnT",
"parentPublication": {
"id": "proceedings/cvpr/2007/1179/0",
"title": "2007 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccnt/2010/4042/0/4042a426",
"title": "Dynamic Air Route Management Based on Flight Demand",
"doi": null,
"abstractUrl": "/proceedings-article/iccnt/2010/4042a426/12OmNscfI1v",
"parentPublication": {
"id": "proceedings/iccnt/2010/4042/0",
"title": "Computer and Network Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cdciem/2011/4350/0/4350a782",
"title": "Experimental Study on Far Infrared and Cross Flow Combination Heating System for Vegetables Drying",
"doi": null,
"abstractUrl": "/proceedings-article/cdciem/2011/4350a782/12OmNyQpgXW",
"parentPublication": {
"id": "proceedings/cdciem/2011/4350/0",
"title": "Computer Distributed Control and Intelligent Environmental Monitoring, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2010/3962/2/3962c915",
"title": "Prediction and Control of Air Supply Flow in PEMFC",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2010/3962c915/12OmNywxlT7",
"parentPublication": {
"id": "proceedings/icmtma/2010/3962/2",
"title": "2010 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1464",
"title": "Efficient Computation and Visualization of Coherent Structures in Fluid Flow Applications",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1464/13rRUwInv4h",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/06/07422124",
"title": "Finite-Time Lyapunov Exponents and Lagrangian Coherent Structures in Uncertain Unsteady Flows",
"doi": null,
"abstractUrl": "/journal/tg/2016/06/07422124/13rRUxbTMyV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/06/05753896",
"title": "Analysis of Time-Dependent Flow-Sensitive PC-MRI Data",
"doi": null,
"abstractUrl": "/journal/tg/2012/06/05753896/13rRUxjyX3Y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012122149",
"articleId": "13rRUwd9CG1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122169",
"articleId": "13rRUxly8SU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRUt",
"name": "ttg2012122159s1.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012122159s1.mov",
"extension": "mov",
"size": "8.98 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNviZlCS",
"title": "Aug.",
"year": "2015",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "21",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwhHcJl",
"doi": "10.1109/TVCG.2015.2440250",
"abstract": "Vector field simplification aims to reduce the complexity of the flow by removing features in order of their relevance and importance, to reveal prominent behavior and obtain a compact representation for interpretation. Most existing simplification techniques based on the topological skeleton successively remove pairs of critical points connected by separatrices, using distance or area-based relevance measures. These methods rely on the stable extraction of the topological skeleton, which can be difficult due to instability in numerical integration, especially when processing highly rotational flows. In this paper, we propose a novel simplification scheme derived from the recently introduced topological notion of robustness which enables the pruning of sets of critical points according to a quantitative measure of their stability, that is, the minimum amount of vector field perturbation required to remove them. This leads to a hierarchical simplification scheme that encodes flow magnitude in its perturbation metric. Our novel simplification algorithm is based on degree theory and has minimal boundary restrictions. Finally, we provide an implementation under the piecewise-linear setting and apply it to both synthetic and real-world datasets. We show local and complete hierarchical simplifications for steady as well as unsteady vector fields.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Vector field simplification aims to reduce the complexity of the flow by removing features in order of their relevance and importance, to reveal prominent behavior and obtain a compact representation for interpretation. Most existing simplification techniques based on the topological skeleton successively remove pairs of critical points connected by separatrices, using distance or area-based relevance measures. These methods rely on the stable extraction of the topological skeleton, which can be difficult due to instability in numerical integration, especially when processing highly rotational flows. In this paper, we propose a novel simplification scheme derived from the recently introduced topological notion of robustness which enables the pruning of sets of critical points according to a quantitative measure of their stability, that is, the minimum amount of vector field perturbation required to remove them. This leads to a hierarchical simplification scheme that encodes flow magnitude in its perturbation metric. Our novel simplification algorithm is based on degree theory and has minimal boundary restrictions. Finally, we provide an implementation under the piecewise-linear setting and apply it to both synthetic and real-world datasets. We show local and complete hierarchical simplifications for steady as well as unsteady vector fields.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Vector field simplification aims to reduce the complexity of the flow by removing features in order of their relevance and importance, to reveal prominent behavior and obtain a compact representation for interpretation. Most existing simplification techniques based on the topological skeleton successively remove pairs of critical points connected by separatrices, using distance or area-based relevance measures. These methods rely on the stable extraction of the topological skeleton, which can be difficult due to instability in numerical integration, especially when processing highly rotational flows. In this paper, we propose a novel simplification scheme derived from the recently introduced topological notion of robustness which enables the pruning of sets of critical points according to a quantitative measure of their stability, that is, the minimum amount of vector field perturbation required to remove them. This leads to a hierarchical simplification scheme that encodes flow magnitude in its perturbation metric. Our novel simplification algorithm is based on degree theory and has minimal boundary restrictions. Finally, we provide an implementation under the piecewise-linear setting and apply it to both synthetic and real-world datasets. We show local and complete hierarchical simplifications for steady as well as unsteady vector fields.",
"title": "Robustness-Based Simplification of 2D Steady and Unsteady Vector Fields",
"normalizedTitle": "Robustness-Based Simplification of 2D Steady and Unsteady Vector Fields",
"fno": "07117431",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Robustness",
"Smoothing Methods",
"Skeleton",
"Indexes",
"Laplace Equations",
"Vegetation",
"Complexity Theory",
"Computational Topology",
"Flow Visualization",
"Vector Field Simplification",
"Robustness"
],
"authors": [
{
"givenName": "Primoz",
"surname": "Skraba",
"fullName": "Primoz Skraba",
"affiliation": ", Jozef Stefan Institute, Slovenia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bei",
"surname": "Wang",
"fullName": "Bei Wang",
"affiliation": "Scientific Computing and Imaging Institute, University of Utah",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guoning",
"surname": "Chen",
"fullName": "Guoning Chen",
"affiliation": ", University of Houston",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Paul",
"surname": "Rosen",
"fullName": "Paul Rosen",
"affiliation": "Scientific Computing and Imaging Institute, University of Utah",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2015-08-01 00:00:00",
"pubType": "trans",
"pages": "930-944",
"year": "2015",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2005/2766/0/27660068",
"title": "Topology-based Simplification for Feature Extraction from 3D Scalar Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660068/12OmNArKShW",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2011/4484/0/4484a070",
"title": "Fast Simplification of Scanned 3D Human Body for Animation",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2011/4484a070/12OmNBDQbni",
"parentPublication": {
"id": "proceedings/cgiv/2011/4484/0",
"title": "2011 Eighth International Conference Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200tricoche",
"title": "Continuous Topology Simplification of Planar Vector Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200tricoche/12OmNwMob5u",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__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/cgi/2004/2171/0/21710174",
"title": "Simplification of Vector Fields over Tetrahedral Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2004/21710174/12OmNwtWfFj",
"parentPublication": {
"id": "proceedings/cgi/2004/2171/0",
"title": "Proceedings. Computer Graphics International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660071",
"title": "Extracting Higher Order Critical Points and Topological Simplification of 3D Vector Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660071/12OmNyyeWvl",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2003/2028/0/20280419",
"title": "Combining Topological Simplification and Topology Preserving Compression for 2D Vector Fields",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2003/20280419/12OmNzVXNX7",
"parentPublication": {
"id": "proceedings/pg/2003/2028/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532839",
"title": "Topology-based simplification for feature extraction from 3D scalar fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532839/12OmNzkMlOD",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__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": "trans/tg/2012/12/ttg2012122005",
"title": "Generalized Topological Simplification of Scalar Fields on Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122005/13rRUx0xPmY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06951493",
"articleId": "13rRUwI5U2J",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07050311",
"articleId": "13rRUxBJhmU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFrM",
"name": "ttg201508-07117431s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201508-07117431s1.zip",
"extension": "zip",
"size": "14 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNySXEWS",
"title": "July/August",
"year": "2007",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "July/August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyfbwqz",
"doi": "10.1109/TVCG.2007.1021",
"abstract": "Design and control of vector fields is critical for many visualization and graphics tasks such as vector field visualization, fluid simulation, and texture synthesis. The fundamental qualitative structures associated with vector fields are fixed points, periodic orbits, and separatrices. In this paper, we provide a new technique that allows for the systematic creation and cancellation of fixed points and periodic orbits. This technique enables vector field design and editing on the plane and surfaces with desired qualitative properties. The technique is based on Conley theory, which provides a unified framework that supports the cancellation of fixed points and periodic orbits. We also introduce a novel periodic orbit extraction and visualization algorithm that detects, for the first time, periodic orbits on surfaces. Furthermore, we describe the application of our periodic orbit detection and vector field simplification algorithms to engine simulation data demonstrating the utility of the approach. We apply our design system to vector field visualization by creating data sets containing periodic orbits. This helps us understand the effectiveness of existing visualization techniques. Finally, we propose a new streamline-based technique that allows vector field topology to be easily identified.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Design and control of vector fields is critical for many visualization and graphics tasks such as vector field visualization, fluid simulation, and texture synthesis. The fundamental qualitative structures associated with vector fields are fixed points, periodic orbits, and separatrices. In this paper, we provide a new technique that allows for the systematic creation and cancellation of fixed points and periodic orbits. This technique enables vector field design and editing on the plane and surfaces with desired qualitative properties. The technique is based on Conley theory, which provides a unified framework that supports the cancellation of fixed points and periodic orbits. We also introduce a novel periodic orbit extraction and visualization algorithm that detects, for the first time, periodic orbits on surfaces. Furthermore, we describe the application of our periodic orbit detection and vector field simplification algorithms to engine simulation data demonstrating the utility of the approach. We apply our design system to vector field visualization by creating data sets containing periodic orbits. This helps us understand the effectiveness of existing visualization techniques. Finally, we propose a new streamline-based technique that allows vector field topology to be easily identified.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Design and control of vector fields is critical for many visualization and graphics tasks such as vector field visualization, fluid simulation, and texture synthesis. The fundamental qualitative structures associated with vector fields are fixed points, periodic orbits, and separatrices. In this paper, we provide a new technique that allows for the systematic creation and cancellation of fixed points and periodic orbits. This technique enables vector field design and editing on the plane and surfaces with desired qualitative properties. The technique is based on Conley theory, which provides a unified framework that supports the cancellation of fixed points and periodic orbits. We also introduce a novel periodic orbit extraction and visualization algorithm that detects, for the first time, periodic orbits on surfaces. Furthermore, we describe the application of our periodic orbit detection and vector field simplification algorithms to engine simulation data demonstrating the utility of the approach. We apply our design system to vector field visualization by creating data sets containing periodic orbits. This helps us understand the effectiveness of existing visualization techniques. Finally, we propose a new streamline-based technique that allows vector field topology to be easily identified.",
"title": "Vector Field Editing and Periodic Orbit Extraction Using Morse Decomposition",
"normalizedTitle": "Vector Field Editing and Periodic Orbit Extraction Using Morse Decomposition",
"fno": "v0769",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Geometry",
"Data Visualisation",
"Flow Visualisation",
"Topology",
"Vector Field Editing",
"Periodic Orbit Extraction",
"Morse Decomposition",
"Vector Field Visualization",
"Fluid Simulation",
"Texture Synthesis",
"Vector Field Design",
"Vector Field Topology",
"Data Visualization",
"Topology",
"Periodic Structures",
"Computer Society",
"Data Mining",
"Engines",
"Fluid Dynamics",
"Computer Graphics",
"Computational Modeling",
"Computer Simulation",
"Vector Field Design",
"Vector Field Visualization",
"Vector Field Topology",
"Vector Field Simplification",
"Morse Decomposition",
"Conley Index",
"Periodic Orbit Detection",
"Connection Graphs"
],
"authors": [
{
"givenName": null,
"surname": "Guoning Chen",
"fullName": "Guoning Chen",
"affiliation": "Oregon State Univ., Corvallis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Konstantin",
"surname": "Mischaikow",
"fullName": "Konstantin Mischaikow",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert S.",
"surname": "Laramee",
"fullName": "Robert S. Laramee",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pawel",
"surname": "Pilarczyk",
"fullName": "Pawel Pilarczyk",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eugene",
"surname": "Zhang",
"fullName": "Eugene Zhang",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2007-07-01 00:00:00",
"pubType": "trans",
"pages": "769-785",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/gcis/2010/4304/2/4304b325",
"title": "Extending Support Vector Machines to Discover Temporal Periodic Patterns",
"doi": null,
"abstractUrl": "/proceedings-article/gcis/2010/4304b325/12OmNBPtJHn",
"parentPublication": {
"id": "proceedings/gcis/2010/4304/2",
"title": "2010 Second WRI Global Congress on Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1992/2897/0/00235174",
"title": "Case study: visualizing classical problems in CFD",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1992/00235174/12OmNyoiZ9B",
"parentPublication": {
"id": "proceedings/visual/1992/2897/0",
"title": "Proceedings Visualization '92",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ici/2011/4618/0/4618a191",
"title": "Constructing Continuous-Time Chaos-Generating Templates with Desirably Configured Periodic Orbits",
"doi": null,
"abstractUrl": "/proceedings-article/ici/2011/4618a191/12OmNzYeAZn",
"parentPublication": {
"id": "proceedings/ici/2011/4618/0",
"title": "Informatics and Computational Intelligence, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1971/08/01671967",
"title": "On the Decomposition of Periodic Representations of Sequential Machines",
"doi": null,
"abstractUrl": "/journal/tc/1971/08/01671967/13rRUEgarrF",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1979/06/01702682",
"title": "Analysis of Closed Queuing Networks with Periodic Servers",
"doi": null,
"abstractUrl": "/journal/ts/1979/06/01702682/13rRUILLkFc",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1996/02/v0120",
"title": "Interactive time-dependent particle tracing using tetrahedral decomposition",
"doi": null,
"abstractUrl": "/journal/tg/1996/02/v0120/13rRUwI5TXo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2012/06/ttd2012061090",
"title": "Energy-Efficient Capture of Stochastic Events under Periodic Network Coverage and Coordinated Sleep",
"doi": null,
"abstractUrl": "/journal/td/2012/06/ttd2012061090/13rRUwkfAYT",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/06/v1535",
"title": "High-Quality and Interactive Animations of 3D Time-Varying Vector Fields",
"doi": null,
"abstractUrl": "/journal/tg/2006/06/v1535/13rRUxNW1Zb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122763",
"title": "Visualization of Morse Connection Graphs for Topologically Rich 2D Vector Fields",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122763/13rRUxNW1Zp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/06/ttg2012060938",
"title": "Robust Morse Decompositions of Piecewise Constant Vector Fields",
"doi": null,
"abstractUrl": "/journal/tg/2012/06/ttg2012060938/13rRUxlgxOj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0758",
"articleId": "13rRUxOdD8a",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0786",
"articleId": "13rRUIJuxvd",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1A8bZc3URDa",
"title": "Feb.",
"year": "2022",
"issueNum": "01",
"idPrefix": "bd",
"pubType": "journal",
"volume": "8",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0xPyv",
"doi": "10.1109/TBDATA.2017.2711039",
"abstract": "As a powerful architecture for large-scale computation, cloud computing has revolutionized the way that computing infrastructure is abstracted and utilized. Coupled with the challenges caused by Big Data, the rocketing development of cloud computing boosts the complexity of system management and maintenance, resulting in weakened trustworthiness of cloud services. To cope with this problem, a compelling method, i.e., Support Vector Data Description (SVDD), is investigated in this paper for detecting anomalous performance metrics of cloud services. Although competent in general anomaly detection, SVDD suffers from unsatisfactory false alarm rate and computational complexity in time series anomaly detection, which considerably hinders its practical applications. Therefore, this paper proposes a relaxed form of linear programming SVDD (RLPSVDD) and presents important insights into parameter selection for practical time series anomaly detection in order to monitor the operations of cloud services. Experiments on the Iris dataset and the Yahoo benchmark datasets validate the effectiveness of our approaches. Furthermore, the comparison of RLPSVDD and the methods obtained from Twitter, Numenta, Etsy and Yahoo, shows the overall preference for RLPSVDD in time series anomaly detection.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As a powerful architecture for large-scale computation, cloud computing has revolutionized the way that computing infrastructure is abstracted and utilized. Coupled with the challenges caused by Big Data, the rocketing development of cloud computing boosts the complexity of system management and maintenance, resulting in weakened trustworthiness of cloud services. To cope with this problem, a compelling method, i.e., Support Vector Data Description (SVDD), is investigated in this paper for detecting anomalous performance metrics of cloud services. Although competent in general anomaly detection, SVDD suffers from unsatisfactory false alarm rate and computational complexity in time series anomaly detection, which considerably hinders its practical applications. Therefore, this paper proposes a relaxed form of linear programming SVDD (RLPSVDD) and presents important insights into parameter selection for practical time series anomaly detection in order to monitor the operations of cloud services. Experiments on the Iris dataset and the Yahoo benchmark datasets validate the effectiveness of our approaches. Furthermore, the comparison of RLPSVDD and the methods obtained from Twitter, Numenta, Etsy and Yahoo, shows the overall preference for RLPSVDD in time series anomaly detection.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As a powerful architecture for large-scale computation, cloud computing has revolutionized the way that computing infrastructure is abstracted and utilized. Coupled with the challenges caused by Big Data, the rocketing development of cloud computing boosts the complexity of system management and maintenance, resulting in weakened trustworthiness of cloud services. To cope with this problem, a compelling method, i.e., Support Vector Data Description (SVDD), is investigated in this paper for detecting anomalous performance metrics of cloud services. Although competent in general anomaly detection, SVDD suffers from unsatisfactory false alarm rate and computational complexity in time series anomaly detection, which considerably hinders its practical applications. Therefore, this paper proposes a relaxed form of linear programming SVDD (RLPSVDD) and presents important insights into parameter selection for practical time series anomaly detection in order to monitor the operations of cloud services. Experiments on the Iris dataset and the Yahoo benchmark datasets validate the effectiveness of our approaches. Furthermore, the comparison of RLPSVDD and the methods obtained from Twitter, Numenta, Etsy and Yahoo, shows the overall preference for RLPSVDD in time series anomaly detection.",
"title": "Time Series Anomaly Detection for Trustworthy Services in Cloud Computing Systems",
"normalizedTitle": "Time Series Anomaly Detection for Trustworthy Services in Cloud Computing Systems",
"fno": "07937930",
"hasPdf": true,
"idPrefix": "bd",
"keywords": [
"Cloud Computing",
"Data Mining",
"Learning Artificial Intelligence",
"Linear Programming",
"Pattern Recognition",
"Security Of Data",
"Social Networking Online",
"Support Vector Machines",
"Time Series",
"Linear Programming SVDD",
"Practical Time Series",
"Cloud Services",
"Time Series Anomaly Detection",
"Trustworthy Services",
"Cloud Computing Systems",
"Large Scale Computation",
"Big Data",
"System Management",
"Maintenance",
"Weakened Trustworthiness",
"Support Vector Data Description",
"General Anomaly Detection",
"Computational Complexity",
"Time Series Analysis",
"Cloud Computing",
"Big Data",
"Support Vector Machines",
"Linear Programming",
"Monitoring",
"Measurement",
"Anomaly Detection",
"Time Series Analysis",
"Cloud Computing Systems",
"Trustworthiness"
],
"authors": [
{
"givenName": "Chengqiang",
"surname": "Huang",
"fullName": "Chengqiang Huang",
"affiliation": "College of Engineering, Mathematics and Physical Sciences, University of Exeter, Exeter, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Geyong",
"surname": "Min",
"fullName": "Geyong Min",
"affiliation": "College of Engineering, Mathematics and Physical Sciences, University of Exeter, Exeter, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yulei",
"surname": "Wu",
"fullName": "Yulei Wu",
"affiliation": "College of Engineering, Mathematics and Physical Sciences, University of Exeter, Exeter, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yiming",
"surname": "Ying",
"fullName": "Yiming Ying",
"affiliation": "Department of Mathematics and Statistics, State University of New York at Albany, Albany, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ke",
"surname": "Pei",
"fullName": "Ke Pei",
"affiliation": "2012 Lab, Huawei Technologies Co. Ltd., Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zuochang",
"surname": "Xiang",
"fullName": "Zuochang Xiang",
"affiliation": "2012 Lab, Huawei Technologies Co. Ltd., Shenzhen, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "60-72",
"year": "2022",
"issn": "2332-7790",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/trustcom-bigdatase-i-spa/2016/3205/0/07847154",
"title": "Enhancing the SVDD Accuracy in Intrusion Detection Systems by Removing External Voids",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom-bigdatase-i-spa/2016/07847154/12OmNBU1jPK",
"parentPublication": {
"id": "proceedings/trustcom-bigdatase-i-spa/2016/3205/0",
"title": "2016 IEEE Trustcom/BigDataSE/ISPA",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispdc/2016/4152/0/07904276",
"title": "Adaptive Anomaly Detection in Cloud Using Robust and Scalable Principal Component Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ispdc/2016/07904276/12OmNywfKBq",
"parentPublication": {
"id": "proceedings/ispdc/2016/4152/0",
"title": "2016 15th International Symposium on Parallel and Distributed Computing (ISPDC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cloud/2015/7287/0/7287a678",
"title": "PBAD: Perception-Based Anomaly Detection System for Cloud Datacenters",
"doi": null,
"abstractUrl": "/proceedings-article/cloud/2015/7287a678/12OmNywxlQ3",
"parentPublication": {
"id": "proceedings/cloud/2015/7287/0",
"title": "2015 IEEE 8th International Conference on Cloud Computing (CLOUD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2022/0883/0/088300b479",
"title": "Current Time Series Anomaly Detection Benchmarks are Flawed and are Creating the Illusion of Progress (Extended Abstract)",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2022/088300b479/1FwFGVEYehG",
"parentPublication": {
"id": "proceedings/icde/2022/0883/0",
"title": "2022 IEEE 38th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020857",
"title": "AER: Auto-Encoder with Regression for Time Series Anomaly Detection",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020857/1KfRYiEX8kw",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-dss-smartcity-dependsys/2022/1993/0/199300a357",
"title": "A Robust and Accurate Multivariate Time Series Anomaly Detection in Fluctuating Cloud-Edge Computing Systems",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-dss-smartcity-dependsys/2022/199300a357/1LSPjFCtHMs",
"parentPublication": {
"id": "proceedings/hpcc-dss-smartcity-dependsys/2022/1993/0",
"title": "2022 IEEE 24th Int Conf on High Performance Computing & Communications; 8th Int Conf on Data Science & Systems; 20th Int Conf on Smart City; 8th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-dss-smartcity-dependsys/2022/1993/0/199300a595",
"title": "STEAM: SVDD-based Anomaly Detection on Attributed Networks via Multi-Autoencoders",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-dss-smartcity-dependsys/2022/199300a595/1LSPl9ywEM0",
"parentPublication": {
"id": "proceedings/hpcc-dss-smartcity-dependsys/2022/1993/0",
"title": "2022 IEEE 24th Int Conf on High Performance Computing & Communications; 8th Int Conf on Data Science & Systems; 20th Int Conf on Smart City; 8th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-dss-smartcity-dependsys/2022/1993/0/199300a303",
"title": "FedTADBench: Federated Time-series Anomaly Detection Benchmark",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-dss-smartcity-dependsys/2022/199300a303/1LSPvq3J3pu",
"parentPublication": {
"id": "proceedings/hpcc-dss-smartcity-dependsys/2022/1993/0",
"title": "2022 IEEE 24th Int Conf on High Performance Computing & Communications; 8th Int Conf on Data Science & Systems; 20th Int Conf on Smart City; 8th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2019/4328/0/09047310",
"title": "Network Log Anomaly Detection Based on GRU and SVDD",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-bdcloud-socialcom-sustaincom/2019/09047310/1iC6v2A8Mbm",
"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"
},
{
"id": "proceedings/big-data/2020/6251/0/09378139",
"title": "TadGAN: Time Series Anomaly Detection Using Generative Adversarial Networks",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09378139/1s64CPQKkA8",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07937932",
"articleId": "13rRUxCitEf",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07962184",
"articleId": "13rRUxZRbq5",
"__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": "1cG6oZu9YBy",
"doi": "10.1109/TVCG.2019.2934613",
"abstract": "Detecting and analyzing potential anomalous performances in cloud computing systems is essential for avoiding losses to customers and ensuring the efficient operation of the systems. To this end, a variety of automated techniques have been developed to identify anomalies in cloud computing. These techniques are usually adopted to track the performance metrics of the system (e.g., CPU, memory, and disk I/O), represented by a multivariate time series. However, given the complex characteristics of cloud computing data, the effectiveness of these automated methods is affected. Thus, substantial human judgment on the automated analysis results is required for anomaly interpretation. In this paper, we present a unified visual analytics system named CloudDet to interactively detect, inspect, and diagnose anomalies in cloud computing systems. A novel unsupervised anomaly detection algorithm is developed to identify anomalies based on the specific temporal patterns of the given metrics data (e.g., the periodic pattern). Rich visualization and interaction designs are used to help understand the anomalies in the spatial and temporal context. We demonstrate the effectiveness of CloudDet through a quantitative evaluation, two case studies with real-world data, and interviews with domain experts.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Detecting and analyzing potential anomalous performances in cloud computing systems is essential for avoiding losses to customers and ensuring the efficient operation of the systems. To this end, a variety of automated techniques have been developed to identify anomalies in cloud computing. These techniques are usually adopted to track the performance metrics of the system (e.g., CPU, memory, and disk I/O), represented by a multivariate time series. However, given the complex characteristics of cloud computing data, the effectiveness of these automated methods is affected. Thus, substantial human judgment on the automated analysis results is required for anomaly interpretation. In this paper, we present a unified visual analytics system named CloudDet to interactively detect, inspect, and diagnose anomalies in cloud computing systems. A novel unsupervised anomaly detection algorithm is developed to identify anomalies based on the specific temporal patterns of the given metrics data (e.g., the periodic pattern). Rich visualization and interaction designs are used to help understand the anomalies in the spatial and temporal context. We demonstrate the effectiveness of CloudDet through a quantitative evaluation, two case studies with real-world data, and interviews with domain experts.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Detecting and analyzing potential anomalous performances in cloud computing systems is essential for avoiding losses to customers and ensuring the efficient operation of the systems. To this end, a variety of automated techniques have been developed to identify anomalies in cloud computing. These techniques are usually adopted to track the performance metrics of the system (e.g., CPU, memory, and disk I/O), represented by a multivariate time series. However, given the complex characteristics of cloud computing data, the effectiveness of these automated methods is affected. Thus, substantial human judgment on the automated analysis results is required for anomaly interpretation. In this paper, we present a unified visual analytics system named CloudDet to interactively detect, inspect, and diagnose anomalies in cloud computing systems. A novel unsupervised anomaly detection algorithm is developed to identify anomalies based on the specific temporal patterns of the given metrics data (e.g., the periodic pattern). Rich visualization and interaction designs are used to help understand the anomalies in the spatial and temporal context. We demonstrate the effectiveness of CloudDet through a quantitative evaluation, two case studies with real-world data, and interviews with domain experts.",
"title": "CloudDet: Interactive Visual Analysis of Anomalous Performances in Cloud Computing Systems",
"normalizedTitle": "CloudDet: Interactive Visual Analysis of Anomalous Performances in Cloud Computing Systems",
"fno": "08807232",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Cloud Computing",
"Data Analysis",
"Data Visualisation",
"Feature Extraction",
"Interactive Systems",
"Security Of Data",
"Time Series",
"Cloud Det",
"Interactive Visual Analysis",
"Cloud Computing Systems",
"Automated Analysis",
"Unified Visual Analytics System",
"Unsupervised Anomaly Detection Algorithm",
"Multivariate Time Series",
"Cloud Computing",
"Data Visualization",
"Anomaly Detection",
"Measurement",
"Time Series Analysis",
"Visualization",
"Principal Component Analysis",
"Cloud Computing",
"Anomaly Detection",
"Multidimensional Data",
"Performance Visualization",
"Visual Analytics"
],
"authors": [
{
"givenName": "Ke",
"surname": "Xu",
"fullName": "Ke Xu",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yun",
"surname": "Wang",
"fullName": "Yun Wang",
"affiliation": "Microsoft Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Leni",
"surname": "Yang",
"fullName": "Leni Yang",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yifang",
"surname": "Wang",
"fullName": "Yifang Wang",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bo",
"surname": "Qiao",
"fullName": "Bo Qiao",
"affiliation": "Microsoft Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Si",
"surname": "Qin",
"fullName": "Si Qin",
"affiliation": "Microsoft Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yong",
"surname": "Xu",
"fullName": "Yong Xu",
"affiliation": "Microsoft Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haidong",
"surname": "Zhang",
"fullName": "Haidong Zhang",
"affiliation": "Microsoft Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Qu",
"fullName": "Huamin Qu",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "1107-1117",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vizsec/2017/2693/0/08062198",
"title": "Network-wide intrusion detection supported by multivariate analysis and interactive visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vizsec/2017/08062198/12OmNAfy7JT",
"parentPublication": {
"id": "proceedings/vizsec/2017/2693/0",
"title": "2017 IEEE Symposium on Visualization for Cyber Security (VizSec)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/2012/4685/0/4685a285",
"title": "PREPARE: Predictive Performance Anomaly Prevention for Virtualized Cloud Systems",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2012/4685a285/12OmNwdbV7T",
"parentPublication": {
"id": "proceedings/icdcs/2012/4685/0",
"title": "2012 IEEE 32nd International Conference on Distributed Computing Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/srds/2013/5115/0/5115a205",
"title": "Adaptive Anomaly Identification by Exploring Metric Subspace in Cloud Computing Infrastructures",
"doi": null,
"abstractUrl": "/proceedings-article/srds/2013/5115a205/12OmNxGja18",
"parentPublication": {
"id": "proceedings/srds/2013/5115/0",
"title": "2013 IEEE 32nd International Symposium on Reliable Distributed Systems (SRDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispan/2008/3125/0/3125a266",
"title": "Detection and Identification of Anomalies in Wireless Mesh Networks Using Principal Component Analysis (PCA)",
"doi": null,
"abstractUrl": "/proceedings-article/ispan/2008/3125a266/12OmNzZWbKQ",
"parentPublication": {
"id": "proceedings/ispan/2008/3125/0",
"title": "Parallel Architectures, Algorithms, and Networks, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2012/03/ttq2012030318",
"title": "Detecting and Resolving Firewall Policy Anomalies",
"doi": null,
"abstractUrl": "/journal/tq/2012/03/ttq2012030318/13rRUEgarkN",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/06/07422127",
"title": "Visual Analysis of Cloud Computing Performance Using Behavioral Lines",
"doi": null,
"abstractUrl": "/journal/tg/2016/06/07422127/13rRUwInv4r",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440859",
"title": "A Visual Analytics Framework for the Detection of Anomalous Call Stack Trees in High Performance Computing Applications",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440859/17D45XeKgxR",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09005687",
"title": "Visual Anomaly Detection in Event Sequence Data",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09005687/1hJs7AGCWuA",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-seip/2021/3869/0/386900a150",
"title": "Anomaly Detection in a Large-Scale Cloud Platform",
"doi": null,
"abstractUrl": "/proceedings-article/icse-seip/2021/386900a150/1sET9ho9dgk",
"parentPublication": {
"id": "proceedings/icse-seip/2021/3869/0/",
"title": "2021 IEEE/ACM 43rd International Conference on Software Engineering: Software Engineering in Practice (ICSE-SEIP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09468958",
"title": "Interpretable Anomaly Detection in Event Sequences via Sequence Matching and Visual Comparison",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09468958/1uR9IWtyEi4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08807294",
"articleId": "1cG6pGxvLOg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08805434",
"articleId": "1cG4DpFE28o",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i4Ql2fKtgI",
"name": "ttg202001-08807232s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202001-08807232s1.mp4",
"extension": "mp4",
"size": "49.3 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAlvHDI",
"title": "July-Aug.",
"year": "2017",
"issueNum": "04",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "19",
"label": "July-Aug.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwx1xLa",
"doi": "10.1109/MCSE.2017.3151252",
"abstract": "This article proposes a 4D segmentation method by considering the 3D t data as a 4D hyper object, using a D4Q81 lattice in a lattice Bhatnagar-Gross-Krook (LBGK) simulation, where time is considered a fourth dimension for defining directions of particle momentum in the LBGK model. They implemented 4D-LBGK on 20 4D hypersphere and hypercube images with varying amounts of Gaussian noise added (0–300 percent). The average Dice values were 94.56 and 93.35 percent for the hypersphere and hypercube segmentations, respectively, demonstrating good segmentation accuracy. They also applied 4D-LBGK on 4D intracranial aneurysm CTA images and compared the results to five established segmentation methods, demonstrating that the proposed method is accurate and robust. The aneurysm segmentation was subsequently used in a LBGK-based biomechanics simulation to provide potentially novel information for understanding the physiology and treatment of intracranial aneurysms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This article proposes a 4D segmentation method by considering the 3D t data as a 4D hyper object, using a D4Q81 lattice in a lattice Bhatnagar-Gross-Krook (LBGK) simulation, where time is considered a fourth dimension for defining directions of particle momentum in the LBGK model. They implemented 4D-LBGK on 20 4D hypersphere and hypercube images with varying amounts of Gaussian noise added (0–300 percent). The average Dice values were 94.56 and 93.35 percent for the hypersphere and hypercube segmentations, respectively, demonstrating good segmentation accuracy. They also applied 4D-LBGK on 4D intracranial aneurysm CTA images and compared the results to five established segmentation methods, demonstrating that the proposed method is accurate and robust. The aneurysm segmentation was subsequently used in a LBGK-based biomechanics simulation to provide potentially novel information for understanding the physiology and treatment of intracranial aneurysms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This article proposes a 4D segmentation method by considering the 3D t data as a 4D hyper object, using a D4Q81 lattice in a lattice Bhatnagar-Gross-Krook (LBGK) simulation, where time is considered a fourth dimension for defining directions of particle momentum in the LBGK model. They implemented 4D-LBGK on 20 4D hypersphere and hypercube images with varying amounts of Gaussian noise added (0–300 percent). The average Dice values were 94.56 and 93.35 percent for the hypersphere and hypercube segmentations, respectively, demonstrating good segmentation accuracy. They also applied 4D-LBGK on 4D intracranial aneurysm CTA images and compared the results to five established segmentation methods, demonstrating that the proposed method is accurate and robust. The aneurysm segmentation was subsequently used in a LBGK-based biomechanics simulation to provide potentially novel information for understanding the physiology and treatment of intracranial aneurysms.",
"title": "Intracranial Aneurysm Phantom Segmentation Using a 4D Lattice Boltzmann Method",
"normalizedTitle": "Intracranial Aneurysm Phantom Segmentation Using a 4D Lattice Boltzmann Method",
"fno": "mcs2017040056",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Lattices",
"Image Segmentation",
"Mathematical Model",
"Aneurysm",
"Three Dimensional Displays",
"Motion Segmentation",
"Two Dimensional Displays",
"Scientific Computing",
"Brain Models",
"4 D Segmentation",
"LBGK",
"D 4 Q 81",
"Intracranial Aneurysm",
"Scientific Computing"
],
"authors": [
{
"givenName": "Yan",
"surname": "Wang",
"fullName": "Yan Wang",
"affiliation": "University of California, San Francisco",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Laurent",
"surname": "Navarro",
"fullName": "Laurent Navarro",
"affiliation": "Ecole Nationale Superieure des Mines de Saint-Etienne",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yue",
"surname": "Zhang",
"fullName": "Yue Zhang",
"affiliation": "Veterans Affairs Medical Center, San Francisco",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Evan",
"surname": "Kao",
"fullName": "Evan Kao",
"affiliation": "University of California, San Francisco",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuemin",
"surname": "Zhu",
"fullName": "Yuemin Zhu",
"affiliation": "University of Lyon",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guy",
"surname": "Courbebaisse",
"fullName": "Guy Courbebaisse",
"affiliation": "University of Lyon",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2017-07-01 00:00:00",
"pubType": "mags",
"pages": "56-67",
"year": "2017",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ems/2010/4308/0/4308a147",
"title": "Automatic Segmentation of Abdominal Aortic Aneurysm Using Logical Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/ems/2010/4308a147/12OmNA0MYWO",
"parentPublication": {
"id": "proceedings/ems/2010/4308/0",
"title": "Computer Modeling and Simulation, UKSIM European Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bmei/2008/3118/1/3118a566",
"title": "Computational Fluid Dynamics Modeling of Intracranial Aneurysms",
"doi": null,
"abstractUrl": "/proceedings-article/bmei/2008/3118a566/12OmNx7G62N",
"parentPublication": {
"id": "proceedings/bmei/2008/3118/1",
"title": "2008 International Conference on Biomedical Engineering and Informatics (BMEI 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/grid/2010/9347/0/05697965",
"title": "Parallel simulation and visualization of blood flow in intracranial aneurysms",
"doi": null,
"abstractUrl": "/proceedings-article/grid/2010/05697965/12OmNyFU79W",
"parentPublication": {
"id": "proceedings/grid/2010/9347/0",
"title": "2010 11th IEEE/ACM International Conference on Grid Computing (GRID 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciibms/2018/7516/3/08549945",
"title": "The Big Bang Theory of Intracranial Aneurysm Rupture: Gazing Through the Computational Fluid Dynamics Telescope",
"doi": null,
"abstractUrl": "/proceedings-article/iciibms/2018/08549945/17D45WXIkE6",
"parentPublication": {
"id": "proceedings/iciibms/2018/7516/3",
"title": "2018 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440110",
"title": "Visual Analysis of Aneurysm Data using Statistical Graphics",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440110/17D45Xtvped",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2021/0126/0/09669853",
"title": "Enriching computed tomography images by projection for robust automated cerebral aneurysm detection and segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2021/09669853/1A9VxzCvZlK",
"parentPublication": {
"id": "proceedings/bibm/2021/0126/0",
"title": "2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2022/9062/0/09956393",
"title": "Toward a 3D Arterial Tree Bifurcation Model for Intra-Cranial Aneurysm Detection and Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2022/09956393/1IHq30qYUzC",
"parentPublication": {
"id": "proceedings/icpr/2022/9062/0",
"title": "2022 26th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09995665",
"title": "3D Segmentation of Abdominal Aortic Aneurysm Walls from CT Angiograms",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995665/1JC2ZXkdpVm",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800c653",
"title": "IntrA: 3D Intracranial Aneurysm Dataset for Deep Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800c653/1m3ofq593yM",
"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/icpr/2021/8808/0/09413175",
"title": "Segmentation of Intracranial Aneurysm Remnant in MRA using Dual-Attention Atrous Net",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09413175/1tmjHDHczMA",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcs2017040044",
"articleId": "13rRUwInvEx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcs2017040068",
"articleId": "13rRUypp542",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzVoBCB",
"title": "July-Sept.",
"year": "2014",
"issueNum": "03",
"idPrefix": "th",
"pubType": "journal",
"volume": "7",
"label": "July-Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBrGhb",
"doi": "10.1109/TOH.2014.2326871",
"abstract": "This paper is the first of a two-part series analyzing human grasping behavior during a wide range of unstructured tasks. The results help clarify overall characteristics of human hand to inform many domains, such as the design of robotic manipulators, targeting rehabilitation toward important hand functionality, and designing haptic devices for use by the hand. It investigates the properties of objects grasped by two housekeepers and two machinists during the course of almost 10,000 grasp instances and correlates the grasp types used to the properties of the object. We establish an object classification that assigns each object properties from a set of seven classes, including mass, shape and size of the grasp location, grasped dimension, rigidity, and roundness. The results showed that 55 percent of grasped objects had at least one dimension larger than 15 cm, suggesting that more than half of objects cannot physically be grasped using their largest axis. Ninety-two percent of objects had a mass of 500 g or less, implying that a high payload capacity may be unnecessary to accomplish a large subset of human grasping behavior. In terms of grasps, 96 percent of grasp locations were 7 cm or less in width, which can help to define requirements for hand rehabilitation and defines a reasonable grasp aperture size for a robotic hand. Subjects grasped the smallest overall major dimension of the object in 94 percent of the instances. This suggests that grasping the smallest axis of an object could be a reliable default behavior to implement in grasp planners.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper is the first of a two-part series analyzing human grasping behavior during a wide range of unstructured tasks. The results help clarify overall characteristics of human hand to inform many domains, such as the design of robotic manipulators, targeting rehabilitation toward important hand functionality, and designing haptic devices for use by the hand. It investigates the properties of objects grasped by two housekeepers and two machinists during the course of almost 10,000 grasp instances and correlates the grasp types used to the properties of the object. We establish an object classification that assigns each object properties from a set of seven classes, including mass, shape and size of the grasp location, grasped dimension, rigidity, and roundness. The results showed that 55 percent of grasped objects had at least one dimension larger than 15 cm, suggesting that more than half of objects cannot physically be grasped using their largest axis. Ninety-two percent of objects had a mass of 500 g or less, implying that a high payload capacity may be unnecessary to accomplish a large subset of human grasping behavior. In terms of grasps, 96 percent of grasp locations were 7 cm or less in width, which can help to define requirements for hand rehabilitation and defines a reasonable grasp aperture size for a robotic hand. Subjects grasped the smallest overall major dimension of the object in 94 percent of the instances. This suggests that grasping the smallest axis of an object could be a reliable default behavior to implement in grasp planners.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper is the first of a two-part series analyzing human grasping behavior during a wide range of unstructured tasks. The results help clarify overall characteristics of human hand to inform many domains, such as the design of robotic manipulators, targeting rehabilitation toward important hand functionality, and designing haptic devices for use by the hand. It investigates the properties of objects grasped by two housekeepers and two machinists during the course of almost 10,000 grasp instances and correlates the grasp types used to the properties of the object. We establish an object classification that assigns each object properties from a set of seven classes, including mass, shape and size of the grasp location, grasped dimension, rigidity, and roundness. The results showed that 55 percent of grasped objects had at least one dimension larger than 15 cm, suggesting that more than half of objects cannot physically be grasped using their largest axis. Ninety-two percent of objects had a mass of 500 g or less, implying that a high payload capacity may be unnecessary to accomplish a large subset of human grasping behavior. In terms of grasps, 96 percent of grasp locations were 7 cm or less in width, which can help to define requirements for hand rehabilitation and defines a reasonable grasp aperture size for a robotic hand. Subjects grasped the smallest overall major dimension of the object in 94 percent of the instances. This suggests that grasping the smallest axis of an object could be a reliable default behavior to implement in grasp planners.",
"title": "Analysis of Human Grasping Behavior: Object Characteristics and Grasp Type",
"normalizedTitle": "Analysis of Human Grasping Behavior: Object Characteristics and Grasp Type",
"fno": "06822601",
"hasPdf": true,
"idPrefix": "th",
"keywords": [
"Grasping",
"Shape",
"Robots",
"Force",
"Thumb",
"Joints"
],
"authors": [
{
"givenName": "Thomas",
"surname": "Feix",
"fullName": "Thomas Feix",
"affiliation": "Department of Mechanical Engineering and Materials Science, Yale University, New Haven, CT",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ian M.",
"surname": "Bullock",
"fullName": "Ian M. Bullock",
"affiliation": "Department of Mechanical Engineering and Materials Science, Yale University, New Haven, CT",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Aaron M.",
"surname": "Dollar",
"fullName": "Aaron M. Dollar",
"affiliation": "Department of Mechanical Engineering and Materials Science, Yale University, New Haven, CT",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2014-07-01 00:00:00",
"pubType": "trans",
"pages": "311-323",
"year": "2014",
"issn": "1939-1412",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dui/2013/6097/0/06550190",
"title": "Effects and optimization of visual-proprioceptive discrepancy reduction for virtual grasping",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2013/06550190/12OmNAOsMLo",
"parentPublication": {
"id": "proceedings/3dui/2013/6097/0",
"title": "2013 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2013/4795/0/06549355",
"title": "Nonuniform and adaptive coupling stiffness for virtual grasping",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2013/06549355/12OmNB836F9",
"parentPublication": {
"id": "proceedings/vr/2013/4795/0",
"title": "2013 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacvw/2017/4941/0/07912207",
"title": "Measuring Grasp Posture Using an Embedded Camera",
"doi": null,
"abstractUrl": "/proceedings-article/wacvw/2017/07912207/12OmNBqMDvx",
"parentPublication": {
"id": "proceedings/wacvw/2017/4941/0",
"title": "2017 IEEE Winter Applications of Computer Vision Workshops (WACVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2012/1204/0/06184182",
"title": "Visual interpenetration tradeoffs in whole-hand virtual grasping",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2012/06184182/12OmNvA1hj6",
"parentPublication": {
"id": "proceedings/3dui/2012/1204/0",
"title": "2012 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/case/2012/0430/0/06386435",
"title": "Kinematics of the Robomec robot hand with planar and spherical four bar linkages for power grasping",
"doi": null,
"abstractUrl": "/proceedings-article/case/2012/06386435/12OmNyugyWn",
"parentPublication": {
"id": "proceedings/case/2012/0430/0",
"title": "2012 IEEE International Conference on Automation Science and Engineering (CASE 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2005/2378/0/23780453",
"title": "Detection and Evaluation of Grasping Positions for Autonomous Agents",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2005/23780453/12OmNzBOhAd",
"parentPublication": {
"id": "proceedings/cw/2005/2378/0",
"title": "2005 International Conference on Cyberworlds (CW'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2014/04/06822621",
"title": "Analysis of Human Grasping Behavior: Correlating Tasks, Objects and Grasps",
"doi": null,
"abstractUrl": "/journal/th/2014/04/06822621/13rRUx0geA2",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/06/07159098",
"title": "Design and Evaluation of Visual Interpenetration Cues in Virtual Grasping",
"doi": null,
"abstractUrl": "/journal/tg/2016/06/07159098/13rRUxBJhvx",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2013/03/tth2013030296",
"title": "Grasp Frequency and Usage in Daily Household and Machine Shop Tasks",
"doi": null,
"abstractUrl": "/journal/th/2013/03/tth2013030296/13rRUy0HYRE",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2021/1838/0/255600a749",
"title": "Freehand Grasping: An Analysis of Grasping for Docking Tasks in Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2021/255600a749/1tuAgrCerNC",
"parentPublication": {
"id": "proceedings/vr/2021/1838/0",
"title": "2021 IEEE Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06810019",
"articleId": "13rRUx0xPii",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06710125",
"articleId": "13rRUxDItho",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"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": "1eTOD4tcaSk",
"doi": "10.1109/TVCG.2019.2938746",
"abstract": "Human poses play a critical role in human-centric product design. Despite considerable researches on pose synthesis and pose-driven product design, most of them adopt the simple stick figure model that captures only skeletons rather than real body geometries and do not link human poses to the environment (e.g., chairs for sitting). This paper focuses on user-tailored ergonomic design and rating of chairs using scanned human geometries. Fully utilizing the anthropometric information of the human models, our method considers more ergonomic guidelines of chair design (such as pressure distribution and support intensity) and links the geometry of 3D chair models and human-to-chair interactions into the pose deformation constraints of the human avatars. The core of our method is a pose generation algorithm which rigs the user's successive poses through coarse- and fine-level pose deformations. We define a non-linear energy function with contact, collision, and joint limit terms, and solve it using a hill-climbing algorithm. The fitting results allow us to quantitatively evaluate the chair model in terms of various ergonomic criteria. Our method is flexible and effective and can be applied to users with varying body shapes and a wide range of chairs. Moreover, the proposed technique can be easily extended to other furniture, such as desk, bed, and cabinet. Extensive evaluations and a user study demonstrate the efficiency and advantages of the proposed virtual fitting method. Given that our method avoids tedious on-site trying, facilitates the exploration/evaluation of various chair products, and provides valuable feedback for the designers and manufacturers to deliver customized products, it is ideal for online shopping of chairs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Human poses play a critical role in human-centric product design. Despite considerable researches on pose synthesis and pose-driven product design, most of them adopt the simple stick figure model that captures only skeletons rather than real body geometries and do not link human poses to the environment (e.g., chairs for sitting). This paper focuses on user-tailored ergonomic design and rating of chairs using scanned human geometries. Fully utilizing the anthropometric information of the human models, our method considers more ergonomic guidelines of chair design (such as pressure distribution and support intensity) and links the geometry of 3D chair models and human-to-chair interactions into the pose deformation constraints of the human avatars. The core of our method is a pose generation algorithm which rigs the user's successive poses through coarse- and fine-level pose deformations. We define a non-linear energy function with contact, collision, and joint limit terms, and solve it using a hill-climbing algorithm. The fitting results allow us to quantitatively evaluate the chair model in terms of various ergonomic criteria. Our method is flexible and effective and can be applied to users with varying body shapes and a wide range of chairs. Moreover, the proposed technique can be easily extended to other furniture, such as desk, bed, and cabinet. Extensive evaluations and a user study demonstrate the efficiency and advantages of the proposed virtual fitting method. Given that our method avoids tedious on-site trying, facilitates the exploration/evaluation of various chair products, and provides valuable feedback for the designers and manufacturers to deliver customized products, it is ideal for online shopping of chairs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Human poses play a critical role in human-centric product design. Despite considerable researches on pose synthesis and pose-driven product design, most of them adopt the simple stick figure model that captures only skeletons rather than real body geometries and do not link human poses to the environment (e.g., chairs for sitting). This paper focuses on user-tailored ergonomic design and rating of chairs using scanned human geometries. Fully utilizing the anthropometric information of the human models, our method considers more ergonomic guidelines of chair design (such as pressure distribution and support intensity) and links the geometry of 3D chair models and human-to-chair interactions into the pose deformation constraints of the human avatars. The core of our method is a pose generation algorithm which rigs the user's successive poses through coarse- and fine-level pose deformations. We define a non-linear energy function with contact, collision, and joint limit terms, and solve it using a hill-climbing algorithm. The fitting results allow us to quantitatively evaluate the chair model in terms of various ergonomic criteria. Our method is flexible and effective and can be applied to users with varying body shapes and a wide range of chairs. Moreover, the proposed technique can be easily extended to other furniture, such as desk, bed, and cabinet. Extensive evaluations and a user study demonstrate the efficiency and advantages of the proposed virtual fitting method. Given that our method avoids tedious on-site trying, facilitates the exploration/evaluation of various chair products, and provides valuable feedback for the designers and manufacturers to deliver customized products, it is ideal for online shopping of chairs.",
"title": "Automatic Sitting Pose Generation for Ergonomic Ratings of Chairs",
"normalizedTitle": "Automatic Sitting Pose Generation for Ergonomic Ratings of Chairs",
"fno": "08826009",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Anthropometry",
"Avatars",
"Biomechanics",
"Computer Animation",
"Ergonomics",
"Furniture",
"Internet",
"Pose Estimation",
"Product Customisation",
"Product Design",
"Solid Modelling",
"Pose Generation",
"Fine Level Pose Deformations",
"Chair Model",
"Ergonomic Criteria",
"Chair Products",
"Automatic Sitting",
"Ergonomic Ratings",
"Human Poses",
"Human Centric Product Design",
"Body Geometries",
"User Tailored Ergonomic Design",
"Human Geometries",
"Human Models",
"Ergonomic Guidelines",
"Chair Design",
"3 D Chair Models",
"Human To Chair Interactions",
"Human Avatars",
"Stick Figure Model",
"Ergonomics",
"Strain",
"Avatars",
"Shape",
"Computational Modeling",
"Skeleton",
"Geometry",
"Sitting Pose Generation",
"Alignment",
"Human Chair Interaction",
"Ergonomic Rating"
],
"authors": [
{
"givenName": "Aihua",
"surname": "Mao",
"fullName": "Aihua Mao",
"affiliation": "School of Computer Science and Engineering, South China University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hong",
"surname": "Zhang",
"fullName": "Hong Zhang",
"affiliation": "School of Computer Science and Engineering, South China University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhenfeng",
"surname": "Xie",
"fullName": "Zhenfeng Xie",
"affiliation": "School of Computer Science and Engineering, South China University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Minjing",
"surname": "Yu",
"fullName": "Minjing Yu",
"affiliation": "College of Intelligence and Computing, Tianjin University, Tianjin, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yong-Jin",
"surname": "Liu",
"fullName": "Yong-Jin Liu",
"affiliation": "Department of Computer Science and Technology, BNRist, MOE Key Laboratory of Pervasive Computing, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ying",
"surname": "He",
"fullName": "Ying He",
"affiliation": "School of Computer Engineering, Nanyang Technological University, Singapore",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2021-03-01 00:00:00",
"pubType": "trans",
"pages": "1890-1903",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/haptics/2010/6821/0/05444633",
"title": "A vibrotactile feedback approach to posture guidance",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2010/05444633/12OmNAo45Ki",
"parentPublication": {
"id": "proceedings/haptics/2010/6821/0",
"title": "2010 IEEE Haptics Symposium (Formerly known as Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1984/0542/0/01585799",
"title": "Ergonomic Studies in Computer Aided Design",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1984/01585799/12OmNvDZEVE",
"parentPublication": {
"id": "proceedings/dac/1984/0542/0",
"title": "21st Design Automation Conference Proceedings",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crc/2017/0677/0/0677a171",
"title": "Ergonomic Aspect and Design of Hand Tools in Ceramic Industry Using JACK",
"doi": null,
"abstractUrl": "/proceedings-article/crc/2017/0677a171/12OmNxYbSZv",
"parentPublication": {
"id": "proceedings/crc/2017/0677/0",
"title": "2017 2nd International Conference on Cybernetics, Robotics and Control (CRC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cccrv/2004/2127/0/01301487",
"title": "Real-time hybrid pose estimation from vision and inertial data",
"doi": null,
"abstractUrl": "/proceedings-article/cccrv/2004/01301487/12OmNxj239U",
"parentPublication": {
"id": "proceedings/cccrv/2004/2127/0",
"title": "First Canadian Conference on Computer and Robot Vision, 2004. Proceedings.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2004/2127/0/01301487",
"title": "Real-time hybrid pose estimation from vision and inertial data",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2004/01301487/12OmNyQGS2b",
"parentPublication": {
"id": "proceedings/crv/2004/2127/0",
"title": "First Canadian Conference on Computer and Robot Vision, 2004. Proceedings.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111979",
"title": "A Sketching Interface for Sitting Pose Design in the Virtual Environment",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111979/13rRUIJuxpv",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/06/07130656",
"title": "Ergonomics-Inspired Reshaping and Exploration of Collections of Models",
"doi": null,
"abstractUrl": "/journal/tg/2016/06/07130656/13rRUy2YLT4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/inciscos/2018/7612/0/761200a042",
"title": "Mobile Application for Ergonomic Analysis of the Sitting Posture of the Torso",
"doi": null,
"abstractUrl": "/proceedings-article/inciscos/2018/761200a042/17D45VWpMz6",
"parentPublication": {
"id": "proceedings/inciscos/2018/7612/0",
"title": "2018 International Conference on Information Systems and Computer Science (INCISCOS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpai/2020/4262/0/426200a268",
"title": "The Risk Classification of Ergonomic Musculoskeletal Disorders in Work-related Repetitive Manual Handling Operations with Deep Learning Approaches",
"doi": null,
"abstractUrl": "/proceedings-article/icpai/2020/426200a268/1pZ16Qn0MOQ",
"parentPublication": {
"id": "proceedings/icpai/2020/4262/0",
"title": "2020 International Conference on Pervasive Artificial Intelligence (ICPAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aivr/2020/7463/0/746300a274",
"title": "Inverse Kinematics and Temporal Convolutional Networks for Sequential Pose Analysis in VR",
"doi": null,
"abstractUrl": "/proceedings-article/aivr/2020/746300a274/1qpzAz62YQ8",
"parentPublication": {
"id": "proceedings/aivr/2020/7463/0",
"title": "2020 IEEE International Conference on Artificial Intelligence and Virtual Reality (AIVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09234004",
"articleId": "1o531avdcQM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08823051",
"articleId": "1d1yU2QogmI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1Hcio5iMQBW",
"title": "Nov.",
"year": "2022",
"issueNum": "11",
"idPrefix": "tp",
"pubType": "journal",
"volume": "44",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1vNfwmj8UCY",
"doi": "10.1109/TPAMI.2021.3102128",
"abstract": "This paper presents a novel framework to recover <italic>detailed</italic> avatar from a single image. It is a challenging task due to factors such as variations in human shapes, body poses, texture, and viewpoints. Prior methods typically attempt to recover the human body shape using a parametric-based template that lacks the surface details. As such resulting body shape appears to be without clothing. In this paper, we propose a novel learning-based framework that combines the robustness of the parametric model with the flexibility of free-form 3D deformation. We use the deep neural networks to refine the 3D shape in a Hierarchical Mesh Deformation (HMD) framework, utilizing the constraints from body joints, silhouettes, and per-pixel shading information. Our method can restore detailed human body shapes with complete textures beyond skinned models. Experiments demonstrate that our method has outperformed previous state-of-the-art approaches, achieving better accuracy in terms of both 2D IoU number and 3D metric distance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a novel framework to recover <italic>detailed</italic> avatar from a single image. It is a challenging task due to factors such as variations in human shapes, body poses, texture, and viewpoints. Prior methods typically attempt to recover the human body shape using a parametric-based template that lacks the surface details. As such resulting body shape appears to be without clothing. In this paper, we propose a novel learning-based framework that combines the robustness of the parametric model with the flexibility of free-form 3D deformation. We use the deep neural networks to refine the 3D shape in a Hierarchical Mesh Deformation (HMD) framework, utilizing the constraints from body joints, silhouettes, and per-pixel shading information. Our method can restore detailed human body shapes with complete textures beyond skinned models. Experiments demonstrate that our method has outperformed previous state-of-the-art approaches, achieving better accuracy in terms of both 2D IoU number and 3D metric distance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a novel framework to recover detailed avatar from a single image. It is a challenging task due to factors such as variations in human shapes, body poses, texture, and viewpoints. Prior methods typically attempt to recover the human body shape using a parametric-based template that lacks the surface details. As such resulting body shape appears to be without clothing. In this paper, we propose a novel learning-based framework that combines the robustness of the parametric model with the flexibility of free-form 3D deformation. We use the deep neural networks to refine the 3D shape in a Hierarchical Mesh Deformation (HMD) framework, utilizing the constraints from body joints, silhouettes, and per-pixel shading information. Our method can restore detailed human body shapes with complete textures beyond skinned models. Experiments demonstrate that our method has outperformed previous state-of-the-art approaches, achieving better accuracy in terms of both 2D IoU number and 3D metric distance.",
"title": "Detailed Avatar Recovery From Single Image",
"normalizedTitle": "Detailed Avatar Recovery From Single Image",
"fno": "09507281",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Computer Vision",
"Feature Extraction",
"Image Recognition",
"Image Representation",
"Image Segmentation",
"Image Sensors",
"Image Texture",
"Learning Artificial Intelligence",
"Mesh Generation",
"Neural Nets",
"Object Detection",
"Pose Estimation",
"Solid Modelling",
"Detailed Avatar",
"Single Image",
"Human Shapes",
"Body Poses",
"Human Body Shape",
"Surface Details",
"Resulting Body Shape",
"Novel Learning Based Framework",
"Parametric Model",
"Free Form 3 D Deformation",
"Deep Neural Networks",
"Hierarchical Mesh Deformation Framework",
"Body Joints",
"Detailed Human Body Shapes",
"Complete Textures",
"Avatar Recovery",
"Shape",
"Three Dimensional Displays",
"Predictive Models",
"Strain",
"Biological System Modeling",
"Avatars",
"Solid Modeling",
"Human Avatar",
"3 D Reconstruction",
"Texture Completion",
"Deep Neural Network"
],
"authors": [
{
"givenName": "Hao",
"surname": "Zhu",
"fullName": "Hao Zhu",
"affiliation": "Nanjing University, Nanjing, Jiangsu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xinxin",
"surname": "Zuo",
"fullName": "Xinxin Zuo",
"affiliation": "University of Kentucky, Lexington, KY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haotian",
"surname": "Yang",
"fullName": "Haotian Yang",
"affiliation": "Nanjing University, Nanjing, Jiangsu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sen",
"surname": "Wang",
"fullName": "Sen Wang",
"affiliation": "University of Kentucky, Lexington, KY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xun",
"surname": "Cao",
"fullName": "Xun Cao",
"affiliation": "Nanjing University, Nanjing, Jiangsu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ruigang",
"surname": "Yang",
"fullName": "Ruigang Yang",
"affiliation": "University of Kentucky, Lexington, KY, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2022-11-01 00:00:00",
"pubType": "trans",
"pages": "7363-7379",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2015/8391/0/8391c300",
"title": "Detailed Full-Body Reconstructions of Moving People from Monocular RGB-D Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391c300/12OmNC4wtFD",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2018/4886/0/488601a858",
"title": "DeformNet: Free-Form Deformation Network for 3D Shape Reconstruction from a Single Image",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2018/488601a858/12OmNyKJiqm",
"parentPublication": {
"id": "proceedings/wacv/2018/4886/0",
"title": "2018 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/uic-atc-scalcom/2015/7211/0/07518396",
"title": "Creating Personal 3D Avatar from a Single Depth Sensor",
"doi": null,
"abstractUrl": "/proceedings-article/uic-atc-scalcom/2015/07518396/12OmNzZWbKh",
"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": "trans/tg/2020/08/08611145",
"title": "Portrait Relief Modeling from a Single Image",
"doi": null,
"abstractUrl": "/journal/tg/2020/08/08611145/17D45XDIXSX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600n3243",
"title": "FLAG: Flow-based 3D Avatar Generation from Sparse Observations",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600n3243/1H1luesFPiw",
"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/tp/5555/01/10112633",
"title": "Fast-SNARF: A Fast Deformer for Articulated Neural Fields",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/10112633/1MIczzabnJm",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798353",
"title": "Rapid 3D Avatar Creation System Using a Single Depth Camera",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798353/1cJ11TRykmY",
"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/2019/3293/0/329300e486",
"title": "Detailed Human Shape Estimation From a Single Image by Hierarchical Mesh Deformation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300e486/1gyrb8f3Ppe",
"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/iccvw/2019/5023/0/502300c100",
"title": "Landmark-Guided Deformation Transfer of Template Facial Expressions for Automatic Generation of Avatar Blendshapes",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2019/502300c100/1i5mNnnOzlu",
"parentPublication": {
"id": "proceedings/iccvw/2019/5023/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/08/09072593",
"title": "Disentangled Human Body Embedding Based on Deep Hierarchical Neural Network",
"doi": null,
"abstractUrl": "/journal/tg/2020/08/09072593/1jbj5x3GahW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09573322",
"articleId": "1xH5CvNpKN2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09525302",
"articleId": "1wuoVjl3Eu4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzFdtc6",
"title": "November/December",
"year": "2010",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "16",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0gev4",
"doi": "10.1109/TVCG.2010.213",
"abstract": "An important goal of scientific data analysis is to understand the behavior of a system or process based on a sample of the system. In many instances it is possible to observe both input parameters and system outputs, and characterize the system as a high-dimensional function. Such data sets arise, for instance, in large numerical simulations, as energy landscapes in optimization problems, or in the analysis of image data relating to biological or medical parameters. This paper proposes an approach to analyze and visualizing such data sets. The proposed method combines topological and geometric techniques to provide interactive visualizations of discretely sampled high-dimensional scalar fields. The method relies on a segmentation of the parameter space using an approximate Morse-Smale complex on the cloud of point samples. For each crystal of the Morse-Smale complex, a regression of the system parameters with respect to the output yields a curve in the parameter space. The result is a simplified geometric representation of the Morse-Smale complex in the high dimensional input domain. Finally, the geometric representation is embedded in 2D, using dimension reduction, to provide a visualization platform. The geometric properties of the regression curves enable the visualization of additional information about each crystal such as local and global shape, width, length, and sampling densities. The method is illustrated on several synthetic examples of two dimensional functions. Two use cases, using data sets from the UCI machine learning repository, demonstrate the utility of the proposed approach on real data. Finally, in collaboration with domain experts the proposed method is applied to two scientific challenges. The analysis of parameters of climate simulations and their relationship to predicted global energy flux and the concentrations of chemical species in a combustion simulation and their integration with temperature.",
"abstracts": [
{
"abstractType": "Regular",
"content": "An important goal of scientific data analysis is to understand the behavior of a system or process based on a sample of the system. In many instances it is possible to observe both input parameters and system outputs, and characterize the system as a high-dimensional function. Such data sets arise, for instance, in large numerical simulations, as energy landscapes in optimization problems, or in the analysis of image data relating to biological or medical parameters. This paper proposes an approach to analyze and visualizing such data sets. The proposed method combines topological and geometric techniques to provide interactive visualizations of discretely sampled high-dimensional scalar fields. The method relies on a segmentation of the parameter space using an approximate Morse-Smale complex on the cloud of point samples. For each crystal of the Morse-Smale complex, a regression of the system parameters with respect to the output yields a curve in the parameter space. The result is a simplified geometric representation of the Morse-Smale complex in the high dimensional input domain. Finally, the geometric representation is embedded in 2D, using dimension reduction, to provide a visualization platform. The geometric properties of the regression curves enable the visualization of additional information about each crystal such as local and global shape, width, length, and sampling densities. The method is illustrated on several synthetic examples of two dimensional functions. Two use cases, using data sets from the UCI machine learning repository, demonstrate the utility of the proposed approach on real data. Finally, in collaboration with domain experts the proposed method is applied to two scientific challenges. The analysis of parameters of climate simulations and their relationship to predicted global energy flux and the concentrations of chemical species in a combustion simulation and their integration with temperature.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "An important goal of scientific data analysis is to understand the behavior of a system or process based on a sample of the system. In many instances it is possible to observe both input parameters and system outputs, and characterize the system as a high-dimensional function. Such data sets arise, for instance, in large numerical simulations, as energy landscapes in optimization problems, or in the analysis of image data relating to biological or medical parameters. This paper proposes an approach to analyze and visualizing such data sets. The proposed method combines topological and geometric techniques to provide interactive visualizations of discretely sampled high-dimensional scalar fields. The method relies on a segmentation of the parameter space using an approximate Morse-Smale complex on the cloud of point samples. For each crystal of the Morse-Smale complex, a regression of the system parameters with respect to the output yields a curve in the parameter space. The result is a simplified geometric representation of the Morse-Smale complex in the high dimensional input domain. Finally, the geometric representation is embedded in 2D, using dimension reduction, to provide a visualization platform. The geometric properties of the regression curves enable the visualization of additional information about each crystal such as local and global shape, width, length, and sampling densities. The method is illustrated on several synthetic examples of two dimensional functions. Two use cases, using data sets from the UCI machine learning repository, demonstrate the utility of the proposed approach on real data. Finally, in collaboration with domain experts the proposed method is applied to two scientific challenges. The analysis of parameters of climate simulations and their relationship to predicted global energy flux and the concentrations of chemical species in a combustion simulation and their integration with temperature.",
"title": "Visual Exploration of High Dimensional Scalar Functions",
"normalizedTitle": "Visual Exploration of High Dimensional Scalar Functions",
"fno": "ttg2010061271",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Crystals",
"Manifolds",
"Approximation Methods",
"Data Visualization",
"Kernel",
"Geometry",
"Concrete",
"Morse Smale Complex",
"Morse Theory",
"High Dimensional Visualization"
],
"authors": [
{
"givenName": "S",
"surname": "Gerber",
"fullName": "S Gerber",
"affiliation": "Sci. Comput. & Imaging Inst., Univ. of Utah, Salt Lake City, UT, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "P",
"surname": "Bremer",
"fullName": "P Bremer",
"affiliation": "Lawrence Livermore Nat. Lab., Center of Appl. Sci. Comput. (CASC), Livermore, CA, 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"
},
{
"givenName": "R",
"surname": "Whitaker",
"fullName": "R Whitaker",
"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": "2010-11-01 00:00:00",
"pubType": "trans",
"pages": "1271-1280",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2005/2766/0/27660068",
"title": "Topology-based Simplification for Feature Extraction from 3D Scalar Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660068/12OmNArKShW",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300019",
"title": "A Multi-resolution Data Structure for Two-dimensional Morse-Smale Functions",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300019/12OmNBTJIFg",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880481",
"title": "Guaranteed Quality Triangulation of Molecular Skin Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880481/12OmNBtCCME",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2011/4548/0/4548a025",
"title": "Memory-Efficient Computation of Persistent Homology for 3D Images Using Discrete Morse Theory",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2011/4548a025/12OmNqJ8tfs",
"parentPublication": {
"id": "proceedings/sibgrapi/2011/4548/0",
"title": "2011 24th SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2012/4675/0/4675a484",
"title": "The Parallel Computation of Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2012/4675a484/12OmNrFBQ1B",
"parentPublication": {
"id": "proceedings/ipdps/2012/4675/0",
"title": "Parallel and Distributed Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/06/07150427",
"title": "Felix: A Topology Based Framework for Visual Exploration of Cosmic Filaments",
"doi": null,
"abstractUrl": "/journal/tg/2016/06/07150427/13rRUwbs20Y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/04/v0385",
"title": "A Topological Hierarchy for Functions on Triangulated Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2004/04/v0385/13rRUwdrdSq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0474",
"title": "A Topological Approach to Simplification of Three-Dimensional Scalar Functions",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0474/13rRUwhHcQN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/04376172",
"title": "Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/04376172/13rRUwj7cp4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010061291",
"articleId": "13rRUEgs2BS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010061301",
"articleId": "13rRUxly8XC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgIs",
"name": "ttg2010061271s1.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2010061271s1.mov",
"extension": "mov",
"size": "39.3 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUxZzAhE",
"doi": "10.1109/TVCG.2012.209",
"abstract": "Topological techniques have proven highly successful in analyzing and visualizing scientific data. As a result, significant efforts have been made to compute structures like the Morse-Smale complex as robustly and efficiently as possible. However, the resulting algorithms, while topologically consistent, often produce incorrect connectivity as well as poor geometry. These problems may compromise or even invalidate any subsequent analysis. Moreover, such techniques may fail to improve even when the resolution of the domain mesh is increased, thus producing potentially incorrect results even for highly resolved functions. To address these problems we introduce two new algorithms: (i) a randomized algorithm to compute the discrete gradient of a scalar field that converges under refinement; and (ii) a deterministic variant which directly computes accurate geometry and thus correct connectivity of the MS complex. The first algorithm converges in the sense that on average it produces the correct result and its standard deviation approaches zero with increasing mesh resolution. The second algorithm uses two ordered traversals of the function to integrate the probabilities of the first to extract correct (near optimal) geometry and connectivity. We present an extensive empirical study using both synthetic and real-world data and demonstrates the advantages of our algorithms in comparison with several popular approaches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Topological techniques have proven highly successful in analyzing and visualizing scientific data. As a result, significant efforts have been made to compute structures like the Morse-Smale complex as robustly and efficiently as possible. However, the resulting algorithms, while topologically consistent, often produce incorrect connectivity as well as poor geometry. These problems may compromise or even invalidate any subsequent analysis. Moreover, such techniques may fail to improve even when the resolution of the domain mesh is increased, thus producing potentially incorrect results even for highly resolved functions. To address these problems we introduce two new algorithms: (i) a randomized algorithm to compute the discrete gradient of a scalar field that converges under refinement; and (ii) a deterministic variant which directly computes accurate geometry and thus correct connectivity of the MS complex. The first algorithm converges in the sense that on average it produces the correct result and its standard deviation approaches zero with increasing mesh resolution. The second algorithm uses two ordered traversals of the function to integrate the probabilities of the first to extract correct (near optimal) geometry and connectivity. We present an extensive empirical study using both synthetic and real-world data and demonstrates the advantages of our algorithms in comparison with several popular approaches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Topological techniques have proven highly successful in analyzing and visualizing scientific data. As a result, significant efforts have been made to compute structures like the Morse-Smale complex as robustly and efficiently as possible. However, the resulting algorithms, while topologically consistent, often produce incorrect connectivity as well as poor geometry. These problems may compromise or even invalidate any subsequent analysis. Moreover, such techniques may fail to improve even when the resolution of the domain mesh is increased, thus producing potentially incorrect results even for highly resolved functions. To address these problems we introduce two new algorithms: (i) a randomized algorithm to compute the discrete gradient of a scalar field that converges under refinement; and (ii) a deterministic variant which directly computes accurate geometry and thus correct connectivity of the MS complex. The first algorithm converges in the sense that on average it produces the correct result and its standard deviation approaches zero with increasing mesh resolution. The second algorithm uses two ordered traversals of the function to integrate the probabilities of the first to extract correct (near optimal) geometry and connectivity. We present an extensive empirical study using both synthetic and real-world data and demonstrates the advantages of our algorithms in comparison with several popular approaches.",
"title": "Computing Morse-Smale Complexes with Accurate Geometry",
"normalizedTitle": "Computing Morse-Smale Complexes with Accurate Geometry",
"fno": "ttg2012122014",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Geometry",
"Manifolds",
"Vectors",
"Algorithm Design And Analysis",
"Standards",
"Robustness",
"Topology",
"Morse Smale Complex",
"Topology",
"Topological Methods"
],
"authors": [
{
"givenName": "A.",
"surname": "Gyulassy",
"fullName": "A. Gyulassy",
"affiliation": "SCI Inst., Univ. of Utah, Salt Lake City, UT, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "P.",
"surname": "Bremer",
"fullName": "P. Bremer",
"affiliation": "Lawrence Livermore Nat. Lab., Lawrence, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "V.",
"surname": "Pascucci",
"fullName": "V. Pascucci",
"affiliation": "SCI Inst., Univ. of Utah, Salt Lake City, UT, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2014-2022",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2003/2030/0/20300019",
"title": "A Multi-resolution Data Structure for Two-dimensional Morse-Smale Functions",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300019/12OmNBTJIFg",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2012/4675/0/4675a484",
"title": "The Parallel Computation of Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2012/4675a484/12OmNrFBQ1B",
"parentPublication": {
"id": "proceedings/ipdps/2012/4675/0",
"title": "Parallel and Distributed Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2005/2379/0/01563237",
"title": "Volumetric data analysis using Morse-Smale complexes",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2005/01563237/12OmNxaw5b1",
"parentPublication": {
"id": "proceedings/smi/2005/2379/0",
"title": "Proceedings. International Conference on Shape Modeling and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/04376172",
"title": "Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/04376172/13rRUwj7cp4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875918",
"title": "Conforming Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875918/13rRUwjGoLG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/10/ttg2012101757",
"title": "Parallel Computation of 2D Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/2012/10/ttg2012101757/13rRUxASuSL",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/04658183",
"title": "A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/04658183/13rRUxOdD8b",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/09/06065731",
"title": "Direct Feature Visualization Using Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/2012/09/06065731/13rRUyv53Fn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440824",
"title": "Shared-Memory Parallel Computation of Morse-Smale Complexes with Improved Accuracy",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440824/17D45Xh13tG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09773959",
"title": "A GPU Parallel Algorithm for Computing Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09773959/1DjDpvFkiwE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012122005",
"articleId": "13rRUx0xPmY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122023",
"articleId": "13rRUNvyath",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwJPMX5",
"title": "Dec.",
"year": "2011",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygT7mU",
"doi": "10.1109/TVCG.2011.244",
"abstract": "We present topological spines-a new visual representation that preserves the topological and geometric structure of a scalar field. This representation encodes the spatial relationships of the extrema of a scalar field together with the local volume and nesting structure of the surrounding contours. Unlike other topological representations, such as contour trees, our approach preserves the local geometric structure of the scalar field, including structural cycles that are useful for exposing symmetries in the data. To obtain this representation, we describe a novel mechanism based on the extraction of extremum graphs-sparse subsets of the Morse-Smale complex that retain the important structural information without the clutter and occlusion problems that arise from visualizing the entire complex directly. Extremum graphs form a natural multiresolution structure that allows the user to suppress noise and enhance topological features via the specification of a persistence range. Applications of our approach include the visualization of 3D scalar fields without occlusion artifacts, and the exploratory analysis of high-dimensional functions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present topological spines-a new visual representation that preserves the topological and geometric structure of a scalar field. This representation encodes the spatial relationships of the extrema of a scalar field together with the local volume and nesting structure of the surrounding contours. Unlike other topological representations, such as contour trees, our approach preserves the local geometric structure of the scalar field, including structural cycles that are useful for exposing symmetries in the data. To obtain this representation, we describe a novel mechanism based on the extraction of extremum graphs-sparse subsets of the Morse-Smale complex that retain the important structural information without the clutter and occlusion problems that arise from visualizing the entire complex directly. Extremum graphs form a natural multiresolution structure that allows the user to suppress noise and enhance topological features via the specification of a persistence range. Applications of our approach include the visualization of 3D scalar fields without occlusion artifacts, and the exploratory analysis of high-dimensional functions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present topological spines-a new visual representation that preserves the topological and geometric structure of a scalar field. This representation encodes the spatial relationships of the extrema of a scalar field together with the local volume and nesting structure of the surrounding contours. Unlike other topological representations, such as contour trees, our approach preserves the local geometric structure of the scalar field, including structural cycles that are useful for exposing symmetries in the data. To obtain this representation, we describe a novel mechanism based on the extraction of extremum graphs-sparse subsets of the Morse-Smale complex that retain the important structural information without the clutter and occlusion problems that arise from visualizing the entire complex directly. Extremum graphs form a natural multiresolution structure that allows the user to suppress noise and enhance topological features via the specification of a persistence range. Applications of our approach include the visualization of 3D scalar fields without occlusion artifacts, and the exploratory analysis of high-dimensional functions.",
"title": "Topological Spines: A Structure-preserving Visual Representation of Scalar Fields",
"normalizedTitle": "Topological Spines: A Structure-preserving Visual Representation of Scalar Fields",
"fno": "ttg2011121842",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Topology",
"Data Visualization",
"Approximation Methods",
"Manifolds",
"Morse Smale Complex",
"Scalar Field Topology",
"Topological Spine",
"Extremum Graph"
],
"authors": [
{
"givenName": "C.",
"surname": "Correa",
"fullName": "C. Correa",
"affiliation": "Center for Appl. Sci. Comput. (CASC), Lawrence Livermore Nat. Lab., Livermore, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "P.",
"surname": "Lindstrom",
"fullName": "P. Lindstrom",
"affiliation": "Center for Appl. Sci. Comput. (CASC), Lawrence Livermore Nat. Lab., Livermore, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peer-Timo",
"surname": "Bremer",
"fullName": "Peer-Timo Bremer",
"affiliation": "Center for Appl. Sci. Comput. (CASC), Lawrence Livermore Nat. Lab., Livermore, CA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2011-12-01 00:00:00",
"pubType": "trans",
"pages": "1842-1851",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2002/7498/0/7498weber",
"title": "Exploring Scalar Fields Using Critical Isovalues",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498weber/12OmNAYXWzS",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660068",
"title": "Topology-based Simplification for Feature Extraction from 3D Scalar Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660068/12OmNArKShW",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1998/9176/0/91760051",
"title": "Visualization of Scalar Topology for Structural Enhancement",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1998/91760051/12OmNzVoBtU",
"parentPublication": {
"id": "proceedings/ieee-vis/1998/9176/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0474",
"title": "A Topological Approach to Simplification of Three-Dimensional Scalar Functions",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0474/13rRUwhHcQN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061271",
"title": "Visual Exploration of High Dimensional Scalar Functions",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061271/13rRUx0gev4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122005",
"title": "Generalized Topological Simplification of Scalar Fields on Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122005/13rRUx0xPmY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122663",
"title": "Detecting Symmetry in Scalar Fields Using Augmented Extremum Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122663/13rRUxAASTa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875939",
"title": "Fast and Memory-Efficienty Topological Denoising of 2D and 3D Scalar Fields",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875939/13rRUyYSWl0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061475",
"title": "Interactive Comparison of Scalar Fields Based on Largest Contours with Applications to Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061475/13rRUyuegp2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011121832",
"articleId": "13rRUygT7mT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011121852",
"articleId": "13rRUwI5Ug3",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRZr",
"name": "ttg2011121842s1.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2011121842s1.mov",
"extension": "mov",
"size": "10.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAtstbj",
"title": "Sept.",
"year": "2012",
"issueNum": "09",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyv53Fn",
"doi": "10.1109/TVCG.2011.272",
"abstract": "In this paper, we characterize the range of features that can be extracted from an Morse-Smale complex and describe a unified query language to extract them. We provide a visual dictionary to guide users when defining features in terms of these queries. We demonstrate our topology-rich visualization pipeline in a tool that interactively queries the MS complex to extract features at multiple resolutions, assigns rendering attributes, and combines traditional volume visualization with the extracted features. The flexibility and power of this approach is illustrated with examples showing novel features.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we characterize the range of features that can be extracted from an Morse-Smale complex and describe a unified query language to extract them. We provide a visual dictionary to guide users when defining features in terms of these queries. We demonstrate our topology-rich visualization pipeline in a tool that interactively queries the MS complex to extract features at multiple resolutions, assigns rendering attributes, and combines traditional volume visualization with the extracted features. The flexibility and power of this approach is illustrated with examples showing novel features.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we characterize the range of features that can be extracted from an Morse-Smale complex and describe a unified query language to extract them. We provide a visual dictionary to guide users when defining features in terms of these queries. We demonstrate our topology-rich visualization pipeline in a tool that interactively queries the MS complex to extract features at multiple resolutions, assigns rendering attributes, and combines traditional volume visualization with the extracted features. The flexibility and power of this approach is illustrated with examples showing novel features.",
"title": "Direct Feature Visualization Using Morse-Smale Complexes",
"normalizedTitle": "Direct Feature Visualization Using Morse-Smale Complexes",
"fno": "06065731",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Feature Extraction",
"Manifolds",
"Data Visualization",
"Geometry",
"Vectors",
"Visualization",
"Data Structures",
"Topology",
"Volume Visualization",
"Applications",
"Feature Detection"
],
"authors": [
{
"givenName": "V.",
"surname": "Pascucci",
"fullName": "V. Pascucci",
"affiliation": "Dept. of Comput. Sci., Univ. of Utah, Salt Lake City, UT, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "H.",
"surname": "Hagen",
"fullName": "H. Hagen",
"affiliation": "Dept. of Comput. Sci., Tech. Univ. of Kaiserslautern, Kaiserslautern, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "M.",
"surname": "Kim",
"fullName": "M. Kim",
"affiliation": "Dept. of Comput. Sci., Univ. of Utah, Salt Lake City, UT, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "C. D.",
"surname": "Hansen",
"fullName": "C. D. Hansen",
"affiliation": "Dept. of Comput. Sci., Univ. of Utah, Salt Lake City, UT, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "N.",
"surname": "Kotava",
"fullName": "N. Kotava",
"affiliation": "Dept. of Comput. Sci., Tech. Univ. of Kaiserslautern, Kaiserslautern, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "A.",
"surname": "Gyulassy",
"fullName": "A. Gyulassy",
"affiliation": "Dept. of Comput. Sci., Univ. of Utah, Salt Lake City, UT, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2012-09-01 00:00:00",
"pubType": "trans",
"pages": "1549-1562",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ipdps/2012/4675/0/4675a484",
"title": "The Parallel Computation of Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2012/4675a484/12OmNrFBQ1B",
"parentPublication": {
"id": "proceedings/ipdps/2012/4675/0",
"title": "Parallel and Distributed Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciap/2007/2877/0/28770337",
"title": "Multi-resolution Morse-Smale Complexes for Terrain Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/iciap/2007/28770337/12OmNsbY6Tz",
"parentPublication": {
"id": "proceedings/iciap/2007/2877/0",
"title": "2007 14th International Conference on Image Analysis and Processing - ICIAP 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2005/2379/0/01563237",
"title": "Volumetric data analysis using Morse-Smale complexes",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2005/01563237/12OmNxaw5b1",
"parentPublication": {
"id": "proceedings/smi/2005/2379/0",
"title": "Proceedings. International Conference on Shape Modeling and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/04376172",
"title": "Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/04376172/13rRUwj7cp4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875918",
"title": "Conforming Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875918/13rRUwjGoLG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/10/ttg2012101757",
"title": "Parallel Computation of 2D Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/2012/10/ttg2012101757/13rRUxASuSL",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122014",
"title": "Computing Morse-Smale Complexes with Accurate Geometry",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122014/13rRUxZzAhE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440824",
"title": "Shared-Memory Parallel Computation of Morse-Smale Complexes with Improved Accuracy",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440824/17D45Xh13tG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09773959",
"title": "A GPU Parallel Algorithm for Computing Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09773959/1DjDpvFkiwE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a036",
"title": "GPU Parallel Computation of Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a036/1qRO66SHgwU",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012091381",
"articleId": "13rRUwjGoLD",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06051431",
"articleId": "13rRUx0gev6",
"__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": "17D45Xh13tG",
"doi": "10.1109/TVCG.2018.2864848",
"abstract": "Topological techniques have proven to be a powerful tool in the analysis and visualization of large-scale scientific data. In particular, the Morse-Smale complex and its various components provide a rich framework for robust feature definition and computation. Consequently, there now exist a number of approaches to compute Morse-Smale complexes for large-scale data in parallel. However, existing techniques are based on discrete concepts which produce the correct topological structure but are known to introduce grid artifacts in the resulting geometry. Here, we present a new approach that combines parallel streamline computation with combinatorial methods to construct a high-quality discrete Morse-Smale complex. In addition to being invariant to the orientation of the underlying grid, this algorithm allows users to selectively build a subset of features using high-quality geometry. In particular, a user may specifically select which ascending/descending manifolds are reconstructed with improved accuracy, focusing computational effort where it matters for subsequent analysis. This approach computes Morse-Smale complexes for larger data than previously feasible with significant speedups. We demonstrate and validate our approach using several examples from a variety of different scientific domains, and evaluate the performance of our method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Topological techniques have proven to be a powerful tool in the analysis and visualization of large-scale scientific data. In particular, the Morse-Smale complex and its various components provide a rich framework for robust feature definition and computation. Consequently, there now exist a number of approaches to compute Morse-Smale complexes for large-scale data in parallel. However, existing techniques are based on discrete concepts which produce the correct topological structure but are known to introduce grid artifacts in the resulting geometry. Here, we present a new approach that combines parallel streamline computation with combinatorial methods to construct a high-quality discrete Morse-Smale complex. In addition to being invariant to the orientation of the underlying grid, this algorithm allows users to selectively build a subset of features using high-quality geometry. In particular, a user may specifically select which ascending/descending manifolds are reconstructed with improved accuracy, focusing computational effort where it matters for subsequent analysis. This approach computes Morse-Smale complexes for larger data than previously feasible with significant speedups. We demonstrate and validate our approach using several examples from a variety of different scientific domains, and evaluate the performance of our method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Topological techniques have proven to be a powerful tool in the analysis and visualization of large-scale scientific data. In particular, the Morse-Smale complex and its various components provide a rich framework for robust feature definition and computation. Consequently, there now exist a number of approaches to compute Morse-Smale complexes for large-scale data in parallel. However, existing techniques are based on discrete concepts which produce the correct topological structure but are known to introduce grid artifacts in the resulting geometry. Here, we present a new approach that combines parallel streamline computation with combinatorial methods to construct a high-quality discrete Morse-Smale complex. In addition to being invariant to the orientation of the underlying grid, this algorithm allows users to selectively build a subset of features using high-quality geometry. In particular, a user may specifically select which ascending/descending manifolds are reconstructed with improved accuracy, focusing computational effort where it matters for subsequent analysis. This approach computes Morse-Smale complexes for larger data than previously feasible with significant speedups. We demonstrate and validate our approach using several examples from a variety of different scientific domains, and evaluate the performance of our method.",
"title": "Shared-Memory Parallel Computation of Morse-Smale Complexes with Improved Accuracy",
"normalizedTitle": "Shared-Memory Parallel Computation of Morse-Smale Complexes with Improved Accuracy",
"fno": "08440824",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Parallel Processing",
"Shared Memory Systems",
"Large Scale Scientific Data",
"Shared Memory Parallel Computation",
"Improved Accuracy",
"High Quality Discrete Morse Smale Complex",
"Robust Feature Definition",
"Geometry",
"Manifolds",
"Feature Extraction",
"Robustness",
"Isosurfaces",
"Tools",
"Morse Complex",
"Parallel Computation",
"Topology",
"Accurate Geometry"
],
"authors": [
{
"givenName": "Attila",
"surname": "Gyulassy",
"fullName": "Attila Gyulassy",
"affiliation": "SCI InstituteUniversity of Utah",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peer-Timo",
"surname": "Bremer",
"fullName": "Peer-Timo Bremer",
"affiliation": "Lawrence Livermore National Lab",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Valerio",
"surname": "Pascucci",
"fullName": "Valerio Pascucci",
"affiliation": "SCI InstituteUniversity of Utah",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "1183-1192",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iciap/2007/2877/0/28770337",
"title": "Multi-resolution Morse-Smale Complexes for Terrain Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/iciap/2007/28770337/12OmNsbY6Tz",
"parentPublication": {
"id": "proceedings/iciap/2007/2877/0",
"title": "2007 14th International Conference on Image Analysis and Processing - ICIAP 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsa/2008/3243/0/3243a441",
"title": "Multi-Scale 3D Morse Complexes",
"doi": null,
"abstractUrl": "/proceedings-article/iccsa/2008/3243a441/12OmNwFRpbe",
"parentPublication": {
"id": "proceedings/iccsa/2008/3243/0",
"title": "2008 International Conference on Computational Sciences and Its Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2005/2379/0/01563237",
"title": "Volumetric data analysis using Morse-Smale complexes",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2005/01563237/12OmNxaw5b1",
"parentPublication": {
"id": "proceedings/smi/2005/2379/0",
"title": "Proceedings. International Conference on Shape Modeling and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/04376172",
"title": "Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/04376172/13rRUwj7cp4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875918",
"title": "Conforming Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875918/13rRUwjGoLG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/10/ttg2012101757",
"title": "Parallel Computation of 2D Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/2012/10/ttg2012101757/13rRUxASuSL",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122014",
"title": "Computing Morse-Smale Complexes with Accurate Geometry",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122014/13rRUxZzAhE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/09/06065731",
"title": "Direct Feature Visualization Using Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/2012/09/06065731/13rRUyv53Fn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09773959",
"title": "A GPU Parallel Algorithm for Computing Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09773959/1DjDpvFkiwE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a036",
"title": "GPU Parallel Computation of Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a036/1qRO66SHgwU",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440081",
"articleId": "17D45WrVg0l",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440822",
"articleId": "17D45Vw15wK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBNM93d",
"title": "Nov.",
"year": "2015",
"issueNum": "11",
"idPrefix": "tg",
"pubType": "journal",
"volume": "21",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwI5U2K",
"doi": "10.1109/TVCG.2015.2459831",
"abstract": "In this work, we present a new automatic system for scene reconstruction of high-level structural models. We start with identifying planar regions in depth images obtained with a SLAM system. Our main contribution is an approach which identifies constraints such as incidence and orthogonality of planar surfaces and uses them in an incremental optimization framework to extract high-level structural models. The result is a manifold mesh with a low number of polygons, immediately useful in many Augmented Reality applications such as inspection, interior design or spatial interaction.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this work, we present a new automatic system for scene reconstruction of high-level structural models. We start with identifying planar regions in depth images obtained with a SLAM system. Our main contribution is an approach which identifies constraints such as incidence and orthogonality of planar surfaces and uses them in an incremental optimization framework to extract high-level structural models. The result is a manifold mesh with a low number of polygons, immediately useful in many Augmented Reality applications such as inspection, interior design or spatial interaction.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this work, we present a new automatic system for scene reconstruction of high-level structural models. We start with identifying planar regions in depth images obtained with a SLAM system. Our main contribution is an approach which identifies constraints such as incidence and orthogonality of planar surfaces and uses them in an incremental optimization framework to extract high-level structural models. The result is a manifold mesh with a low number of polygons, immediately useful in many Augmented Reality applications such as inspection, interior design or spatial interaction.",
"title": "Structural Modeling from Depth Images",
"normalizedTitle": "Structural Modeling from Depth Images",
"fno": "07165661",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Augmented Reality",
"Computational Geometry",
"Image Reconstruction",
"Mesh Generation",
"SLAM Robots",
"Solid Modelling",
"Structural Modeling",
"Depth Image",
"Automatic System",
"Scene Reconstruction",
"High Level Structural Model",
"Planar Region",
"SLAM System",
"Planar Surface",
"Incremental Optimization Framework",
"Manifold Mesh",
"Polygon",
"Augmented Reality Application",
"Three Dimensional Displays",
"Image Reconstruction",
"Computational Modeling",
"Simultaneous Localization And Mapping",
"Feature Extraction",
"Solid Modeling",
"Cameras",
"Structural Modeling",
"Geometric Scene Understanding",
"Topology Construction",
"Structural Modeling",
"Geometric Scene Understanding",
"Topology Construction"
],
"authors": [
{
"givenName": "Thanh",
"surname": "Nguyen",
"fullName": "Thanh Nguyen",
"affiliation": "Graz University of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gerhard",
"surname": "Reitmayr",
"fullName": "Gerhard Reitmayr",
"affiliation": "Qualcomm Research Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dieter",
"surname": "Schmalstieg",
"fullName": "Dieter Schmalstieg",
"affiliation": "Graz University of Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2015-11-01 00:00:00",
"pubType": "trans",
"pages": "1230-1240",
"year": "2015",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccvw/2017/1034/0/1034a912",
"title": "3D Scene Mesh from CNN Depth Predictions and Sparse Monocular SLAM",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034a912/12OmNvD8RuE",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2015/8332/0/8332a607",
"title": "Reconstructing Street-Scenes in Real-Time from a Driving Car",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2015/8332a607/12OmNvm6VJS",
"parentPublication": {
"id": "proceedings/3dv/2015/8332/0",
"title": "2015 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbr-lars-r/2016/3656/0/07783496",
"title": "Object Subtraction Planar RGB-D SLAM",
"doi": null,
"abstractUrl": "/proceedings-article/sbr-lars-r/2016/07783496/12OmNxwENic",
"parentPublication": {
"id": "proceedings/sbr-lars-r/2016/3656/0",
"title": "2016 XIII Latin-American Robotics Symposium and IV Brazilian Robotics Symposium (LARS/SBR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457g565",
"title": "CNN-SLAM: Real-Time Dense Monocular SLAM with Learned Depth Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457g565/12OmNzTH0Qa",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2018/8425/0/842500a616",
"title": "Multi-planar Monocular Reconstruction of Manhattan Indoor Scenes",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2018/842500a616/17D45XvMcbo",
"parentPublication": {
"id": "proceedings/3dv/2018/8425/0",
"title": "2018 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2022/9062/0/09956576",
"title": "Joint Self-Supervised Monocular Depth Estimation and SLAM",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2022/09956576/1IHpbIpwRfW",
"parentPublication": {
"id": "proceedings/icpr/2022/9062/0",
"title": "2022 26th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hdis/2022/9144/0/09991394",
"title": "Pseudo Depth Maps for RGB-D SLAM",
"doi": null,
"abstractUrl": "/proceedings-article/hdis/2022/09991394/1JwQ1uhFF4s",
"parentPublication": {
"id": "proceedings/hdis/2022/9144/0",
"title": "2022 International Conference on High Performance Big Data and Intelligent Systems (HDIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09496211",
"title": "PlaneFusion: Real-Time Indoor Scene Reconstruction With Planar Prior",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09496211/1vyjumhb4ZO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/11/09521742",
"title": "Linear RGB-D SLAM for Structured Environments",
"doi": null,
"abstractUrl": "/journal/tp/2022/11/09521742/1wkrmZrcdcQ",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2021/2688/0/268800b362",
"title": "DSP-SLAM: Object Oriented SLAM with Deep Shape Priors",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2021/268800b362/1zWEhxN28YU",
"parentPublication": {
"id": "proceedings/3dv/2021/2688/0",
"title": "2021 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07164338",
"articleId": "13rRUIIVlkk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07165673",
"articleId": "13rRUxNEqPX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgCK",
"name": "ttg201511-07165661s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201511-07165661s1.zip",
"extension": "zip",
"size": "53.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": "1JevCrH10vS",
"doi": "10.1109/TVCG.2022.3230369",
"abstract": "Textureless objects, repetitive patterns and limited computational resources pose significant challenges to man-made structure reconstruction from images, because feature-points-based reconstruction methods usually fail due to the lack of distinct texture or ambiguous point matches. Meanwhile multi-view stereo approaches also suffer from high computational complexity. In this paper, we present a new framework to reconstruct 3D surfaces for buildings from multi-view images by leveraging another fundamental geometric primitive: line segments. To this end, we first propose a new multi-resolution line segment detector to extract 2D line segments from each image. Then, we construct a 3D line cloud by introducing an improved Line3D++ algorithm to match 2D line segments from different images. Finally, we reconstruct a complete and manifold surface mesh from 3D line segments by formulating a <italic>Bayesian probabilistic modeling problem</italic>, which accurately generates a set of underlying planes. This output model is simple and has low performance requirements for hardware devices. Experimental results demonstrate the validity of the proposed approach and its ability to generate abstract and compact surface meshes from the 3D line cloud with low computational costs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Textureless objects, repetitive patterns and limited computational resources pose significant challenges to man-made structure reconstruction from images, because feature-points-based reconstruction methods usually fail due to the lack of distinct texture or ambiguous point matches. Meanwhile multi-view stereo approaches also suffer from high computational complexity. In this paper, we present a new framework to reconstruct 3D surfaces for buildings from multi-view images by leveraging another fundamental geometric primitive: line segments. To this end, we first propose a new multi-resolution line segment detector to extract 2D line segments from each image. Then, we construct a 3D line cloud by introducing an improved Line3D++ algorithm to match 2D line segments from different images. Finally, we reconstruct a complete and manifold surface mesh from 3D line segments by formulating a <italic>Bayesian probabilistic modeling problem</italic>, which accurately generates a set of underlying planes. This output model is simple and has low performance requirements for hardware devices. Experimental results demonstrate the validity of the proposed approach and its ability to generate abstract and compact surface meshes from the 3D line cloud with low computational costs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Textureless objects, repetitive patterns and limited computational resources pose significant challenges to man-made structure reconstruction from images, because feature-points-based reconstruction methods usually fail due to the lack of distinct texture or ambiguous point matches. Meanwhile multi-view stereo approaches also suffer from high computational complexity. In this paper, we present a new framework to reconstruct 3D surfaces for buildings from multi-view images by leveraging another fundamental geometric primitive: line segments. To this end, we first propose a new multi-resolution line segment detector to extract 2D line segments from each image. Then, we construct a 3D line cloud by introducing an improved Line3D++ algorithm to match 2D line segments from different images. Finally, we reconstruct a complete and manifold surface mesh from 3D line segments by formulating a Bayesian probabilistic modeling problem, which accurately generates a set of underlying planes. This output model is simple and has low performance requirements for hardware devices. Experimental results demonstrate the validity of the proposed approach and its ability to generate abstract and compact surface meshes from the 3D line cloud with low computational costs.",
"title": "Line-Based 3D Building Abstraction and Polygonal Surface Reconstruction From Images",
"normalizedTitle": "Line-Based 3D Building Abstraction and Polygonal Surface Reconstruction From Images",
"fno": "09992129",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Three Dimensional Displays",
"Image Reconstruction",
"Surface Reconstruction",
"Image Segmentation",
"Solid Modeling",
"Buildings",
"Point Cloud Compression",
"3 D Reconstruction",
"3 D Line Cloud",
"Scene Abstraction",
"Polygonal Mesh Model"
],
"authors": [
{
"givenName": "Jianwei",
"surname": "Guo",
"fullName": "Jianwei Guo",
"affiliation": "Institute of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yanchao",
"surname": "Liu",
"fullName": "Yanchao Liu",
"affiliation": "Shenzhen Key Laboratory of Visual Computing and Analytics (VisuCA), Shenzhen Institute of Advanced Technology (SIAT), Chinese Academy of Sciences, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xin",
"surname": "Song",
"fullName": "Xin Song",
"affiliation": "Shenzhen Key Laboratory of Visual Computing and Analytics (VisuCA), Shenzhen Institute of Advanced Technology (SIAT), Chinese Academy of Sciences, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haoyu",
"surname": "Liu",
"fullName": "Haoyu Liu",
"affiliation": "Shenzhen Key Laboratory of Visual Computing and Analytics (VisuCA), Shenzhen Institute of Advanced Technology (SIAT), Chinese Academy of Sciences, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaopeng",
"surname": "Zhang",
"fullName": "Xiaopeng Zhang",
"affiliation": "Institute of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhanglin",
"surname": "Cheng",
"fullName": "Zhanglin Cheng",
"affiliation": "Shenzhen Key Laboratory of Visual Computing and Analytics (VisuCA), Shenzhen Institute of Advanced Technology (SIAT), Chinese Academy of Sciences, Shenzhen, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-12-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/3dv/2015/8332/0/8332a264",
"title": "3D Surface Reconstruction from Point-and-Line Cloud",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2015/8332a264/12OmNrAMEVf",
"parentPublication": {
"id": "proceedings/3dv/2015/8332/0",
"title": "2015 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis/2011/4401/0/4401a194",
"title": "Stereoscopic Building Reconstruction Using High-Resolution Satellite Image Data",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2011/4401a194/12OmNrJRPiF",
"parentPublication": {
"id": "proceedings/icis/2011/4401/0",
"title": "Computer and Information Science, ACIS International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460427",
"title": "Shape reconstruction with globally-optimized surface point selection",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460427/12OmNwtEEGb",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2012/1226/0/189P2A39",
"title": "Schematic surface reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/189P2A39/12OmNyNzhy9",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200f631",
"title": "Adaptive Surface Reconstruction with Multiscale Convolutional Kernels",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200f631/1BmI5bvaltC",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09839681",
"title": "SSRNet: Scalable 3D Surface Reconstruction Network",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09839681/1FisL8u19du",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600g292",
"title": "POCO: Point Convolution for Surface Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600g292/1H0KAZrauEo",
"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/5555/01/10093999",
"title": "ANISE: Assembly-based Neural Implicit Surface rEconstruction",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10093999/1M80HueHnJS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2019/3131/0/313100a553",
"title": "Surface Reconstruction from 3D Line Segments",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2019/313100a553/1ezRDwCMQNO",
"parentPublication": {
"id": "proceedings/3dv/2019/3131/0",
"title": "2019 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2021/2688/0/268800b432",
"title": "Efficiently Distributed Watertight Surface Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2021/268800b432/1zWE7llklAA",
"parentPublication": {
"id": "proceedings/3dv/2021/2688/0",
"title": "2021 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09992151",
"articleId": "1JevBLSiUqA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09993760",
"articleId": "1JgvW1I7Gko",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1JilX29jKhO",
"name": "ttg555501-09992129s1-supp1-3230369.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09992129s1-supp1-3230369.pdf",
"extension": "pdf",
"size": "10.2 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwCsdFw",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tk",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1M80E3kH1XG",
"doi": "10.1109/TKDE.2023.3264971",
"abstract": "Joint network topology inference represents a canonical problem of jointly learning multiple graph Laplacian matrices from heterogeneous graph signals. In such a problem, a widely employed assumption is that of a simple common component shared among multiple graphs. However, in practice, a more intricate topological pattern, comprising simultaneously of <italic>homogeneous</italic> and <italic>heterogeneous</italic> components, would exhibit in multiple graphs. In this paper, we propose a general graph estimator based on a novel structural fusion regularization that enables us to jointly learn multiple graphs with such complex topological patterns, and enjoys rigorous theoretical guarantees. Specifically, in the proposed regularization term, the structural similarity among graphs is characterized by a Gram matrix, which enables us to flexibly model different types of network structural similarities through different Gram matrix choices. Algorithmically, the regularization term, coupling the parameters together, makes the formulated optimization problem intractable, and thus, we develop an implementable algorithm based on the alternating direction method of multipliers (ADMM) to solve it. Theoretically, non-asymptotic statistical analysis is provided, which precisely characterizes the minimum sample size required for the consistency of the graph estimator. This analysis also provides high-probability bounds on the estimation error as a function of graph structural similarities and other key problem parameters. Finally, the superior performance of the proposed method is demonstrated through simulated and real data examples.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Joint network topology inference represents a canonical problem of jointly learning multiple graph Laplacian matrices from heterogeneous graph signals. In such a problem, a widely employed assumption is that of a simple common component shared among multiple graphs. However, in practice, a more intricate topological pattern, comprising simultaneously of <italic>homogeneous</italic> and <italic>heterogeneous</italic> components, would exhibit in multiple graphs. In this paper, we propose a general graph estimator based on a novel structural fusion regularization that enables us to jointly learn multiple graphs with such complex topological patterns, and enjoys rigorous theoretical guarantees. Specifically, in the proposed regularization term, the structural similarity among graphs is characterized by a Gram matrix, which enables us to flexibly model different types of network structural similarities through different Gram matrix choices. Algorithmically, the regularization term, coupling the parameters together, makes the formulated optimization problem intractable, and thus, we develop an implementable algorithm based on the alternating direction method of multipliers (ADMM) to solve it. Theoretically, non-asymptotic statistical analysis is provided, which precisely characterizes the minimum sample size required for the consistency of the graph estimator. This analysis also provides high-probability bounds on the estimation error as a function of graph structural similarities and other key problem parameters. Finally, the superior performance of the proposed method is demonstrated through simulated and real data examples.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Joint network topology inference represents a canonical problem of jointly learning multiple graph Laplacian matrices from heterogeneous graph signals. In such a problem, a widely employed assumption is that of a simple common component shared among multiple graphs. However, in practice, a more intricate topological pattern, comprising simultaneously of homogeneous and heterogeneous components, would exhibit in multiple graphs. In this paper, we propose a general graph estimator based on a novel structural fusion regularization that enables us to jointly learn multiple graphs with such complex topological patterns, and enjoys rigorous theoretical guarantees. Specifically, in the proposed regularization term, the structural similarity among graphs is characterized by a Gram matrix, which enables us to flexibly model different types of network structural similarities through different Gram matrix choices. Algorithmically, the regularization term, coupling the parameters together, makes the formulated optimization problem intractable, and thus, we develop an implementable algorithm based on the alternating direction method of multipliers (ADMM) to solve it. Theoretically, non-asymptotic statistical analysis is provided, which precisely characterizes the minimum sample size required for the consistency of the graph estimator. This analysis also provides high-probability bounds on the estimation error as a function of graph structural similarities and other key problem parameters. Finally, the superior performance of the proposed method is demonstrated through simulated and real data examples.",
"title": "Joint Network Topology Inference via Structural Fusion Regularization",
"normalizedTitle": "Joint Network Topology Inference via Structural Fusion Regularization",
"fno": "10093994",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Network Topology",
"Laplace Equations",
"Topology",
"Task Analysis",
"Statistical Analysis",
"Social Networking Online",
"Correlation",
"Network Topology Inference",
"Graph Laplacian",
"Graph Signals",
"Regularization",
"Non Asymptotic Statistical Analysis"
],
"authors": [
{
"givenName": "Yanli",
"surname": "Yuan",
"fullName": "Yanli Yuan",
"affiliation": "School of Cyberspace Science and Technology, Beijing Institute of Technology, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "De Wen",
"surname": "Soh",
"fullName": "De Wen Soh",
"affiliation": "Singapore University of Technology and Design, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kun",
"surname": "Guo",
"fullName": "Kun Guo",
"affiliation": "Shanghai Key Laboratory of Multidimensional Information Processing, School of Communications and Electronics Engineering, East China Normal University, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zehui",
"surname": "Xiong",
"fullName": "Zehui Xiong",
"affiliation": "Singapore University of Technology and Design, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tony Q. S.",
"surname": "Quek",
"fullName": "Tony Q. S. Quek",
"affiliation": "Singapore University of Technology and Design, Singapore",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "1-18",
"year": "5555",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icassp/2004/8484/3/01326716",
"title": "Tikhonov regularization and semi-supervised learning on large graphs",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01326716/12OmNB7Lvyz",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/3",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761617",
"title": "Nonlocal graph regularization for image colorization",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761617/12OmNwF0C7T",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2017/05/07820177",
"title": "Learning on Big Graph: Label Inference and Regularization with Anchor Hierarchy",
"doi": null,
"abstractUrl": "/journal/tk/2017/05/07820177/13rRUwj7cpD",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/06/07167718",
"title": "Image-Based Building Regularization Using Structural Linear Features",
"doi": null,
"abstractUrl": "/journal/tg/2016/06/07167718/13rRUy0qnGo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2021/2398/0/239800b234",
"title": "Semi-Supervised Graph Attention Networks for Event Representation Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2021/239800b234/1Aqx7HAYgTK",
"parentPublication": {
"id": "proceedings/icdm/2021/2398/0",
"title": "2021 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10017356",
"title": "Dual Structural Consistency Preserving Community Detection on Social Networks",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10017356/1JYYXraZFdu",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi/2019/6934/0/08909425",
"title": "Structural Graph Representations based on Multiscale Local Network Topologies",
"doi": null,
"abstractUrl": "/proceedings-article/wi/2019/08909425/1feboHBcOxG",
"parentPublication": {
"id": "proceedings/wi/2019/6934/0",
"title": "2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2020/1331/0/09102763",
"title": "Topology Discriminative Pooling via Graph Kernel Derived Nodes and Edges Co-Embedding",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2020/09102763/1kwr92ZHR0Q",
"parentPublication": {
"id": "proceedings/icme/2020/1331/0",
"title": "2020 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/02/09361263",
"title": "<monospace><bold>PINE</bold></monospace>: Universal Deep Embedding for Graph Nodes via Partial Permutation Invariant Set Functions",
"doi": null,
"abstractUrl": "/journal/tp/2022/02/09361263/1rsexdBagFO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2020/6251/0/09377854",
"title": "Large-scale Sparse Structural Node Representation",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09377854/1s648Ru48Io",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10093108",
"articleId": "1M61PKHe1hu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10093938",
"articleId": "1M80Em7CNMs",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1M9lHuRh8zu",
"name": "ttk555501-010093994s1-supp1-3264971.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttk555501-010093994s1-supp1-3264971.pdf",
"extension": "pdf",
"size": "287 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1txPs9C3tok",
"title": "June",
"year": "2021",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1qLhYrSA4ve",
"doi": "10.1109/TVCG.2021.3055242",
"abstract": "Voxel based modeling is a very attractive way to represent complex multi-material objects. Beside artistic choices of pixel/voxel arts, representing objects as voxels allows efficient and dynamic interactions with the scene. For geometry processing purposes, many applications in material sciences, medical imaging or numerical simulation rely on a regular partitioning of the space with labeled voxels. In this article, we consider a variational approach to reconstruct interfaces in multi-labeled digital images. This approach efficiently produces piecewise smooth quadrangulated surfaces with some theoretical stability guarantee. Non-manifold parts at intersecting interfaces are handled naturally by our model. We illustrate the strength of our tool for digital surface regularization, as well as voxel art regularization by transferring colorimetric information to regularized quads and computing isotropic geodesic on digital surfaces.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Voxel based modeling is a very attractive way to represent complex multi-material objects. Beside artistic choices of pixel/voxel arts, representing objects as voxels allows efficient and dynamic interactions with the scene. For geometry processing purposes, many applications in material sciences, medical imaging or numerical simulation rely on a regular partitioning of the space with labeled voxels. In this article, we consider a variational approach to reconstruct interfaces in multi-labeled digital images. This approach efficiently produces piecewise smooth quadrangulated surfaces with some theoretical stability guarantee. Non-manifold parts at intersecting interfaces are handled naturally by our model. We illustrate the strength of our tool for digital surface regularization, as well as voxel art regularization by transferring colorimetric information to regularized quads and computing isotropic geodesic on digital surfaces.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Voxel based modeling is a very attractive way to represent complex multi-material objects. Beside artistic choices of pixel/voxel arts, representing objects as voxels allows efficient and dynamic interactions with the scene. For geometry processing purposes, many applications in material sciences, medical imaging or numerical simulation rely on a regular partitioning of the space with labeled voxels. In this article, we consider a variational approach to reconstruct interfaces in multi-labeled digital images. This approach efficiently produces piecewise smooth quadrangulated surfaces with some theoretical stability guarantee. Non-manifold parts at intersecting interfaces are handled naturally by our model. We illustrate the strength of our tool for digital surface regularization, as well as voxel art regularization by transferring colorimetric information to regularized quads and computing isotropic geodesic on digital surfaces.",
"title": "Digital Surface Regularization With Guarantees",
"normalizedTitle": "Digital Surface Regularization With Guarantees",
"fno": "09339892",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Geometry",
"Differential Geometry",
"Image Resolution",
"Solid Modelling",
"Material Sciences",
"Medical Imaging",
"Numerical Simulation",
"Regular Partitioning",
"Variational Approach",
"Multilabeled Digital Images",
"Piecewise Smooth Quadrangulated Surfaces",
"Theoretical Stability Guarantee",
"Digital Surface Regularization",
"Voxel Art Regularization",
"Complex Multimaterial Objects",
"Artistic Choices",
"Geometry Processing Purposes",
"Voxel Based Modeling",
"Pixel Voxel Arts",
"Isotropic Geodesic Computing",
"Surface Reconstruction",
"Image Reconstruction",
"Surface Treatment",
"Geometry",
"Sea Surface",
"Art",
"Three Dimensional Displays",
"Digital Geometry",
"Surface Reconstruction",
"Voxel Geometry Processing"
],
"authors": [
{
"givenName": "David",
"surname": "Coeurjolly",
"fullName": "David Coeurjolly",
"affiliation": "CNRS, Laboratoire LIRIS, Universite de Lyon, Lyon, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jacques-Olivier",
"surname": "Lachaud",
"fullName": "Jacques-Olivier Lachaud",
"affiliation": "Laboratoire LAMA, University of Savoy Mont Blanc - Chambery, Chambéry, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pierre",
"surname": "Gueth",
"fullName": "Pierre Gueth",
"affiliation": "Adobe Systems Inc, Paris, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": {
"isEnabled": true,
"codeDownloadUrl": "https://github.com/dcoeurjo/digital-surface-regularization-TVCG.git",
"codeRepositoryUrl": "https://github.com/dcoeurjo/digital-surface-regularization-TVCG",
"__typename": "ArticleReplicabilityType"
},
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2021-06-01 00:00:00",
"pubType": "trans",
"pages": "2896-2907",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/candar/2014/4152/0/4152a367",
"title": "A Memory Efficient Parallel Method for Voxel-Based Multiview Stereo",
"doi": null,
"abstractUrl": "/proceedings-article/candar/2014/4152a367/12OmNAJDBw6",
"parentPublication": {
"id": "proceedings/candar/2014/4152/0",
"title": "2014 Second International Symposium on Computing and Networking (CANDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457e560",
"title": "The Surfacing of Multiview 3D Drawings via Lofting and Occlusion Reasoning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457e560/12OmNvSbBzp",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391a397",
"title": "Thin Structure Estimation with Curvature Regularization",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391a397/12OmNvpNIwl",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2017/2610/0/261001a412",
"title": "Hierarchical Surface Prediction for 3D Object Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2017/261001a412/12OmNy4r3YL",
"parentPublication": {
"id": "proceedings/3dv/2017/2610/0",
"title": "2017 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2013/2576/0/06814976",
"title": "TV-L1 Optimization for B-Spline Surface Reconstruction with Sharp Features",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2013/06814976/12OmNyrZLDi",
"parentPublication": {
"id": "proceedings/cad-graphics/2013/2576/0",
"title": "2013 International Conference on Computer-Aided Design and Computer Graphics (CAD/Graphics)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2001/1227/0/12270234",
"title": "Accurate Surface Voxelization for Manipulating Volumetric Surfaces and Solids with Application in Simulating Musculoskeletal Surgery",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2001/12270234/12OmNz4BdqF",
"parentPublication": {
"id": "proceedings/pg/2001/1227/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2020/06/08630046",
"title": "Hierarchical Surface Prediction",
"doi": null,
"abstractUrl": "/journal/tp/2020/06/08630046/17D45Xcttk2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a758",
"title": "High-Quality Surface-Based 3D Reconstruction Using 2.5D Maps",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a758/1CJf9OI1NBe",
"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": "trans/tg/5555/01/09969571",
"title": "Vox-Surf: Voxel-Based Implicit Surface Representation",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09969571/1IMidH7hZhC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2019/3131/0/313100a553",
"title": "Surface Reconstruction from 3D Line Segments",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2019/313100a553/1ezRDwCMQNO",
"parentPublication": {
"id": "proceedings/3dv/2019/3131/0",
"title": "2019 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08919983",
"articleId": "1fsFpltkVUY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09349198",
"articleId": "1qYmbJluuBi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1txPD4HkgZG",
"name": "ttg202106-09339892s1-supp2-3055242.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202106-09339892s1-supp2-3055242.pdf",
"extension": "pdf",
"size": "9.47 MB",
"__typename": "WebExtraType"
},
{
"id": "1txPDDbAzPG",
"name": "ttg202106-09339892s1-supp1-3055242.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202106-09339892s1-supp1-3055242.mp4",
"extension": "mp4",
"size": "44 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzcxZdC",
"title": "October",
"year": "2011",
"issueNum": "10",
"idPrefix": "tp",
"pubType": "journal",
"volume": "33",
"label": "October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwh80vI",
"doi": "10.1109/TPAMI.2011.46",
"abstract": "Tone Mapping is the problem of compressing the range of a High-Dynamic Range image so that it can be displayed in a Low-Dynamic Range screen, without losing or introducing novel details: The final image should produce in the observer a sensation as close as possible to the perception produced by the real-world scene. We propose a tone mapping operator with two stages. The first stage is a global method that implements visual adaptation, based on experiments on human perception, in particular we point out the importance of cone saturation. The second stage performs local contrast enhancement, based on a variational model inspired by color vision phenomenology. We evaluate this method with a metric validated by psychophysical experiments and, in terms of this metric, our method compares very well with the state of the art.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Tone Mapping is the problem of compressing the range of a High-Dynamic Range image so that it can be displayed in a Low-Dynamic Range screen, without losing or introducing novel details: The final image should produce in the observer a sensation as close as possible to the perception produced by the real-world scene. We propose a tone mapping operator with two stages. The first stage is a global method that implements visual adaptation, based on experiments on human perception, in particular we point out the importance of cone saturation. The second stage performs local contrast enhancement, based on a variational model inspired by color vision phenomenology. We evaluate this method with a metric validated by psychophysical experiments and, in terms of this metric, our method compares very well with the state of the art.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Tone Mapping is the problem of compressing the range of a High-Dynamic Range image so that it can be displayed in a Low-Dynamic Range screen, without losing or introducing novel details: The final image should produce in the observer a sensation as close as possible to the perception produced by the real-world scene. We propose a tone mapping operator with two stages. The first stage is a global method that implements visual adaptation, based on experiments on human perception, in particular we point out the importance of cone saturation. The second stage performs local contrast enhancement, based on a variational model inspired by color vision phenomenology. We evaluate this method with a metric validated by psychophysical experiments and, in terms of this metric, our method compares very well with the state of the art.",
"title": "An Analysis of Visual Adaptation and Contrast Perception for Tone Mapping",
"normalizedTitle": "An Analysis of Visual Adaptation and Contrast Perception for Tone Mapping",
"fno": "ttp2011102002",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Visual Perception",
"Data Compression",
"Image Coding",
"Screens Display",
"Color Vision Phenomenology",
"Visual Adaptation",
"Contrast Perception",
"Tone Mapping",
"High Dynamic Range Image Compression",
"Low Dynamic Range Screen",
"Observer",
"Cone Saturation",
"Image Color Analysis",
"Mathematical Model",
"Visualization",
"Equations",
"Retina",
"Photoreceptors",
"Adaptation Model",
"Weber Fechner Contrast",
"High Dynamic Range Images",
"Tone Mapping",
"Naka Rushton Equation"
],
"authors": [
{
"givenName": "V.",
"surname": "Caselles",
"fullName": "V. Caselles",
"affiliation": "Dept. de Tecnol. de la Inf. y las Comun., Univ. Pompeu Fabra, Barcelona, Spain",
"__typename": "ArticleAuthorType"
},
{
"givenName": "M.",
"surname": "Bertalmio",
"fullName": "M. Bertalmio",
"affiliation": "Dept. de Tecnol. de la Inf. y las Comun., Univ. Pompeu Fabra, Barcelona, Spain",
"__typename": "ArticleAuthorType"
},
{
"givenName": "E.",
"surname": "Provenzi",
"fullName": "E. Provenzi",
"affiliation": "Dept. de Tecnol. de la Inf. y las Comun., Univ. Pompeu Fabra, Barcelona, Spain",
"__typename": "ArticleAuthorType"
},
{
"givenName": "S.",
"surname": "Ferradans",
"fullName": "S. Ferradans",
"affiliation": "Dept. de Tecnol. de la Inf. y las Comun., Univ. Pompeu Fabra, Barcelona, Spain",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2011-10-01 00:00:00",
"pubType": "trans",
"pages": "2002-2012",
"year": "2011",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/snpd/2016/2239/0/07515907",
"title": "A layered tone-mapping operator based on contrast enhanced adaptive histogram equalization",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2016/07515907/12OmNAMbZEj",
"parentPublication": {
"id": "proceedings/snpd/2016/2239/0",
"title": "2016 17th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2008/3381/0/3381a256",
"title": "Real-Time Tone Mapping for High-Resolution HDR Images",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2008/3381a256/12OmNAlNiC2",
"parentPublication": {
"id": "proceedings/cw/2008/3381/0",
"title": "2008 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvmp/2009/3893/0/3893a091",
"title": "A New Tone Mapping Workflow for High Dynamic Range Content",
"doi": null,
"abstractUrl": "/proceedings-article/cvmp/2009/3893a091/12OmNqBtj0O",
"parentPublication": {
"id": "proceedings/cvmp/2009/3893/0",
"title": "2009 Conference for Visual Media Production",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2011/4541/0/4541a022",
"title": "Saliency Modulated High Dynamic Range Image Tone Mapping",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2011/4541a022/12OmNwDSdLL",
"parentPublication": {
"id": "proceedings/icig/2011/4541/0",
"title": "Image and Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109c676",
"title": "Noise-Insensitive Contrast Enhancement for Rendering High-Dynamic-Range Images",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109c676/12OmNyNQSO8",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvmp/2009/3893/0/3893a081",
"title": "A Multi-Modal Approach to Perceptual Tone Mapping",
"doi": null,
"abstractUrl": "/proceedings-article/cvmp/2009/3893a081/12OmNylboMl",
"parentPublication": {
"id": "proceedings/cvmp/2009/3893/0",
"title": "2009 Conference for Visual Media Production",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/04/ttg2010040663",
"title": "Globally Optimized Linear Windowed Tone Mapping",
"doi": null,
"abstractUrl": "/journal/tg/2010/04/ttg2010040663/13rRUxAAT7A",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/06/07167723",
"title": "Underexposed Video Enhancement via Perception-Driven Progressive Fusion",
"doi": null,
"abstractUrl": "/journal/tg/2016/06/07167723/13rRUxd2aZ5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2020/1485/0/09106057",
"title": "Tone Mapping Operators: Progressing Towards Semantic-Awareness",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2020/09106057/1kwqNfuVZLO",
"parentPublication": {
"id": "proceedings/icmew/2020/1485/0",
"title": "2020 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412070",
"title": "Explorable Tone Mapping Operators",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412070/1tmhy6Drk7C",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2011101991",
"articleId": "13rRUy2YLU2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2011102013",
"articleId": "13rRUxjQyiu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCbCrUN",
"title": "Dec.",
"year": "2013",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvyaf0",
"doi": "10.1109/TVCG.2013.175",
"abstract": "Presents the opening speaches and editorials from guest editors from the conference proceedings.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Presents the opening speaches and editorials from guest editors from the conference proceedings.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Presents the opening speaches and editorials from guest editors from the conference proceedings.",
"title": "Message from the Paper Chairs and Guest Editors",
"normalizedTitle": "Message from the Paper Chairs and Guest Editors",
"fno": "ttg20131200xi",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Special Issues And Sections",
"Meetings",
"Computer Graphics",
"Information Technology",
"Data Visualization",
"Special Issues And Sections",
"Meetings",
"Computer Graphics",
"Information Technology"
],
"authors": [],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "12",
"pubDate": "2013-12-01 00:00:00",
"pubType": "trans",
"pages": "xi-xiv",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "mags/cs/2016/02/mcs2016020006",
"title": "Guest Editors' introduction",
"doi": null,
"abstractUrl": "/magazine/cs/2016/02/mcs2016020006/13rRUEgs2Q2",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/04/ttg2013040000vi",
"title": "Message from the Paper Chairs and Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2013/04/ttg2013040000vi/13rRUILtJma",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/04/ttg2014040vi",
"title": "Message from the Paper Chairs and Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2014/04/ttg2014040vi/13rRUwI5Ug9",
"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": "trans/tg/2012/12/ttg201212000x",
"title": "Message from the Paper Chairs and Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg201212000x/13rRUxYIN49",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2013/04/mex2013040005",
"title": "Technological Challenges in Emergency Response [Guest editors' introduction]",
"doi": null,
"abstractUrl": "/magazine/ex/2013/04/mex2013040005/13rRUxbCbn4",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/04/ttg20120400vi",
"title": "Message from the Paper Chairs and Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2012/04/ttg20120400vi/13rRUxly9dS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/05/09754286",
"title": "IEEE VR 2022 Message from the Journal Paper Chairs and Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2022/05/09754286/1Cpd7Bwusk8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/11/08855105",
"title": "Message from the ISMAR 2019 Science and Technology Program Chairs and <italic>TVCG</italic> Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2019/11/08855105/1dNHma690d2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/05/09405530",
"title": "Message from the Program Chairs and Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2021/05/09405530/1sP1eDRuGMU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg201312000x",
"articleId": "13rRUxOve9J",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg20131200xv",
"articleId": "13rRUwgQpDu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyaoDzi",
"title": "April",
"year": "2012",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxly9dS",
"doi": "10.1109/TVCG.2012.51",
"abstract": "The articles in this special issue contain the full paper proceedings of the IEEE Virtual Reality Conference 2012 (IEEE VR 2012), held March 4-8, 2012 in Orange County, California.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The articles in this special issue contain the full paper proceedings of the IEEE Virtual Reality Conference 2012 (IEEE VR 2012), held March 4-8, 2012 in Orange County, California.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The articles in this special issue contain the full paper proceedings of the IEEE Virtual Reality Conference 2012 (IEEE VR 2012), held March 4-8, 2012 in Orange County, California.",
"title": "Message from the Paper Chairs and Guest Editors",
"normalizedTitle": "Message from the Paper Chairs and Guest Editors",
"fno": "ttg20120400vi",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Special Issues And Sections",
"Meetings",
"Virtual Reality"
],
"authors": [
{
"givenName": "Sabine",
"surname": "Coquillart",
"fullName": "Sabine Coquillart",
"affiliation": "INRIA, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Steven",
"surname": "Feiner",
"fullName": "Steven Feiner",
"affiliation": "Columbia University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kiyoshi",
"surname": "Kiyokawa",
"fullName": "Kiyoshi Kiyokawa",
"affiliation": "Osaka University, Japan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "04",
"pubDate": "2012-04-01 00:00:00",
"pubType": "trans",
"pages": "vi",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2013/04/ttg2013040000vi",
"title": "Message from the Paper Chairs and Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2013/04/ttg2013040000vi/13rRUILtJma",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/06/ttg2013060898",
"title": "Guest Editors' Introduction: Special Section on the IEEE Pacific Visualization Symposium 2012",
"doi": null,
"abstractUrl": "/journal/tg/2013/06/ttg2013060898/13rRUNvgziD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/04/ttg2014040vi",
"title": "Message from the Paper Chairs and Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2014/04/ttg2014040vi/13rRUwI5Ug9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/04/07064835",
"title": "Message from the VR Program Chairs and Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2015/04/07064835/13rRUwh80uB",
"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": "trans/tg/2012/12/ttg201212000x",
"title": "Message from the Paper Chairs and Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg201212000x/13rRUxYIN49",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/05/09754286",
"title": "IEEE VR 2022 Message from the Journal Paper Chairs and Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2022/05/09754286/1Cpd7Bwusk8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/11/09927176",
"title": "Message from the ISMAR 2022 Science and Technology Journal Program Chairs and TVCG Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2022/11/09927176/1HGJ8mlD3S8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/05/09405530",
"title": "Message from the Program Chairs and Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2021/05/09405530/1sP1eDRuGMU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/11/09591492",
"title": "Message from the ISMAR 2021 Science and Technology Journal Program Chairs and TVCG Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2021/11/09591492/1y2FvGMxBuM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg201204000v",
"articleId": "13rRUwbs2b0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012040vii",
"articleId": "13rRUNvgz9K",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwCaCzQ",
"title": "April-June",
"year": "2011",
"issueNum": "02",
"idPrefix": "mu",
"pubType": "magazine",
"volume": "18",
"label": "April-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgs2yK",
"doi": "10.1109/MMUL.2011.34",
"abstract": "Editor's NoteThis is my first column as editor of the Visions and Views column. I hope that with this column I can bring you ideas that are new and interesting. I want to open a dialog about issues that are important to our field, and could change the direction of our work. I don't intend to write most of the columns, and I am soliciting ideas. Please send me your suggestions, either for issues you would like to discuss, or nominate a colleague who has new and interesting ideas that deserve broader attention.—Malcolm Slaney",
"abstracts": [
{
"abstractType": "Regular",
"content": "Editor's NoteThis is my first column as editor of the Visions and Views column. I hope that with this column I can bring you ideas that are new and interesting. I want to open a dialog about issues that are important to our field, and could change the direction of our work. I don't intend to write most of the columns, and I am soliciting ideas. Please send me your suggestions, either for issues you would like to discuss, or nominate a colleague who has new and interesting ideas that deserve broader attention.—Malcolm Slaney",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Editor's NoteThis is my first column as editor of the Visions and Views column. I hope that with this column I can bring you ideas that are new and interesting. I want to open a dialog about issues that are important to our field, and could change the direction of our work. I don't intend to write most of the columns, and I am soliciting ideas. Please send me your suggestions, either for issues you would like to discuss, or nominate a colleague who has new and interesting ideas that deserve broader attention.—Malcolm Slaney",
"title": "Web-Scale Multimedia Analysis: Does Content Matter?",
"normalizedTitle": "Web-Scale Multimedia Analysis: Does Content Matter?",
"fno": "mmu2011020012",
"hasPdf": true,
"idPrefix": "mu",
"keywords": [
"Content Analysis",
"Metadata",
"Similarity",
"Recommendations",
"Multimedia And Graphics",
"Visions And Views"
],
"authors": [
{
"givenName": "Malcolm",
"surname": "Slaney",
"fullName": "Malcolm Slaney",
"affiliation": "Yahoo! Research and Stanford Center for Computer Research in Music and Acoustics",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2011-04-01 00:00:00",
"pubType": "mags",
"pages": "12-15",
"year": "2011",
"issn": "1070-986X",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ifip-networking/2016/8283/0/07497237",
"title": "Does scale, size, and locality matter? Evaluation of collaborative BGP security mechanisms",
"doi": null,
"abstractUrl": "/proceedings-article/ifip-networking/2016/07497237/12OmNvjyxzm",
"parentPublication": {
"id": "proceedings/ifip-networking/2016/8283/0",
"title": "2016 IFIP Networking Conference (IFIP Networking) and Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/infocom/1997/7780/0/77800990",
"title": "Earthworm: A Network Memory Management Technique for Large-Scale Distributed Multimedia Applications",
"doi": null,
"abstractUrl": "/proceedings-article/infocom/1997/77800990/12OmNwbLVox",
"parentPublication": {
"id": "proceedings/infocom/1997/7780/0",
"title": "IEEE Computer and Communications Societies, Annual Joint Conference of the",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2014/2504/0/2504a550",
"title": "Introduction to Social Media and E-Business Transformation Minitrack",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2014/2504a550/12OmNx9nGGd",
"parentPublication": {
"id": "proceedings/hicss/2014/2504/0",
"title": "2014 47th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/kyotodl/2000/1022/0/10220280",
"title": "Associating and Presenting Metadata of Digital Archive Objects in Virtual Spaces as Synchronized Multimedia Content",
"doi": null,
"abstractUrl": "/proceedings-article/kyotodl/2000/10220280/12OmNz5JC86",
"parentPublication": {
"id": "proceedings/kyotodl/2000/1022/0",
"title": "Digital Libraries: Research and Practice, Kyoto International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2006/05/c5068",
"title": "He's Baaack!",
"doi": null,
"abstractUrl": "/magazine/cs/2006/05/c5068/13rRUwhHcLW",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mu/2009/02/mmu2009020086",
"title": "How Much Multimedia Does a Modern Family Need?",
"doi": null,
"abstractUrl": "/magazine/mu/2009/02/mmu2009020086/13rRUyuNsCk",
"parentPublication": {
"id": "mags/mu",
"title": "IEEE MultiMedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mu/2011/03/mmu2011030004",
"title": "Precision-Recall Is Wrong for Multimedia",
"doi": null,
"abstractUrl": "/magazine/mu/2011/03/mmu2011030004/13rRUyuvRtW",
"parentPublication": {
"id": "mags/mu",
"title": "IEEE MultiMedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2018/9385/0/938500a609",
"title": "Leveraging Knowledge Graphs of Movies and Their Content for Web-Scale Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2018/938500a609/19RStzBpuWk",
"parentPublication": {
"id": "proceedings/sitis/2018/9385/0",
"title": "2018 14th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigmm/2022/5963/0/596300a125",
"title": "Leveraging Large-scale Multimedia Datasets to Refine Content Moderation Models",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2022/596300a125/1JvaJR7Tfqw",
"parentPublication": {
"id": "proceedings/bigmm/2022/5963/0",
"title": "2022 IEEE Eighth International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mmu2011020004",
"articleId": "13rRUyY291D",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mmu2011020016",
"articleId": "13rRUxC0SB1",
"__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": "13rRUILc8fb",
"doi": "10.1109/TVCG.2012.290",
"abstract": "A professional biography of Mary Czerwinski of Microsoft Research is presented. Her speech, which is not included, was entitled: \"Trends and Topics from the Last 17 Years at Microsoft Research.\"",
"abstracts": [
{
"abstractType": "Regular",
"content": "A professional biography of Mary Czerwinski of Microsoft Research is presented. Her speech, which is not included, was entitled: \"Trends and Topics from the Last 17 Years at Microsoft Research.\"",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A professional biography of Mary Czerwinski of Microsoft Research is presented. Her speech, which is not included, was entitled: \"Trends and Topics from the Last 17 Years at Microsoft Research.\"",
"title": "VisWeek 2012 Keynote Speaker",
"normalizedTitle": "VisWeek 2012 Keynote Speaker",
"fno": "ttg2012120xxi",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [
{
"givenName": "Mary",
"surname": "Czerwinski",
"fullName": "Mary Czerwinski",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "xxi-xxi",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dac/1982/020/0/01585468",
"title": "Conference Keynote Speaker",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1982/01585468/12OmNBA9oyO",
"parentPublication": {
"id": "proceedings/dac/1982/020/0",
"title": "19th Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2015/6879/0/07156348",
"title": "Keynote speaker",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156348/12OmNvlPkAl",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1983/0026/0/01585612",
"title": "Conference Keynote Speaker",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1983/01585612/12OmNxUdv5H",
"parentPublication": {
"id": "proceedings/dac/1983/0026/0",
"title": "Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dicta/2008/3456/0/3456z018",
"title": "Keynote Speaker: P. Anandan",
"doi": null,
"abstractUrl": "/proceedings-article/dicta/2008/3456z018/12OmNxw5B7m",
"parentPublication": {
"id": "proceedings/dicta/2008/3456/0",
"title": "2008 Digital Image Computing: Techniques and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbcars/2012/4917/0/4917z014",
"title": "Keynote seakers - SBCARS 2012",
"doi": null,
"abstractUrl": "/proceedings-article/sbcars/2012/4917z014/12OmNxwncHo",
"parentPublication": {
"id": "proceedings/sbcars/2012/4917/0",
"title": "2012 Sixth Brazilian Symposium on Software Components, Architectures and Reuse",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hoti/2006/2654/0/2654xii",
"title": "Keynote Speaker I",
"doi": null,
"abstractUrl": "/proceedings-article/hoti/2006/2654xii/12OmNz6iOfh",
"parentPublication": {
"id": "proceedings/hoti/2006/2654/0",
"title": "Proceedings. 14th IEEE Symposium on High Performance Interconnects",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1984/0542/0/01585757",
"title": "Conference Keynote Speaker",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1984/01585757/12OmNzIl3C5",
"parentPublication": {
"id": "proceedings/dac/1984/0542/0",
"title": "21st Design Automation Conference Proceedings",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hoti/2006/2654/0/2654xiii",
"title": "Keynote Speaker II",
"doi": null,
"abstractUrl": "/proceedings-article/hoti/2006/2654xiii/12OmNzXFoLS",
"parentPublication": {
"id": "proceedings/hoti/2006/2654/0",
"title": "Proceedings. 14th IEEE Symposium on High Performance Interconnects",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1980/020/0/01585222",
"title": "Keynote speaker",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1980/01585222/1AIMePUq5JS",
"parentPublication": {
"id": "proceedings/dac/1980/020/0",
"title": "17th Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/an/2023/01/10076929",
"title": "The Legacy of Mary Kenneth Keller, First U.S. Ph.D. in Computer Science",
"doi": null,
"abstractUrl": "/magazine/an/2023/01/10076929/1LFQ2k1iy40",
"parentPublication": {
"id": "mags/an",
"title": "IEEE Annals of the History of Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg201212xviii",
"articleId": "13rRUwbs2b3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg201212xxii",
"articleId": "13rRUyY294C",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNySXEX1",
"title": "Mar.-Apr.",
"year": "2014",
"issueNum": "02",
"idPrefix": "so",
"pubType": "magazine",
"volume": "31",
"label": "Mar.-Apr.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwh80B2",
"doi": "10.1109/MS.2014.29",
"abstract": "It was May 2010 when my \"call for insights\" first appeared in this magazine. For nearly four years, you, gentle readers, have responded to that call and have shared your experiences, challenges, and learnings. I appreciate all of you who submitted, who revised and responded to shepherding, but especially, all who stayed the course and produced a published article. This article is my farewell to the series, but it will continue on even though I'm no longer steering it. If you haven't yet submitted something for publication, I encourage you to do that. We need to hear your insights!",
"abstracts": [
{
"abstractType": "Regular",
"content": "It was May 2010 when my \"call for insights\" first appeared in this magazine. For nearly four years, you, gentle readers, have responded to that call and have shared your experiences, challenges, and learnings. I appreciate all of you who submitted, who revised and responded to shepherding, but especially, all who stayed the course and produced a published article. This article is my farewell to the series, but it will continue on even though I'm no longer steering it. If you haven't yet submitted something for publication, I encourage you to do that. We need to hear your insights!",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "It was May 2010 when my \"call for insights\" first appeared in this magazine. For nearly four years, you, gentle readers, have responded to that call and have shared your experiences, challenges, and learnings. I appreciate all of you who submitted, who revised and responded to shepherding, but especially, all who stayed the course and produced a published article. This article is my farewell to the series, but it will continue on even though I'm no longer steering it. If you haven't yet submitted something for publication, I encourage you to do that. We need to hear your insights!",
"title": "A Final Word about Stories",
"normalizedTitle": "A Final Word about Stories",
"fno": "mso2014020014",
"hasPdf": true,
"idPrefix": "so",
"keywords": [
"Scientific Experiments",
"Stories",
"Experience Reports",
"Lessons",
"Best Practices"
],
"authors": [
{
"givenName": "Linda",
"surname": "Rising",
"fullName": "Linda Rising",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "02",
"pubDate": "2014-03-01 00:00:00",
"pubType": "mags",
"pages": "14-17",
"year": "2014",
"issn": "0740-7459",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sadfe/2005/2478/0/24780069",
"title": "How to be a Digital Forensic Expert Witness",
"doi": null,
"abstractUrl": "/proceedings-article/sadfe/2005/24780069/12OmNBTs7uL",
"parentPublication": {
"id": "proceedings/sadfe/2005/2478/0",
"title": "First International Workshop on Systematic Approaches to Digital Forensic Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icre/1998/8356/0/00667809",
"title": "A Case for Priority: Introduction to the Mini-Tutorial",
"doi": null,
"abstractUrl": "/proceedings-article/icre/1998/00667809/12OmNrHSD2R",
"parentPublication": {
"id": "proceedings/icre/1998/8356/0",
"title": "Proceedings of IEEE International Symposium on Requirements Engineering: RE '98",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlsid/1996/7228/0/72280006",
"title": "Science, Technology, and the Indian Society",
"doi": null,
"abstractUrl": "/proceedings-article/vlsid/1996/72280006/12OmNvUsonW",
"parentPublication": {
"id": "proceedings/vlsid/1996/7228/0",
"title": "VLSI Design, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iih-msp/2010/4222/0/4222a510",
"title": "Privacy by Data Provenance with Digital Watermarking - A Proof-of-Concept Implementation for Medical Services with Electronic Health Records",
"doi": null,
"abstractUrl": "/proceedings-article/iih-msp/2010/4222a510/12OmNxdVgSc",
"parentPublication": {
"id": "proceedings/iih-msp/2010/4222/0",
"title": "Intelligent Information Hiding and Multimedia Signal Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-c/2016/4205/0/4205a007",
"title": "Programming Dangerously! Can Formal Methods and Empirical Software Engineering Come to the Rescue?",
"doi": null,
"abstractUrl": "/proceedings-article/icse-c/2016/4205a007/12OmNxwENuw",
"parentPublication": {
"id": "proceedings/icse-c/2016/4205/0",
"title": "2016 IEEE/ACM 38th International Conference on Software Engineering Companion (ICSE-C)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mu/2011/02/mmu2011020012",
"title": "Web-Scale Multimedia Analysis: Does Content Matter?",
"doi": null,
"abstractUrl": "/magazine/mu/2011/02/mmu2011020012/13rRUEgs2yK",
"parentPublication": {
"id": "mags/mu",
"title": "IEEE MultiMedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2006/05/m5088",
"title": "Prosecuting your patent",
"doi": null,
"abstractUrl": "/magazine/mi/2006/05/m5088/13rRUwgQpnA",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2003/03/c3002",
"title": "How Right You Are!",
"doi": null,
"abstractUrl": "/magazine/cs/2003/03/c3002/13rRUy3xYet",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg201212xxii",
"title": "VisWeek 2012 Capstone Speaker",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg201212xxii/13rRUyY294C",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mso2014020010",
"articleId": "13rRUzpzez1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mso2014020018",
"articleId": "13rRUxCRFUw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwdL7lu",
"title": "July/August",
"year": "2006",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "12",
"label": "July/August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwhHcQN",
"doi": "10.1109/TVCG.2006.57",
"abstract": "Abstract—This paper describes an efficient combinatorial method for simplification of topological features in a 3D scalar function. The Morse-Smale complex, which provides a succinct representation of a function's associated gradient flow field, is used to identify topological features and their significance. The simplification process, guided by the Morse-Smale complex, proceeds by repeatedly applying two atomic operations that each remove a pair of critical points from the complex. Efficient storage of the complex results in execution of these atomic operations at interactive rates. Visualization of the simplified complex shows that the simplification preserves significant topological features while removing small features and noise.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—This paper describes an efficient combinatorial method for simplification of topological features in a 3D scalar function. The Morse-Smale complex, which provides a succinct representation of a function's associated gradient flow field, is used to identify topological features and their significance. The simplification process, guided by the Morse-Smale complex, proceeds by repeatedly applying two atomic operations that each remove a pair of critical points from the complex. Efficient storage of the complex results in execution of these atomic operations at interactive rates. Visualization of the simplified complex shows that the simplification preserves significant topological features while removing small features and noise.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—This paper describes an efficient combinatorial method for simplification of topological features in a 3D scalar function. The Morse-Smale complex, which provides a succinct representation of a function's associated gradient flow field, is used to identify topological features and their significance. The simplification process, guided by the Morse-Smale complex, proceeds by repeatedly applying two atomic operations that each remove a pair of critical points from the complex. Efficient storage of the complex results in execution of these atomic operations at interactive rates. Visualization of the simplified complex shows that the simplification preserves significant topological features while removing small features and noise.",
"title": "A Topological Approach to Simplification of Three-Dimensional Scalar Functions",
"normalizedTitle": "A Topological Approach to Simplification of Three-Dimensional Scalar Functions",
"fno": "v0474",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Morse Theory",
"Morse Smale Complexes",
"Computational Topology",
"Computational Geometry",
"Simplification",
"Multiresolution",
"Feature Detection",
"Volumetric Data"
],
"authors": [
{
"givenName": "Attila",
"surname": "Gyulassy",
"fullName": "Attila Gyulassy",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vijay",
"surname": "Natarajan",
"fullName": "Vijay Natarajan",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Valerio",
"surname": "Pascucci",
"fullName": "Valerio Pascucci",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peer-Timo",
"surname": "Bremer",
"fullName": "Peer-Timo Bremer",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bernd",
"surname": "Hamann",
"fullName": "Bernd Hamann",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2006-07-01 00:00:00",
"pubType": "trans",
"pages": "474-484",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2005/2766/0/27660068",
"title": "Topology-based Simplification for Feature Extraction from 3D Scalar Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660068/12OmNArKShW",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300019",
"title": "A Multi-resolution Data Structure for Two-dimensional Morse-Smale Functions",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300019/12OmNBTJIFg",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2011/4548/0/4548a025",
"title": "Memory-Efficient Computation of Persistent Homology for 3D Images Using Discrete Morse Theory",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2011/4548a025/12OmNqJ8tfs",
"parentPublication": {
"id": "proceedings/sibgrapi/2011/4548/0",
"title": "2011 24th SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2012/4675/0/4675a484",
"title": "The Parallel Computation of Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2012/4675a484/12OmNrFBQ1B",
"parentPublication": {
"id": "proceedings/ipdps/2012/4675/0",
"title": "Parallel and Distributed Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532839",
"title": "Topology-based simplification for feature extraction from 3D scalar fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532839/12OmNzkMlOD",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/04/v0385",
"title": "A Topological Hierarchy for Functions on Triangulated Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2004/04/v0385/13rRUwdrdSq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/04376172",
"title": "Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/04376172/13rRUwj7cp4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061271",
"title": "Visual Exploration of High Dimensional Scalar Functions",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061271/13rRUx0gev4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/10/ttg2012101757",
"title": "Parallel Computation of 2D Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/2012/10/ttg2012101757/13rRUxASuSL",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0461",
"articleId": "13rRUwgQpDh",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0485",
"articleId": "13rRUxYIN40",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwJPMX5",
"title": "Dec.",
"year": "2011",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy2YLYr",
"doi": "10.1109/TVCG.2011.236",
"abstract": "Study of symmetric or repeating patterns in scalar fields is important in scientific data analysis because it gives deep insights into the properties of the underlying phenomenon. Though geometric symmetry has been well studied within areas like shape processing, identifying symmetry in scalar fields has remained largely unexplored due to the high computational cost of the associated algorithms. We propose a computationally efficient algorithm for detecting symmetric patterns in a scalar field distribution by analysing the topology of level sets of the scalar field. Our algorithm computes the contour tree of a given scalar field and identifies subtrees that are similar. We define a robust similarity measure for comparing subtrees of the contour tree and use it to group similar subtrees together. Regions of the domain corresponding to subtrees that belong to a common group are extracted and reported to be symmetric. Identifying symmetry in scalar fields finds applications in visualization, data exploration, and feature detection. We describe two applications in detail: symmetry-aware transfer function design and symmetry-aware isosurface extraction.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Study of symmetric or repeating patterns in scalar fields is important in scientific data analysis because it gives deep insights into the properties of the underlying phenomenon. Though geometric symmetry has been well studied within areas like shape processing, identifying symmetry in scalar fields has remained largely unexplored due to the high computational cost of the associated algorithms. We propose a computationally efficient algorithm for detecting symmetric patterns in a scalar field distribution by analysing the topology of level sets of the scalar field. Our algorithm computes the contour tree of a given scalar field and identifies subtrees that are similar. We define a robust similarity measure for comparing subtrees of the contour tree and use it to group similar subtrees together. Regions of the domain corresponding to subtrees that belong to a common group are extracted and reported to be symmetric. Identifying symmetry in scalar fields finds applications in visualization, data exploration, and feature detection. We describe two applications in detail: symmetry-aware transfer function design and symmetry-aware isosurface extraction.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Study of symmetric or repeating patterns in scalar fields is important in scientific data analysis because it gives deep insights into the properties of the underlying phenomenon. Though geometric symmetry has been well studied within areas like shape processing, identifying symmetry in scalar fields has remained largely unexplored due to the high computational cost of the associated algorithms. We propose a computationally efficient algorithm for detecting symmetric patterns in a scalar field distribution by analysing the topology of level sets of the scalar field. Our algorithm computes the contour tree of a given scalar field and identifies subtrees that are similar. We define a robust similarity measure for comparing subtrees of the contour tree and use it to group similar subtrees together. Regions of the domain corresponding to subtrees that belong to a common group are extracted and reported to be symmetric. Identifying symmetry in scalar fields finds applications in visualization, data exploration, and feature detection. We describe two applications in detail: symmetry-aware transfer function design and symmetry-aware isosurface extraction.",
"title": "Symmetry in Scalar Field Topology",
"normalizedTitle": "Symmetry in Scalar Field Topology",
"fno": "ttg2011122035",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Scalar Field Symmetry",
"Contour Tree",
"Similarity Measure",
"Persistence",
"Isosurface Extraction",
"Transfer Function Design"
],
"authors": [
{
"givenName": "Dilip Mathew",
"surname": "Thomas",
"fullName": "Dilip Mathew Thomas",
"affiliation": "Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vijay",
"surname": "Natarajan",
"fullName": "Vijay Natarajan",
"affiliation": "Department of Computer Science and Automation, Supercomputer Education and Research Centre, Indian Institute of Science, Bangalore, India",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2011-12-01 00:00:00",
"pubType": "trans",
"pages": "2035-2044",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icgec/2011/4449/0/4449a345",
"title": "Symmetry Auto-detection Based on Contour and Corner Models",
"doi": null,
"abstractUrl": "/proceedings-article/icgec/2011/4449a345/12OmNBTs7CQ",
"parentPublication": {
"id": "proceedings/icgec/2011/4449/0",
"title": "Genetic and Evolutionary Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/tase/2007/2856/0/28560450",
"title": "Symmetry in Process Algebra",
"doi": null,
"abstractUrl": "/proceedings-article/tase/2007/28560450/12OmNCf1DqD",
"parentPublication": {
"id": "proceedings/tase/2007/2856/0",
"title": "First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdcat/2005/2405/0/24050866",
"title": "Symmetry and Autobisimulation",
"doi": null,
"abstractUrl": "/proceedings-article/pdcat/2005/24050866/12OmNym2bZc",
"parentPublication": {
"id": "proceedings/pdcat/2005/2405/0",
"title": "Sixth International Conference on Parallel and Distributed Computing Applications and Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1998/9176/0/91760051",
"title": "Visualization of Scalar Topology for Structural Enhancement",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1998/91760051/12OmNzVoBtU",
"parentPublication": {
"id": "proceedings/ieee-vis/1998/9176/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875976",
"title": "Multiscale Symmetry Detection in Scalar Fields by Clustering Contours",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875976/13rRUEgarBw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1995/12/i1154",
"title": "Symmetry as a Continuous Feature",
"doi": null,
"abstractUrl": "/journal/tp/1995/12/i1154/13rRUNvyalV",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2010/10/ttp2010101730",
"title": "Irregular Shape Symmetry Analysis: Theory and Application to Quantitative Galaxy Classification",
"doi": null,
"abstractUrl": "/journal/tp/2010/10/ttp2010101730/13rRUwbs225",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122663",
"title": "Detecting Symmetry in Scalar Fields Using Augmented Extremum Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122663/13rRUxAASTa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/02/ttg2011020182",
"title": "Relation-Aware Isosurface Extraction in Multifield Data",
"doi": null,
"abstractUrl": "/journal/tg/2011/02/ttg2011020182/13rRUyfKIHF",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061475",
"title": "Interactive Comparison of Scalar Fields Based on Largest Contours with Applications to Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061475/13rRUyuegp2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011122025",
"articleId": "13rRUxBa55Y",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011122045",
"articleId": "13rRUwcS1CS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesZK",
"name": "ttg2011122035s1.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2011122035s1.pdf",
"extension": "pdf",
"size": "1.73 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": "13rRUyYSWl0",
"doi": "10.1109/TVCG.2014.2346432",
"abstract": "Data acquisition, numerical inaccuracies, and sampling often introduce noise in measurements and simulations. Removing this noise is often necessary for efficient analysis and visualization of this data, yet many denoising techniques change the minima and maxima of a scalar field. For example, the extrema can appear or disappear, spatially move, and change their value. This can lead to wrong interpretations of the data, e.g., when the maximum temperature over an area is falsely reported being a few degrees cooler because the denoising method is unaware of these features. Recently, a topological denoising technique based on a global energy optimization was proposed, which allows the topology-controlled denoising of 2D scalar fields. While this method preserves the minima and maxima, it is constrained by the size of the data. We extend this work to large 2D data and medium-sized 3D data by introducing a novel domain decomposition approach. It allows processing small patches of the domain independently while still avoiding the introduction of new critical points. Furthermore, we propose an iterative refinement of the solution, which decreases the optimization energy compared to the previous approach and therefore gives smoother results that are closer to the input. We illustrate our technique on synthetic and real-world 2D and 3D data sets that highlight potential applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Data acquisition, numerical inaccuracies, and sampling often introduce noise in measurements and simulations. Removing this noise is often necessary for efficient analysis and visualization of this data, yet many denoising techniques change the minima and maxima of a scalar field. For example, the extrema can appear or disappear, spatially move, and change their value. This can lead to wrong interpretations of the data, e.g., when the maximum temperature over an area is falsely reported being a few degrees cooler because the denoising method is unaware of these features. Recently, a topological denoising technique based on a global energy optimization was proposed, which allows the topology-controlled denoising of 2D scalar fields. While this method preserves the minima and maxima, it is constrained by the size of the data. We extend this work to large 2D data and medium-sized 3D data by introducing a novel domain decomposition approach. It allows processing small patches of the domain independently while still avoiding the introduction of new critical points. Furthermore, we propose an iterative refinement of the solution, which decreases the optimization energy compared to the previous approach and therefore gives smoother results that are closer to the input. We illustrate our technique on synthetic and real-world 2D and 3D data sets that highlight potential applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Data acquisition, numerical inaccuracies, and sampling often introduce noise in measurements and simulations. Removing this noise is often necessary for efficient analysis and visualization of this data, yet many denoising techniques change the minima and maxima of a scalar field. For example, the extrema can appear or disappear, spatially move, and change their value. This can lead to wrong interpretations of the data, e.g., when the maximum temperature over an area is falsely reported being a few degrees cooler because the denoising method is unaware of these features. Recently, a topological denoising technique based on a global energy optimization was proposed, which allows the topology-controlled denoising of 2D scalar fields. While this method preserves the minima and maxima, it is constrained by the size of the data. We extend this work to large 2D data and medium-sized 3D data by introducing a novel domain decomposition approach. It allows processing small patches of the domain independently while still avoiding the introduction of new critical points. Furthermore, we propose an iterative refinement of the solution, which decreases the optimization energy compared to the previous approach and therefore gives smoother results that are closer to the input. We illustrate our technique on synthetic and real-world 2D and 3D data sets that highlight potential applications.",
"title": "Fast and Memory-Efficienty Topological Denoising of 2D and 3D Scalar Fields",
"normalizedTitle": "Fast and Memory-Efficienty Topological Denoising of 2D and 3D Scalar Fields",
"fno": "06875939",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Two Dimensional Displays",
"Three Dimensional Displays",
"Data Acquisitions",
"Numerical Models",
"Noise Reduction",
"Scalar Fields",
"Noise Measurement",
"Scalar Fields",
"Numerical Optimization",
"Topology"
],
"authors": [
{
"givenName": "David",
"surname": "Gunther",
"fullName": "David Gunther",
"affiliation": ", Institut Mines-Télécom, Paris, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alec",
"surname": "Jacobson",
"fullName": "Alec Jacobson",
"affiliation": ", Columbia University, New York, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jan",
"surname": "Reininghaus",
"fullName": "Jan Reininghaus",
"affiliation": ", IST Austria, Vienna, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hans-Peter",
"surname": "Seidel",
"fullName": "Hans-Peter Seidel",
"affiliation": ", Max Planck Institute for Informatics, Saarbrücken, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Olga",
"surname": "Sorkine-Hornung",
"fullName": "Olga Sorkine-Hornung",
"affiliation": ", ETH Zürich, Zürich, Switzerland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tino",
"surname": "Weinkauf",
"fullName": "Tino Weinkauf",
"affiliation": ", Max Planck Institute for Informatics, Saarbrücken, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "2585-2594",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2014/5118/0/5118c933",
"title": "CID: Combined Image Denoising in Spatial and Frequency Domains Using Web Images",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118c933/12OmNwE9Ouw",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2018/4886/0/488601b925",
"title": "3D Shape Processing by Convolutional Denoising Autoencoders on Local Patches",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2018/488601b925/12OmNwJgAJQ",
"parentPublication": {
"id": "proceedings/wacv/2018/4886/0",
"title": "2018 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2016/5407/0/5407a083",
"title": "Robust Feature-Preserving Denoising of 3D Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2016/5407a083/12OmNyRxFIQ",
"parentPublication": {
"id": "proceedings/3dv/2016/5407/0",
"title": "2016 Fourth International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122045",
"title": "A Scale Space Based Persistence Measure for Critical Points in 2D Scalar Fields",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122045/13rRUwcS1CS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122005",
"title": "Generalized Topological Simplification of Scalar Fields on Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122005/13rRUx0xPmY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122763",
"title": "Visualization of Morse Connection Graphs for Topologically Rich 2D Vector Fields",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122763/13rRUxNW1Zp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539585",
"title": "Evaluating the Impact of Binning 2D Scalar Fields",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539585/13rRUxcsYLW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/06/08667696",
"title": "Stippling of 2D Scalar Fields",
"doi": null,
"abstractUrl": "/journal/tg/2019/06/08667696/18q6oNdp5cs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09994879",
"title": "DeepTracer-Denoising: Deep Learning for 3D Electron Density Map Denoising",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09994879/1JC247wbYSQ",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/08/09296808",
"title": "Mesh Denoising With Facet Graph Convolutions",
"doi": null,
"abstractUrl": "/journal/tg/2022/08/09296808/1pDnJLfMBWg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06876027",
"articleId": "13rRUxly95D",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06875918",
"articleId": "13rRUwjGoLG",
"__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": "1nTrExzmT5e",
"doi": "10.1109/TVCG.2020.3030353",
"abstract": "This paper describes a localized algorithm for the topological simplification of scalar data, an essential pre-processing step of topological data analysis (TDA). Given a scalar field f and a selection of extrema to preserve, the proposed localized topological simplification (LTS) derives a function g that is close to f and only exhibits the selected set of extrema. Specifically, suband superlevel set components associated with undesired extrema are first locally flattened and then correctly embedded into the global scalar field, such that these regions are guaranteed-from a combinatorial perspective-to no longer contain any undesired extrema. In contrast to previous global approaches, LTS only and independently processes regions of the domain that actually need to be simplified, which already results in a noticeable speedup. Moreover, due to the localized nature of the algorithm, LTS can utilize shared-memory parallelism to simplify regions simultaneously with a high parallel efficiency (70%). Hence, LTS significantly improves interactivity for the exploration of simplification parameters and their effect on subsequent topological analysis. For such exploration tasks, LTS brings the overall execution time of a plethora of TDA pipelines from minutes down to seconds, with an average observed speedup over state-of-the-art techniques of up to ×36. Furthermore, in the special case where preserved extrema are selected based on topological persistence, an adapted version of LTS partially computes the persistence diagram and simultaneously simplifies features below a predefined persistence threshold. The effectiveness of LTS, its parallel efficiency, and its resulting benefits for TDA are demonstrated on several simulated and acquired datasets from different application domains, including physics, chemistry, and biomedical imaging.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper describes a localized algorithm for the topological simplification of scalar data, an essential pre-processing step of topological data analysis (TDA). Given a scalar field f and a selection of extrema to preserve, the proposed localized topological simplification (LTS) derives a function g that is close to f and only exhibits the selected set of extrema. Specifically, suband superlevel set components associated with undesired extrema are first locally flattened and then correctly embedded into the global scalar field, such that these regions are guaranteed-from a combinatorial perspective-to no longer contain any undesired extrema. In contrast to previous global approaches, LTS only and independently processes regions of the domain that actually need to be simplified, which already results in a noticeable speedup. Moreover, due to the localized nature of the algorithm, LTS can utilize shared-memory parallelism to simplify regions simultaneously with a high parallel efficiency (70%). Hence, LTS significantly improves interactivity for the exploration of simplification parameters and their effect on subsequent topological analysis. For such exploration tasks, LTS brings the overall execution time of a plethora of TDA pipelines from minutes down to seconds, with an average observed speedup over state-of-the-art techniques of up to ×36. Furthermore, in the special case where preserved extrema are selected based on topological persistence, an adapted version of LTS partially computes the persistence diagram and simultaneously simplifies features below a predefined persistence threshold. The effectiveness of LTS, its parallel efficiency, and its resulting benefits for TDA are demonstrated on several simulated and acquired datasets from different application domains, including physics, chemistry, and biomedical imaging.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper describes a localized algorithm for the topological simplification of scalar data, an essential pre-processing step of topological data analysis (TDA). Given a scalar field f and a selection of extrema to preserve, the proposed localized topological simplification (LTS) derives a function g that is close to f and only exhibits the selected set of extrema. Specifically, suband superlevel set components associated with undesired extrema are first locally flattened and then correctly embedded into the global scalar field, such that these regions are guaranteed-from a combinatorial perspective-to no longer contain any undesired extrema. In contrast to previous global approaches, LTS only and independently processes regions of the domain that actually need to be simplified, which already results in a noticeable speedup. Moreover, due to the localized nature of the algorithm, LTS can utilize shared-memory parallelism to simplify regions simultaneously with a high parallel efficiency (70%). Hence, LTS significantly improves interactivity for the exploration of simplification parameters and their effect on subsequent topological analysis. For such exploration tasks, LTS brings the overall execution time of a plethora of TDA pipelines from minutes down to seconds, with an average observed speedup over state-of-the-art techniques of up to ×36. Furthermore, in the special case where preserved extrema are selected based on topological persistence, an adapted version of LTS partially computes the persistence diagram and simultaneously simplifies features below a predefined persistence threshold. The effectiveness of LTS, its parallel efficiency, and its resulting benefits for TDA are demonstrated on several simulated and acquired datasets from different application domains, including physics, chemistry, and biomedical imaging.",
"title": "Localized Topological Simplification of Scalar Data",
"normalizedTitle": "Localized Topological Simplification of Scalar Data",
"fno": "09222093",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Geometry",
"Data Analysis",
"Data Visualisation",
"Graph Theory",
"Parallel Algorithms",
"Localized Topological Simplification",
"Scalar Data",
"Localized Algorithm",
"Topological Data Analysis",
"Topological Analysis",
"Shared Memory Parallelism",
"Parallel Computing",
"Visualization Tasks",
"Computational Modeling",
"Parallel Processing",
"Data Visualization",
"Data Analysis",
"Atmospheric Measurements",
"Particle Measurements",
"Topology",
"Topological Data Analysis",
"Scalar Data",
"Simplification",
"Feature Extraction",
"Parallel Computing"
],
"authors": [
{
"givenName": "Jonas",
"surname": "Lukasczyk",
"fullName": "Jonas Lukasczyk",
"affiliation": "Arizona State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christoph",
"surname": "Garth",
"fullName": "Christoph Garth",
"affiliation": "Technische Universitat Kaiserslautern",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ross",
"surname": "Maciejewski",
"fullName": "Ross Maciejewski",
"affiliation": "Arizona State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Julien",
"surname": "Tierny",
"fullName": "Julien Tierny",
"affiliation": "Sorbonne Universite, CNRS",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "572-582",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2016/1437/0/1437b014",
"title": "On Time-Series Topological Data Analysis: New Data and Opportunities",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2016/1437b014/12OmNrnJ6W1",
"parentPublication": {
"id": "proceedings/cvprw/2016/1437/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/2000/0850/0/08500454",
"title": "Topological persistence and simplification",
"doi": null,
"abstractUrl": "/proceedings-article/focs/2000/08500454/12OmNvT2oZT",
"parentPublication": {
"id": "proceedings/focs/2000/0850/0",
"title": "Proceedings 41st Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0474",
"title": "A Topological Approach to Simplification of Three-Dimensional Scalar Functions",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0474/13rRUwhHcQN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122005",
"title": "Generalized Topological Simplification of Scalar Fields on Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122005/13rRUx0xPmY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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/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/ldav/2022/9156/0/09966403",
"title": "Topological Analysis of Ensembles of Hydrodynamic Turbulent Flows An Experimental Study",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2022/09966403/1IT0Ck3lBg4",
"parentPublication": {
"id": "proceedings/ldav/2022/9156/0",
"title": "2022 IEEE 12th Symposium on Large Data Analysis and Visualization (LDAV)",
"__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/icpr/2021/8808/0/09412768",
"title": "A Hybrid Metric based on Persistent Homology and its Application to Signal Classification",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412768/1tmhAJtw0yk",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09222271",
"articleId": "1nTrwyIRc1W",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09224154",
"articleId": "1nV63QG11le",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAle6Qx",
"title": "November/December",
"year": "2007",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwj7cp4",
"doi": "10.1109/TVCG.2007.70552",
"abstract": "The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and their importance. We present an algorithm that constructs the Morse-Smale complex in a series of sweeps through the data, identifying various components of the complex in a consistent manner. All components of the complex, both geometric and topological, are computed, providing a complete decomposition of the domain. Efficiency is maintained by representing the geometry of the complex in terms of point sets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and their importance. We present an algorithm that constructs the Morse-Smale complex in a series of sweeps through the data, identifying various components of the complex in a consistent manner. All components of the complex, both geometric and topological, are computed, providing a complete decomposition of the domain. Efficiency is maintained by representing the geometry of the complex in terms of point sets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and their importance. We present an algorithm that constructs the Morse-Smale complex in a series of sweeps through the data, identifying various components of the complex in a consistent manner. All components of the complex, both geometric and topological, are computed, providing a complete decomposition of the domain. Efficiency is maintained by representing the geometry of the complex in terms of point sets.",
"title": "Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions",
"normalizedTitle": "Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions",
"fno": "04376172",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Isosurfaces",
"Topology",
"Computer Science",
"Tree Graphs",
"Surface Topography",
"Data Analysis",
"Data Visualization",
"Data Structures",
"Geometry",
"Computer Vision",
"Morse Theory",
"Morse Smale Complexes",
"Computational Topology",
"Multiresolution",
"Simplification",
"Feature Detection",
"3 D Scalar Fields"
],
"authors": [
{
"givenName": "Attila",
"surname": "Gyulassy",
"fullName": "Attila Gyulassy",
"affiliation": "Institute for Data Analysis and Visualization, Dept. of Computer Science, University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vijay",
"surname": "Natarajan",
"fullName": "Vijay Natarajan",
"affiliation": "Dept. of Computer Science and Automation, Supercomputer Education and Research Centre, Indian Institute of Science, Bangalore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Valerio",
"surname": "Pascucci",
"fullName": "Valerio Pascucci",
"affiliation": "Center for Applied Scientific Computing, Lawrence Livermore National Laboratory",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bernd",
"surname": "Hamann",
"fullName": "Bernd Hamann",
"affiliation": "Institute for Data Analysis and Visualization, Dept. of Computer Science, University of California, Davis",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2007-11-01 00:00:00",
"pubType": "trans",
"pages": "1440-1447",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2003/2030/0/20300019",
"title": "A Multi-resolution Data Structure for Two-dimensional Morse-Smale Functions",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300019/12OmNBTJIFg",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2012/4675/0/4675a484",
"title": "The Parallel Computation of Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2012/4675a484/12OmNrFBQ1B",
"parentPublication": {
"id": "proceedings/ipdps/2012/4675/0",
"title": "Parallel and Distributed Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciap/2007/2877/0/28770337",
"title": "Multi-resolution Morse-Smale Complexes for Terrain Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/iciap/2007/28770337/12OmNsbY6Tz",
"parentPublication": {
"id": "proceedings/iciap/2007/2877/0",
"title": "2007 14th International Conference on Image Analysis and Processing - ICIAP 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2005/2379/0/01563237",
"title": "Volumetric data analysis using Morse-Smale complexes",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2005/01563237/12OmNxaw5b1",
"parentPublication": {
"id": "proceedings/smi/2005/2379/0",
"title": "Proceedings. International Conference on Shape Modeling and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532839",
"title": "Topology-based simplification for feature extraction from 3D scalar fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532839/12OmNzkMlOD",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/10/ttg2012101757",
"title": "Parallel Computation of 2D Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/2012/10/ttg2012101757/13rRUxASuSL",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/09/06065731",
"title": "Direct Feature Visualization Using Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/2012/09/06065731/13rRUyv53Fn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440824",
"title": "Shared-Memory Parallel Computation of Morse-Smale Complexes with Improved Accuracy",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440824/17D45Xh13tG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09773959",
"title": "A GPU Parallel Algorithm for Computing Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09773959/1DjDpvFkiwE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a036",
"title": "GPU Parallel Computation of Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a036/1qRO66SHgwU",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1328",
"articleId": "13rRUx0xPIv",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1336",
"articleId": "13rRUytWF9e",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"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": "13rRUwjGoLG",
"doi": "10.1109/TVCG.2014.2346434",
"abstract": "Morse-Smale (MS) complexes have been gaining popularity as a tool for feature-driven data analysis and visualization. However, the quality of their geometric embedding and the sole dependence on the input scalar field data can limit their applicability when expressing application-dependent features. In this paper we introduce a new combinatorial technique to compute an MS complex that conforms to both an input scalar field and an additional, prior segmentation of the domain. The segmentation constrains the MS complex computation guaranteeing that boundaries in the segmentation are captured as separatrices of the MS complex. We demonstrate the utility and versatility of our approach with two applications. First, we use streamline integration to determine numerically computed basins/mountains and use the resulting segmentation as an input to our algorithm. This strategy enables the incorporation of prior flow path knowledge, effectively resulting in an MS complex that is as geometrically accurate as the employed numerical integration. Our second use case is motivated by the observation that often the data itself does not explicitly contain features known to be present by a domain expert. We introduce edit operations for MS complexes so that a user can directly modify their features while maintaining all the advantages of a robust topology-based representation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Morse-Smale (MS) complexes have been gaining popularity as a tool for feature-driven data analysis and visualization. However, the quality of their geometric embedding and the sole dependence on the input scalar field data can limit their applicability when expressing application-dependent features. In this paper we introduce a new combinatorial technique to compute an MS complex that conforms to both an input scalar field and an additional, prior segmentation of the domain. The segmentation constrains the MS complex computation guaranteeing that boundaries in the segmentation are captured as separatrices of the MS complex. We demonstrate the utility and versatility of our approach with two applications. First, we use streamline integration to determine numerically computed basins/mountains and use the resulting segmentation as an input to our algorithm. This strategy enables the incorporation of prior flow path knowledge, effectively resulting in an MS complex that is as geometrically accurate as the employed numerical integration. Our second use case is motivated by the observation that often the data itself does not explicitly contain features known to be present by a domain expert. We introduce edit operations for MS complexes so that a user can directly modify their features while maintaining all the advantages of a robust topology-based representation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Morse-Smale (MS) complexes have been gaining popularity as a tool for feature-driven data analysis and visualization. However, the quality of their geometric embedding and the sole dependence on the input scalar field data can limit their applicability when expressing application-dependent features. In this paper we introduce a new combinatorial technique to compute an MS complex that conforms to both an input scalar field and an additional, prior segmentation of the domain. The segmentation constrains the MS complex computation guaranteeing that boundaries in the segmentation are captured as separatrices of the MS complex. We demonstrate the utility and versatility of our approach with two applications. First, we use streamline integration to determine numerically computed basins/mountains and use the resulting segmentation as an input to our algorithm. This strategy enables the incorporation of prior flow path knowledge, effectively resulting in an MS complex that is as geometrically accurate as the employed numerical integration. Our second use case is motivated by the observation that often the data itself does not explicitly contain features known to be present by a domain expert. We introduce edit operations for MS complexes so that a user can directly modify their features while maintaining all the advantages of a robust topology-based representation.",
"title": "Conforming Morse-Smale Complexes",
"normalizedTitle": "Conforming Morse-Smale Complexes",
"fno": "06875918",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Information Analysis",
"Manifolds",
"Geometry",
"Face Recognition",
"Feature Extraction",
"Data Analysis",
"Computational Topology",
"Morse Smale Complex"
],
"authors": [
{
"givenName": "Attila",
"surname": "Gyulassy",
"fullName": "Attila Gyulassy",
"affiliation": ", SCI Institute",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Gunther",
"fullName": "David Gunther",
"affiliation": ", Institut Mines-Télécom, Télécom ParisTech, CNRS LTCI, Paris, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Joshua A.",
"surname": "Levine",
"fullName": "Joshua A. Levine",
"affiliation": "School of Computing, Visual Computing Division, Clemson University, Clemson, SC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Julien",
"surname": "Tierny",
"fullName": "Julien Tierny",
"affiliation": ", Institut Mines-Télécom, Télécom ParisTech, CNRS LTCI, Paris, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Valerio",
"surname": "Pascucci",
"fullName": "Valerio Pascucci",
"affiliation": ", SCI Institute, University of Utah",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "2595-2603",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ipdps/2012/4675/0/4675a484",
"title": "The Parallel Computation of Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2012/4675a484/12OmNrFBQ1B",
"parentPublication": {
"id": "proceedings/ipdps/2012/4675/0",
"title": "Parallel and Distributed Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciap/2007/2877/0/28770337",
"title": "Multi-resolution Morse-Smale Complexes for Terrain Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/iciap/2007/28770337/12OmNsbY6Tz",
"parentPublication": {
"id": "proceedings/iciap/2007/2877/0",
"title": "2007 14th International Conference on Image Analysis and Processing - ICIAP 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/04376172",
"title": "Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/04376172/13rRUwj7cp4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/10/ttg2012101757",
"title": "Parallel Computation of 2D Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/2012/10/ttg2012101757/13rRUxASuSL",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/04658183",
"title": "A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/04658183/13rRUxOdD8b",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122014",
"title": "Computing Morse-Smale Complexes with Accurate Geometry",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122014/13rRUxZzAhE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/09/06065731",
"title": "Direct Feature Visualization Using Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/2012/09/06065731/13rRUyv53Fn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440824",
"title": "Shared-Memory Parallel Computation of Morse-Smale Complexes with Improved Accuracy",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440824/17D45Xh13tG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09773959",
"title": "A GPU Parallel Algorithm for Computing Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09773959/1DjDpvFkiwE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a036",
"title": "GPU Parallel Computation of Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a036/1qRO66SHgwU",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06875939",
"articleId": "13rRUyYSWl0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06875962",
"articleId": "13rRUxYINfc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBOUxmQ",
"title": "November/December",
"year": "2008",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "14",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxOdD8b",
"doi": "10.1109/TVCG.2008.110",
"abstract": "The Morse-Smale (MS) complex has proven to be a useful tool in extracting and visualizing features from scalar-valued data. However, efficient computation of the MS complex for large scale data remains a challenging problem. We describe a new algorithm and easily extensible framework for computing MS complexes for large scale data of any dimension where scalar values are given at the vertices of a closure-finite and weak topology (CW) complex, therefore enabling computation on a wide variety of meshes such as regular grids, simplicial meshes, and adaptive multiresolution (AMR) meshes. A new divide-and-conquer strategy allows for memory-efficient computation of the MS complex and simplification on-the-fly to control the size of the output. In addition to being able to handle various data formats, the framework supports implementation-specific optimizations, for example, for regular data. We present the complete characterization of critical point cancellations in all dimensions. This technique enables the topology based analysis of large data on off-the-shelf computers. In particular we demonstrate the first full computation of the MS complex for a 1 billion/10243 node grid on a laptop computer with 2 Gb memory.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The Morse-Smale (MS) complex has proven to be a useful tool in extracting and visualizing features from scalar-valued data. However, efficient computation of the MS complex for large scale data remains a challenging problem. We describe a new algorithm and easily extensible framework for computing MS complexes for large scale data of any dimension where scalar values are given at the vertices of a closure-finite and weak topology (CW) complex, therefore enabling computation on a wide variety of meshes such as regular grids, simplicial meshes, and adaptive multiresolution (AMR) meshes. A new divide-and-conquer strategy allows for memory-efficient computation of the MS complex and simplification on-the-fly to control the size of the output. In addition to being able to handle various data formats, the framework supports implementation-specific optimizations, for example, for regular data. We present the complete characterization of critical point cancellations in all dimensions. This technique enables the topology based analysis of large data on off-the-shelf computers. In particular we demonstrate the first full computation of the MS complex for a 1 billion/10243 node grid on a laptop computer with 2 Gb memory.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The Morse-Smale (MS) complex has proven to be a useful tool in extracting and visualizing features from scalar-valued data. However, efficient computation of the MS complex for large scale data remains a challenging problem. We describe a new algorithm and easily extensible framework for computing MS complexes for large scale data of any dimension where scalar values are given at the vertices of a closure-finite and weak topology (CW) complex, therefore enabling computation on a wide variety of meshes such as regular grids, simplicial meshes, and adaptive multiresolution (AMR) meshes. A new divide-and-conquer strategy allows for memory-efficient computation of the MS complex and simplification on-the-fly to control the size of the output. In addition to being able to handle various data formats, the framework supports implementation-specific optimizations, for example, for regular data. We present the complete characterization of critical point cancellations in all dimensions. This technique enables the topology based analysis of large data on off-the-shelf computers. In particular we demonstrate the first full computation of the MS complex for a 1 billion/10243 node grid on a laptop computer with 2 Gb memory.",
"title": "A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality",
"normalizedTitle": "A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality",
"fno": "04658183",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Scalability",
"Grid Computing",
"Large Scale Systems",
"Topology",
"Data Mining",
"Data Visualization",
"Feature Extraction",
"Adaptive Mesh Refinement",
"Size Control",
"Data Analysis",
"Large Scale Data",
"Index Terms 8212",
"Topology Based Analysis",
"Morse Smale Complex"
],
"authors": [],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1619-1626",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2003/2030/0/20300019",
"title": "A Multi-resolution Data Structure for Two-dimensional Morse-Smale Functions",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300019/12OmNBTJIFg",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2011/4548/0/4548a025",
"title": "Memory-Efficient Computation of Persistent Homology for 3D Images Using Discrete Morse Theory",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2011/4548a025/12OmNqJ8tfs",
"parentPublication": {
"id": "proceedings/sibgrapi/2011/4548/0",
"title": "2011 24th SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2012/4675/0/4675a484",
"title": "The Parallel Computation of Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2012/4675a484/12OmNrFBQ1B",
"parentPublication": {
"id": "proceedings/ipdps/2012/4675/0",
"title": "Parallel and Distributed Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0474",
"title": "A Topological Approach to Simplification of Three-Dimensional Scalar Functions",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0474/13rRUwhHcQN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875918",
"title": "Conforming Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875918/13rRUwjGoLG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/10/ttg2012101757",
"title": "Parallel Computation of 2D Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/2012/10/ttg2012101757/13rRUxASuSL",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122014",
"title": "Computing Morse-Smale Complexes with Accurate Geometry",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122014/13rRUxZzAhE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/09/06065731",
"title": "Direct Feature Visualization Using Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/2012/09/06065731/13rRUyv53Fn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10081444",
"title": "Parallel Computation of Piecewise Linear Morse-Smale Segmentations",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10081444/1LRbQOpNdTO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a036",
"title": "GPU Parallel Computation of Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a036/1qRO66SHgwU",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "ttg2008060000",
"articleId": "13rRUwhpBE4",
"__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": "1DjDpvFkiwE",
"doi": "10.1109/TVCG.2022.3174769",
"abstract": "The Morse-Smale complex is a well studied topological structure that represents the gradient flow behavior between critical points of a scalar function. It supports multi-scale topological analysis and visualization of feature-rich scientific data. Several parallel algorithms have been proposed towards the fast computation of the 3D Morse-Smale complex. Its computation continues to pose significant algorithmic challenges. In particular, the non-trivial structure of the connections between the saddle critical points are not amenable to parallel computation. This paper describes a fine grained parallel algorithm for computing the Morse-Smale complex and a GPU implementation (gMSC). The algorithm first determines the saddle-saddle reachability via a transformation into a sequence of vector operations, and next computes the paths between saddles by transforming it into a sequence of matrix operations. Computational experiments show that the method achieves up to 8.6x speedup over pyms3d and 6x speedup over TTK, the current shared memory implementations. The paper also presents a comprehensive experimental analysis of different steps of the algorithm and reports on their contribution towards runtime performance. Finally, it introduces a CPU based data parallel algorithm for simplifying the Morse-Smale complex via iterative critical point pair cancellation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The Morse-Smale complex is a well studied topological structure that represents the gradient flow behavior between critical points of a scalar function. It supports multi-scale topological analysis and visualization of feature-rich scientific data. Several parallel algorithms have been proposed towards the fast computation of the 3D Morse-Smale complex. Its computation continues to pose significant algorithmic challenges. In particular, the non-trivial structure of the connections between the saddle critical points are not amenable to parallel computation. This paper describes a fine grained parallel algorithm for computing the Morse-Smale complex and a GPU implementation (gMSC). The algorithm first determines the saddle-saddle reachability via a transformation into a sequence of vector operations, and next computes the paths between saddles by transforming it into a sequence of matrix operations. Computational experiments show that the method achieves up to 8.6x speedup over pyms3d and 6x speedup over TTK, the current shared memory implementations. The paper also presents a comprehensive experimental analysis of different steps of the algorithm and reports on their contribution towards runtime performance. Finally, it introduces a CPU based data parallel algorithm for simplifying the Morse-Smale complex via iterative critical point pair cancellation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The Morse-Smale complex is a well studied topological structure that represents the gradient flow behavior between critical points of a scalar function. It supports multi-scale topological analysis and visualization of feature-rich scientific data. Several parallel algorithms have been proposed towards the fast computation of the 3D Morse-Smale complex. Its computation continues to pose significant algorithmic challenges. In particular, the non-trivial structure of the connections between the saddle critical points are not amenable to parallel computation. This paper describes a fine grained parallel algorithm for computing the Morse-Smale complex and a GPU implementation (gMSC). The algorithm first determines the saddle-saddle reachability via a transformation into a sequence of vector operations, and next computes the paths between saddles by transforming it into a sequence of matrix operations. Computational experiments show that the method achieves up to 8.6x speedup over pyms3d and 6x speedup over TTK, the current shared memory implementations. The paper also presents a comprehensive experimental analysis of different steps of the algorithm and reports on their contribution towards runtime performance. Finally, it introduces a CPU based data parallel algorithm for simplifying the Morse-Smale complex via iterative critical point pair cancellation.",
"title": "A GPU Parallel Algorithm for Computing Morse-Smale Complexes",
"normalizedTitle": "A GPU Parallel Algorithm for Computing Morse-Smale Complexes",
"fno": "09773959",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Parallel Algorithms",
"Graphics Processing Units",
"Three Dimensional Displays",
"Runtime",
"Manifolds",
"Indexes",
"Iterative Algorithms",
"Scalar Field",
"Morse Smale Complex",
"Shared Memory Parallel Algorithm",
"GPU"
],
"authors": [
{
"givenName": "Varshini",
"surname": "Subhash",
"fullName": "Varshini Subhash",
"affiliation": "Computer Science and Automation, Indian Institute of Science, 29120 Bangalore, Karnataka, India, 560012",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Karran",
"surname": "Pandey",
"fullName": "Karran Pandey",
"affiliation": "Computer Science and Automation, Indian Institute of Science, 29120 Bangalore, Karnataka, India",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vijay",
"surname": "Natarajan",
"fullName": "Vijay Natarajan",
"affiliation": "Computer Science and Automation, Indian Institute of Science, Bangalore, Karnataka, India, 560012",
"__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/ipdps/2012/4675/0/4675a484",
"title": "The Parallel Computation of Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2012/4675a484/12OmNrFBQ1B",
"parentPublication": {
"id": "proceedings/ipdps/2012/4675/0",
"title": "Parallel and Distributed Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciap/2007/2877/0/28770337",
"title": "Multi-resolution Morse-Smale Complexes for Terrain Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/iciap/2007/28770337/12OmNsbY6Tz",
"parentPublication": {
"id": "proceedings/iciap/2007/2877/0",
"title": "2007 14th International Conference on Image Analysis and Processing - ICIAP 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2005/2379/0/01563237",
"title": "Volumetric data analysis using Morse-Smale complexes",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2005/01563237/12OmNxaw5b1",
"parentPublication": {
"id": "proceedings/smi/2005/2379/0",
"title": "Proceedings. International Conference on Shape Modeling and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/04376172",
"title": "Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/04376172/13rRUwj7cp4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875918",
"title": "Conforming Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875918/13rRUwjGoLG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/10/ttg2012101757",
"title": "Parallel Computation of 2D Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/2012/10/ttg2012101757/13rRUxASuSL",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122014",
"title": "Computing Morse-Smale Complexes with Accurate Geometry",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122014/13rRUxZzAhE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/09/06065731",
"title": "Direct Feature Visualization Using Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/journal/tg/2012/09/06065731/13rRUyv53Fn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440824",
"title": "Shared-Memory Parallel Computation of Morse-Smale Complexes with Improved Accuracy",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440824/17D45Xh13tG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a036",
"title": "GPU Parallel Computation of Morse-Smale Complexes",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a036/1qRO66SHgwU",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09773967",
"articleId": "1DjDoKqOJz2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09774005",
"articleId": "1DjDpHtWZfa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1DligVPxqDu",
"name": "ttg555501-09773959s1-supp1-3174769.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09773959s1-supp1-3174769.pdf",
"extension": "pdf",
"size": "977 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNy7Qfq8",
"title": "July",
"year": "2011",
"issueNum": "07",
"idPrefix": "tm",
"pubType": "journal",
"volume": "10",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIJuxqh",
"doi": "10.1109/TMC.2010.214",
"abstract": "Since centralized data storage and search schemes often lead to high overhead and latency, distributed data-centric storage becomes a preferable approach in large-scale wireless sensor networks (WSNs). However, most of existing distributed methods lack optimization for spatial-temporal search to query events occurred in a certain geographical area and a certain time period. Furthermore, for data search routing, most methods rely on locating systems (e.g., GPS), which consume high energy. This paper proposes a distributed spatial-temporal Similarity Data Storage (SDS) scheme. SDS provides efficient spatial-temporal and similarity data searching service, and is applicable for both static and dynamic WSNs. It disseminates event data in such a way that the distance between WSN neighborhoods represents the similarity of data stored in them. In addition, SDS carpooling routing algorithm efficiently routes messages without the aid of GPS. Theoretical and experimental results show that SDS yields significant improvements on the efficiency of data querying compared with existing approaches, and obtains stable performance in dynamic environments.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Since centralized data storage and search schemes often lead to high overhead and latency, distributed data-centric storage becomes a preferable approach in large-scale wireless sensor networks (WSNs). However, most of existing distributed methods lack optimization for spatial-temporal search to query events occurred in a certain geographical area and a certain time period. Furthermore, for data search routing, most methods rely on locating systems (e.g., GPS), which consume high energy. This paper proposes a distributed spatial-temporal Similarity Data Storage (SDS) scheme. SDS provides efficient spatial-temporal and similarity data searching service, and is applicable for both static and dynamic WSNs. It disseminates event data in such a way that the distance between WSN neighborhoods represents the similarity of data stored in them. In addition, SDS carpooling routing algorithm efficiently routes messages without the aid of GPS. Theoretical and experimental results show that SDS yields significant improvements on the efficiency of data querying compared with existing approaches, and obtains stable performance in dynamic environments.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Since centralized data storage and search schemes often lead to high overhead and latency, distributed data-centric storage becomes a preferable approach in large-scale wireless sensor networks (WSNs). However, most of existing distributed methods lack optimization for spatial-temporal search to query events occurred in a certain geographical area and a certain time period. Furthermore, for data search routing, most methods rely on locating systems (e.g., GPS), which consume high energy. This paper proposes a distributed spatial-temporal Similarity Data Storage (SDS) scheme. SDS provides efficient spatial-temporal and similarity data searching service, and is applicable for both static and dynamic WSNs. It disseminates event data in such a way that the distance between WSN neighborhoods represents the similarity of data stored in them. In addition, SDS carpooling routing algorithm efficiently routes messages without the aid of GPS. Theoretical and experimental results show that SDS yields significant improvements on the efficiency of data querying compared with existing approaches, and obtains stable performance in dynamic environments.",
"title": "A Distributed Spatial-Temporal Similarity Data Storage Scheme in Wireless Sensor Networks",
"normalizedTitle": "A Distributed Spatial-Temporal Similarity Data Storage Scheme in Wireless Sensor Networks",
"fno": "ttm2011070982",
"hasPdf": true,
"idPrefix": "tm",
"keywords": [
"Wireless Sensor Networks",
"Data Centric Storage",
"Similarity Search"
],
"authors": [
{
"givenName": "Haiying",
"surname": "Shen",
"fullName": "Haiying Shen",
"affiliation": "Clemson University, Clemson",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lianyu",
"surname": "Zhao",
"fullName": "Lianyu Zhao",
"affiliation": "Clemson University, Clemson",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ze",
"surname": "Li",
"fullName": "Ze Li",
"affiliation": "Clemson University, Clemson",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2011-07-01 00:00:00",
"pubType": "trans",
"pages": "982-996",
"year": "2011",
"issn": "1536-1233",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ism/2008/3454/0/3454a286",
"title": "A Spatial Similarity Ranking Framework for Symbolic Pictures Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2008/3454a286/12OmNAXxX4g",
"parentPublication": {
"id": "proceedings/ism/2008/3454/0",
"title": "2008 Tenth IEEE International Symposium on Multimedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2006/0054/0/01639419",
"title": "Similarity-aware query processing in sensor networks",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2006/01639419/12OmNBqdr6J",
"parentPublication": {
"id": "proceedings/ipdps/2006/0054/0",
"title": "Proceedings 20th IEEE International Parallel & Distributed Processing Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ettandgrs/2008/3563/1/3563a041",
"title": "The Method of Extracting Refined Semantic Similarity among Objects of Heterogeneous Information Sources",
"doi": null,
"abstractUrl": "/proceedings-article/ettandgrs/2008/3563a041/12OmNCvLY0E",
"parentPublication": {
"id": "proceedings/ettandgrs/2008/3563/1",
"title": "Education Technology and Training & Geoscience and Remote Sensing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mascots/2008/2817/0/04770561",
"title": "Quantifying Temporal and Spatial Localities in Storage Workloads and Transformations by Data Path Components",
"doi": null,
"abstractUrl": "/proceedings-article/mascots/2008/04770561/12OmNviHKha",
"parentPublication": {
"id": "proceedings/mascots/2008/2817/0",
"title": "2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2015/9926/0/07364041",
"title": "Spatio-temporal similarity search method for disaster estimation",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2015/07364041/12OmNxYbSXf",
"parentPublication": {
"id": "proceedings/big-data/2015/9926/0",
"title": "2015 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sutc/2008/3158/0/3158a217",
"title": "Finding Similar Answers in Data-Centric Sensor Networks",
"doi": null,
"abstractUrl": "/proceedings-article/sutc/2008/3158a217/12OmNyQ7G2c",
"parentPublication": {
"id": "proceedings/sutc/2008/3158/0",
"title": "2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC '08)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2009/3735/5/3735e150",
"title": "A Novel Spatio-temporal Clustering Approach by Process Similarity",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2009/3735e150/12OmNzhna9t",
"parentPublication": {
"id": "proceedings/fskd/2009/3735/5",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122023",
"title": "Visualization of Temporal Similarity in Field Data",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122023/13rRUNvyath",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2009/08/ttk2009081147",
"title": "Similarity-Profiled Temporal Association Mining",
"doi": null,
"abstractUrl": "/journal/tk/2009/08/ttk2009081147/13rRUxOdD8y",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2021/9184/0/918400b224",
"title": "Spatial-Temporal Similarity for Trajectories with Location Noise and Sporadic Sampling",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2021/918400b224/1uGXdKhRDoI",
"parentPublication": {
"id": "proceedings/icde/2021/9184/0",
"title": "2021 IEEE 37th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttm2011070968",
"articleId": "13rRUxAAT1A",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttm2011070997",
"articleId": "13rRUxBa56L",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzaQoLU",
"title": "August",
"year": "1996",
"issueNum": "04",
"idPrefix": "tk",
"pubType": "journal",
"volume": "8",
"label": "August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwdrdKW",
"doi": "10.1109/69.536246",
"abstract": "Abstract—Spatial relationships are important ingredients for expressing constraints in retrieval systems for pictorial or multimedia databases. We have proposed a unified representation for spatial relationships, 2D Projection Interval Relationships (2D-PIR), that integrates both directional and topological relationships. In this paper we develop techniques for similarity retrieval based on the 2D-PIR representation, including a method for dealing with rotated and reflected images.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Spatial relationships are important ingredients for expressing constraints in retrieval systems for pictorial or multimedia databases. We have proposed a unified representation for spatial relationships, 2D Projection Interval Relationships (2D-PIR), that integrates both directional and topological relationships. In this paper we develop techniques for similarity retrieval based on the 2D-PIR representation, including a method for dealing with rotated and reflected images.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Spatial relationships are important ingredients for expressing constraints in retrieval systems for pictorial or multimedia databases. We have proposed a unified representation for spatial relationships, 2D Projection Interval Relationships (2D-PIR), that integrates both directional and topological relationships. In this paper we develop techniques for similarity retrieval based on the 2D-PIR representation, including a method for dealing with rotated and reflected images.",
"title": "Picture Similarity Retrieval Using the 2D Projection Interval Representation",
"normalizedTitle": "Picture Similarity Retrieval Using the 2D Projection Interval Representation",
"fno": "k0533",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Spatial Relationships",
"Similarity Retrieval",
"2 D PIR",
"Pictorial Databases",
"Multimedia Databases"
],
"authors": [
{
"givenName": "Mohammad",
"surname": "Nabil",
"fullName": "Mohammad Nabil",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anne H.H.",
"surname": "Ngu",
"fullName": "Anne H.H. Ngu",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Shepherd",
"fullName": "John Shepherd",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "1996-07-01 00:00:00",
"pubType": "trans",
"pages": "533-539",
"year": "1996",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "k0522",
"articleId": "13rRUwh80Hq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "k0540",
"articleId": "13rRUILc8fm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzkMlIs",
"title": "August",
"year": "2009",
"issueNum": "08",
"idPrefix": "tk",
"pubType": "journal",
"volume": "21",
"label": "August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxOdD8y",
"doi": "10.1109/TKDE.2008.185",
"abstract": "Given a time stamped transaction database and a user-defined reference sequence of interest over time, similarity-profiled temporal association mining discovers all associated item sets whose prevalence variations over time are similar to the reference sequence. The similar temporal association patterns can reveal interesting relationships of data items which co-occur with a particular event over time. Most works in temporal association mining have focused on capturing special temporal regulation patterns such as cyclic patterns and calendar scheme-based patterns. However, our model is flexible in representing interesting temporal patterns using a user-defined reference sequence. The dissimilarity degree of the sequence of support values of an item set to the reference sequence is used to capture how well its temporal prevalence variation matches the reference pattern. By exploiting interesting properties such as an envelope of support time sequence and a lower bounding distance for early pruning candidate item sets, we develop an algorithm for effectively mining similarity-profiled temporal association patterns. We prove the algorithm is correct and complete in the mining results and provide the computational analysis. Experimental results on real data as well as synthetic data show that the proposed algorithm is more efficient than a sequential method using a traditional support-pruning scheme.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Given a time stamped transaction database and a user-defined reference sequence of interest over time, similarity-profiled temporal association mining discovers all associated item sets whose prevalence variations over time are similar to the reference sequence. The similar temporal association patterns can reveal interesting relationships of data items which co-occur with a particular event over time. Most works in temporal association mining have focused on capturing special temporal regulation patterns such as cyclic patterns and calendar scheme-based patterns. However, our model is flexible in representing interesting temporal patterns using a user-defined reference sequence. The dissimilarity degree of the sequence of support values of an item set to the reference sequence is used to capture how well its temporal prevalence variation matches the reference pattern. By exploiting interesting properties such as an envelope of support time sequence and a lower bounding distance for early pruning candidate item sets, we develop an algorithm for effectively mining similarity-profiled temporal association patterns. We prove the algorithm is correct and complete in the mining results and provide the computational analysis. Experimental results on real data as well as synthetic data show that the proposed algorithm is more efficient than a sequential method using a traditional support-pruning scheme.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Given a time stamped transaction database and a user-defined reference sequence of interest over time, similarity-profiled temporal association mining discovers all associated item sets whose prevalence variations over time are similar to the reference sequence. The similar temporal association patterns can reveal interesting relationships of data items which co-occur with a particular event over time. Most works in temporal association mining have focused on capturing special temporal regulation patterns such as cyclic patterns and calendar scheme-based patterns. However, our model is flexible in representing interesting temporal patterns using a user-defined reference sequence. The dissimilarity degree of the sequence of support values of an item set to the reference sequence is used to capture how well its temporal prevalence variation matches the reference pattern. By exploiting interesting properties such as an envelope of support time sequence and a lower bounding distance for early pruning candidate item sets, we develop an algorithm for effectively mining similarity-profiled temporal association patterns. We prove the algorithm is correct and complete in the mining results and provide the computational analysis. Experimental results on real data as well as synthetic data show that the proposed algorithm is more efficient than a sequential method using a traditional support-pruning scheme.",
"title": "Similarity-Profiled Temporal Association Mining",
"normalizedTitle": "Similarity-Profiled Temporal Association Mining",
"fno": "ttk2009081147",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Temporal Data Mining",
"Temporal Association Pattern",
"Support Time Sequence",
"Similarity"
],
"authors": [
{
"givenName": "Jin Soung",
"surname": "Yoo",
"fullName": "Jin Soung Yoo",
"affiliation": "Indiana University-Purdue University, Fort Wayne",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shashi",
"surname": "Shekhar",
"fullName": "Shashi Shekhar",
"affiliation": "University of Minnesota, Minneapolis",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2009-08-01 00:00:00",
"pubType": "trans",
"pages": "1147-1161",
"year": "2009",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2000/0506/0/05060306",
"title": "Discovering Temporal Association Rules: Algorithms, Language and System",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2000/05060306/12OmNBO3Kkj",
"parentPublication": {
"id": "proceedings/icde/2000/0506/0",
"title": "Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2009/3804/3/3804c703",
"title": "Research on Mining Sequential Positive and Negative Association Rules",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2009/3804c703/12OmNvAAtru",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eknow/2010/3956/0/3956a086",
"title": "Mining Several Kinds of Temporal Association Rules Enhanced by Tree Structures",
"doi": null,
"abstractUrl": "/proceedings-article/eknow/2010/3956a086/12OmNwF0BXm",
"parentPublication": {
"id": "proceedings/eknow/2010/3956/0",
"title": "Information, Process, and Knowledge Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2009/3726/2/3726b025",
"title": "Variable Support Based Association Rule Mining",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2009/3726b025/12OmNwdbV6G",
"parentPublication": {
"id": "proceedings/compsac/2009/3726/2",
"title": "2009 33rd Annual IEEE International Computer Software and Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccima/2005/2358/0/23580146",
"title": "Mining Sequential Association-Rule for Improving WEB Document Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/iccima/2005/23580146/12OmNyQphaE",
"parentPublication": {
"id": "proceedings/iccima/2005/2358/0",
"title": "Proceedings. Sixth International Conference on Computational Intelligence and Multimedia Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2008/3503/0/3503a218",
"title": "Mining Temporal Patterns with Quantitative Intervals",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2008/3503a218/12OmNypIYF1",
"parentPublication": {
"id": "proceedings/icdmw/2008/3503/0",
"title": "2008 IEEE International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imsccs/2006/2581/2/258120739",
"title": "Temporal Association Rules in Mining Method",
"doi": null,
"abstractUrl": "/proceedings-article/imsccs/2006/258120739/12OmNyugyRn",
"parentPublication": {
"id": "proceedings/imsccs/2006/2581/2",
"title": "First International on Computer and Computational Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2012/4925/0/4925a813",
"title": "Comparative Study of Association Rule Mining and MiSTIC in Extracting Spatio-temporal Disease Occurrences Patterns",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2012/4925a813/12OmNzBOi7k",
"parentPublication": {
"id": "proceedings/icdmw/2012/4925/0",
"title": "2012 IEEE 12th International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse/2011/4477/0/4477a392",
"title": "Temporal Association Rules Mining in T-databases Using Pipeline Technique",
"doi": null,
"abstractUrl": "/proceedings-article/cse/2011/4477a392/12OmNzC5Tfi",
"parentPublication": {
"id": "proceedings/cse/2011/4477/0",
"title": "2011 14th IEEE International Conference on Computational Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/1998/03/k0389",
"title": "Temporal Association Algebra: A Mathematical Foundation for Processing Object-Oriented Temporal Databases",
"doi": null,
"abstractUrl": "/journal/tk/1998/03/k0389/13rRUwghd5i",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttk2009081133",
"articleId": "13rRUwh80BP",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttk2009081162",
"articleId": "13rRUxASuGF",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqESuil",
"title": "Sept.",
"year": "2013",
"issueNum": "09",
"idPrefix": "tk",
"pubType": "journal",
"volume": "25",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILtJzQ",
"doi": "10.1109/TKDE.2012.154",
"abstract": "We propose to mine the graph topology of a large attributed graph by finding regularities among vertex descriptors. Such descriptors are of two types: 1) the vertex attributes that convey the information of the vertices themselves and 2) some topological properties used to describe the connectivity of the vertices. These descriptors are mostly of numerical or ordinal types and their similarity can be captured by quantifying their covariation. Mining topological patterns relies on frequent pattern mining and graph topology analysis to reveal the links that exist between the relation encoded by the graph and the vertex attributes. We propose three interestingness measures of topological patterns that differ by the pairs of vertices considered while evaluating up and down co-variations between vertex descriptors. An efficient algorithm that combines search and pruning strategies to look for the most relevant topological patterns is presented. Besides a classical empirical study, we report case studies on four real-life networks showing that our approach provides valuable knowledge.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose to mine the graph topology of a large attributed graph by finding regularities among vertex descriptors. Such descriptors are of two types: 1) the vertex attributes that convey the information of the vertices themselves and 2) some topological properties used to describe the connectivity of the vertices. These descriptors are mostly of numerical or ordinal types and their similarity can be captured by quantifying their covariation. Mining topological patterns relies on frequent pattern mining and graph topology analysis to reveal the links that exist between the relation encoded by the graph and the vertex attributes. We propose three interestingness measures of topological patterns that differ by the pairs of vertices considered while evaluating up and down co-variations between vertex descriptors. An efficient algorithm that combines search and pruning strategies to look for the most relevant topological patterns is presented. Besides a classical empirical study, we report case studies on four real-life networks showing that our approach provides valuable knowledge.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose to mine the graph topology of a large attributed graph by finding regularities among vertex descriptors. Such descriptors are of two types: 1) the vertex attributes that convey the information of the vertices themselves and 2) some topological properties used to describe the connectivity of the vertices. These descriptors are mostly of numerical or ordinal types and their similarity can be captured by quantifying their covariation. Mining topological patterns relies on frequent pattern mining and graph topology analysis to reveal the links that exist between the relation encoded by the graph and the vertex attributes. We propose three interestingness measures of topological patterns that differ by the pairs of vertices considered while evaluating up and down co-variations between vertex descriptors. An efficient algorithm that combines search and pruning strategies to look for the most relevant topological patterns is presented. Besides a classical empirical study, we report case studies on four real-life networks showing that our approach provides valuable knowledge.",
"title": "Mining Graph Topological Patterns: Finding Covariations among Vertex Descriptors",
"normalizedTitle": "Mining Graph Topological Patterns: Finding Covariations among Vertex Descriptors",
"fno": "ttk2013092090",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Upper Bound",
"Indexes",
"Communities",
"Microscopy",
"Data Mining",
"Topology",
"Algorithm Design And Analysis",
"Topological Patterns",
"Data Mining",
"Mining Methods And Analysis",
"Attributed Graph Mining"
],
"authors": [
{
"givenName": "Adriana",
"surname": "Prado",
"fullName": "Adriana Prado",
"affiliation": "Université de Lyon, CNRS, INSA-Lyon, LIRIS, Villeurbanne",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marc",
"surname": "Plantevit",
"fullName": "Marc Plantevit",
"affiliation": "Université de Lyon, CNRS, INSA-Lyon, LIRIS, Villeurbanne",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Celine",
"surname": "Robardet",
"fullName": "Celine Robardet",
"affiliation": "Université de Lyon, CNRS, Université Lyon 1, LIRIS",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jean-Francois",
"surname": "Boulicaut",
"fullName": "Jean-Francois Boulicaut",
"affiliation": "Université de Lyon, CNRS, INSA-Lyon, LIRIS, Villeurbanne",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2013-09-01 00:00:00",
"pubType": "trans",
"pages": "2090-2104",
"year": "2013",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ccgrid/2017/6611/0/07973780",
"title": "Mermaid: Integrating Vertex-Centric with Edge-Centric for Real-World Graph Processing",
"doi": null,
"abstractUrl": "/proceedings-article/ccgrid/2017/07973780/12OmNAXPy6R",
"parentPublication": {
"id": "proceedings/ccgrid/2017/6611/0",
"title": "2017 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2012/4925/0/4925a898",
"title": "Supporting the Discovery of Relevant Topological Patterns in Attributed Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2012/4925a898/12OmNBNM91z",
"parentPublication": {
"id": "proceedings/icdmw/2012/4925/0",
"title": "2012 IEEE 12th International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1996/7594/0/75940462",
"title": "Computing vertex connectivity: new bounds from old techniques",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1996/75940462/12OmNvmowSH",
"parentPublication": {
"id": "proceedings/focs/1996/7594/0",
"title": "Proceedings of 37th Conference on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1983/5428/0/542800031",
"title": "A topological approach to evasiveness",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1983/542800031/12OmNx8fig2",
"parentPublication": {
"id": "proceedings/focs/1983/5428/0",
"title": "24th Annual Symposium on Foundations of Computer Science (sfcs 1983)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2011/4569/0/4569a360",
"title": "Fast Random Walks on Finite Graphs and Graph Topological Information",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2011/4569a360/12OmNzUPpdp",
"parentPublication": {
"id": "proceedings/icnc/2011/4569/0",
"title": "2011 Second International Conference on Networking and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122041",
"title": "Augmented Topological Descriptors of Pore Networks for Material Science",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122041/13rRUxly8ST",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/05/09709096",
"title": "CenGCN: Centralized Convolutional Networks with Vertex Imbalance for Scale-Free Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2023/05/09709096/1AR0rzTQuys",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09721603",
"title": "Topological Simplifications of Hypergraphs",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09721603/1BhzoNy6wWA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2019/1246/0/124600b019",
"title": "Incrementalization of Vertex-Centric Programs",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2019/124600b019/1cYhNMRkHVm",
"parentPublication": {
"id": "proceedings/ipdps/2019/1246/0",
"title": "2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/02/09521820",
"title": "Learning Graph Convolutional Networks Based on Quantum Vertex Information Propagation",
"doi": null,
"abstractUrl": "/journal/tk/2023/02/09521820/1wkrmFr2JUY",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttk2013092076",
"articleId": "13rRUIJuxvF",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttk2013092105",
"articleId": "13rRUy2YLYW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet40",
"name": "ttk2013092090s1.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttk2013092090s1.pdf",
"extension": "pdf",
"size": "80.1 kB",
"__typename": "WebExtraType"
}
],
"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": "13rRUxly8SV",
"doi": "10.1109/TVCG.2012.248",
"abstract": "The extraction of significant structures in arbitrary high-dimensional data sets is a challenging task. Moreover, classifying data points as noise in order to reduce a data set bears special relevance for many application domains. Standard methods such as clustering serve to reduce problem complexity by providing the user with classes of similar entities. However, they usually do not highlight relations between different entities and require a stopping criterion, e.g. the number of clusters to be detected. In this paper, we present a visualization pipeline based on recent advancements in algebraic topology. More precisely, we employ methods from persistent homology that enable topological data analysis on high-dimensional data sets. Our pipeline inherently copes with noisy data and data sets of arbitrary dimensions. It extracts central structures of a data set in a hierarchical manner by using a persistence-based filtering algorithm that is theoretically well-founded. We furthermore introduce persistence rings, a novel visualization technique for a class of topological features-the persistence intervals-of large data sets. Persistence rings provide a unique topological signature of a data set, which helps in recognizing similarities. In addition, we provide interactive visualization techniques that assist the user in evaluating the parameter space of our method in order to extract relevant structures. We describe and evaluate our analysis pipeline by means of two very distinct classes of data sets: First, a class of synthetic data sets containing topological objects is employed to highlight the interaction capabilities of our method. Second, in order to affirm the utility of our technique, we analyse a class of high-dimensional real-world data sets arising from current research in cultural heritage.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The extraction of significant structures in arbitrary high-dimensional data sets is a challenging task. Moreover, classifying data points as noise in order to reduce a data set bears special relevance for many application domains. Standard methods such as clustering serve to reduce problem complexity by providing the user with classes of similar entities. However, they usually do not highlight relations between different entities and require a stopping criterion, e.g. the number of clusters to be detected. In this paper, we present a visualization pipeline based on recent advancements in algebraic topology. More precisely, we employ methods from persistent homology that enable topological data analysis on high-dimensional data sets. Our pipeline inherently copes with noisy data and data sets of arbitrary dimensions. It extracts central structures of a data set in a hierarchical manner by using a persistence-based filtering algorithm that is theoretically well-founded. We furthermore introduce persistence rings, a novel visualization technique for a class of topological features-the persistence intervals-of large data sets. Persistence rings provide a unique topological signature of a data set, which helps in recognizing similarities. In addition, we provide interactive visualization techniques that assist the user in evaluating the parameter space of our method in order to extract relevant structures. We describe and evaluate our analysis pipeline by means of two very distinct classes of data sets: First, a class of synthetic data sets containing topological objects is employed to highlight the interaction capabilities of our method. Second, in order to affirm the utility of our technique, we analyse a class of high-dimensional real-world data sets arising from current research in cultural heritage.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The extraction of significant structures in arbitrary high-dimensional data sets is a challenging task. Moreover, classifying data points as noise in order to reduce a data set bears special relevance for many application domains. Standard methods such as clustering serve to reduce problem complexity by providing the user with classes of similar entities. However, they usually do not highlight relations between different entities and require a stopping criterion, e.g. the number of clusters to be detected. In this paper, we present a visualization pipeline based on recent advancements in algebraic topology. More precisely, we employ methods from persistent homology that enable topological data analysis on high-dimensional data sets. Our pipeline inherently copes with noisy data and data sets of arbitrary dimensions. It extracts central structures of a data set in a hierarchical manner by using a persistence-based filtering algorithm that is theoretically well-founded. We furthermore introduce persistence rings, a novel visualization technique for a class of topological features-the persistence intervals-of large data sets. Persistence rings provide a unique topological signature of a data set, which helps in recognizing similarities. In addition, we provide interactive visualization techniques that assist the user in evaluating the parameter space of our method in order to extract relevant structures. We describe and evaluate our analysis pipeline by means of two very distinct classes of data sets: First, a class of synthetic data sets containing topological objects is employed to highlight the interaction capabilities of our method. Second, in order to affirm the utility of our technique, we analyse a class of high-dimensional real-world data sets arising from current research in cultural heritage.",
"title": "Multivariate Data Analysis Using Persistence-Based Filtering and Topological Signatures",
"normalizedTitle": "Multivariate Data Analysis Using Persistence-Based Filtering and Topological Signatures",
"fno": "ttg2012122382",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Topology",
"Data Analysis",
"Data Structures",
"Data Visualisation",
"History",
"Information Filtering",
"Pattern Classification",
"Cultural Heritage",
"Multivariate Data Analysis",
"Topological Signatures",
"Significant Structures Extraction",
"Arbitrary High Dimensional Data Sets",
"Data Points Classification",
"Problem Complexity",
"Stopping Criterion",
"Visualization Pipeline",
"Algebraic Topology",
"Persistent Homology",
"Topological Data Analysis",
"Noisy Data",
"Central Structures",
"Hierarchical Manner",
"Persistence Based Filtering Algorithm",
"Persistence Rings",
"Topological Features",
"Large Data Sets",
"Interactive Visualization Techniques",
"Parameter Space Evaluation",
"Relevant Structures",
"Analysis Pipeline",
"Synthetic Data Sets",
"Topological Objects",
"Interaction Capability",
"High Dimensional Real World Data Sets",
"Network Topology",
"Clustering Methods",
"Multivariate Data Sets",
"Clustering",
"Topological Persistence",
"Multivariate Data"
],
"authors": [
{
"givenName": "B.",
"surname": "Rieck",
"fullName": "B. Rieck",
"affiliation": "Interdiscipl. Center for Sci. Comput. (IWR), Heidelberg Univ., Heidelberg, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "H.",
"surname": "Mara",
"fullName": "H. Mara",
"affiliation": "Interdiscipl. Center for Sci. Comput. (IWR), Heidelberg Univ., Heidelberg, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "H.",
"surname": "Leitte",
"fullName": "H. Leitte",
"affiliation": "Interdiscipl. Center for Sci. Comput. (IWR), Heidelberg Univ., Heidelberg, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2382-2391",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/itc/2005/9038/0/01584074",
"title": "STIL persistence [data reduction]",
"doi": null,
"abstractUrl": "/proceedings-article/itc/2005/01584074/12OmNC8Msx7",
"parentPublication": {
"id": "proceedings/itc/2005/9038/0",
"title": "IEEE International Conference on Test, 2005.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwooos/1996/7692/0/76920122",
"title": "Critique of orthogonal persistence",
"doi": null,
"abstractUrl": "/proceedings-article/iwooos/1996/76920122/12OmNCxbXFk",
"parentPublication": {
"id": "proceedings/iwooos/1996/7692/0",
"title": "Object-Orientation in Operating Systems, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/2000/0850/0/08500454",
"title": "Topological persistence and simplification",
"doi": null,
"abstractUrl": "/proceedings-article/focs/2000/08500454/12OmNvT2oZT",
"parentPublication": {
"id": "proceedings/focs/2000/0850/0",
"title": "Proceedings 41st Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dante/1999/0496/0/04960213",
"title": "Interacting with Topological Invariants of Spatial Databases",
"doi": null,
"abstractUrl": "/proceedings-article/dante/1999/04960213/12OmNzhELh9",
"parentPublication": {
"id": "proceedings/dante/1999/0496/0",
"title": "Database Applications in Non-Traditional Environments, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2009/3735/6/3735f479",
"title": "Topological Spaces for Fuzzy Rough Sets Determined by Fuzzy Implication Operators",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2009/3735f479/12OmNzt0IHA",
"parentPublication": {
"id": "proceedings/fskd/2009/3735/6",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061251",
"title": "Computing Robustness and Persistence for Images",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061251/13rRUNvgyWk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2012/04/tts2012040909",
"title": "Pert: The Application-Aware Tailoring of Java Object Persistence",
"doi": null,
"abstractUrl": "/journal/ts/2012/04/tts2012040909/13rRUwjXZLt",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__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/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/cvprw/2020/9360/0/09151070",
"title": "PI-Net: A Deep Learning Approach to Extract Topological Persistence Images",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2020/09151070/1lPHfl0ffna",
"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": "ttg2012122372",
"articleId": "13rRUwghd97",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122392",
"articleId": "13rRUwjGoG0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRX2",
"name": "ttg2012122382s1.avi",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012122382s1.avi",
"extension": "avi",
"size": "33.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBTawgY",
"title": "July-Aug.",
"year": "2016",
"issueNum": "04",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "18",
"label": "July-Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyYSWo2",
"doi": "10.1109/MCSE.2016.49",
"abstract": "Pore network modeling is a widely used technique for simulating multiphase transport in porous materials, but there are very few software options available. This work outlines the OpenPNM package that was jointly developed by several porous media research groups to help address this gap. OpenPNM is written in Python using NumPy and SciPy for most mathematical operations, thus combining Python's ease of use with the performance necessary to perform large simulations. The package assists the user with managing and interacting with all the topological, geometrical, and thermophysical data. It also includes a suite of commonly used algorithms for simulating percolation and performing transport calculations on pore networks. Most importantly, it was designed to be highly flexible to suit any application and be easily customized to include user-specified pore-scale physics models. The framework is fast, powerful, and concise. An illustrative example is included that determines the effective diffusivity through a partially water-saturated porous material with just 29 lines of code.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Pore network modeling is a widely used technique for simulating multiphase transport in porous materials, but there are very few software options available. This work outlines the OpenPNM package that was jointly developed by several porous media research groups to help address this gap. OpenPNM is written in Python using NumPy and SciPy for most mathematical operations, thus combining Python's ease of use with the performance necessary to perform large simulations. The package assists the user with managing and interacting with all the topological, geometrical, and thermophysical data. It also includes a suite of commonly used algorithms for simulating percolation and performing transport calculations on pore networks. Most importantly, it was designed to be highly flexible to suit any application and be easily customized to include user-specified pore-scale physics models. The framework is fast, powerful, and concise. An illustrative example is included that determines the effective diffusivity through a partially water-saturated porous material with just 29 lines of code.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Pore network modeling is a widely used technique for simulating multiphase transport in porous materials, but there are very few software options available. This work outlines the OpenPNM package that was jointly developed by several porous media research groups to help address this gap. OpenPNM is written in Python using NumPy and SciPy for most mathematical operations, thus combining Python's ease of use with the performance necessary to perform large simulations. The package assists the user with managing and interacting with all the topological, geometrical, and thermophysical data. It also includes a suite of commonly used algorithms for simulating percolation and performing transport calculations on pore networks. Most importantly, it was designed to be highly flexible to suit any application and be easily customized to include user-specified pore-scale physics models. The framework is fast, powerful, and concise. An illustrative example is included that determines the effective diffusivity through a partially water-saturated porous material with just 29 lines of code.",
"title": "OpenPNM: A Pore Network Modeling Package",
"normalizedTitle": "OpenPNM: A Pore Network Modeling Package",
"fno": "mcs2016040060",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Computational Modeling",
"Mathematical Model",
"Object Recognition",
"Modeling",
"Open Source Software",
"Network Topology",
"Scientific Computing",
"Pore Network Modeling",
"Percolation Theory",
"Open Source Software",
"Python",
"Transport Phenomena",
"Porous Media"
],
"authors": [
{
"givenName": "Jeff",
"surname": "Gostick",
"fullName": "Jeff Gostick",
"affiliation": "McGill University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mahmoudreza",
"surname": "Aghighi",
"fullName": "Mahmoudreza Aghighi",
"affiliation": "McGill University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "James",
"surname": "Hinebaugh",
"fullName": "James Hinebaugh",
"affiliation": "University of Toronto",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tom",
"surname": "Tranter",
"fullName": "Tom Tranter",
"affiliation": "University of Leeds",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael A.",
"surname": "Hoeh",
"fullName": "Michael A. Hoeh",
"affiliation": "Forschungszentrum Jülich",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Harold",
"surname": "Day",
"fullName": "Harold Day",
"affiliation": "McGill University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Brennan",
"surname": "Spellacy",
"fullName": "Brennan Spellacy",
"affiliation": "McGill University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mostafa H.",
"surname": "Sharqawy",
"fullName": "Mostafa H. Sharqawy",
"affiliation": "University of Toronto and University of Guelph",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Aimy",
"surname": "Bazylak",
"fullName": "Aimy Bazylak",
"affiliation": "University of Toronto",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alan",
"surname": "Burns",
"fullName": "Alan Burns",
"affiliation": "University of Leeds",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Werner",
"surname": "Lehnert",
"fullName": "Werner Lehnert",
"affiliation": "Forschungszentrum Jülich and RWTH Aachen",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andreas",
"surname": "Putz",
"fullName": "Andreas Putz",
"affiliation": "Automotive Fuel Cell Cooperation",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2016-07-01 00:00:00",
"pubType": "mags",
"pages": "60-74",
"year": "2016",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dac/1987/0781/0/01586206",
"title": "ESP: A New Standard Cell Placement Package Using Simulated Evolution",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1987/01586206/12OmNrH1PBc",
"parentPublication": {
"id": "proceedings/dac/1987/0781/0",
"title": "24th ACM/IEEE Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2017/4283/0/4283a261",
"title": "Modelling Complex Volume Shape Using Ellipsoid: Application to Pore Space Representation",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2017/4283a261/12OmNs0C9By",
"parentPublication": {
"id": "proceedings/sitis/2017/4283/0",
"title": "2017 13th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cacsd/1994/1800/0/00288935",
"title": "An extension of a CACSD package for network analysis: Metanet",
"doi": null,
"abstractUrl": "/proceedings-article/cacsd/1994/00288935/12OmNyqRnj1",
"parentPublication": {
"id": "proceedings/cacsd/1994/1800/0",
"title": "Proceedings of IEEE Symposium on Computer-Aided Control Systems Design (CACSD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsm/2007/1255/0/04362622",
"title": "Package Surface Blueprints: Visually Supporting the Understanding of Package Relationships",
"doi": null,
"abstractUrl": "/proceedings-article/icsm/2007/04362622/12OmNzWx0bH",
"parentPublication": {
"id": "proceedings/icsm/2007/1255/0",
"title": "2007 IEEE International Conference on Software Maintenance",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2014/06/mcs2014060022",
"title": "High-Resolution Simulation of Pore-Scale Reactive Transport Processes Associated with Carbon Sequestration",
"doi": null,
"abstractUrl": "/magazine/cs/2014/06/mcs2014060022/13rRUxASu7B",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/dt/1990/03/d3025",
"title": "A VHDL Standard Package for Logic Modeling",
"doi": null,
"abstractUrl": "/magazine/dt/1990/03/d3025/13rRUxN5ex9",
"parentPublication": {
"id": "mags/dt",
"title": "IEEE Design & Test of Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bcd/2018/5605/0/560500a055",
"title": "Understanding Popularity Growth of Packages in JavaScript Package Ecosystem",
"doi": null,
"abstractUrl": "/proceedings-article/bcd/2018/560500a055/17D45VtKiyR",
"parentPublication": {
"id": "proceedings/bcd/2018/5605/0",
"title": "2018 IEEE International Conference on Big Data, Cloud Computing, Data Science & Engineering (BCD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2019/2607/2/260702a080",
"title": "Modeling the Structured Porous Network Using Stacked Ensemble Learning",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2019/260702a080/1cYirW7uG5y",
"parentPublication": {
"id": "compsac/2019/2607/2",
"title": "2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icedme/2020/8145/0/09122190",
"title": "Effect of internal and external porous structure design on stress distribution of implant bridge: A Finite element analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icedme/2020/09122190/1kRSAvopeJa",
"parentPublication": {
"id": "proceedings/icedme/2020/8145/0",
"title": "2020 3rd International Conference on Electron Device and Mechanical Engineering (ICEDME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsec/2020/9553/0/955300a228",
"title": "Technical Lag of Dependencies in Major Package Managers",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2020/955300a228/1rCgCYExUje",
"parentPublication": {
"id": "proceedings/apsec/2020/9553/0",
"title": "2020 27th Asia-Pacific Software Engineering Conference (APSEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcs2016040053",
"articleId": "13rRUyg2jM1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcs2016040075",
"articleId": "13rRUEgs2xa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzFdtc9",
"title": "Aug.",
"year": "2012",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUB7a110",
"doi": "10.1109/TVCG.2011.156",
"abstract": "This paper develops a novel surface fitting scheme for automatically reconstructing a genus-0 object into a continuous parametric spline surface. A key contribution for making such a fitting method both practical and accurate is our spherical generalization of the Delaunay configuration B-spline (DCB-spline), a new non-tensor-product spline. In this framework, we efficiently compute Delaunay configurations on sphere by the union of two planar Delaunay configurations. Also, we develop a hierarchical and adaptive method that progressively improves the fitting quality by new knot-insertion strategies guided by surface geometry and fitting error. Within our framework, a genus-0 model can be converted to a single spherical spline representation whose root mean square error is tightly bounded within a user-specified tolerance. The reconstructed continuous representation has many attractive properties such as global smoothness and no auxiliary knots. We conduct several experiments to demonstrate the efficacy of our new approach for reverse engineering and shape modeling.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper develops a novel surface fitting scheme for automatically reconstructing a genus-0 object into a continuous parametric spline surface. A key contribution for making such a fitting method both practical and accurate is our spherical generalization of the Delaunay configuration B-spline (DCB-spline), a new non-tensor-product spline. In this framework, we efficiently compute Delaunay configurations on sphere by the union of two planar Delaunay configurations. Also, we develop a hierarchical and adaptive method that progressively improves the fitting quality by new knot-insertion strategies guided by surface geometry and fitting error. Within our framework, a genus-0 model can be converted to a single spherical spline representation whose root mean square error is tightly bounded within a user-specified tolerance. The reconstructed continuous representation has many attractive properties such as global smoothness and no auxiliary knots. We conduct several experiments to demonstrate the efficacy of our new approach for reverse engineering and shape modeling.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper develops a novel surface fitting scheme for automatically reconstructing a genus-0 object into a continuous parametric spline surface. A key contribution for making such a fitting method both practical and accurate is our spherical generalization of the Delaunay configuration B-spline (DCB-spline), a new non-tensor-product spline. In this framework, we efficiently compute Delaunay configurations on sphere by the union of two planar Delaunay configurations. Also, we develop a hierarchical and adaptive method that progressively improves the fitting quality by new knot-insertion strategies guided by surface geometry and fitting error. Within our framework, a genus-0 model can be converted to a single spherical spline representation whose root mean square error is tightly bounded within a user-specified tolerance. The reconstructed continuous representation has many attractive properties such as global smoothness and no auxiliary knots. We conduct several experiments to demonstrate the efficacy of our new approach for reverse engineering and shape modeling.",
"title": "Spherical DCB-Spline Surfaces with Hierarchical and Adaptive Knot Insertion",
"normalizedTitle": "Spherical DCB-Spline Surfaces with Hierarchical and Adaptive Knot Insertion",
"fno": "06025349",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Tensors",
"Computational Geometry",
"Least Mean Squares Methods",
"Mesh Generation",
"Splines Mathematics",
"Surface Fitting",
"Hierarchical Knot Insertion",
"Spherical DCB Spline Surfaces",
"Adaptive Knot Insertion",
"Novel Surface Fitting Scheme",
"Continuous Parametric Spline Surface",
"Delaunay Configuration B Spline",
"Nontensor Product Spline",
"Surface Geometry",
"Genus 0 Model",
"Spherical Spline Representation",
"Reconstructed Continuous Representation",
"Reverse Engineering",
"Shape Modeling",
"Root Mean Square Error",
"Splines Mathematics",
"Surface Reconstruction",
"Polynomials",
"Approximation Methods",
"Surface Treatment",
"Electronic Mail",
"Image Reconstruction",
"Non Tensor Product B Splines",
"Delaunay Configurations",
"Spherical Splines",
"Knot Placement",
"Knot Insertion"
],
"authors": [
{
"givenName": null,
"surname": "Xin Li",
"fullName": "Xin Li",
"affiliation": "Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Juan Cao",
"fullName": "Juan Cao",
"affiliation": "Sch. of Math. Sci., Xiamen Univ., Xiamen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Zhonggui Chen",
"fullName": "Zhonggui Chen",
"affiliation": "Dept. of Comput. Sci., Xiamen Univ., Xiamen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Hong Qin",
"fullName": "Hong Qin",
"affiliation": "Dept. of Comput. Sci., Stony Brook Univ., Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2012-08-01 00:00:00",
"pubType": "trans",
"pages": "1290-1303",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ccc/2002/1468/0/14680024",
"title": "3-MANIFOLD KNOT GENUS is NP-complete",
"doi": null,
"abstractUrl": "/proceedings-article/ccc/2002/14680024/12OmNAolGLQ",
"parentPublication": {
"id": "proceedings/ccc/2002/1468/0",
"title": "Proceedings 17th IEEE Annual Conference on Computational Complexity",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdh/2016/4400/0/4400a272",
"title": "A Balanced Surface Parameterization Method and Its Application to Spline Fitting",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2016/4400a272/12OmNBC8Awf",
"parentPublication": {
"id": "proceedings/icdh/2016/4400/0",
"title": "2016 6th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dpvt/2006/2825/0/04155783",
"title": "Fast safe spline surrogates for large point clouds",
"doi": null,
"abstractUrl": "/proceedings-article/3dpvt/2006/04155783/12OmNBqdr22",
"parentPublication": {
"id": "proceedings/3dpvt/2006/2825/0",
"title": "Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a119",
"title": "The Spherical Images of Triangular Mesh Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a119/12OmNCvLY0n",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2009/3791/0/3791a132",
"title": "On Spherical Product Surfaces in E3",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2009/3791a132/12OmNrFkeRT",
"parentPublication": {
"id": "proceedings/cw/2009/3791/0",
"title": "2009 International Conference on CyberWorlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gmai/2007/2901/0/29010085",
"title": "Capturing Outlines of Planar Images by Fuzzy Randomized Knot Insertion to Cubic Spline",
"doi": null,
"abstractUrl": "/proceedings-article/gmai/2007/29010085/12OmNrJiCHB",
"parentPublication": {
"id": "proceedings/gmai/2007/2901/0",
"title": "2007 Geometric Modeling and Imaging: New Advances",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2000/0643/0/06430163",
"title": "Reconstruction of B-Spline Surfaces from Scattered Data Points",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2000/06430163/12OmNwnH4Ua",
"parentPublication": {
"id": "proceedings/cgi/2000/0643/0",
"title": "Computer Graphics International Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1988/0878/0/00028227",
"title": "Calculation method of surface representation using B spline mask",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1988/00028227/12OmNxWuiip",
"parentPublication": {
"id": "proceedings/icpr/1988/0878/0",
"title": "9th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icic/2011/688/0/05954508",
"title": "An Improved Algorithm for Surface Fitting Based on B Spline Function",
"doi": null,
"abstractUrl": "/proceedings-article/icic/2011/05954508/12OmNxXCGLN",
"parentPublication": {
"id": "proceedings/icic/2011/688/0",
"title": "2011 Fourth International Conference on Information and Computing (ICIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2000/0868/0/08680202",
"title": "Subdivision Surface Fitting Using QEM-Based Mesh Simplification and Reconstruction of Approximated B-Spline Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2000/08680202/12OmNy49sFt",
"parentPublication": {
"id": "proceedings/pg/2000/0868/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06143942",
"articleId": "13rRUxC0SvQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06165281",
"articleId": "13rRUILtJm8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqBKTZy",
"title": "May",
"year": "1989",
"issueNum": "05",
"idPrefix": "ts",
"pubType": "journal",
"volume": "15",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwI5U9l",
"doi": "10.1109/32.24714",
"abstract": "A distributed knot detection algorithm for general graphs is presented. The knot detection algorithm uses at most O(n log n+m) messages and O(m+n log n) bits of memory to detect all knots' nodes in the network (where n is the number of nodes and m is the number of links). This is compared to O(n/sup 2/) messages needed in the best algorithm previously published. The knot detection algorithm makes use of efficient cycle detection and clustering techniques. Various applications for the knot detection algorithms are presented. In particular, its importance to deadlock detection in store and forward communication networks and in transaction systems is demonstrated.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A distributed knot detection algorithm for general graphs is presented. The knot detection algorithm uses at most O(n log n+m) messages and O(m+n log n) bits of memory to detect all knots' nodes in the network (where n is the number of nodes and m is the number of links). This is compared to O(n/sup 2/) messages needed in the best algorithm previously published. The knot detection algorithm makes use of efficient cycle detection and clustering techniques. Various applications for the knot detection algorithms are presented. In particular, its importance to deadlock detection in store and forward communication networks and in transaction systems is demonstrated.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A distributed knot detection algorithm for general graphs is presented. The knot detection algorithm uses at most O(n log n+m) messages and O(m+n log n) bits of memory to detect all knots' nodes in the network (where n is the number of nodes and m is the number of links). This is compared to O(n/sup 2/) messages needed in the best algorithm previously published. The knot detection algorithm makes use of efficient cycle detection and clustering techniques. Various applications for the knot detection algorithms are presented. In particular, its importance to deadlock detection in store and forward communication networks and in transaction systems is demonstrated.",
"title": "An Efficient Distributed Knot Detection Algorithm",
"normalizedTitle": "An Efficient Distributed Knot Detection Algorithm",
"fno": "e0644",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Memory Bits Store Communication Networks Distributed Knot Detection Algorithm General Graphs Messages Nodes Links Cycle Detection Clustering Deadlock Detection Forward Communication Networks Transaction Systems Computational Complexity Distributed Processing Graph Theory"
],
"authors": [
{
"givenName": "I.",
"surname": "Cidon",
"fullName": "I. Cidon",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "1989-05-01 00:00:00",
"pubType": "trans",
"pages": "644-649",
"year": "1989",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "e0639",
"articleId": "13rRUwInvmD",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "e0649",
"articleId": "13rRUyv53H2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNs5rl2Y",
"title": "July-September",
"year": "1997",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "3",
"label": "July-September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvAQ",
"doi": "10.1109/2945.620492",
"abstract": "Abstract—The article describes a tool for simplification and analysis of tangled configurations of mathematical knots. The proposed method addresses optimization issues common in energy-based approaches to knot classification. In this class of methods, an initially tangled elastic rope is \"charged\" with an electrostatic-like field which causes it to self-repel, prompting it to evolve into a mechanically stable configuration. This configuration is believed to be characteristic for its knot type. We propose a physically-based model to implicitly guard against isotopy violation during such evolution and suggest that a robust stochastic optimization procedure, simulated annealing, be used for the purpose of identifying the globally optimal solution. Because neither of these techniques depends on the properties of the energy function being optimized, our method is of general applicability, even though we applied it to a specific potential here. The method has successfully analyzed several complex tangles and is applicable to simplifying a large class of knots and links. Our work also shows that energy-based techniques will not necessarily terminate in a unique configuration, thus we empirically refute a prior conjecture that one of the commonly used energy functions (Simon's) is unimodal. Based on these results we also compare techniques that rely on geometric energy optimization to conventional algebraic methods with regards to their classification power.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—The article describes a tool for simplification and analysis of tangled configurations of mathematical knots. The proposed method addresses optimization issues common in energy-based approaches to knot classification. In this class of methods, an initially tangled elastic rope is \"charged\" with an electrostatic-like field which causes it to self-repel, prompting it to evolve into a mechanically stable configuration. This configuration is believed to be characteristic for its knot type. We propose a physically-based model to implicitly guard against isotopy violation during such evolution and suggest that a robust stochastic optimization procedure, simulated annealing, be used for the purpose of identifying the globally optimal solution. Because neither of these techniques depends on the properties of the energy function being optimized, our method is of general applicability, even though we applied it to a specific potential here. The method has successfully analyzed several complex tangles and is applicable to simplifying a large class of knots and links. Our work also shows that energy-based techniques will not necessarily terminate in a unique configuration, thus we empirically refute a prior conjecture that one of the commonly used energy functions (Simon's) is unimodal. Based on these results we also compare techniques that rely on geometric energy optimization to conventional algebraic methods with regards to their classification power.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—The article describes a tool for simplification and analysis of tangled configurations of mathematical knots. The proposed method addresses optimization issues common in energy-based approaches to knot classification. In this class of methods, an initially tangled elastic rope is \"charged\" with an electrostatic-like field which causes it to self-repel, prompting it to evolve into a mechanically stable configuration. This configuration is believed to be characteristic for its knot type. We propose a physically-based model to implicitly guard against isotopy violation during such evolution and suggest that a robust stochastic optimization procedure, simulated annealing, be used for the purpose of identifying the globally optimal solution. Because neither of these techniques depends on the properties of the energy function being optimized, our method is of general applicability, even though we applied it to a specific potential here. The method has successfully analyzed several complex tangles and is applicable to simplifying a large class of knots and links. Our work also shows that energy-based techniques will not necessarily terminate in a unique configuration, thus we empirically refute a prior conjecture that one of the commonly used energy functions (Simon's) is unimodal. Based on these results we also compare techniques that rely on geometric energy optimization to conventional algebraic methods with regards to their classification power.",
"title": "Physically-Based Stochastic Simplification of Mathematical Knots",
"normalizedTitle": "Physically-Based Stochastic Simplification of Mathematical Knots",
"fno": "v0262",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Mathematical Visualization",
"Knot Theory",
"Knot Classification",
"Polynomial Invariants",
"Simulated Annealing"
],
"authors": [
{
"givenName": "Robert P.",
"surname": "Grzeszczuk",
"fullName": "Robert P. Grzeszczuk",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Milana",
"surname": "Huang",
"fullName": "Milana Huang",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Louis H.",
"surname": "Kauffman",
"fullName": "Louis H. Kauffman",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "1997-07-01 00:00:00",
"pubType": "trans",
"pages": "262-272",
"year": "1997",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0245",
"articleId": "13rRUwh80GX",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0273",
"articleId": "13rRUyYjKa2",
"__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": "1nJsMuACwtG",
"doi": "10.1109/TVCG.2020.3028893",
"abstract": "In this paper we present a user-friendly sketching-based suggestive interface for untangling mathematical knots with complicated structures. Rather than treating mathematical knots as if they were 3D ropes, our interface is designed to assist the user to interact with knots with the right sequence of mathematically legal moves. Our knot interface allows one to sketch and untangle knots by proposing the Reidemeister moves, and can guide the user to untangle mathematical knots to the fewest possible number of crossings by suggesting the moves needed. The system highlights parts of the knot where the Reidemeister moves are applicable, suggests the possible moves, and constrains the user's drawing to legal moves only. This ongoing suggestion is based on a Reidemeister move analyzer, that reads the evolving knot in its Gauss code and predicts the needed Reidemeister moves towards the fewest possible number of crossings. For our principal test case of mathematical knot diagrams, this for the first time permits us to visualize, analyze, and deform them in a mathematical visual interface. In addition, understanding of a fairly long mathematical deformation sequence in our interface can be aided by visual analysis and comparison over the identified “key moments” where only critical changes occur in the sequence. Our knot interface allows users to track and trace mathematical knot deformation with a significantly reduced number of visual frames containing only the Reidemeister moves being applied. All these combine to allow a much cleaner exploratory interface for us to analyze and study mathematical knots and their dynamics in topological space.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper we present a user-friendly sketching-based suggestive interface for untangling mathematical knots with complicated structures. Rather than treating mathematical knots as if they were 3D ropes, our interface is designed to assist the user to interact with knots with the right sequence of mathematically legal moves. Our knot interface allows one to sketch and untangle knots by proposing the Reidemeister moves, and can guide the user to untangle mathematical knots to the fewest possible number of crossings by suggesting the moves needed. The system highlights parts of the knot where the Reidemeister moves are applicable, suggests the possible moves, and constrains the user's drawing to legal moves only. This ongoing suggestion is based on a Reidemeister move analyzer, that reads the evolving knot in its Gauss code and predicts the needed Reidemeister moves towards the fewest possible number of crossings. For our principal test case of mathematical knot diagrams, this for the first time permits us to visualize, analyze, and deform them in a mathematical visual interface. In addition, understanding of a fairly long mathematical deformation sequence in our interface can be aided by visual analysis and comparison over the identified “key moments” where only critical changes occur in the sequence. Our knot interface allows users to track and trace mathematical knot deformation with a significantly reduced number of visual frames containing only the Reidemeister moves being applied. All these combine to allow a much cleaner exploratory interface for us to analyze and study mathematical knots and their dynamics in topological space.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper we present a user-friendly sketching-based suggestive interface for untangling mathematical knots with complicated structures. Rather than treating mathematical knots as if they were 3D ropes, our interface is designed to assist the user to interact with knots with the right sequence of mathematically legal moves. Our knot interface allows one to sketch and untangle knots by proposing the Reidemeister moves, and can guide the user to untangle mathematical knots to the fewest possible number of crossings by suggesting the moves needed. The system highlights parts of the knot where the Reidemeister moves are applicable, suggests the possible moves, and constrains the user's drawing to legal moves only. This ongoing suggestion is based on a Reidemeister move analyzer, that reads the evolving knot in its Gauss code and predicts the needed Reidemeister moves towards the fewest possible number of crossings. For our principal test case of mathematical knot diagrams, this for the first time permits us to visualize, analyze, and deform them in a mathematical visual interface. In addition, understanding of a fairly long mathematical deformation sequence in our interface can be aided by visual analysis and comparison over the identified “key moments” where only critical changes occur in the sequence. Our knot interface allows users to track and trace mathematical knot deformation with a significantly reduced number of visual frames containing only the Reidemeister moves being applied. All these combine to allow a much cleaner exploratory interface for us to analyze and study mathematical knots and their dynamics in topological space.",
"title": "A Suggestive Interface for Untangling Mathematical Knots",
"normalizedTitle": "A Suggestive Interface for Untangling Mathematical Knots",
"fno": "09216595",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Graphical User Interfaces",
"Interactive Systems",
"Solid Modelling",
"Topology",
"Untangling Mathematical Knots",
"User Friendly Sketching Based Suggestive Interface",
"Mathematically Legal Moves",
"Knot Interface",
"Untangle Knots",
"Reidemeister Moves",
"Untangle Mathematical Knots",
"Evolving Knot",
"Mathematical Knot Diagrams",
"Mathematical Visual Interface",
"Fairly Long Mathematical Deformation Sequence",
"Mathematical Knot Deformation",
"Three Dimensional Displays",
"Visualization",
"Image Reconstruction",
"Strain",
"Geometry",
"Law",
"Knot Theory",
"Reidemeister Moves",
"Gauss Code",
"Mathematical Visualization",
"Suggestive Interface"
],
"authors": [
{
"givenName": "Huan",
"surname": "Liu",
"fullName": "Huan Liu",
"affiliation": "University of Louisville",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hui",
"surname": "Zhang",
"fullName": "Hui Zhang",
"affiliation": "University of Louisville",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "593-602",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/1996/3673/0/36730279",
"title": "Untangling Knots by Stochastic Energy Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1996/36730279/12OmNARiM01",
"parentPublication": {
"id": "proceedings/ieee-vis/1996/3673/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2016/1451/0/07465247",
"title": "Visualizing knots and braids with touchable 3D manipulatives",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2016/07465247/12OmNAXxX8A",
"parentPublication": {
"id": "proceedings/pacificvis/2016/1451/0",
"title": "2016 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2016/9005/0/07840864",
"title": "Accelerating mathematical knot simulations with R on the web",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2016/07840864/12OmNvEhfYM",
"parentPublication": {
"id": "proceedings/big-data/2016/9005/0",
"title": "2016 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1996/864/0/00568120",
"title": "Untangling knots by stochastic energy optimization",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1996/00568120/12OmNvkpl7H",
"parentPublication": {
"id": "proceedings/visual/1996/864/0",
"title": "Proceedings of Seventh Annual IEEE Visualization '96",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipps/1995/7074/0/70740118",
"title": "A distributed algorithm for the detection of local cycles and knots",
"doi": null,
"abstractUrl": "/proceedings-article/ipps/1995/70740118/12OmNxWcHfa",
"parentPublication": {
"id": "proceedings/ipps/1995/7074/0",
"title": "Proceedings of 9th International Parallel Processing Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1997/03/v0262",
"title": "Physically-Based Stochastic Simplification of Mathematical Knots",
"doi": null,
"abstractUrl": "/journal/tg/1997/03/v0262/13rRUwInvAQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122051",
"title": "KnotPad: Visualizing and Exploring Knot Theory with Fluid Reidemeister Moves",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122051/13rRUwfZC0f",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/1998/08/l0748",
"title": "A Distributed Graph Algorithm for the Detection of Local Cycles and Knots",
"doi": null,
"abstractUrl": "/journal/td/1998/08/l0748/13rRUyuNsF3",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2018/5035/0/08622560",
"title": "Untangling Mathematical Knots with Simulated Annealing and Opposition-Based Learning",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2018/08622560/17D45Wuc327",
"parentPublication": {
"id": "proceedings/big-data/2018/5035/0",
"title": "2018 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006309",
"title": "Parallelized Topological Relaxation Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006309/1hJrJB4UCbu",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09224154",
"articleId": "1nV63QG11le",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09222049",
"articleId": "1nTrPy5zy5a",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLgqQXAzkc",
"name": "ttg202102-09216595s1-supp2-3028893.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09216595s1-supp2-3028893.mp4",
"extension": "mp4",
"size": "56.6 MB",
"__typename": "WebExtraType"
},
{
"id": "1qLgtJV6SK4",
"name": "ttg202102-09216595s1-supp1-3028893.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09216595s1-supp1-3028893.mp4",
"extension": "mp4",
"size": "56.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1f7gXSu0p7a",
"title": "Summer",
"year": "1995",
"issueNum": "02",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "ii",
"label": "Summer",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0xPwy",
"doi": "10.1109/99.388949",
"abstract": "Charmm (Chemistry at Harvard Macromolecular Mechanics) is a program that is widely used to model and simulate macromolecular systems. Charmm has been parallelized by using the Chaos runtime support library on distributed-memory architectures. This implementation distributes both data and computations over processors. This data parallel strategy should make it possible to simulate very large molecules on large numbers of processors. In order to minimize communication among processors and to balance computational load, a variety of partitioning approaches are employed to distribute the atoms and computations over processors. In this implementation, atoms are partitioned based on geometrical positions and computational load by using unweighted or weighted recursive coordinate bisection. The experimental results reveal that taking computational load into account is essential. The performance of two iteration partitioning algorithms, atom decomposition and force decomposition, is also compared. A new irregular force decomposition algorithm is introduced and implemented. The Chaos library is designed to facilitate parallelization of irregular applications. This library couples partitioners to the application programs, remaps data and partitions work among processors, and optimizes interprocessor communications. This paper presents an application of Chaos that can be used to support efficient execution of irregular problems on distributed-memory machines. Readers may contact Hwang at the Dept. of Computer Science, University of Maryland, College Park, MD 20742, e-mail: shin@cs.umd.edu. ",
"abstracts": [
{
"abstractType": "Regular",
"content": "Charmm (Chemistry at Harvard Macromolecular Mechanics) is a program that is widely used to model and simulate macromolecular systems. Charmm has been parallelized by using the Chaos runtime support library on distributed-memory architectures. This implementation distributes both data and computations over processors. This data parallel strategy should make it possible to simulate very large molecules on large numbers of processors. In order to minimize communication among processors and to balance computational load, a variety of partitioning approaches are employed to distribute the atoms and computations over processors. In this implementation, atoms are partitioned based on geometrical positions and computational load by using unweighted or weighted recursive coordinate bisection. The experimental results reveal that taking computational load into account is essential. The performance of two iteration partitioning algorithms, atom decomposition and force decomposition, is also compared. A new irregular force decomposition algorithm is introduced and implemented. The Chaos library is designed to facilitate parallelization of irregular applications. This library couples partitioners to the application programs, remaps data and partitions work among processors, and optimizes interprocessor communications. This paper presents an application of Chaos that can be used to support efficient execution of irregular problems on distributed-memory machines. Readers may contact Hwang at the Dept. of Computer Science, University of Maryland, College Park, MD 20742, e-mail: shin@cs.umd.edu. ",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Charmm (Chemistry at Harvard Macromolecular Mechanics) is a program that is widely used to model and simulate macromolecular systems. Charmm has been parallelized by using the Chaos runtime support library on distributed-memory architectures. This implementation distributes both data and computations over processors. This data parallel strategy should make it possible to simulate very large molecules on large numbers of processors. In order to minimize communication among processors and to balance computational load, a variety of partitioning approaches are employed to distribute the atoms and computations over processors. In this implementation, atoms are partitioned based on geometrical positions and computational load by using unweighted or weighted recursive coordinate bisection. The experimental results reveal that taking computational load into account is essential. The performance of two iteration partitioning algorithms, atom decomposition and force decomposition, is also compared. A new irregular force decomposition algorithm is introduced and implemented. The Chaos library is designed to facilitate parallelization of irregular applications. This library couples partitioners to the application programs, remaps data and partitions work among processors, and optimizes interprocessor communications. This paper presents an application of Chaos that can be used to support efficient execution of irregular problems on distributed-memory machines. Readers may contact Hwang at the Dept. of Computer Science, University of Maryland, College Park, MD 20742, e-mail: shin@cs.umd.edu. ",
"title": "Parallelizing Molecular Dynamics Programs for Distributed-Memory Machines",
"normalizedTitle": "Parallelizing Molecular Dynamics Programs for Distributed-Memory Machines",
"fno": "c2018",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [],
"authors": [
{
"givenName": "Yuan-Shin",
"surname": "Hwang",
"fullName": "Yuan-Shin Hwang",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Raja",
"surname": "Das",
"fullName": "Raja Das",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Joel H.",
"surname": "Saltz",
"fullName": "Joel H. Saltz",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Milan",
"surname": "Hodoscek",
"fullName": "Milan Hodoscek",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bernard R.",
"surname": "Brooks",
"fullName": "Bernard R. Brooks",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "1995-06-01 00:00:00",
"pubType": "mags",
"pages": "18-29",
"year": "1995",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "c2016",
"articleId": "13rRUxly99a",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "c2030",
"articleId": "13rRUxjyXe7",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyQGSal",
"title": "September",
"year": "1996",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "2",
"label": "September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwwaKsT",
"doi": "10.1109/2945.537307",
"abstract": "Abstract—Gradient information is used in volume rendering to classify and color samples along a ray. In this paper, we present an analysis of the theoretically ideal gradient estimator and compare it to some commonly used gradient estimators. A new method is presented to calculate the gradient at arbitrary sample positions, using the derivative of the interpolation filter as the basis for the new gradient filter. As an example, we will discuss the use of the derivative of the cubic spline. Comparisons with several other methods are demonstrated. Computational efficiency can be realized since parts of the interpolation computation can be leveraged in the gradient estimation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Gradient information is used in volume rendering to classify and color samples along a ray. In this paper, we present an analysis of the theoretically ideal gradient estimator and compare it to some commonly used gradient estimators. A new method is presented to calculate the gradient at arbitrary sample positions, using the derivative of the interpolation filter as the basis for the new gradient filter. As an example, we will discuss the use of the derivative of the cubic spline. Comparisons with several other methods are demonstrated. Computational efficiency can be realized since parts of the interpolation computation can be leveraged in the gradient estimation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Gradient information is used in volume rendering to classify and color samples along a ray. In this paper, we present an analysis of the theoretically ideal gradient estimator and compare it to some commonly used gradient estimators. A new method is presented to calculate the gradient at arbitrary sample positions, using the derivative of the interpolation filter as the basis for the new gradient filter. As an example, we will discuss the use of the derivative of the cubic spline. Comparisons with several other methods are demonstrated. Computational efficiency can be realized since parts of the interpolation computation can be leveraged in the gradient estimation.",
"title": "Frequency Analysis of Gradient Estimators in Volume Rendering",
"normalizedTitle": "Frequency Analysis of Gradient Estimators in Volume Rendering",
"fno": "v0242",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Volume Rendering",
"Volume Visualization",
"Gradient Filters"
],
"authors": [
{
"givenName": "Mark J.",
"surname": "Bentum",
"fullName": "Mark J. Bentum",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Barthold B.A.",
"surname": "Lichtenbelt",
"fullName": "Barthold B.A. Lichtenbelt",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tom",
"surname": "Malzbender",
"fullName": "Tom Malzbender",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "1996-07-01 00:00:00",
"pubType": "trans",
"pages": "242-254",
"year": "1996",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0232",
"articleId": "13rRUxly8Xr",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0255",
"articleId": "13rRUzpzeAN",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCbCrUN",
"title": "Dec.",
"year": "2013",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjyX40",
"doi": "10.1109/TVCG.2013.139",
"abstract": "We propose a new colon flattening algorithm that is efficient, shape-preserving, and robust to topological noise. Unlike previous approaches, which require a mandatory topological denoising to remove fake handles, our algorithm directly flattens the colon surface without any denoising. In our method, we replace the original Euclidean metric of the colon surface with a heat diffusion metric that is insensitive to topological noise. Using this heat diffusion metric, we then solve a Laplacian equation followed by an integration step to compute the final flattening. We demonstrate that our method is shape-preserving and the shape of the polyps are well preserved. The flattened colon also provides an efficient way to enhance the navigation and inspection in virtual colonoscopy. We further show how the existing colon registration pipeline is made more robust by using our colon flattening. We have tested our method on several colon wall surfaces and the experimental results demonstrate the robustness and the efficiency of our method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose a new colon flattening algorithm that is efficient, shape-preserving, and robust to topological noise. Unlike previous approaches, which require a mandatory topological denoising to remove fake handles, our algorithm directly flattens the colon surface without any denoising. In our method, we replace the original Euclidean metric of the colon surface with a heat diffusion metric that is insensitive to topological noise. Using this heat diffusion metric, we then solve a Laplacian equation followed by an integration step to compute the final flattening. We demonstrate that our method is shape-preserving and the shape of the polyps are well preserved. The flattened colon also provides an efficient way to enhance the navigation and inspection in virtual colonoscopy. We further show how the existing colon registration pipeline is made more robust by using our colon flattening. We have tested our method on several colon wall surfaces and the experimental results demonstrate the robustness and the efficiency of our method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose a new colon flattening algorithm that is efficient, shape-preserving, and robust to topological noise. Unlike previous approaches, which require a mandatory topological denoising to remove fake handles, our algorithm directly flattens the colon surface without any denoising. In our method, we replace the original Euclidean metric of the colon surface with a heat diffusion metric that is insensitive to topological noise. Using this heat diffusion metric, we then solve a Laplacian equation followed by an integration step to compute the final flattening. We demonstrate that our method is shape-preserving and the shape of the polyps are well preserved. The flattened colon also provides an efficient way to enhance the navigation and inspection in virtual colonoscopy. We further show how the existing colon registration pipeline is made more robust by using our colon flattening. We have tested our method on several colon wall surfaces and the experimental results demonstrate the robustness and the efficiency of our method.",
"title": "Colon Flattening Using Heat Diffusion Riemannian Metric",
"normalizedTitle": "Colon Flattening Using Heat Diffusion Riemannian Metric",
"fno": "ttg2013122848",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Colonoscopy",
"Harmonic Analysis",
"Heating",
"Biomedical Measurement",
"Volume Rendering",
"Topological Noise",
"Colonoscopy",
"Harmonic Analysis",
"Heating",
"Biomedical Measurement",
"Volume Rendering",
"Shape Preserving Mapping",
"Colon Flattening",
"Heat Diffusion",
"Virtual Colonoscopy",
"Volume Rendering"
],
"authors": [
{
"givenName": "Krishna Chaitanya",
"surname": "Gurijala",
"fullName": "Krishna Chaitanya Gurijala",
"affiliation": "Stony Brook Univ., Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Rui Shi",
"fullName": "Rui Shi",
"affiliation": "Stony Brook Univ., Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Wei Zeng",
"fullName": "Wei Zeng",
"affiliation": "Florida Int. Univ., Miami, FL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Xianfeng Gu",
"fullName": "Xianfeng Gu",
"affiliation": "Stony Brook Univ., Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Arie",
"surname": "Kaufman",
"fullName": "Arie Kaufman",
"affiliation": "Stony Brook Univ., Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2013-12-01 00:00:00",
"pubType": "trans",
"pages": "2848-2857",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibe/2004/2173/0/21730159",
"title": "Interactive Polyp Biopsy based on Automatic Segmentation of Virtual Colonoscopy",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2004/21730159/12OmNAtst5z",
"parentPublication": {
"id": "proceedings/bibe/2004/2173/0",
"title": "Fourth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'04)",
"__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/crv/2006/2542/0/25420065",
"title": "Extracting and tracking Colon?s \"Pattern\" from Colonoscopic Images",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2006/25420065/12OmNzUPpzp",
"parentPublication": {
"id": "proceedings/crv/2006/2542/0",
"title": "The 3rd Canadian Conference on Computer and Robot Vision (CRV'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200bartoli",
"title": "Nonlinear Virtual Colon Unfolding",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200bartoli/12OmNzaQod8",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851f051",
"title": "Shape Analysis with Hyperbolic Wasserstein Distance",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851f051/12OmNzxgHyS",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061481",
"title": "Automatic Transfer Function Generation Using Contour Tree Controlled Residue Flow Model and Color Harmonics",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061481/13rRUEgarBm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v0861",
"title": "A Pipeline for Computer Aided Polyp Detection",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v0861/13rRUIJuxpp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122069",
"title": "Cumulative Heat Diffusion Using Volume Gradient Operator for Volume Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122069/13rRUwdIOUK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061348",
"title": "Supine and Prone Colon Registration Using Quasi-Conformal Mapping",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061348/13rRUwjGoFT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2017/2636/0/263600a091",
"title": "Topology and Shape Preserved Lightweight of Shell Models Utilizing Heat Diffusion",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2017/263600a091/1ap5yizM9La",
"parentPublication": {
"id": "proceedings/icvrv/2017/2636/0",
"title": "2017 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013122838",
"articleId": "13rRUyuegp6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013122858",
"articleId": "13rRUwIF6dS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCwUmsU",
"title": "January/February",
"year": "2011",
"issueNum": "01",
"idPrefix": "mi",
"pubType": "magazine",
"volume": "31",
"label": "January/February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuCu",
"doi": "10.1109/MM.2011.10",
"abstract": "The author explores instances of \"digital dark matter,\" or important building blocks of the digital economy that contribute value and new functionality, but which are nonpecuniary and so aren't measured directly or recorded in GDP.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The author explores instances of \"digital dark matter,\" or important building blocks of the digital economy that contribute value and new functionality, but which are nonpecuniary and so aren't measured directly or recorded in GDP.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The author explores instances of \"digital dark matter,\" or important building blocks of the digital economy that contribute value and new functionality, but which are nonpecuniary and so aren't measured directly or recorded in GDP.",
"title": "Digital Dark Matter",
"normalizedTitle": "Digital Dark Matter",
"fno": "mmi2011010128",
"hasPdf": true,
"idPrefix": "mi",
"keywords": [
"Economic Indicators",
"Search Engines",
"Software Development Management",
"Digital Economy",
"GDP",
"Linux",
"Apache",
"Software License",
"Licensing Fees",
"Wikipedia",
"MSN",
"Encarta",
"Encyclopedias",
"Software Development Management",
"Economics",
"Digital Systems",
"Digital Economy",
"Digital Dark Matter",
"Nonpecuniary Transactions",
"Investment",
"Value"
],
"authors": [
{
"givenName": "Shane",
"surname": "Greenstein",
"fullName": "Shane Greenstein",
"affiliation": "greenstein@kellogg.northwestern.edu",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2011-01-01 00:00:00",
"pubType": "mags",
"pages": "128",
"year": "2011",
"issn": "0272-1732",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/2012/4525/0/4525e603",
"title": "End User Computing: The Dark Matter (and Dark Energy) of Corporate IT",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2012/4525e603/12OmNC1GudK",
"parentPublication": {
"id": "proceedings/hicss/2012/4525/0",
"title": "2012 45th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scivis/2015/9785/0/07429500",
"title": "Visualize the universe: Interactive exploration of cosmological dark matter simulation data",
"doi": null,
"abstractUrl": "/proceedings-article/scivis/2015/07429500/12OmNrYlmQS",
"parentPublication": {
"id": "proceedings/scivis/2015/9785/0",
"title": "2015 IEEE Scientific Visualization Conference (SciVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scivis/2015/9785/0/07429498",
"title": "Visualizing the life and anatomy of dark matter",
"doi": null,
"abstractUrl": "/proceedings-article/scivis/2015/07429498/12OmNvjQ8Ib",
"parentPublication": {
"id": "proceedings/scivis/2015/9785/0",
"title": "2015 IEEE Scientific Visualization Conference (SciVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2013/1659/0/06675174",
"title": "Visualization of multivariate dark matter halos in cosmology simulations",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2013/06675174/12OmNvjgWrv",
"parentPublication": {
"id": "proceedings/ldav/2013/1659/0",
"title": "2013 IEEE Symposium on Large-Scale Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2013/2840/0/2840c224",
"title": "Inferring \"Dark Matter\" and \"Dark Energy\" from Videos",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2013/2840c224/12OmNx38vQD",
"parentPublication": {
"id": "proceedings/iccv/2013/2840/0",
"title": "2013 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122078",
"title": "A Novel Approach to Visualizing Dark Matter Simulations",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122078/13rRUx0xPTQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ic/2002/05/w5092",
"title": "Middleware \"Dark Matter\"",
"doi": null,
"abstractUrl": "/magazine/ic/2002/05/w5092/13rRUxYrbI5",
"parentPublication": {
"id": "mags/ic",
"title": "IEEE Internet Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2017/02/mcg2017020080",
"title": "Interactive Exploration of Cosmological Dark-Matter Simulation Data",
"doi": null,
"abstractUrl": "/magazine/cg/2017/02/mcg2017020080/13rRUy3gmXB",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2017/2715/0/08258096",
"title": "Demystifying dark matter for online experimentation",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08258096/17D45XeKgrO",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2020/7445/0/09150469",
"title": "Simulating Ultralight Dark Matter in Chapel",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2020/09150469/1lPGFmTR26Y",
"parentPublication": {
"id": "proceedings/ipdpsw/2020/7445/0",
"title": "2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mmi2011010119",
"articleId": "13rRUytnsTr",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwNwzMV",
"title": "September/October",
"year": "2002",
"issueNum": "05",
"idPrefix": "ic",
"pubType": "magazine",
"volume": "6",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxYrbI5",
"doi": "10.1109/MIC.2002.1036044",
"abstract": "Some astronomers theorize that the universe is filled with \"dark matter\" that we can?t see. We can apply a similar analogy to middleware because the \"mass\" of the middleware universe is much greater than the systems. We can't see them, and we don't talk about them, but they're out there solving real-world integration problems - and profoundly influencing the middleware space. These systems are the dark matter of the middleware universe.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Some astronomers theorize that the universe is filled with \"dark matter\" that we can?t see. We can apply a similar analogy to middleware because the \"mass\" of the middleware universe is much greater than the systems. We can't see them, and we don't talk about them, but they're out there solving real-world integration problems - and profoundly influencing the middleware space. These systems are the dark matter of the middleware universe.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Some astronomers theorize that the universe is filled with \"dark matter\" that we can?t see. We can apply a similar analogy to middleware because the \"mass\" of the middleware universe is much greater than the systems. We can't see them, and we don't talk about them, but they're out there solving real-world integration problems - and profoundly influencing the middleware space. These systems are the dark matter of the middleware universe.",
"title": "Middleware \"Dark Matter\"",
"normalizedTitle": "Middleware \"Dark Matter\"",
"fno": "w5092",
"hasPdf": true,
"idPrefix": "ic",
"keywords": [],
"authors": [
{
"givenName": "Steve",
"surname": "Vinoski",
"fullName": "Steve Vinoski",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2002-09-01 00:00:00",
"pubType": "mags",
"pages": "92-95",
"year": "2002",
"issn": "1089-7801",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "w5088",
"articleId": "13rRUy3gn24",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "w5096",
"articleId": "13rRUzpzeH2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyq0zFC",
"title": "Mar.-Apr.",
"year": "2017",
"issueNum": "02",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "37",
"label": "Mar.-Apr.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy3gmXB",
"doi": "10.1109/MCG.2017.20",
"abstract": "The winning entry of the 2015 IEEE Scientific Visualization Contest, this article describes a visualization tool for cosmological data resulting from dark-matter simulations. The proposed system helps users explore all aspects of the data at once and receive more detailed information about structures of interest at any time. Moreover, novel methods for visualizing and interactively exploring dark-matter halo substructures are proposed.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The winning entry of the 2015 IEEE Scientific Visualization Contest, this article describes a visualization tool for cosmological data resulting from dark-matter simulations. The proposed system helps users explore all aspects of the data at once and receive more detailed information about structures of interest at any time. Moreover, novel methods for visualizing and interactively exploring dark-matter halo substructures are proposed.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The winning entry of the 2015 IEEE Scientific Visualization Contest, this article describes a visualization tool for cosmological data resulting from dark-matter simulations. The proposed system helps users explore all aspects of the data at once and receive more detailed information about structures of interest at any time. Moreover, novel methods for visualizing and interactively exploring dark-matter halo substructures are proposed.",
"title": "Interactive Exploration of Cosmological Dark-Matter Simulation Data",
"normalizedTitle": "Interactive Exploration of Cosmological Dark-Matter Simulation Data",
"fno": "mcg2017020080",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Visualization",
"Data Models",
"Rendering Computer Graphics",
"Three Dimensional Displays",
"Corporate Acquisitions",
"Two Dimensional Displays",
"Image Color Analysis",
"Simulation",
"Computer Graphics",
"IEEE Scientific Visualization Contest",
"Volume Visualization",
"Scientific Visualization"
],
"authors": [
{
"givenName": "Aaron",
"surname": "Scherzinger",
"fullName": "Aaron Scherzinger",
"affiliation": "University of Münster",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tobias",
"surname": "Brix",
"fullName": "Tobias Brix",
"affiliation": "University of Münster",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dominik",
"surname": "Drees",
"fullName": "Dominik Drees",
"affiliation": "University of Münster",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andreas",
"surname": "Völker",
"fullName": "Andreas Völker",
"affiliation": "University of Münster",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kiril",
"surname": "Radkov",
"fullName": "Kiril Radkov",
"affiliation": "University of Münster",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Niko",
"surname": "Santalidis",
"fullName": "Niko Santalidis",
"affiliation": "University of Münster",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alexander",
"surname": "Fieguth",
"fullName": "Alexander Fieguth",
"affiliation": "University of Münster",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Klaus H.",
"surname": "Hinrichs",
"fullName": "Klaus H. Hinrichs",
"affiliation": "University of Münster",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2017-03-01 00:00:00",
"pubType": "mags",
"pages": "80-89",
"year": "2017",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sccompanion/2012/4956/0/4956b484",
"title": "Poster: Tracking and Visualizing the Evolution of the Universe: In situ Parallel Dark Matter Halo Merger Trees",
"doi": null,
"abstractUrl": "/proceedings-article/sccompanion/2012/4956b484/12OmNA14A6d",
"parentPublication": {
"id": "proceedings/sccompanion/2012/4956/0",
"title": "2012 SC Companion: High Performance Computing, Networking Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scc/2012/6218/0/06496058",
"title": "Abstract: Tracking and Visualizing Evolution of the Universe: In Situ Parallel Dark Matter Halo Merger Trees",
"doi": null,
"abstractUrl": "/proceedings-article/scc/2012/06496058/12OmNAlvI6o",
"parentPublication": {
"id": "proceedings/scc/2012/6218/0",
"title": "2012 SC Companion: High Performance Computing, Networking, Storage and Analysis (SCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hipc/2017/2293/0/229301a398",
"title": "Building Halo Merger Trees from the Q Continuum Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/hipc/2017/229301a398/12OmNAndipf",
"parentPublication": {
"id": "proceedings/hipc/2017/2293/0",
"title": "2017 IEEE 24th International Conference on High Performance Computing (HiPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scc/2012/6218/0/06496059",
"title": "Poster: Tracking and Visualizing the Evolution of the Universe: In situ Parallel Dark Matter Halo Merger Trees",
"doi": null,
"abstractUrl": "/proceedings-article/scc/2012/06496059/12OmNBEpnuQ",
"parentPublication": {
"id": "proceedings/scc/2012/6218/0",
"title": "2012 SC Companion: High Performance Computing, Networking, Storage and Analysis (SCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scivis/2015/9785/0/07429496",
"title": "Visualising the dark sky IEEE SciVis contest 2015",
"doi": null,
"abstractUrl": "/proceedings-article/scivis/2015/07429496/12OmNrJ11AH",
"parentPublication": {
"id": "proceedings/scivis/2015/9785/0",
"title": "2015 IEEE Scientific Visualization Conference (SciVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sccompanion/2012/4956/0/4956b482",
"title": "Abstract: Tracking and Visualizing Evolution of the Universe: In Situ Parallel Dark Matter Halo Merger Trees",
"doi": null,
"abstractUrl": "/proceedings-article/sccompanion/2012/4956b482/12OmNrJiD1k",
"parentPublication": {
"id": "proceedings/sccompanion/2012/4956/0",
"title": "2012 SC Companion: High Performance Computing, Networking Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scivis/2015/9785/0/07429500",
"title": "Visualize the universe: Interactive exploration of cosmological dark matter simulation data",
"doi": null,
"abstractUrl": "/proceedings-article/scivis/2015/07429500/12OmNrYlmQS",
"parentPublication": {
"id": "proceedings/scivis/2015/9785/0",
"title": "2015 IEEE Scientific Visualization Conference (SciVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scivis/2015/9785/0/07429498",
"title": "Visualizing the life and anatomy of dark matter",
"doi": null,
"abstractUrl": "/proceedings-article/scivis/2015/07429498/12OmNvjQ8Ib",
"parentPublication": {
"id": "proceedings/scivis/2015/9785/0",
"title": "2015 IEEE Scientific Visualization Conference (SciVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2013/1659/0/06675174",
"title": "Visualization of multivariate dark matter halos in cosmology simulations",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2013/06675174/12OmNvjgWrv",
"parentPublication": {
"id": "proceedings/ldav/2013/1659/0",
"title": "2013 IEEE Symposium on Large-Scale Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2012/4752/0/06400532",
"title": "A case study: Tracking and visualizing the evolution of dark matter halos and groups of satellite halos in cosmology simulations",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2012/06400532/12OmNyY4ru7",
"parentPublication": {
"id": "proceedings/vast/2012/4752/0",
"title": "2012 IEEE Conference on Visual Analytics Science and Technology (VAST 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2017020066",
"articleId": "13rRUxbCble",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2017020090",
"articleId": "13rRUygT7cM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet1n",
"name": "mcg2017020080s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/mcg2017020080s1.mp4",
"extension": "mp4",
"size": "83 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqJZgIv",
"title": "Jan.-Feb.",
"year": "2017",
"issueNum": "01",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "37",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5pi",
"doi": "10.1109/MCG.2017.6",
"abstract": "Sampling is becoming an essential tool for scalable interactive visual analysis. After outlining prior work by the database community on sampling for visualization of aggregation queries, this article considers how these results might be improved and extended to a broader setting. The goal is to better understand how users interact with sampling to enable wider adoption of sampling for scalable visual analytics.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Sampling is becoming an essential tool for scalable interactive visual analysis. After outlining prior work by the database community on sampling for visualization of aggregation queries, this article considers how these results might be improved and extended to a broader setting. The goal is to better understand how users interact with sampling to enable wider adoption of sampling for scalable visual analytics.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Sampling is becoming an essential tool for scalable interactive visual analysis. After outlining prior work by the database community on sampling for visualization of aggregation queries, this article considers how these results might be improved and extended to a broader setting. The goal is to better understand how users interact with sampling to enable wider adoption of sampling for scalable visual analytics.",
"title": "Sampling for Scalable Visual Analytics",
"normalizedTitle": "Sampling for Scalable Visual Analytics",
"fno": "mcg2017010100",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Temperature Sensors",
"Data Visualization",
"Uncertainty",
"Visual Analytics",
"Visual Databases",
"Sampling",
"Computer Graphics",
"Visualization",
"Interactive Visual Analytics",
"Scalable Visualization",
"Online Aggregation"
],
"authors": [
{
"givenName": "Bum Chul",
"surname": "Kwon",
"fullName": "Bum Chul Kwon",
"affiliation": "IBM T.J. Watson Research Center",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Janu",
"surname": "Verma",
"fullName": "Janu Verma",
"affiliation": "IBM T.J. Watson Research Center",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter J.",
"surname": "Haas",
"fullName": "Peter J. Haas",
"affiliation": "IBM Almaden Research Center",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Çagatay",
"surname": "Demiralp",
"fullName": "Çagatay Demiralp",
"affiliation": "IBM T.J. Watson Research Center",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2017-01-01 00:00:00",
"pubType": "mags",
"pages": "100-108",
"year": "2017",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dsia/2017/2198/0/08339088",
"title": "A client-based visual analytics framework for large spatiotemporal data under architectural constraints",
"doi": null,
"abstractUrl": "/proceedings-article/dsia/2017/08339088/12OmNrJAdU1",
"parentPublication": {
"id": "proceedings/dsia/2017/2198/0",
"title": "2017 IEEE Workshop on Data Systems for Interactive Analysis (DSIA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2014/6227/0/07042482",
"title": "An insight- and task-based methodology for evaluating spatiotemporal visual analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042482/12OmNwp74wP",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2014/2504/0/2504b374",
"title": "Towards a Visual Analytics Framework for Handling Complex Business Processes",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2014/2504b374/12OmNxX3uxl",
"parentPublication": {
"id": "proceedings/hicss/2014/2504/0",
"title": "2014 47th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eisic/2016/2857/0/07870211",
"title": "A Framework for Cognitive Bias Detection and Feedback in a Visual Analytics Environment",
"doi": null,
"abstractUrl": "/proceedings-article/eisic/2016/07870211/12OmNz5apw2",
"parentPublication": {
"id": "proceedings/eisic/2016/2857/0",
"title": "2016 European Intelligence and Security Informatics Conference (EISIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2008/01/mcg2008010018",
"title": "An Information-Theoretic View of Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2008/01/mcg2008010018/13rRUB6SpRW",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__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/co/2013/08/mco2013080090",
"title": "Bixplorer: Visual Analytics with Biclusters",
"doi": null,
"abstractUrl": "/magazine/co/2013/08/mco2013080090/13rRUwcAqvs",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07534824",
"title": "NameClarifier: A Visual Analytics System for Author Name Disambiguation",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07534824/13rRUxBJhvA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/07/08943144",
"title": "ProReveal: Progressive Visual Analytics With Safeguards",
"doi": null,
"abstractUrl": "/journal/tg/2021/07/08943144/1g3bi26D34k",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2020/8009/0/800900a072",
"title": "STULL: Unbiased Online Sampling for Visual Exploration of Large Spatiotemporal Data",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2020/800900a072/1q7jwDf9eTK",
"parentPublication": {
"id": "proceedings/vast/2020/8009/0",
"title": "2020 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2017010092",
"articleId": "13rRUwcS1v3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg20170100c3",
"articleId": "13rRUxCRFQm",
"__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": "13rRUxDqS8g",
"doi": "10.1109/TVCG.2012.191",
"abstract": "We present a Visual Analytics approach that addresses the detection of interesting patterns in numerical time series, specifically from environmental sciences. Crucial for the detection of interesting temporal patterns are the time scale and the starting points one is looking at. Our approach makes no assumption about time scale and starting position of temporal patterns and consists of three main steps: an algorithm to compute statistical values for all possible time scales and starting positions of intervals, visual identification of potentially interesting patterns in a matrix visualization, and interactive exploration of detected patterns. We demonstrate the utility of this approach in two scientific scenarios and explain how it allowed scientists to gain new insight into the dynamics of environmental systems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a Visual Analytics approach that addresses the detection of interesting patterns in numerical time series, specifically from environmental sciences. Crucial for the detection of interesting temporal patterns are the time scale and the starting points one is looking at. Our approach makes no assumption about time scale and starting position of temporal patterns and consists of three main steps: an algorithm to compute statistical values for all possible time scales and starting positions of intervals, visual identification of potentially interesting patterns in a matrix visualization, and interactive exploration of detected patterns. We demonstrate the utility of this approach in two scientific scenarios and explain how it allowed scientists to gain new insight into the dynamics of environmental systems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a Visual Analytics approach that addresses the detection of interesting patterns in numerical time series, specifically from environmental sciences. Crucial for the detection of interesting temporal patterns are the time scale and the starting points one is looking at. Our approach makes no assumption about time scale and starting position of temporal patterns and consists of three main steps: an algorithm to compute statistical values for all possible time scales and starting positions of intervals, visual identification of potentially interesting patterns in a matrix visualization, and interactive exploration of detected patterns. We demonstrate the utility of this approach in two scientific scenarios and explain how it allowed scientists to gain new insight into the dynamics of environmental systems.",
"title": "A Visual Analytics Approach to Multiscale Exploration of Environmental Time Series",
"normalizedTitle": "A Visual Analytics Approach to Multiscale Exploration of Environmental Time Series",
"fno": "ttg2012122899",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Time Series Analysis",
"Visual Analytics",
"Data Visualization",
"Meteorology",
"Entropy",
"Earth",
"Visual Analytics",
"Time Series Analysis",
"Multiscale Visualization"
],
"authors": [
{
"givenName": "Mike",
"surname": "Sips",
"fullName": "Mike Sips",
"affiliation": "German Research Center for GeoSciences GFZ",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Patrick",
"surname": "Kothur",
"fullName": "Patrick Kothur",
"affiliation": "German Research Center for GeoSciences GFZ",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrea",
"surname": "Unger",
"fullName": "Andrea Unger",
"affiliation": "German Research Center for GeoSciences GFZ",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hans-Christian",
"surname": "Hege",
"fullName": "Hans-Christian Hege",
"affiliation": "Zuse Institute Berlin",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Doris",
"surname": "Dransch",
"fullName": "Doris Dransch",
"affiliation": "German Research Center for GeoSciences GFZ",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2899-2907",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vast/2012/4752/0/06400491",
"title": "A correlative analysis process in a visual analytics environment",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2012/06400491/12OmNAkEU1K",
"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/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/dasc-picom-datacom-cyberscitech/2016/4065/0/07588956",
"title": "PyramidViz: Visual Analytics and Big Data Visualization for Frequent Patterns",
"doi": null,
"abstractUrl": "/proceedings-article/dasc-picom-datacom-cyberscitech/2016/07588956/12OmNxFJXGM",
"parentPublication": {
"id": "proceedings/dasc-picom-datacom-cyberscitech/2016/4065/0",
"title": "2016 IEEE 14th Intl Conf on Dependable, Autonomic and Secure Computing, 14th Intl Conf on Pervasive Intelligence and Computing, 2nd Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlhcc/2016/0252/0/07739668",
"title": "Visual discovery and model-driven explanation of time series patterns",
"doi": null,
"abstractUrl": "/proceedings-article/vlhcc/2016/07739668/12OmNxGj9OO",
"parentPublication": {
"id": "proceedings/vlhcc/2016/0252/0",
"title": "2016 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/08/08400404",
"title": "COPE: Interactive Exploration of Co-Occurrence Patterns in Spatial Time Series",
"doi": null,
"abstractUrl": "/journal/tg/2019/08/08400404/13rRUB7a1g3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06876015",
"title": "VAET: A Visual Analytics Approach for E-Transactions Time-Series",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06876015/13rRUyYSWl1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440040",
"title": "A Visual Analytics Framework for Spatiotemporal Trade Network Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440040/17D45WHONjL",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi/2018/7325/0/732500a342",
"title": "Visual Analytics Interface for Time Series Data Based on Trajectory Manipulation",
"doi": null,
"abstractUrl": "/proceedings-article/wi/2018/732500a342/17D45WODasq",
"parentPublication": {
"id": "proceedings/wi/2018/7325/0",
"title": "2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2018/7202/0/720200a251",
"title": "Visual Analytics for Decomposing Temporal Event Series of Production Lines",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a251/17D45WcjjRK",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a021",
"title": "Plotly-Resampler: Effective Visual Analytics for Large Time Series",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a021/1J6h7f8ozug",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012122889",
"articleId": "13rRUxjyX3Z",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122908",
"articleId": "13rRUIIVlcH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgJA",
"title": "July",
"year": "2013",
"issueNum": "07",
"idPrefix": "co",
"pubType": "magazine",
"volume": "46",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy0HYNj",
"doi": "10.1109/MC.2013.255",
"abstract": "Visual analytics is an emerging and fast-developing field that combines the strengths of graphical visualization with the power of analytical reasoning.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visual analytics is an emerging and fast-developing field that combines the strengths of graphical visualization with the power of analytical reasoning.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visual analytics is an emerging and fast-developing field that combines the strengths of graphical visualization with the power of analytical reasoning.",
"title": "Visual Analytics: Seeking the Unknown",
"normalizedTitle": "Visual Analytics: Seeking the Unknown",
"fno": "mco2013070020",
"hasPdf": true,
"idPrefix": "co",
"keywords": [
"Special Issues And Sections",
"Visual Analytics",
"Information Representation",
"Data Visualization",
"Bioinformatics",
"Multimedia Communication",
"Reasoning",
"Visual Analytics",
"Large Datasets",
"Data",
"Visualization"
],
"authors": [
{
"givenName": "Marc",
"surname": "Streit",
"fullName": "Marc Streit",
"affiliation": "Johannes Kepler University Linz",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Oliver",
"surname": "Bimber",
"fullName": "Oliver Bimber",
"affiliation": "Johannes Kepler University Linz",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "07",
"pubDate": "2013-07-01 00:00:00",
"pubType": "mags",
"pages": "20-21",
"year": "2013",
"issn": "0018-9162",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/2013/4892/0/4892b495",
"title": "A Role for Reasoning in Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2013/4892b495/12OmNqJ8tq4",
"parentPublication": {
"id": "proceedings/hicss/2013/4892/0",
"title": "2013 46th Hawaii International Conference on System Sciences",
"__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": "proceedings/hicss/2011/9618/0/05718616",
"title": "Pair Analytics: Capturing Reasoning Processes in Collaborative Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2011/05718616/12OmNvAiShB",
"parentPublication": {
"id": "proceedings/hicss/2011/9618/0",
"title": "2011 44th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2011/9618/0/05718615",
"title": "Expanding the Scope: Interaction Design Perspectives for Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2011/05718615/12OmNxGSm6x",
"parentPublication": {
"id": "proceedings/hicss/2011/9618/0",
"title": "2011 44th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csmr/2009/3589/0/3589a331",
"title": "SQuAVisiT: A Flexible Tool for Visual Software Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/csmr/2009/3589a331/12OmNzEVRYY",
"parentPublication": {
"id": "proceedings/csmr/2009/3589/0",
"title": "2009 13th European Conference on Software Maintenance and Reengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2008/01/mcg2008010018",
"title": "An Information-Theoretic View of Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2008/01/mcg2008010018/13rRUB6SpRW",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122908",
"title": "The User Puzzle—Explaining the Interaction with Visual Analytics Systems",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122908/13rRUIIVlcH",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07534883",
"title": "Characterizing Guidance in Visual Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07534883/13rRUxBa568",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vds/2022/5721/0/572100a001",
"title": "Case Study Comparison of Computational Notebook Platforms for Interactive Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vds/2022/572100a001/1JezLhI4Vm8",
"parentPublication": {
"id": "proceedings/vds/2022/5721/0",
"title": "2022 IEEE Visualization in Data Science (VDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2021/3827/0/382700a211",
"title": "Visual Analytics and Similarity Search - Interest-based Similarity Search in Scientific Data",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2021/382700a211/1y4oJ30dpcY",
"parentPublication": {
"id": "proceedings/iv/2021/3827/0",
"title": "2021 25th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mco2013070017",
"articleId": "13rRUxDqSbX",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mco2013070022",
"articleId": "13rRUx0gelz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvGPE8n",
"title": "Jan.",
"year": "2016",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "22",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUzp02op",
"doi": "10.1109/TVCG.2015.2467871",
"abstract": "Evaluation has become a fundamental part of visualization research and researchers have employed many approaches from the field of human-computer interaction like measures of task performance, thinking aloud protocols, and analysis of interaction logs. Recently, eye tracking has also become popular to analyze visual strategies of users in this context. This has added another modality and more data, which requires special visualization techniques to analyze this data. However, only few approaches exist that aim at an integrated analysis of multiple concurrent evaluation procedures. The variety, complexity, and sheer amount of such coupled multi-source data streams require a visual analytics approach. Our approach provides a highly interactive visualization environment to display and analyze thinking aloud, interaction, and eye movement data in close relation. Automatic pattern finding algorithms allow an efficient exploratory search and support the reasoning process to derive common eye-interaction-thinking patterns between participants. In addition, our tool equips researchers with mechanisms for searching and verifying expected usage patterns. We apply our approach to a user study involving a visual analytics application and we discuss insights gained from this joint analysis. We anticipate our approach to be applicable to other combinations of evaluation techniques and a broad class of visualization applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Evaluation has become a fundamental part of visualization research and researchers have employed many approaches from the field of human-computer interaction like measures of task performance, thinking aloud protocols, and analysis of interaction logs. Recently, eye tracking has also become popular to analyze visual strategies of users in this context. This has added another modality and more data, which requires special visualization techniques to analyze this data. However, only few approaches exist that aim at an integrated analysis of multiple concurrent evaluation procedures. The variety, complexity, and sheer amount of such coupled multi-source data streams require a visual analytics approach. Our approach provides a highly interactive visualization environment to display and analyze thinking aloud, interaction, and eye movement data in close relation. Automatic pattern finding algorithms allow an efficient exploratory search and support the reasoning process to derive common eye-interaction-thinking patterns between participants. In addition, our tool equips researchers with mechanisms for searching and verifying expected usage patterns. We apply our approach to a user study involving a visual analytics application and we discuss insights gained from this joint analysis. We anticipate our approach to be applicable to other combinations of evaluation techniques and a broad class of visualization applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Evaluation has become a fundamental part of visualization research and researchers have employed many approaches from the field of human-computer interaction like measures of task performance, thinking aloud protocols, and analysis of interaction logs. Recently, eye tracking has also become popular to analyze visual strategies of users in this context. This has added another modality and more data, which requires special visualization techniques to analyze this data. However, only few approaches exist that aim at an integrated analysis of multiple concurrent evaluation procedures. The variety, complexity, and sheer amount of such coupled multi-source data streams require a visual analytics approach. Our approach provides a highly interactive visualization environment to display and analyze thinking aloud, interaction, and eye movement data in close relation. Automatic pattern finding algorithms allow an efficient exploratory search and support the reasoning process to derive common eye-interaction-thinking patterns between participants. In addition, our tool equips researchers with mechanisms for searching and verifying expected usage patterns. We apply our approach to a user study involving a visual analytics application and we discuss insights gained from this joint analysis. We anticipate our approach to be applicable to other combinations of evaluation techniques and a broad class of visualization applications.",
"title": "VA<sup>2</sup>: A Visual Analytics Approach for Evaluating Visual Analytics Applications",
"normalizedTitle": "VA2: A Visual Analytics Approach for Evaluating Visual Analytics Applications",
"fno": "07192649",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Human Computer Interaction",
"VA 2 Approach",
"Visual Analytics Approach",
"Visual Analytics Applications",
"Visualization Research",
"Human Computer Interaction",
"Eye Tracking",
"Data Analysis",
"Concurrent Evaluation Procedure",
"Eye Interaction Thinking Pattern",
"Data Visualization",
"Protocols",
"Gaze Tracking",
"Synchronization",
"Navigation",
"Visual Analytics",
"Qualitative Evaluation",
"Thinking Aloud",
"Interaction Logs",
"Eye Tracking",
"Time Series Data",
"Visual Analytics",
"Qualitative Evaluation",
"Thinking Aloud",
"Interaction Logs",
"Eye Tracking",
"Time Series Data"
],
"authors": [
{
"givenName": "Tanja",
"surname": "Blascheck",
"fullName": "Tanja Blascheck",
"affiliation": ", Institute for Visualization and Interactive Systems (VIS), Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Markus",
"surname": "John",
"fullName": "Markus John",
"affiliation": ", Institute for Visualization and Interactive Systems (VIS), Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kuno",
"surname": "Kurzhals",
"fullName": "Kuno Kurzhals",
"affiliation": ", Visualization Research Center, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Steffen",
"surname": "Koch",
"fullName": "Steffen Koch",
"affiliation": ", Institute for Visualization and Interactive Systems (VIS), Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Ertl",
"fullName": "Thomas Ertl",
"affiliation": ", Institute for Visualization and Interactive Systems (VIS), Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2016-01-01 00:00:00",
"pubType": "trans",
"pages": "61-70",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bdva/2015/7343/0/07314288",
"title": "Challenges and Perspectives in Big Eye-Movement Data Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2015/07314288/12OmNButq1p",
"parentPublication": {
"id": "proceedings/bdva/2015/7343/0",
"title": "2015 Big Data Visual Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2009/02/mcg2009020014",
"title": "Defining Insight for Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2009/02/mcg2009020014/13rRUwh80JN",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122129",
"title": "Space-Time Visual Analytics of Eye-Tracking Data for Dynamic Stimuli",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122129/13rRUxBa5rW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2009/03/mcg2009030018",
"title": "Generating Synthetic Syndromic-Surveillance Data for Evaluating Visual-Analytics Techniques",
"doi": null,
"abstractUrl": "/magazine/cg/2009/03/mcg2009030018/13rRUxBrGjm",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2015/04/mcg2015040064",
"title": "Eye Tracking for Personal Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2015/04/mcg2015040064/13rRUyft7x8",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539297",
"title": "Visual Analytics for Mobile Eye Tracking",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539297/13rRUyv53Fx",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2022/01/09693359",
"title": "Visual Analytics for Human-Centered Machine Learning",
"doi": null,
"abstractUrl": "/magazine/cg/2022/01/09693359/1As7zEHCGn6",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlui/2018/4063/0/10075561",
"title": "Providing Contextual Assistance in Response to Frustration in Visual Analytics Tasks",
"doi": null,
"abstractUrl": "/proceedings-article/mlui/2018/10075561/1LIRyHjgHJu",
"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/mlui/2018/4063/0/10075649",
"title": "ModelSpace: Visualizing the Trails of Data Models in Visual Analytics Systems",
"doi": null,
"abstractUrl": "/proceedings-article/mlui/2018/10075649/1LIRz0dirNS",
"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/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"
}
],
"adjacentArticles": {
"previous": {
"fno": "07192662",
"articleId": "13rRUyuegha",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07192683",
"articleId": "13rRUxBa567",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFvP",
"name": "ttg201601-07192649s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201601-07192649s1.zip",
"extension": "zip",
"size": "354 kB",
"__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": "13rRUx0xPTJ",
"doi": "10.1109/TVCG.2006.194",
"abstract": "Video visualization is a computation process that extracts meaningful information from original video data sets and conveys the extracted information to users in appropriate visual representations. This paper presents a broad treatment of the subject, following a typical research pipeline involving concept formulation, system development, a path-finding user study, and a field trial with real application data. In particular, we have conducted a fundamental study on the visualization of motion events in videos. We have, for the first time, deployed flow visualization techniques in video visualization. We have compared the effectiveness of different abstract visual representations of videos. We have conducted a user study to examine whether users are able to learn to recognize visual signatures of motions, and to assist in the evaluation of different visualization techniques. We have applied our understanding and the developed techniques to a set of application video clips. Our study has demonstrated that video visualization is both technically feasible and cost-effective. It has provided the first set of evidence confirming that ordinary users can be accustomed to the visual features depicted in video visualizations, and can learn to recognize visual signatures of a variety of motion events.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Video visualization is a computation process that extracts meaningful information from original video data sets and conveys the extracted information to users in appropriate visual representations. This paper presents a broad treatment of the subject, following a typical research pipeline involving concept formulation, system development, a path-finding user study, and a field trial with real application data. In particular, we have conducted a fundamental study on the visualization of motion events in videos. We have, for the first time, deployed flow visualization techniques in video visualization. We have compared the effectiveness of different abstract visual representations of videos. We have conducted a user study to examine whether users are able to learn to recognize visual signatures of motions, and to assist in the evaluation of different visualization techniques. We have applied our understanding and the developed techniques to a set of application video clips. Our study has demonstrated that video visualization is both technically feasible and cost-effective. It has provided the first set of evidence confirming that ordinary users can be accustomed to the visual features depicted in video visualizations, and can learn to recognize visual signatures of a variety of motion events.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Video visualization is a computation process that extracts meaningful information from original video data sets and conveys the extracted information to users in appropriate visual representations. This paper presents a broad treatment of the subject, following a typical research pipeline involving concept formulation, system development, a path-finding user study, and a field trial with real application data. In particular, we have conducted a fundamental study on the visualization of motion events in videos. We have, for the first time, deployed flow visualization techniques in video visualization. We have compared the effectiveness of different abstract visual representations of videos. We have conducted a user study to examine whether users are able to learn to recognize visual signatures of motions, and to assist in the evaluation of different visualization techniques. We have applied our understanding and the developed techniques to a set of application video clips. Our study has demonstrated that video visualization is both technically feasible and cost-effective. It has provided the first set of evidence confirming that ordinary users can be accustomed to the visual features depicted in video visualizations, and can learn to recognize visual signatures of a variety of motion events.",
"title": "Visual Signatures in Video Visualization",
"normalizedTitle": "Visual Signatures in Video Visualization",
"fno": "v1093",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Video Visualization",
"Volume Visualization",
"Flow Visualization",
"Human Factors",
"User Study",
"Visual Signatures",
"Video Processing",
"Optical Flow",
"GPU Rendering"
],
"authors": [
{
"givenName": "Min",
"surname": "Chen",
"fullName": "Min Chen",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ralf",
"surname": "Botchen",
"fullName": "Ralf Botchen",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rudy",
"surname": "Hashim",
"fullName": "Rudy Hashim",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Weiskopf",
"fullName": "Daniel Weiskopf",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Ertl",
"fullName": "Thomas Ertl",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ian",
"surname": "Thornton",
"fullName": "Ian Thornton",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "trans",
"pages": "1093-1100",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/avss/2011/0844/0/06027348",
"title": "Next-generation 3D visualization for visual surveillance",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2011/06027348/12OmNAm4THZ",
"parentPublication": {
"id": "proceedings/avss/2011/0844/0",
"title": "2011 8th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300054",
"title": "Video visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300054/12OmNqFrGtk",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660081",
"title": "Particle and Texture Based Spatiotemporal Visualization of Time-Dependent Vector Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660081/12OmNrHjqKB",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2012/4745/0/4745a409",
"title": "Ring Group Signatures",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2012/4745a409/12OmNvk7JM8",
"parentPublication": {
"id": "proceedings/trustcom/2012/4745/0",
"title": "2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2005/9331/0/01521400",
"title": "Audio, video and audio-visual signatures for short video clip detection: experiments on Trecvid2003",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2005/01521400/12OmNxR5UKg",
"parentPublication": {
"id": "proceedings/icme/2005/9331/0",
"title": "2005 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlhcc/2012/0852/0/06344514",
"title": "Rapid Serial Visual Presentation in dynamic graph visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vlhcc/2012/06344514/12OmNxYL5fe",
"parentPublication": {
"id": "proceedings/vlhcc/2012/0852/0",
"title": "2012 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmcs/1999/0253/1/02539388",
"title": "\"What is in that video anyway?\": In Search of Better Browsing",
"doi": null,
"abstractUrl": "/proceedings-article/icmcs/1999/02539388/12OmNy7Qfnb",
"parentPublication": {
"id": "proceedings/icmcs/1999/0253/1",
"title": "Multimedia Computing and Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/08/06684146",
"title": "Glyph-Based Video Visualization for Semen Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2015/08/06684146/13rRUILLkvv",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122095",
"title": "Evaluation of Fast-Forward Video Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122095/13rRUzpzeB3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis4dh/2022/7668/0/766800a006",
"title": "Data Feel: Exploring Visual Effects in Video Games to Support Sensemaking Tasks",
"doi": null,
"abstractUrl": "/proceedings-article/vis4dh/2022/766800a006/1J2XIfWP19C",
"parentPublication": {
"id": "proceedings/vis4dh/2022/7668/0",
"title": "2022 IEEE 7th Workshop on Visualization for the Digital Humanities (VIS4DH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1085",
"articleId": "13rRUwI5TQN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1101",
"articleId": "13rRUwInvJ9",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNznkK6H",
"title": "January-February",
"year": "2004",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "10",
"label": "January-February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgs2BK",
"doi": "10.1109/TVCG.2004.1260759",
"abstract": "Abstract—Visualization can provide valuable assistance for data analysis and decision making tasks. However, how people perceive and interact with a visualization tool can strongly influence their understanding of the data as well as the system's usefulness. Human factors therefore contribute significantly to the visualization process and should play an important role in the design and evaluation of visualization tools. Several research initiatives have begun to explore human factors in visualization, particularly in perception-based design. Nonetheless, visualization work involving human factors is in its infancy, and many potentially promising areas have yet to be explored. Therefore, this paper aims to 1) review known methodology for doing human factors research, with specific emphasis on visualization, 2) review current human factors research in visualization to provide a basis for future investigation, and 3) identify promising areas for future research.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Visualization can provide valuable assistance for data analysis and decision making tasks. However, how people perceive and interact with a visualization tool can strongly influence their understanding of the data as well as the system's usefulness. Human factors therefore contribute significantly to the visualization process and should play an important role in the design and evaluation of visualization tools. Several research initiatives have begun to explore human factors in visualization, particularly in perception-based design. Nonetheless, visualization work involving human factors is in its infancy, and many potentially promising areas have yet to be explored. Therefore, this paper aims to 1) review known methodology for doing human factors research, with specific emphasis on visualization, 2) review current human factors research in visualization to provide a basis for future investigation, and 3) identify promising areas for future research.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Visualization can provide valuable assistance for data analysis and decision making tasks. However, how people perceive and interact with a visualization tool can strongly influence their understanding of the data as well as the system's usefulness. Human factors therefore contribute significantly to the visualization process and should play an important role in the design and evaluation of visualization tools. Several research initiatives have begun to explore human factors in visualization, particularly in perception-based design. Nonetheless, visualization work involving human factors is in its infancy, and many potentially promising areas have yet to be explored. Therefore, this paper aims to 1) review known methodology for doing human factors research, with specific emphasis on visualization, 2) review current human factors research in visualization to provide a basis for future investigation, and 3) identify promising areas for future research.",
"title": "Human Factors in Visualization Research",
"normalizedTitle": "Human Factors in Visualization Research",
"fno": "v0072",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Human Factors",
"Visualization",
"Perception",
"Cognitive Support",
"Methodology"
],
"authors": [
{
"givenName": "Melanie",
"surname": "Tory",
"fullName": "Melanie Tory",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Torsten",
"surname": "M?ller",
"fullName": "Torsten M?ller",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2004-01-01 00:00:00",
"pubType": "trans",
"pages": "72-84",
"year": "2004",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0058",
"articleId": "13rRUwdrdSp",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0085",
"articleId": "13rRUxDIth5",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNylsZGk",
"title": "Nov.-Dec.",
"year": "2014",
"issueNum": "06",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "16",
"label": "Nov.-Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwwaKnK",
"doi": "10.1109/MCSE.2014.4",
"abstract": "Human computation is a computing approach that lets humans perform tasks for which there's still no satisfactory solution, even when today's most sophisticated computing infrastructures are used. One stream of human computation is âvolunteer thinking,â' systems that gather volunteers willing to contribute by executing human computation tasks in citizen-science systems. The authors report the findings of a volunteer engagement characterization study of two astronomy projects: Galaxy Zoo and the Milky Way Project. Approximately 10 million tasks executed by 100,000 volunteers over a near-two-year time period form the basis of the study. Their results show a diversity of engagement patterns in terms of frequency, daily productivity, typical session duration, and the amount of time devoted to the project. The authors discuss the implications of such patterns and offer suggestions to researchers who are seeking to take advantage of this computing approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Human computation is a computing approach that lets humans perform tasks for which there's still no satisfactory solution, even when today's most sophisticated computing infrastructures are used. One stream of human computation is âvolunteer thinking,â' systems that gather volunteers willing to contribute by executing human computation tasks in citizen-science systems. The authors report the findings of a volunteer engagement characterization study of two astronomy projects: Galaxy Zoo and the Milky Way Project. Approximately 10 million tasks executed by 100,000 volunteers over a near-two-year time period form the basis of the study. Their results show a diversity of engagement patterns in terms of frequency, daily productivity, typical session duration, and the amount of time devoted to the project. The authors discuss the implications of such patterns and offer suggestions to researchers who are seeking to take advantage of this computing approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Human computation is a computing approach that lets humans perform tasks for which there's still no satisfactory solution, even when today's most sophisticated computing infrastructures are used. One stream of human computation is âvolunteer thinking,â' systems that gather volunteers willing to contribute by executing human computation tasks in citizen-science systems. The authors report the findings of a volunteer engagement characterization study of two astronomy projects: Galaxy Zoo and the Milky Way Project. Approximately 10 million tasks executed by 100,000 volunteers over a near-two-year time period form the basis of the study. Their results show a diversity of engagement patterns in terms of frequency, daily productivity, typical session duration, and the amount of time devoted to the project. The authors discuss the implications of such patterns and offer suggestions to researchers who are seeking to take advantage of this computing approach.",
"title": "Volunteers' Engagement in Human Computation for Astronomy Projects",
"normalizedTitle": "Volunteers' Engagement in Human Computation for Astronomy Projects",
"fno": "mcs2014060052",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Astronomy Computing",
"Graphical User Interfaces",
"Human Computer Interaction",
"Human Factors",
"Project Management",
"Astronomy Projects",
"Computing Infrastructures",
"Volunteer Willingness",
"Human Computation Tasks",
"Citizen Science Systems",
"Volunteer Engagement Pattern Characterization",
"Galaxy Zoo",
"Project Frequency",
"Daily Project Productivity",
"Project Session Duration",
"Project Time",
"Milky Way Project",
"Productivity",
"Time Frequency Analysis",
"Transient Analysis",
"Computation Theory",
"Frequency Diversity",
"Scientific Computing",
"Human Factors",
"Astronomy",
"Citizen Science",
"Human Computation",
"Volunteer Engagement Patterns",
"Characterization And Modeling",
"Scientific Computing"
],
"authors": [
{
"givenName": "Lesandro",
"surname": "Ponciano",
"fullName": "Lesandro Ponciano",
"affiliation": "Universidade Federal de Campina Grande",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Francisco",
"surname": "Brasileiro",
"fullName": "Francisco Brasileiro",
"affiliation": "Universidade Federal de Campina Grande",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert",
"surname": "Simpson",
"fullName": "Robert Simpson",
"affiliation": "University of Oxford",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Arfon",
"surname": "Smith",
"fullName": "Arfon Smith",
"affiliation": "GitHub",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2014-11-01 00:00:00",
"pubType": "mags",
"pages": "52-59",
"year": "2014",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cse/2009/3823/4/3823e723",
"title": "A Survey of Human Computation Systems",
"doi": null,
"abstractUrl": "/proceedings-article/cse/2009/3823e723/12OmNARAn8w",
"parentPublication": {
"id": "proceedings/cse/2009/3823/2",
"title": "2009 International Conference on Computational Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2013/4892/0/4892a610",
"title": "An Exploratory Factor Analysis of Motivations for Participating in Zooniverse, a Collection of Virtual Citizen Science Projects",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2013/4892a610/12OmNAle6j9",
"parentPublication": {
"id": "proceedings/hicss/2013/4892/0",
"title": "2013 46th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rtcsa/2000/0930/0/09300289",
"title": "Optimal scheduling of imprecise computation tasks in the presence of multiple faults",
"doi": null,
"abstractUrl": "/proceedings-article/rtcsa/2000/09300289/12OmNApcu7O",
"parentPublication": {
"id": "proceedings/rtcsa/2000/0930/0",
"title": "Proceedings Seventh International Conference on Real-Time Computing Systems and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/igcc/2011/1222/0/06008564",
"title": "Improving MapReduce energy efficiency for computation intensive workloads",
"doi": null,
"abstractUrl": "/proceedings-article/igcc/2011/06008564/12OmNBNM99y",
"parentPublication": {
"id": "proceedings/igcc/2011/1222/0",
"title": "2011 International Green Computing Conference and Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/srii/2012/4770/0/4770a850",
"title": "Employee Engagement: Conceptual Model and Computation Framework",
"doi": null,
"abstractUrl": "/proceedings-article/srii/2012/4770a850/12OmNC3XhxI",
"parentPublication": {
"id": "proceedings/srii/2012/4770/0",
"title": "Annual SRII Global Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1995/7310/2/73102315",
"title": "Coursework in image computation for undergraduates",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1995/73102315/12OmNxHJ9mU",
"parentPublication": {
"id": "proceedings/icip/1995/7310/2",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icedeg/2021/2512/0/09530994",
"title": "Digitalized Co-production: Using Volunteers as First Responders",
"doi": null,
"abstractUrl": "/proceedings-article/icedeg/2021/09530994/1wRJHU9vWWQ",
"parentPublication": {
"id": "proceedings/icedeg/2021/2512/0",
"title": "2021 Eighth International Conference on eDemocracy & eGovernment (ICEDEG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcs2014060042",
"articleId": "13rRUyp7u0p",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcs2014060060",
"articleId": "13rRUwkfAUy",
"__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": "13rRUxBa5xf",
"doi": "10.1109/TVCG.2011.127",
"abstract": "A fundamental goal of visualization is to produce images of data that support visual analysis, exploration, and discovery of novel insights. An important consideration during visualization design is the role of human visual perception. How we \"see” details in an image can directly impact a viewer's efficiency and effectiveness. This paper surveys research on attention and visual perception, with a specific focus on results that have direct relevance to visualization and visual analytics. We discuss theories of low-level visual perception, then show how these findings form a foundation for more recent work on visual memory and visual attention. We conclude with a brief overview of how knowledge of visual attention and visual memory is being applied in visualization and graphics. We also discuss how challenges in visualization are motivating research in psychophysics.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A fundamental goal of visualization is to produce images of data that support visual analysis, exploration, and discovery of novel insights. An important consideration during visualization design is the role of human visual perception. How we \"see” details in an image can directly impact a viewer's efficiency and effectiveness. This paper surveys research on attention and visual perception, with a specific focus on results that have direct relevance to visualization and visual analytics. We discuss theories of low-level visual perception, then show how these findings form a foundation for more recent work on visual memory and visual attention. We conclude with a brief overview of how knowledge of visual attention and visual memory is being applied in visualization and graphics. We also discuss how challenges in visualization are motivating research in psychophysics.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A fundamental goal of visualization is to produce images of data that support visual analysis, exploration, and discovery of novel insights. An important consideration during visualization design is the role of human visual perception. How we \"see” details in an image can directly impact a viewer's efficiency and effectiveness. This paper surveys research on attention and visual perception, with a specific focus on results that have direct relevance to visualization and visual analytics. We discuss theories of low-level visual perception, then show how these findings form a foundation for more recent work on visual memory and visual attention. We conclude with a brief overview of how knowledge of visual attention and visual memory is being applied in visualization and graphics. We also discuss how challenges in visualization are motivating research in psychophysics.",
"title": "Attention and Visual Memory in Visualization and Computer Graphics",
"normalizedTitle": "Attention and Visual Memory in Visualization and Computer Graphics",
"fno": "05963660",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visual Perception",
"Data Analysis",
"Data Visualisation",
"Psychophysics",
"Visual Memory",
"Attention",
"Computer Graphics",
"Visual Analysis",
"Visualization Design",
"Human Visual Perception",
"Visual Analytics",
"Visual Attention",
"Visualization",
"Feature Extraction",
"Humans",
"Bars",
"Visual Perception",
"Data Visualization",
"Visualization",
"Attention",
"Color",
"Motion",
"Nonphotorealism",
"Texture",
"Visual Memory",
"Visual Perception"
],
"authors": [
{
"givenName": "C. G.",
"surname": "Healey",
"fullName": "C. G. Healey",
"affiliation": "Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "J. T.",
"surname": "Enns",
"fullName": "J. T. Enns",
"affiliation": "Dept. of Psychol., Univ. of British Columbia, Vancouver, BC, Canada",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2012-07-01 00:00:00",
"pubType": "trans",
"pages": "1170-1188",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2015/7568/0/7568a536",
"title": "Enhancing Visual Perception and Directing Viewer's Attention in Interactive Direct Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2015/7568a536/12OmNAWpymA",
"parentPublication": {
"id": "proceedings/iv/2015/7568/0",
"title": "2015 19th International Conference on Information Visualisation (iV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/jcai/2009/3615/0/3615a390",
"title": "Bayesian Visual Inference and Attention",
"doi": null,
"abstractUrl": "/proceedings-article/jcai/2009/3615a390/12OmNApLGPo",
"parentPublication": {
"id": "proceedings/jcai/2009/3615/0",
"title": "2009 International Joint Conference on Artificial Intelligence (JCAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2001/1195/0/11950085",
"title": "Query by Attention: Visually Searchable Information Maps",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2001/11950085/12OmNC4eSGU",
"parentPublication": {
"id": "proceedings/iv/2001/1195/0",
"title": "Proceedings Fifth International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/camp/1995/7134/0/71340222",
"title": "Hierarchical and modular attention",
"doi": null,
"abstractUrl": "/proceedings-article/camp/1995/71340222/12OmNxG1yIZ",
"parentPublication": {
"id": "proceedings/camp/1995/7134/0",
"title": "Computer Architectures for Machine Perception, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498lum",
"title": "Kinetic Visualization - A Technique for Illustrating 3D Shape and Structure",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498lum/12OmNyNQSCD",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1992/2897/0/00235185",
"title": "Improving visualization: theoretical and empirical foundations",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1992/00235185/12OmNynJMCQ",
"parentPublication": {
"id": "proceedings/visual/1992/2897/0",
"title": "Proceedings Visualization '92",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2010/01/tth2010010028",
"title": "Effects of Packet Loss and Latency on the Temporal Discrimination of Visual-Haptic Events",
"doi": null,
"abstractUrl": "/journal/th/2010/01/tth2010010028/13rRUEgarsO",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122516",
"title": "Perception of Visual Variables on Tiled Wall-Sized Displays for Information Visualization Applications",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122516/13rRUwwJWFM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis/2019/0801/0/08940163",
"title": "A Study of Visual Attention Elements with Experiment Analysis Based on Composition",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2019/08940163/1gjRP0Bd2wg",
"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": "05928340",
"articleId": "13rRUzpzeB2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05963665",
"articleId": "13rRUyft7D1",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAtstbf",
"title": "January/February",
"year": "2010",
"issueNum": "01",
"idPrefix": "ic",
"pubType": "magazine",
"volume": "14",
"label": "January/February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy3gn29",
"doi": "10.1109/MIC.2010.4",
"abstract": "Computing for human experience will employ a suite of technologies to nondestructively and unobtrusively complement and enrich normal human activities, with minimal explicit concern or effort on the humans' part.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Computing for human experience will employ a suite of technologies to nondestructively and unobtrusively complement and enrich normal human activities, with minimal explicit concern or effort on the humans' part.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Computing for human experience will employ a suite of technologies to nondestructively and unobtrusively complement and enrich normal human activities, with minimal explicit concern or effort on the humans' part.",
"title": "Computing for Human Experience: Semantics-Empowered Sensors, Services, and Social Computing on the Ubiquitous Web",
"normalizedTitle": "Computing for Human Experience: Semantics-Empowered Sensors, Services, and Social Computing on the Ubiquitous Web",
"fno": "mic2010010088",
"hasPdf": true,
"idPrefix": "ic",
"keywords": [
"Computing For Human Experience",
"Internet",
"Pervasive Computing",
"Social Computing",
"Semantic Web",
"Ontologies",
"Human Computer Interaction",
"Human Perception",
"Machine Perception",
"Semantic Computing"
],
"authors": [
{
"givenName": "Amit",
"surname": "Sheth",
"fullName": "Amit Sheth",
"affiliation": "Wright State University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2010-01-01 00:00:00",
"pubType": "mags",
"pages": "88-91",
"year": "2010",
"issn": "1089-7801",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icmlc/2003/7865/3/01259808",
"title": "Seamless provisioning of service in the ubiquitous computing environment",
"doi": null,
"abstractUrl": "/proceedings-article/icmlc/2003/01259808/12OmNB9t6yi",
"parentPublication": {
"id": "proceedings/icmlc/2003/7865/3",
"title": "Proceedings of the 2003 International Conference on Machine Learning and Cybernetics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imis/2012/4684/0/4684a634",
"title": "Security Paradigm in Ubiquitous Computing",
"doi": null,
"abstractUrl": "/proceedings-article/imis/2012/4684a634/12OmNqGitYS",
"parentPublication": {
"id": "proceedings/imis/2012/4684/0",
"title": "Innovative Mobile and Internet Services in Ubiquitous Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsem/2010/4223/1/4223a230",
"title": "Exploration of Subjective Human Factor Engineering Based on Perception",
"doi": null,
"abstractUrl": "/proceedings-article/icsem/2010/4223a230/12OmNxT56DS",
"parentPublication": {
"id": "proceedings/icsem/2010/4223/1",
"title": "2010 International Conference on System Science, Engineering Design and Manufacturing Informatization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2013/01/mex2013010078",
"title": "Physical-Cyber-Social Computing: An Early 21st Century Approach",
"doi": null,
"abstractUrl": "/magazine/ex/2013/01/mex2013010078/13rRUILtJvo",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122104",
"title": "Human Computation in Visualization: Using Purpose Driven Games for Robust Evaluation of Visualization Algorithms",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122104/13rRUwInvJf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ic/2011/06/mic2011060003",
"title": "Semantics Scales Up: Beyond Search in Web 3.0",
"doi": null,
"abstractUrl": "/magazine/ic/2011/06/mic2011060003/13rRUwjGoCs",
"parentPublication": {
"id": "mags/ic",
"title": "IEEE Internet Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/pc/2003/03/b3062",
"title": "Acoustic Modems for Ubiquitous Computing",
"doi": null,
"abstractUrl": "/magazine/pc/2003/03/b3062/13rRUxASu8I",
"parentPublication": {
"id": "mags/pc",
"title": "IEEE Pervasive Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ic/2009/01/mic2009010076",
"title": "Semantics-Empowered Social Computing",
"doi": null,
"abstractUrl": "/magazine/ic/2009/01/mic2009010076/13rRUxDItjE",
"parentPublication": {
"id": "mags/ic",
"title": "IEEE Internet Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mu/2006/04/u4020",
"title": "Ubiquitous Experience Media",
"doi": null,
"abstractUrl": "/magazine/mu/2006/04/u4020/13rRUxcKzTx",
"parentPublication": {
"id": "mags/mu",
"title": "IEEE MultiMedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/pc/2002/01/00993144",
"title": "The human experience [of ubiquitous computing]",
"doi": null,
"abstractUrl": "/magazine/pc/2002/01/00993144/13rRUygBwbM",
"parentPublication": {
"id": "mags/pc",
"title": "IEEE Pervasive Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mic2010010084",
"articleId": "13rRUxASuru",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mic2010010092",
"articleId": "13rRUwbJD1l",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet0q",
"name": "mic2010010088s.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/mic2010010088s.pdf",
"extension": "pdf",
"size": "252 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzFdtc6",
"title": "November/December",
"year": "2010",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "16",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwd9CG0",
"doi": "10.1109/TVCG.2010.216",
"abstract": "Understanding the diversity of a set of multivariate objects is an important problem in many domains, including ecology, college admissions, investing, machine learning, and others. However, to date, very little work has been done to help users achieve this kind of understanding. Visual representation is especially appealing for this task because it offers the potential to allow users to efficiently observe the objects of interest in a direct and holistic way. Thus, in this paper, we attempt to formalize the problem of visualizing the diversity of a large (more than 1000 objects), multivariate (more than 5 attributes) data set as one worth deeper investigation by the information visualization community. In doing so, we contribute a precise definition of diversity, a set of requirements for diversity visualizations based on this definition, and a formal user study design intended to evaluate the capacity of a visual representation for communicating diversity information. Our primary contribution, however, is a visual representation, called the Diversity Map, for visualizing diversity. An evaluation of the Diversity Map using our study design shows that users can judge elements of diversity consistently and as or more accurately than when using the only other representation specifically designed to visualize diversity.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Understanding the diversity of a set of multivariate objects is an important problem in many domains, including ecology, college admissions, investing, machine learning, and others. However, to date, very little work has been done to help users achieve this kind of understanding. Visual representation is especially appealing for this task because it offers the potential to allow users to efficiently observe the objects of interest in a direct and holistic way. Thus, in this paper, we attempt to formalize the problem of visualizing the diversity of a large (more than 1000 objects), multivariate (more than 5 attributes) data set as one worth deeper investigation by the information visualization community. In doing so, we contribute a precise definition of diversity, a set of requirements for diversity visualizations based on this definition, and a formal user study design intended to evaluate the capacity of a visual representation for communicating diversity information. Our primary contribution, however, is a visual representation, called the Diversity Map, for visualizing diversity. An evaluation of the Diversity Map using our study design shows that users can judge elements of diversity consistently and as or more accurately than when using the only other representation specifically designed to visualize diversity.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Understanding the diversity of a set of multivariate objects is an important problem in many domains, including ecology, college admissions, investing, machine learning, and others. However, to date, very little work has been done to help users achieve this kind of understanding. Visual representation is especially appealing for this task because it offers the potential to allow users to efficiently observe the objects of interest in a direct and holistic way. Thus, in this paper, we attempt to formalize the problem of visualizing the diversity of a large (more than 1000 objects), multivariate (more than 5 attributes) data set as one worth deeper investigation by the information visualization community. In doing so, we contribute a precise definition of diversity, a set of requirements for diversity visualizations based on this definition, and a formal user study design intended to evaluate the capacity of a visual representation for communicating diversity information. Our primary contribution, however, is a visual representation, called the Diversity Map, for visualizing diversity. An evaluation of the Diversity Map using our study design shows that users can judge elements of diversity consistently and as or more accurately than when using the only other representation specifically designed to visualize diversity.",
"title": "Visualization of Diversity in Large Multivariate Data Sets",
"normalizedTitle": "Visualization of Diversity in Large Multivariate Data Sets",
"fno": "ttg2010061053",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Information Visualization",
"Diversity",
"Categorical Data",
"Multivariate Data",
"Evaluation"
],
"authors": [
{
"givenName": "Tuan",
"surname": "Pham",
"fullName": "Tuan Pham",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rob",
"surname": "Hess",
"fullName": "Rob Hess",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Crystal",
"surname": "Ju",
"fullName": "Crystal Ju",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eugene",
"surname": "Zhang",
"fullName": "Eugene Zhang",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ronald",
"surname": "Metoyer",
"fullName": "Ronald Metoyer",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2010-11-01 00:00:00",
"pubType": "trans",
"pages": "1053-1062",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-infovis/1996/7668/0/76680074",
"title": "Dual multiresolution HyperSlice for multivariate data visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/1996/76680074/12OmNC8uRCK",
"parentPublication": {
"id": "proceedings/ieee-infovis/1996/7668/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1997/8262/0/82620111",
"title": "Multivariate visualization using metric scaling",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1997/82620111/12OmNqOwQJt",
"parentPublication": {
"id": "proceedings/ieee-vis/1997/8262/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apvis/2007/0808/0/04126215",
"title": "GraphScape: integrated multivariate network visualization",
"doi": null,
"abstractUrl": "/proceedings-article/apvis/2007/04126215/12OmNrJAdV8",
"parentPublication": {
"id": "proceedings/apvis/2007/0808/0",
"title": "Asia-Pacific Symposium on Visualisation 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660022",
"title": "Query-Driven Visualization of Large Data Sets",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660022/12OmNvAAtDg",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dagstuhl/1997/0503/0/05030314",
"title": "Perceptual Benchmarking for Multivariate Data Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/dagstuhl/1997/05030314/12OmNwJPMVt",
"parentPublication": {
"id": "proceedings/dagstuhl/1997/0503/0",
"title": "Dagstuhl '97 - Scientific Visualization Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0558",
"title": "Parallel Sets: Interactive Exploration and Visual Analysis of Categorical Data",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0558/13rRUwhpBDX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122114",
"title": "Evaluation of Multivariate Visualization on a Multivariate Task",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122114/13rRUxBa55Z",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061467",
"title": "Visualizing Temporal Patterns in Large Multivariate Data using Modified Globbing",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061467/13rRUxjQyvd",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061459",
"title": "Brushing of Attribute Clouds for the Visualization of Multivariate Data",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061459/13rRUxly8Xz",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/06/07911335",
"title": "Indexed-Points Parallel Coordinates Visualization of Multivariate Correlations",
"doi": null,
"abstractUrl": "/journal/tg/2018/06/07911335/13rRUxly9e1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010061027",
"articleId": "13rRUNvya9i",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010061063",
"articleId": "13rRUy0qnGg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAtstbj",
"title": "Sept.",
"year": "2012",
"issueNum": "09",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwwJWFL",
"doi": "10.1109/TVCG.2012.80",
"abstract": "In this paper, we present an effective and scalable system for multivariate volume data visualization and analysis with a novel transfer function interface design that tightly couples parallel coordinates plots (PCP) and MDS-based dimension projection plots. In our system, the PCP visualizes the data distribution of each variate (dimension) and the MDS plots project features. They are integrated seamlessly to provide flexible feature classification without context switching between different data presentations during the user interaction. The proposed interface enables users to identify relevant correlation clusters and assign optical properties with lassos, magic wand, and other tools. Furthermore, direct sketching on the volume rendered images has been implemented to probe and edit features. With our system, users can interactively analyze multivariate volumetric data sets by navigating and exploring feature spaces in unified PCP and MDS plots. To further support large-scale multivariate volume data visualization and analysis, Scalable Pivot MDS (SPMDS), parallel adaptive continuous PCP rendering, as well as parallel rendering techniques are developed and integrated into our visualization system. Our experiments show that the system is effective in multivariate volume data visualization and its performance is highly scalable for data sets with different sizes and number of variates.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present an effective and scalable system for multivariate volume data visualization and analysis with a novel transfer function interface design that tightly couples parallel coordinates plots (PCP) and MDS-based dimension projection plots. In our system, the PCP visualizes the data distribution of each variate (dimension) and the MDS plots project features. They are integrated seamlessly to provide flexible feature classification without context switching between different data presentations during the user interaction. The proposed interface enables users to identify relevant correlation clusters and assign optical properties with lassos, magic wand, and other tools. Furthermore, direct sketching on the volume rendered images has been implemented to probe and edit features. With our system, users can interactively analyze multivariate volumetric data sets by navigating and exploring feature spaces in unified PCP and MDS plots. To further support large-scale multivariate volume data visualization and analysis, Scalable Pivot MDS (SPMDS), parallel adaptive continuous PCP rendering, as well as parallel rendering techniques are developed and integrated into our visualization system. Our experiments show that the system is effective in multivariate volume data visualization and its performance is highly scalable for data sets with different sizes and number of variates.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present an effective and scalable system for multivariate volume data visualization and analysis with a novel transfer function interface design that tightly couples parallel coordinates plots (PCP) and MDS-based dimension projection plots. In our system, the PCP visualizes the data distribution of each variate (dimension) and the MDS plots project features. They are integrated seamlessly to provide flexible feature classification without context switching between different data presentations during the user interaction. The proposed interface enables users to identify relevant correlation clusters and assign optical properties with lassos, magic wand, and other tools. Furthermore, direct sketching on the volume rendered images has been implemented to probe and edit features. With our system, users can interactively analyze multivariate volumetric data sets by navigating and exploring feature spaces in unified PCP and MDS plots. To further support large-scale multivariate volume data visualization and analysis, Scalable Pivot MDS (SPMDS), parallel adaptive continuous PCP rendering, as well as parallel rendering techniques are developed and integrated into our visualization system. Our experiments show that the system is effective in multivariate volume data visualization and its performance is highly scalable for data sets with different sizes and number of variates.",
"title": "Scalable Multivariate Volume Visualization and Analysis Based on Dimension Projection and Parallel Coordinates",
"normalizedTitle": "Scalable Multivariate Volume Visualization and Analysis Based on Dimension Projection and Parallel Coordinates",
"fno": "06171180",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Rendering Computer Graphics",
"Data Visualisation",
"Pattern Classification",
"Parallel Adaptive Continuous PCP Rendering",
"Scalable Multivariate Volume Visualization",
"Dimension Projection",
"Parallel Coordinates",
"Multivariate Volume Data Visualization",
"Transfer Function Interface Design",
"Parallel Coordinates Plots",
"MDS Based Dimension Projection Plots",
"Flexible Feature Classification",
"Context Switching",
"Data Presentations",
"User Interaction",
"Optical Properties",
"Lassos",
"Magic Wand",
"Direct Sketching",
"Volume Rendered Images",
"Multivariate Volumetric Data Sets",
"MDS Plots",
"PCP Plots",
"Scalable Pivot MDS",
"Data Visualization",
"Rendering Computer Graphics",
"Transfer Functions",
"Algorithm Design And Analysis",
"Vegetation",
"Correlation",
"Parallel Visualization",
"Multivariate Volume",
"Transfer Function",
"Parallel Coordinates",
"Dimension Projection",
"User Interface Design"
],
"authors": [
{
"givenName": null,
"surname": "He Xiao",
"fullName": "He Xiao",
"affiliation": "Key Lab. of Machine Perception, Peking Univ., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Hanqi Guo",
"fullName": "Hanqi Guo",
"affiliation": "Key Lab. of Machine Perception, Peking Univ., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Xiaoru Yuan",
"fullName": "Xiaoru Yuan",
"affiliation": "Key Lab. of Machine Perception, Peking Univ., Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2012-09-01 00:00:00",
"pubType": "trans",
"pages": "1397-1410",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/waim/2008/3185/0/3185a165",
"title": "Advanced Star Coordinates",
"doi": null,
"abstractUrl": "/proceedings-article/waim/2008/3185a165/12OmNAYoKoO",
"parentPublication": {
"id": "proceedings/waim/2008/3185/0",
"title": "Web-Age Information Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2002/1784/0/17840394",
"title": "Visualization of Multidimensional, Multivariate Volume Data Using Hardware-Accelerated Non-Photorealistic Rendering Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2002/17840394/12OmNB9KHwC",
"parentPublication": {
"id": "proceedings/pg/2002/1784/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/socpar/2009/3879/0/3879a254",
"title": "An Artificial Neural Network Model for Multi Dimension Reduction and Data Structure Exploration",
"doi": null,
"abstractUrl": "/proceedings-article/socpar/2009/3879a254/12OmNBlFQWz",
"parentPublication": {
"id": "proceedings/socpar/2009/3879/0",
"title": "Soft Computing and Pattern Recognition, International Conference of",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2011/935/0/05742368",
"title": "Multi-dimensional transfer function design based on flexible dimension projection embedded in parallel coordinates",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742368/12OmNvSKO3J",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icst/2012/4670/0/4670a737",
"title": "Enhancing Fault Localization via Multivariate Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/icst/2012/4670a737/12OmNxd4to6",
"parentPublication": {
"id": "proceedings/icst/2012/4670/0",
"title": "2012 IEEE Fifth International Conference on Software Testing, Verification and Validation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1999/5897/0/58970004",
"title": "Hierarchical Parallel Coordinates for Exploration of Large Datasets",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1999/58970004/12OmNyo1nOw",
"parentPublication": {
"id": "proceedings/ieee-vis/1999/5897/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2011/0155/0/06092328",
"title": "Scalable multivariate volume visualization and analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2011/06092328/12OmNzxyiNw",
"parentPublication": {
"id": "proceedings/ldav/2011/0155/0",
"title": "IEEE Symposium on Large Data Analysis and Visualization (LDAV 2011)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192673",
"title": "Temporal MDS Plots for Analysis of Multivariate Data",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192673/13rRUx0gefm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122310",
"title": "Flexible Linked Axes for Multivariate Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122310/13rRUxD9h54",
"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"
}
],
"adjacentArticles": {
"previous": {
"fno": "06175895",
"articleId": "13rRUwbaqUN",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzd7bmf",
"title": "March",
"year": "2011",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxD9gXC",
"doi": "10.1109/TVCG.2010.80",
"abstract": "Driven by the ability to generate ever-larger, increasingly complex data, there is an urgent need in the scientific community for scalable analysis methods that can rapidly identify salient trends in scientific data. Query-Driven Visualization (QDV) strategies are among the small subset of techniques that can address both large and highly complex data sets. This paper extends the utility of QDV strategies with a statistics-based framework that integrates nonparametric distribution estimation techniques with a new segmentation strategy to visually identify statistically significant trends and features within the solution space of a query. In this framework, query distribution estimates help users to interactively explore their query's solution and visually identify the regions where the combined behavior of constrained variables is most important, statistically, to their inquiry. Our new segmentation strategy extends the distribution estimation analysis by visually conveying the individual importance of each variable to these regions of high statistical significance. We demonstrate the analysis benefits these two strategies provide and show how they maybe used to facilitate the refinement of constraints over variables expressed in a user's query. We apply our method to data sets from two different scientific domains to demonstrate its broad applicability.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Driven by the ability to generate ever-larger, increasingly complex data, there is an urgent need in the scientific community for scalable analysis methods that can rapidly identify salient trends in scientific data. Query-Driven Visualization (QDV) strategies are among the small subset of techniques that can address both large and highly complex data sets. This paper extends the utility of QDV strategies with a statistics-based framework that integrates nonparametric distribution estimation techniques with a new segmentation strategy to visually identify statistically significant trends and features within the solution space of a query. In this framework, query distribution estimates help users to interactively explore their query's solution and visually identify the regions where the combined behavior of constrained variables is most important, statistically, to their inquiry. Our new segmentation strategy extends the distribution estimation analysis by visually conveying the individual importance of each variable to these regions of high statistical significance. We demonstrate the analysis benefits these two strategies provide and show how they maybe used to facilitate the refinement of constraints over variables expressed in a user's query. We apply our method to data sets from two different scientific domains to demonstrate its broad applicability.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Driven by the ability to generate ever-larger, increasingly complex data, there is an urgent need in the scientific community for scalable analysis methods that can rapidly identify salient trends in scientific data. Query-Driven Visualization (QDV) strategies are among the small subset of techniques that can address both large and highly complex data sets. This paper extends the utility of QDV strategies with a statistics-based framework that integrates nonparametric distribution estimation techniques with a new segmentation strategy to visually identify statistically significant trends and features within the solution space of a query. In this framework, query distribution estimates help users to interactively explore their query's solution and visually identify the regions where the combined behavior of constrained variables is most important, statistically, to their inquiry. Our new segmentation strategy extends the distribution estimation analysis by visually conveying the individual importance of each variable to these regions of high statistical significance. We demonstrate the analysis benefits these two strategies provide and show how they maybe used to facilitate the refinement of constraints over variables expressed in a user's query. We apply our method to data sets from two different scientific domains to demonstrate its broad applicability.",
"title": "An Application of Multivariate Statistical Analysis for Query-Driven Visualization",
"normalizedTitle": "An Application of Multivariate Statistical Analysis for Query-Driven Visualization",
"fno": "ttg2011030264",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Query Driven Visualization",
"Multivariate Analysis",
"Kernel Density Estimation"
],
"authors": [
{
"givenName": "Luke J.",
"surname": "Gosink",
"fullName": "Luke J. Gosink",
"affiliation": "Pacific Northwest National Laboratory, Battelle Memorial Institute, Richland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christoph",
"surname": "Garth",
"fullName": "Christoph Garth",
"affiliation": "University of California, Davis, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John C.",
"surname": "Anderson",
"fullName": "John C. Anderson",
"affiliation": "University of California, Davis, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "E. Wes",
"surname": "Bethel",
"fullName": "E. Wes Bethel",
"affiliation": "Lawrence Berkeley National Laboratory, Berkeley",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kenneth I.",
"surname": "Joy",
"fullName": "Kenneth I. Joy",
"affiliation": "University of California, Davis, Davis",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2011-03-01 00:00:00",
"pubType": "trans",
"pages": "264-275",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2005/2766/0/27660022",
"title": "Query-Driven Visualization of Large Data Sets",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660022/12OmNvAAtDg",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2001/1342/0/13420105",
"title": "Interactive Visualization of Multiple Query Results",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2001/13420105/12OmNviZlsl",
"parentPublication": {
"id": "proceedings/ieee-infovis/2001/1342/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2008/3268/0/3268a191",
"title": "RDF Query Generator",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2008/3268a191/12OmNwGZNEq",
"parentPublication": {
"id": "proceedings/iv/2008/3268/0",
"title": "2008 12th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lcn/2006/0418/0/04116634",
"title": "Service-Driven Query Routing in Sensor Networks",
"doi": null,
"abstractUrl": "/proceedings-article/lcn/2006/04116634/12OmNxy4MZf",
"parentPublication": {
"id": "proceedings/lcn/2006/0418/0",
"title": "Proceedings. 2006 31st IEEE Conference on Local Computer Networks",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2015/8517/0/07348071",
"title": "A compact multivariate histogram representation for query-driven visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2015/07348071/12OmNzBOhRs",
"parentPublication": {
"id": "proceedings/ldav/2015/8517/0",
"title": "2015 IEEE 5th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2006/0591/0/04035755",
"title": "Accelerating Network Traffic Analytics Using Query-Driven Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2006/04035755/12OmNzn38Ji",
"parentPublication": {
"id": "proceedings/vast/2006/0591/0",
"title": "2006 IEEE Symposium On Visual Analytics Science And Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1400",
"title": "Variable Interactions in Query-Driven Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1400/13rRUwInvsD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122518",
"title": "Composite Density Maps for Multivariate Trajectories",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122518/13rRUwjXZSb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061715",
"title": "Query-Driven Visualization of Time-Varying Adaptive Mesh Refinement Data",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061715/13rRUyYSWkV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/04376167",
"title": "Variable Interactions in Query-Driven Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/04376167/13rRUyogGA5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011030263",
"articleId": "13rRUwIF6dK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011030261",
"articleId": "13rRUILLkvk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwJPMX5",
"title": "Dec.",
"year": "2011",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxD9h54",
"doi": "10.1109/TVCG.2011.201",
"abstract": "Multivariate data visualization is a classic topic, for which many solutions have been proposed, each with its own strengths and weaknesses. In standard solutions the structure of the visualization is fixed, we explore how to give the user more freedom to define visualizations. Our new approach is based on the usage of Flexible Linked Axes: The user is enabled to define a visualization by drawing and linking axes on a canvas. Each axis has an associated attribute and range, which can be adapted. Links between pairs of axes are used to show data in either scatter plot- or Parallel Coordinates Plot-style. Flexible Linked Axes enable users to define a wide variety of different visualizations. These include standard methods, such as scatter plot matrices, radar charts, and PCPs [11]; less well known approaches, such as Hyperboxes [1], TimeWheels [17], and many-to-many relational parallel coordinate displays [14]; and also custom visualizations, consisting of combinations of scatter plots and PCPs. Furthermore, our method allows users to define composite visualizations that automatically support brushing and linking. We have discussed our approach with ten prospective users, who found the concept easy to understand and highly promising.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Multivariate data visualization is a classic topic, for which many solutions have been proposed, each with its own strengths and weaknesses. In standard solutions the structure of the visualization is fixed, we explore how to give the user more freedom to define visualizations. Our new approach is based on the usage of Flexible Linked Axes: The user is enabled to define a visualization by drawing and linking axes on a canvas. Each axis has an associated attribute and range, which can be adapted. Links between pairs of axes are used to show data in either scatter plot- or Parallel Coordinates Plot-style. Flexible Linked Axes enable users to define a wide variety of different visualizations. These include standard methods, such as scatter plot matrices, radar charts, and PCPs [11]; less well known approaches, such as Hyperboxes [1], TimeWheels [17], and many-to-many relational parallel coordinate displays [14]; and also custom visualizations, consisting of combinations of scatter plots and PCPs. Furthermore, our method allows users to define composite visualizations that automatically support brushing and linking. We have discussed our approach with ten prospective users, who found the concept easy to understand and highly promising.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Multivariate data visualization is a classic topic, for which many solutions have been proposed, each with its own strengths and weaknesses. In standard solutions the structure of the visualization is fixed, we explore how to give the user more freedom to define visualizations. Our new approach is based on the usage of Flexible Linked Axes: The user is enabled to define a visualization by drawing and linking axes on a canvas. Each axis has an associated attribute and range, which can be adapted. Links between pairs of axes are used to show data in either scatter plot- or Parallel Coordinates Plot-style. Flexible Linked Axes enable users to define a wide variety of different visualizations. These include standard methods, such as scatter plot matrices, radar charts, and PCPs [11]; less well known approaches, such as Hyperboxes [1], TimeWheels [17], and many-to-many relational parallel coordinate displays [14]; and also custom visualizations, consisting of combinations of scatter plots and PCPs. Furthermore, our method allows users to define composite visualizations that automatically support brushing and linking. We have discussed our approach with ten prospective users, who found the concept easy to understand and highly promising.",
"title": "Flexible Linked Axes for Multivariate Data Visualization",
"normalizedTitle": "Flexible Linked Axes for Multivariate Data Visualization",
"fno": "ttg2011122310",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Multivariate Data",
"Visualization",
"Scatter Plot",
"Parallel Coordinates Plot"
],
"authors": [
{
"givenName": "Jarry H.T.",
"surname": "Claessen",
"fullName": "Jarry H.T. Claessen",
"affiliation": "Eindhoven University of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jarke J.",
"surname": "van Wijk",
"fullName": "Jarke J. van Wijk",
"affiliation": "Eindhoven University of Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2011-12-01 00:00:00",
"pubType": "trans",
"pages": "2310-2316",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/1996/3673/0/36730133",
"title": "Flexible Information Visualization of Multivariate Data from Biological Sequence Similarity Searches",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1996/36730133/12OmNAXxX6r",
"parentPublication": {
"id": "proceedings/ieee-vis/1996/3673/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2009/3733/0/3733a227",
"title": "Service-Oriented Information Visualization for Smart Environments",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2009/3733a227/12OmNApu5Db",
"parentPublication": {
"id": "proceedings/iv/2009/3733/0",
"title": "2009 13th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2002/1751/0/17510117",
"title": "Interactive Information Visualization of a Million Items",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2002/17510117/12OmNBTs7tv",
"parentPublication": {
"id": "proceedings/ieee-infovis/2002/1751/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icst/2012/4670/0/4670a737",
"title": "Enhancing Fault Localization via Multivariate Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/icst/2012/4670a737/12OmNxd4to6",
"parentPublication": {
"id": "proceedings/icst/2012/4670/0",
"title": "2012 IEEE Fifth International Conference on Software Testing, Verification and Validation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2007/2900/0/29000545",
"title": "2D and 3D Neural-Network Based Visualization of High-Dimensional Biomedical Data",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2007/29000545/12OmNzBOhvN",
"parentPublication": {
"id": "proceedings/iv/2007/2900/0",
"title": "2007 11th International Conference Information Visualization (IV '07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2012/4893/0/4893a076",
"title": "High-Performance Visualization of Multi-Dimensional Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2012/4893a076/12OmNzl3WZm",
"parentPublication": {
"id": "proceedings/icnc/2012/4893/0",
"title": "2012 Third International Conference on Networking and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061053",
"title": "Visualization of Diversity in Large Multivariate Data Sets",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061053/13rRUwd9CG0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2008/04/mcs2008040020",
"title": "An Integrated Exploration Approach to Visualizing Multivariate Particle Data",
"doi": null,
"abstractUrl": "/magazine/cs/2008/04/mcs2008040020/13rRUwjXZNE",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__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": "proceedings/icmcce/2020/2314/0/231400b998",
"title": "A New Visualization for Many-Objective Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/icmcce/2020/231400b998/1tzze2WAC0E",
"parentPublication": {
"id": "proceedings/icmcce/2020/2314/0",
"title": "2020 5th International Conference on Mechanical, Control and Computer Engineering (ICMCCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011122301",
"articleId": "13rRUwvT9gr",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011122317",
"articleId": "13rRUxjQyvf",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRGf",
"name": "ttg2011122310s1.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2011122310s1.mov",
"extension": "mov",
"size": "19.9 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzFdtc6",
"title": "November/December",
"year": "2010",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "16",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxYrbUA",
"doi": "10.1109/TVCG.2010.132",
"abstract": "In this paper, we examine whether or not information theory can be one of the theoretic frameworks for visualization. We formulate concepts and measurements for qualifying visual information. We illustrate these concepts with examples that manifest the intrinsic and implicit use of information theory in many existing visualization techniques. We outline the broad correlation between visualization and the major applications of information theory, while pointing out the difference in emphasis and some technical gaps. Our study provides compelling evidence that information theory can explain a significant number of phenomena or events in visualization, while no example has been found which is fundamentally in conflict with information theory. We also notice that the emphasis of some traditional applications of information theory, such as data compression or data communication, may not always suit visualization, as the former typically focuses on the efficient throughput of a communication channel, whilst the latter focuses on the effectiveness in aiding the perceptual and cognitive process for data understanding and knowledge discovery. These findings suggest that further theoretic developments are necessary for adopting and adapting information theory for visualization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we examine whether or not information theory can be one of the theoretic frameworks for visualization. We formulate concepts and measurements for qualifying visual information. We illustrate these concepts with examples that manifest the intrinsic and implicit use of information theory in many existing visualization techniques. We outline the broad correlation between visualization and the major applications of information theory, while pointing out the difference in emphasis and some technical gaps. Our study provides compelling evidence that information theory can explain a significant number of phenomena or events in visualization, while no example has been found which is fundamentally in conflict with information theory. We also notice that the emphasis of some traditional applications of information theory, such as data compression or data communication, may not always suit visualization, as the former typically focuses on the efficient throughput of a communication channel, whilst the latter focuses on the effectiveness in aiding the perceptual and cognitive process for data understanding and knowledge discovery. These findings suggest that further theoretic developments are necessary for adopting and adapting information theory for visualization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we examine whether or not information theory can be one of the theoretic frameworks for visualization. We formulate concepts and measurements for qualifying visual information. We illustrate these concepts with examples that manifest the intrinsic and implicit use of information theory in many existing visualization techniques. We outline the broad correlation between visualization and the major applications of information theory, while pointing out the difference in emphasis and some technical gaps. Our study provides compelling evidence that information theory can explain a significant number of phenomena or events in visualization, while no example has been found which is fundamentally in conflict with information theory. We also notice that the emphasis of some traditional applications of information theory, such as data compression or data communication, may not always suit visualization, as the former typically focuses on the efficient throughput of a communication channel, whilst the latter focuses on the effectiveness in aiding the perceptual and cognitive process for data understanding and knowledge discovery. These findings suggest that further theoretic developments are necessary for adopting and adapting information theory for visualization.",
"title": "An Information-theoretic Framework for Visualization",
"normalizedTitle": "An Information-theoretic Framework for Visualization",
"fno": "ttg2010061206",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Information Theory",
"Theory Of Visualization",
"Quantitative Evaluation"
],
"authors": [
{
"givenName": "Min",
"surname": "Chen",
"fullName": "Min Chen",
"affiliation": "Swansea University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Heike",
"surname": "Jaenicke",
"fullName": "Heike Jaenicke",
"affiliation": "Ruprecht-Karls-University Heidelberg",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2010-11-01 00:00:00",
"pubType": "trans",
"pages": "1206-1215",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-infovis/2004/8779/0/87790143",
"title": "BEST PAPER: A Knowledge Task-Based Framework for Design and Evaluation of Information Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2004/87790143/12OmNBhpScc",
"parentPublication": {
"id": "proceedings/ieee-infovis/2004/8779/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109a025",
"title": "2D Shape Recognition Using Information Theoretic Kernels",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109a025/12OmNqJHFAa",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2010/7846/0/05571316",
"title": "Evaluating Climate Visualization: An Information Visualization Approach",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2010/05571316/12OmNwbukeD",
"parentPublication": {
"id": "proceedings/iv/2010/7846/0",
"title": "2010 14th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2003/1988/0/01217947",
"title": "Proceedings Seventh International Conference on Information Visualization - IV 2003 - International Conference on Computer Visualization and Graphics Applications",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2003/01217947/12OmNzBOhZy",
"parentPublication": {
"id": "proceedings/iv/2003/1988/0",
"title": "Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ems/2009/3886/0/3886a552",
"title": "A Game Theoretic Approach for Quantitative Evaluation of Strategic Interactions between Hacker's Motivations",
"doi": null,
"abstractUrl": "/proceedings-article/ems/2009/3886a552/12OmNzRqdJ1",
"parentPublication": {
"id": "proceedings/ems/2009/3886/0",
"title": "Computer Modeling and Simulation, UKSIM European Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2008/01/mcg2008010018",
"title": "An Information-Theoretic View of Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2008/01/mcg2008010018/13rRUB6SpRW",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2002/02/i0158",
"title": "Information Theoretic Clustering",
"doi": null,
"abstractUrl": "/journal/tp/2002/02/i0158/13rRUx0xPjb",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2011/02/mcg2011020080",
"title": "Generative Storytelling for Information Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2011/02/mcg2011020080/13rRUxBa5pd",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061216",
"title": "An Information-Theoretic Framework for Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061216/13rRUxDIthc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440821",
"title": "An Information-Theoretic Approach to the Cost-benefit Analysis of Visualization in Virtual Environments",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440821/17D45WB0qbn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010061198",
"articleId": "13rRUxcsYLL",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010061216",
"articleId": "13rRUxDIthc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwoxSiF",
"title": "December",
"year": "1996",
"issueNum": "06",
"idPrefix": "tk",
"pubType": "journal",
"volume": "8",
"label": "December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyYjK5s",
"doi": "10.1109/69.553159",
"abstract": "Abstract—Visual data mining techniques have proven to be of high value in exploratory data analysis, and they also have a high potential for mining large databases. In this article, we describe and evaluate a new visualization-based approach to mining large databases. The basic idea of our visual data mining techniques is to represent as many data items as possible on the screen at the same time by mapping each data value to a pixel of the screen and arranging the pixels adequately. The major goal of this article is to evaluate our visual data mining techniques and to compare them to other well-known visualization techniques for multidimensional data: the parallel coordinate and stick figure visualization techniques. For the evaluation of visual data mining techniques, in the first place the perception of properties of the data counts, and only in the second place the CPU time and the number of secondary storage accesses are important. In addition to testing the visualization techniques using real data, we developed a testing environment for database visualizations similar to the benchmark approach used for comparing the performance of database systems. The testing environment allows the generation of test data sets with predefined data characteristics which are important for comparing the perceptual abilities of visual data mining techniques.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Visual data mining techniques have proven to be of high value in exploratory data analysis, and they also have a high potential for mining large databases. In this article, we describe and evaluate a new visualization-based approach to mining large databases. The basic idea of our visual data mining techniques is to represent as many data items as possible on the screen at the same time by mapping each data value to a pixel of the screen and arranging the pixels adequately. The major goal of this article is to evaluate our visual data mining techniques and to compare them to other well-known visualization techniques for multidimensional data: the parallel coordinate and stick figure visualization techniques. For the evaluation of visual data mining techniques, in the first place the perception of properties of the data counts, and only in the second place the CPU time and the number of secondary storage accesses are important. In addition to testing the visualization techniques using real data, we developed a testing environment for database visualizations similar to the benchmark approach used for comparing the performance of database systems. The testing environment allows the generation of test data sets with predefined data characteristics which are important for comparing the perceptual abilities of visual data mining techniques.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Visual data mining techniques have proven to be of high value in exploratory data analysis, and they also have a high potential for mining large databases. In this article, we describe and evaluate a new visualization-based approach to mining large databases. The basic idea of our visual data mining techniques is to represent as many data items as possible on the screen at the same time by mapping each data value to a pixel of the screen and arranging the pixels adequately. The major goal of this article is to evaluate our visual data mining techniques and to compare them to other well-known visualization techniques for multidimensional data: the parallel coordinate and stick figure visualization techniques. For the evaluation of visual data mining techniques, in the first place the perception of properties of the data counts, and only in the second place the CPU time and the number of secondary storage accesses are important. In addition to testing the visualization techniques using real data, we developed a testing environment for database visualizations similar to the benchmark approach used for comparing the performance of database systems. The testing environment allows the generation of test data sets with predefined data characteristics which are important for comparing the perceptual abilities of visual data mining techniques.",
"title": "Visualization Techniques for Mining Large Databases: A Comparison",
"normalizedTitle": "Visualization Techniques for Mining Large Databases: A Comparison",
"fno": "k0923",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Data Mining",
"Explorative Data Analysis",
"Visualizing Large Databases",
"Visualizing Multidimensional",
"Multivariate Data"
],
"authors": [
{
"givenName": "Daniel A.",
"surname": "Keim",
"fullName": "Daniel A. Keim",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hans-Peter",
"surname": "Kriegel",
"fullName": "Hans-Peter Kriegel",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "1996-11-01 00:00:00",
"pubType": "trans",
"pages": "923-938",
"year": "1996",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "k0911",
"articleId": "13rRUEgarjE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "k0939",
"articleId": "13rRUxlgxTC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAle6Qx",
"title": "November/December",
"year": "2007",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvyatc",
"doi": "10.1109/TVCG.2007.70623",
"abstract": "In many applications, it is important to understand the individual values of, and relationships between, multiple related scalar variables defined across a common domain. Several approaches have been proposed for representing data in these situations. In this paper we focus on strategies for the visualization of multivariate data that rely on color mixing. In particular, through a series of controlled observer experiments, we seek to establish a fundamental understanding of the information-carrying capacities of two alternative methods for encoding multivariate information using color: color blending and color weaving. We begin with a baseline experiment in which we assess participants' abilities to accurately read numerical data encoded in six different basic color scales defined in the L*a*b* color space. We then assess participants' abilities to read combinations of 2, 3, 4 and 6 different data values represented in a common region of the domain, encoded using either color blending or color weaving. In color blending a single mixed color is formed via linear combination of the individual values in L*a*b* space, and in color weaving the original individual colors are displayed side-by-side in a high frequency texture that fills the region. A third experiment was conducted to clarify some of the trends regarding the color contrast and its effect on the magnitude of the error that was observed in the second experiment. The results indicate that when the component colors are represented side-by-side in a high frequency texture, most participants' abilities to infer the values of individual components are significantly improved, relative to when the colors are blended. Participants' performance was significantly better with color weaving particularly when more than 2 colors were used, and even when the individual colors subtended only 3 minutes of visual angle in the texture. However, the information-carrying capacity of the color weaving approach has its limits. We f",
"abstracts": [
{
"abstractType": "Regular",
"content": "In many applications, it is important to understand the individual values of, and relationships between, multiple related scalar variables defined across a common domain. Several approaches have been proposed for representing data in these situations. In this paper we focus on strategies for the visualization of multivariate data that rely on color mixing. In particular, through a series of controlled observer experiments, we seek to establish a fundamental understanding of the information-carrying capacities of two alternative methods for encoding multivariate information using color: color blending and color weaving. We begin with a baseline experiment in which we assess participants' abilities to accurately read numerical data encoded in six different basic color scales defined in the L*a*b* color space. We then assess participants' abilities to read combinations of 2, 3, 4 and 6 different data values represented in a common region of the domain, encoded using either color blending or color weaving. In color blending a single mixed color is formed via linear combination of the individual values in L*a*b* space, and in color weaving the original individual colors are displayed side-by-side in a high frequency texture that fills the region. A third experiment was conducted to clarify some of the trends regarding the color contrast and its effect on the magnitude of the error that was observed in the second experiment. The results indicate that when the component colors are represented side-by-side in a high frequency texture, most participants' abilities to infer the values of individual components are significantly improved, relative to when the colors are blended. Participants' performance was significantly better with color weaving particularly when more than 2 colors were used, and even when the individual colors subtended only 3 minutes of visual angle in the texture. However, the information-carrying capacity of the color weaving approach has its limits. We f",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In many applications, it is important to understand the individual values of, and relationships between, multiple related scalar variables defined across a common domain. Several approaches have been proposed for representing data in these situations. In this paper we focus on strategies for the visualization of multivariate data that rely on color mixing. In particular, through a series of controlled observer experiments, we seek to establish a fundamental understanding of the information-carrying capacities of two alternative methods for encoding multivariate information using color: color blending and color weaving. We begin with a baseline experiment in which we assess participants' abilities to accurately read numerical data encoded in six different basic color scales defined in the L*a*b* color space. We then assess participants' abilities to read combinations of 2, 3, 4 and 6 different data values represented in a common region of the domain, encoded using either color blending or color weaving. In color blending a single mixed color is formed via linear combination of the individual values in L*a*b* space, and in color weaving the original individual colors are displayed side-by-side in a high frequency texture that fills the region. A third experiment was conducted to clarify some of the trends regarding the color contrast and its effect on the magnitude of the error that was observed in the second experiment. The results indicate that when the component colors are represented side-by-side in a high frequency texture, most participants' abilities to infer the values of individual components are significantly improved, relative to when the colors are blended. Participants' performance was significantly better with color weaving particularly when more than 2 colors were used, and even when the individual colors subtended only 3 minutes of visual angle in the texture. However, the information-carrying capacity of the color weaving approach has its limits. We f",
"title": "Weaving Versus Blending: a quantitative assessment of the information carrying capacities of two alternative methods for conveying multivariate data with color.",
"normalizedTitle": "Weaving Versus Blending: a quantitative assessment of the information carrying capacities of two alternative methods for conveying multivariate data with color.",
"fno": "v1270",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Image Colour Analysis",
"Image Texture",
"Color Weaving",
"Color Blending",
"Encoding",
"Color Mixing",
"Multivariate Data Visualization",
"Information Carrying Capacity",
"Quantitative Assessment",
"Weaving",
"Data Visualization",
"Frequency",
"Color",
"Encoding",
"Meteorology",
"Geology",
"Astronomy",
"Displays",
"Color",
"Perception",
"Visualization",
"Color Weaving",
"Color Blending"
],
"authors": [
{
"givenName": "Haleh",
"surname": "Hagh-Shenas",
"fullName": "Haleh Hagh-Shenas",
"affiliation": "Boston Scientific",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sunghee",
"surname": "Kim",
"fullName": "Sunghee Kim",
"affiliation": "Gettysburg College",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Victoria",
"surname": "Interrante",
"fullName": "Victoria Interrante",
"affiliation": "University of Minnesota",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christopher",
"surname": "Healey",
"fullName": "Christopher Healey",
"affiliation": "North Carolina State University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2007-11-01 00:00:00",
"pubType": "trans",
"pages": "1270-1277",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2013/4795/0/06549410",
"title": "Color blending in outdoor optical see-through AR: The effect of real-world backgrounds on user interface color",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2013/06549410/12OmNBTJIzB",
"parentPublication": {
"id": "proceedings/vr/2013/4795/0",
"title": "2013 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2004/2234/0/22340329",
"title": "Colored Pencil Filter with Custom Colors",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2004/22340329/12OmNqIzh7r",
"parentPublication": {
"id": "proceedings/pg/2004/2234/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aipr/2010/8833/0/05759697",
"title": "Laplacian based image fusion",
"doi": null,
"abstractUrl": "/proceedings-article/aipr/2010/05759697/12OmNyNQSFt",
"parentPublication": {
"id": "proceedings/aipr/2010/8833/0",
"title": "2010 IEEE 39th Applied Imagery Pattern Recognition Workshop (AIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssiri/2009/3758/0/3758a093",
"title": "Anchored Text for Software Weaving and Merging",
"doi": null,
"abstractUrl": "/proceedings-article/ssiri/2009/3758a093/12OmNzZWbBK",
"parentPublication": {
"id": "proceedings/ssiri/2009/3758/0",
"title": "Secure System Integration and Reliability Improvement",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2010/6237/0/05444808",
"title": "More than meets the eye: An engineering study to empirically examine the blending of real and virtual color spaces",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2010/05444808/12OmNzlD9ih",
"parentPublication": {
"id": "proceedings/vr/2010/6237/0",
"title": "2010 IEEE Virtual Reality Conference (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122122",
"title": "A Data-Driven Approach to Hue-Preserving Color-Blending",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122122/13rRUwd9CLL",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2014/04/mcg2014040022",
"title": "Weavy: Interactive Card-Weaving Design and Construction",
"doi": null,
"abstractUrl": "/magazine/cg/2014/04/mcg2014040022/13rRUxAASN1",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2012/02/06031782",
"title": "Bit weaving: a non-prefix approach to compressing packet classifiers in TCAMs",
"doi": null,
"abstractUrl": "/journal/nt/2012/02/06031782/13rRUxASuJC",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061275",
"title": "Hue-Preserving Color Blending",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061275/13rRUyY28Yp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/08/09293392",
"title": "A Perceptual Color-Matching Method for Examining Color Blending in Augmented Reality Head-Up Display Graphics",
"doi": null,
"abstractUrl": "/journal/tg/2022/08/09293392/1pyomiXbJQs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1262",
"articleId": "13rRUx0gezO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1278",
"articleId": "13rRUyp7tWP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxRWI3R",
"title": "September/October",
"year": "2004",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "10",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxly95s",
"doi": "10.1109/TVCG.2004.19",
"abstract": "In this paper, we present Confetti, a novel point-based rendering approach based on object-space point interpolation of densely sampled surfaces. We introduce the concept of a transformation-invariant covariance matrix of a set of points which can efficiently be used to determine splat sizes in a multiresolution point hierarchy. We also analyze continuous point interpolation in object-space and we define a new class of parameterized blending kernels as well as a normalization procedure to achieve smooth blending. Furthermore, we present a hardware accelerated rendering algorithm based on texture mapping and \\alpha{\\hbox{-}}{\\rm blending} as well as programmable vertex and pixel-shaders.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present Confetti, a novel point-based rendering approach based on object-space point interpolation of densely sampled surfaces. We introduce the concept of a transformation-invariant covariance matrix of a set of points which can efficiently be used to determine splat sizes in a multiresolution point hierarchy. We also analyze continuous point interpolation in object-space and we define a new class of parameterized blending kernels as well as a normalization procedure to achieve smooth blending. Furthermore, we present a hardware accelerated rendering algorithm based on texture mapping and \\alpha{\\hbox{-}}{\\rm blending} as well as programmable vertex and pixel-shaders.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present Confetti, a novel point-based rendering approach based on object-space point interpolation of densely sampled surfaces. We introduce the concept of a transformation-invariant covariance matrix of a set of points which can efficiently be used to determine splat sizes in a multiresolution point hierarchy. We also analyze continuous point interpolation in object-space and we define a new class of parameterized blending kernels as well as a normalization procedure to achieve smooth blending. Furthermore, we present a hardware accelerated rendering algorithm based on texture mapping and \\alpha{\\hbox{-}}{\\rm blending} as well as programmable vertex and pixel-shaders.",
"title": "Confetti: Object-Space Point Blending and Splatting",
"normalizedTitle": "Confetti: Object-Space Point Blending and Splatting",
"fno": "v0598",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Point Based Rendering",
"Multiresolution Modeling",
"Level Of Detail",
"Hardware Accelerated Blending"
],
"authors": [
{
"givenName": "Renato",
"surname": "Pajarola",
"fullName": "Renato Pajarola",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Miguel",
"surname": "Sainz",
"fullName": "Miguel Sainz",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Patrick",
"surname": "Guidotti",
"fullName": "Patrick Guidotti",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2004-09-01 00:00:00",
"pubType": "trans",
"pages": "598-608",
"year": "2004",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccis/2012/4789/0/4789a530",
"title": "Data-Driven Based Interactive Motion Blending",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2012/4789a530/12OmNAY79d9",
"parentPublication": {
"id": "proceedings/iccis/2012/4789/0",
"title": "2012 Fourth International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pbg/2005/20/0/01500314",
"title": "Progressive splatting",
"doi": null,
"abstractUrl": "/proceedings-article/pbg/2005/01500314/12OmNqNos8r",
"parentPublication": {
"id": "proceedings/pbg/2005/20/0",
"title": "Point-Based Graphics 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1996/3673/0/36730165",
"title": "Contour Blending Using Warp-Guided Distance Field Interpolation",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1996/36730165/12OmNrJRPc3",
"parentPublication": {
"id": "proceedings/ieee-vis/1996/3673/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isise/2010/4360/0/4360a117",
"title": "A Multiresolution Viewpoint Based Rendering for Large-scale Point Models",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2010/4360a117/12OmNrMHOpQ",
"parentPublication": {
"id": "proceedings/isise/2010/4360/0",
"title": "2010 Third International Symposium on Information Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2009/3789/0/3789a228",
"title": "Blending Functions Generating a Cubic Curve that Closely Approximates a Polygon from Four Control Points",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2009/3789a228/12OmNxR5USB",
"parentPublication": {
"id": "proceedings/cgiv/2009/3789/0",
"title": "2009 Sixth International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/psivt/2010/4285/0/4285a462",
"title": "Artistic Emulation - Filter Blending for Painterly Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/psivt/2010/4285a462/12OmNyRg48N",
"parentPublication": {
"id": "proceedings/psivt/2010/4285/0",
"title": "Image and Video Technology, Pacific-Rim Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2002/1784/0/17840145",
"title": "Blending Multiple Views",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2002/17840145/12OmNzDehbe",
"parentPublication": {
"id": "proceedings/pg/2002/1784/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/05/ttg2010050729",
"title": "Interactive Indirect Illumination Using Adaptive Multiresolution Splatting",
"doi": null,
"abstractUrl": "/journal/tg/2010/05/ttg2010050729/13rRUxD9h53",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2002/03/v0223",
"title": "EWA Splatting",
"doi": null,
"abstractUrl": "/journal/tg/2002/03/v0223/13rRUxNEqPB",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061275",
"title": "Hue-Preserving Color Blending",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061275/13rRUyY28Yp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0587",
"articleId": "13rRUyYjKa3",
"__typename": "AdjacentArticleType"
},
"next": null,
"__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": "13rRUyY28Yp",
"doi": "10.1109/TVCG.2009.150",
"abstract": "We propose a new perception-guided compositing operator for color blending. The operator maintains the same rules for achromatic compositing as standard operators (such as the over operator), but it modifies the computation of the chromatic channels. Chromatic compositing aims at preserving the hue of the input colors; color continuity is achieved by reducing the saturation of colors that are to change their hue value. The main benefit of hue preservation is that color can be used for proper visual labeling, even under the constraint of transparency rendering or image overlays. Therefore, the visualization of nominal data is improved. Hue-preserving blending can be used in any existing compositing algorithm, and it is particularly useful for volume rendering. The usefulness of hue-preserving blending and its visual characteristics are shown for several examples of volume visualization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose a new perception-guided compositing operator for color blending. The operator maintains the same rules for achromatic compositing as standard operators (such as the over operator), but it modifies the computation of the chromatic channels. Chromatic compositing aims at preserving the hue of the input colors; color continuity is achieved by reducing the saturation of colors that are to change their hue value. The main benefit of hue preservation is that color can be used for proper visual labeling, even under the constraint of transparency rendering or image overlays. Therefore, the visualization of nominal data is improved. Hue-preserving blending can be used in any existing compositing algorithm, and it is particularly useful for volume rendering. The usefulness of hue-preserving blending and its visual characteristics are shown for several examples of volume visualization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose a new perception-guided compositing operator for color blending. The operator maintains the same rules for achromatic compositing as standard operators (such as the over operator), but it modifies the computation of the chromatic channels. Chromatic compositing aims at preserving the hue of the input colors; color continuity is achieved by reducing the saturation of colors that are to change their hue value. The main benefit of hue preservation is that color can be used for proper visual labeling, even under the constraint of transparency rendering or image overlays. Therefore, the visualization of nominal data is improved. Hue-preserving blending can be used in any existing compositing algorithm, and it is particularly useful for volume rendering. The usefulness of hue-preserving blending and its visual characteristics are shown for several examples of volume visualization.",
"title": "Hue-Preserving Color Blending",
"normalizedTitle": "Hue-Preserving Color Blending",
"fno": "ttg2009061275",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Image Compositing",
"Perceptual Transparency",
"Color Blending",
"Volume Rendering",
"Illustrative Visualization"
],
"authors": [
{
"givenName": "Johnson",
"surname": "Chuang",
"fullName": "Johnson Chuang",
"affiliation": "Simon Fraser University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Weiskopf",
"fullName": "Daniel Weiskopf",
"affiliation": "Universität Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Torsten",
"surname": "Möller",
"fullName": "Torsten Möller",
"affiliation": "Simon Fraser University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2009-11-01 00:00:00",
"pubType": "trans",
"pages": "1275-1282",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2003/1900/2/190020713",
"title": "Hue fields and Color Curvatures: A Perceptual Organization Approach to Color Image Denoising",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2003/190020713/12OmNvAAtrP",
"parentPublication": {
"id": "proceedings/cvpr/2003/1900/2",
"title": "2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2008/2570/0/04607575",
"title": "Color texture retrieval using wavelet decomposition on the Hue/Saturation plane",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2008/04607575/12OmNvStcM6",
"parentPublication": {
"id": "proceedings/icme/2008/2570/0",
"title": "2008 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ic3/2016/3251/0/07880244",
"title": "Hue preserving color image enhancement using guided filter based sub image histogram equalization",
"doi": null,
"abstractUrl": "/proceedings-article/ic3/2016/07880244/12OmNyugyM2",
"parentPublication": {
"id": "proceedings/ic3/2016/3251/0",
"title": "2016 Ninth International Conference on Contemporary Computing (IC3)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1997/8262/0/82620183",
"title": "Two-phase perspective ray casting for interactive volume navigation",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1997/82620183/12OmNzb7Zhn",
"parentPublication": {
"id": "proceedings/ieee-vis/1997/8262/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2010/6237/0/05444808",
"title": "More than meets the eye: An engineering study to empirically examine the blending of real and virtual color spaces",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2010/05444808/12OmNzlD9ih",
"parentPublication": {
"id": "proceedings/vr/2010/6237/0",
"title": "2010 IEEE Virtual Reality Conference (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122122",
"title": "A Data-Driven Approach to Hue-Preserving Color-Blending",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122122/13rRUwd9CLL",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009061267",
"articleId": "13rRUxBa5bM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2009061283",
"articleId": "13rRUwIF69f",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesUf",
"name": "ttg2009061275s.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2009061275s.zip",
"extension": "zip",
"size": "13.9 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1ECXHMu0OWc",
"title": "Aug.",
"year": "2022",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1pyomiXbJQs",
"doi": "10.1109/TVCG.2020.3044715",
"abstract": "Augmented reality (AR) offers new ways to visualize information on-the-go. As noted in related work, AR graphics presented via optical see-through AR displays are particularly prone to color blending, whereby intended graphic colors may be perceptually altered by real-world backgrounds, ultimately degrading usability. This work adds to this body of knowledge by presenting a methodology for assessing AR interface color <italic>robustness</italic>, as quantitatively measured via shifts in the CIE color space, and qualitatively assessed in terms of users’ perceived color name. We conducted a human factors study where twelve participants examined eight AR colors atop three real-world backgrounds as viewed through an in-vehicle AR head-up display (HUD); a type of optical see-through display used to project driving-related information atop the forward-looking road scene. Participants completed visual search tasks, matched the perceived AR HUD color against the WCS color palette, and verbally named the perceived color. We present analysis that suggests blue, green, and yellow AR colors are relatively robust, while red and brown are not, and discuss the impact of chromaticity shift and dispersion on outdoor AR interface design. While this work presents a case study in transportation, the methodology is applicable to a wide range of AR displays in many application domains and settings.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Augmented reality (AR) offers new ways to visualize information on-the-go. As noted in related work, AR graphics presented via optical see-through AR displays are particularly prone to color blending, whereby intended graphic colors may be perceptually altered by real-world backgrounds, ultimately degrading usability. This work adds to this body of knowledge by presenting a methodology for assessing AR interface color <italic>robustness</italic>, as quantitatively measured via shifts in the CIE color space, and qualitatively assessed in terms of users’ perceived color name. We conducted a human factors study where twelve participants examined eight AR colors atop three real-world backgrounds as viewed through an in-vehicle AR head-up display (HUD); a type of optical see-through display used to project driving-related information atop the forward-looking road scene. Participants completed visual search tasks, matched the perceived AR HUD color against the WCS color palette, and verbally named the perceived color. We present analysis that suggests blue, green, and yellow AR colors are relatively robust, while red and brown are not, and discuss the impact of chromaticity shift and dispersion on outdoor AR interface design. While this work presents a case study in transportation, the methodology is applicable to a wide range of AR displays in many application domains and settings.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Augmented reality (AR) offers new ways to visualize information on-the-go. As noted in related work, AR graphics presented via optical see-through AR displays are particularly prone to color blending, whereby intended graphic colors may be perceptually altered by real-world backgrounds, ultimately degrading usability. This work adds to this body of knowledge by presenting a methodology for assessing AR interface color robustness, as quantitatively measured via shifts in the CIE color space, and qualitatively assessed in terms of users’ perceived color name. We conducted a human factors study where twelve participants examined eight AR colors atop three real-world backgrounds as viewed through an in-vehicle AR head-up display (HUD); a type of optical see-through display used to project driving-related information atop the forward-looking road scene. Participants completed visual search tasks, matched the perceived AR HUD color against the WCS color palette, and verbally named the perceived color. We present analysis that suggests blue, green, and yellow AR colors are relatively robust, while red and brown are not, and discuss the impact of chromaticity shift and dispersion on outdoor AR interface design. While this work presents a case study in transportation, the methodology is applicable to a wide range of AR displays in many application domains and settings.",
"title": "A Perceptual Color-Matching Method for Examining Color Blending in Augmented Reality Head-Up Display Graphics",
"normalizedTitle": "A Perceptual Color-Matching Method for Examining Color Blending in Augmented Reality Head-Up Display Graphics",
"fno": "09293392",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Augmented Reality",
"Computer Graphics",
"Head Up Displays",
"Human Factors",
"Image Colour Analysis",
"Transportation",
"User Interfaces",
"Real World Backgrounds",
"In Vehicle AR Head Up",
"HUD",
"Driving Related Information",
"Visual Search Tasks",
"WCS Color Palette",
"Perceived Color",
"Blue AR Colors",
"Green AR Colors",
"Yellow AR Colors",
"AR Displays",
"Perceptual Color Matching Method",
"Examining Color Blending",
"Augmented Reality Head Up",
"AR Graphics",
"Graphic Colors",
"AR Interface Color Robustness",
"CIE Color Space",
"Users",
"Human Factors Study",
"Image Color Analysis",
"Color",
"Optical Distortion",
"Graphics",
"Lighting",
"Visualization",
"Distortion",
"D 2 14 A User Interfaces",
"H 1 2 A Human Factors",
"H 5 1 B Artificial",
"Augmented",
"And Virtual Realities",
"I 4 8 A Color"
],
"authors": [
{
"givenName": "Joseph L.",
"surname": "Gabbard",
"fullName": "Joseph L. Gabbard",
"affiliation": "Grado Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, VA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Missie",
"surname": "Smith",
"fullName": "Missie Smith",
"affiliation": "Industrial and Systems Engineering Department, Oakland University, Rochester, MI, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Coleman",
"surname": "Merenda",
"fullName": "Coleman Merenda",
"affiliation": "Grado Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, VA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gary",
"surname": "Burnett",
"fullName": "Gary Burnett",
"affiliation": "Human Factors Research Group, University of Nottingham, Nottingham, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David R.",
"surname": "Large",
"fullName": "David R. Large",
"affiliation": "Human Factors Research Group, University of Nottingham, Nottingham, UK",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2022-08-01 00:00:00",
"pubType": "trans",
"pages": "2834-2851",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icseng/2017/0610/0/0610a151",
"title": "Background Scene Dominant Color Based Visibility Enhancement of Head-Up Display",
"doi": null,
"abstractUrl": "/proceedings-article/icseng/2017/0610a151/12OmNA1Vnwi",
"parentPublication": {
"id": "proceedings/icseng/2017/0610/0",
"title": "2017 25th International Conference on Systems Engineering (ICSEng)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2013/4795/0/06549410",
"title": "Color blending in outdoor optical see-through AR: The effect of real-world backgrounds on user interface color",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2013/06549410/12OmNBTJIzB",
"parentPublication": {
"id": "proceedings/vr/2013/4795/0",
"title": "2013 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percar/2016/0838/0/07562419",
"title": "Effects of real-world backgrounds on user interface color naming and matching in automotive AR HUDs",
"doi": null,
"abstractUrl": "/proceedings-article/percar/2016/07562419/12OmNxGja85",
"parentPublication": {
"id": "proceedings/percar/2016/0838/0",
"title": "2016 IEEE VR 2016 Workshop on Perceptual and Cognitive Issues in AR (PERCAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2010/9343/0/05643580",
"title": "Color harmonization for Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2010/05643580/12OmNzaQod1",
"parentPublication": {
"id": "proceedings/ismar/2010/9343/0",
"title": "2010 IEEE International Symposium on Mixed and Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2010/6237/0/05444808",
"title": "More than meets the eye: An engineering study to empirically examine the blending of real and virtual color spaces",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2010/05444808/12OmNzlD9ih",
"parentPublication": {
"id": "proceedings/vr/2010/6237/0",
"title": "2010 IEEE Virtual Reality Conference (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/11/07165643",
"title": "Semi-Parametric Color Reproduction Method for Optical See-Through Head-Mounted Displays",
"doi": null,
"abstractUrl": "/journal/tg/2015/11/07165643/13rRUILtJzB",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061275",
"title": "Hue-Preserving Color Blending",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061275/13rRUyY28Yp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2022/5365/0/536500a389",
"title": "Objective Measurements of Background Color Shifts Caused by Optical See-Through Head-Mounted Displays",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2022/536500a389/1J7WuL68jAY",
"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/vr/2019/1377/0/08798347",
"title": "Perceptual Appearance Control by Projection-Induced Illusion",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798347/1cJ0Lhi0BQk",
"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/2022/12/09463728",
"title": "Color Contrast Enhanced Rendering for Optical See-Through Head-Mounted Displays",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09463728/1uFxo1ImlpK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09282203",
"articleId": "1phNY7FbCmY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09286513",
"articleId": "1porhlu0eEo",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyq0zFB",
"title": "May",
"year": "2016",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "22",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwdIOUQ",
"doi": "10.1109/TVCG.2015.2440231",
"abstract": "Thanks to recent advances on motion capture devices and stereoscopic consumer displays, animated virtual characters can now realistically interact with users in a variety of applications. We investigate in this paper the effect of avatars, stereo vision and display size on task execution in immersive virtual environments. We report results obtained with three experiments in varied configurations that are commonly used in rehabilitation applications. The first experiment analyzes the accuracy of reaching tasks under different system configurations: with and without an avatar, with and without stereo vision, and employing a 2D desktop monitor versus a large multi-tile visualization display. The second experiment analyzes the use of avatars and user-perspective stereo vision on the ability to perceive and subsequently reproduce motions demonstrated by an autonomous virtual character. The third experiment evaluates the overall user experience with a complete immersive user interface for motion modeling by direct demonstration. Our experiments expose and quantify the benefits of using stereo vision and avatars, and show that the use of avatars improve the quality of produced motions and the resemblance of replicated msotions; however, direct interaction in user-perspective leads to tasks executed in less time and to targets more accurately reached. These and additional tradeoffs are important for the effective design of avatar-based training systems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Thanks to recent advances on motion capture devices and stereoscopic consumer displays, animated virtual characters can now realistically interact with users in a variety of applications. We investigate in this paper the effect of avatars, stereo vision and display size on task execution in immersive virtual environments. We report results obtained with three experiments in varied configurations that are commonly used in rehabilitation applications. The first experiment analyzes the accuracy of reaching tasks under different system configurations: with and without an avatar, with and without stereo vision, and employing a 2D desktop monitor versus a large multi-tile visualization display. The second experiment analyzes the use of avatars and user-perspective stereo vision on the ability to perceive and subsequently reproduce motions demonstrated by an autonomous virtual character. The third experiment evaluates the overall user experience with a complete immersive user interface for motion modeling by direct demonstration. Our experiments expose and quantify the benefits of using stereo vision and avatars, and show that the use of avatars improve the quality of produced motions and the resemblance of replicated msotions; however, direct interaction in user-perspective leads to tasks executed in less time and to targets more accurately reached. These and additional tradeoffs are important for the effective design of avatar-based training systems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Thanks to recent advances on motion capture devices and stereoscopic consumer displays, animated virtual characters can now realistically interact with users in a variety of applications. We investigate in this paper the effect of avatars, stereo vision and display size on task execution in immersive virtual environments. We report results obtained with three experiments in varied configurations that are commonly used in rehabilitation applications. The first experiment analyzes the accuracy of reaching tasks under different system configurations: with and without an avatar, with and without stereo vision, and employing a 2D desktop monitor versus a large multi-tile visualization display. The second experiment analyzes the use of avatars and user-perspective stereo vision on the ability to perceive and subsequently reproduce motions demonstrated by an autonomous virtual character. The third experiment evaluates the overall user experience with a complete immersive user interface for motion modeling by direct demonstration. Our experiments expose and quantify the benefits of using stereo vision and avatars, and show that the use of avatars improve the quality of produced motions and the resemblance of replicated msotions; however, direct interaction in user-perspective leads to tasks executed in less time and to targets more accurately reached. These and additional tradeoffs are important for the effective design of avatar-based training systems.",
"title": "The Effects of Avatars, Stereo Vision and Display Size on Reaching and Motion Reproduction",
"normalizedTitle": "The Effects of Avatars, Stereo Vision and Display Size on Reaching and Motion Reproduction",
"fno": "07118232",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Avatars",
"Stereo Vision",
"Training",
"Trajectory",
"Visualization",
"Tracking",
"Solid Modeling",
"Training Systems",
"Virtual Reality",
"3 D Interaction",
"Avatars",
"Motion Capture",
"Perception",
"Training Systems",
"Virtual Reality",
"3 D Interaction",
"Avatars",
"Motion Capture",
"Perception"
],
"authors": [
{
"givenName": "Carlo",
"surname": "Camporesi",
"fullName": "Carlo Camporesi",
"affiliation": ", School of Engineering, University of California, Merced, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marcelo",
"surname": "Kallmann",
"fullName": "Marcelo Kallmann",
"affiliation": ", School of Engineering, University of California, Merced, CA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2016-05-01 00:00:00",
"pubType": "trans",
"pages": "1592-1604",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/2016/5670/0/5670a051",
"title": "Introducing Avatarification: An Experimental Examination of How Avatars Influence Student Motivation",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/5670a051/12OmNvDqsPL",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2017/6647/0/07892240",
"title": "Rapid one-shot acquisition of dynamic VR avatars",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2017/07892240/12OmNwGZNLp",
"parentPublication": {
"id": "proceedings/vr/2017/6647/0",
"title": "2017 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446539",
"title": "Investigating the Effects of Anthropomorphic Fidelity of Self-Avatars on Near Field Depth Perception in Immersive Virtual Environments",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446539/13bd1h03qOe",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2022/9617/0/961700a843",
"title": "Redirecting Desktop Interface Input to Animate Cross-Reality Avatars",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2022/961700a843/1CJcxEyRQ64",
"parentPublication": {
"id": "proceedings/vr/2022/9617/0",
"title": "2022 IEEE on Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2022/5325/0/532500a666",
"title": "Investigating User Embodiment of Inverse-Kinematic Avatars in Smartphone Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2022/532500a666/1JrR5i5jDhe",
"parentPublication": {
"id": "proceedings/ismar/2022/5325/0",
"title": "2022 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798008",
"title": "[DC] Embodied Virtual Avatars and Potential Negative Effects on Implicit Racial Bias",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798008/1cJ0WBlYR7G",
"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/2019/1377/0/08798169",
"title": "Stand-alone, Wearable System for Full Body VR Avatars: Towards Physics-based 3D Interaction",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798169/1cJ126EVaVi",
"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/2019/1377/0/08798152",
"title": "The Influence of Size in Augmented Reality Telepresence Avatars",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798152/1cJ1djEUmv6",
"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/2022/12/09440766",
"title": "Did I Hit the Door? Effects of Self-Avatars and Calibration in a Person-Plus-Virtual-Object System on Perceived Frontal Passability in VR",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09440766/1tTpcuKN5jW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2021/4057/0/405700a715",
"title": "[DC] Privacy in VR: Empowering Users with Emotional Privacy from Verbal and Non-verbal Behavior of Their Avatars",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2021/405700a715/1tnXsX6EMBa",
"parentPublication": {
"id": "proceedings/vrw/2021/4057/0",
"title": "2021 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07127019",
"articleId": "13rRUxYIN4a",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07127051",
"articleId": "13rRUxOdD2I",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxGAKWq",
"title": "October-December",
"year": "2003",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "9",
"label": "October-December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuAn",
"doi": "10.1109/TVCG.2003.1260740",
"abstract": "Abstract—We present a new method for visualizing 3D volumetric diffusion tensor MR images. We distinguish between linear anisotropy and planar anisotropy and represent values in the two regimes using streamtubes and streamsurfaces, respectively. Streamtubes represent structures with primarily linear diffusion, typically fiber tracts; streamtube direction correlates with tract orientation. The cross-sectional shape and color of each streamtube represent additional information from the diffusion tensor at each point. Streamsurfaces represent structures in which diffusion is primarily planar. Our algorithm chooses a very small representative subset of the streamtubes and streamsurfaces for display. We describe the set of metrics used for the culling process, which reduces visual clutter and improves interactivity. We also generate anatomical landmarks to identify the locations of such structures as the eyes, skull surface, and ventricles. The final models are complex surface geometries that can be imported into many interactive graphics software environments. We describe a virtual environment to interact with these models. Expert feedback from doctors studying changes in white-matter structures after gamma-knife capsulotomy and preoperative planning for brain tumor surgery shows that streamtubes correlate well with major neural structures, the 2D section and geometric landmarks are important in understanding the visualization, and the stereo and interactivity from the virtual environment aid in understanding the complex geometric models.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—We present a new method for visualizing 3D volumetric diffusion tensor MR images. We distinguish between linear anisotropy and planar anisotropy and represent values in the two regimes using streamtubes and streamsurfaces, respectively. Streamtubes represent structures with primarily linear diffusion, typically fiber tracts; streamtube direction correlates with tract orientation. The cross-sectional shape and color of each streamtube represent additional information from the diffusion tensor at each point. Streamsurfaces represent structures in which diffusion is primarily planar. Our algorithm chooses a very small representative subset of the streamtubes and streamsurfaces for display. We describe the set of metrics used for the culling process, which reduces visual clutter and improves interactivity. We also generate anatomical landmarks to identify the locations of such structures as the eyes, skull surface, and ventricles. The final models are complex surface geometries that can be imported into many interactive graphics software environments. We describe a virtual environment to interact with these models. Expert feedback from doctors studying changes in white-matter structures after gamma-knife capsulotomy and preoperative planning for brain tumor surgery shows that streamtubes correlate well with major neural structures, the 2D section and geometric landmarks are important in understanding the visualization, and the stereo and interactivity from the virtual environment aid in understanding the complex geometric models.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—We present a new method for visualizing 3D volumetric diffusion tensor MR images. We distinguish between linear anisotropy and planar anisotropy and represent values in the two regimes using streamtubes and streamsurfaces, respectively. Streamtubes represent structures with primarily linear diffusion, typically fiber tracts; streamtube direction correlates with tract orientation. The cross-sectional shape and color of each streamtube represent additional information from the diffusion tensor at each point. Streamsurfaces represent structures in which diffusion is primarily planar. Our algorithm chooses a very small representative subset of the streamtubes and streamsurfaces for display. We describe the set of metrics used for the culling process, which reduces visual clutter and improves interactivity. We also generate anatomical landmarks to identify the locations of such structures as the eyes, skull surface, and ventricles. The final models are complex surface geometries that can be imported into many interactive graphics software environments. We describe a virtual environment to interact with these models. Expert feedback from doctors studying changes in white-matter structures after gamma-knife capsulotomy and preoperative planning for brain tumor surgery shows that streamtubes correlate well with major neural structures, the 2D section and geometric landmarks are important in understanding the visualization, and the stereo and interactivity from the virtual environment aid in understanding the complex geometric models.",
"title": "Visualizing Diffusion Tensor MR Images Using Streamtubes and Streamsurfaces",
"normalizedTitle": "Visualizing Diffusion Tensor MR Images Using Streamtubes and Streamsurfaces",
"fno": "v0454",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Diffusion Tensor Imaging",
"DT MRI",
"DTI",
"Hyperstreamline",
"Immersive Virtual Reality",
"Streamsurface",
"Streamtube",
"Scientific Visualization",
"Volume Visualization"
],
"authors": [
{
"givenName": "Song",
"surname": "Zhang",
"fullName": "Song Zhang",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "?agatay",
"surname": "Demiralp",
"fullName": "?agatay Demiralp",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "David H.",
"surname": "Laidlaw",
"fullName": "David H. Laidlaw",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2003-10-01 00:00:00",
"pubType": "trans",
"pages": "454-462",
"year": "2003",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0443",
"articleId": "13rRUx0gev0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0463",
"articleId": "13rRUx0xPTH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx7ouK3",
"title": "April-June",
"year": "1999",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "5",
"label": "April-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwdIOUA",
"doi": "10.1109/2945.773805",
"abstract": "Abstract—Separation and attachment lines are topologically significant curves that exist on 2D surfaces in 3D vector fields. Two algorithms are presented, one point-based and one element-based, that extract separation and attachment lines using eigenvalue analysis of a locally linear function. Unlike prior techniques based on piecewise numerical integration, these algorithms use robust analytical tests that can be applied independently to any point in a vector field. The feature extraction is fully automatic and suited to the analysis of large-scale numerical simulations. The strengths and weaknesses of the two algorithms are evaluated using analytic vector fields and also results from computational fluid dynamics (CFD) simulations. We show that both algorithms detect open separation lines–a type of separation that is not captured by conventional vector field topology algorithms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Separation and attachment lines are topologically significant curves that exist on 2D surfaces in 3D vector fields. Two algorithms are presented, one point-based and one element-based, that extract separation and attachment lines using eigenvalue analysis of a locally linear function. Unlike prior techniques based on piecewise numerical integration, these algorithms use robust analytical tests that can be applied independently to any point in a vector field. The feature extraction is fully automatic and suited to the analysis of large-scale numerical simulations. The strengths and weaknesses of the two algorithms are evaluated using analytic vector fields and also results from computational fluid dynamics (CFD) simulations. We show that both algorithms detect open separation lines–a type of separation that is not captured by conventional vector field topology algorithms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Separation and attachment lines are topologically significant curves that exist on 2D surfaces in 3D vector fields. Two algorithms are presented, one point-based and one element-based, that extract separation and attachment lines using eigenvalue analysis of a locally linear function. Unlike prior techniques based on piecewise numerical integration, these algorithms use robust analytical tests that can be applied independently to any point in a vector field. The feature extraction is fully automatic and suited to the analysis of large-scale numerical simulations. The strengths and weaknesses of the two algorithms are evaluated using analytic vector fields and also results from computational fluid dynamics (CFD) simulations. We show that both algorithms detect open separation lines–a type of separation that is not captured by conventional vector field topology algorithms.",
"title": "Feature Extraction of Separation and Attachment Lines *",
"normalizedTitle": "Feature Extraction of Separation and Attachment Lines *",
"fno": "v0135",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Vector Field Visualization",
"Vector Field Topology",
"Flow Visualization",
"Feature Detection",
"Flow Separation",
"Separation Line"
],
"authors": [
{
"givenName": "David N.",
"surname": "Kenwright",
"fullName": "David N. Kenwright",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chris",
"surname": "Henze",
"fullName": "Chris Henze",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Creon",
"surname": "Levit",
"fullName": "Creon Levit",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "1999-04-01 00:00:00",
"pubType": "trans",
"pages": "135-144",
"year": "1999",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0116",
"articleId": "13rRUwwJWFC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0145",
"articleId": "13rRUygBwhC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAle6Qx",
"title": "November/December",
"year": "2007",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5x9",
"doi": "10.1109/TVCG.2007.70554",
"abstract": "This paper presents a method for filtered ridge extraction based on adaptive mesh refinement. It is applicable in situations where the underlying scalar field can be refined during ridge extraction. This requirement is met by the concept of Lagrangian coherent structures which is based on trajectories started at arbitrary sampling grids that are independent of the underlying vector field. The Lagrangian coherent structures are extracted as ridges in finite Lyapunov exponent fields computed from these grids of trajectories. The method is applied to several variants of finite Lyapunov exponents, one of which is newly introduced. High computation time due to the high number of required trajectories is a main drawback when computing Lyapunov exponents of 3-dimensional vector fields. The presented method allows a substantial speed-up by avoiding the seeding of trajectories in regions where no ridges are present or do not satisfy the prescribed filter criteria such as a minimum finite Lyapunov exponent.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a method for filtered ridge extraction based on adaptive mesh refinement. It is applicable in situations where the underlying scalar field can be refined during ridge extraction. This requirement is met by the concept of Lagrangian coherent structures which is based on trajectories started at arbitrary sampling grids that are independent of the underlying vector field. The Lagrangian coherent structures are extracted as ridges in finite Lyapunov exponent fields computed from these grids of trajectories. The method is applied to several variants of finite Lyapunov exponents, one of which is newly introduced. High computation time due to the high number of required trajectories is a main drawback when computing Lyapunov exponents of 3-dimensional vector fields. The presented method allows a substantial speed-up by avoiding the seeding of trajectories in regions where no ridges are present or do not satisfy the prescribed filter criteria such as a minimum finite Lyapunov exponent.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a method for filtered ridge extraction based on adaptive mesh refinement. It is applicable in situations where the underlying scalar field can be refined during ridge extraction. This requirement is met by the concept of Lagrangian coherent structures which is based on trajectories started at arbitrary sampling grids that are independent of the underlying vector field. The Lagrangian coherent structures are extracted as ridges in finite Lyapunov exponent fields computed from these grids of trajectories. The method is applied to several variants of finite Lyapunov exponents, one of which is newly introduced. High computation time due to the high number of required trajectories is a main drawback when computing Lyapunov exponents of 3-dimensional vector fields. The presented method allows a substantial speed-up by avoiding the seeding of trajectories in regions where no ridges are present or do not satisfy the prescribed filter criteria such as a minimum finite Lyapunov exponent.",
"title": "Efficient Visualization of Lagrangian Coherent Structures by Filtered AMR Ridge Extraction",
"normalizedTitle": "Efficient Visualization of Lagrangian Coherent Structures by Filtered AMR Ridge Extraction",
"fno": "v1456",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Fluid Dynamics",
"Feature Extraction",
"Filtering Theory",
"Flow Visualisation",
"Lyapunov Methods",
"Mesh Generation",
"Lagrangian Coherent Structure Visualization",
"Filtered AMR Ridge Extraction",
"Adaptive Mesh Refinement",
"Arbitrary Sampling Grids",
"Finite Lyapunov Exponent Fields",
"Vector Fields",
"Visualization",
"Lagrangian Functions",
"Adaptive Filters",
"Adaptive Mesh Refinement",
"Sampling Methods",
"Topology",
"Isosurfaces",
"Grid Computing",
"Computational Efficiency",
"Fluid Dynamics",
"Ridge Extraction",
"Flow Visualization",
"Coherent Structures",
"Vector Field Topology",
"Unsteady Vector Fields"
],
"authors": [
{
"givenName": "Filip",
"surname": "Sadlo",
"fullName": "Filip Sadlo",
"affiliation": "ETH Zurich, Switzerland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ronald",
"surname": "Peikert",
"fullName": "Ronald Peikert",
"affiliation": "ETH Zurich, Switzerland",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2007-11-01 00:00:00",
"pubType": "trans",
"pages": "1456-1463",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/avss/2012/4797/0/4797a398",
"title": "Detecting People Carrying Objects Utilizing Lagrangian Dynamics",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2012/4797a398/12OmNB1eJzR",
"parentPublication": {
"id": "proceedings/avss/2012/4797/0",
"title": "2012 IEEE Ninth International Conference on Advanced Video and Signal-Based Surveillance",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a277",
"title": "An Alternative Formulation of Lyapunov Exponents for Computing Lagrangian Coherent Structures",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a277/12OmNwfsI0r",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/shpcc/1994/5680/0/00296680",
"title": "Parallel semi-Lagrangian advection on the sphere using PVM",
"doi": null,
"abstractUrl": "/proceedings-article/shpcc/1994/00296680/12OmNxV4iyH",
"parentPublication": {
"id": "proceedings/shpcc/1994/5680/0",
"title": "Proceedings of IEEE Scalable High Performance Computing Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1464",
"title": "Efficient Computation and Visualization of Coherent Structures in Fluid Flow Applications",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1464/13rRUwInv4h",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/06171182",
"title": "Preserving Fluid Sheets with Adaptively Sampled Anisotropic Particles",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/06171182/13rRUxC0SvR",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122159",
"title": "Lagrangian Coherent Structures for Design Analysis of Revolving Doors",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122159/13rRUxZ0o1y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/06/07422124",
"title": "Finite-Time Lyapunov Exponents and Lagrangian Coherent Structures in Uncertain Unsteady Flows",
"doi": null,
"abstractUrl": "/journal/tg/2016/06/07422124/13rRUxbTMyV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011121862",
"title": "Visualization of AMR Data With Multi-Level Dual-Mesh Interpolation",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011121862/13rRUxd2aYY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061569",
"title": "Interactive Separating Streak Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061569/13rRUxly9dQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2019/2605/0/08944378",
"title": "Parallel Particle Advection and Lagrangian Analysis for 3D-PLI Fiber Orientation Maps",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2019/08944378/1grOF71jiog",
"parentPublication": {
"id": "proceedings/ldav/2019/2605/0",
"title": "2019 IEEE 9th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1448",
"articleId": "13rRUEgs2BN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1464",
"articleId": "13rRUwInv4h",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRHa",
"name": "v1456s.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/v1456s.zip",
"extension": "zip",
"size": "47.6 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUxly8Xt",
"doi": "10.1109/TVCG.2003.1207436",
"abstract": "Abstract—The depiction of time-dependent vector fields is a central problem in scientific visualization. This article describes a technique for generating animations of such fields where the motion of the streamlines to be visualized is given by a second “motion” vector field. Each frame of our animation is a Line Integral Convolution of the original vector field with a time-varying input texture. The texture is evolved according to the associated motion vector field via an automatically adjusted set of random particles. We demonstrate this technique with examples from electromagnetism.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—The depiction of time-dependent vector fields is a central problem in scientific visualization. This article describes a technique for generating animations of such fields where the motion of the streamlines to be visualized is given by a second “motion” vector field. Each frame of our animation is a Line Integral Convolution of the original vector field with a time-varying input texture. The texture is evolved according to the associated motion vector field via an automatically adjusted set of random particles. We demonstrate this technique with examples from electromagnetism.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—The depiction of time-dependent vector fields is a central problem in scientific visualization. This article describes a technique for generating animations of such fields where the motion of the streamlines to be visualized is given by a second “motion” vector field. Each frame of our animation is a Line Integral Convolution of the original vector field with a time-varying input texture. The texture is evolved according to the associated motion vector field via an automatically adjusted set of random particles. We demonstrate this technique with examples from electromagnetism.",
"title": "Dynamic Line Integral Convolution for Visualizing Streamline Evolution",
"normalizedTitle": "Dynamic Line Integral Convolution for Visualizing Streamline Evolution",
"fno": "v0273",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Line Integral Convolution",
"Time Dependent",
"Time Varying",
"Vector Fields",
"Field Lines",
"Streamlines",
"Electromagnetism"
],
"authors": [
{
"givenName": "Andreas",
"surname": "Sundquist",
"fullName": "Andreas Sundquist",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2003-07-01 00:00:00",
"pubType": "trans",
"pages": "273-282",
"year": "2003",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "v0283",
"articleId": "13rRUyYjK58",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrMZpr3",
"title": "Sept.",
"year": "2013",
"issueNum": "09",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwghd98",
"doi": "10.1109/TVCG.2013.62",
"abstract": "Image-space line integral convolution (LIC) is a popular scheme for visualizing surface vector fields due to its simplicity and high efficiency. To avoid inconsistencies or color blur during the user interactions, existing approaches employ surface parameterization or 3D volume texture schemes. However, they often require expensive computation or memory cost, and cannot achieve consistent results in terms of both the granularity and color distribution on different scales. This paper introduces a novel image-space surface flow visualization approach that preserves the coherence during user interactions. To make the noise texture under different viewpoints coherent, we propose to precompute a sequence of mipmap noise textures in a coarse-to-fine manner for consistent transition, and map the textures onto each triangle with randomly assigned and constant texture coordinates. Further, a standard image-space LIC is performed to generate the flow texture. The proposed approach is simple and GPU-friendly, and can be easily combined with various texture-based flow visualization techniques. By leveraging viewpoint-dependent backward tracing and mipmap noise phase, our method can be incorporated with the image-based flow visualization (IBFV) technique for coherent visualization of unsteady flows. We demonstrate consistent and highly efficient flow visualization on a variety of data sets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Image-space line integral convolution (LIC) is a popular scheme for visualizing surface vector fields due to its simplicity and high efficiency. To avoid inconsistencies or color blur during the user interactions, existing approaches employ surface parameterization or 3D volume texture schemes. However, they often require expensive computation or memory cost, and cannot achieve consistent results in terms of both the granularity and color distribution on different scales. This paper introduces a novel image-space surface flow visualization approach that preserves the coherence during user interactions. To make the noise texture under different viewpoints coherent, we propose to precompute a sequence of mipmap noise textures in a coarse-to-fine manner for consistent transition, and map the textures onto each triangle with randomly assigned and constant texture coordinates. Further, a standard image-space LIC is performed to generate the flow texture. The proposed approach is simple and GPU-friendly, and can be easily combined with various texture-based flow visualization techniques. By leveraging viewpoint-dependent backward tracing and mipmap noise phase, our method can be incorporated with the image-based flow visualization (IBFV) technique for coherent visualization of unsteady flows. We demonstrate consistent and highly efficient flow visualization on a variety of data sets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Image-space line integral convolution (LIC) is a popular scheme for visualizing surface vector fields due to its simplicity and high efficiency. To avoid inconsistencies or color blur during the user interactions, existing approaches employ surface parameterization or 3D volume texture schemes. However, they often require expensive computation or memory cost, and cannot achieve consistent results in terms of both the granularity and color distribution on different scales. This paper introduces a novel image-space surface flow visualization approach that preserves the coherence during user interactions. To make the noise texture under different viewpoints coherent, we propose to precompute a sequence of mipmap noise textures in a coarse-to-fine manner for consistent transition, and map the textures onto each triangle with randomly assigned and constant texture coordinates. Further, a standard image-space LIC is performed to generate the flow texture. The proposed approach is simple and GPU-friendly, and can be easily combined with various texture-based flow visualization techniques. By leveraging viewpoint-dependent backward tracing and mipmap noise phase, our method can be incorporated with the image-based flow visualization (IBFV) technique for coherent visualization of unsteady flows. We demonstrate consistent and highly efficient flow visualization on a variety of data sets.",
"title": "Image-Space Texture-Based Output-Coherent Surface Flow Visualization",
"normalizedTitle": "Image-Space Texture-Based Output-Coherent Surface Flow Visualization",
"fno": "ttg2013091476",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Vectors",
"Surface Texture",
"Image Color Analysis",
"Colored Noise",
"Image Resolution",
"Unsteady Flows",
"Flow Visualization",
"Mipmap",
"LIC",
"IBFV",
"Surface Flows"
],
"authors": [
{
"givenName": null,
"surname": "Jin Huang",
"fullName": "Jin Huang",
"affiliation": "State Key Lab. of CAD & CG, Zhejiang Univ., Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Zherong Pan",
"fullName": "Zherong Pan",
"affiliation": "State Key Lab. of CAD & CG, Zhejiang Univ., Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Guoning Chen",
"fullName": "Guoning Chen",
"affiliation": "Dept. of Comput. Sci., Univ. of Houston, Houston, TX, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Wei Chen",
"fullName": "Wei Chen",
"affiliation": "State Key Lab. of CAD & CG, Zhejiang Univ., Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Hujun Bao",
"fullName": "Hujun Bao",
"affiliation": "State Key Lab. of CAD & CG, Zhejiang Univ., Hangzhou, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2013-09-01 00:00:00",
"pubType": "trans",
"pages": "1476-1487",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2000/0743/0/07430303",
"title": "Automatic Generation of Hair Texture with Line Integral Convolution",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2000/07430303/12OmNAYoKl4",
"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/cisp/2008/3119/2/3119b145",
"title": "Super Resolution of 3D Surface Texture Based on Eigen Images",
"doi": null,
"abstractUrl": "/proceedings-article/cisp/2008/3119b145/12OmNBC8AAT",
"parentPublication": {
"id": "proceedings/cisp/2008/3119/3",
"title": "Image and Signal Processing, Congress on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscsct/2008/3498/2/3498b230",
"title": "3D Surface Texture Synthesis Based on Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/iscsct/2008/3498b230/12OmNBRsVxV",
"parentPublication": {
"id": "proceedings/iscsct/2008/3498/1",
"title": "2008 International Symposium on Computer Science and Computational Technology (ISCSCT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1999/5897/0/58970038",
"title": "Interactive Exploration of Volume Line Integral Convolution Based on 3D-Texture Mapping",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1999/58970038/12OmNCdk2MV",
"parentPublication": {
"id": "proceedings/ieee-vis/1999/5897/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1995/7042/0/70420876",
"title": "Recovering object surfaces from viewed changes in surface texture patterns",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1995/70420876/12OmNvT2p2H",
"parentPublication": {
"id": "proceedings/iccv/1995/7042/0",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300015",
"title": "A Texture-Based Framework for Spacetime-Coherent Visualization of Time-Dependent Vector Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300015/12OmNyv7mgw",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2012/0863/0/06183584",
"title": "Output-coherent image-space LIC for surface flow visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2012/06183584/12OmNzw8jdp",
"parentPublication": {
"id": "proceedings/pacificvis/2012/0863/0",
"title": "Visualization Symposium, IEEE Pacific",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/05/ttg2012050783",
"title": "A 2D Flow Visualization User Study Using Explicit Flow Synthesis and Implicit Task Design",
"doi": null,
"abstractUrl": "/journal/tg/2012/05/ttg2012050783/13rRUwI5Ug5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/04/ttg2008040820",
"title": "Output-Sensitive 3D Line Integral Convolution",
"doi": null,
"abstractUrl": "/journal/tg/2008/04/ttg2008040820/13rRUwghd94",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2013/06/mcs2013060096",
"title": "Texture-Based Flow Visualization",
"doi": null,
"abstractUrl": "/magazine/cs/2013/06/mcs2013060096/13rRUwh80yj",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013091467",
"articleId": "13rRUxASubz",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013091488",
"articleId": "13rRUwIF69j",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgwZ",
"name": "ttg2013091476s.avi",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013091476s.avi",
"extension": "avi",
"size": "23.4 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwJPMX5",
"title": "Dec.",
"year": "2011",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygT7fa",
"doi": "10.1109/TVCG.2011.170",
"abstract": "Asymmetric tensor field visualization can provide important insight into fluid flows and solid deformations. Existing techniques for asymmetric tensor fields focus on the analysis, and simply use evenly-spaced hyperstreamlines on surfaces following eigenvectors and dual-eigenvectors in the tensor field. In this paper, we describe a hybrid visualization technique in which hyperstreamlines and elliptical glyphs are used in real and complex domains, respectively. This enables a more faithful representation of flow behaviors inside complex domains. In addition, we encode tensor magnitude, an important quantity in tensor field analysis, using the density of hyperstreamlines and sizes of glyphs. This allows colors to be used to encode other important tensor quantities. To facilitate quick visual exploration of the data from different viewpoints and at different resolutions, we employ an efficient image-space approach in which hyperstreamlines and glyphs are generated quickly in the image plane. The combination of these techniques leads to an efficient tensor field visualization system for domain scientists. We demonstrate the effectiveness of our visualization technique through applications to complex simulated engine fluid flow and earthquake deformation data. Feedback from domain expert scientists, who are also co-authors, is provided.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Asymmetric tensor field visualization can provide important insight into fluid flows and solid deformations. Existing techniques for asymmetric tensor fields focus on the analysis, and simply use evenly-spaced hyperstreamlines on surfaces following eigenvectors and dual-eigenvectors in the tensor field. In this paper, we describe a hybrid visualization technique in which hyperstreamlines and elliptical glyphs are used in real and complex domains, respectively. This enables a more faithful representation of flow behaviors inside complex domains. In addition, we encode tensor magnitude, an important quantity in tensor field analysis, using the density of hyperstreamlines and sizes of glyphs. This allows colors to be used to encode other important tensor quantities. To facilitate quick visual exploration of the data from different viewpoints and at different resolutions, we employ an efficient image-space approach in which hyperstreamlines and glyphs are generated quickly in the image plane. The combination of these techniques leads to an efficient tensor field visualization system for domain scientists. We demonstrate the effectiveness of our visualization technique through applications to complex simulated engine fluid flow and earthquake deformation data. Feedback from domain expert scientists, who are also co-authors, is provided.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Asymmetric tensor field visualization can provide important insight into fluid flows and solid deformations. Existing techniques for asymmetric tensor fields focus on the analysis, and simply use evenly-spaced hyperstreamlines on surfaces following eigenvectors and dual-eigenvectors in the tensor field. In this paper, we describe a hybrid visualization technique in which hyperstreamlines and elliptical glyphs are used in real and complex domains, respectively. This enables a more faithful representation of flow behaviors inside complex domains. In addition, we encode tensor magnitude, an important quantity in tensor field analysis, using the density of hyperstreamlines and sizes of glyphs. This allows colors to be used to encode other important tensor quantities. To facilitate quick visual exploration of the data from different viewpoints and at different resolutions, we employ an efficient image-space approach in which hyperstreamlines and glyphs are generated quickly in the image plane. The combination of these techniques leads to an efficient tensor field visualization system for domain scientists. We demonstrate the effectiveness of our visualization technique through applications to complex simulated engine fluid flow and earthquake deformation data. Feedback from domain expert scientists, who are also co-authors, is provided.",
"title": "Asymmetric Tensor Field Visualization for Surfaces",
"normalizedTitle": "Asymmetric Tensor Field Visualization for Surfaces",
"fno": "ttg2011121979",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Tensor Field Visualization",
"Asymmetric Tensor Fields",
"Vector Field Visualization",
"Fluid Dynamics",
"Solid Deformation",
"Earthquakeengineering",
"Glyph Packing",
"Hyperstreamline Placement",
"View Dependent Visualization"
],
"authors": [
{
"givenName": "Darrel",
"surname": "Palke",
"fullName": "Darrel Palke",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhongzang",
"surname": "Lin",
"fullName": "Zhongzang Lin",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guoning",
"surname": "Chen",
"fullName": "Guoning Chen",
"affiliation": "SCI, University of Utah",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Harry",
"surname": "Yeh",
"fullName": "Harry Yeh",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Paul",
"surname": "Vincent",
"fullName": "Paul Vincent",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert",
"surname": "Laramee",
"fullName": "Robert Laramee",
"affiliation": "Swansea University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eugene",
"surname": "Zhang",
"fullName": "Eugene Zhang",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2011-12-01 00:00:00",
"pubType": "trans",
"pages": "1979-1988",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2005/2766/0/27660001",
"title": "2D Asymmetric Tensor Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660001/12OmNAY79q0",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660004",
"title": "HOT- Lines: Tracking Lines in Higher Order Tensor Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660004/12OmNwMXnqd",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498sigfrids",
"title": "Tensor Field Visualisation using Adaptive Filtering of Noise Fields combined with Glyph Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498sigfrids/12OmNyfdOXA",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880123",
"title": "Physically Based Methods for Tensor Field Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880123/12OmNzTppFk",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192722",
"title": "Glyph-Based Comparative Visualization for Diffusion Tensor Fields",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192722/13rRUx0gefn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1329",
"title": "Diffusion Tensor Visualization with Glyph Packing",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1329/13rRUxYrbUu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061595",
"title": "Superquadric Glyphs for Symmetric Second-Order Tensors",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061595/13rRUxZzAhA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805436",
"title": "Multi-Scale Topological Analysis of Asymmetric Tensor Fields on Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805436/1cG4IGNd2Y8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/07/08967163",
"title": "Visualization of 3D Stress Tensor Fields Using Superquadric Glyphs on Displacement Streamlines",
"doi": null,
"abstractUrl": "/journal/tg/2021/07/08967163/1gPjyn904OA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552927",
"title": "Feature Curves and Surfaces of 3D Asymmetric Tensor Fields",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552927/1xic6oeRxnO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011121969",
"articleId": "13rRUxBa5rS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011121989",
"articleId": "13rRUEgs2BT",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRYG",
"name": "ttg2011121979s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2011121979s1.zip",
"extension": "zip",
"size": "18.9 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAle6Qx",
"title": "November/December",
"year": "2007",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInv4h",
"doi": "10.1109/TVCG.2007.70551",
"abstract": "The recently introduced notion of Finite-Time Lyapunov Exponent to characterize Coherent Lagrangian Structures provides a powerful framework for the visualization and analysis of complex technical flows. Its definition is simple and intuitive, and it has a deep theoretical foundation. While the application of this approach seems straightforward in theory, the associated computational cost is essentially prohibitive. Due to the Lagrangian nature of this technique, a huge number of particle paths must be computed to fill the space-time flow domain. In this paper, we propose a novel scheme for the adaptive computation of FTLE fields in two and three dimensions that significantly reduces the number of required particle paths. Furthermore, for three-dimensional flows, we show on several examples that meaningful results can be obtained by restricting the analysis to a well-chosen plane intersecting the flow domain. Finally, we examine some of the visualization aspects of FTLE-based methods and introduce several new variations that help in the analysis of specific aspects of a flow.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The recently introduced notion of Finite-Time Lyapunov Exponent to characterize Coherent Lagrangian Structures provides a powerful framework for the visualization and analysis of complex technical flows. Its definition is simple and intuitive, and it has a deep theoretical foundation. While the application of this approach seems straightforward in theory, the associated computational cost is essentially prohibitive. Due to the Lagrangian nature of this technique, a huge number of particle paths must be computed to fill the space-time flow domain. In this paper, we propose a novel scheme for the adaptive computation of FTLE fields in two and three dimensions that significantly reduces the number of required particle paths. Furthermore, for three-dimensional flows, we show on several examples that meaningful results can be obtained by restricting the analysis to a well-chosen plane intersecting the flow domain. Finally, we examine some of the visualization aspects of FTLE-based methods and introduce several new variations that help in the analysis of specific aspects of a flow.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The recently introduced notion of Finite-Time Lyapunov Exponent to characterize Coherent Lagrangian Structures provides a powerful framework for the visualization and analysis of complex technical flows. Its definition is simple and intuitive, and it has a deep theoretical foundation. While the application of this approach seems straightforward in theory, the associated computational cost is essentially prohibitive. Due to the Lagrangian nature of this technique, a huge number of particle paths must be computed to fill the space-time flow domain. In this paper, we propose a novel scheme for the adaptive computation of FTLE fields in two and three dimensions that significantly reduces the number of required particle paths. Furthermore, for three-dimensional flows, we show on several examples that meaningful results can be obtained by restricting the analysis to a well-chosen plane intersecting the flow domain. Finally, we examine some of the visualization aspects of FTLE-based methods and introduce several new variations that help in the analysis of specific aspects of a flow.",
"title": "Efficient Computation and Visualization of Coherent Structures in Fluid Flow Applications",
"normalizedTitle": "Efficient Computation and Visualization of Coherent Structures in Fluid Flow Applications",
"fno": "v1464",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Fluid Dynamics",
"Data Visualisation",
"Flow Visualisation",
"Lyapunov Methods",
"Fluid Flow Visualization",
"Data Visualization",
"Coherent Structure",
"Finite Time Lyapunov Exponent",
"Lagrangian Structure",
"Space Time Flow Domain",
"Visualization",
"Fluid Flow",
"Lagrangian Functions",
"Computational Efficiency",
"Automotive Engineering",
"Data Analysis",
"Performance Analysis",
"Computer Vision",
"Object Detection",
"Biomedical Engineering",
"Flow Visualization",
"Feature Detection",
"3 D Vector Field Visualization"
],
"authors": [
{
"givenName": "Christoph",
"surname": "Garth",
"fullName": "Christoph Garth",
"affiliation": "University of Kaiserslautern, Germany, and the Institute for Data Analysis and Visualization at University of California, Davis,",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Florian",
"surname": "Gerhardt",
"fullName": "Florian Gerhardt",
"affiliation": "University of Kaiserslautern, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xavier",
"surname": "Tricoche",
"fullName": "Xavier Tricoche",
"affiliation": "SCI Institute, University of Utah, and Purdue University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hagen",
"surname": "Hans",
"fullName": "Hagen Hans",
"affiliation": "University of Kaiserslautern, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2007-11-01 00:00:00",
"pubType": "trans",
"pages": "1464-1471",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/snpd/2016/2239/0/07515872",
"title": "An efficient Uniform Integrated Advection algorithm for Finite Time Lyapunov Exponent field computation on GPU and MIC",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2016/07515872/12OmNAqCtOm",
"parentPublication": {
"id": "proceedings/snpd/2016/2239/0",
"title": "2016 17th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ems/2009/3886/0/3886a333",
"title": "Splitting Scheme for Eulerian-Lagrangian Technique in the Analysis of Particle Conformity to Fluid Flow",
"doi": null,
"abstractUrl": "/proceedings-article/ems/2009/3886a333/12OmNBCqbJi",
"parentPublication": {
"id": "proceedings/ems/2009/3886/0",
"title": "Computer Modeling and Simulation, UKSIM European Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2007/1179/0/04270002",
"title": "A Lagrangian Particle Dynamics Approach for Crowd Flow Segmentation and Stability Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2007/04270002/12OmNroijnT",
"parentPublication": {
"id": "proceedings/cvpr/2007/1179/0",
"title": "2007 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vmv/1994/5875/0/00324993",
"title": "Nonlinear models for representation, compression, and visualization of fluid flow images and velocimetry data",
"doi": null,
"abstractUrl": "/proceedings-article/vmv/1994/00324993/12OmNwF0BL1",
"parentPublication": {
"id": "proceedings/vmv/1994/5875/0",
"title": "Proceedings of Workshop on Visualization and Machine Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cdc/2000/6638/2/00912030",
"title": "An optimal control formulation for inviscid incompressible ideal fluid flow",
"doi": null,
"abstractUrl": "/proceedings-article/cdc/2000/00912030/12OmNxwENyd",
"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/2007/06/v1456",
"title": "Efficient Visualization of Lagrangian Coherent Structures by Filtered AMR Ridge Extraction",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1456/13rRUxBa5x9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2002/03/v0211",
"title": "Lagrangian-Eulerian Advection of Noise and Dye Textures for Unsteady Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2002/03/v0211/13rRUxD9h4X",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122159",
"title": "Lagrangian Coherent Structures for Design Analysis of Revolving Doors",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122159/13rRUxZ0o1y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/06/07422124",
"title": "Finite-Time Lyapunov Exponents and Lagrangian Coherent Structures in Uncertain Unsteady Flows",
"doi": null,
"abstractUrl": "/journal/tg/2016/06/07422124/13rRUxbTMyV",
"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"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1456",
"articleId": "13rRUxBa5x9",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1472",
"articleId": "13rRUxASuSH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvwoO0",
"title": "June",
"year": "2012",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjyX3Y",
"doi": "10.1109/TVCG.2011.80",
"abstract": "Many flow visualization techniques, especially integration-based methods, are problematic when the measured data exhibit noise and discretization issues. Particularly, this is the case for flow-sensitive phase-contrast magnetic resonance imaging (PC-MRI) data sets which not only record anatomic information, but also time-varying flow information. We propose a novel approach for the visualization of such data sets using integration-based methods. Our ideas are based upon finite-time Lyapunov exponents (FTLE) and enable identification of vessel boundaries in the data as high regions of separation. This allows us to correctly restrict integration-based visualization to blood vessels. We validate our technique by comparing our approach to existing anatomy-based methods as well as addressing the benefits and limitations of using FTLE to restrict flow. We also discuss the importance of parameters, i.e., advection length and data resolution, in establishing a well-defined vessel boundary. We extract appropriate flow lines and surfaces that enable the visualization of blood flow within the vessels. We further enhance the visualization by analyzing flow behavior in the seeded region and generating simplified depictions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Many flow visualization techniques, especially integration-based methods, are problematic when the measured data exhibit noise and discretization issues. Particularly, this is the case for flow-sensitive phase-contrast magnetic resonance imaging (PC-MRI) data sets which not only record anatomic information, but also time-varying flow information. We propose a novel approach for the visualization of such data sets using integration-based methods. Our ideas are based upon finite-time Lyapunov exponents (FTLE) and enable identification of vessel boundaries in the data as high regions of separation. This allows us to correctly restrict integration-based visualization to blood vessels. We validate our technique by comparing our approach to existing anatomy-based methods as well as addressing the benefits and limitations of using FTLE to restrict flow. We also discuss the importance of parameters, i.e., advection length and data resolution, in establishing a well-defined vessel boundary. We extract appropriate flow lines and surfaces that enable the visualization of blood flow within the vessels. We further enhance the visualization by analyzing flow behavior in the seeded region and generating simplified depictions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Many flow visualization techniques, especially integration-based methods, are problematic when the measured data exhibit noise and discretization issues. Particularly, this is the case for flow-sensitive phase-contrast magnetic resonance imaging (PC-MRI) data sets which not only record anatomic information, but also time-varying flow information. We propose a novel approach for the visualization of such data sets using integration-based methods. Our ideas are based upon finite-time Lyapunov exponents (FTLE) and enable identification of vessel boundaries in the data as high regions of separation. This allows us to correctly restrict integration-based visualization to blood vessels. We validate our technique by comparing our approach to existing anatomy-based methods as well as addressing the benefits and limitations of using FTLE to restrict flow. We also discuss the importance of parameters, i.e., advection length and data resolution, in establishing a well-defined vessel boundary. We extract appropriate flow lines and surfaces that enable the visualization of blood flow within the vessels. We further enhance the visualization by analyzing flow behavior in the seeded region and generating simplified depictions.",
"title": "Analysis of Time-Dependent Flow-Sensitive PC-MRI Data",
"normalizedTitle": "Analysis of Time-Dependent Flow-Sensitive PC-MRI Data",
"fno": "05753896",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Medical Computing",
"Biomedical MRI",
"Blood Vessels",
"Data Visualisation",
"Flow Visualisation",
"Haemodynamics",
"Integration",
"Integration Based Visualization Methods",
"Blood Flow Visualization Techniques",
"Flow Sensitive Phase Contrast Magnetic Resonance Imaging Data Sets",
"Anatomic Information",
"Time Varying Flow Information",
"Finite Time Lyapunov Exponents",
"Blood Vessel Boundary Identification",
"Advection Length",
"Data Resolution",
"Flow Line Extraction",
"Surface Extraction",
"MRI",
"Data Visualization",
"Magnetic Resonance Imaging",
"Blood",
"Biomedical Imaging",
"Trajectory",
"Visualization",
"Medical Visualization",
"Flow Analysis",
"Time Varying And Time Series Visualization",
"Surface Extraction",
"Flow Sensitive MRI"
],
"authors": [
{
"givenName": "J.",
"surname": "Guhring",
"fullName": "J. Guhring",
"affiliation": "Corp. Res., Imaging & Visualization, Siemens Corp., Princeton, NJ, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "C.",
"surname": "Garth",
"fullName": "C. Garth",
"affiliation": "Inst. of Data Anal. & Visualization, Univ. of California, Davis, Davis, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "H.",
"surname": "Krishnan",
"fullName": "H. Krishnan",
"affiliation": "Inst. of Data Anal. & Visualization, Univ. of California, Davis, Davis, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "A.",
"surname": "Greiser",
"fullName": "A. Greiser",
"affiliation": "Healthcare Sector, Siemens AG, Erlangen, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "M. A.",
"surname": "Gulsun",
"fullName": "M. A. Gulsun",
"affiliation": "Corp. Res., Imaging & Visualization, Siemens Corp., Princeton, NJ, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "K. I.",
"surname": "Joy",
"fullName": "K. I. Joy",
"affiliation": "Inst. of Data Anal. & Visualization, Univ. of California, Davis, Davis, CA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2012-06-01 00:00:00",
"pubType": "trans",
"pages": "966-977",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cic/1989/2114/0/00130526",
"title": "MRI estimation of turbulent abnormalities in blood flow by improved multiparametric encoding gradients",
"doi": null,
"abstractUrl": "/proceedings-article/cic/1989/00130526/12OmNAHmOur",
"parentPublication": {
"id": "proceedings/cic/1989/2114/0",
"title": "Proceedings Computers in Cardiology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1995/7187/0/71870379",
"title": "Flow visualization in a hypersonic fin/ramp flow",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1995/71870379/12OmNqBtj4A",
"parentPublication": {
"id": "proceedings/ieee-vis/1995/7187/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bmei/2008/3118/2/3118b339",
"title": "A Simulation Model for Doppler Ultrasound Signals from Pulsatile Blood Flow in Stenosed Vessels",
"doi": null,
"abstractUrl": "/proceedings-article/bmei/2008/3118b339/12OmNvq5jz8",
"parentPublication": {
"id": "proceedings/bmei/2008/3118/2",
"title": "BioMedical Engineering and Informatics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2013/4797/0/06596137",
"title": "Illustrative visualization of cardiac and aortic blood flow from 4D MRI data",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2013/06596137/12OmNzC5SHi",
"parentPublication": {
"id": "proceedings/pacificvis/2013/4797/0",
"title": "2013 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880393",
"title": "Non-Linear Model Fitting to Parameterize Diseased Blood Vessels",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880393/12OmNzXnNBE",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2015/7983/0/07367643",
"title": "Computational analysis of blood flow in cerebral aneurysms",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2015/07367643/12OmNzmclMa",
"parentPublication": {
"id": "proceedings/bibe/2015/7983/0",
"title": "2015 IEEE 15th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122153",
"title": "Interactive Virtual Probing of 4D MRI Blood-Flow",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122153/13rRUNvyatf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1464",
"title": "Efficient Computation and Visualization of Coherent Structures in Fluid Flow Applications",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1464/13rRUwInv4h",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061339",
"title": "Exploration of 4D MRI Blood Flow using Stylistic Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061339/13rRUxBJhvq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07194839",
"title": "Occlusion-free Blood Flow Animation with Wall Thickness Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07194839/13rRUxly95F",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012060938",
"articleId": "13rRUxlgxOj",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05753898",
"articleId": "13rRUyfbwqE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzwHveo",
"title": "March/April",
"year": "2009",
"issueNum": "02",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "11",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxN5ewZ",
"doi": "10.1109/MCSE.2009.42",
"abstract": "Direct numerical simulation (DNS) of turbulence is computationally intensive and typically relies on some form of parallel processing. Spectral kernels used for spatial discretization are a common computational bottleneck on distributed memory architectures. One way to increase DNS algorithms' efficiency is to parallelize spectral kernels using tightly coupled single-program, multiple-data (SPMD) multiprocessor units with minimal interprocessor communication latency. The authors present techniques to map DNS computations to modern graphics processing units (GPUs), which are characterized by very high memory bandwidth and hundreds of SPMD processors. The article compares the performance between the authors' parallel algorithm running on a GPU versus the associated CPU implementation of a solver for one of the fundamental nonlinear models of turbulence theory. They also demonstrate a prototype of a scalable computational steering framework based on turbulence simulation and visualization coupling on the GPU.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Direct numerical simulation (DNS) of turbulence is computationally intensive and typically relies on some form of parallel processing. Spectral kernels used for spatial discretization are a common computational bottleneck on distributed memory architectures. One way to increase DNS algorithms' efficiency is to parallelize spectral kernels using tightly coupled single-program, multiple-data (SPMD) multiprocessor units with minimal interprocessor communication latency. The authors present techniques to map DNS computations to modern graphics processing units (GPUs), which are characterized by very high memory bandwidth and hundreds of SPMD processors. The article compares the performance between the authors' parallel algorithm running on a GPU versus the associated CPU implementation of a solver for one of the fundamental nonlinear models of turbulence theory. They also demonstrate a prototype of a scalable computational steering framework based on turbulence simulation and visualization coupling on the GPU.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Direct numerical simulation (DNS) of turbulence is computationally intensive and typically relies on some form of parallel processing. Spectral kernels used for spatial discretization are a common computational bottleneck on distributed memory architectures. One way to increase DNS algorithms' efficiency is to parallelize spectral kernels using tightly coupled single-program, multiple-data (SPMD) multiprocessor units with minimal interprocessor communication latency. The authors present techniques to map DNS computations to modern graphics processing units (GPUs), which are characterized by very high memory bandwidth and hundreds of SPMD processors. The article compares the performance between the authors' parallel algorithm running on a GPU versus the associated CPU implementation of a solver for one of the fundamental nonlinear models of turbulence theory. They also demonstrate a prototype of a scalable computational steering framework based on turbulence simulation and visualization coupling on the GPU.",
"title": "Using Graphics Processors for High-Performance Computation and Visualization of Plasma Turbulence",
"normalizedTitle": "Using Graphics Processors for High-Performance Computation and Visualization of Plasma Turbulence",
"fno": "mcs2009020052",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"GPU Programming",
"Scientific Computing",
"Direct Numerical Simulation",
"Plasma Turbulence",
"Graphics Processing Unit"
],
"authors": [
{
"givenName": "George",
"surname": "Stantchev",
"fullName": "George Stantchev",
"affiliation": "University of Maryland, College Park",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Derek",
"surname": "Juba",
"fullName": "Derek Juba",
"affiliation": "University of Maryland, College Park",
"__typename": "ArticleAuthorType"
},
{
"givenName": "William",
"surname": "Dorland",
"fullName": "William Dorland",
"affiliation": "University of Maryland, College Park",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Amitabh",
"surname": "Varshney",
"fullName": "Amitabh Varshney",
"affiliation": "University of Maryland, College Park",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2009-03-01 00:00:00",
"pubType": "mags",
"pages": "52-59",
"year": "2009",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sc/2016/8815/0/8815a502",
"title": "Extreme Scale Plasma Turbulence Simulations on Top Supercomputers Worldwide",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2016/8815a502/12OmNBziBdN",
"parentPublication": {
"id": "proceedings/sc/2016/8815/0",
"title": "SC16: International Conference for High Performance Computing, Networking, Storage and Analysis (SC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1993/4340/0/01263475",
"title": "Multi-CPU plasma fluid turbulence calculations on a CRAY Y-MP C90",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1993/01263475/12OmNrHjqNg",
"parentPublication": {
"id": "proceedings/sc/1993/4340/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2002/1524/0/15240050",
"title": "16.4-Tflops Direct Numerical Simulation of Turbulence by a Fourier Spectral Method on the Earth Simulator",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2002/15240050/12OmNrIrPsz",
"parentPublication": {
"id": "proceedings/sc/2002/1524/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1992/2630/0/00236674",
"title": "Performance of a plasma fluid code on the Intel parallel computers",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1992/00236674/12OmNs5rkTc",
"parentPublication": {
"id": "proceedings/sc/1992/2630/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1994/6627/0/00346301",
"title": "Tokamak plasma turbulence visualization",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1994/00346301/12OmNvpw7ci",
"parentPublication": {
"id": "proceedings/visual/1994/6627/0",
"title": "Proceedings Visualization '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2012/09/ttk2012091711",
"title": "Using Graphics Processors for High Performance SimRank Computation",
"doi": null,
"abstractUrl": "/journal/tk/2012/09/ttk2012091711/13rRUNvgz4L",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2012/03/mcs2012030010",
"title": "Computational Fluid Dynamics Simulations Using Many Graphics Processors",
"doi": null,
"abstractUrl": "/magazine/cs/2012/03/mcs2012030010/13rRUxASuls",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2014/05/mcs2014050044",
"title": "Scientific Discovery in Fusion Plasma Turbulence Simulations at Extreme Scale",
"doi": null,
"abstractUrl": "/magazine/cs/2014/05/mcs2014050044/13rRUxEhFwl",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122169",
"title": "Turbulence Visualization at the Terascale on Desktop PCs",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122169/13rRUxly8SU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1993/4340/0/01263475",
"title": "Multi-CPU plasma fluid turbulence calculations on a CRAY Y-MP C90",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1993/01263475/1D85rCCVZJe",
"parentPublication": {
"id": "proceedings/sc/1993/4340/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcs2009020045",
"articleId": "13rRUzphDtV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcs2009020060",
"articleId": "13rRUy0ZzWf",
"__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.