data
dict |
|---|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1GZonrUVzqg",
"doi": "10.1109/TVCG.2022.3209409",
"abstract": "Interaction is increasingly integrating into data stories to support data exploration and explanation. Interaction can also be combined with the narrative device, breaking the fourth wall (BTFW), to build a deeper connection between readers and data stories. BTFW interaction directly addresses readers by requiring their input. Such user input is then integrated into the narrative or visuals of data stories to encourage readers to inspect the stories more closely. In this work, we explore the design patterns of BTFW interaction commonly used in data stories. Six design patterns were identified through the analysis of 58 high-quality data stories collected from a range of online sources. Specifically, the data stories were categorized using a coding framework, including the input of BTFW interaction provided by readers and the output of BTFW interaction generated by data stories to respond to the input. To explore the benefits as well as concerns of using BTFW interaction, we conducted a three-session user study including the reading, interview, and recall sessions. The results of our user study suggested that BTFW interaction has a positive impact on self-story connection, user engagement, and information recall. We also discussed design implications to address the possible negative effects on the interactivity-comprehensibility balance, information privacy, and the learning curve of interaction brought by BTFW interaction.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Interaction is increasingly integrating into data stories to support data exploration and explanation. Interaction can also be combined with the narrative device, breaking the fourth wall (BTFW), to build a deeper connection between readers and data stories. BTFW interaction directly addresses readers by requiring their input. Such user input is then integrated into the narrative or visuals of data stories to encourage readers to inspect the stories more closely. In this work, we explore the design patterns of BTFW interaction commonly used in data stories. Six design patterns were identified through the analysis of 58 high-quality data stories collected from a range of online sources. Specifically, the data stories were categorized using a coding framework, including the input of BTFW interaction provided by readers and the output of BTFW interaction generated by data stories to respond to the input. To explore the benefits as well as concerns of using BTFW interaction, we conducted a three-session user study including the reading, interview, and recall sessions. The results of our user study suggested that BTFW interaction has a positive impact on self-story connection, user engagement, and information recall. We also discussed design implications to address the possible negative effects on the interactivity-comprehensibility balance, information privacy, and the learning curve of interaction brought by BTFW interaction.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Interaction is increasingly integrating into data stories to support data exploration and explanation. Interaction can also be combined with the narrative device, breaking the fourth wall (BTFW), to build a deeper connection between readers and data stories. BTFW interaction directly addresses readers by requiring their input. Such user input is then integrated into the narrative or visuals of data stories to encourage readers to inspect the stories more closely. In this work, we explore the design patterns of BTFW interaction commonly used in data stories. Six design patterns were identified through the analysis of 58 high-quality data stories collected from a range of online sources. Specifically, the data stories were categorized using a coding framework, including the input of BTFW interaction provided by readers and the output of BTFW interaction generated by data stories to respond to the input. To explore the benefits as well as concerns of using BTFW interaction, we conducted a three-session user study including the reading, interview, and recall sessions. The results of our user study suggested that BTFW interaction has a positive impact on self-story connection, user engagement, and information recall. We also discussed design implications to address the possible negative effects on the interactivity-comprehensibility balance, information privacy, and the learning curve of interaction brought by BTFW interaction.",
"title": "Breaking the Fourth Wall of Data Stories through Interaction",
"normalizedTitle": "Breaking the Fourth Wall of Data Stories through Interaction",
"fno": "09903557",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Aided Instruction",
"Computer Games",
"Data Privacy",
"Data Visualisation",
"Human Computer Interaction",
"Human Factors",
"Interactive Systems",
"User Interfaces",
"BTFW Interaction",
"Data Exploration",
"High Quality Data Stories",
"Data Visualization",
"Interviews",
"Visualization",
"Task Analysis",
"Navigation",
"Taxonomy",
"TV",
"Interaction",
"Data Driven Storytelling",
"Narrative Devices"
],
"authors": [
{
"givenName": "Yang",
"surname": "Shi",
"fullName": "Yang Shi",
"affiliation": "Intelligent Big Data Visualization Lab, Tongji University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tian",
"surname": "Gao",
"fullName": "Tian Gao",
"affiliation": "Intelligent Big Data Visualization Lab, Tongji University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaohan",
"surname": "Jiao",
"fullName": "Xiaohan Jiao",
"affiliation": "Intelligent Big Data Visualization Lab, Tongji University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nan",
"surname": "Cao",
"fullName": "Nan Cao",
"affiliation": "Intelligent Big Data Visualization Lab, Tongji University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "972-982",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2016/8942/0/8942a203",
"title": "Promoting Insight: A Case Study of How to Incorporate Interaction in Existing Data Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2016/8942a203/12OmNx7G68T",
"parentPublication": {
"id": "proceedings/iv/2016/8942/0",
"title": "2016 20th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2017/0831/0/0831a176",
"title": "Acceptance and Usability of Interactive Infographics in Online Newspapers",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2017/0831a176/12OmNx8fihf",
"parentPublication": {
"id": "proceedings/iv/2017/0831/0",
"title": "2017 21st International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2014/2504/0/2504a422",
"title": "Transitions: A Crossmedia Interaction Relevant Aspect",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2014/2504a422/12OmNxX3utJ",
"parentPublication": {
"id": "proceedings/hicss/2014/2504/0",
"title": "2014 47th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2015/1727/0/07223453",
"title": "Hearts and minds: The interrogations project",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2015/07223453/12OmNy5R3D6",
"parentPublication": {
"id": "proceedings/vr/2015/1727/0",
"title": "2015 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061139",
"title": "Narrative Visualization: Telling Stories with Data",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061139/13rRUxAAST1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/beliv/2018/6884/0/08634072",
"title": "A Micro-Phenomenological Lens for Evaluating Narrative Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/beliv/2018/08634072/17D45VsBTXI",
"parentPublication": {
"id": "proceedings/beliv/2018/6884/0",
"title": "2018 IEEE Evaluation and Beyond - Methodological Approaches for Visualization (BELIV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlhcc/2018/4235/0/08506520",
"title": "BONNIE: Building Online Narratives from Noteworthy Interaction Events",
"doi": null,
"abstractUrl": "/proceedings-article/vlhcc/2018/08506520/17D45XeKgqe",
"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/pacificvis/2019/9226/0/922600a237",
"title": "Designing Narrative Slideshows for Learning Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2019/922600a237/1cMF6FsJ8zK",
"parentPublication": {
"id": "proceedings/pacificvis/2019/9226/0",
"title": "2019 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552240",
"title": "Kineticharts: Augmenting Affective Expressiveness of Charts in Data Stories with Animation Design",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552240/1xic12y0QJG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552203",
"title": "A Design Space for Applying the Freytag's Pyramid Structure to Data Stories",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552203/1xic2a0UxkA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09903338",
"articleId": "1GZojZ9otHO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09903555",
"articleId": "1GZonJBJC1y",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrIaecw",
"title": "Jan.-March",
"year": "2020",
"issueNum": "01",
"idPrefix": "mu",
"pubType": "magazine",
"volume": "27",
"label": "Jan.-March",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1iFLJoSyvPq",
"doi": "10.1109/MMUL.2019.2908624",
"abstract": "We introduce the color ratio concept and treat the challenge of automatically analyzing the color and width/height proportion ratios in the recognized paintings. The first time the authors, by using the computer simulations, show that majority of paintings having both proportions, the color and width/height proportion ratios are less than the Golden ratio (GR) and larger than the Aesthetic ratio. The method of color modeling is described by using color proportions similar to ratios in the Golden triangle. New methods of color modeling are presented that are based on the ratio of the well-known paintings, such as the Aivazovsky and Da Vinci coloring models. We also use the GR to generate new color models that may help to produce color images from grayscale images. Examples of processing images of art prominent painting are given, and the mean color ratio and mean of width/height proportions over 441 works of 13 artists.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We introduce the color ratio concept and treat the challenge of automatically analyzing the color and width/height proportion ratios in the recognized paintings. The first time the authors, by using the computer simulations, show that majority of paintings having both proportions, the color and width/height proportion ratios are less than the Golden ratio (GR) and larger than the Aesthetic ratio. The method of color modeling is described by using color proportions similar to ratios in the Golden triangle. New methods of color modeling are presented that are based on the ratio of the well-known paintings, such as the Aivazovsky and Da Vinci coloring models. We also use the GR to generate new color models that may help to produce color images from grayscale images. Examples of processing images of art prominent painting are given, and the mean color ratio and mean of width/height proportions over 441 works of 13 artists.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We introduce the color ratio concept and treat the challenge of automatically analyzing the color and width/height proportion ratios in the recognized paintings. The first time the authors, by using the computer simulations, show that majority of paintings having both proportions, the color and width/height proportion ratios are less than the Golden ratio (GR) and larger than the Aesthetic ratio. The method of color modeling is described by using color proportions similar to ratios in the Golden triangle. New methods of color modeling are presented that are based on the ratio of the well-known paintings, such as the Aivazovsky and Da Vinci coloring models. We also use the GR to generate new color models that may help to produce color images from grayscale images. Examples of processing images of art prominent painting are given, and the mean color ratio and mean of width/height proportions over 441 works of 13 artists.",
"title": "Evidence of Golden and Aesthetic Proportions in Colors of Paintings of the Prominent Artists",
"normalizedTitle": "Evidence of Golden and Aesthetic Proportions in Colors of Paintings of the Prominent Artists",
"fno": "08678387",
"hasPdf": true,
"idPrefix": "mu",
"keywords": [
"Art",
"Image Colour Analysis",
"Color Images",
"Color Models",
"Well Known Paintings",
"Golden Triangle",
"Color Proportions",
"Color Modeling",
"Aesthetic Ratio",
"Golden Ratio",
"Recognized Paintings",
"Color Ratio Concept",
"Mean Color Ratio",
"Art Prominent Painting",
"Image Color Analysis",
"Painting",
"Color",
"Art",
"Computational Modeling",
"Gray Scale",
"Visualization",
"Arts",
"Golden Ratio",
"Color",
"Representation",
"Image Processing",
"Visualization",
"Models Of Coloring"
],
"authors": [
{
"givenName": "Artyom M.",
"surname": "Grigoryan",
"fullName": "Artyom M. Grigoryan",
"affiliation": "Department of Electrical and Computer EngineeringThe University of Texas at San Antonio",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sos S.",
"surname": "Agaian",
"fullName": "Sos S. Agaian",
"affiliation": "Computer Science DepartmentCollege of Staten IslandCity University of New York/CSI",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "mags",
"pages": "8-16",
"year": "2020",
"issn": "1070-986X",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icm/2011/4522/1/4522a375",
"title": "Learning to Recognize the Art Style of Paintings Using Multi-cues",
"doi": null,
"abstractUrl": "/proceedings-article/icm/2011/4522a375/12OmNBU1jLy",
"parentPublication": {
"id": "icm/2011/4522/1",
"title": "Information Technology, Computer Engineering and Management Sciences, International Conference of",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2017/4283/0/4283a179",
"title": "Classification and Aesthetic Evaluation of Paintings and Artworks",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2017/4283a179/12OmNrMHOnl",
"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/icme/2004/8603/2/01394378",
"title": "Representation and retrieval of paintings based on art history concepts",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2004/01394378/12OmNrMZpEl",
"parentPublication": {
"id": "proceedings/icme/2004/8603/2",
"title": "2004 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851f240",
"title": "Recognizing Emotions from Abstract Paintings Using Non-Linear Matrix Completion",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851f240/12OmNvonILZ",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1994/6627/0/00346317",
"title": "Restorer: a visualization technique for handling missing data",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1994/00346317/12OmNwErpVf",
"parentPublication": {
"id": "proceedings/visual/1994/6627/0",
"title": "Proceedings Visualization '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis/2014/4860/0/06912134",
"title": "Automatically generating abstract paintings in Malevich Style",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2014/06912134/12OmNyGbIba",
"parentPublication": {
"id": "proceedings/icis/2014/4860/0",
"title": "2014 IEEE/ACIS 13th International Conference on Computer and Information Science (ICIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/06/07911336",
"title": "Color Orchestra: Ordering Color Palettes for Interpolation and Prediction",
"doi": null,
"abstractUrl": "/journal/tg/2018/06/07911336/13rRUxASu0R",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/12/08113507",
"title": "Animated Construction of Chinese Brush Paintings",
"doi": null,
"abstractUrl": "/journal/tg/2018/12/08113507/14H4WNjKxTa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2018/9385/0/938500a651",
"title": "Path Opening for Hyperspectral Crack Detection of Cultural Heritage Paintings",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2018/938500a651/19RSs6pULhm",
"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/cvidl/2020/9481/0/948100a305",
"title": "The Establishment of Color Proportion and Color Schemes Database of Shaanxi Fengxiang Wood Engraving New Year Painting",
"doi": null,
"abstractUrl": "/proceedings-article/cvidl/2020/948100a305/1pbecuhmhBC",
"parentPublication": {
"id": "proceedings/cvidl/2020/9481/0",
"title": "2020 International Conference on Computer Vision, Image and Deep Learning (CVIDL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09049289",
"articleId": "1ixt3PjuLcY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08889397",
"articleId": "1ezPlyZdxeM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvDqsVX",
"title": "Sept.",
"year": "2018",
"issueNum": "09",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwI5TR6",
"doi": "10.1109/TVCG.2017.2759265",
"abstract": "A narrative collage is an interesting image editing method for summarizing the main theme or storyline behind an image collection. We present a novel method to generate narrative images with plausible semantic scene structures. To achieve this goal, we introduce a layer graph and a scene graph to represent the relative depth order and semantic relationship between image objects, respectively. We first cluster the input image collection to select representative images, and then we extract a group of semantic salient objects from each representative image. Both layer graphs and scene graphs are constructed and combined according to our specific rules for reorganizing the extracted objects in every image. We design an energy model to appropriately locate every object on the final canvas. The experimental results show that our method can produce competitive narrative collage results and that it performs well on a wide range of image collections.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A narrative collage is an interesting image editing method for summarizing the main theme or storyline behind an image collection. We present a novel method to generate narrative images with plausible semantic scene structures. To achieve this goal, we introduce a layer graph and a scene graph to represent the relative depth order and semantic relationship between image objects, respectively. We first cluster the input image collection to select representative images, and then we extract a group of semantic salient objects from each representative image. Both layer graphs and scene graphs are constructed and combined according to our specific rules for reorganizing the extracted objects in every image. We design an energy model to appropriately locate every object on the final canvas. The experimental results show that our method can produce competitive narrative collage results and that it performs well on a wide range of image collections.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A narrative collage is an interesting image editing method for summarizing the main theme or storyline behind an image collection. We present a novel method to generate narrative images with plausible semantic scene structures. To achieve this goal, we introduce a layer graph and a scene graph to represent the relative depth order and semantic relationship between image objects, respectively. We first cluster the input image collection to select representative images, and then we extract a group of semantic salient objects from each representative image. Both layer graphs and scene graphs are constructed and combined according to our specific rules for reorganizing the extracted objects in every image. We design an energy model to appropriately locate every object on the final canvas. The experimental results show that our method can produce competitive narrative collage results and that it performs well on a wide range of image collections.",
"title": "Narrative Collage of Image Collections by Scene Graph Recombination",
"normalizedTitle": "Narrative Collage of Image Collections by Scene Graph Recombination",
"fno": "08057796",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Semantics",
"Visualization",
"Image Segmentation",
"Painting",
"Layout",
"Databases",
"Image Generation",
"Narrative Collage",
"Image Collections",
"Image Segmentation",
"Scene Graphs",
"Image Synthesis"
],
"authors": [
{
"givenName": "Fei",
"surname": "Fang",
"fullName": "Fei Fang",
"affiliation": "State Key Lab of Software Engineering, School of Computer, Wuhan University, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Miao",
"surname": "Yi",
"fullName": "Miao Yi",
"affiliation": "School of Mathematics and Statistics, Wuhan University, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hui",
"surname": "Feng",
"fullName": "Hui Feng",
"affiliation": "School of Mathematics and Statistics, Wuhan University, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shenghong",
"surname": "Hu",
"fullName": "Shenghong Hu",
"affiliation": "State Key Lab of Software Engineering, Wuhan University, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chunxia",
"surname": "Xiao",
"fullName": "Chunxia Xiao",
"affiliation": "State Key Lab of Software Engineering, School of Computer, Wuhan University, Wuhan, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2018-09-01 00:00:00",
"pubType": "trans",
"pages": "2559-2572",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icip/1997/8183/2/81832306",
"title": "Extension of the collage theorem",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1997/81832306/12OmNAmE613",
"parentPublication": {
"id": "proceedings/icip/1997/8183/2",
"title": "Proceedings of International Conference on Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2013/2840/0/2840d048",
"title": "Scene Collaging: Analysis and Synthesis of Natural Images with Semantic Layers",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2013/2840d048/12OmNqzcvIt",
"parentPublication": {
"id": "proceedings/iccv/2013/2840/0",
"title": "2013 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2013/2246/0/2246a214",
"title": "Designing Narrative Interface with a Function of Narrative Generation",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2013/2246a214/12OmNsdo6u8",
"parentPublication": {
"id": "proceedings/cw/2013/2246/0",
"title": "2013 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2018/2335/0/233501a788",
"title": "Fast Face and Saliency Aware Collage Creation for Mobile Phones",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2018/233501a788/12OmNwDj0Zc",
"parentPublication": {
"id": "proceedings/fg/2018/2335/0",
"title": "2018 13th IEEE International Conference on Automatic Face & Gesture Recognition (FG 2018)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/02/ttg2014020182",
"title": "Content-Aware Photo Collage Using Circle Packing",
"doi": null,
"abstractUrl": "/journal/tg/2014/02/ttg2014020182/13rRUwjGoLF",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200b344",
"title": "Panoptic Narrative Grounding",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200b344/1BmHdPqdGUM",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600d719",
"title": "SoftCollage: A Differentiable Probabilistic Tree Generator for Image Collage",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600d719/1H0NizTiNUI",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800f212",
"title": "Semantic Image Manipulation Using Scene Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800f212/1m3ndHyh4oE",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/02/09540348",
"title": "Balance-Aware Grid Collage for Small Image Collections",
"doi": null,
"abstractUrl": "/journal/tg/2023/02/09540348/1wWCehU44hi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900j338",
"title": "Semantic Palette: Guiding Scene Generation with Class Proportions",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900j338/1yeJbBelsbe",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08031987",
"articleId": "13rRUxC0SWg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08025425",
"articleId": "13rRUxlgxTt",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgGl",
"name": "ttg201809-08057796s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201809-08057796s1.zip",
"extension": "zip",
"size": "9.41 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyQphh4",
"title": "Aug.",
"year": "2018",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBrGh8",
"doi": "10.1109/TVCG.2017.2705189",
"abstract": "Star Coordinates are a popular projection technique in order to analyze and to disclose characteristic patterns of multidimensional data. Unfortunately, the shape, appearance, and distribution of such patterns are strongly affected by the given scaling of the data and can mislead the projection-based data analysis. In an extreme case, patterns might be more related to the choice of scaling than to the data themselves. Thus, we present the LloydRelaxer : a tool to minimize scaling-based effects in Star Coordinates. Our algorithm enforces a scaling configuration for which the data explains the observed patterns better than any scaling of them could do. It does so by an iterative minimizing and optimization process based on Voronoi diagrams and on the Lloyd relaxation within the projection space. We evaluate and test our approach by real benchmark multidimensional data of the UCI data repository.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Star Coordinates are a popular projection technique in order to analyze and to disclose characteristic patterns of multidimensional data. Unfortunately, the shape, appearance, and distribution of such patterns are strongly affected by the given scaling of the data and can mislead the projection-based data analysis. In an extreme case, patterns might be more related to the choice of scaling than to the data themselves. Thus, we present the LloydRelaxer : a tool to minimize scaling-based effects in Star Coordinates. Our algorithm enforces a scaling configuration for which the data explains the observed patterns better than any scaling of them could do. It does so by an iterative minimizing and optimization process based on Voronoi diagrams and on the Lloyd relaxation within the projection space. We evaluate and test our approach by real benchmark multidimensional data of the UCI data repository.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Star Coordinates are a popular projection technique in order to analyze and to disclose characteristic patterns of multidimensional data. Unfortunately, the shape, appearance, and distribution of such patterns are strongly affected by the given scaling of the data and can mislead the projection-based data analysis. In an extreme case, patterns might be more related to the choice of scaling than to the data themselves. Thus, we present the LloydRelaxer : a tool to minimize scaling-based effects in Star Coordinates. Our algorithm enforces a scaling configuration for which the data explains the observed patterns better than any scaling of them could do. It does so by an iterative minimizing and optimization process based on Voronoi diagrams and on the Lloyd relaxation within the projection space. We evaluate and test our approach by real benchmark multidimensional data of the UCI data repository.",
"title": "The LloydRelaxer: An Approach to Minimize Scaling Effects for Multivariate Projections",
"normalizedTitle": "The LloydRelaxer: An Approach to Minimize Scaling Effects for Multivariate Projections",
"fno": "07930525",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Two Dimensional Displays",
"Temperature Measurement",
"Data Visualization",
"Computational Geometry",
"Standards",
"Tools",
"Optimization",
"Information Visualization",
"Multidimensional Data",
"Scaling",
"Star Coordinates",
"Projections"
],
"authors": [
{
"givenName": "Dirk J.",
"surname": "Lehmann",
"fullName": "Dirk J. Lehmann",
"affiliation": "Rey Juan Carlos University of Madrid, Madrid, Spain",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Holger",
"surname": "Theisel",
"fullName": "Holger Theisel",
"affiliation": "University of Magdeburg, Magdeburg, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2018-08-01 00:00:00",
"pubType": "trans",
"pages": "2424-2439",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vast/2012/4752/0/06400490",
"title": "Visual pattern discovery using random projections",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2012/06400490/12OmNBh8gRI",
"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/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/sibgrapi/2013/5099/0/5099a107",
"title": "Multidimensional Projections to Explore Time-Varying Multivariate Volume Data",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2013/5099a107/12OmNrkT7Pm",
"parentPublication": {
"id": "proceedings/sibgrapi/2013/5099/0",
"title": "2013 XXVI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2016/3568/0/3568a297",
"title": "Understanding Attribute Variability in Multidimensional Projections",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2016/3568a297/12OmNxxdZLn",
"parentPublication": {
"id": "proceedings/sibgrapi/2016/3568/0",
"title": "2016 29th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/09/08047300",
"title": "Cluster-Based Visual Abstraction for Multivariate Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2018/09/08047300/13rRUILLkvy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/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"
},
{
"id": "trans/tg/2019/01/08440845",
"title": "Shape-preserving Star Coordinates",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440845/17D45WYQJ9Z",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ism/2018/6857/0/685700a127",
"title": "Geometry-Based Motion Vector Scaling for Omnidirectional Video Coding",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2018/685700a127/17D45WrVfZp",
"parentPublication": {
"id": "proceedings/ism/2018/6857/0",
"title": "2018 IEEE International Symposium on Multimedia (ISM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2020/9998/0/999800a383",
"title": "SCALANA: Automating Scaling Loss Detection with Graph Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2020/999800a383/1oeOShKJBeM",
"parentPublication": {
"id": "proceedings/sc/2020/9998/0/",
"title": "2020 SC20: International Conference for High Performance Computing, Networking, Storage and Analysis (SC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/09/09393612",
"title": "Structure of Multiple Mirror System From Kaleidoscopic Projections of Single 3D Point",
"doi": null,
"abstractUrl": "/journal/tp/2022/09/09393612/1srMAfD4SQw",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07964760",
"articleId": "13rRUxDqS8p",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07959130",
"articleId": "13rRUwbs1Sy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRMJ",
"name": "ttg201808-07930525s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201808-07930525s1.zip",
"extension": "zip",
"size": "40.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1Ax5KStiZmU",
"title": "March",
"year": "2022",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1mP2AYgyLQY",
"doi": "10.1109/TVCG.2020.3021534",
"abstract": "Egocentric augmented reality (AR) interfaces are quickly becoming a key asset for assisting high precision activities in the peripersonal space in several application fields. In these applications, accurate and robust registration of computer-generated information to the real scene is hard to achieve with traditional Optical See-Through (OST) displays given that it relies on the accurate calibration of the combined eye-display projection model. The calibration is required to efficiently estimate the projection parameters of the pinhole model that encapsulate the optical features of the display and whose values vary according to the position of the user’s eye. In this article, we describe an approach that prevents any parallax-related AR misregistration at a pre-defined working distance in OST displays with infinity focus; our strategy relies on the use of a magnifier placed in front of the OST display, and features a proper parameterization of the virtual rendering camera achieved through a dedicated calibration procedure that accounts for the contribution of the magnifier. We model the registration error due to the viewpoint parallax outside the ideal working distance. Finally, we validate our strategy on a OST display, and we show that sub-millimetric registration accuracy can be achieved for working distances of <inline-formula><tex-math notation=\"LaTeX\">Z_$\\pm 100$_Z</tex-math></inline-formula> mm around the focal length of the magnifier.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Egocentric augmented reality (AR) interfaces are quickly becoming a key asset for assisting high precision activities in the peripersonal space in several application fields. In these applications, accurate and robust registration of computer-generated information to the real scene is hard to achieve with traditional Optical See-Through (OST) displays given that it relies on the accurate calibration of the combined eye-display projection model. The calibration is required to efficiently estimate the projection parameters of the pinhole model that encapsulate the optical features of the display and whose values vary according to the position of the user’s eye. In this article, we describe an approach that prevents any parallax-related AR misregistration at a pre-defined working distance in OST displays with infinity focus; our strategy relies on the use of a magnifier placed in front of the OST display, and features a proper parameterization of the virtual rendering camera achieved through a dedicated calibration procedure that accounts for the contribution of the magnifier. We model the registration error due to the viewpoint parallax outside the ideal working distance. Finally, we validate our strategy on a OST display, and we show that sub-millimetric registration accuracy can be achieved for working distances of <inline-formula><tex-math notation=\"LaTeX\">$\\pm 100$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>±</mml:mo><mml:mn>100</mml:mn></mml:mrow></mml:math><inline-graphic xlink:href=\"ferrari-ieq1-3021534.gif\"/></alternatives></inline-formula> mm around the focal length of the magnifier.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Egocentric augmented reality (AR) interfaces are quickly becoming a key asset for assisting high precision activities in the peripersonal space in several application fields. In these applications, accurate and robust registration of computer-generated information to the real scene is hard to achieve with traditional Optical See-Through (OST) displays given that it relies on the accurate calibration of the combined eye-display projection model. The calibration is required to efficiently estimate the projection parameters of the pinhole model that encapsulate the optical features of the display and whose values vary according to the position of the user’s eye. In this article, we describe an approach that prevents any parallax-related AR misregistration at a pre-defined working distance in OST displays with infinity focus; our strategy relies on the use of a magnifier placed in front of the OST display, and features a proper parameterization of the virtual rendering camera achieved through a dedicated calibration procedure that accounts for the contribution of the magnifier. We model the registration error due to the viewpoint parallax outside the ideal working distance. Finally, we validate our strategy on a OST display, and we show that sub-millimetric registration accuracy can be achieved for working distances of - mm around the focal length of the magnifier.",
"title": "Parallax Free Registration for Augmented Reality Optical See-Through Displays in the Peripersonal Space",
"normalizedTitle": "Parallax Free Registration for Augmented Reality Optical See-Through Displays in the Peripersonal Space",
"fno": "09186170",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Augmented Reality",
"Calibration",
"Cameras",
"Image Registration",
"Rendering Computer Graphics",
"Parallax Free Registration",
"Peripersonal Space",
"Egocentric Augmented Reality Interfaces",
"Computer Generated Information",
"Combined Eye Display Projection Model",
"Pinhole Model",
"OST Display",
"Dedicated Calibration Procedure",
"Viewpoint Parallax",
"Augmented Reality Optical See Through Displays",
"Sub Millimetric Registration",
"Adaptive Optics",
"Optical Imaging",
"Microdisplays",
"Cameras",
"Calibration",
"Stimulated Emission",
"Augmented Reality",
"Optical See Through",
"Registration"
],
"authors": [
{
"givenName": "Vincenzo",
"surname": "Ferrari",
"fullName": "Vincenzo Ferrari",
"affiliation": "Information Engineering Department, University of Pisa, Pisa, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nadia",
"surname": "Cattari",
"fullName": "Nadia Cattari",
"affiliation": "Department of Translational Research and New Technologies in Medicine and Surgery, University of Pisa, Pisa, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Umberto",
"surname": "Fontana",
"fullName": "Umberto Fontana",
"affiliation": "Information Engineering Department, University of Pisa, Pisa, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fabrizio",
"surname": "Cutolo",
"fullName": "Fabrizio Cutolo",
"affiliation": "Information Engineering Department, University of Pisa, Pisa, Italy",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2022-03-01 00:00:00",
"pubType": "trans",
"pages": "1608-1618",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ismar/2014/6184/0/06948513",
"title": "Google glass, The META and Co. How to calibrate optical see-through head mounted displays",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2014/06948513/12OmNB8TUim",
"parentPublication": {
"id": "proceedings/ismar/2014/6184/0",
"title": "2014 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2016/0836/0/07504739",
"title": "Evaluation of hand and stylus based calibration for optical see-through head-mounted displays using leap motion",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2016/07504739/12OmNxE2mZD",
"parentPublication": {
"id": "proceedings/vr/2016/0836/0",
"title": "2016 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2014/2871/0/06802089",
"title": "Quantification of error from system and environmental sources in Optical See-Through head mounted display calibration methods",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2014/06802089/12OmNxwncbX",
"parentPublication": {
"id": "proceedings/vr/2014/2871/0",
"title": "2014 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2015/1727/0/07223385",
"title": "Continuous automatic calibration for optical see-through displays",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2015/07223385/12OmNynJMQZ",
"parentPublication": {
"id": "proceedings/vr/2015/1727/0",
"title": "2015 IEEE Virtual Reality (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/2015/04/07064856",
"title": "Light-Field Correction for Spatial Calibration of Optical See-Through Head-Mounted Displays",
"doi": null,
"abstractUrl": "/journal/tg/2015/04/07064856/13rRUwjGoG5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/11/07523375",
"title": "Gaussian Light Field: Estimation of Viewpoint-Dependent Blur for Optical See-Through Head-Mounted Displays",
"doi": null,
"abstractUrl": "/journal/tg/2016/11/07523375/13rRUxYINfi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2018/7459/0/745900a021",
"title": "Impact of Alignment Point Distance and Posture on SPAAM Calibration of Optical See-Through Head-Mounted Displays",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2018/745900a021/17D45WaTkli",
"parentPublication": {
"id": "proceedings/ismar/2018/7459/0",
"title": "2018 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/05/08676155",
"title": "Varifocal Occlusion for Optical See-Through Head-Mounted Displays using a Slide Occlusion Mask",
"doi": null,
"abstractUrl": "/journal/tg/2019/05/08676155/18LFfGhc49i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/07/09253561",
"title": "AR-Loupe: Magnified Augmented Reality by Combining an Optical See-Through Head-Mounted Display and a Loupe",
"doi": null,
"abstractUrl": "/journal/tg/2022/07/09253561/1oDXHeBJHNe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09178477",
"articleId": "1mCjGPHfbZS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09173828",
"articleId": "1mtsbpUceNG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Ax5NQwtfqw",
"name": "ttg202203-09186170s1-supp1-3021534.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202203-09186170s1-supp1-3021534.mp4",
"extension": "mp4",
"size": "250 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": "1IIYdPVtZv2",
"doi": "10.1109/TKDE.2022.3224052",
"abstract": "In this paper, we develop a new alternating projection method to compute nonnegative low rank matrix approximation for nonnegative matrices. In the nonnegative low rank matrix approximation method, the projection onto the manifold of fixed rank matrices can be expensive as the singular value decomposition is required. We propose to use the tangent space of the point in the manifold to approximate the projection onto the manifold in order to reduce the computational cost. We show that the sequence generated by the alternating projections onto the tangent spaces of the fixed rank matrices manifold and the nonnegative matrix manifold, converge linearly to a point in the intersection of the two manifolds where the convergent point is sufficiently close to optimal solutions. This convergence result based inexact projection onto the manifold is new and is not studied in the literature. Numerical examples in data clustering, pattern recognition and hyperspectral data analysis are given to demonstrate that the performance of the proposed method is better than that of nonnegative matrix factorization methods in terms of computational time and accuracy.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we develop a new alternating projection method to compute nonnegative low rank matrix approximation for nonnegative matrices. In the nonnegative low rank matrix approximation method, the projection onto the manifold of fixed rank matrices can be expensive as the singular value decomposition is required. We propose to use the tangent space of the point in the manifold to approximate the projection onto the manifold in order to reduce the computational cost. We show that the sequence generated by the alternating projections onto the tangent spaces of the fixed rank matrices manifold and the nonnegative matrix manifold, converge linearly to a point in the intersection of the two manifolds where the convergent point is sufficiently close to optimal solutions. This convergence result based inexact projection onto the manifold is new and is not studied in the literature. Numerical examples in data clustering, pattern recognition and hyperspectral data analysis are given to demonstrate that the performance of the proposed method is better than that of nonnegative matrix factorization methods in terms of computational time and accuracy.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we develop a new alternating projection method to compute nonnegative low rank matrix approximation for nonnegative matrices. In the nonnegative low rank matrix approximation method, the projection onto the manifold of fixed rank matrices can be expensive as the singular value decomposition is required. We propose to use the tangent space of the point in the manifold to approximate the projection onto the manifold in order to reduce the computational cost. We show that the sequence generated by the alternating projections onto the tangent spaces of the fixed rank matrices manifold and the nonnegative matrix manifold, converge linearly to a point in the intersection of the two manifolds where the convergent point is sufficiently close to optimal solutions. This convergence result based inexact projection onto the manifold is new and is not studied in the literature. Numerical examples in data clustering, pattern recognition and hyperspectral data analysis are given to demonstrate that the performance of the proposed method is better than that of nonnegative matrix factorization methods in terms of computational time and accuracy.",
"title": "Tangent Space Based Alternating Projections for Nonnegative Low Rank Matrix Approximation",
"normalizedTitle": "Tangent Space Based Alternating Projections for Nonnegative Low Rank Matrix Approximation",
"fno": "09966832",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Manifolds",
"Matrix Decomposition",
"Computational Efficiency",
"Convergence",
"Singular Value Decomposition",
"Hyperspectral Imaging",
"Data Analysis",
"Alternating Projection Method",
"Manifolds",
"Tangent Spaces",
"Nonnegative Matrices",
"Low Rank",
"Nonnegativity"
],
"authors": [
{
"givenName": "Guangjing",
"surname": "Song",
"fullName": "Guangjing Song",
"affiliation": "School of Mathematics and Information Sciences, Weifang University, Weifang, P.R. China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael K.",
"surname": "Ng",
"fullName": "Michael K. Ng",
"affiliation": "Department of Mathematics, The University of Hong Kong, Pokfulam, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tai-Xiang",
"surname": "Jiang",
"fullName": "Tai-Xiang Jiang",
"affiliation": "School of Computing and Artificial Intelligence, Southwestern University of Finance and Economics, Chengdu, Sichuan, P.R.China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-11-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/iccis/2013/5004/0/5004a903",
"title": "The Rank Factorization for Central Extended Matrix",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2013/5004a903/12OmNBpEeYC",
"parentPublication": {
"id": "proceedings/iccis/2013/5004/0",
"title": "2013 International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2014/4302/0/4302b103",
"title": "Multi-view Clustering via Multi-manifold Regularized Nonnegative Matrix Factorization",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2014/4302b103/12OmNqBtiY8",
"parentPublication": {
"id": "proceedings/icdm/2014/4302/0",
"title": "2014 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209a744",
"title": "Ensemble Manifold Structured Low Rank Approximation for Data Representation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209a744/12OmNqEjhWS",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209e654",
"title": "Person Re-identification Based on Relaxed Nonnegative Matrix Factorization with Regularizations",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209e654/12OmNwkR5CE",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2010/01/ttp2010010045",
"title": "Convex and Semi-Nonnegative Matrix Factorizations",
"doi": null,
"abstractUrl": "/journal/tp/2010/01/ttp2010010045/13rRUyYBlhK",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2013/07/ttp2013071717",
"title": "Low-Rank Matrix Approximation with Manifold Regularization",
"doi": null,
"abstractUrl": "/journal/tp/2013/07/ttp2013071717/13rRUyYBlhN",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2019/12/08506381",
"title": "Unsupervised Nonnegative Adaptive Feature Extraction for Data Representation",
"doi": null,
"abstractUrl": "/journal/tk/2019/12/08506381/14DL8UT5aBq",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2022/0915/0/9.15E73",
"title": "Nonnegative Low-Rank Tensor Completion via Dual Formulation with Applications to Image and Video Completion",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2022/9.15E73/1B13QoBOsCs",
"parentPublication": {
"id": "proceedings/wacv/2022/0915/0",
"title": "2022 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2021/05/08913485",
"title": "Generalized Separable Nonnegative Matrix Factorization",
"doi": null,
"abstractUrl": "/journal/tp/2021/05/08913485/1fh36IQ411u",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412242",
"title": "Low Rank Representation on Product Grassmann Manifolds for Multi-view Subspace Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412242/1tmikTAVIYM",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09966665",
"articleId": "1IIYdG1Nehy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09969140",
"articleId": "1IMhYQPtv56",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1IKD6fApaKs",
"name": "ttk555501-09966832s1-supp1-3224052.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttk555501-09966832s1-supp1-3224052.pdf",
"extension": "pdf",
"size": "981 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwudQUj",
"title": "March",
"year": "2014",
"issueNum": "03",
"idPrefix": "tp",
"pubType": "journal",
"volume": "36",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxC0SPN",
"doi": "10.1109/TPAMI.2013.147",
"abstract": "We develop a continuous framework for the analysis of 4D light fields, and describe novel variational methods for disparity reconstruction as well as spatial and angular super-resolution. Disparity maps are estimated locally using epipolar plane image analysis without the need for expensive matching cost minimization. The method works fast and with inherent subpixel accuracy since no discretization of the disparity space is necessary. In a variational framework, we employ the disparity maps to generate super-resolved novel views of a scene, which corresponds to increasing the sampling rate of the 4D light field in spatial as well as angular direction. In contrast to previous work, we formulate the problem of view synthesis as a continuous inverse problem, which allows us to correctly take into account foreshortening effects caused by scene geometry transformations. All optimization problems are solved with state-of-the-art convex relaxation techniques. We test our algorithms on a number of real-world examples as well as our new benchmark data set for light fields, and compare results to a multiview stereo method. The proposed method is both faster as well as more accurate. Data sets and source code are provided online for additional evaluation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We develop a continuous framework for the analysis of 4D light fields, and describe novel variational methods for disparity reconstruction as well as spatial and angular super-resolution. Disparity maps are estimated locally using epipolar plane image analysis without the need for expensive matching cost minimization. The method works fast and with inherent subpixel accuracy since no discretization of the disparity space is necessary. In a variational framework, we employ the disparity maps to generate super-resolved novel views of a scene, which corresponds to increasing the sampling rate of the 4D light field in spatial as well as angular direction. In contrast to previous work, we formulate the problem of view synthesis as a continuous inverse problem, which allows us to correctly take into account foreshortening effects caused by scene geometry transformations. All optimization problems are solved with state-of-the-art convex relaxation techniques. We test our algorithms on a number of real-world examples as well as our new benchmark data set for light fields, and compare results to a multiview stereo method. The proposed method is both faster as well as more accurate. Data sets and source code are provided online for additional evaluation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We develop a continuous framework for the analysis of 4D light fields, and describe novel variational methods for disparity reconstruction as well as spatial and angular super-resolution. Disparity maps are estimated locally using epipolar plane image analysis without the need for expensive matching cost minimization. The method works fast and with inherent subpixel accuracy since no discretization of the disparity space is necessary. In a variational framework, we employ the disparity maps to generate super-resolved novel views of a scene, which corresponds to increasing the sampling rate of the 4D light field in spatial as well as angular direction. In contrast to previous work, we formulate the problem of view synthesis as a continuous inverse problem, which allows us to correctly take into account foreshortening effects caused by scene geometry transformations. All optimization problems are solved with state-of-the-art convex relaxation techniques. We test our algorithms on a number of real-world examples as well as our new benchmark data set for light fields, and compare results to a multiview stereo method. The proposed method is both faster as well as more accurate. Data sets and source code are provided online for additional evaluation.",
"title": "Variational Light Field Analysis for Disparity Estimation and Super-Resolution",
"normalizedTitle": "Variational Light Field Analysis for Disparity Estimation and Super-Resolution",
"fno": "ttp2014030606",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Spatial Resolution",
"Cameras",
"Estimation",
"Geometry",
"Tensile Stress",
"Image Reconstruction",
"Variational Methods",
"Light Fields",
"Epipolar Plane Images",
"3 D Reconstruction",
"Super Resolution",
"View Interpolation"
],
"authors": [
{
"givenName": "Sven",
"surname": "Wanner",
"fullName": "Sven Wanner",
"affiliation": "Heidelberg Collaboratory for Image Process. (HCI), Univ. of Heidelberg, Heidelberg, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bastian",
"surname": "Goldluecke",
"fullName": "Bastian Goldluecke",
"affiliation": "Heidelberg Collaboratory for Image Process. (HCI), Univ. of Heidelberg, Heidelberg, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2014-03-01 00:00:00",
"pubType": "trans",
"pages": "606-619",
"year": "2014",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2013/4989/0/4989b003",
"title": "The Variational Structure of Disparity and Regularization of 4D Light Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2013/4989b003/12OmNAtK4fx",
"parentPublication": {
"id": "proceedings/cvpr/2013/4989/0",
"title": "2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2015/9711/0/5720a057",
"title": "Learning a Deep Convolutional Network for Light-Field Image Super-Resolution",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2015/5720a057/12OmNyL0TyY",
"parentPublication": {
"id": "proceedings/iccvw/2015/9711/0",
"title": "2015 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acomp/2018/9186/0/918600a007",
"title": "GPU-Accelerated Light-Field Image Super-Resolution",
"doi": null,
"abstractUrl": "/proceedings-article/acomp/2018/918600a007/17D45X0yjUC",
"parentPublication": {
"id": "proceedings/acomp/2018/9186/0",
"title": "2018 International Conference on Advanced Computing and Applications (ACOMP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/01/09716806",
"title": "Disentangling Light Fields for Super-Resolution and Disparity Estimation",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09716806/1B5WzcrxgIM",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09798876",
"title": "Deep Light Field Spatial Super-Resolution Using Heterogeneous Imaging",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09798876/1Eho8QXQucg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/08924770",
"title": "Revisiting Spatio-Angular Trade-off in Light Field Cameras and Extended Applications in Super-Resolution",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/08924770/1fvZlX1pNU4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2019/2506/0/250600b853",
"title": "An Epipolar Volume Autoencoder With Adversarial Loss for Deep Light Field Super-Resolution",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2019/250600b853/1iTvlh1qLGU",
"parentPublication": {
"id": "proceedings/cvprw/2019/2506/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2019/2506/0/250600b804",
"title": "Light Field Super-Resolution: A Benchmark",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2019/250600b804/1iTvo7kjJFm",
"parentPublication": {
"id": "proceedings/cvprw/2019/2506/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2020/6553/0/09093491",
"title": "Inferring Super-Resolution Depth from a Moving Light-Source Enhanced RGB-D Sensor: A Variational Approach",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2020/09093491/1jPbFHPBYnm",
"parentPublication": {
"id": "proceedings/wacv/2020/6553/0",
"title": "2020 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2020/5230/0/09105172",
"title": "High Resolution Light Field Recovery with Fourier Disparity Layer Completion, Demosaicing, and Super-Resolution",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2020/09105172/1kkJWWs3PZ6",
"parentPublication": {
"id": "proceedings/iccp/2020/5230/0",
"title": "2020 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2014030592",
"articleId": "13rRUEgarCx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2014030620",
"articleId": "13rRUxASucF",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzvhvFS",
"title": "May",
"year": "2013",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa561",
"doi": "10.1109/TVCG.2012.160",
"abstract": "This paper surveys the field of nonphotorealistic rendering (NPR), focusing on techniques for transforming 2D input (images and video) into artistically stylized renderings. We first present a taxonomy of the 2D NPR algorithms developed over the past two decades, structured according to the design characteristics and behavior of each technique. We then describe a chronology of development from the semiautomatic paint systems of the early nineties, through to the automated painterly rendering systems of the late nineties driven by image gradient analysis. Two complementary trends in the NPR literature are then addressed, with reference to our taxonomy. First, the fusion of higher level computer vision and NPR, illustrating the trends toward scene analysis to drive artistic abstraction and diversity of style. Second, the evolution of local processing approaches toward edge-aware filtering for real-time stylization of images and video. The survey then concludes with a discussion of open challenges for 2D NPR identified in recent NPR symposia, including topics such as user and aesthetic evaluation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper surveys the field of nonphotorealistic rendering (NPR), focusing on techniques for transforming 2D input (images and video) into artistically stylized renderings. We first present a taxonomy of the 2D NPR algorithms developed over the past two decades, structured according to the design characteristics and behavior of each technique. We then describe a chronology of development from the semiautomatic paint systems of the early nineties, through to the automated painterly rendering systems of the late nineties driven by image gradient analysis. Two complementary trends in the NPR literature are then addressed, with reference to our taxonomy. First, the fusion of higher level computer vision and NPR, illustrating the trends toward scene analysis to drive artistic abstraction and diversity of style. Second, the evolution of local processing approaches toward edge-aware filtering for real-time stylization of images and video. The survey then concludes with a discussion of open challenges for 2D NPR identified in recent NPR symposia, including topics such as user and aesthetic evaluation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper surveys the field of nonphotorealistic rendering (NPR), focusing on techniques for transforming 2D input (images and video) into artistically stylized renderings. We first present a taxonomy of the 2D NPR algorithms developed over the past two decades, structured according to the design characteristics and behavior of each technique. We then describe a chronology of development from the semiautomatic paint systems of the early nineties, through to the automated painterly rendering systems of the late nineties driven by image gradient analysis. Two complementary trends in the NPR literature are then addressed, with reference to our taxonomy. First, the fusion of higher level computer vision and NPR, illustrating the trends toward scene analysis to drive artistic abstraction and diversity of style. Second, the evolution of local processing approaches toward edge-aware filtering for real-time stylization of images and video. The survey then concludes with a discussion of open challenges for 2D NPR identified in recent NPR symposia, including topics such as user and aesthetic evaluation.",
"title": "State of the \"Art”: A Taxonomy of Artistic Stylization Techniques for Images and Video",
"normalizedTitle": "State of the \"Art”: A Taxonomy of Artistic Stylization Techniques for Images and Video",
"fno": "ttg2013050866",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Rendering Computer Graphics",
"Painting",
"Image Color Analysis",
"Taxonomy",
"Algorithm Design And Analysis",
"Image Edge Detection",
"Artistic Rendering",
"Image And Video Stylization",
"Nonphotorealistic Rendering NPR"
],
"authors": [
{
"givenName": "Jan Eric",
"surname": "Kyprianidis",
"fullName": "Jan Eric Kyprianidis",
"affiliation": "Comput. Graphics Syst. Group, Univ. of Potsdam, Potsdam, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "J.",
"surname": "Collomosse",
"fullName": "J. Collomosse",
"affiliation": "Centre for Vision Speech & Signal Process. (CVSSP), Univ. of Surrey, Guildford, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Tinghuai Wang",
"fullName": "Tinghuai Wang",
"affiliation": "Centre for Vision Speech & Signal Process. (CVSSP), Univ. of Surrey, Guildford, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "T.",
"surname": "Isenberg",
"fullName": "T. Isenberg",
"affiliation": "Team Aviz-INRIA-Saclay, Univ. Paris-Sud, Orsay, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2013-05-01 00:00:00",
"pubType": "trans",
"pages": "866-885",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icse/1992/504/0/00753517",
"title": "Program visualization: the art of mapping programs to pictures",
"doi": null,
"abstractUrl": "/proceedings-article/icse/1992/00753517/12OmNAQJzT1",
"parentPublication": {
"id": "proceedings/icse/1992/504/0",
"title": "International Conference on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2005/2397/0/23970903",
"title": "Enhanced SIC (Synergistic Image Creator) for Artistic Use",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2005/23970903/12OmNB1wkOc",
"parentPublication": {
"id": "proceedings/iv/2005/2397/0",
"title": "Ninth International Conference on Information Visualisation (IV'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2013/2549/0/06746488",
"title": "Wormhole Canvas",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2013/06746488/12OmNBqMDEL",
"parentPublication": {
"id": "proceedings/cis/2013/2549/0",
"title": "2013 Ninth International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2016/9041/0/9041a391",
"title": "Best Practices in WebQuest Design: Stimulating the Higher Levels of Bloom's Taxonomy",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2016/9041a391/12OmNCeaPUM",
"parentPublication": {
"id": "proceedings/icalt/2016/9041/0",
"title": "2016 IEEE 16th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bcgin/2011/4464/0/4464a461",
"title": "Analysis of the IFRS Taxonomy Extension Mode",
"doi": null,
"abstractUrl": "/proceedings-article/bcgin/2011/4464a461/12OmNvjgWpL",
"parentPublication": {
"id": "proceedings/bcgin/2011/4464/0",
"title": "2011 International Conference on Business Computing and Global Informatization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvmp/2009/3893/0/3893a035",
"title": "Skin-Aware Stylization of Video Portraits",
"doi": null,
"abstractUrl": "/proceedings-article/cvmp/2009/3893a035/12OmNwMob6P",
"parentPublication": {
"id": "proceedings/cvmp/2009/3893/0",
"title": "2009 Conference for Visual Media Production",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scivis/2015/9785/0/07429511",
"title": "A proposed multivariate visualization taxonomy from user data",
"doi": null,
"abstractUrl": "/proceedings-article/scivis/2015/07429511/12OmNzmLxKh",
"parentPublication": {
"id": "proceedings/scivis/2015/9785/0",
"title": "2015 IEEE Scientific Visualization Conference (SciVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/08/ttg2013081252",
"title": "Abstract Art by Shape Classification",
"doi": null,
"abstractUrl": "/journal/tg/2013/08/ttg2013081252/13rRUxYrbMf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/10/06732968",
"title": "Towards Photo Watercolorization with Artistic Verisimilitude",
"doi": null,
"abstractUrl": "/journal/tg/2014/10/06732968/13rRUxYrbUI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2013/03/mcg2013030022",
"title": "Mobile Expressive Renderings: The State of the Art",
"doi": null,
"abstractUrl": "/magazine/cg/2013/03/mcg2013030022/13rRUy0ZzV1",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013050852",
"articleId": "13rRUwfZBVm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013050886",
"articleId": "13rRUwh80uy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwGqBqg",
"title": "November/December",
"year": "2009",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "15",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0xPIz",
"doi": "10.1109/TVCG.2009.192",
"abstract": "TVCG Vis/InfoVis 2009 Author Index",
"abstracts": [
{
"abstractType": "Regular",
"content": "TVCG Vis/InfoVis 2009 Author Index",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "TVCG Vis/InfoVis 2009 Author Index",
"title": "TVCG Vis/InfoVis 2009 Author Index",
"normalizedTitle": "TVCG Vis/InfoVis 2009 Author Index",
"fno": "ttg200906xxviv",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Tvcg",
"Vis",
"Infovis",
"Author"
],
"authors": [],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": false,
"isOpenAccess": true,
"issueNum": "06",
"pubDate": "2009-11-01 00:00:00",
"pubType": "trans",
"pages": "xxviv-xxvv",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "ttg2009061611",
"articleId": "13rRUxcbnH6",
"__typename": "AdjacentArticleType"
},
"next": null,
"__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": "13rRUxBrGh3",
"doi": "10.1109/TVCG.2015.2467323",
"abstract": "Effective small multiple displays are created by partitioning a visualization on variables that reveal interesting conditional structure in the data. We propose a method that automatically ranks partitioning variables, allowing analysts to focus on the most promising small multiple displays. Our approach is based on a randomized, non-parametric permutation test, which allows us to handle a wide range of quality measures for visual patterns defined on many different visualization types, while discounting spurious patterns. We demonstrate the effectiveness of our approach on scatterplots of real-world, multidimensional datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Effective small multiple displays are created by partitioning a visualization on variables that reveal interesting conditional structure in the data. We propose a method that automatically ranks partitioning variables, allowing analysts to focus on the most promising small multiple displays. Our approach is based on a randomized, non-parametric permutation test, which allows us to handle a wide range of quality measures for visual patterns defined on many different visualization types, while discounting spurious patterns. We demonstrate the effectiveness of our approach on scatterplots of real-world, multidimensional datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Effective small multiple displays are created by partitioning a visualization on variables that reveal interesting conditional structure in the data. We propose a method that automatically ranks partitioning variables, allowing analysts to focus on the most promising small multiple displays. Our approach is based on a randomized, non-parametric permutation test, which allows us to handle a wide range of quality measures for visual patterns defined on many different visualization types, while discounting spurious patterns. We demonstrate the effectiveness of our approach on scatterplots of real-world, multidimensional datasets.",
"title": "Automatic Selection of Partitioning Variables for Small Multiple Displays",
"normalizedTitle": "Automatic Selection of Partitioning Variables for Small Multiple Displays",
"fno": "07192658",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Partitioning Algorithms",
"Data Visualization",
"Employment",
"Algorithm Design And Analysis",
"Visual Analytics",
"Histograms",
"Multidimensional Data",
"Small Multiple Displays",
"Visualization Selection",
"Multidimensional Data",
"Small Multiple Displays",
"Visualization Selection"
],
"authors": [
{
"givenName": "Anushka",
"surname": "Anand",
"fullName": "Anushka Anand",
"affiliation": ", Tableau Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Justin",
"surname": "Talbot",
"fullName": "Justin Talbot",
"affiliation": ", Tableau Research",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2016-01-01 00:00:00",
"pubType": "trans",
"pages": "669-677",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2009/3733/0/3733a025",
"title": "Many-to-Many Relational Parallel Coordinates Displays",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2009/3733a025/12OmNB06l2c",
"parentPublication": {
"id": "proceedings/iv/2009/3733/0",
"title": "2009 13th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2014/4103/0/4103a084",
"title": "A Heatmap-Based Time-Varying Multi-variate Data Visualization Unifying Numeric and Categorical Variables",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2014/4103a084/12OmNqESuhq",
"parentPublication": {
"id": "proceedings/iv/2014/4103/0",
"title": "2014 18th International Conference on Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2013/2246/0/2246a378",
"title": "EVOLVE: A Linked Visualization Environment for Explanatory Variables and Objective Function of Optimization Problems",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2013/2246a378/12OmNx965z6",
"parentPublication": {
"id": "proceedings/cw/2013/2246/0",
"title": "2013 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2014/6227/0/07042500",
"title": "A multidimensional brush for scatterplot data analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042500/12OmNxR5UJf",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdva/2015/7343/0/07314291",
"title": "Distributed Visual Analytics on Large-Scale High-Resolution Displays",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2015/07314291/12OmNzzP5B1",
"parentPublication": {
"id": "proceedings/bdva/2015/7343/0",
"title": "2015 Big Data Visual Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08019826",
"title": "Open vs. Closed Shapes: New Perceptual Categories?",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08019826/13rRUwIF6la",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2002/05/k1095",
"title": "An Evaluation of Vertical Class Partitioning for Query Processing in Object-Oriented Databases",
"doi": null,
"abstractUrl": "/journal/tk/2002/05/k1095/13rRUwInvt9",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__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": "trans/tg/2006/06/v1363",
"title": "High-Dimensional Visual Analytics: Interactive Exploration Guided by Pairwise Views of Point Distributions",
"doi": null,
"abstractUrl": "/journal/tg/2006/06/v1363/13rRUx0xPIs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933673",
"title": "VisWall: Visual Data Exploration Using Direct Combination on Large Touch Displays",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933673/1fTgGNuw1bi",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07192704",
"articleId": "13rRUx0gev9",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07192693",
"articleId": "13rRUwInvfb",
"__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": "13rRUxD9gXB",
"doi": "10.1109/TVCG.2010.205",
"abstract": "A standard approach for visualizing multivariate networks is to use one or more multidimensional views (for example, scatterplots) for selecting nodes by various metrics, possibly coordinated with a node-link view of the network. In this paper, we present three novel approaches for achieving a tighter integration of these views through hybrid techniques for multidimensional visualization, graph selection and layout. First, we present the FlowVizMenu, a radial menu containing a scatterplot that can be popped up transiently and manipulated with rapid, fluid gestures to select and modify the axes of its scatterplot. Second, the FlowVizMenu can be used to steer an attribute-driven layout of the network, causing certain nodes of a node-link diagram to move toward their corresponding positions in a scatterplot while others can be positioned manually or by force-directed layout. Third, we describe a novel hybrid approach that combines a scatterplot matrix (SPLOM) and parallel coordinates called the Parallel Scatterplot Matrix (P-SPLOM), which can be used to visualize and select features within the network. We also describe a novel arrangement of scatterplots called the Scatterplot Staircase (SPLOS) that requires less space than a traditional scatterplot matrix. Initial user feedback is reported.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A standard approach for visualizing multivariate networks is to use one or more multidimensional views (for example, scatterplots) for selecting nodes by various metrics, possibly coordinated with a node-link view of the network. In this paper, we present three novel approaches for achieving a tighter integration of these views through hybrid techniques for multidimensional visualization, graph selection and layout. First, we present the FlowVizMenu, a radial menu containing a scatterplot that can be popped up transiently and manipulated with rapid, fluid gestures to select and modify the axes of its scatterplot. Second, the FlowVizMenu can be used to steer an attribute-driven layout of the network, causing certain nodes of a node-link diagram to move toward their corresponding positions in a scatterplot while others can be positioned manually or by force-directed layout. Third, we describe a novel hybrid approach that combines a scatterplot matrix (SPLOM) and parallel coordinates called the Parallel Scatterplot Matrix (P-SPLOM), which can be used to visualize and select features within the network. We also describe a novel arrangement of scatterplots called the Scatterplot Staircase (SPLOS) that requires less space than a traditional scatterplot matrix. Initial user feedback is reported.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A standard approach for visualizing multivariate networks is to use one or more multidimensional views (for example, scatterplots) for selecting nodes by various metrics, possibly coordinated with a node-link view of the network. In this paper, we present three novel approaches for achieving a tighter integration of these views through hybrid techniques for multidimensional visualization, graph selection and layout. First, we present the FlowVizMenu, a radial menu containing a scatterplot that can be popped up transiently and manipulated with rapid, fluid gestures to select and modify the axes of its scatterplot. Second, the FlowVizMenu can be used to steer an attribute-driven layout of the network, causing certain nodes of a node-link diagram to move toward their corresponding positions in a scatterplot while others can be positioned manually or by force-directed layout. Third, we describe a novel hybrid approach that combines a scatterplot matrix (SPLOM) and parallel coordinates called the Parallel Scatterplot Matrix (P-SPLOM), which can be used to visualize and select features within the network. We also describe a novel arrangement of scatterplots called the Scatterplot Staircase (SPLOS) that requires less space than a traditional scatterplot matrix. Initial user feedback is reported.",
"title": "The FlowVizMenu and Parallel Scatterplot Matrix: Hybrid Multidimensional Visualizations for Network Exploration",
"normalizedTitle": "The FlowVizMenu and Parallel Scatterplot Matrix: Hybrid Multidimensional Visualizations for Network Exploration",
"fno": "ttg2010061100",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Interactive Graph Drawing",
"Network Layout",
"Attribute Driven Layout",
"Parallel Coordinates",
"Scatterplot Matrix",
"Radial Menu"
],
"authors": [
{
"givenName": "Christophe",
"surname": "Viau",
"fullName": "Christophe Viau",
"affiliation": "École de technologie supérieure",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael J.",
"surname": "McGuffin",
"fullName": "Michael J. McGuffin",
"affiliation": "École de technologie supérieure",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yves",
"surname": "Chiricota",
"fullName": "Yves Chiricota",
"affiliation": "Université du Québec à Chicoutimi",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Igor",
"surname": "Jurisica",
"fullName": "Igor Jurisica",
"affiliation": "Ontario Cancer Institute",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2010-11-01 00:00:00",
"pubType": "trans",
"pages": "1100-1108",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/kse/2011/4567/0/4567a054",
"title": "Volume Visualization and Exploration Based on Semi-automatic Multidimensional Transfer Function Design",
"doi": null,
"abstractUrl": "/proceedings-article/kse/2011/4567a054/12OmNx7G5W4",
"parentPublication": {
"id": "proceedings/kse/2011/4567/0",
"title": "Knowledge and Systems Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2014/6227/0/07042500",
"title": "A multidimensional brush for scatterplot data analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042500/12OmNxR5UJf",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2004/8779/0/87790135",
"title": "Metric-Based Network Exploration and Multiscale Scatterplot",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2004/87790135/12OmNzcxYYA",
"parentPublication": {
"id": "proceedings/ieee-infovis/2004/8779/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111969",
"title": "3D Scatterplot Navigation",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111969/13rRUB6Sq0y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/10/ttg2013101768",
"title": "The Generalized Sensitivity Scatterplot",
"doi": null,
"abstractUrl": "/journal/tg/2013/10/ttg2013101768/13rRUwbs2gs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122606",
"title": "GPLOM: The Generalized Plot Matrix for Visualizing Multidimensional Multivariate Data",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122606/13rRUxAAT0S",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061001",
"title": "Scattering Points in Parallel Coordinates",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061001/13rRUxNW1TQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061141",
"title": "Rolling the Dice: Multidimensional Visual Exploration using Scatterplot Matrix Navigation",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061141/13rRUyuegp1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/topoinvis/2022/9354/0/935400a070",
"title": "ClassMat: a Matrix of Small Multiples to Analyze the Topology of Multiclass Multidimensional Data",
"doi": null,
"abstractUrl": "/proceedings-article/topoinvis/2022/935400a070/1J2XJAzNsI0",
"parentPublication": {
"id": "proceedings/topoinvis/2022/9354/0",
"title": "2022 Topological Data Analysis and Visualization (TopoInVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222038",
"title": "Kyrix-S: Authoring Scalable Scatterplot Visualizations of Big Data",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222038/1nTq1lYLbEY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010061090",
"articleId": "13rRUILtJm3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010061109",
"articleId": "13rRUyuegh7",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRFV",
"name": "ttg2010061100s1.avi",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2010061100s1.avi",
"extension": "avi",
"size": "34.7 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUxASuGb",
"doi": "10.1109/TVCG.2008.132",
"abstract": "The need to examine and manipulate large surface models is commonly found in many science, engineering, and medical applications. On a desktop monitor, however, seeing the whole model in detail is not possible. In this paper, we present a new, interactive Focus+Context method for visualizing large surface models. Our method, based on an energy optimization model, allows the user to magnify an area of interest to see it in detail while deforming the rest of the area without perceivable distortion. The rest of the surface area is essentially shrunk to use as little of the screen space as possible in order to keep the entire model displayed on screen. We demonstrate the efficacy and robustness of our method with a variety of models.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The need to examine and manipulate large surface models is commonly found in many science, engineering, and medical applications. On a desktop monitor, however, seeing the whole model in detail is not possible. In this paper, we present a new, interactive Focus+Context method for visualizing large surface models. Our method, based on an energy optimization model, allows the user to magnify an area of interest to see it in detail while deforming the rest of the area without perceivable distortion. The rest of the surface area is essentially shrunk to use as little of the screen space as possible in order to keep the entire model displayed on screen. We demonstrate the efficacy and robustness of our method with a variety of models.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The need to examine and manipulate large surface models is commonly found in many science, engineering, and medical applications. On a desktop monitor, however, seeing the whole model in detail is not possible. In this paper, we present a new, interactive Focus+Context method for visualizing large surface models. Our method, based on an energy optimization model, allows the user to magnify an area of interest to see it in detail while deforming the rest of the area without perceivable distortion. The rest of the surface area is essentially shrunk to use as little of the screen space as possible in order to keep the entire model displayed on screen. We demonstrate the efficacy and robustness of our method with a variety of models.",
"title": "Focus+Context Visualization with Distortion Minimization",
"normalizedTitle": "Focus+Context Visualization with Distortion Minimization",
"fno": "ttg2008061731",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Focus Context Visualization",
"Magnification",
"Bounding Space"
],
"authors": [
{
"givenName": "Yu-Shuen",
"surname": "Wang",
"fullName": "Yu-Shuen Wang",
"affiliation": "National Cheng-Kung University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tong-Yee",
"surname": "Lee",
"fullName": "Tong-Yee Lee",
"affiliation": "National Cheng-Kung University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chiew-Lan",
"surname": "Tai",
"fullName": "Chiew-Lan Tai",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1731-1738",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/auic/2000/0515/0/05150126",
"title": "(Focus + Context)3: Distortion-Oriented Displays in Three Dimensions",
"doi": null,
"abstractUrl": "/proceedings-article/auic/2000/05150126/12OmNAThXTt",
"parentPublication": {
"id": "proceedings/auic/2000/0515/0",
"title": "Australasian User Interface Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2005/2392/0/23920162",
"title": "DualView: A Focus+Context Technique for Navigating Large Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2005/23920162/12OmNBBQZqd",
"parentPublication": {
"id": "proceedings/cgiv/2005/2392/0",
"title": "International Conference on Computer Graphics, Imaging and Visualization (CGIV'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isda/2008/3382/1/3382a368",
"title": "Intelligent Focus+Context Volume Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/isda/2008/3382a368/12OmNy5R3sk",
"parentPublication": {
"id": "proceedings/isda/2008/3382/1",
"title": "Intelligent Systems Design and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a389",
"title": "2.5D Focus+Context Map Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a389/12OmNyKrHen",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2008/3268/0/3268a356",
"title": "3D Generalization Lenses for Interactive Focus + Context Visualization of Virtual City Models",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2008/3268a356/12OmNzaQoEB",
"parentPublication": {
"id": "proceedings/iv/2008/3268/0",
"title": "2008 12th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660047",
"title": "The Magic Volume Lens: An Interactive Focus+Context Technique for Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660047/12OmNzmLxM5",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/02/ttg2011020171",
"title": "Feature-Preserving Volume Data Reduction and Focus+Context Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2011/02/ttg2011020171/13rRUx0xPTN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061157",
"title": "Balloon Focus: a Seamless Multi-Focus+Context Method for Treemaps",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061157/13rRUxASuAr",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122528",
"title": "Focus+Context Metro Maps",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122528/13rRUyY294B",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061723",
"articleId": "13rRUygT7mP",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061747",
"articleId": "13rRUILtJm1",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet33",
"name": "ttg2008061731.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2008061731.mp4",
"extension": "mp4",
"size": "23.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxdm4Er",
"title": "Jan.",
"year": "2013",
"issueNum": "01",
"idPrefix": "ts",
"pubType": "journal",
"volume": "39",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjoNyT",
"doi": "10.1109/TSE.2012.1",
"abstract": "Rapid and accessible performance evaluation of complex software systems requires two critical features: the ability to specify useful performance metrics easily and the capability to analyze massively distributed architectures, without recourse to large compute clusters. We present the unified stochastic probe, a performance specification mechanism for process algebra models that combines many existing ideas: state and action-based activation, location-based specification, many-probe specification, and immediate signaling. These features, between them, allow the precise and compositional construction of complex performance measurements. The paper shows how a subset of the stochastic probe language can be used to specify common response-time measures in massive process algebra models. The second contribution of the paper is to show how these response-time measures can be analyzed using so-called fluid techniques to produce rapid results. In doing this, we extend the fluid approach to incorporate immediate activities and a new type of response-time measure. Finally, we calculate various response-time measurements on a complex distributed wireless network of O(10^{129}) states in size.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Rapid and accessible performance evaluation of complex software systems requires two critical features: the ability to specify useful performance metrics easily and the capability to analyze massively distributed architectures, without recourse to large compute clusters. We present the unified stochastic probe, a performance specification mechanism for process algebra models that combines many existing ideas: state and action-based activation, location-based specification, many-probe specification, and immediate signaling. These features, between them, allow the precise and compositional construction of complex performance measurements. The paper shows how a subset of the stochastic probe language can be used to specify common response-time measures in massive process algebra models. The second contribution of the paper is to show how these response-time measures can be analyzed using so-called fluid techniques to produce rapid results. In doing this, we extend the fluid approach to incorporate immediate activities and a new type of response-time measure. Finally, we calculate various response-time measurements on a complex distributed wireless network of O(10^{129}) states in size.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Rapid and accessible performance evaluation of complex software systems requires two critical features: the ability to specify useful performance metrics easily and the capability to analyze massively distributed architectures, without recourse to large compute clusters. We present the unified stochastic probe, a performance specification mechanism for process algebra models that combines many existing ideas: state and action-based activation, location-based specification, many-probe specification, and immediate signaling. These features, between them, allow the precise and compositional construction of complex performance measurements. The paper shows how a subset of the stochastic probe language can be used to specify common response-time measures in massive process algebra models. The second contribution of the paper is to show how these response-time measures can be analyzed using so-called fluid techniques to produce rapid results. In doing this, we extend the fluid approach to incorporate immediate activities and a new type of response-time measure. Finally, we calculate various response-time measurements on a complex distributed wireless network of O(10^{129}) states in size.",
"title": "Performance Specification and Evaluation with Unified Stochastic Probes and Fluid Analysis",
"normalizedTitle": "Performance Specification and Evaluation with Unified Stochastic Probes and Fluid Analysis",
"fno": "tts2013010097",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Probes",
"Stochastic Processes",
"Analytical Models",
"Algebra",
"Computational Modeling",
"Semantics",
"Syntactics",
"Passage Time Analysis",
"Performance Modeling",
"Performance Evaluation Tools",
"Stochastic Process Algebra",
"Measurement Probes",
"Fluid Approximation"
],
"authors": [
{
"givenName": "Richard A.",
"surname": "Hayden",
"fullName": "Richard A. Hayden",
"affiliation": "Imperial College London, London",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeremy T.",
"surname": "Bradley",
"fullName": "Jeremy T. Bradley",
"affiliation": "Imperial College London, London",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Allan",
"surname": "Clark",
"fullName": "Allan Clark",
"affiliation": "University of Edinburgh, Edinburgh",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2013-01-01 00:00:00",
"pubType": "trans",
"pages": "97-118",
"year": "2013",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/qest/2012/4781/0/4781a199",
"title": "Specification and Efficient Computation of Passage-Time Distributions in GPA",
"doi": null,
"abstractUrl": "/proceedings-article/qest/2012/4781a199/12OmNBQkwZF",
"parentPublication": {
"id": "proceedings/qest/2012/4781/0",
"title": "Quantitative Evaluation of Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/1994/6555/0/00590310",
"title": "Specification of stochastic properties with CSP",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/1994/00590310/12OmNBUS77j",
"parentPublication": {
"id": "proceedings/icpads/1994/6555/0",
"title": "Proceedings of 1994 International Conference on Parallel and Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qest/2004/2185/0/01348043",
"title": "Axiomatization of trace semantics for stochastic nondeterministic processes",
"doi": null,
"abstractUrl": "/proceedings-article/qest/2004/01348043/12OmNvTk079",
"parentPublication": {
"id": "proceedings/qest/2004/2185/0",
"title": "Quantitative Evaluation of Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2008/2047/0/04476595",
"title": "Real-Time 3D Fluid Interaction with a Haptic User Interface",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2008/04476595/12OmNvxKu1U",
"parentPublication": {
"id": "proceedings/3dui/2008/2047/0",
"title": "2008 IEEE Symposium on 3D User Interfaces",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issrew/2008/3416/0/05355517",
"title": "Compositional fluid stochastic Petri net model for operational software system performance",
"doi": null,
"abstractUrl": "/proceedings-article/issrew/2008/05355517/12OmNxFJXLg",
"parentPublication": {
"id": "proceedings/issrew/2008/3416/0",
"title": "2008 IEEE International Conference on Software Reliability Engineering Workshops, ISSRE Workshop",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qest/2011/4491/0/4491a101",
"title": "Probe Automata for Passage Time Specification",
"doi": null,
"abstractUrl": "/proceedings-article/qest/2011/4491a101/12OmNySosFN",
"parentPublication": {
"id": "proceedings/qest/2011/4491/0",
"title": "Quantitative Evaluation of Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qest/2008/3360/0/04634961",
"title": "Recent Extensions to the Stochastic Process Algebra Tool CASPA",
"doi": null,
"abstractUrl": "/proceedings-article/qest/2008/04634961/12OmNyYm2qG",
"parentPublication": {
"id": "proceedings/qest/2008/3360/0",
"title": "Quantitative Evaluation of Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/test/1989/9999/0/00082296",
"title": "An analysis of tungsten probes' effect on yield in a production wafer probe environment",
"doi": null,
"abstractUrl": "/proceedings-article/test/1989/00082296/12OmNyv7mlu",
"parentPublication": {
"id": "proceedings/test/1989/9999/0",
"title": "1989 International Test Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isads/2005/8963/0/01452174",
"title": "Stochastic fluid model for P2P content distribution networks",
"doi": null,
"abstractUrl": "/proceedings-article/isads/2005/01452174/12OmNz2C1yF",
"parentPublication": {
"id": "proceedings/isads/2005/8963/0",
"title": "Proceedings. ISADS 2005. 2005 International Symposium on Autonomous Decentralized Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1999/02/e0207",
"title": "Discrete-Event Simulation of Fluid Stochastic Petri Nets",
"doi": null,
"abstractUrl": "/journal/ts/1999/02/e0207/13rRUwbaqWr",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "tts2013010080",
"articleId": "13rRUyYjKc4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "tts2013010119",
"articleId": "13rRUxAAT9q",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzFdtcb",
"title": "July-Sept.",
"year": "2014",
"issueNum": "03",
"idPrefix": "pc",
"pubType": "magazine",
"volume": "13",
"label": "July-Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvpq",
"doi": "10.1109/MPRV.2014.42",
"abstract": "Despite significant advances in context sensing and inference since its inception in the late 1990s, context-aware computing still doesn't implement a holistic view of all covert aspects of the user state. Here, the authors introduce the concept of cognitive context as an extension to the current notion of context with a cognitive dimension. They argue that visual behavior and brain activity are two promising sensing modalities for assessing the cognitive context and thus the development of cognition-aware computing systems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Despite significant advances in context sensing and inference since its inception in the late 1990s, context-aware computing still doesn't implement a holistic view of all covert aspects of the user state. Here, the authors introduce the concept of cognitive context as an extension to the current notion of context with a cognitive dimension. They argue that visual behavior and brain activity are two promising sensing modalities for assessing the cognitive context and thus the development of cognition-aware computing systems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Despite significant advances in context sensing and inference since its inception in the late 1990s, context-aware computing still doesn't implement a holistic view of all covert aspects of the user state. Here, the authors introduce the concept of cognitive context as an extension to the current notion of context with a cognitive dimension. They argue that visual behavior and brain activity are two promising sensing modalities for assessing the cognitive context and thus the development of cognition-aware computing systems.",
"title": "Cognition-Aware Computing",
"normalizedTitle": "Cognition-Aware Computing",
"fno": "mpc2014030080",
"hasPdf": true,
"idPrefix": "pc",
"keywords": [
"Brain Computer Interfaces",
"Cognition",
"Cognitive Systems",
"Ubiquitous Computing",
"Context Sensing",
"Inference",
"Context Aware Computing",
"Cognitive Context",
"Cognitive Dimension",
"Visual Behavior",
"Brain Activity",
"Cognition Aware Computing Systems",
"Context Modeling",
"Visualization",
"Electroencephalography",
"Sensors",
"Cognition",
"Tracking",
"Cognition Aware Computing",
"Context Aware Computing",
"Pervasive Computing",
"Intelligent Systems",
"Bioinformatics"
],
"authors": [
{
"givenName": "Andreas",
"surname": "Bulling",
"fullName": "Andreas Bulling",
"affiliation": "Max Planck Institute for Informatics",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thorsten O.",
"surname": "Zander",
"fullName": "Thorsten O. Zander",
"affiliation": "Technical University of Berlin",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2014-07-01 00:00:00",
"pubType": "mags",
"pages": "80-83",
"year": "2014",
"issn": "1536-1268",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/percomw/2013/5075/0/06529446",
"title": "Keynote: Context-aware computing in the era of crowd sensing from personal and space context to social and community context",
"doi": null,
"abstractUrl": "/proceedings-article/percomw/2013/06529446/12OmNAlNiBd",
"parentPublication": {
"id": "proceedings/percomw/2013/5075/0",
"title": "2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/artcom/2009/3845/0/3845a514",
"title": "Context Aware Computing in Wireless Sensor Networks",
"doi": null,
"abstractUrl": "/proceedings-article/artcom/2009/3845a514/12OmNBBQZoD",
"parentPublication": {
"id": "proceedings/artcom/2009/3845/0",
"title": "Advances in Recent Technologies in Communication and Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ficloud/2015/8103/0/8103a093",
"title": "Binary Context Tree Based Middleware for Next Generation Context Aware Networks",
"doi": null,
"abstractUrl": "/proceedings-article/ficloud/2015/8103a093/12OmNBLdKFj",
"parentPublication": {
"id": "proceedings/ficloud/2015/8103/0",
"title": "2015 3rd International Conference on Future Internet of Things and Cloud (FiCloud)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsc/2016/0662/0/0662a107",
"title": "Human Localization Sensor Ontology: Enabling OWL 2 DL-Based Search for User's Location-Aware Sensors in the IoT",
"doi": null,
"abstractUrl": "/proceedings-article/icsc/2016/0662a107/12OmNs0kyAG",
"parentPublication": {
"id": "proceedings/icsc/2016/0662/0",
"title": "2016 IEEE Tenth International Conference on Semantic Computing (ICSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/saint/2010/4107/0/4107a113",
"title": "Basic Approach of Timing in Context Aware Architectures Verified by Concrete Advantages",
"doi": null,
"abstractUrl": "/proceedings-article/saint/2010/4107a113/12OmNwtEEIu",
"parentPublication": {
"id": "proceedings/saint/2010/4107/0",
"title": "2010 10th IEEE/IPSJ International Symposium on Applications and the Internet",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iotdi/2016/9948/0/9948a235",
"title": "A Modular Approach to Context-Aware IoT Applications",
"doi": null,
"abstractUrl": "/proceedings-article/iotdi/2016/9948a235/12OmNxdm4sY",
"parentPublication": {
"id": "proceedings/iotdi/2016/9948/0",
"title": "2016 IEEE First International Conference on Internet-of-Things Design and Implementation (IoTDI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis/2012/1536/0/06211128",
"title": "Evaluation of Quality Measure Factors for the Middleware Based Context-Aware Applications",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2012/06211128/12OmNxwENGh",
"parentPublication": {
"id": "proceedings/icis/2012/1536/0",
"title": "2012 IEEE/ACIS 11th International Conference on Computer and Information Science (ICIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iotdi/2016/9948/0/9948a293",
"title": "Extending T-Res with Mobility for Context-Aware IoT",
"doi": null,
"abstractUrl": "/proceedings-article/iotdi/2016/9948a293/12OmNz5JCcj",
"parentPublication": {
"id": "proceedings/iotdi/2016/9948/0",
"title": "2016 IEEE First International Conference on Internet-of-Things Design and Implementation (IoTDI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/pc/2006/02/b2048",
"title": "Context-Aware Artifacts: Two Development Approaches",
"doi": null,
"abstractUrl": "/magazine/pc/2006/02/b2048/13rRUxAStXX",
"parentPublication": {
"id": "mags/pc",
"title": "IEEE Pervasive Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/10/mco2013100105",
"title": "Activity Recognition for the Mind: Toward a Cognitive \"Quantified Self\"",
"doi": null,
"abstractUrl": "/magazine/co/2013/10/mco2013100105/13rRUxBrGb8",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mpc2014030076",
"articleId": "13rRUNvgz7g",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mpc2014030084",
"articleId": "13rRUwjGoDv",
"__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": "13rRUwgQpqG",
"doi": "10.1109/TVCG.2007.70541",
"abstract": "Information visualization has often focused on providing deep insight for expert user populations and on techniques for amplifying cognition through complicated interactive visual models. This paper proposes a new subdomain for infovis research that complements the focus on analytic tasks and expert use. Instead of work-related and analytically driven infovis, we propose Casual Information Visualization (or Casual Infovis) as a complement to more traditional infovis domains. Traditional infovis systems, techniques, and methods do not easily lend themselves to the broad range of user populations, from expert to novices, or from work tasks to more everyday situations. We propose definitions, perspectives, and research directions for further investigations of this emerging subfield. These perspectives build from ambient information visualization [32], social visualization, and also from artistic work that visualizes information [41]. We seek to provide a perspective on infovis that integrates these research agendas under a coherent vocabulary and framework for design. We enumerate the following contributions. First, we demonstrate how blurry the boundary of infovis is by examining systems that exhibit many of the putative proper ties of infovis systems, but perhaps would not be considered so. Second, we explore the notion of insight and how, instead of a monolithic definition of insight, there may be multiple types, each with particular characteristics. Third, we discuss design challenges for systems intended for casual audiences. Finally we conclude with challenges for system evaluation in this emerging subfield.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Information visualization has often focused on providing deep insight for expert user populations and on techniques for amplifying cognition through complicated interactive visual models. This paper proposes a new subdomain for infovis research that complements the focus on analytic tasks and expert use. Instead of work-related and analytically driven infovis, we propose Casual Information Visualization (or Casual Infovis) as a complement to more traditional infovis domains. Traditional infovis systems, techniques, and methods do not easily lend themselves to the broad range of user populations, from expert to novices, or from work tasks to more everyday situations. We propose definitions, perspectives, and research directions for further investigations of this emerging subfield. These perspectives build from ambient information visualization [32], social visualization, and also from artistic work that visualizes information [41]. We seek to provide a perspective on infovis that integrates these research agendas under a coherent vocabulary and framework for design. We enumerate the following contributions. First, we demonstrate how blurry the boundary of infovis is by examining systems that exhibit many of the putative proper ties of infovis systems, but perhaps would not be considered so. Second, we explore the notion of insight and how, instead of a monolithic definition of insight, there may be multiple types, each with particular characteristics. Third, we discuss design challenges for systems intended for casual audiences. Finally we conclude with challenges for system evaluation in this emerging subfield.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Information visualization has often focused on providing deep insight for expert user populations and on techniques for amplifying cognition through complicated interactive visual models. This paper proposes a new subdomain for infovis research that complements the focus on analytic tasks and expert use. Instead of work-related and analytically driven infovis, we propose Casual Information Visualization (or Casual Infovis) as a complement to more traditional infovis domains. Traditional infovis systems, techniques, and methods do not easily lend themselves to the broad range of user populations, from expert to novices, or from work tasks to more everyday situations. We propose definitions, perspectives, and research directions for further investigations of this emerging subfield. These perspectives build from ambient information visualization [32], social visualization, and also from artistic work that visualizes information [41]. We seek to provide a perspective on infovis that integrates these research agendas under a coherent vocabulary and framework for design. We enumerate the following contributions. First, we demonstrate how blurry the boundary of infovis is by examining systems that exhibit many of the putative proper ties of infovis systems, but perhaps would not be considered so. Second, we explore the notion of insight and how, instead of a monolithic definition of insight, there may be multiple types, each with particular characteristics. Third, we discuss design challenges for systems intended for casual audiences. Finally we conclude with challenges for system evaluation in this emerging subfield.",
"title": "Casual Information Visualization: Depictions of Data in Everyday Life",
"normalizedTitle": "Casual Information Visualization: Depictions of Data in Everyday Life",
"fno": "v1145",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Casual Information Visualization",
"Cognition",
"Interactive Visual Model",
"Casual Infovis",
"Casual Audiences",
"System Evaluation",
"Ambient Infovis",
"Social Infovis",
"Data Visualization",
"Information Analysis",
"Cognition",
"Focusing",
"Vocabulary",
"Finance",
"Government",
"Refining",
"Testing",
"Technology Management",
"Casual Information Visualization",
"Ambient Infovis",
"Social Infovis",
"Editorial",
"Design",
"Evaluation"
],
"authors": [
{
"givenName": "Zachary",
"surname": "Pousman",
"fullName": "Zachary Pousman",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Stasko",
"fullName": "John Stasko",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Mateas",
"fullName": "Michael Mateas",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2007-11-01 00:00:00",
"pubType": "trans",
"pages": "1145-1152",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2010/6685/0/05429617",
"title": "Advanced interaction for Information Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2010/05429617/12OmNBqdr33",
"parentPublication": {
"id": "proceedings/pacificvis/2010/6685/0",
"title": "2010 IEEE Pacific Visualization Symposium (PacificVis 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2015/6879/0/07156366",
"title": "Text visualization techniques: Taxonomy, visual survey, and community insights",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156366/12OmNqAU6t7",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2012/4525/0/4525b824",
"title": "The Role of Social Interaction Filter and Visualization in Casual Browsing",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2012/4525b824/12OmNqBtj94",
"parentPublication": {
"id": "proceedings/hicss/2012/4525/0",
"title": "2012 45th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2009/3733/0/3733a018",
"title": "A Framework to Analyze Information Visualization Based on the Functional Data Model",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2009/3733a018/12OmNvT2oXb",
"parentPublication": {
"id": "proceedings/iv/2009/3733/0",
"title": "2009 13th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmv/2007/2903/0/29030076",
"title": "Requirements for coordinated multiple view visualization systems for industrial applications",
"doi": null,
"abstractUrl": "/proceedings-article/cmv/2007/29030076/12OmNxA3YRg",
"parentPublication": {
"id": "proceedings/cmv/2007/2903/0",
"title": "Coordinated and Multiple Views in Exploratory Visualization, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2015/7568/0/7568a228",
"title": "A Concurrent Architecture Proposal for Information Visualization Pipeline",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2015/7568a228/12OmNxZ2Glk",
"parentPublication": {
"id": "proceedings/iv/2015/7568/0",
"title": "2015 19th International Conference on Information Visualisation (iV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061173",
"title": "Distributed Cognition as a Theoretical Framework for Information Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061173/13rRUwI5TQQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122689",
"title": "Beyond Mouse and Keyboard: Expanding Design Considerations for Information Visualization Interactions",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122689/13rRUwInvsO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2009/04/mcg2009040086",
"title": "Motivation and Procrastination: Methods for Evaluating Pragmatic Casual Information Visualizations",
"doi": null,
"abstractUrl": "/magazine/cg/2009/04/mcg2009040086/13rRUxN5evF",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2018/06/08617746",
"title": "Graphoto: Aesthetically Pleasing Charts for Casual Information Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2018/06/08617746/17D45Xbl4Oc",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1137",
"articleId": "13rRUx0gefh",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04376148",
"articleId": "13rRUxNW1Zf",
"__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": "13rRUxAASSX",
"doi": "10.1109/TVCG.2008.109",
"abstract": "Interaction cost is an important but poorly understood factor in visualization design. We propose a framework of interaction costs inspired by Norman’s Seven Stages of Action to facilitate study. From 484 papers, we collected 61 interaction-related usability problems reported in 32 user studies and placed them into our framework of seven costs: (1) Decision costs to form goals; (2) System-power costs to form system operations; (3) Multiple input mode costs to form physical sequences; (4) Physical-motion costs to execute sequences; (5) Visual-cluttering costs to perceive state; (6) View-change costs to interpret perception; (7) State-change costs to evaluate interpretation. We also suggested ways to narrow the gulfs of execution (2–4) and evaluation (5–7) based on collected reports. Our framework suggests a need to consider decision costs (1) as the gulf of goal formation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Interaction cost is an important but poorly understood factor in visualization design. We propose a framework of interaction costs inspired by Norman’s Seven Stages of Action to facilitate study. From 484 papers, we collected 61 interaction-related usability problems reported in 32 user studies and placed them into our framework of seven costs: (1) Decision costs to form goals; (2) System-power costs to form system operations; (3) Multiple input mode costs to form physical sequences; (4) Physical-motion costs to execute sequences; (5) Visual-cluttering costs to perceive state; (6) View-change costs to interpret perception; (7) State-change costs to evaluate interpretation. We also suggested ways to narrow the gulfs of execution (2–4) and evaluation (5–7) based on collected reports. Our framework suggests a need to consider decision costs (1) as the gulf of goal formation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Interaction cost is an important but poorly understood factor in visualization design. We propose a framework of interaction costs inspired by Norman’s Seven Stages of Action to facilitate study. From 484 papers, we collected 61 interaction-related usability problems reported in 32 user studies and placed them into our framework of seven costs: (1) Decision costs to form goals; (2) System-power costs to form system operations; (3) Multiple input mode costs to form physical sequences; (4) Physical-motion costs to execute sequences; (5) Visual-cluttering costs to perceive state; (6) View-change costs to interpret perception; (7) State-change costs to evaluate interpretation. We also suggested ways to narrow the gulfs of execution (2–4) and evaluation (5–7) based on collected reports. Our framework suggests a need to consider decision costs (1) as the gulf of goal formation.",
"title": "A Framework of Interaction Costs in Information Visualization",
"normalizedTitle": "A Framework of Interaction Costs in Information Visualization",
"fno": "ttg2008061149",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Interaction",
"Information Visualization",
"Framework",
"Interface Evaluation"
],
"authors": [
{
"givenName": "Heidi",
"surname": "Lam",
"fullName": "Heidi Lam",
"affiliation": "University of British Columbia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1149-1156",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ozchi/1998/9206/0/92060168",
"title": "Declarative Interaction with Geographical Information Systems",
"doi": null,
"abstractUrl": "/proceedings-article/ozchi/1998/92060168/12OmNAWpyxO",
"parentPublication": {
"id": "proceedings/ozchi/1998/9206/0",
"title": "Computer-Human Interaction, Australasian Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisip/2005/9588/0/01619418",
"title": "Predict Protein-Protein Interaction using Heuristic Approaches",
"doi": null,
"abstractUrl": "/proceedings-article/icisip/2005/01619418/12OmNBbsiiH",
"parentPublication": {
"id": "proceedings/icisip/2005/9588/0",
"title": "Proceedings. Third International Conference on Intelligent Sensing and Information Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2010/6685/0/05429617",
"title": "Advanced interaction for Information Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2010/05429617/12OmNBqdr33",
"parentPublication": {
"id": "proceedings/pacificvis/2010/6685/0",
"title": "2010 IEEE Pacific Visualization Symposium (PacificVis 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/achi/2010/3957/0/3957a079",
"title": "A Simulation Framework for Human-Robot Interaction",
"doi": null,
"abstractUrl": "/proceedings-article/achi/2010/3957a079/12OmNqOffu5",
"parentPublication": {
"id": "proceedings/achi/2010/3957/0",
"title": "International Conference on Advances in Computer-Human Interaction",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/micro/2003/2043/0/20430228",
"title": "Using Interaction Costs for Microarchitectural Bottleneck Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/micro/2003/20430228/12OmNvjgWuy",
"parentPublication": {
"id": "proceedings/micro/2003/2043/0",
"title": "Proceedings. 36th Annual IEEE/ACM International Symposium on Microarchitecture, 2003. MICRO-36.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/04376144",
"title": "Toward a Deeper Understanding of the Role of Interaction in Information Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/04376144/13rRUNvyakD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061173",
"title": "Distributed Cognition as a Theoretical Framework for Information Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061173/13rRUwI5TQQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061587",
"title": "Novel interaction techniques for neurosurgical planning and stereotactic navigation",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061587/13rRUwh80uv",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061181",
"title": "EMDialog: Bringing Information Visualization into the Museum",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061181/13rRUxBJhvp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1224",
"title": "Toward a Deeper Understanding of the Role of Interaction in Information Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1224/13rRUxD9gXy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061141",
"articleId": "13rRUyuegp1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061157",
"articleId": "13rRUxASuAr",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyvY9nY",
"title": "June",
"year": "2005",
"issueNum": "06",
"idPrefix": "ts",
"pubType": "journal",
"volume": "31",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0xPVG",
"doi": "10.1109/TSE.2005.72",
"abstract": "We apply data mining to version histories in order to guide programmers along related changes: \"Programmers who changed these functions also changed....\" Given a set of existing changes, the mined association rules 1) suggest and predict likely further changes, 2) show up item coupling that is undetectable by program analysis, and 3) can prevent errors due to incomplete changes. After an initial change, our ROSE prototype can correctly predict further locations to be changed; the best predictive power is obtained for changes to existing software. In our evaluation based on the history of eight popular open source projects, ROSE's topmost three suggestions contained a correct location with a likelihood of more than 70 percent.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We apply data mining to version histories in order to guide programmers along related changes: \"Programmers who changed these functions also changed....\" Given a set of existing changes, the mined association rules 1) suggest and predict likely further changes, 2) show up item coupling that is undetectable by program analysis, and 3) can prevent errors due to incomplete changes. After an initial change, our ROSE prototype can correctly predict further locations to be changed; the best predictive power is obtained for changes to existing software. In our evaluation based on the history of eight popular open source projects, ROSE's topmost three suggestions contained a correct location with a likelihood of more than 70 percent.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We apply data mining to version histories in order to guide programmers along related changes: \"Programmers who changed these functions also changed....\" Given a set of existing changes, the mined association rules 1) suggest and predict likely further changes, 2) show up item coupling that is undetectable by program analysis, and 3) can prevent errors due to incomplete changes. After an initial change, our ROSE prototype can correctly predict further locations to be changed; the best predictive power is obtained for changes to existing software. In our evaluation based on the history of eight popular open source projects, ROSE's topmost three suggestions contained a correct location with a likelihood of more than 70 percent.",
"title": "Mining Version Histories to Guide Software Changes",
"normalizedTitle": "Mining Version Histories to Guide Software Changes",
"fno": "e0429",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Index Terms Programming Environments Construction Tools",
"Distribution",
"Maintenance",
"Enhancement",
"Configuration Management",
"Clustering",
"Classification",
"Association Rules",
"Data Mining"
],
"authors": [
{
"givenName": "Thomas",
"surname": "Zimmermann",
"fullName": "Thomas Zimmermann",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter",
"surname": "Weißgerber",
"fullName": "Peter Weißgerber",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stephan",
"surname": "Diehl",
"fullName": "Stephan Diehl",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andreas",
"surname": "Zeller",
"fullName": "Andreas Zeller",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2005-06-01 00:00:00",
"pubType": "trans",
"pages": "429-445",
"year": "2005",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icsm/2013/4981/0/4981a416",
"title": "Towards Understanding Large-Scale Adaptive Changes from Version Histories",
"doi": null,
"abstractUrl": "/proceedings-article/icsm/2013/4981a416/12OmNAMtAMd",
"parentPublication": {
"id": "proceedings/icsm/2013/4981/0",
"title": "2013 IEEE International Conference on Software Maintenance (ICSM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2004/2163/0/21630563",
"title": "Mining Version Histories to Guide Software Changes",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2004/21630563/12OmNBqMDwi",
"parentPublication": {
"id": "proceedings/icse/2004/2163/0",
"title": "Proceedings. 26th International Conference on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issre/2011/4568/0/4568a060",
"title": "Mining Cause-Effect-Chains from Version Histories",
"doi": null,
"abstractUrl": "/proceedings-article/issre/2011/4568a060/12OmNvo67ER",
"parentPublication": {
"id": "proceedings/issre/2011/4568/0",
"title": "2011 IEEE 22nd International Symposium on Software Reliability Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2011/0445/0/04450351",
"title": "Non-essential changes in version histories",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2011/04450351/12OmNxTEiPG",
"parentPublication": {
"id": "proceedings/icse/2011/0445/0",
"title": "2011 33rd International Conference on Software Engineering (ICSE 2011)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rsse/2012/1758/0/06233415",
"title": "Interaction histories mining for software change guide",
"doi": null,
"abstractUrl": "/proceedings-article/rsse/2012/06233415/12OmNxbW4Qf",
"parentPublication": {
"id": "proceedings/rsse/2012/1758/0",
"title": "2012 Third International Workshop on Recommendation Systems for Software Engineering (RSSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itng/2010/3984/0/3984a950",
"title": "Predicting Function Changes by Mining Revision History",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2010/3984a950/12OmNyxFKkg",
"parentPublication": {
"id": "proceedings/itng/2010/3984/0",
"title": "Information Technology: New Generations, Third International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsec/2008/3446/0/3446a343",
"title": "Formalization and Consistency Checking of Changes of Software System Configurations Using Alloy",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2008/3446a343/12OmNzIl3tM",
"parentPublication": {
"id": "proceedings/apsec/2008/3446/0",
"title": "2008 15th Asia-Pacific Software Engineering Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/2009/01/mso2009010024",
"title": "Guest Editors' Introduction: Mining Software Archives",
"doi": null,
"abstractUrl": "/magazine/so/2009/01/mso2009010024/13rRUB6SpYw",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2004/09/e0574",
"title": "Predicting Source Code Changes by Mining Change History",
"doi": null,
"abstractUrl": "/journal/ts/2004/09/e0574/13rRUwInvgO",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2015/05/06963448",
"title": "Mining Version Histories for Detecting Code Smells",
"doi": null,
"abstractUrl": "/journal/ts/2015/05/06963448/13rRUyogGBX",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "e0446",
"articleId": "13rRUxCitL8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvDI3IR",
"title": "Feb.",
"year": "2018",
"issueNum": "02",
"idPrefix": "ts",
"pubType": "journal",
"volume": "44",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5oP",
"doi": "10.1109/TSE.2017.2664824",
"abstract": "Software developers often need to transfer functionality, e.g., a set of commits implementing a new feature or a bug fix, from one branch of a configuration management system to another. That can be a challenging task as the existing configuration management tools lack support for matching high-level, semantic functionality with low-level version histories. The developer thus has to either manually identify the exact set of semantically-related commits implementing the functionality of interest or sequentially port a segment of the change history, “inheriting” additional, unwanted functionality. In this paper, we tackle this problem by providing automated support for identifying the set of semantically-related commits implementing a particular functionality, which is defined by a set of tests. We formally define the semantic slicing problem, provide an algorithm for identifying a set of commits that constitute a slice, and propose techniques to minimize the produced slice. We then instantiate the overall approach, CSlicer, in a specific implementation for Java projects managed in Git and evaluate its correctness and effectiveness on a set of open-source software repositories. We show that it allows to identify subsets of change histories that maintain the functionality of interest but are substantially smaller than the original ones.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Software developers often need to transfer functionality, e.g., a set of commits implementing a new feature or a bug fix, from one branch of a configuration management system to another. That can be a challenging task as the existing configuration management tools lack support for matching high-level, semantic functionality with low-level version histories. The developer thus has to either manually identify the exact set of semantically-related commits implementing the functionality of interest or sequentially port a segment of the change history, “inheriting” additional, unwanted functionality. In this paper, we tackle this problem by providing automated support for identifying the set of semantically-related commits implementing a particular functionality, which is defined by a set of tests. We formally define the semantic slicing problem, provide an algorithm for identifying a set of commits that constitute a slice, and propose techniques to minimize the produced slice. We then instantiate the overall approach, CSlicer, in a specific implementation for Java projects managed in Git and evaluate its correctness and effectiveness on a set of open-source software repositories. We show that it allows to identify subsets of change histories that maintain the functionality of interest but are substantially smaller than the original ones.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Software developers often need to transfer functionality, e.g., a set of commits implementing a new feature or a bug fix, from one branch of a configuration management system to another. That can be a challenging task as the existing configuration management tools lack support for matching high-level, semantic functionality with low-level version histories. The developer thus has to either manually identify the exact set of semantically-related commits implementing the functionality of interest or sequentially port a segment of the change history, “inheriting” additional, unwanted functionality. In this paper, we tackle this problem by providing automated support for identifying the set of semantically-related commits implementing a particular functionality, which is defined by a set of tests. We formally define the semantic slicing problem, provide an algorithm for identifying a set of commits that constitute a slice, and propose techniques to minimize the produced slice. We then instantiate the overall approach, CSlicer, in a specific implementation for Java projects managed in Git and evaluate its correctness and effectiveness on a set of open-source software repositories. We show that it allows to identify subsets of change histories that maintain the functionality of interest but are substantially smaller than the original ones.",
"title": "Semantic Slicing of Software Version Histories",
"normalizedTitle": "Semantic Slicing of Software Version Histories",
"fno": "07843626",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"History",
"Semantics",
"Software",
"Minimization",
"Context",
"Computer Bugs",
"Java",
"Software Changes",
"Version Control",
"Dependency",
"Program Analysis"
],
"authors": [
{
"givenName": "Yi",
"surname": "Li",
"fullName": "Yi Li",
"affiliation": "Department of Computer Science, University of Toronto, Toronto, ON, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chenguang",
"surname": "Zhu",
"fullName": "Chenguang Zhu",
"affiliation": "Department of Computer Science, University of Toronto, Toronto, ON, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Julia",
"surname": "Rubin",
"fullName": "Julia Rubin",
"affiliation": "Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, BC, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marsha",
"surname": "Chechik",
"fullName": "Marsha Chechik",
"affiliation": "Department of Computer Science, University of Toronto, Toronto, ON, Canada",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2018-02-01 00:00:00",
"pubType": "trans",
"pages": "182-201",
"year": "2018",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icsm/2013/4981/0/4981a416",
"title": "Towards Understanding Large-Scale Adaptive Changes from Version Histories",
"doi": null,
"abstractUrl": "/proceedings-article/icsm/2013/4981a416/12OmNAMtAMd",
"parentPublication": {
"id": "proceedings/icsm/2013/4981/0",
"title": "2013 IEEE International Conference on Software Maintenance (ICSM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msr/2012/1760/0/06224299",
"title": "Incorporating version histories in Information Retrieval based bug localization",
"doi": null,
"abstractUrl": "/proceedings-article/msr/2012/06224299/12OmNASraEr",
"parentPublication": {
"id": "proceedings/msr/2012/1760/0",
"title": "2012 9th IEEE Working Conference on Mining Software Repositories (MSR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msr/2017/1544/0/07962412",
"title": "A Dataset for Dynamic Discovery of Semantic Changes in Version Controlled Software Histories",
"doi": null,
"abstractUrl": "/proceedings-article/msr/2017/07962412/12OmNB7LvDr",
"parentPublication": {
"id": "proceedings/msr/2017/1544/0",
"title": "2017 IEEE/ACM 14th International Conference on Mining Software Repositories (MSR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2016/3845/0/07582785",
"title": "Precise semantic history slicing through dynamic delta refinement",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2016/07582785/12OmNBSBkaA",
"parentPublication": {
"id": "proceedings/ase/2016/3845/0",
"title": "2016 31st IEEE/ACM International Conference on Automated Software Engineering (ASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2017/2684/0/08115722",
"title": "Managing software evolution through semantic history slicing",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2017/08115722/12OmNBqdrb9",
"parentPublication": {
"id": "proceedings/ase/2017/2684/0",
"title": "2017 32nd IEEE/ACM International Conference on Automated Software Engineering (ASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2015/0025/0/0025a686",
"title": "Semantic Slicing of Software Version Histories (T)",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2015/0025a686/12OmNvpew7t",
"parentPublication": {
"id": "proceedings/ase/2015/0025/0",
"title": "2015 30th IEEE/ACM International Conference on Automated Software Engineering (ASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2012/1066/0/06227193",
"title": "Bug prediction based on fine-grained module histories",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2012/06227193/12OmNzICEK8",
"parentPublication": {
"id": "proceedings/icse/2012/1066/0",
"title": "2012 34th International Conference on Software Engineering (ICSE 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-companion/2018/5663/0/566301a057",
"title": "CSlicerCloud: A Web-Based Semantic History Slicing Framework",
"doi": null,
"abstractUrl": "/proceedings-article/icse-companion/2018/566301a057/13bd1fWcuDk",
"parentPublication": {
"id": "proceedings/icse-companion/2018/5663/0",
"title": "2018 IEEE/ACM 40th International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msr/2019/3412/0/341200a555",
"title": "The Impact of Systematic Edits in History Slicing",
"doi": null,
"abstractUrl": "/proceedings-article/msr/2019/341200a555/1dx9ARcaK88",
"parentPublication": {
"id": "proceedings/msr/2019/3412/0",
"title": "2019 IEEE/ACM 16th International Conference on Mining Software Repositories (MSR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsme/2020/5619/0/561900a081",
"title": "GenSlice: Generalized Semantic History Slicing",
"doi": null,
"abstractUrl": "/proceedings-article/icsme/2020/561900a081/1oqKJ59LkFa",
"parentPublication": {
"id": "proceedings/icsme/2020/5619/0",
"title": "2020 IEEE International Conference on Software Maintenance and Evolution (ICSME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07859416",
"articleId": "13rRUxcsYNK",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNz5apwV",
"title": "July",
"year": "2005",
"issueNum": "07",
"idPrefix": "tk",
"pubType": "journal",
"volume": "17",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5xw",
"doi": "10.1109/TKDE.2005.115",
"abstract": "With the cutting edge technology advance in wireless and mobile computers, the query processing in a mobile environment involves join processing among different sites which include static servers and mobile computers. Because of the need for energy saving and also the presence of asymmetric features in a mobile computing environment, the conventional query processing for a distributed database cannot be directly applied to a mobile computing system. In this paper, we first explore three asymmetric features of a mobile environment. Then, in light of these features, we devise query processing methods for both join and query processing. Intuitively, employing semijoin operations in a mobile computing environment is able to further reduce both the amount of data transmission and energy consumption. A semijoin which is initiated by a mobile computer (respectively, the server) and is beneficial to reduce the cost of a join operation is termed a mobile-initiated or MI (respectively, server-initiated or SI) profitable semijoin. According to those asymmetric features of a mobile computing system, we examine three different join methods and devise some specific criteria to identify MI/SI profitable semijoins. For query processing, which refers to the processing of multijoin queries, we develop three query processing schemes. In particular, we formulate the query processing in a mobile computing system as a two-phase query processing procedure that can determine a join sequence and interleave that join sequence with SI profitable semijoins to reduce both the amount of data transmission and energy consumption. Performance of these join and query methods is comparatively analyzed and sensitivity analysis on several parameters is conducted. Furthermore, we develop a systematic procedure to derive the characteristic functions of MI and SI profitable semijoins. It is noted that, given some system parameters, those characteristic functions are very important in determining which join method is the most appropriate one to employ in that configuration. It is shown by our simulation results that, by exploiting the three asymmetric features, these characteristic functions are very powerful in reducing both the amounts of energy consumption and data transmission incurred and can lead to the design of an efficient and effective query processing procedure for a mobile computing environment.",
"abstracts": [
{
"abstractType": "Regular",
"content": "With the cutting edge technology advance in wireless and mobile computers, the query processing in a mobile environment involves join processing among different sites which include static servers and mobile computers. Because of the need for energy saving and also the presence of asymmetric features in a mobile computing environment, the conventional query processing for a distributed database cannot be directly applied to a mobile computing system. In this paper, we first explore three asymmetric features of a mobile environment. Then, in light of these features, we devise query processing methods for both join and query processing. Intuitively, employing semijoin operations in a mobile computing environment is able to further reduce both the amount of data transmission and energy consumption. A semijoin which is initiated by a mobile computer (respectively, the server) and is beneficial to reduce the cost of a join operation is termed a mobile-initiated or MI (respectively, server-initiated or SI) profitable semijoin. According to those asymmetric features of a mobile computing system, we examine three different join methods and devise some specific criteria to identify MI/SI profitable semijoins. For query processing, which refers to the processing of multijoin queries, we develop three query processing schemes. In particular, we formulate the query processing in a mobile computing system as a two-phase query processing procedure that can determine a join sequence and interleave that join sequence with SI profitable semijoins to reduce both the amount of data transmission and energy consumption. Performance of these join and query methods is comparatively analyzed and sensitivity analysis on several parameters is conducted. Furthermore, we develop a systematic procedure to derive the characteristic functions of MI and SI profitable semijoins. It is noted that, given some system parameters, those characteristic functions are very important in determining which join method is the most appropriate one to employ in that configuration. It is shown by our simulation results that, by exploiting the three asymmetric features, these characteristic functions are very powerful in reducing both the amounts of energy consumption and data transmission incurred and can lead to the design of an efficient and effective query processing procedure for a mobile computing environment.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "With the cutting edge technology advance in wireless and mobile computers, the query processing in a mobile environment involves join processing among different sites which include static servers and mobile computers. Because of the need for energy saving and also the presence of asymmetric features in a mobile computing environment, the conventional query processing for a distributed database cannot be directly applied to a mobile computing system. In this paper, we first explore three asymmetric features of a mobile environment. Then, in light of these features, we devise query processing methods for both join and query processing. Intuitively, employing semijoin operations in a mobile computing environment is able to further reduce both the amount of data transmission and energy consumption. A semijoin which is initiated by a mobile computer (respectively, the server) and is beneficial to reduce the cost of a join operation is termed a mobile-initiated or MI (respectively, server-initiated or SI) profitable semijoin. According to those asymmetric features of a mobile computing system, we examine three different join methods and devise some specific criteria to identify MI/SI profitable semijoins. For query processing, which refers to the processing of multijoin queries, we develop three query processing schemes. In particular, we formulate the query processing in a mobile computing system as a two-phase query processing procedure that can determine a join sequence and interleave that join sequence with SI profitable semijoins to reduce both the amount of data transmission and energy consumption. Performance of these join and query methods is comparatively analyzed and sensitivity analysis on several parameters is conducted. Furthermore, we develop a systematic procedure to derive the characteristic functions of MI and SI profitable semijoins. It is noted that, given some system parameters, those characteristic functions are very important in determining which join method is the most appropriate one to employ in that configuration. It is shown by our simulation results that, by exploiting the three asymmetric features, these characteristic functions are very powerful in reducing both the amounts of energy consumption and data transmission incurred and can lead to the design of an efficient and effective query processing procedure for a mobile computing environment.",
"title": "Query Processing in a Mobile Computing Environment: Exploiting the Features of Asymmetry",
"normalizedTitle": "Query Processing in a Mobile Computing Environment: Exploiting the Features of Asymmetry",
"fno": "k0982",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Index Terms Mobile Database",
"Mobile Computing",
"Query Processing",
"Join Method"
],
"authors": [
{
"givenName": "Wen-Chih",
"surname": "Peng",
"fullName": "Wen-Chih Peng",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ming-Syan",
"surname": "Chen",
"fullName": "Ming-Syan Chen",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2005-07-01 00:00:00",
"pubType": "trans",
"pages": "982-996",
"year": "2005",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/is3c/2012/4655/0/4655a686",
"title": "An Efficient Theta-Join Query Processing Algorithm on MapReduce Framework",
"doi": null,
"abstractUrl": "/proceedings-article/is3c/2012/4655a686/12OmNA0dMKP",
"parentPublication": {
"id": "proceedings/is3c/2012/4655/0",
"title": "Computer, Consumer and Control, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dpds/1990/2052/0/00113703",
"title": "Using join operations as reducers in distributed query processing",
"doi": null,
"abstractUrl": "/proceedings-article/dpds/1990/00113703/12OmNAZfxKf",
"parentPublication": {
"id": "proceedings/dpds/1990/2052/0",
"title": "Proceedings Second International Symposium on Databases in Parallel and Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/1991/2138/0/00131452",
"title": "Determining beneficial semijoins for a join sequence in distributed query processing",
"doi": null,
"abstractUrl": "/proceedings-article/icde/1991/00131452/12OmNB8Cj0m",
"parentPublication": {
"id": "proceedings/icde/1991/2138/0",
"title": "Proceedings. Seventh International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccnt/2010/4042/0/4042a239",
"title": "Location Dependent Query Processing ",
"doi": null,
"abstractUrl": "/proceedings-article/iccnt/2010/4042a239/12OmNBIFmsq",
"parentPublication": {
"id": "proceedings/iccnt/2010/4042/0",
"title": "Computer and Network Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/1990/2048/0/00089300",
"title": "Using combination of join and semijoin operations for distributed query processing",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/1990/00089300/12OmNBlFQWX",
"parentPublication": {
"id": "proceedings/icdcs/1990/2048/0",
"title": "Proceedings.,10th International Conference on Distributed Computing Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/2001/1077/0/10770439",
"title": "Distributed Query Processing in the Internet: Exploring Relation Replication and Network Characteristics",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2001/10770439/12OmNC4wtJc",
"parentPublication": {
"id": "proceedings/icdcs/2001/1077/0",
"title": "Proceedings 21st International Conference on Distributed Computing Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2000/06/k0920",
"title": "Exploiting Spatial Indexes for Semijoin-Based Join Processing in Distributed Spatial Databases",
"doi": null,
"abstractUrl": "/journal/tk/2000/06/k0920/13rRUwghd9n",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/1992/05/l0611",
"title": "Interleaving a Join Sequence with Semijoins in Distributed Query Processing",
"doi": null,
"abstractUrl": "/journal/td/1992/05/l0611/13rRUxBJhuI",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2002/10/t1182",
"title": "Processing Distributed Mobile Queries with Interleaved Remote Mobile Joins",
"doi": null,
"abstractUrl": "/journal/tc/2002/10/t1182/13rRUxBJhum",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/1993/03/k0534",
"title": "Combining Joint and Semi-Join Operations for Distributed Query Processing",
"doi": null,
"abstractUrl": "/journal/tk/1993/03/k0534/13rRUxC0SP6",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "k0969",
"articleId": "13rRUwj7cpw",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "k0997",
"articleId": "13rRUygT7nd",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCxL9Vs",
"title": "March",
"year": "2006",
"issueNum": "03",
"idPrefix": "tk",
"pubType": "journal",
"volume": "18",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxYIN4r",
"doi": "10.1109/TKDE.2006.51",
"abstract": "In many advanced applications, data are described by multiple high-dimensional features. Moreover, different queries may weight these features differently; some may not even specify all the features. In this paper, we propose our solution to support efficient query processing in these applications. We devise a novel representation that compactly captures f features into two components: The first component is a 2D vector that reflects a distance range (minimum and maximum values) of the f features with respect to a reference point (the center of the space) in a metric space and the second component is a bit signature, with two bits per dimension, obtained by analyzing each feature's descending energy histogram. This representation enables two levels of filtering: The first component prunes away points that do not share similar distance ranges, while the bit signature filters away points based on the dimensions of the relevant features. Moreover, the representation facilitates the use of a single index structure to further speed up processing. We employ the classical B^+{\\hbox{-}}\\rm tree for this purpose. We also propose a KNN search algorithm that exploits the access orders of critical dimensions of highly selective features and partial distances to prune the search space more effectively. Our extensive experiments on both real-life and synthetic data sets show that the proposed solution offers significant performance advantages over sequential scan and retrieval methods using single and multiple VA-files.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In many advanced applications, data are described by multiple high-dimensional features. Moreover, different queries may weight these features differently; some may not even specify all the features. In this paper, we propose our solution to support efficient query processing in these applications. We devise a novel representation that compactly captures f features into two components: The first component is a 2D vector that reflects a distance range (minimum and maximum values) of the f features with respect to a reference point (the center of the space) in a metric space and the second component is a bit signature, with two bits per dimension, obtained by analyzing each feature's descending energy histogram. This representation enables two levels of filtering: The first component prunes away points that do not share similar distance ranges, while the bit signature filters away points based on the dimensions of the relevant features. Moreover, the representation facilitates the use of a single index structure to further speed up processing. We employ the classical B^+{\\hbox{-}}\\rm tree for this purpose. We also propose a KNN search algorithm that exploits the access orders of critical dimensions of highly selective features and partial distances to prune the search space more effectively. Our extensive experiments on both real-life and synthetic data sets show that the proposed solution offers significant performance advantages over sequential scan and retrieval methods using single and multiple VA-files.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In many advanced applications, data are described by multiple high-dimensional features. Moreover, different queries may weight these features differently; some may not even specify all the features. In this paper, we propose our solution to support efficient query processing in these applications. We devise a novel representation that compactly captures f features into two components: The first component is a 2D vector that reflects a distance range (minimum and maximum values) of the f features with respect to a reference point (the center of the space) in a metric space and the second component is a bit signature, with two bits per dimension, obtained by analyzing each feature's descending energy histogram. This representation enables two levels of filtering: The first component prunes away points that do not share similar distance ranges, while the bit signature filters away points based on the dimensions of the relevant features. Moreover, the representation facilitates the use of a single index structure to further speed up processing. We employ the classical B^+{\\hbox{-}}\\rm tree for this purpose. We also propose a KNN search algorithm that exploits the access orders of critical dimensions of highly selective features and partial distances to prune the search space more effectively. Our extensive experiments on both real-life and synthetic data sets show that the proposed solution offers significant performance advantages over sequential scan and retrieval methods using single and multiple VA-files.",
"title": "Toward Efficient Multifeature Query Processing",
"normalizedTitle": "Toward Efficient Multifeature Query Processing",
"fno": "k0350",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Index Terms Multifeature",
"Indexing",
"Query Processing",
"High Dimensional",
"Weighted Query"
],
"authors": [
{
"givenName": "H.V.",
"surname": "Jagadish",
"fullName": "H.V. Jagadish",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Beng Chin",
"surname": "Ooi",
"fullName": "Beng Chin Ooi",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Heng Tao",
"surname": "Shen",
"fullName": "Heng Tao Shen",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kian-Lee",
"surname": "Tan",
"fullName": "Kian-Lee Tan",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2006-03-01 00:00:00",
"pubType": "trans",
"pages": "350-362",
"year": "2006",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/waina/2012/4652/0/4652a197",
"title": "Supporting Efficient XML Query Evaluation Using Double Indexes",
"doi": null,
"abstractUrl": "/proceedings-article/waina/2012/4652a197/12OmNAJVcDn",
"parentPublication": {
"id": "proceedings/waina/2012/4652/0",
"title": "2012 26th International Conference on Advanced Information Networking and Applications Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sutc/2006/2553/1/255310530",
"title": "On Range Query Indexing for Efficient Stream Processing",
"doi": null,
"abstractUrl": "/proceedings-article/sutc/2006/255310530/12OmNBOUxj3",
"parentPublication": {
"id": "proceedings/sutc/2006/2553/1",
"title": "Proceedings. IEEE International Conference on Sensor Networks, Ubiquitous and Trustworthy Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/waim/2008/3185/0/3185a113",
"title": "SIMP: Efficient XML Structural Index for Multiple Query Processing",
"doi": null,
"abstractUrl": "/proceedings-article/waim/2008/3185a113/12OmNqJHFFG",
"parentPublication": {
"id": "proceedings/waim/2008/3185/0",
"title": "Web-Age Information Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fccm/2012/4699/0/4699a097",
"title": "Efficient Query Processing for Web Search Engine with FPGAs",
"doi": null,
"abstractUrl": "/proceedings-article/fccm/2012/4699a097/12OmNvpNIrv",
"parentPublication": {
"id": "proceedings/fccm/2012/4699/0",
"title": "Field-Programmable Custom Computing Machines, Annual IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cloud/2014/5063/0/5063a681",
"title": "GISQF: An Efficient Spatial Query Processing System",
"doi": null,
"abstractUrl": "/proceedings-article/cloud/2014/5063a681/12OmNwkhTk4",
"parentPublication": {
"id": "proceedings/cloud/2014/5063/0",
"title": "2014 IEEE 7th International Conference on Cloud Computing (CLOUD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2001/1119/0/11190353",
"title": "Mining Image Features for Efficient Query Processing",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2001/11190353/12OmNyuy9ZN",
"parentPublication": {
"id": "proceedings/icdm/2001/1119/0",
"title": "Proceedings 2001 IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1998/05/i0556",
"title": "Offline Recognition of Chinese Handwriting by Multifeature and Multilevel Classification",
"doi": null,
"abstractUrl": "/journal/tp/1998/05/i0556/13rRUwvBy9O",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2005/07/k0982",
"title": "Query Processing in a Mobile Computing Environment: Exploiting the Features of Asymmetry",
"doi": null,
"abstractUrl": "/journal/tk/2005/07/k0982/13rRUxBa5xw",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__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/tk/2005/07/k0997",
"title": "Indexing Useful Structural Patterns for XML Query Processing",
"doi": null,
"abstractUrl": "/journal/tk/2005/07/k0997/13rRUygT7nd",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "k0334",
"articleId": "13rRUygBwhZ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "k0363",
"articleId": "13rRUxOdD8v",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzBOhVN",
"title": "October",
"year": "1985",
"issueNum": "10",
"idPrefix": "ts",
"pubType": "journal",
"volume": "11",
"label": "October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxlgxY0",
"doi": "10.1109/TSE.1985.231854",
"abstract": "Databases that are mainly used for statistical analysis are called statistical databases (SDB). A statistical database management system (SDBMS) may be defined as a database management system that provides capabilities 1) to model, store, and manipulate data in a manner suitable for the needs of SDB users, and 2) to apply statistical data analysis techniques that range from simple summary statistics to advanced procedures. This paper surveys the existing and proposed SDB data definition and data manipulation (i.e., query) languages.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Databases that are mainly used for statistical analysis are called statistical databases (SDB). A statistical database management system (SDBMS) may be defined as a database management system that provides capabilities 1) to model, store, and manipulate data in a manner suitable for the needs of SDB users, and 2) to apply statistical data analysis techniques that range from simple summary statistics to advanced procedures. This paper surveys the existing and proposed SDB data definition and data manipulation (i.e., query) languages.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Databases that are mainly used for statistical analysis are called statistical databases (SDB). A statistical database management system (SDBMS) may be defined as a database management system that provides capabilities 1) to model, store, and manipulate data in a manner suitable for the needs of SDB users, and 2) to apply statistical data analysis techniques that range from simple summary statistics to advanced procedures. This paper surveys the existing and proposed SDB data definition and data manipulation (i.e., query) languages.",
"title": "Statistical Database Query Languages",
"normalizedTitle": "Statistical Database Query Languages",
"fno": "01701922",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Statistical Databases",
"Database Systems",
"Data Definition",
"Data Manipulation",
"Query Languages"
],
"authors": [
{
"givenName": "G.",
"surname": "Ozsoyoglu",
"fullName": "G. Ozsoyoglu",
"affiliation": "Department of Computer Engineering and Science, Case Institute of Technology, Case Western Reserve University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Z.M.",
"surname": "Ozsoyoglu",
"fullName": "Z.M. Ozsoyoglu",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "10",
"pubDate": "1985-10-01 00:00:00",
"pubType": "trans",
"pages": "1071-1081",
"year": "1985",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ideas/1997/8114/0/81140327",
"title": "Query processing in the ROL system",
"doi": null,
"abstractUrl": "/proceedings-article/ideas/1997/81140327/12OmNCzsKEi",
"parentPublication": {
"id": "proceedings/ideas/1997/8114/0",
"title": "Database Engineering and Applications Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icime/2009/3595/0/3595a283",
"title": "Three Audit Stages for Securing Statistical Databases",
"doi": null,
"abstractUrl": "/proceedings-article/icime/2009/3595a283/12OmNxFsmsw",
"parentPublication": {
"id": "proceedings/icime/2009/3595/0",
"title": "Information Management and Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssdbm/2000/0686/0/06860220",
"title": "Extending Geographic Databases for a Query Language to Support Queries Involving Statistical Data",
"doi": null,
"abstractUrl": "/proceedings-article/ssdbm/2000/06860220/12OmNyOHG6l",
"parentPublication": {
"id": "proceedings/ssdbm/2000/0686/0",
"title": "Scientific and Statistical Database Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sp/1985/0629/0/06290160",
"title": "Rounding and Inference Controlin Conceptual Models for Statistical Databases",
"doi": null,
"abstractUrl": "/proceedings-article/sp/1985/06290160/12OmNyjccxY",
"parentPublication": {
"id": "proceedings/sp/1985/0629/0",
"title": "1985 IEEE Symposium on Security and Privacy",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1982/06/01702991",
"title": "Auditing and Inference Control in Statistical Databases",
"doi": null,
"abstractUrl": "/journal/ts/1982/06/01702991/13rRUwInv5T",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/1993/05/r5025",
"title": "Example-Based Graphical Database Query Languages",
"doi": null,
"abstractUrl": "/magazine/co/1993/05/r5025/13rRUwcS1zz",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/1990/04/k0425",
"title": "Query Evaluability in Statistical Databases",
"doi": null,
"abstractUrl": "/journal/tk/1990/04/k0425/13rRUwhpBOa",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/1993/01/k0122",
"title": "Fuzzy Database Query Languages and Their Relational Completeness Theorem",
"doi": null,
"abstractUrl": "/journal/tk/1993/01/k0122/13rRUxjQyvB",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1986/12/06313006",
"title": "Statistical relational tables for statistical database management",
"doi": null,
"abstractUrl": "/journal/ts/1986/12/06313006/13rRUxly972",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1985/10/01701919",
"title": "Statistical and Scientific Database Issues",
"doi": null,
"abstractUrl": "/journal/ts/1985/10/01701919/13rRUyoPSQB",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "01701921",
"articleId": "13rRUEgs2uP",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01701923",
"articleId": "13rRUxBa5yY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNz5apwV",
"title": "July",
"year": "2005",
"issueNum": "07",
"idPrefix": "tk",
"pubType": "journal",
"volume": "17",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygT7nd",
"doi": "10.1109/TKDE.2005.110",
"abstract": "Queries on semistructured data are hard to process due to the complex nature of the data and call for specialized techniques. Existing path-based indexes and query processing algorithms are not efficient for searching complex structures beyond simple paths, even when the queries are high-selective. We introduce the definition of minimal infrequent structures (MIS), which are structures that 1) exist in the data, 2) are not frequent with respect to a support threshold, and 3) all substructures of them are frequent. By indexing the occurrences of MIS, we can efficiently locate the high-selective substructures of a query, improving search performance significantly. An efficient data mining algorithm is proposed, which finds the minimal infrequent structures. Their occurrences in the XML data are then indexed by a lightweight data structure and used as a fast filter step in query evaluation. We validate the efficiency and applicability of our methods through experimentation on both synthetic and real data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Queries on semistructured data are hard to process due to the complex nature of the data and call for specialized techniques. Existing path-based indexes and query processing algorithms are not efficient for searching complex structures beyond simple paths, even when the queries are high-selective. We introduce the definition of minimal infrequent structures (MIS), which are structures that 1) exist in the data, 2) are not frequent with respect to a support threshold, and 3) all substructures of them are frequent. By indexing the occurrences of MIS, we can efficiently locate the high-selective substructures of a query, improving search performance significantly. An efficient data mining algorithm is proposed, which finds the minimal infrequent structures. Their occurrences in the XML data are then indexed by a lightweight data structure and used as a fast filter step in query evaluation. We validate the efficiency and applicability of our methods through experimentation on both synthetic and real data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Queries on semistructured data are hard to process due to the complex nature of the data and call for specialized techniques. Existing path-based indexes and query processing algorithms are not efficient for searching complex structures beyond simple paths, even when the queries are high-selective. We introduce the definition of minimal infrequent structures (MIS), which are structures that 1) exist in the data, 2) are not frequent with respect to a support threshold, and 3) all substructures of them are frequent. By indexing the occurrences of MIS, we can efficiently locate the high-selective substructures of a query, improving search performance significantly. An efficient data mining algorithm is proposed, which finds the minimal infrequent structures. Their occurrences in the XML data are then indexed by a lightweight data structure and used as a fast filter step in query evaluation. We validate the efficiency and applicability of our methods through experimentation on both synthetic and real data.",
"title": "Indexing Useful Structural Patterns for XML Query Processing",
"normalizedTitle": "Indexing Useful Structural Patterns for XML Query Processing",
"fno": "k0997",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Index Terms Query Processing",
"XML XSL RDF",
"Mining Methods And Algorithms",
"Document Indexing"
],
"authors": [
{
"givenName": "Wang",
"surname": "Lian",
"fullName": "Wang Lian",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nikos",
"surname": "Mamoulis",
"fullName": "Nikos Mamoulis",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "David Wai-lok",
"surname": "Cheung",
"fullName": "David Wai-lok Cheung",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "S.M.",
"surname": "Yiu",
"fullName": "S.M. Yiu",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2005-07-01 00:00:00",
"pubType": "trans",
"pages": "997-1009",
"year": "2005",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/waim/2008/3185/0/3185a113",
"title": "SIMP: Efficient XML Structural Index for Multiple Query Processing",
"doi": null,
"abstractUrl": "/proceedings-article/waim/2008/3185a113/12OmNqJHFFG",
"parentPublication": {
"id": "proceedings/waim/2008/3185/0",
"title": "Web-Age Information Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/adl/2000/0659/0/06590141",
"title": "Searching and Browsing Collections of Structural Information",
"doi": null,
"abstractUrl": "/proceedings-article/adl/2000/06590141/12OmNrAdsyF",
"parentPublication": {
"id": "proceedings/adl/2000/0659/0",
"title": "Advances in Digital Libraries Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcsw/2010/4079/0/4079a099",
"title": "Structural Graph Indexing for Mining Complex Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icdcsw/2010/4079a099/12OmNx965GQ",
"parentPublication": {
"id": "proceedings/icdcsw/2010/4079/0",
"title": "2010 IEEE 30th International Conference on Distributed Computing Systems Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2005/08/k1036",
"title": "Frequent Substructure-Based Approaches for Classifying Chemical Compounds",
"doi": null,
"abstractUrl": "/journal/tk/2005/08/k1036/13rRUNvgz4C",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/1993/06/k0992",
"title": "Discovery of Inexact Concepts from Structural Data",
"doi": null,
"abstractUrl": "/journal/tk/1993/06/k0992/13rRUwbJD4Z",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2005/02/k0160",
"title": "Fast Detection of XML Structural Similarity",
"doi": null,
"abstractUrl": "/journal/tk/2005/02/k0160/13rRUwbJD55",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2005/07/i1125",
"title": "Indexing Hierarchical Structures Using Graph Spectra",
"doi": null,
"abstractUrl": "/journal/tp/2005/07/i1125/13rRUx0gegl",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2011/03/ttk2011030402",
"title": "Extended XML Tree Pattern Matching: Theories and Algorithms",
"doi": null,
"abstractUrl": "/journal/tk/2011/03/ttk2011030402/13rRUxASui0",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2005/12/k1624",
"title": "Document Clustering Using Locality Preserving Indexing",
"doi": null,
"abstractUrl": "/journal/tk/2005/12/k1624/13rRUxNW1U8",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/1996/05/x5059",
"title": "Scalable Discovery of Informative Structural Concepts Using Domain Knowledge",
"doi": null,
"abstractUrl": "/magazine/ex/1996/05/x5059/13rRUyuNsBk",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "k0982",
"articleId": "13rRUxBa5xw",
"__typename": "AdjacentArticleType"
},
"next": null,
"__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": "13rRUygT7yu",
"doi": "10.1109/TKDE.2008.172",
"abstract": "Although personalized search has been under way for many years and many personalization algorithms have been investigated, it is still unclear whether personalization is consistently effective on different queries for different users and under different search contexts. In this paper, we study this problem and provide some findings. We present a large-scale evaluation framework for personalized search based on query logs and then evaluate five personalized search algorithms (including two click-based ones and three topical-interest-based ones) using 12-day query logs of Windows Live Search. By analyzing the results, we reveal that personalized Web search does not work equally well under various situations. It represents a significant improvement over generic Web search for some queries, while it has little effect and even harms query performance under some situations. We propose click entropy as a simple measurement on whether a query should be personalized. We further propose several features to automatically predict when a query will benefit from a specific personalization algorithm. Experimental results show that using a personalization algorithm for queries selected by our prediction model is better than using it simply for all queries.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Although personalized search has been under way for many years and many personalization algorithms have been investigated, it is still unclear whether personalization is consistently effective on different queries for different users and under different search contexts. In this paper, we study this problem and provide some findings. We present a large-scale evaluation framework for personalized search based on query logs and then evaluate five personalized search algorithms (including two click-based ones and three topical-interest-based ones) using 12-day query logs of Windows Live Search. By analyzing the results, we reveal that personalized Web search does not work equally well under various situations. It represents a significant improvement over generic Web search for some queries, while it has little effect and even harms query performance under some situations. We propose click entropy as a simple measurement on whether a query should be personalized. We further propose several features to automatically predict when a query will benefit from a specific personalization algorithm. Experimental results show that using a personalization algorithm for queries selected by our prediction model is better than using it simply for all queries.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Although personalized search has been under way for many years and many personalization algorithms have been investigated, it is still unclear whether personalization is consistently effective on different queries for different users and under different search contexts. In this paper, we study this problem and provide some findings. We present a large-scale evaluation framework for personalized search based on query logs and then evaluate five personalized search algorithms (including two click-based ones and three topical-interest-based ones) using 12-day query logs of Windows Live Search. By analyzing the results, we reveal that personalized Web search does not work equally well under various situations. It represents a significant improvement over generic Web search for some queries, while it has little effect and even harms query performance under some situations. We propose click entropy as a simple measurement on whether a query should be personalized. We further propose several features to automatically predict when a query will benefit from a specific personalization algorithm. Experimental results show that using a personalization algorithm for queries selected by our prediction model is better than using it simply for all queries.",
"title": "Evaluating the Effectiveness of Personalized Web Search",
"normalizedTitle": "Evaluating the Effectiveness of Personalized Web Search",
"fno": "ttk2009081178",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Web Search",
"Personalization",
"Information Filtering",
"Performance Evaluation"
],
"authors": [
{
"givenName": "Zhicheng",
"surname": "Dou",
"fullName": "Zhicheng Dou",
"affiliation": "Microsoft Research Asia, Beijing",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ruihua",
"surname": "Song",
"fullName": "Ruihua Song",
"affiliation": "Microsoft Research Asia, Beijing",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ji-Rong",
"surname": "Wen",
"fullName": "Ji-Rong Wen",
"affiliation": "Microsoft Research Asia, Beijing",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaojie",
"surname": "Yuan",
"fullName": "Xiaojie Yuan",
"affiliation": "Nankai University, Tianjin",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2009-08-01 00:00:00",
"pubType": "trans",
"pages": "1178-1190",
"year": "2009",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/asonam/2010/4138/0/4138a351",
"title": "Community Aware Personalized Web Search",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2010/4138a351/12OmNASraBn",
"parentPublication": {
"id": "proceedings/asonam/2010/4138/0",
"title": "2010 International Conference on Advances in Social Networks Analysis and Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2014/2555/0/06816668",
"title": "Personalized Query Suggestion With Diversity Awareness",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2014/06816668/12OmNBc1uxZ",
"parentPublication": {
"id": "proceedings/icde/2014/2555/0",
"title": "2014 IEEE 30th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iita/2009/3859/2/3859b475",
"title": "Personalized Search Recommendation Based on Gradual Forgetting Collaborative Filtering Strategy",
"doi": null,
"abstractUrl": "/proceedings-article/iita/2009/3859b475/12OmNvT2p5d",
"parentPublication": {
"id": "proceedings/iita/2009/3859/2",
"title": "2009 Third International Symposium on Intelligent Information Technology Application",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2011/4513/3/4513c301",
"title": "A Luhn-Inspired Vector Re-weighting Approach for Improving Personalized Web Search",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2011/4513c301/12OmNwNwzKs",
"parentPublication": {
"id": "proceedings/wi-iat/2011/4513/3",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsde/2010/3958/0/3958a137",
"title": "A Personalized Search Engine Using Ontology-Based Fuzzy Concept Networks",
"doi": null,
"abstractUrl": "/proceedings-article/dsde/2010/3958a137/12OmNxTEiTK",
"parentPublication": {
"id": "proceedings/dsde/2010/3958/0",
"title": "Data Storage and Data Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2011/4409/0/4409a711",
"title": "Integrating Collaborative Filtering and Search-Based Techniques for Personalized Online Product Recommendation",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2011/4409a711/12OmNxWLTvM",
"parentPublication": {
"id": "proceedings/icdmw/2011/4409/0",
"title": "2011 IEEE 11th International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2010/4191/3/4191c309",
"title": "Comparing Tag Clouds, Term Histograms, and Term Lists for Enhancing Personalized Web Search",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2010/4191c309/12OmNyO8tN1",
"parentPublication": {
"id": "proceedings/wi-iat/2010/4191/2",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2004/01/k0028",
"title": "Personalized Web Search For Improving Retrieval Effectiveness",
"doi": null,
"abstractUrl": "/journal/tk/2004/01/k0028/13rRUIM2VHj",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2014/02/ttk2014020453",
"title": "Supporting Privacy Protection in Personalized Web Search",
"doi": null,
"abstractUrl": "/journal/tk/2014/02/ttk2014020453/13rRUxbTMzp",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2008/11/ttk2008111505",
"title": "Personalized Concept-Based Clustering of Search Engine Queries",
"doi": null,
"abstractUrl": "/journal/tk/2008/11/ttk2008111505/13rRUyueghw",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttk2009081162",
"articleId": "13rRUxASuGF",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttk2009081191",
"articleId": "13rRUy2YLTg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzayN24",
"title": "September/October",
"year": "2007",
"issueNum": "05",
"idPrefix": "ic",
"pubType": "magazine",
"volume": "11",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwj7crr",
"doi": "10.1109/MIC.2007.110",
"abstract": "Vocabularies that provide unique identifiers for conceptual elements of a domain can improve precision and recall in knowledge-management applications. Although creating and maintaining such vocabularies is generally hard, wiki users easily manage to develop comprehensive, informal definitions of terms, each one identified by a URI. Here, the authors show that the URIs of Wikipedia entries are reliable identifiers for conceptual entities. They also demonstrate how Wikipedia entries can be used for annotating Web resources and knowledge assets and give precise estimates of the amount of Wikipedia URIs in terms of the popular Proton ontology's top-level concepts.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Vocabularies that provide unique identifiers for conceptual elements of a domain can improve precision and recall in knowledge-management applications. Although creating and maintaining such vocabularies is generally hard, wiki users easily manage to develop comprehensive, informal definitions of terms, each one identified by a URI. Here, the authors show that the URIs of Wikipedia entries are reliable identifiers for conceptual entities. They also demonstrate how Wikipedia entries can be used for annotating Web resources and knowledge assets and give precise estimates of the amount of Wikipedia URIs in terms of the popular Proton ontology's top-level concepts.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Vocabularies that provide unique identifiers for conceptual elements of a domain can improve precision and recall in knowledge-management applications. Although creating and maintaining such vocabularies is generally hard, wiki users easily manage to develop comprehensive, informal definitions of terms, each one identified by a URI. Here, the authors show that the URIs of Wikipedia entries are reliable identifiers for conceptual entities. They also demonstrate how Wikipedia entries can be used for annotating Web resources and knowledge assets and give precise estimates of the amount of Wikipedia URIs in terms of the popular Proton ontology's top-level concepts.",
"title": "Harvesting Wiki Consensus: Using Wikipedia Entries as Vocabulary for Knowledge Management",
"normalizedTitle": "Harvesting Wiki Consensus: Using Wikipedia Entries as Vocabulary for Knowledge Management",
"fno": "w5054",
"hasPdf": true,
"idPrefix": "ic",
"keywords": [
"Ontologies",
"Wikis",
"Wikipedia",
"Knowledge Management",
"UR Is",
"Semantic Knowledge Management"
],
"authors": [
{
"givenName": "Martin",
"surname": "Hepp",
"fullName": "Martin Hepp",
"affiliation": "Digital Enterprise Research Institute, University of Innsbruck",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Katharina",
"surname": "Siorpaes",
"fullName": "Katharina Siorpaes",
"affiliation": "Digital Enterprise Research Institute, University of Innsbruck",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Bachlechner",
"fullName": "Daniel Bachlechner",
"affiliation": "Digital Enterprise Research Institute, University of Innsbruck",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2007-09-01 00:00:00",
"pubType": "mags",
"pages": "54-65",
"year": "2007",
"issn": "1089-7801",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/itng/2008/3099/0/3099a686",
"title": "Exploiting Wikipedia for Directional Inferential Text Similarity",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2008/3099a686/12OmNAKcNJt",
"parentPublication": {
"id": "proceedings/itng/2008/3099/0",
"title": "2008 5th International Conference on Information Technology: New Generation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/taai/2011/4601/0/4601a069",
"title": "Measuring Semantic Relatedness Using Wikipedia Revision Information in a Signed Network",
"doi": null,
"abstractUrl": "/proceedings-article/taai/2011/4601a069/12OmNCga1Nn",
"parentPublication": {
"id": "proceedings/taai/2011/4601/0",
"title": "2011 International Conference on Technologies and Applications of Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/micai/2008/3441/0/3441a088",
"title": "Topic Calculation and Clustering: An Application to Wikipedia",
"doi": null,
"abstractUrl": "/proceedings-article/micai/2008/3441a088/12OmNqH9hot",
"parentPublication": {
"id": "proceedings/micai/2008/3441/0",
"title": "2008 Seventh Mexican International Conference on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ism/2009/3890/0/3890a501",
"title": "Labeling News Topic Threads with Wikipedia Entries",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2009/3890a501/12OmNqH9hq0",
"parentPublication": {
"id": "proceedings/ism/2009/3890/0",
"title": "2009 11th IEEE International Symposium on Multimedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2011/4513/1/4513a445",
"title": "Harvesting Wikipedia Knowledge to Identify Topics in Ongoing Natural Language Dialogs",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2011/4513a445/12OmNvjyxZ1",
"parentPublication": {
"id": "proceedings/wi-iat/2011/4513/1",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/semapro/2009/3833/0/3833a056",
"title": "Using Wikipedia as a Reference for Extracting Semantic Information from a Text",
"doi": null,
"abstractUrl": "/proceedings-article/semapro/2009/3833a056/12OmNx8fiaT",
"parentPublication": {
"id": "proceedings/semapro/2009/3833/0",
"title": "Advances in Semantic Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsc/2011/4492/0/4492a328",
"title": "WiGipedia: A Tool for Improving Structured Data in Wikipedia",
"doi": null,
"abstractUrl": "/proceedings-article/icsc/2011/4492a328/12OmNxAlAbb",
"parentPublication": {
"id": "proceedings/icsc/2011/4492/0",
"title": "2011 IEEE Fifth International Conference on Semantic Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cso/2011/4335/0/4335a852",
"title": "Document Topic Extraction Based on Wikipedia Category",
"doi": null,
"abstractUrl": "/proceedings-article/cso/2011/4335a852/12OmNxRF6YM",
"parentPublication": {
"id": "proceedings/cso/2011/4335/0",
"title": "2011 Fourth International Joint Conference on Computational Sciences and Optimization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2012/4525/0/4525d490",
"title": "Negotiating Cultural Values in Social Media: A Case Study from Wikipedia",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2012/4525d490/12OmNyL0Toz",
"parentPublication": {
"id": "proceedings/hicss/2012/4525/0",
"title": "2012 45th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2008/05/mex2008050026",
"title": "Learning to Tag and Tagging to Learn: A Case Study on Wikipedia",
"doi": null,
"abstractUrl": "/magazine/ex/2008/05/mex2008050026/13rRUytF45r",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "w5045",
"articleId": "13rRUxkYWDm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "w5066",
"articleId": "13rRUyft7ze",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCaLEju",
"title": "Jan.",
"year": "2018",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwj7cph",
"doi": "10.1109/TVCG.2017.2744378",
"abstract": "Tree boosting, which combines weak learners (typically decision trees) to generate a strong learner, is a highly effective and widely used machine learning method. However, the development of a high performance tree boosting model is a time-consuming process that requires numerous trial-and-error experiments. To tackle this issue, we have developed a visual diagnosis tool, BOOSTVis, to help experts quickly analyze and diagnose the training process of tree boosting. In particular, we have designed a temporal confusion matrix visualization, and combined it with a t-SNE projection and a tree visualization. These visualization components work together to provide a comprehensive overview of a tree boosting model, and enable an effective diagnosis of an unsatisfactory training process. Two case studies that were conducted on the Otto Group Product Classification Challenge dataset demonstrate that BOOSTVis can provide informative feedback and guidance to improve understanding and diagnosis of tree boosting algorithms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Tree boosting, which combines weak learners (typically decision trees) to generate a strong learner, is a highly effective and widely used machine learning method. However, the development of a high performance tree boosting model is a time-consuming process that requires numerous trial-and-error experiments. To tackle this issue, we have developed a visual diagnosis tool, BOOSTVis, to help experts quickly analyze and diagnose the training process of tree boosting. In particular, we have designed a temporal confusion matrix visualization, and combined it with a t-SNE projection and a tree visualization. These visualization components work together to provide a comprehensive overview of a tree boosting model, and enable an effective diagnosis of an unsatisfactory training process. Two case studies that were conducted on the Otto Group Product Classification Challenge dataset demonstrate that BOOSTVis can provide informative feedback and guidance to improve understanding and diagnosis of tree boosting algorithms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Tree boosting, which combines weak learners (typically decision trees) to generate a strong learner, is a highly effective and widely used machine learning method. However, the development of a high performance tree boosting model is a time-consuming process that requires numerous trial-and-error experiments. To tackle this issue, we have developed a visual diagnosis tool, BOOSTVis, to help experts quickly analyze and diagnose the training process of tree boosting. In particular, we have designed a temporal confusion matrix visualization, and combined it with a t-SNE projection and a tree visualization. These visualization components work together to provide a comprehensive overview of a tree boosting model, and enable an effective diagnosis of an unsatisfactory training process. Two case studies that were conducted on the Otto Group Product Classification Challenge dataset demonstrate that BOOSTVis can provide informative feedback and guidance to improve understanding and diagnosis of tree boosting algorithms.",
"title": "Visual Diagnosis of Tree Boosting Methods",
"normalizedTitle": "Visual Diagnosis of Tree Boosting Methods",
"fno": "08017582",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Decision Trees",
"Image Classification",
"Learning Artificial Intelligence",
"Time Consuming Process",
"Visual Diagnosis Tool",
"Temporal Confusion Matrix Visualization",
"Tree Visualization",
"Visualization Components",
"Tree Boosting Model",
"Unsatisfactory Training Process",
"Tree Boosting Algorithms",
"Tree Boosting Methods",
"Typically Decision Trees",
"Machine Learning Method",
"Boosting",
"Training",
"Decision Trees",
"Tools",
"Vegetation",
"Visualization",
"Analytical Models",
"Tree Boosting",
"Model Analysis",
"Temporal Confusion Matrix",
"Tree Visualization"
],
"authors": [
{
"givenName": "Shixia",
"surname": "Liu",
"fullName": "Shixia Liu",
"affiliation": "Tsinghua University and National Engineering Lab for Big Data Software",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiannan",
"surname": "Xiao",
"fullName": "Jiannan Xiao",
"affiliation": "Tsinghua University and National Engineering Lab for Big Data Software",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Junlin",
"surname": "Liu",
"fullName": "Junlin Liu",
"affiliation": "Tsinghua University and National Engineering Lab for Big Data Software",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiting",
"surname": "Wang",
"fullName": "Xiting Wang",
"affiliation": "Microsoft Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jing",
"surname": "Wu",
"fullName": "Jing Wu",
"affiliation": "Cardiff University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jun",
"surname": "Zhu",
"fullName": "Jun Zhu",
"affiliation": "Tsinghua University and National Engineering Lab for Big Data Software",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "trans",
"pages": "163-173",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/tai/1998/5214/0/00744846",
"title": "Integrating boosting and stochastic attribute selection committees for further improving the performance of decision tree learning",
"doi": null,
"abstractUrl": "/proceedings-article/tai/1998/00744846/12OmNrJAe5Q",
"parentPublication": {
"id": "proceedings/tai/1998/5214/0",
"title": "Proceedings of 10th International Conference on Tools with Artificial Intelligence (ICTA'98)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciev/2013/0400/0/06572718",
"title": "A new approach of Boosting using decision tree classifier for classifying noisy data",
"doi": null,
"abstractUrl": "/proceedings-article/iciev/2013/06572718/12OmNrYlmPn",
"parentPublication": {
"id": "proceedings/iciev/2013/0400/0",
"title": "2013 2nd International Conference on Informatics, Electronics and Vision (ICIEV 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391d056",
"title": "Tracking-by-Segmentation with Online Gradient Boosting Decision Tree",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391d056/12OmNx7ov2B",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2014/05/06583153",
"title": "Learning Nonlinear Functions Using Regularized Greedy Forest",
"doi": null,
"abstractUrl": "/journal/tp/2014/05/06583153/13rRUwbaqW2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2017/2715/0/08257910",
"title": "Compact multi-class boosted trees",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08257910/17D45W9KVKo",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdatasecurity-hpsc-ids/2017/6296/0/07980351",
"title": "A Taxi Gap Prediction Method via Double Ensemble Gradient Boosting Decision Tree",
"doi": null,
"abstractUrl": "/proceedings-article/bigdatasecurity-hpsc-ids/2017/07980351/17D45XeKgqx",
"parentPublication": {
"id": "proceedings/bigdatasecurity-hpsc-ids/2017/6296/0",
"title": "2017 IEEE 3rd International Conference on Big Data Security on Cloud (BigDataSecurity), IEEE International Conference on High Performance and Smart Computing, (HPSC) and IEEE International Conference on Intelligent Data and Security (IDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2019/4253/0/425300a132",
"title": "Online Local Boosting: Improving Performance in Online Decision Trees",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2019/425300a132/1fHkFnNqR6o",
"parentPublication": {
"id": "proceedings/bracis/2019/4253/0",
"title": "2019 8th Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006028",
"title": "Adapted Tree Boosting for Transfer Learning",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006028/1hJrKUE27yU",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2021/3931/0/393100a186",
"title": "Investigating the Evolution of Tree Boosting Models with Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2021/393100a186/1tTtslm0K4g",
"parentPublication": {
"id": "proceedings/pacificvis/2021/3931/0",
"title": "2021 IEEE 14th Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cds/2021/0428/0/042800a007",
"title": "Ensemble Learning in Credit Card Fraud Detection Using Boosting Methods",
"doi": null,
"abstractUrl": "/proceedings-article/cds/2021/042800a007/1uZxuAfIS8E",
"parentPublication": {
"id": "proceedings/cds/2021/0428/0",
"title": "2021 2nd International Conference on Computing and Data Science (CDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08017618",
"articleId": "13rRUwghd55",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08019878",
"articleId": "13rRUxYINfl",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgLa",
"name": "ttg201801-08017582s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201801-08017582s1.zip",
"extension": "zip",
"size": "27.7 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUygT7sw",
"doi": "10.1109/TVCG.2008.159",
"abstract": "Volume exploration is an important issue in scientific visualization. Research on volume exploration has been focused on revealing hidden structures in volumetric data. While the information of individual structures or features is useful in practice, spatial relations between structures are also important in many applications and can provide further insights into the data. In this paper, we systematically study the extraction, representation,exploration, and visualization of spatial relations in volumetric data and propose a novel relation-aware visualization pipeline for volume exploration. In our pipeline, various relations in the volume are first defined and measured using region connection calculus (RCC) and then represented using a graph interface called relation graph. With RCC and the relation graph, relation query and interactive exploration can be conducted in a comprehensive and intuitive way. The visualization process is further assisted with relation-revealing viewpoint selection and color and opacity enhancement. We also introduce a quality assessment scheme which evaluates the perception of spatial relations in the rendered images. Experiments on various datasets demonstrate the practical use of our system in exploratory visualization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Volume exploration is an important issue in scientific visualization. Research on volume exploration has been focused on revealing hidden structures in volumetric data. While the information of individual structures or features is useful in practice, spatial relations between structures are also important in many applications and can provide further insights into the data. In this paper, we systematically study the extraction, representation,exploration, and visualization of spatial relations in volumetric data and propose a novel relation-aware visualization pipeline for volume exploration. In our pipeline, various relations in the volume are first defined and measured using region connection calculus (RCC) and then represented using a graph interface called relation graph. With RCC and the relation graph, relation query and interactive exploration can be conducted in a comprehensive and intuitive way. The visualization process is further assisted with relation-revealing viewpoint selection and color and opacity enhancement. We also introduce a quality assessment scheme which evaluates the perception of spatial relations in the rendered images. Experiments on various datasets demonstrate the practical use of our system in exploratory visualization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Volume exploration is an important issue in scientific visualization. Research on volume exploration has been focused on revealing hidden structures in volumetric data. While the information of individual structures or features is useful in practice, spatial relations between structures are also important in many applications and can provide further insights into the data. In this paper, we systematically study the extraction, representation,exploration, and visualization of spatial relations in volumetric data and propose a novel relation-aware visualization pipeline for volume exploration. In our pipeline, various relations in the volume are first defined and measured using region connection calculus (RCC) and then represented using a graph interface called relation graph. With RCC and the relation graph, relation query and interactive exploration can be conducted in a comprehensive and intuitive way. The visualization process is further assisted with relation-revealing viewpoint selection and color and opacity enhancement. We also introduce a quality assessment scheme which evaluates the perception of spatial relations in the rendered images. Experiments on various datasets demonstrate the practical use of our system in exploratory visualization.",
"title": "Relation-Aware Volume Exploration Pipeline",
"normalizedTitle": "Relation-Aware Volume Exploration Pipeline",
"fno": "ttg2008061683",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Exploratory Visualization",
"Relation Based Visualization",
"Visualization Pipeline"
],
"authors": [
{
"givenName": "Ming-Yuen",
"surname": "Chan",
"fullName": "Ming-Yuen Chan",
"affiliation": "The Hong Kong University of Science and Technolgoy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Qu",
"fullName": "Huamin Qu",
"affiliation": "The Hong Kong University of Science and Technolgoy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ka-Kei",
"surname": "Chung",
"fullName": "Ka-Kei Chung",
"affiliation": "The Hong Kong University of Science and Technolgoy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wai-Ho",
"surname": "Mak",
"fullName": "Wai-Ho Mak",
"affiliation": "The Hong Kong University of Science and Technolgoy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yingcai",
"surname": "Wu",
"fullName": "Yingcai Wu",
"affiliation": "The Hong Kong University of Science and Technolgoy",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1683-1690",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wi-iat/2010/4191/3/4191c326",
"title": "Bridging Semantic and Legacy Web Exploration: Orientation, Revisitation and Result Exploration Support",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2010/4191c326/12OmNAlvHwk",
"parentPublication": {
"id": "proceedings/wi-iat/2010/4191/2",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scalcom-embeddedcom/2009/3825/0/3825a148",
"title": "From Sequential Patterns to Structural Relation Patterns",
"doi": null,
"abstractUrl": "/proceedings-article/scalcom-embeddedcom/2009/3825a148/12OmNButq5R",
"parentPublication": {
"id": "proceedings/scalcom-embeddedcom/2009/3825/0",
"title": "Scalable Computing and Communications; International Conference on Embedded Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd/2009/3642/0/3642a024",
"title": "FolksoViz: A Semantic Relation-Based Folksonomy Visualization Using the Wikipedia Corpus",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2009/3642a024/12OmNCfSqQG",
"parentPublication": {
"id": "proceedings/snpd/2009/3642/0",
"title": "2009 10th ACIS International Conference on Software Engineering, Artificial Intelligences, Networking and Parallel/Distributed Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmv/2006/2605/0/26050079",
"title": "Metavisual Exploration and Analysis of DEVise Coordination in Improvise",
"doi": null,
"abstractUrl": "/proceedings-article/cmv/2006/26050079/12OmNscfI0R",
"parentPublication": {
"id": "proceedings/cmv/2006/2605/0",
"title": "Coordinated and Multiple Views in Exploratory Visualization, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/his/2009/3745/1/3745a327",
"title": "Two Stage Semantic Relation Extraction",
"doi": null,
"abstractUrl": "/proceedings-article/his/2009/3745a327/12OmNvk7JQf",
"parentPublication": {
"id": "proceedings/his/2009/3745/1",
"title": "Hybrid Intelligent Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2016/5661/0/07883514",
"title": "DimScanner: A relation-based visual exploration approach towards data dimension inspection",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2016/07883514/12OmNwEJ0V5",
"parentPublication": {
"id": "proceedings/vast/2016/5661/0",
"title": "2016 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isuvr/2008/3259/0/3259a071",
"title": "SoTong: An Aware System of Relation Oriented Communication for Enhancing Family Relationship",
"doi": null,
"abstractUrl": "/proceedings-article/isuvr/2008/3259a071/12OmNwHhoMW",
"parentPublication": {
"id": "proceedings/isuvr/2008/3259/0",
"title": "International Symposium on Ubiquitous Virtual Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itng/2011/4367/0/4367a585",
"title": "Relation Characterization Using Ontological Concepts",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2011/4367a585/12OmNxiKrZK",
"parentPublication": {
"id": "proceedings/itng/2011/4367/0",
"title": "Information Technology: New Generations, Third International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icrccs/2009/3927/0/3927a041",
"title": "Structural Relation Sequential Patterns Mining",
"doi": null,
"abstractUrl": "/proceedings-article/icrccs/2009/3927a041/12OmNzIUfZ2",
"parentPublication": {
"id": "proceedings/icrccs/2009/3927/0",
"title": "Research Challenges in Computer Science, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wisa/2011/4555/0/4555a007",
"title": "An Entity Relation Extraction Model Based on Semantic Pattern Matching",
"doi": null,
"abstractUrl": "/proceedings-article/wisa/2011/4555a007/12OmNzV70r8",
"parentPublication": {
"id": "proceedings/wisa/2011/4555/0",
"title": "Web Information Systems and Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061675",
"articleId": "13rRUwInvAW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061691",
"articleId": "13rRUygT7mN",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRZO",
"name": "ttg2008061683.avi",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2008061683.avi",
"extension": "avi",
"size": "10.9 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": "1xicaqbwmA0",
"doi": "10.1109/TVCG.2021.3114854",
"abstract": "Labels, short textual annotations are an important component of data visualizations, illustrations, infographics, and geographical maps. In interactive applications, the labeling method responsible for positioning the labels should not take the resources from the application itself. In other words, the labeling method should provide the result as fast as possible. In this work, we propose a greedy point-feature labeling method running on GPU. In contrast to existing methods that position the labels sequentially, the proposed method positions several labels in parallel. Yet, we guarantee that the positioned labels will not overlap, nor will they overlap important visual features. When the proposed method is searching for the label position of a point-feature, the available label candidates are evaluated with respect to overlaps with important visual features, conflicts with label candidates of other point-features, and their ambiguity. The evaluation of each label candidate is done in constant time independently from the number of point-features, the number of important visual features, and the resolution of the created image. Our measurements indicate that the proposed method is able to position more labels than existing greedy methods that do not evaluate conflicts between the label candidates. At the same time, the proposed method achieves a significant increase in performance. The increase in performance is mainly due to the parallelization and the efficient evaluation of label candidates.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Labels, short textual annotations are an important component of data visualizations, illustrations, infographics, and geographical maps. In interactive applications, the labeling method responsible for positioning the labels should not take the resources from the application itself. In other words, the labeling method should provide the result as fast as possible. In this work, we propose a greedy point-feature labeling method running on GPU. In contrast to existing methods that position the labels sequentially, the proposed method positions several labels in parallel. Yet, we guarantee that the positioned labels will not overlap, nor will they overlap important visual features. When the proposed method is searching for the label position of a point-feature, the available label candidates are evaluated with respect to overlaps with important visual features, conflicts with label candidates of other point-features, and their ambiguity. The evaluation of each label candidate is done in constant time independently from the number of point-features, the number of important visual features, and the resolution of the created image. Our measurements indicate that the proposed method is able to position more labels than existing greedy methods that do not evaluate conflicts between the label candidates. At the same time, the proposed method achieves a significant increase in performance. The increase in performance is mainly due to the parallelization and the efficient evaluation of label candidates.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Labels, short textual annotations are an important component of data visualizations, illustrations, infographics, and geographical maps. In interactive applications, the labeling method responsible for positioning the labels should not take the resources from the application itself. In other words, the labeling method should provide the result as fast as possible. In this work, we propose a greedy point-feature labeling method running on GPU. In contrast to existing methods that position the labels sequentially, the proposed method positions several labels in parallel. Yet, we guarantee that the positioned labels will not overlap, nor will they overlap important visual features. When the proposed method is searching for the label position of a point-feature, the available label candidates are evaluated with respect to overlaps with important visual features, conflicts with label candidates of other point-features, and their ambiguity. The evaluation of each label candidate is done in constant time independently from the number of point-features, the number of important visual features, and the resolution of the created image. Our measurements indicate that the proposed method is able to position more labels than existing greedy methods that do not evaluate conflicts between the label candidates. At the same time, the proposed method achieves a significant increase in performance. The increase in performance is mainly due to the parallelization and the efficient evaluation of label candidates.",
"title": "Rapid Labels: Point-Feature Labeling on GPU",
"normalizedTitle": "Rapid Labels: Point-Feature Labeling on GPU",
"fno": "09552249",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Labeling",
"Visualization",
"Layout",
"Data Visualization",
"Graphics Processing Units",
"Annotations",
"Optimization",
"Label Placement",
"Point Feature Labeling",
"GPU"
],
"authors": [
{
"givenName": "Vaclav",
"surname": "Pavlovec",
"fullName": "Vaclav Pavlovec",
"affiliation": "Faculty of Electrical Engineering, Czech Technical University in Prague, Czech Republic",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ladislav",
"surname": "Cmolik",
"fullName": "Ladislav Cmolik",
"affiliation": "Faculty of Electrical Engineering, Czech Technical University in Prague, Czech Republic",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "604-613",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2017/5738/0/08031608",
"title": "Radial contour labeling with straight leaders",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031608/12OmNAKuoSv",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apvis/2007/0808/0/04126220",
"title": "Many-to-one boundary labeling",
"doi": null,
"abstractUrl": "/proceedings-article/apvis/2007/04126220/12OmNBlFR2L",
"parentPublication": {
"id": "proceedings/apvis/2007/0808/0",
"title": "Asia-Pacific Symposium on Visualisation 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2010/6685/0/05429592",
"title": "Crossing-free many-to-one boundary labeling with hyperleaders",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2010/05429592/12OmNyqzM3q",
"parentPublication": {
"id": "proceedings/pacificvis/2010/6685/0",
"title": "2010 IEEE Pacific Visualization Symposium (PacificVis 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061237",
"title": "Particle-based labeling: Fast point-feature labeling without obscuring other visual features",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061237/13rRUwbaqUM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440077",
"title": "Labels on Levels: Labeling of Multi-Scale Multi-Instance and Crowded 3D Biological Environments",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440077/17D45XH89nI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/04/09207965",
"title": "Mixed Labeling: Integrating Internal and External Labels",
"doi": null,
"abstractUrl": "/journal/tg/2022/04/09207965/1nuwBNaxzjy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aivr/2020/7463/0/746300a099",
"title": "Shooting Labels: 3D Semantic Labeling by Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/aivr/2020/746300a099/1qpzznqhVHW",
"parentPublication": {
"id": "proceedings/aivr/2020/7463/0",
"title": "2020 IEEE International Conference on Artificial Intelligence and Virtual Reality (AIVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/04/09437800",
"title": "Collaborative VR-Based 3D Labeling of Live-Captured Scenes by Remote Users",
"doi": null,
"abstractUrl": "/magazine/cg/2021/04/09437800/1tL6FQbaHG8",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/11/09523830",
"title": "A Partially-Sorted Concentric Layout for Efficient Label Localization in Augmented Reality",
"doi": null,
"abstractUrl": "/journal/tg/2021/11/09523830/1wpqs1dtKes",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900c340",
"title": "Re-labeling ImageNet: from Single to Multi-Labels, from Global to Localized Labels",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900c340/1yeJiMpCAcE",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552916",
"articleId": "1xic8Hlfu4o",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09552856",
"articleId": "1xic3JUxdG8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zBb6rJxdyE",
"name": "ttg202201-09552249s1-supp2-3114854.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09552249s1-supp2-3114854.pdf",
"extension": "pdf",
"size": "10.5 MB",
"__typename": "WebExtraType"
},
{
"id": "1zBb6SDsbRK",
"name": "ttg202201-09552249s1-supp1-3114854.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09552249s1-supp1-3114854.mp4",
"extension": "mp4",
"size": "159 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCm7Bxm",
"title": "July/August",
"year": "2005",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "11",
"label": "July/August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIM2VGU",
"doi": "10.1109/TVCG.2005.66",
"abstract": "Graph drawing is a basic visualization tool that works well for graphs having up to hundreds of nodes and edges. At greater scale, data density and occlusion problems often negate its effectiveness. Conventional pan-and-zoom, multiscale, and geometric fisheye views are not fully satisfactory solutions to this problem. As an alternative, we propose a topological zooming method. It precomputes a hierarchy of coarsened graphs that are combined on-the-fly into renderings, with the level of detail dependent on distance from one or more foci. A related geometric distortion method yields constant information density displays from these renderings.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Graph drawing is a basic visualization tool that works well for graphs having up to hundreds of nodes and edges. At greater scale, data density and occlusion problems often negate its effectiveness. Conventional pan-and-zoom, multiscale, and geometric fisheye views are not fully satisfactory solutions to this problem. As an alternative, we propose a topological zooming method. It precomputes a hierarchy of coarsened graphs that are combined on-the-fly into renderings, with the level of detail dependent on distance from one or more foci. A related geometric distortion method yields constant information density displays from these renderings.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Graph drawing is a basic visualization tool that works well for graphs having up to hundreds of nodes and edges. At greater scale, data density and occlusion problems often negate its effectiveness. Conventional pan-and-zoom, multiscale, and geometric fisheye views are not fully satisfactory solutions to this problem. As an alternative, we propose a topological zooming method. It precomputes a hierarchy of coarsened graphs that are combined on-the-fly into renderings, with the level of detail dependent on distance from one or more foci. A related geometric distortion method yields constant information density displays from these renderings.",
"title": "Topological Fisheye Views for Visualizing Large Graphs",
"normalizedTitle": "Topological Fisheye Views for Visualizing Large Graphs",
"fno": "v0457",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Topological Fisheye",
"Large Graph Visualization"
],
"authors": [
{
"givenName": "Emden R.",
"surname": "Gansner",
"fullName": "Emden R. Gansner",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yehuda",
"surname": "Koren",
"fullName": "Yehuda Koren",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stephen C.",
"surname": "North",
"fullName": "Stephen C. North",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2005-07-01 00:00:00",
"pubType": "trans",
"pages": "457-468",
"year": "2005",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-infovis/2004/8779/0/87790175",
"title": "Topological Fisheye Views for Visualizing Large Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2004/87790175/12OmNBBhN3w",
"parentPublication": {
"id": "proceedings/ieee-infovis/2004/8779/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itcc/2002/1506/0/15060034",
"title": "Internet Browsing: Visualizing Category Map by Fisheye and Fractal Views",
"doi": null,
"abstractUrl": "/proceedings-article/itcc/2002/15060034/12OmNBCqbKg",
"parentPublication": {
"id": "proceedings/itcc/2002/1506/0",
"title": "Information Technology: Coding and Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2000/0643/0/06430089",
"title": "Homological Invariants and HolorGraphic Representations of Topological Structures in Cellular Spaces",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2000/06430089/12OmNqBbHLF",
"parentPublication": {
"id": "proceedings/cgi/2000/0643/0",
"title": "Computer Graphics International Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl/1993/3970/0/00269620",
"title": "Layout-independent fisheye views of nested graphs",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1993/00269620/12OmNvq5jzV",
"parentPublication": {
"id": "proceedings/vl/1993/3970/0",
"title": "Proceedings 1993 IEEE Symposium on Visual Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nsw/2011/1049/0/06004661",
"title": "Visualizing graphs with Krylov subspaces",
"doi": null,
"abstractUrl": "/proceedings-article/nsw/2011/06004661/12OmNxHJ9ui",
"parentPublication": {
"id": "proceedings/nsw/2011/1049/0",
"title": "IEEE Network Science Workshop",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061245",
"title": "Stacked Graphs – Geometry & Aesthetics",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061245/13rRUILLkDJ",
"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/tb/2005/03/n0262",
"title": "Learning the Topological Properties of Brain Tumors",
"doi": null,
"abstractUrl": "/journal/tb/2005/03/n0262/13rRUy3gn5R",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061253",
"title": "Cerebral: Visualizing Multiple Experimental Conditions on a Graph with Biological Context",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061253/13rRUygT7f5",
"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": "v0443",
"articleId": "13rRUwbs2gj",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0469",
"articleId": "13rRUNvgziu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrIrPnw",
"title": "April",
"year": "1968",
"issueNum": "04",
"idPrefix": "tc",
"pubType": "journal",
"volume": "17",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwvBy7u",
"doi": "10.1109/TC.1968.229384",
"abstract": "Abstract?Autonomous sequential networks are represented by transformation graphs, i.e., finite directed graphs, each vertex of which has outdegree one. A network that can be realized by a set of simpler, parallel networks corresponds to a transformation graph representable as a Cartesian product of simpler graphs. An algorithm for obtaining the various decompositions of a given transformation graph into irreducible factors is presented. The particular decomposition into a minimum number of factors is directly reached by the method. Decompositions into a greater number of factors are also obtained so that a balance may be struck between number and complexity of factors.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract?Autonomous sequential networks are represented by transformation graphs, i.e., finite directed graphs, each vertex of which has outdegree one. A network that can be realized by a set of simpler, parallel networks corresponds to a transformation graph representable as a Cartesian product of simpler graphs. An algorithm for obtaining the various decompositions of a given transformation graph into irreducible factors is presented. The particular decomposition into a minimum number of factors is directly reached by the method. Decompositions into a greater number of factors are also obtained so that a balance may be struck between number and complexity of factors.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract?Autonomous sequential networks are represented by transformation graphs, i.e., finite directed graphs, each vertex of which has outdegree one. A network that can be realized by a set of simpler, parallel networks corresponds to a transformation graph representable as a Cartesian product of simpler graphs. An algorithm for obtaining the various decompositions of a given transformation graph into irreducible factors is presented. The particular decomposition into a minimum number of factors is directly reached by the method. Decompositions into a greater number of factors are also obtained so that a balance may be struck between number and complexity of factors.",
"title": "Irreducible Decompositions of Transformation Graphs by Assignment Techniques",
"normalizedTitle": "Irreducible Decompositions of Transformation Graphs by Assignment Techniques",
"fno": "01687343",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Index Terms Automata Decompositions",
"Autonomous Sequential Networks",
"Network Decomposition Algorithm",
"Parallel Decomposition Lgorithm",
"Transformation Graph",
"Unary Algebra"
],
"authors": [
{
"givenName": "C.M.",
"surname": "Ablow",
"fullName": "C.M. Ablow",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "M.",
"surname": "Yoeli",
"fullName": "M. Yoeli",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "J.",
"surname": "Turner",
"fullName": "J. Turner",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "04",
"pubDate": "1968-04-01 00:00:00",
"pubType": "trans",
"pages": "325-329",
"year": "1968",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pcspa/2010/4180/0/4180a093",
"title": "Universal Methodologies: Decomposition, Integration and Transformation",
"doi": null,
"abstractUrl": "/proceedings-article/pcspa/2010/4180a093/12OmNAtK4hL",
"parentPublication": {
"id": "proceedings/pcspa/2010/4180/0",
"title": "Pervasive Computing, Signal Porcessing and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1967/4847/0/484700307",
"title": "Irreducible decompositions of transformation graphs by assignment techniques",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1967/484700307/12OmNC8dgf9",
"parentPublication": {
"id": "proceedings/focs/1967/4847/0",
"title": "8th Annual Symposium on Switching and Automata Theory (SWAT 1967)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lics/2008/3183/0/3183a406",
"title": "Definable Tree Decompositions",
"doi": null,
"abstractUrl": "/proceedings-article/lics/2008/3183a406/12OmNqH9ho9",
"parentPublication": {
"id": "proceedings/lics/2008/3183/0",
"title": "23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/istcs/1997/8037/0/80370132",
"title": "Graph decompositions and factorizing permutations",
"doi": null,
"abstractUrl": "/proceedings-article/istcs/1997/80370132/12OmNqIQS9Z",
"parentPublication": {
"id": "proceedings/istcs/1997/8037/0",
"title": "Theory of Computing Systems, Israel Symposium on the",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2012/4896/0/4896a391",
"title": "Canonical Polyadic Decomposition: From 3-way to N-Way",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2012/4896a391/12OmNqNG3iV",
"parentPublication": {
"id": "proceedings/cis/2012/4896/0",
"title": "2012 Eighth International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwcfta/2011/4560/0/4560a169",
"title": "Study Chaotic Sequences by Unary Quadratic Nonlinear Transformation",
"doi": null,
"abstractUrl": "/proceedings-article/iwcfta/2011/4560a169/12OmNyqiaSs",
"parentPublication": {
"id": "proceedings/iwcfta/2011/4560/0",
"title": "Chaos-Fractals Theories and Applications, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1966/4847/0/484700096",
"title": "Subdirect decompositions of transformation graphs",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1966/484700096/12OmNzd7bZw",
"parentPublication": {
"id": "proceedings/focs/1966/4847/0",
"title": "7th Annual Symposium on Switching and Automata Theory (swat 1966)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1997/01/v0087",
"title": "On Compatible Star Decompositions of Simple Polygons",
"doi": null,
"abstractUrl": "/journal/tg/1997/01/v0087/13rRUx0xPZo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1970/07/01671602",
"title": "R70-22 Subdirect Decompositions of Transformation Graphs",
"doi": null,
"abstractUrl": "/journal/tc/1970/07/01671602/13rRUxYIN2I",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1968/12/01687288",
"title": "Ternary Cyclo-Decompositions",
"doi": null,
"abstractUrl": "/journal/tc/1968/12/01687288/13rRUzphDwq",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "01687339",
"articleId": "13rRUILLkua",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01687346",
"articleId": "13rRUwgQpps",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzmclOq",
"title": "June",
"year": "2016",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "22",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxD9gXM",
"doi": "10.1109/TVCG.2016.2534518",
"abstract": "Stacked graphs have been widely adopted in various fields, because they are capable of hierarchically visualizing a set of temporal sequences as well as their aggregation. However, because of visual illusion issues, connections between overly-detailed individual layers and overly-generalized aggregation are intercepted. Consequently, information in this area has yet to be fully excavated. Thus, we present PieceStack in this paper, to reveal the relevance of stacked graphs in understanding intrinsic details of their displayed shapes. This new visual analytic design interprets the ways through which aggregations are generated with individual layers by interactively splitting and re-constructing the stacked graphs. A clustering algorithm is designed to partition stacked graphs into sub-aggregated pieces based on trend similarities of layers. We then visualize the pieces with augmented encoding to help analysts decompose and explore the graphs with respect to their interests. Case studies and a user study are conducted to demonstrate the usefulness of our technique in understanding the formation of stacked graphs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Stacked graphs have been widely adopted in various fields, because they are capable of hierarchically visualizing a set of temporal sequences as well as their aggregation. However, because of visual illusion issues, connections between overly-detailed individual layers and overly-generalized aggregation are intercepted. Consequently, information in this area has yet to be fully excavated. Thus, we present PieceStack in this paper, to reveal the relevance of stacked graphs in understanding intrinsic details of their displayed shapes. This new visual analytic design interprets the ways through which aggregations are generated with individual layers by interactively splitting and re-constructing the stacked graphs. A clustering algorithm is designed to partition stacked graphs into sub-aggregated pieces based on trend similarities of layers. We then visualize the pieces with augmented encoding to help analysts decompose and explore the graphs with respect to their interests. Case studies and a user study are conducted to demonstrate the usefulness of our technique in understanding the formation of stacked graphs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Stacked graphs have been widely adopted in various fields, because they are capable of hierarchically visualizing a set of temporal sequences as well as their aggregation. However, because of visual illusion issues, connections between overly-detailed individual layers and overly-generalized aggregation are intercepted. Consequently, information in this area has yet to be fully excavated. Thus, we present PieceStack in this paper, to reveal the relevance of stacked graphs in understanding intrinsic details of their displayed shapes. This new visual analytic design interprets the ways through which aggregations are generated with individual layers by interactively splitting and re-constructing the stacked graphs. A clustering algorithm is designed to partition stacked graphs into sub-aggregated pieces based on trend similarities of layers. We then visualize the pieces with augmented encoding to help analysts decompose and explore the graphs with respect to their interests. Case studies and a user study are conducted to demonstrate the usefulness of our technique in understanding the formation of stacked graphs.",
"title": "PieceStack: Toward Better Understanding of Stacked Graphs",
"normalizedTitle": "PieceStack: Toward Better Understanding of Stacked Graphs",
"fno": "07419266",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Shape",
"Visualization",
"Market Research",
"Time Series Analysis",
"Clustering Algorithms",
"Algorithm Design And Analysis",
"Trajectory",
"Stacked Graphs",
"Statistical Graphics",
"Time Series Visualization",
"Stacked Graphs",
"Statistical Graphics",
"Time Series Visualization"
],
"authors": [
{
"givenName": "Tongshuang",
"surname": "Wu",
"fullName": "Tongshuang Wu",
"affiliation": ", Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yingcai",
"surname": "Wu",
"fullName": "Yingcai Wu",
"affiliation": ", State Key Lab of CAD & CG, Zhejiang University, Zhejiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Conglei",
"surname": "Shi",
"fullName": "Conglei Shi",
"affiliation": ", IBM T.J, Watson Research Center, NY",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Qu",
"fullName": "Huamin Qu",
"affiliation": ", Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Weiwei",
"surname": "Cui",
"fullName": "Weiwei Cui",
"affiliation": ", Microsoft Research",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2016-06-01 00:00:00",
"pubType": "trans",
"pages": "1640-1651",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2017/6647/0/07892341",
"title": "Classification method of tactile feeling using stacked autoencoder based on haptic primary colors",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2017/07892341/12OmNA14Ae6",
"parentPublication": {
"id": "proceedings/vr/2017/6647/0",
"title": "2017 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccd/2007/1257/0/04601912",
"title": "Whitespace redistribution for thermal via insertion in 3D stacked ICs",
"doi": null,
"abstractUrl": "/proceedings-article/iccd/2007/04601912/12OmNC3XhjV",
"parentPublication": {
"id": "proceedings/iccd/2007/1257/0",
"title": "25th International Conference on Computer Design, ICCD 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2016/1451/0/07465277",
"title": "STAC: Enhancing stacked graphs for time series analysis",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2016/07465277/12OmNqAU6yL",
"parentPublication": {
"id": "proceedings/pacificvis/2016/1451/0",
"title": "2016 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ets/2010/5834/0/05512787",
"title": "Test-architecture optimization for TSV-based 3D stacked ICs",
"doi": null,
"abstractUrl": "/proceedings-article/ets/2010/05512787/12OmNxX3ur0",
"parentPublication": {
"id": "proceedings/ets/2010/5834/0",
"title": "2010 15th IEEE European Test Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061245",
"title": "Stacked Graphs – Geometry & Aesthetics",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061245/13rRUILLkDJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2021/3902/0/09671835",
"title": "Stacked LSTM Based Wafer Classification",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2021/09671835/1A8h6Ycwrm0",
"parentPublication": {
"id": "proceedings/big-data/2021/3902/0",
"title": "2021 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/2021/0878/0/087800a683",
"title": "Modeling User Interest Changes with Dynamic Differential Graphs for Item Recommendation",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2021/087800a683/1D4M1R3T9UQ",
"parentPublication": {
"id": "proceedings/icpads/2021/0878/0",
"title": "2021 IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ickg/2022/5101/0/510100a392",
"title": "Time Series Anomaly Detection for Smart Grids via Multiple Self-Supervised Tasks Learning",
"doi": null,
"abstractUrl": "/proceedings-article/ickg/2022/510100a392/1KxU3BDdtXq",
"parentPublication": {
"id": "proceedings/ickg/2022/5101/0",
"title": "2022 IEEE International Conference on Knowledge Graph (ICKG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101458",
"title": "CrashSim: An Efficient Algorithm for Computing SimRank over Static and Temporal Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101458/1kaMzzAojII",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/irc/2020/5237/0/523700a453",
"title": "Multi-label UAV sound classification using Stacked Bidirectional LSTM",
"doi": null,
"abstractUrl": "/proceedings-article/irc/2020/523700a453/1pP3RCrbh9S",
"parentPublication": {
"id": "proceedings/irc/2020/5237/0",
"title": "2020 Fourth IEEE International Conference on Robotic Computing (IRC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07462316",
"articleId": "13rRUxcbnHe",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07422136",
"articleId": "13rRUyv53Fu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxiKs8x",
"title": "September",
"year": "2005",
"issueNum": "09",
"idPrefix": "ts",
"pubType": "journal",
"volume": "31",
"label": "September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvok",
"doi": "10.1109/TSE.2005.104",
"abstract": "Scenario-based requirements specifications are the industry norm for defining communication protocols. However, such scenarios often contain race conditions. A race condition occurs when events are specified to occur in a particular order, but in practice, this order cannot be guaranteed. The paper considers UML/MSC scenarios that can be described with standard partial order theoretic asynchronous behavioral semantics. We define these to be partial order scenarios. The paper proves there is a unique minimal generalization of a partial order scenario that is race free. The paper also proves there is a unique minimal race free refinement of the behavioral semantics of a partial order scenario. Unlike the generalization, the refinement cannot be realized in the form of a partial order scenario, although it can always be embedded in one. The paper also proves the results can be generalized to a subclass of iterative scenarios.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Scenario-based requirements specifications are the industry norm for defining communication protocols. However, such scenarios often contain race conditions. A race condition occurs when events are specified to occur in a particular order, but in practice, this order cannot be guaranteed. The paper considers UML/MSC scenarios that can be described with standard partial order theoretic asynchronous behavioral semantics. We define these to be partial order scenarios. The paper proves there is a unique minimal generalization of a partial order scenario that is race free. The paper also proves there is a unique minimal race free refinement of the behavioral semantics of a partial order scenario. Unlike the generalization, the refinement cannot be realized in the form of a partial order scenario, although it can always be embedded in one. The paper also proves the results can be generalized to a subclass of iterative scenarios.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Scenario-based requirements specifications are the industry norm for defining communication protocols. However, such scenarios often contain race conditions. A race condition occurs when events are specified to occur in a particular order, but in practice, this order cannot be guaranteed. The paper considers UML/MSC scenarios that can be described with standard partial order theoretic asynchronous behavioral semantics. We define these to be partial order scenarios. The paper proves there is a unique minimal generalization of a partial order scenario that is race free. The paper also proves there is a unique minimal race free refinement of the behavioral semantics of a partial order scenario. Unlike the generalization, the refinement cannot be realized in the form of a partial order scenario, although it can always be embedded in one. The paper also proves the results can be generalized to a subclass of iterative scenarios.",
"title": "Resolving Race Conditions in Asynchronous Partial Order Scenarios",
"normalizedTitle": "Resolving Race Conditions in Asynchronous Partial Order Scenarios",
"fno": "e0767",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Index Terms Requirements Analysis",
"Formal Methods",
"Distributed Programming"
],
"authors": [
{
"givenName": "Bill",
"surname": "Mitchell",
"fullName": "Bill Mitchell",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2005-09-01 00:00:00",
"pubType": "trans",
"pages": "767-784",
"year": "2005",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccad/2008/2819/0/04681598",
"title": "Race analysis for SystemC using model checking",
"doi": null,
"abstractUrl": "/proceedings-article/iccad/2008/04681598/12OmNAXPyd8",
"parentPublication": {
"id": "proceedings/iccad/2008/2819/0",
"title": "Computer-Aided Design, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccima/2007/3050/2/30500061",
"title": "Automated Reasoning Tool for the Detection of Race Conditions in Web Services",
"doi": null,
"abstractUrl": "/proceedings-article/iccima/2007/30500061/12OmNvB9Fyn",
"parentPublication": {
"id": "iccima/2007/3050/2",
"title": "Computational Intelligence and Multimedia Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispass/2011/4367/0/05762737",
"title": "Detecting race conditions in asynchronous DMA operations with full system simulation",
"doi": null,
"abstractUrl": "/proceedings-article/ispass/2011/05762737/12OmNy5zsjR",
"parentPublication": {
"id": "proceedings/ispass/2011/4367/0",
"title": "(IEEE ISPASS) IEEE International Symposium on Performance Analysis of Systems and Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2007/0909/0/04228137",
"title": "Decomposing Partial Order Execution Graphs to Improve Message Race Detection",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2007/04228137/12OmNzaQoJH",
"parentPublication": {
"id": "proceedings/ipdps/2007/0909/0",
"title": "2007 IEEE International Parallel and Distributed Processing Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rtcsa/1999/0306/0/03060166",
"title": "On the Schedulability Conditions on Partial Time Slots",
"doi": null,
"abstractUrl": "/proceedings-article/rtcsa/1999/03060166/12OmNzw8j5L",
"parentPublication": {
"id": "proceedings/rtcsa/1999/0306/0",
"title": "Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2003/02/e0099",
"title": "Synthesis of Behavioral Models from Scenarios",
"doi": null,
"abstractUrl": "/journal/ts/2003/02/e0099/13rRUB7a12L",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2005/12/e1028",
"title": "A Scenario-Matching Approach to the Description and Model Checking of Real-Time Properties",
"doi": null,
"abstractUrl": "/journal/ts/2005/12/e1028/13rRUwh80Df",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2005/12/e0999",
"title": "From Live Sequence Charts to State Machines and Back: A Guided Tour",
"doi": null,
"abstractUrl": "/journal/ts/2005/12/e0999/13rRUwkfB15",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2008/03/tts2008030305",
"title": "Characterizing Communication Channel Deadlocks in Sequence Diagrams",
"doi": null,
"abstractUrl": "/journal/ts/2008/03/tts2008030305/13rRUyYSWmJ",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "e0754",
"articleId": "13rRUwghdaT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "e0785",
"articleId": "13rRUxOdD4o",
"__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": "13rRUyY28Yw",
"doi": "10.1109/TVCG.2013.154",
"abstract": "Biological pathway maps are highly relevant tools for many tasks in molecular biology. They reduce the complexity of the overall biological network by partitioning it into smaller manageable parts. While this reduction of complexity is their biggest strength, it is, at the same time, their biggest weakness. By removing what is deemed not important for the primary function of the pathway, biologists lose the ability to follow and understand cross-talks between pathways. Considering these cross-talks is, however, critical in many analysis scenarios, such as judging effects of drugs. In this paper we introduce Entourage, a novel visualization technique that provides contextual information lost due to the artificial partitioning of the biological network, but at the same time limits the presented information to what is relevant to the analyst's task. We use one pathway map as the focus of an analysis and allow a larger set of contextual pathways. For these context pathways we only show the contextual subsets, i.e., the parts of the graph that are relevant to a selection. Entourage suggests related pathways based on similarities and highlights parts of a pathway that are interesting in terms of mapped experimental data. We visualize interdependencies between pathways using stubs of visual links, which we found effective yet not obtrusive. By combining this approach with visualization of experimental data, we can provide domain experts with a highly valuable tool. We demonstrate the utility of Entourage with case studies conducted with a biochemist who researches the effects of drugs on pathways. We show that the technique is well suited to investigate interdependencies between pathways and to analyze, understand, and predict the effect that drugs have on different cell types.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Biological pathway maps are highly relevant tools for many tasks in molecular biology. They reduce the complexity of the overall biological network by partitioning it into smaller manageable parts. While this reduction of complexity is their biggest strength, it is, at the same time, their biggest weakness. By removing what is deemed not important for the primary function of the pathway, biologists lose the ability to follow and understand cross-talks between pathways. Considering these cross-talks is, however, critical in many analysis scenarios, such as judging effects of drugs. In this paper we introduce Entourage, a novel visualization technique that provides contextual information lost due to the artificial partitioning of the biological network, but at the same time limits the presented information to what is relevant to the analyst's task. We use one pathway map as the focus of an analysis and allow a larger set of contextual pathways. For these context pathways we only show the contextual subsets, i.e., the parts of the graph that are relevant to a selection. Entourage suggests related pathways based on similarities and highlights parts of a pathway that are interesting in terms of mapped experimental data. We visualize interdependencies between pathways using stubs of visual links, which we found effective yet not obtrusive. By combining this approach with visualization of experimental data, we can provide domain experts with a highly valuable tool. We demonstrate the utility of Entourage with case studies conducted with a biochemist who researches the effects of drugs on pathways. We show that the technique is well suited to investigate interdependencies between pathways and to analyze, understand, and predict the effect that drugs have on different cell types.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Biological pathway maps are highly relevant tools for many tasks in molecular biology. They reduce the complexity of the overall biological network by partitioning it into smaller manageable parts. While this reduction of complexity is their biggest strength, it is, at the same time, their biggest weakness. By removing what is deemed not important for the primary function of the pathway, biologists lose the ability to follow and understand cross-talks between pathways. Considering these cross-talks is, however, critical in many analysis scenarios, such as judging effects of drugs. In this paper we introduce Entourage, a novel visualization technique that provides contextual information lost due to the artificial partitioning of the biological network, but at the same time limits the presented information to what is relevant to the analyst's task. We use one pathway map as the focus of an analysis and allow a larger set of contextual pathways. For these context pathways we only show the contextual subsets, i.e., the parts of the graph that are relevant to a selection. Entourage suggests related pathways based on similarities and highlights parts of a pathway that are interesting in terms of mapped experimental data. We visualize interdependencies between pathways using stubs of visual links, which we found effective yet not obtrusive. By combining this approach with visualization of experimental data, we can provide domain experts with a highly valuable tool. We demonstrate the utility of Entourage with case studies conducted with a biochemist who researches the effects of drugs on pathways. We show that the technique is well suited to investigate interdependencies between pathways and to analyze, understand, and predict the effect that drugs have on different cell types.",
"title": "Entourage: Visualizing Relationships between Biological Pathways using Contextual Subsets",
"normalizedTitle": "Entourage: Visualizing Relationships between Biological Pathways using Contextual Subsets",
"fno": "ttg2013122536",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Drugs",
"Portals",
"Context Awareness",
"Biological System Modeling",
"Data Visualization",
"Bioinformatics",
"Graphs",
"Drugs",
"Portals",
"Context Awareness",
"Biological System Modeling",
"Data Visualization",
"Bioinformatics",
"Biomolecular Data",
"Pathway Visualization",
"Biological Networks",
"Subsets"
],
"authors": [
{
"givenName": "Alexander",
"surname": "Lex",
"fullName": "Alexander Lex",
"affiliation": "Harvard Univ., Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christian",
"surname": "Partl",
"fullName": "Christian Partl",
"affiliation": "Graz Univ. of Technol., Graz, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Denis",
"surname": "Kalkofen",
"fullName": "Denis Kalkofen",
"affiliation": "Graz Univ. of Technol., Graz, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marc",
"surname": "Streit",
"fullName": "Marc Streit",
"affiliation": "Johannes Kepler Univ. Linz, Linz, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Samuel",
"surname": "Gratzl",
"fullName": "Samuel Gratzl",
"affiliation": "Johannes Kepler Univ. Linz, Linz, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anne Mai",
"surname": "Wassermann",
"fullName": "Anne Mai Wassermann",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dieter",
"surname": "Schmalstieg",
"fullName": "Dieter Schmalstieg",
"affiliation": "Graz Univ. of Technol., Graz, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanspeter",
"surname": "Pfister",
"fullName": "Hanspeter Pfister",
"affiliation": "Harvard Univ., Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2013-12-01 00:00:00",
"pubType": "trans",
"pages": "2536-2545",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2017/5738/0/08031602",
"title": "DrugPathSeeker: Interactive UI for exploring drug-ADR relation via pathways",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031602/12OmNBSjJ1k",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2009/3885/0/3885a142",
"title": "Side Effect Prediction Using Cooperative Pathways",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2009/3885a142/12OmNqFrGzd",
"parentPublication": {
"id": "proceedings/bibm/2009/3885/0",
"title": "2009 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2010/8306/0/05706642",
"title": "IsoKEGG: A logic based system for querying biological pathways in KEGG",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2010/05706642/12OmNqzu6Kc",
"parentPublication": {
"id": "proceedings/bibm/2010/8306/0",
"title": "2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibmw/2010/8303/0/05703765",
"title": "Predicting metabolic pathways from metabolic networks with limited biological knowledge",
"doi": null,
"abstractUrl": "/proceedings-article/bibmw/2010/05703765/12OmNvFpEy8",
"parentPublication": {
"id": "proceedings/bibmw/2010/8303/0",
"title": "2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2017/3050/0/08217814",
"title": "A semantic knowledge-base approach to drug-drug interaction discovery",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2017/08217814/12OmNwEJ0IS",
"parentPublication": {
"id": "proceedings/bibm/2017/3050/0",
"title": "2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2013/1309/0/06732488",
"title": "Correlating adverse drug reactions with biological pathways in humans",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2013/06732488/12OmNxFaLzr",
"parentPublication": {
"id": "proceedings/bibm/2013/1309/0",
"title": "2013 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2003/1907/0/19070018",
"title": "Towards Automated Derivation of Biological Pathways Using High-Throughput Biological Data",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2003/19070018/12OmNzwZ6iw",
"parentPublication": {
"id": "proceedings/bibe/2003/1907/0",
"title": "Proceedings Third IEEE Symposium on BioInformatics and BioEngineering. BIBE 2003",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2012/06/ttb2012061819",
"title": "Fuzzy Intervention in Biological Phenomena",
"doi": null,
"abstractUrl": "/journal/tb/2012/06/ttb2012061819/13rRUEgs2Ad",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2014/04/06802366",
"title": "Predicting Protein Relationships to Human Pathways through a Relational Learning Approach Based on Simple Sequence Features",
"doi": null,
"abstractUrl": "/journal/tb/2014/04/06802366/13rRUyeTVgs",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2019/4617/0/461700a832",
"title": "Computational Identification of Metabolites for Pathways Related to Huntington's Disease",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2019/461700a832/1grPhC7iqYM",
"parentPublication": {
"id": "proceedings/bibe/2019/4617/0",
"title": "2019 IEEE 19th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013122526",
"articleId": "13rRUwInvB4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013122546",
"articleId": "13rRUIJuxpz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesUg",
"name": "ttg2013122536s.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013122536s.mp4",
"extension": "mp4",
"size": "39.8 MB",
"__typename": "WebExtraType"
},
{
"id": "17ShDTYesUh",
"name": "ttg2013122536s.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013122536s.pdf",
"extension": "pdf",
"size": "3.39 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx8fif0",
"title": "Sept.",
"year": "2017",
"issueNum": "09",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwh80uE",
"doi": "10.1109/TVCG.2016.2608828",
"abstract": "Using synthetic videos to present a 3D scene is a common requirement for architects, designers, engineers or Cultural Heritage professionals however it is usually time consuming and, in order to obtain high quality results, the support of a film maker/computer animation expert is necessary. We introduce an alternative approach that takes the 3D scene of interest and an example video as input, and automatically produces a video of the input scene that resembles the given video example. In other words, our algorithm allows the user to “replicate” an existing video, on a different 3D scene. We build on the intuition that a video sequence of a static environment is strongly characterized by its optical flow, or, in other words, that two videos are similar if their optical flows are similar. We therefore recast the problem as producing a video of the input scene whose optical flow is similar to the optical flow of the input video. Our intuition is supported by a user-study specifically designed to verify this statement. We have successfully tested our approach on several scenes and input videos, some of which are reported in the accompanying material of this paper.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Using synthetic videos to present a 3D scene is a common requirement for architects, designers, engineers or Cultural Heritage professionals however it is usually time consuming and, in order to obtain high quality results, the support of a film maker/computer animation expert is necessary. We introduce an alternative approach that takes the 3D scene of interest and an example video as input, and automatically produces a video of the input scene that resembles the given video example. In other words, our algorithm allows the user to “replicate” an existing video, on a different 3D scene. We build on the intuition that a video sequence of a static environment is strongly characterized by its optical flow, or, in other words, that two videos are similar if their optical flows are similar. We therefore recast the problem as producing a video of the input scene whose optical flow is similar to the optical flow of the input video. Our intuition is supported by a user-study specifically designed to verify this statement. We have successfully tested our approach on several scenes and input videos, some of which are reported in the accompanying material of this paper.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Using synthetic videos to present a 3D scene is a common requirement for architects, designers, engineers or Cultural Heritage professionals however it is usually time consuming and, in order to obtain high quality results, the support of a film maker/computer animation expert is necessary. We introduce an alternative approach that takes the 3D scene of interest and an example video as input, and automatically produces a video of the input scene that resembles the given video example. In other words, our algorithm allows the user to “replicate” an existing video, on a different 3D scene. We build on the intuition that a video sequence of a static environment is strongly characterized by its optical flow, or, in other words, that two videos are similar if their optical flows are similar. We therefore recast the problem as producing a video of the input scene whose optical flow is similar to the optical flow of the input video. Our intuition is supported by a user-study specifically designed to verify this statement. We have successfully tested our approach on several scenes and input videos, some of which are reported in the accompanying material of this paper.",
"title": "Presentation of 3D Scenes Through Video Example",
"normalizedTitle": "Presentation of 3D Scenes Through Video Example",
"fno": "07565535",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Three Dimensional Displays",
"Cameras",
"Databases",
"Solid Modeling",
"Video Sequences",
"Optical Imaging",
"Visualization",
"Multimedia Content Production",
"Video Similarity",
"2 D Vector Field Comparison",
"Computer Animation"
],
"authors": [
{
"givenName": "Andrea",
"surname": "Baldacci",
"fullName": "Andrea Baldacci",
"affiliation": "Istituto di scienza e tecnologie dellínformazione Alessandro Faedo, Pisa, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fabio",
"surname": "Ganovelli",
"fullName": "Fabio Ganovelli",
"affiliation": "Istituto di scienza e tecnologie dellínformazione Alessandro Faedo, Pisa, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Massimiliano",
"surname": "Corsini",
"fullName": "Massimiliano Corsini",
"affiliation": "Istituto di scienza e tecnologie dellínformazione Alessandro Faedo, Pisa, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Roberto",
"surname": "Scopigno",
"fullName": "Roberto Scopigno",
"affiliation": "Istituto di scienza e tecnologie dellínformazione Alessandro Faedo, Pisa, Italy",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2017-09-01 00:00:00",
"pubType": "trans",
"pages": "2096-2107",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wacv/2016/0641/0/07477720",
"title": "Occlusion-aware video registration for highly non-rigid objects",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2016/07477720/12OmNAqkSD1",
"parentPublication": {
"id": "proceedings/wacv/2016/0641/0",
"title": "2016 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391d514",
"title": "Intrinsic Depth: Improving Depth Transfer with Intrinsic Images",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391d514/12OmNBhpS9I",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mcsi/2015/8673/0/8673a099",
"title": "A Method of Effective Background Estimation for Video Sequences with Dense Moving Objects",
"doi": null,
"abstractUrl": "/proceedings-article/mcsi/2015/8673a099/12OmNrMHOf6",
"parentPublication": {
"id": "proceedings/mcsi/2015/8673/0",
"title": "2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761479",
"title": "An empirical comparison of high definition video and regular video in optical flow computation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761479/12OmNviZlzd",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2001/1143/1/00937494",
"title": "Generalized mosaicing",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2001/00937494/12OmNyk2ZXP",
"parentPublication": {
"id": "proceedings/iccv/2001/1143/1",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08545723",
"title": "Superframes, A Temporal Video Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08545723/17D45WwsQ7b",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2019/0990/0/08909895",
"title": "Non-Local Attentive Temporal Network for Video-Based Person Re-Identification",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2019/08909895/1febIayb57O",
"parentPublication": {
"id": "proceedings/avss/2019/0990/0",
"title": "2019 16th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2019/0990/0/08909869",
"title": "Video-Based Person Re-Identification using Refined Attention Networks",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2019/08909869/1febJB5BFBu",
"parentPublication": {
"id": "proceedings/avss/2019/0990/0",
"title": "2019 16th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800b331",
"title": "Upgrading Optical Flow to 3D Scene Flow Through Optical Expansion",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800b331/1m3ooB64tNe",
"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/3dv/2021/2688/0/268800a930",
"title": "4D Human Body Capture from Egocentric Video via 3D Scene Grounding",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2021/268800a930/1zWEi72pRpC",
"parentPublication": {
"id": "proceedings/3dv/2021/2688/0",
"title": "2021 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07558244",
"articleId": "13rRUxly95G",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07590146",
"articleId": "13rRUwInvJl",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgxr",
"name": "ttg201709-07565535s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201709-07565535s1.zip",
"extension": "zip",
"size": "145 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45WXIkBi",
"doi": "10.1109/TVCG.2018.2865022",
"abstract": "Publication records and collaboration networks are important for assessing the expertise and experience of researchers. Existing digital libraries show the raw publication lists in author profiles, whereas visualization techniques focus on specific subproblems. Instead, we look at publication records from various perspectives mixing low-level publication data with high-level abstractions and background information. This work presents VIS Author Profiles, a novel approach to generate integrated textual and visual descriptions to highlight patterns in publication records. We leverage template-based natural language generation to summarize notable publication statistics, evolution of research topics, and collaboration relationships. Seamlessly integrated visualizations augment the textual description and are interactively connected with each other and the text. The underlying publication data and detailed explanations of the analysis are available on demand. We compare our approach to existing systems by taking into account information needs of users and demonstrate its usefulness in two realistic application examples.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Publication records and collaboration networks are important for assessing the expertise and experience of researchers. Existing digital libraries show the raw publication lists in author profiles, whereas visualization techniques focus on specific subproblems. Instead, we look at publication records from various perspectives mixing low-level publication data with high-level abstractions and background information. This work presents VIS Author Profiles, a novel approach to generate integrated textual and visual descriptions to highlight patterns in publication records. We leverage template-based natural language generation to summarize notable publication statistics, evolution of research topics, and collaboration relationships. Seamlessly integrated visualizations augment the textual description and are interactively connected with each other and the text. The underlying publication data and detailed explanations of the analysis are available on demand. We compare our approach to existing systems by taking into account information needs of users and demonstrate its usefulness in two realistic application examples.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Publication records and collaboration networks are important for assessing the expertise and experience of researchers. Existing digital libraries show the raw publication lists in author profiles, whereas visualization techniques focus on specific subproblems. Instead, we look at publication records from various perspectives mixing low-level publication data with high-level abstractions and background information. This work presents VIS Author Profiles, a novel approach to generate integrated textual and visual descriptions to highlight patterns in publication records. We leverage template-based natural language generation to summarize notable publication statistics, evolution of research topics, and collaboration relationships. Seamlessly integrated visualizations augment the textual description and are interactively connected with each other and the text. The underlying publication data and detailed explanations of the analysis are available on demand. We compare our approach to existing systems by taking into account information needs of users and demonstrate its usefulness in two realistic application examples.",
"title": "VIS Author Profiles: Interactive Descriptions of Publication Records Combining Text and Visualization",
"normalizedTitle": "VIS Author Profiles: Interactive Descriptions of Publication Records Combining Text and Visualization",
"fno": "08440852",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Digital Libraries",
"Groupware",
"Natural Language Processing",
"Statistical Analysis",
"Text Analysis",
"Interactive Descriptions",
"Raw Publication Lists",
"Low Level Publication Data",
"High Level Abstractions",
"Integrated Textual Descriptions",
"Visual Descriptions",
"Seamlessly Integrated Visualizations",
"Textual Description",
"Underlying Publication Data",
"Publication Records",
"Visualization Techniques",
"Publication Statistics",
"VIS Author Profiles",
"Collaboration Networks",
"Digital Libraries",
"Author Profiles",
"Template Based Natural Language Generation",
"Collaboration Relationships",
"Data Visualization",
"Collaboration",
"Libraries",
"Computer Science",
"Natural Languages",
"Visual Analytics",
"Natural Language Generation",
"Document Visualization",
"Interactive Documents",
"Sparklines",
"Digital Libraries"
],
"authors": [
{
"givenName": "Shahid",
"surname": "Latif",
"fullName": "Shahid Latif",
"affiliation": "Paluno, University of Duisburg, Essen, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fabian",
"surname": "Beck",
"fullName": "Fabian Beck",
"affiliation": "Paluno, University of Duisburg, Essen, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "152-161",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/lcn/2016/2054/0/2054a559",
"title": "Efficient Learning of Communication Profiles from IP Flow Records",
"doi": null,
"abstractUrl": "/proceedings-article/lcn/2016/2054a559/12OmNClQ0oQ",
"parentPublication": {
"id": "proceedings/lcn/2016/2054/0",
"title": "2016 IEEE 41st Conference on Local Computer Networks (LCN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wetice/2016/1663/0/1663a217",
"title": "Intention-Based Information Retrieval of Electronic Health Records",
"doi": null,
"abstractUrl": "/proceedings-article/wetice/2016/1663a217/12OmNrJRP8s",
"parentPublication": {
"id": "proceedings/wetice/2016/1663/0",
"title": "2016 IEEE 25th International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdcat/2016/4617/0/6005a052",
"title": "A Visual Analytics Approach to Author Name Disambiguation",
"doi": null,
"abstractUrl": "/proceedings-article/bdcat/2016/6005a052/12OmNvjyxUp",
"parentPublication": {
"id": "proceedings/bdcat/2016/4617/0",
"title": "2016 IEEE/ACM 3rd International Conference on Big Data Computing Applications and Technologies (BDCAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2006/2570/0/25700120",
"title": "Segmentation of Publication Records of Authors from the Web",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2006/25700120/12OmNxjBfkh",
"parentPublication": {
"id": "proceedings/icde/2006/2570/0",
"title": "22nd International Conference on Data Engineering (ICDE'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2012/2719/0/06337153",
"title": "Use of Library Loan Records for Book Recommendation",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2012/06337153/12OmNywfKEA",
"parentPublication": {
"id": "proceedings/iiai-aai/2012/2719/0",
"title": "2012 IIAI International Conference on Advanced Applied Informatics (IIAIAAI 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iri/2015/6656/0/6656a435",
"title": "DBLPminer: A Tool for Exploring Bibliographic Data",
"doi": null,
"abstractUrl": "/proceedings-article/iri/2015/6656a435/12OmNzV70on",
"parentPublication": {
"id": "proceedings/iri/2015/6656/0",
"title": "2015 IEEE International Conference on Information Reuse and Integration (IRI)",
"__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": "proceedings/jcdl/2022/9345/0/09852927",
"title": "Comparing Different Perspectives of Characterizing Interdisciplinarity of Scientific Publications: Author vs. Publication Perspectives",
"doi": null,
"abstractUrl": "/proceedings-article/jcdl/2022/09852927/1FT2okoG3Cg",
"parentPublication": {
"id": "proceedings/jcdl/2022/9345/0",
"title": "2022 ACM/IEEE Joint Conference on Digital Libraries (JCDL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807354",
"title": "VASABI: Hierarchical User Profiles for Interactive Visual User Behaviour Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807354/1cG6pt9f4ly",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2020/6251/0/09377943",
"title": "Automatic Extraction of Dublin Core Metadata from Presidential E-records",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09377943/1s64ZHCzsL6",
"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": "08440832",
"articleId": "17D45WHONqh",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440044",
"articleId": "17D45VTRovg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1lsfuk9NBss",
"name": "ttg201901-08440852s1-tvcg-latif-2865022-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08440852s1-tvcg-latif-2865022-mm.zip",
"extension": "zip",
"size": "1.93 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrFBPWq",
"title": "September-October",
"year": "2006",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "12",
"label": "September-October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInuWq",
"doi": "10.1109/TVCG.2006.173",
"abstract": "Accurately representing higher-order singularities of vector fields defined on piecewise linear surfaces is a non-trivial problem. In this work, we introduce a concise yet complete interpolation scheme of vector fields on arbitrary triangulated surfaces. The scheme enables arbitrary singularities to be represented at vertices} The representation can be considered as a facet-based \"encoding\" of vector fields on piecewise linear surfaces. The vector field is described in polar coordinates over each facet, with a facet edge being chosen as the reference to define the angle. An integer called the period jump is associated to each edge of the triangulation to remove the ambiguity when interpolating the direction of the vector field between two facets that share an edge. To interpolate the vector field, we first linearly interpolate the angle of rotation of the vectors along the edges of the facet graph. Then, we use a variant of Nielson's side-vertex scheme to interpolate the vector field over the entire surface. With our representation, we remove the bound imposed on the complexity of singularities that a vertex can represent by its connectivity. This bound is a limitation generally exists in vertex-based linear schemes. Furthermore, using our data structure, the index of a vertex of a vector field can be combinatorily determined. We show the simplicity of the interpolation scheme with a GPU-accelerated algorithm for a LIC-based visualization of the so-defined vector fields, operating in image space. We demonstrate the algorithm applied to various vector fields on curved surfaces.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Accurately representing higher-order singularities of vector fields defined on piecewise linear surfaces is a non-trivial problem. In this work, we introduce a concise yet complete interpolation scheme of vector fields on arbitrary triangulated surfaces. The scheme enables arbitrary singularities to be represented at vertices} The representation can be considered as a facet-based \"encoding\" of vector fields on piecewise linear surfaces. The vector field is described in polar coordinates over each facet, with a facet edge being chosen as the reference to define the angle. An integer called the period jump is associated to each edge of the triangulation to remove the ambiguity when interpolating the direction of the vector field between two facets that share an edge. To interpolate the vector field, we first linearly interpolate the angle of rotation of the vectors along the edges of the facet graph. Then, we use a variant of Nielson's side-vertex scheme to interpolate the vector field over the entire surface. With our representation, we remove the bound imposed on the complexity of singularities that a vertex can represent by its connectivity. This bound is a limitation generally exists in vertex-based linear schemes. Furthermore, using our data structure, the index of a vertex of a vector field can be combinatorily determined. We show the simplicity of the interpolation scheme with a GPU-accelerated algorithm for a LIC-based visualization of the so-defined vector fields, operating in image space. We demonstrate the algorithm applied to various vector fields on curved surfaces.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Accurately representing higher-order singularities of vector fields defined on piecewise linear surfaces is a non-trivial problem. In this work, we introduce a concise yet complete interpolation scheme of vector fields on arbitrary triangulated surfaces. The scheme enables arbitrary singularities to be represented at vertices} The representation can be considered as a facet-based \"encoding\" of vector fields on piecewise linear surfaces. The vector field is described in polar coordinates over each facet, with a facet edge being chosen as the reference to define the angle. An integer called the period jump is associated to each edge of the triangulation to remove the ambiguity when interpolating the direction of the vector field between two facets that share an edge. To interpolate the vector field, we first linearly interpolate the angle of rotation of the vectors along the edges of the facet graph. Then, we use a variant of Nielson's side-vertex scheme to interpolate the vector field over the entire surface. With our representation, we remove the bound imposed on the complexity of singularities that a vertex can represent by its connectivity. This bound is a limitation generally exists in vertex-based linear schemes. Furthermore, using our data structure, the index of a vertex of a vector field can be combinatorily determined. We show the simplicity of the interpolation scheme with a GPU-accelerated algorithm for a LIC-based visualization of the so-defined vector fields, operating in image space. We demonstrate the algorithm applied to various vector fields on curved surfaces.",
"title": "Representing Higher-Order Singularities in Vector Fields on Piecewise Linear Surfaces",
"normalizedTitle": "Representing Higher-Order Singularities in Vector Fields on Piecewise Linear Surfaces",
"fno": "v1315",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Vector Field Visualization",
"Higher Order Singularities",
"Line Integral Convolution",
"GPU"
],
"authors": [
{
"givenName": "Wan-Chiu",
"surname": "Li",
"fullName": "Wan-Chiu Li",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bruno",
"surname": "Vallet",
"fullName": "Bruno Vallet",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nicolas",
"surname": "Ray",
"fullName": "Nicolas Ray",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bruno",
"surname": "Lévy",
"fullName": "Bruno Lévy",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "trans",
"pages": "1315-1322",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/1997/8262/0/82620067",
"title": "Visualization of higher order singularities in vector fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1997/82620067/12OmNwekjzA",
"parentPublication": {
"id": "proceedings/ieee-vis/1997/8262/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/spwhos/1997/8005/0/80050453",
"title": "Playing with long range dependence and HOS",
"doi": null,
"abstractUrl": "/proceedings-article/spwhos/1997/80050453/12OmNwp74Nc",
"parentPublication": {
"id": "proceedings/spwhos/1997/8005/0",
"title": "Proceedings of the IEEE Signal Processing Workshop on Higher-Order Statistics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498mann",
"title": "Computing Singularities of 3D Vector Fields with Geometric Algebra",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498mann/12OmNyFCvVG",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1997/8262/0/82620059",
"title": "Singularities in nonuniform tensor fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1997/82620059/12OmNzFMFiX",
"parentPublication": {
"id": "proceedings/ieee-vis/1997/8262/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061329",
"title": "Illustrative Stream Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061329/13rRUxcsYLM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1307",
"articleId": "13rRUwfZC05",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1323",
"articleId": "13rRUxAAT7v",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCm7Bxu",
"title": "July",
"year": "2011",
"issueNum": "07",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygT7sz",
"doi": "10.1109/TVCG.2010.121",
"abstract": "Rotational symmetries (RoSys) have found uses in several computer graphics applications, such as global surface parameterization, geometry remeshing, texture and geometry synthesis, and nonphotorealistic visualization of surfaces. The visualization of N-way rotational symmetry (N-RoSy) fields is a challenging problem due to the ambiguities in the N directions represented by an N-way symmetry. We provide an algorithm that allows faithful and interactive representation of N-RoSy fields in the plane and on surfaces, by adapting the well-known line integral convolution (LIC) technique from vector and second-order tensor fields. Our algorithm captures N directions associated with each point in a given field by decomposing the field into multiple different vector fields, generating LIC images of these fields, and then blending the results. To address the loss of contrast caused by the blending of images, we observe that the pixel values in LIC images closely approximate normally distributed random variables. This allows us to use concepts from probability theory to correct the loss of contrast without the need to perform any image analysis at each frame.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Rotational symmetries (RoSys) have found uses in several computer graphics applications, such as global surface parameterization, geometry remeshing, texture and geometry synthesis, and nonphotorealistic visualization of surfaces. The visualization of N-way rotational symmetry (N-RoSy) fields is a challenging problem due to the ambiguities in the N directions represented by an N-way symmetry. We provide an algorithm that allows faithful and interactive representation of N-RoSy fields in the plane and on surfaces, by adapting the well-known line integral convolution (LIC) technique from vector and second-order tensor fields. Our algorithm captures N directions associated with each point in a given field by decomposing the field into multiple different vector fields, generating LIC images of these fields, and then blending the results. To address the loss of contrast caused by the blending of images, we observe that the pixel values in LIC images closely approximate normally distributed random variables. This allows us to use concepts from probability theory to correct the loss of contrast without the need to perform any image analysis at each frame.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Rotational symmetries (RoSys) have found uses in several computer graphics applications, such as global surface parameterization, geometry remeshing, texture and geometry synthesis, and nonphotorealistic visualization of surfaces. The visualization of N-way rotational symmetry (N-RoSy) fields is a challenging problem due to the ambiguities in the N directions represented by an N-way symmetry. We provide an algorithm that allows faithful and interactive representation of N-RoSy fields in the plane and on surfaces, by adapting the well-known line integral convolution (LIC) technique from vector and second-order tensor fields. Our algorithm captures N directions associated with each point in a given field by decomposing the field into multiple different vector fields, generating LIC images of these fields, and then blending the results. To address the loss of contrast caused by the blending of images, we observe that the pixel values in LIC images closely approximate normally distributed random variables. This allows us to use concepts from probability theory to correct the loss of contrast without the need to perform any image analysis at each frame.",
"title": "Interactive Visualization of Rotational Symmetry Fields on Surfaces",
"normalizedTitle": "Interactive Visualization of Rotational Symmetry Fields on Surfaces",
"fno": "ttg2011070947",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Rotational Symmetry",
"Ro Sy",
"Visualization",
"Tensor Field Visualization",
"Image Blending",
"Contrast Adjustment"
],
"authors": [
{
"givenName": "Jonathan",
"surname": "Palacios",
"fullName": "Jonathan Palacios",
"affiliation": "Oregon State University, Corvallis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eugene",
"surname": "Zhang",
"fullName": "Eugene Zhang",
"affiliation": "Oregon State University, Corvallis",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2011-07-01 00:00:00",
"pubType": "trans",
"pages": "947-955",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"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/cvpr/2012/1226/0/027P1A27",
"title": "Image matching using local symmetry features",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/027P1A27/12OmNvTBB1F",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/prfts/1997/8212/0/82120078",
"title": "Reliability Modeling of Structured Systems: Exploring Symmetry in State-Space Generation",
"doi": null,
"abstractUrl": "/proceedings-article/prfts/1997/82120078/12OmNvzJG5L",
"parentPublication": {
"id": "proceedings/prfts/1997/8212/0",
"title": "Pacific Rim International Symposium on Fault-Tolerant Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1315",
"title": "Representing Higher-Order Singularities in Vector Fields on Piecewise Linear Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1315/13rRUwInuWq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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/2010/01/ttg2010010095",
"title": "Metric-Driven RoSy Field Design and Remeshing",
"doi": null,
"abstractUrl": "/journal/tg/2010/01/ttg2010010095/13rRUx0gezS",
"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/tp/1999/05/i0466",
"title": "Symmetry Detection by Generalized Complex (GC) Moments: A Close-Form Solution",
"doi": null,
"abstractUrl": "/journal/tp/1999/05/i0466/13rRUxbTMA3",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2010/07/ttp2010071227",
"title": "Spectral Symmetry Analysis",
"doi": null,
"abstractUrl": "/journal/tp/2010/07/ttp2010071227/13rRUygT7gu",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011070934",
"articleId": "13rRUy0HYRm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011070956",
"articleId": "13rRUwInvys",
"__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": "13rRUxYrbUx",
"doi": "10.1109/TVCG.2008.163",
"abstract": "Smoke rendering is a standard technique for flow visualization. Most approaches are based on a volumetric, par ticle based, or image based representation of the smoke. This paper introduces an alternative representation of smoke structures: as semi-transparent streak surfaces. In order to make streak surface integration fast enough for interactive applications, we avoid expensive adaptive retriangulations by coupling the opacity of the triangles to their shapes. This way, the surface shows a smoke-like look even in rather turbulent areas. Fur thermore, we show modifications of the approach to mimic smoke nozzles, wool tufts, and time surfaces. The technique is applied to a number of test data sets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Smoke rendering is a standard technique for flow visualization. Most approaches are based on a volumetric, par ticle based, or image based representation of the smoke. This paper introduces an alternative representation of smoke structures: as semi-transparent streak surfaces. In order to make streak surface integration fast enough for interactive applications, we avoid expensive adaptive retriangulations by coupling the opacity of the triangles to their shapes. This way, the surface shows a smoke-like look even in rather turbulent areas. Fur thermore, we show modifications of the approach to mimic smoke nozzles, wool tufts, and time surfaces. The technique is applied to a number of test data sets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Smoke rendering is a standard technique for flow visualization. Most approaches are based on a volumetric, par ticle based, or image based representation of the smoke. This paper introduces an alternative representation of smoke structures: as semi-transparent streak surfaces. In order to make streak surface integration fast enough for interactive applications, we avoid expensive adaptive retriangulations by coupling the opacity of the triangles to their shapes. This way, the surface shows a smoke-like look even in rather turbulent areas. Fur thermore, we show modifications of the approach to mimic smoke nozzles, wool tufts, and time surfaces. The technique is applied to a number of test data sets.",
"title": "Smoke Surfaces: An Interactive Flow Visualization Technique Inspired by Real-World Flow Experiments",
"normalizedTitle": "Smoke Surfaces: An Interactive Flow Visualization Technique Inspired by Real-World Flow Experiments",
"fno": "ttg2008061396",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Unsteady Flow Visualization",
"Streak Surfaces",
"Smoke Visualization"
],
"authors": [
{
"givenName": "Wolfram",
"surname": "von Funck",
"fullName": "Wolfram von Funck",
"affiliation": "MPI Informatik Saarbücken",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tino",
"surname": "Weinkauf",
"fullName": "Tino Weinkauf",
"affiliation": "Zuse Institute Berlin",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Holger",
"surname": "Theisel",
"fullName": "Holger Theisel",
"affiliation": "University of Magdeburg",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hans-Peter",
"surname": "Seidel",
"fullName": "Hans-Peter Seidel",
"affiliation": "MPI Informatik Saarbücken",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1396-1403",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2012/4711/0/4711a532",
"title": "A Novel Video-Based Smoke Detection Method Using Image Separation",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2012/4711a532/12OmNBVIUwq",
"parentPublication": {
"id": "proceedings/icme/2012/4711/0",
"title": "2012 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2000/0868/0/08680135",
"title": "Modeling of Smoke Flow Taking Obstacles into Account",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2000/08680135/12OmNvjyxxt",
"parentPublication": {
"id": "proceedings/pg/2000/0868/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2009/3583/1/3583a381",
"title": "3-D Numerical Simulation of Smoke Flow during Tunnel Fire",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2009/3583a381/12OmNwF0BLe",
"parentPublication": {
"id": "proceedings/icmtma/2009/3583/3",
"title": "2009 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300018",
"title": "Image Space Based Visualization of Unsteady Flow on Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300018/12OmNxH9Xhw",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061259",
"title": "Interactive Streak Surface Visualization on the GPU",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061259/13rRUwIF69e",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/06/v0637",
"title": "ISA and IBFVS: Image Space-Based Visualization of Flow on Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2004/06/v0637/13rRUwInuWn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2012/05/mcs2012050078",
"title": "Flow Visualization and Analysis Using Streak and Time Lines",
"doi": null,
"abstractUrl": "/magazine/cs/2012/05/mcs2012050078/13rRUx0xQ3w",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061267",
"title": "Time and Streak Surfaces for Flow Visualization in Large Time-Varying Data Sets",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061267/13rRUxBa5bM",
"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": "trans/tg/2010/06/ttg2010061225",
"title": "Streak Lines as Tangent Curves of a Derived Vector Field",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061225/13rRUy0HYRl",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061388",
"articleId": "13rRUygBw73",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061412",
"articleId": "13rRUB7a10V",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRVu",
"name": "ttg2008061396.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2008061396.zip",
"extension": "zip",
"size": "39.9 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUwfZC0a",
"doi": "10.1109/TVCG.2009.130",
"abstract": "A dendrogram that visualizes a clustering hierarchy is often integrated with a re-orderable matrix for pattern identification. The method is widely used in many research fields including biology, geography, statistics, and data mining. However, most dendrograms do not scale up well, particularly with respect to problems of graphical and cognitive information overload. This research proposes a strategy that links an overview dendrogram and a detail-view dendrogram, each integrated with a re-orderable matrix. The overview displays only a user-controlled, limited number of nodes that represent the “skeleton” of a hierarchy. The detail view displays the sub-tree represented by a selected meta-node in the overview. The research presented here focuses on constructing a concise overview dendrogram and its coordination with a detail view. The proposed method has the following benefits: dramatic alleviation of information overload, enhanced scalability and data abstraction quality on the dendrogram, and the support of data exploration at arbitrary levels of detail. The contribution of the paper includes a new metric to measure the “importance” of nodes in a dendrogram; the method to construct the concise overview dendrogram from the dynamically-identified, important nodes; and measure for evaluating the data abstraction quality for dendrograms. We evaluate and compare the proposed method to some related existing methods, and demonstrating how the proposed method can help users find interesting patterns through a case study on county-level U.S. cervical cancer mortality and demographic data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A dendrogram that visualizes a clustering hierarchy is often integrated with a re-orderable matrix for pattern identification. The method is widely used in many research fields including biology, geography, statistics, and data mining. However, most dendrograms do not scale up well, particularly with respect to problems of graphical and cognitive information overload. This research proposes a strategy that links an overview dendrogram and a detail-view dendrogram, each integrated with a re-orderable matrix. The overview displays only a user-controlled, limited number of nodes that represent the “skeleton” of a hierarchy. The detail view displays the sub-tree represented by a selected meta-node in the overview. The research presented here focuses on constructing a concise overview dendrogram and its coordination with a detail view. The proposed method has the following benefits: dramatic alleviation of information overload, enhanced scalability and data abstraction quality on the dendrogram, and the support of data exploration at arbitrary levels of detail. The contribution of the paper includes a new metric to measure the “importance” of nodes in a dendrogram; the method to construct the concise overview dendrogram from the dynamically-identified, important nodes; and measure for evaluating the data abstraction quality for dendrograms. We evaluate and compare the proposed method to some related existing methods, and demonstrating how the proposed method can help users find interesting patterns through a case study on county-level U.S. cervical cancer mortality and demographic data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A dendrogram that visualizes a clustering hierarchy is often integrated with a re-orderable matrix for pattern identification. The method is widely used in many research fields including biology, geography, statistics, and data mining. However, most dendrograms do not scale up well, particularly with respect to problems of graphical and cognitive information overload. This research proposes a strategy that links an overview dendrogram and a detail-view dendrogram, each integrated with a re-orderable matrix. The overview displays only a user-controlled, limited number of nodes that represent the “skeleton” of a hierarchy. The detail view displays the sub-tree represented by a selected meta-node in the overview. The research presented here focuses on constructing a concise overview dendrogram and its coordination with a detail view. The proposed method has the following benefits: dramatic alleviation of information overload, enhanced scalability and data abstraction quality on the dendrogram, and the support of data exploration at arbitrary levels of detail. The contribution of the paper includes a new metric to measure the “importance” of nodes in a dendrogram; the method to construct the concise overview dendrogram from the dynamically-identified, important nodes; and measure for evaluating the data abstraction quality for dendrograms. We evaluate and compare the proposed method to some related existing methods, and demonstrating how the proposed method can help users find interesting patterns through a case study on county-level U.S. cervical cancer mortality and demographic data.",
"title": "Constructing Overview + Detail Dendrogram-Matrix Views",
"normalizedTitle": "Constructing Overview + Detail Dendrogram-Matrix Views",
"fno": "ttg2009060889",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Dendrogram",
"Reorderable Matrix",
"Compound Graphs",
"Data Abstraction Quality Metrics",
"Hierarchical Clusters"
],
"authors": [
{
"givenName": "Jin",
"surname": "Chen",
"fullName": "Jin Chen",
"affiliation": "Pennsylvania State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alan M.",
"surname": "MacEachren",
"fullName": "Alan M. MacEachren",
"affiliation": "Pennsylvania State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Donna J.",
"surname": "Peuquet",
"fullName": "Donna J. Peuquet",
"affiliation": "Pennsylvania State University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2009-11-01 00:00:00",
"pubType": "trans",
"pages": "889-896",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/grc/2012/2310/0/06468689",
"title": "Top-down vs bottom-up methods of linkage for asymmetric agglomerative hierarchical clustering",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2012/06468689/12OmNrK9q1k",
"parentPublication": {
"id": "proceedings/grc/2012/2310/0",
"title": "2012 IEEE International Conference on Granular Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccabs/2011/4851/0/13",
"title": "Bcl::Cluster: A method for clustering biological molecules coupled with visualization in the Pymol Molecular Graphics System",
"doi": null,
"abstractUrl": "/proceedings-article/iccabs/2011/13/12OmNvkGW3H",
"parentPublication": {
"id": "proceedings/iccabs/2011/4851/0",
"title": "2011 IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences (ICCABS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/conielecomp/2004/2074/0/20740277",
"title": "Wavelet Image Compression Using Universal Coefficients Matrix Detail Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/conielecomp/2004/20740277/12OmNwnYG21",
"parentPublication": {
"id": "proceedings/conielecomp/2004/2074/0",
"title": "Electronics, Communications, and Computers, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2012/4660/0/06402554",
"title": "Interactive 4D overview and detail visualization in augmented reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2012/06402554/12OmNy3iFjC",
"parentPublication": {
"id": "proceedings/ismar/2012/4660/0",
"title": "2012 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2015/6879/0/07156353",
"title": "Dendrogramix: A hybrid tree-matrix visualization technique to support interactive exploration of dendrograms",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156353/12OmNyQphg2",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2010/4256/0/4256b073",
"title": "Visualizing Graphs Using Minimum Spanning Dendrograms",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2010/4256b073/12OmNzZWbQK",
"parentPublication": {
"id": "proceedings/icdm/2010/4256/0",
"title": "2010 IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061293",
"title": "Exploration of Networks using overview+detail with Constraint-based cooperative layout",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061293/13rRUyp7tWQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a275",
"title": "Interactive Close-Up Rendering for Detail+Overview Visualization of 3D Digital Terrain Models",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a275/1cMFcdJBwFa",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aivr/2019/5604/0/560400a144",
"title": "Immersive Analytics of Large Dynamic Networks via Overview and Detail Navigation",
"doi": null,
"abstractUrl": "/proceedings-article/aivr/2019/560400a144/1grOkAC5X9K",
"parentPublication": {
"id": "proceedings/aivr/2019/5604/0",
"title": "2019 IEEE International Conference on Artificial Intelligence and Virtual Reality (AIVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222098",
"title": "Embodied Navigation in Immersive Abstract Data Visualization: Is Overview+Detail or Zooming Better for 3D Scatterplots?",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222098/1nTrQ1hHyyA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009060881",
"articleId": "13rRUx0xPTM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2009060897",
"articleId": "13rRUEgarsE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesNj",
"name": "ttg2009060889s.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2009060889s.mov",
"extension": "mov",
"size": "65 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUyYBlgt",
"doi": "10.1109/TVCG.2008.181",
"abstract": "Ranking data, which result from m raters ranking n items, are difficult to visualize due to their discrete algebraic structure, and the computational difficulties associated with them when n is large. This problem becomes worse when raters provide tied rankings or not all items are ranked. We develop an approach for the visualization of ranking data for large n which is intuitive, easy to use, and computationally efficient. The approach overcomes the structural and computational difficulties by utilizing a natural measure of dissimilarity for rater, and projecting the raters into a low dimensional vector space where they are viewed. The visualization techniques are demonstrated using voting data, jokes, and movie preferences.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Ranking data, which result from m raters ranking n items, are difficult to visualize due to their discrete algebraic structure, and the computational difficulties associated with them when n is large. This problem becomes worse when raters provide tied rankings or not all items are ranked. We develop an approach for the visualization of ranking data for large n which is intuitive, easy to use, and computationally efficient. The approach overcomes the structural and computational difficulties by utilizing a natural measure of dissimilarity for rater, and projecting the raters into a low dimensional vector space where they are viewed. The visualization techniques are demonstrated using voting data, jokes, and movie preferences.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Ranking data, which result from m raters ranking n items, are difficult to visualize due to their discrete algebraic structure, and the computational difficulties associated with them when n is large. This problem becomes worse when raters provide tied rankings or not all items are ranked. We develop an approach for the visualization of ranking data for large n which is intuitive, easy to use, and computationally efficient. The approach overcomes the structural and computational difficulties by utilizing a natural measure of dissimilarity for rater, and projecting the raters into a low dimensional vector space where they are viewed. The visualization techniques are demonstrated using voting data, jokes, and movie preferences.",
"title": "Visualizing Incomplete and Partially Ranked Data",
"normalizedTitle": "Visualizing Incomplete and Partially Ranked Data",
"fno": "ttg2008061356",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Partial Rankings",
"Incomplete Rankings",
"Multidimensional Scaling"
],
"authors": [
{
"givenName": "Paul",
"surname": "Kidwell",
"fullName": "Paul Kidwell",
"affiliation": "Department of Statistics, Purdue University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guy",
"surname": "Lebanon",
"fullName": "Guy Lebanon",
"affiliation": "College of Computing, Georgia Institute of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "William",
"surname": "Cleveland",
"fullName": "William Cleveland",
"affiliation": "Departments of Statistics and Computer Science, Purdue University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1356-1363",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-infovis/2003/2055/0/20550011",
"title": "Improving Hybrid MDS with Pivot-Based Searching",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2003/20550011/12OmNAq3hT8",
"parentPublication": {
"id": "proceedings/ieee-infovis/2003/2055/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2014/5666/0/07004361",
"title": "Multiresolution analysis of incomplete rankings with applications to prediction",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2014/07004361/12OmNB8kHOY",
"parentPublication": {
"id": "proceedings/big-data/2014/5666/0",
"title": "2014 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/1996/7668/0/76680072",
"title": "Animating multidimensional scaling to visualize N-dimensional data sets",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/1996/76680072/12OmNCesr2B",
"parentPublication": {
"id": "proceedings/ieee-infovis/1996/7668/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1987/06/04767986",
"title": "Synthesizing Statistical Knowledge from Incomplete Mixed-Mode Data",
"doi": null,
"abstractUrl": "/journal/tp/1987/06/04767986/13rRUILtJmU",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061340",
"title": "Interactive Visual Analysis of Set-Typed Data",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061340/13rRUIM2VGX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1969/05/01671271",
"title": "A Nonlinear Mapping for Data Structure Analysis",
"doi": null,
"abstractUrl": "/journal/tc/1969/05/01671271/13rRUwI5U1h",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09894703",
"title": "Analyzing Preference Data With Local Privacy: Optimal Utility and Enhanced Robustness",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09894703/1GNpaBpcJA4",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061483",
"articleId": "13rRUxNEqPL",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061491",
"articleId": "13rRUwgyOjg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNy7Qfq3",
"title": "September",
"year": "2007",
"issueNum": "09",
"idPrefix": "td",
"pubType": "journal",
"volume": "18",
"label": "September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILLkDr",
"doi": "10.1109/TPDS.2007.1049",
"abstract": "The use of space filling curves for proximity-improving mappings is well known and has found many useful applications in parallel computing. Such curves permit a linear array to be mapped onto a 2(respectively, 3)D structure such that points distance d apart in the linear array are distance O(d^1/2) (O(d^1/3)) apart in the 2(3)D array and vice-versa. We extend the concept of space filling curves to space filling surfaces and show how these surfaces lead to mappings from 2D to 3D so that points at distance d^1/2 on the 2D surface are mapped to points at distance O(d^1/3) in the 3D volume. Three classes of surfaces, associated respectively with the Peano curve, Sierpinski carpet, and the Hilbert curve, are presented. A methodology for using these surfaces to map from 2D to 3D is developed. These results permit efficient execution of 2D computations on processors interconnected in a 3D grid. The space filling surfaces proposed by us are the first such fractal objects to be formally defined and are thus also of intrinsic interest in the context of fractal geometry.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The use of space filling curves for proximity-improving mappings is well known and has found many useful applications in parallel computing. Such curves permit a linear array to be mapped onto a 2(respectively, 3)D structure such that points distance d apart in the linear array are distance O(d^1/2) (O(d^1/3)) apart in the 2(3)D array and vice-versa. We extend the concept of space filling curves to space filling surfaces and show how these surfaces lead to mappings from 2D to 3D so that points at distance d^1/2 on the 2D surface are mapped to points at distance O(d^1/3) in the 3D volume. Three classes of surfaces, associated respectively with the Peano curve, Sierpinski carpet, and the Hilbert curve, are presented. A methodology for using these surfaces to map from 2D to 3D is developed. These results permit efficient execution of 2D computations on processors interconnected in a 3D grid. The space filling surfaces proposed by us are the first such fractal objects to be formally defined and are thus also of intrinsic interest in the context of fractal geometry.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The use of space filling curves for proximity-improving mappings is well known and has found many useful applications in parallel computing. Such curves permit a linear array to be mapped onto a 2(respectively, 3)D structure such that points distance d apart in the linear array are distance O(d^1/2) (O(d^1/3)) apart in the 2(3)D array and vice-versa. We extend the concept of space filling curves to space filling surfaces and show how these surfaces lead to mappings from 2D to 3D so that points at distance d^1/2 on the 2D surface are mapped to points at distance O(d^1/3) in the 3D volume. Three classes of surfaces, associated respectively with the Peano curve, Sierpinski carpet, and the Hilbert curve, are presented. A methodology for using these surfaces to map from 2D to 3D is developed. These results permit efficient execution of 2D computations on processors interconnected in a 3D grid. The space filling surfaces proposed by us are the first such fractal objects to be formally defined and are thus also of intrinsic interest in the context of fractal geometry.",
"title": "Mapping with Space Filling Surfaces",
"normalizedTitle": "Mapping with Space Filling Surfaces",
"fno": "l1258",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Fractals",
"Hilbert Curve",
"Parallel Computing",
"Peano Curve",
"Sierpinski Carpet",
"Space Filling Curves",
"Space Filling Surfaces"
],
"authors": [
{
"givenName": "Masood",
"surname": "Ahmed",
"fullName": "Masood Ahmed",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shahid",
"surname": "Bokhari",
"fullName": "Shahid Bokhari",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2007-09-01 00:00:00",
"pubType": "trans",
"pages": "1258-1269",
"year": "2007",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/1994/6275/0/00577130",
"title": "On the metric properties of discrete space-filling curves",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1994/00577130/12OmNAMtAMh",
"parentPublication": {
"id": "proceedings/icpr/1994/6275/0",
"title": "12th IAPR International Conference on Pattern Recognition, 1994",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpp/2006/2636/0/26360505",
"title": "A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition",
"doi": null,
"abstractUrl": "/proceedings-article/icpp/2006/26360505/12OmNBkP3AU",
"parentPublication": {
"id": "proceedings/icpp/2006/2636/0",
"title": "2006 International Conference on Parallel Processing (ICPP'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fpl/2005/9362/0/01515757",
"title": "Fast FPGA placement using space-filling curve",
"doi": null,
"abstractUrl": "/proceedings-article/fpl/2005/01515757/12OmNBqv2rk",
"parentPublication": {
"id": "proceedings/fpl/2005/9362/0",
"title": "Proceedings. 2005 International Conference on Field Programmable Logic and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsa/2008/3243/0/3243a507",
"title": "Fast N-Dimensional Hilbert Mapping Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/iccsa/2008/3243a507/12OmNwtn3uo",
"parentPublication": {
"id": "proceedings/iccsa/2008/3243/0",
"title": "2008 International Conference on Computational Sciences and Its Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2009/3885/0/3885a379",
"title": "DNAjig: A New Approach for Building DNA Nanostructures",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2009/3885a379/12OmNxWcHet",
"parentPublication": {
"id": "proceedings/bibm/2009/3885/0",
"title": "2009 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1997/8183/2/81832462",
"title": "A Markovian approach to color image restoration based on space filling curves",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1997/81832462/12OmNxYL5eE",
"parentPublication": {
"id": "proceedings/icip/1997/8183/2",
"title": "Proceedings of International Conference on Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2013/5050/0/5050a701",
"title": "Filling Free-Form n-Sided Holes toward Blending and Decoration",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2013/5050a701/12OmNz5apJL",
"parentPublication": {
"id": "proceedings/icig/2013/5050/0",
"title": "2013 Seventh International Conference on Image and Graphics (ICIG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1991/11/i1115",
"title": "Estimation of Planar Curves, Surfaces, and Nonplanar Space Curves Defined by Implicit Equations with Applications to Edge and Range Image Segmentation",
"doi": null,
"abstractUrl": "/journal/tp/1991/11/i1115/13rRUNvgzaN",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2001/01/k0124",
"title": "Analysis of the Clustering Properties of the Hilbert Space-Filling Curve",
"doi": null,
"abstractUrl": "/journal/tk/2001/01/k0124/13rRUwhHcJE",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061301",
"title": "Rapid Graph Layout Using Space Filling Curves",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061301/13rRUx0xPIx",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "l1241",
"articleId": "13rRUxcbnGH",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "l1270",
"articleId": "13rRUxBJhFb",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyoiZ0P",
"title": "April",
"year": "2005",
"issueNum": "04",
"idPrefix": "ts",
"pubType": "journal",
"volume": "31",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjXZLr",
"doi": "10.1109/TSE.2005.50",
"abstract": "An understanding of how software is employed in the field can yield many opportunities for quality improvements. Profiling released software can provide such an understanding. However, profiling released software is difficult due to the potentially large number of deployed sites that must be profiled, the transparency requirements at a user's site, and the remote data collection and deployment management process. Researchers have recently proposed various approaches to tap into the opportunities offered by profiling deployed systems and overcome those challenges. Initial studies have illustrated the application of these approaches and have shown their feasibility. Still, the proposed approaches, and the tradeoffs between overhead, accuracy, and potential benefits for the testing activity have been barely quantified. This paper aims to overcome those limitations. Our analysis of 1,200 user sessions on a 155 KLOC deployed system substantiates the ability of field data to support test suite improvements, assesses the efficiency of profiling techniques for released software, and the effectiveness of testing efforts that leverage profiled field data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "An understanding of how software is employed in the field can yield many opportunities for quality improvements. Profiling released software can provide such an understanding. However, profiling released software is difficult due to the potentially large number of deployed sites that must be profiled, the transparency requirements at a user's site, and the remote data collection and deployment management process. Researchers have recently proposed various approaches to tap into the opportunities offered by profiling deployed systems and overcome those challenges. Initial studies have illustrated the application of these approaches and have shown their feasibility. Still, the proposed approaches, and the tradeoffs between overhead, accuracy, and potential benefits for the testing activity have been barely quantified. This paper aims to overcome those limitations. Our analysis of 1,200 user sessions on a 155 KLOC deployed system substantiates the ability of field data to support test suite improvements, assesses the efficiency of profiling techniques for released software, and the effectiveness of testing efforts that leverage profiled field data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "An understanding of how software is employed in the field can yield many opportunities for quality improvements. Profiling released software can provide such an understanding. However, profiling released software is difficult due to the potentially large number of deployed sites that must be profiled, the transparency requirements at a user's site, and the remote data collection and deployment management process. Researchers have recently proposed various approaches to tap into the opportunities offered by profiling deployed systems and overcome those challenges. Initial studies have illustrated the application of these approaches and have shown their feasibility. Still, the proposed approaches, and the tradeoffs between overhead, accuracy, and potential benefits for the testing activity have been barely quantified. This paper aims to overcome those limitations. Our analysis of 1,200 user sessions on a 155 KLOC deployed system substantiates the ability of field data to support test suite improvements, assesses the efficiency of profiling techniques for released software, and the effectiveness of testing efforts that leverage profiled field data.",
"title": "Profiling Deployed Software: Assessing Strategies and Testing Opportunities",
"normalizedTitle": "Profiling Deployed Software: Assessing Strategies and Testing Opportunities",
"fno": "e0312",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Index Terms Profiling",
"Instrumentation",
"Software Deployment",
"Testing",
"Empirical Studies"
],
"authors": [
{
"givenName": "Sebastian",
"surname": "Elbaum",
"fullName": "Sebastian Elbaum",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Madeline",
"surname": "Diep",
"fullName": "Madeline Diep",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2005-04-01 00:00:00",
"pubType": "trans",
"pages": "312-327",
"year": "2005",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/qest/2009/3808/0/3808a107",
"title": "Locating Performance Bottlenecks in Embedded Java Software with Calling-Context Cross-Profiling",
"doi": null,
"abstractUrl": "/proceedings-article/qest/2009/3808a107/12OmNAolGNC",
"parentPublication": {
"id": "proceedings/qest/2009/3808/0",
"title": "Quantitative Evaluation of Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipps/1992/2672/0/0223048",
"title": "Profiling based task migration",
"doi": null,
"abstractUrl": "/proceedings-article/ipps/1992/0223048/12OmNC8MsGq",
"parentPublication": {
"id": "proceedings/ipps/1992/2672/0",
"title": "Parallel Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isss/1995/7076/0/70760128",
"title": "Profiling in the ASP codesign environment",
"doi": null,
"abstractUrl": "/proceedings-article/isss/1995/70760128/12OmNCcbE76",
"parentPublication": {
"id": "proceedings/isss/1995/7076/0",
"title": "System Synthesis, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/2011/4576/0/4576a372",
"title": "ANEPROF: Energy Profiling for Android Java Virtual Machine and Applications",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2011/4576a372/12OmNqIhFLF",
"parentPublication": {
"id": "proceedings/icpads/2011/4576/0",
"title": "Parallel and Distributed Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2005/2312/16/23120271a",
"title": "QQ: Nanoscale Timing and Profiling",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2005/23120271a/12OmNqJ8td9",
"parentPublication": {
"id": "proceedings/ipdps/2005/2312/16",
"title": "Parallel and Distributed Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nca/2011/4489/0/4489a171",
"title": "Adaptive Profiling for Root-Cause Analysis of Performance Anomalies in Web-Based Applications",
"doi": null,
"abstractUrl": "/proceedings-article/nca/2011/4489a171/12OmNvzJGao",
"parentPublication": {
"id": "proceedings/nca/2011/4489/0",
"title": "2011 IEEE 10th International Symposium on Network Computing and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rtas/2000/0713/0/07130208",
"title": "An Automated Profiling Subsystem for QoS-Aware Services",
"doi": null,
"abstractUrl": "/proceedings-article/rtas/2000/07130208/12OmNwGZNTv",
"parentPublication": {
"id": "proceedings/rtas/2000/0713/0",
"title": "Proceedings Sixth IEEE Real-Time Technology and Applications Symposium. RTAS 2000",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/2009/3900/0/3900a519",
"title": "Multiprocessor System-on-Chip Profiling Architecture: Design and Implementation",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2009/3900a519/12OmNxG1yD2",
"parentPublication": {
"id": "proceedings/icpads/2009/3900/0",
"title": "Parallel and Distributed Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2016/03/mmi2016030054",
"title": "Profiling a Warehouse-Scale Computer",
"doi": null,
"abstractUrl": "/magazine/mi/2016/03/mmi2016030054/13rRUILc8ck",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2004/05/t0512",
"title": "EPIC: Profiling the Propagation and Effect of Data Errors in Software",
"doi": null,
"abstractUrl": "/journal/tc/2004/05/t0512/13rRUwhpBDr",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "e0292",
"articleId": "13rRUwdIOWF",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "e0328",
"articleId": "13rRUyY28ZY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyq0zFm",
"title": "November/December",
"year": "2005",
"issueNum": "06",
"idPrefix": "tm",
"pubType": "journal",
"volume": "4",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBrGht",
"doi": "10.1109/TMC.2005.78",
"abstract": "Ad hoc localization of wireless sensor nodes is a fundamental problem in wireless sensor networks. Despite the recent proposals for the development of ad hoc localization algorithms, the fundamental behavior in systems using measurements has not been characterized. In this paper, we take a first step toward such a characterization by examining the behavior of error inducing parameters in multihop localization systems in an algorithm independent manner. We first derive the Cramé Rao Bound for Gaussian measurement error for multihop localization systems using distance and angular measurements. Later on, we use these bounds on a carefully controlled set of scenarios to study the trends in the error induced by the measurement technology accuracy, network density, beacon node concentration, and beacon uncertainty. By exposing these trends, the goal of this paper is to develop a fundamental understanding of the error behavior that can provide a set of guidelines to be considered during the design and deployment of multihop localization systems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Ad hoc localization of wireless sensor nodes is a fundamental problem in wireless sensor networks. Despite the recent proposals for the development of ad hoc localization algorithms, the fundamental behavior in systems using measurements has not been characterized. In this paper, we take a first step toward such a characterization by examining the behavior of error inducing parameters in multihop localization systems in an algorithm independent manner. We first derive the Cramé Rao Bound for Gaussian measurement error for multihop localization systems using distance and angular measurements. Later on, we use these bounds on a carefully controlled set of scenarios to study the trends in the error induced by the measurement technology accuracy, network density, beacon node concentration, and beacon uncertainty. By exposing these trends, the goal of this paper is to develop a fundamental understanding of the error behavior that can provide a set of guidelines to be considered during the design and deployment of multihop localization systems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Ad hoc localization of wireless sensor nodes is a fundamental problem in wireless sensor networks. Despite the recent proposals for the development of ad hoc localization algorithms, the fundamental behavior in systems using measurements has not been characterized. In this paper, we take a first step toward such a characterization by examining the behavior of error inducing parameters in multihop localization systems in an algorithm independent manner. We first derive the Cramé Rao Bound for Gaussian measurement error for multihop localization systems using distance and angular measurements. Later on, we use these bounds on a carefully controlled set of scenarios to study the trends in the error induced by the measurement technology accuracy, network density, beacon node concentration, and beacon uncertainty. By exposing these trends, the goal of this paper is to develop a fundamental understanding of the error behavior that can provide a set of guidelines to be considered during the design and deployment of multihop localization systems.",
"title": "An Analysis of Error Inducing Parameters in Multihop Sensor Node Localization",
"normalizedTitle": "An Analysis of Error Inducing Parameters in Multihop Sensor Node Localization",
"fno": "h0567",
"hasPdf": true,
"idPrefix": "tm",
"keywords": [
"Index Terms Multihop Node Localization",
"Sensor Networks",
"Crame Rao Bounds",
"Position Estimation"
],
"authors": [
{
"givenName": "Andreas",
"surname": "Savvides",
"fullName": "Andreas Savvides",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wendy L.",
"surname": "Garber",
"fullName": "Wendy L. Garber",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Randolph L.",
"surname": "Moses",
"fullName": "Randolph L. Moses",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mani B.",
"surname": "Srivastava",
"fullName": "Mani B. Srivastava",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2005-11-01 00:00:00",
"pubType": "trans",
"pages": "567-577",
"year": "2005",
"issn": "1536-1233",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/mahss/2005/9465/0/01542843",
"title": "A scalable and adaptive clock synchronization protocol for IEEE 802.11-based multihop ad hoc networks",
"doi": null,
"abstractUrl": "/proceedings-article/mahss/2005/01542843/12OmNCcKQKg",
"parentPublication": {
"id": "proceedings/mahss/2005/9465/0",
"title": "IEEE International Conference on Mobile Adhoc and Sensor Systems Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mahss/2005/9465/0/01542835",
"title": "Sensor node localization using mobile acoustic beacons",
"doi": null,
"abstractUrl": "/proceedings-article/mahss/2005/01542835/12OmNrAMERy",
"parentPublication": {
"id": "proceedings/mahss/2005/9465/0",
"title": "IEEE International Conference on Mobile Adhoc and Sensor Systems Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsym/2016/3438/0/07858473",
"title": "An Improved DV-Hop Distributed Active Multihop Localization Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/compsym/2016/07858473/12OmNxzuMPI",
"parentPublication": {
"id": "proceedings/compsym/2016/3438/0",
"title": "2016 International Computer Symposium (ICS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icinis/2009/3852/0/3852a156",
"title": "Localization Algorithm of Mobile Node in WSN Based on Monte Carlo",
"doi": null,
"abstractUrl": "/proceedings-article/icinis/2009/3852a156/12OmNyKrHoq",
"parentPublication": {
"id": "proceedings/icinis/2009/3852/0",
"title": "Intelligent Networks and Intelligent Systems, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/waina/2013/4952/0/4952a809",
"title": "Multihop Mobility Metrics based on Link Stability",
"doi": null,
"abstractUrl": "/proceedings-article/waina/2013/4952a809/12OmNz61d5o",
"parentPublication": {
"id": "proceedings/waina/2013/4952/0",
"title": "2013 27th International Conference on Advanced Information Networking and Applications Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2012/04/ttd2012040634",
"title": "Asymmetric Event-Driven Node Localization in Wireless Sensor Networks",
"doi": null,
"abstractUrl": "/journal/td/2012/04/ttd2012040634/13rRUEgarji",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2010/04/ttm2010040540",
"title": "On Multihop Distances in Wireless Sensor Networks with Random Node Locations",
"doi": null,
"abstractUrl": "/journal/tm/2010/04/ttm2010040540/13rRUILtJA7",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2011/12/ttm2011121666",
"title": "Cooperating with Smartness: Using Heterogeneous Smart Antennas in Multihop Wireless Networks",
"doi": null,
"abstractUrl": "/journal/tm/2011/12/ttm2011121666/13rRUwdrdLn",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2010/06/ttm2010060810",
"title": "Secure Distance-Based Localization in the Presence of Cheating Beacon Nodes",
"doi": null,
"abstractUrl": "/journal/tm/2010/06/ttm2010060810/13rRUx0geAx",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ithings-greencom-cpscom-smartdata/2019/2980/0/298000a980",
"title": "Beacon Node Placement for Minimal Localization Error",
"doi": null,
"abstractUrl": "/proceedings-article/ithings-greencom-cpscom-smartdata/2019/298000a980/1ehBBI5DyJW",
"parentPublication": {
"id": "proceedings/ithings-greencom-cpscom-smartdata/2019/2980/0",
"title": "2019 International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "h0552",
"articleId": "13rRUIJuxqb",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "h0578",
"articleId": "13rRUIIVlde",
"__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": "13rRUwhHcQS",
"doi": "10.1109/TVCG.2013.149",
"abstract": "Visualization of dynamically changing networks (graphs) is a significant challenge for researchers. Previous work has experimentally compared animation, small multiples, and other techniques, and found trade-offs between these. One potential way to avoid such trade-offs is to combine previous techniques in a hybrid visualization. We present two taxonomies of visualizations of dynamic graphs: one of non-hybrid techniques, and one of hybrid techniques. We also describe a prototype, called DiffAni, that allows a graph to be visualized as a sequence of three kinds of tiles: diff tiles that show difference maps over some time interval, animation tiles that show the evolution of the graph over some time interval, and small multiple tiles that show the graph state at an individual time slice. This sequence of tiles is ordered by time and covers all time slices in the data. An experimental evaluation of DiffAni shows that our hybrid approach has advantages over non-hybrid techniques in certain cases.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visualization of dynamically changing networks (graphs) is a significant challenge for researchers. Previous work has experimentally compared animation, small multiples, and other techniques, and found trade-offs between these. One potential way to avoid such trade-offs is to combine previous techniques in a hybrid visualization. We present two taxonomies of visualizations of dynamic graphs: one of non-hybrid techniques, and one of hybrid techniques. We also describe a prototype, called DiffAni, that allows a graph to be visualized as a sequence of three kinds of tiles: diff tiles that show difference maps over some time interval, animation tiles that show the evolution of the graph over some time interval, and small multiple tiles that show the graph state at an individual time slice. This sequence of tiles is ordered by time and covers all time slices in the data. An experimental evaluation of DiffAni shows that our hybrid approach has advantages over non-hybrid techniques in certain cases.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visualization of dynamically changing networks (graphs) is a significant challenge for researchers. Previous work has experimentally compared animation, small multiples, and other techniques, and found trade-offs between these. One potential way to avoid such trade-offs is to combine previous techniques in a hybrid visualization. We present two taxonomies of visualizations of dynamic graphs: one of non-hybrid techniques, and one of hybrid techniques. We also describe a prototype, called DiffAni, that allows a graph to be visualized as a sequence of three kinds of tiles: diff tiles that show difference maps over some time interval, animation tiles that show the evolution of the graph over some time interval, and small multiple tiles that show the graph state at an individual time slice. This sequence of tiles is ordered by time and covers all time slices in the data. An experimental evaluation of DiffAni shows that our hybrid approach has advantages over non-hybrid techniques in certain cases.",
"title": "DiffAni: Visualizing Dynamic Graphs with a Hybrid of Difference Maps and Animation",
"normalizedTitle": "DiffAni: Visualizing Dynamic Graphs with a Hybrid of Difference Maps and Animation",
"fno": "ttg2013122556",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Animation",
"Computer Graphics",
"Prototypes",
"Animation",
"Computer Graphics",
"Prototypes",
"Difference Map",
"Dynamic Networks",
"Hybrid Visualization",
"Taxonomy",
"Evolution"
],
"authors": [
{
"givenName": "Sebastien",
"surname": "Rufiange",
"fullName": "Sebastien Rufiange",
"affiliation": "Ecole de Technol. Super., Montreal, QC, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael J.",
"surname": "McGuffin",
"fullName": "Michael J. McGuffin",
"affiliation": "Ecole de Technol. Super., Montreal, QC, Canada",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2013-12-01 00:00:00",
"pubType": "trans",
"pages": "2556-2565",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wsc/1988/42/0/00716135",
"title": "GPSS/PC graphics and animation",
"doi": null,
"abstractUrl": "/proceedings-article/wsc/1988/00716135/12OmNBOCWaF",
"parentPublication": {
"id": "proceedings/wsc/1988/42/0",
"title": "1988 Winter Simulation Conference Proceedings",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sccc/2010/4400/0/4400a252",
"title": "Generic Face Animation",
"doi": null,
"abstractUrl": "/proceedings-article/sccc/2010/4400a252/12OmNBhpS0Y",
"parentPublication": {
"id": "proceedings/sccc/2010/4400/0",
"title": "2010 XXIX International Conference of the Chilean Computer Science Society",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ca/1994/6240/0/00323995",
"title": "Integrating a scripting language into an interactive animation system",
"doi": null,
"abstractUrl": "/proceedings-article/ca/1994/00323995/12OmNButq8k",
"parentPublication": {
"id": "proceedings/ca/1994/6240/0",
"title": "Proceedings of Computer Animation '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2000/0878/0/08780357",
"title": "Planning Computer Modeled Animation: Towards an Animation Machine",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2000/08780357/12OmNrIrPfs",
"parentPublication": {
"id": "proceedings/sibgrapi/2000/0878/0",
"title": "Proceedings 13th Brazilian Symposium on Computer Graphics and Image Processing (Cat. No.PR00878)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccl/1990/2036/0/00063755",
"title": "A practical animation language for software development",
"doi": null,
"abstractUrl": "/proceedings-article/iccl/1990/00063755/12OmNx38vOY",
"parentPublication": {
"id": "proceedings/iccl/1990/2036/0",
"title": "Proceedings. 1990 International Conference on Computer Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2015/7644/0/7644a797",
"title": "Research on Vertex Deformation Algorithms of Character Animation Model",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2015/7644a797/12OmNx76TT1",
"parentPublication": {
"id": "proceedings/icicta/2015/7644/0",
"title": "2015 8th International Conference on Intelligent Computation Technology and Automation (ICICTA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2015/9393/0/9393a931",
"title": "Vertex Deformation Algorithm of Skeleton Animation Based on Programmable GPU",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2015/9393a931/12OmNxzMnWQ",
"parentPublication": {
"id": "proceedings/isdea/2015/9393/0",
"title": "2015 Sixth International Conference on Intelligent Systems Design and Engineering Applications (ISDEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2015/9403/0/9403a379",
"title": "Towards Crowd-Sourced Parameter Optimisation for Procedural Animation",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2015/9403a379/12OmNy68EOG",
"parentPublication": {
"id": "proceedings/cw/2015/9403/0",
"title": "2015 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1985/07/mcg1985070076",
"title": "An Indexed Bibliography on Computer Animation",
"doi": null,
"abstractUrl": "/magazine/cg/1985/07/mcg1985070076/13rRUwbs250",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2010/04/mcg2010040051",
"title": "Modeling Short-Term Dynamics and Variability for Realistic Interactive Facial Animation",
"doi": null,
"abstractUrl": "/magazine/cg/2010/04/mcg2010040051/13rRUwgQpwW",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013122546",
"articleId": "13rRUIJuxpz",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013122566",
"articleId": "13rRUIIVlkh",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFt9",
"name": "ttg2013122556s.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013122556s.mov",
"extension": "mov",
"size": "35.3 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvDI3Io",
"title": "March",
"year": "1993",
"issueNum": "03",
"idPrefix": "tp",
"pubType": "journal",
"volume": "15",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgarkl",
"doi": "10.1109/34.204907",
"abstract": "The formalism of Bayesian networks provides a very elegant solution, in a probabilistic framework, to the problem of integrating top-down and bottom-up visual processes, as well serving as a knowledge base. The formalism is modified to handle spatial data, and thus the application of Bayesian networks is extended to visual processing. The modified form is called the perceptual inference network (PIN). The theoretical background of a PIN is presented, and its viability is demonstrated in the context of perceptual organization. Perceptual organization imparts robustness, efficiency, and a qualitative and holistic nature to vision. Thus far, the approaches to the problem of perceptual organization have been purely bottom up, without much top-down knowledge-base influence, and are therefore entirely dependent on the inputs, which are obviously imperfect. The knowledge base, besides coping with such input imperfection, also makes it possible to integrate multiple organizations and form a composite organization hypothesis. The PIN imparts an active inferential and integrating nature to perceptual organization in an elegant probabilistic framework.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The formalism of Bayesian networks provides a very elegant solution, in a probabilistic framework, to the problem of integrating top-down and bottom-up visual processes, as well serving as a knowledge base. The formalism is modified to handle spatial data, and thus the application of Bayesian networks is extended to visual processing. The modified form is called the perceptual inference network (PIN). The theoretical background of a PIN is presented, and its viability is demonstrated in the context of perceptual organization. Perceptual organization imparts robustness, efficiency, and a qualitative and holistic nature to vision. Thus far, the approaches to the problem of perceptual organization have been purely bottom up, without much top-down knowledge-base influence, and are therefore entirely dependent on the inputs, which are obviously imperfect. The knowledge base, besides coping with such input imperfection, also makes it possible to integrate multiple organizations and form a composite organization hypothesis. The PIN imparts an active inferential and integrating nature to perceptual organization in an elegant probabilistic framework.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The formalism of Bayesian networks provides a very elegant solution, in a probabilistic framework, to the problem of integrating top-down and bottom-up visual processes, as well serving as a knowledge base. The formalism is modified to handle spatial data, and thus the application of Bayesian networks is extended to visual processing. The modified form is called the perceptual inference network (PIN). The theoretical background of a PIN is presented, and its viability is demonstrated in the context of perceptual organization. Perceptual organization imparts robustness, efficiency, and a qualitative and holistic nature to vision. Thus far, the approaches to the problem of perceptual organization have been purely bottom up, without much top-down knowledge-base influence, and are therefore entirely dependent on the inputs, which are obviously imperfect. The knowledge base, besides coping with such input imperfection, also makes it possible to integrate multiple organizations and form a composite organization hypothesis. The PIN imparts an active inferential and integrating nature to perceptual organization in an elegant probabilistic framework.",
"title": "Integration, Inference, and Management of Spatial Information Using Bayesian Networks: Perceptual Organization",
"normalizedTitle": "Integration, Inference, and Management of Spatial Information Using Bayesian Networks: Perceptual Organization",
"fno": "i0256",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Top Down Visual Processes Image Recognition Spatial Inference Computer Vision Bayesian Networks Perceptual Organization Bottom Up Visual Processes Knowledge Base Perceptual Inference Network Bayes Methods Computer Vision Image Recognition Knowledge Based Systems Probability Spatial Reasoning"
],
"authors": [
{
"givenName": "S.",
"surname": "Sarkar",
"fullName": "S. Sarkar",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "K.L.",
"surname": "Boyer",
"fullName": "K.L. Boyer",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "1993-03-01 00:00:00",
"pubType": "trans",
"pages": "256-274",
"year": "1993",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0246",
"articleId": "13rRUwkxc6n",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0275",
"articleId": "13rRUwdIOVG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyeWdCY",
"title": "June",
"year": "2003",
"issueNum": "06",
"idPrefix": "tp",
"pubType": "journal",
"volume": "25",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwI5TS6",
"doi": "10.1109/TPAMI.2003.1201817",
"abstract": "Abstract—In recent years, one of the effective engines for perceptual organization of low-level image features is based on the partitioning of a graph representation that captures Gestalt inspired local structures, such as similarity, proximity, continuity, parallelism, and perpendicularity, over the low-level image features. Mainly motivated by computational efficiency considerations, this graph partitioning process is usually implemented as a recursive bipartitioning process, where, at each step, the graph is broken into two parts based on a partitioning measure. We concentrate on three such measures, namely, the minimum, average, and normalized cuts. The minimum cut partition seeks to minimize the total link weights cut. The average cut measure is proportional to the total link weight cut, normalized by the sizes of the partitions. The normalized cut measure is normalized by the product of the total connectivity (valencies) of the nodes in each partition. We provide theoretical and empirical insight into the nature of the three partitioning measures in terms of the underlying image statistics. In particular, we consider for what kinds of image statistics would optimizing a measure, irrespective of the particular algorithm used, result in correct partitioning. Are the quality of the groups significantly different for each cut measure? Are there classes of images for which grouping by partitioning does not work well? Another question of interest is if the recursive bipartitioning strategy can separate out groups corresponding to K objects from each other. In the analysis, we draw from probability theory and the rich body of work on stochastic ordering of random variables. Our major conclusion is that optimization of none of the three measures is guaranteed to result in the correct partitioning of K objects, in the strict stochastic order sense, for all image statistics. Qualitatively speaking, under very restrictive conditions, when the average interobject feature affinity is very weak when compared to the average intraobject feature affinity, the minimum cut measure is optimal. The average cut measure is optimal for graphs whose partition width is less than the mode of distribution of all possible partition widths. The normalized cut measure is optimal for a more restrictive subclass of graphs whose partition width is less than the mode of the partition width distributions and the strength of interobject links is six times less than the intraobject links. Rigorous empirical evaluation on 50 real images indicates that, in practice, the quality of the groups generated using minimum or average or normalized cuts are statistically equivalent for object recognition, i.e., the best, the mean, and the variation of the qualities are statistically equivalent. We also find that, for certain image classes, such as aerial and scenes with man-made objects, in man-made surroundings, the performance of grouping by partitioning is the worst, irrespective of the cut measure.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—In recent years, one of the effective engines for perceptual organization of low-level image features is based on the partitioning of a graph representation that captures Gestalt inspired local structures, such as similarity, proximity, continuity, parallelism, and perpendicularity, over the low-level image features. Mainly motivated by computational efficiency considerations, this graph partitioning process is usually implemented as a recursive bipartitioning process, where, at each step, the graph is broken into two parts based on a partitioning measure. We concentrate on three such measures, namely, the minimum, average, and normalized cuts. The minimum cut partition seeks to minimize the total link weights cut. The average cut measure is proportional to the total link weight cut, normalized by the sizes of the partitions. The normalized cut measure is normalized by the product of the total connectivity (valencies) of the nodes in each partition. We provide theoretical and empirical insight into the nature of the three partitioning measures in terms of the underlying image statistics. In particular, we consider for what kinds of image statistics would optimizing a measure, irrespective of the particular algorithm used, result in correct partitioning. Are the quality of the groups significantly different for each cut measure? Are there classes of images for which grouping by partitioning does not work well? Another question of interest is if the recursive bipartitioning strategy can separate out groups corresponding to K objects from each other. In the analysis, we draw from probability theory and the rich body of work on stochastic ordering of random variables. Our major conclusion is that optimization of none of the three measures is guaranteed to result in the correct partitioning of K objects, in the strict stochastic order sense, for all image statistics. Qualitatively speaking, under very restrictive conditions, when the average interobject feature affinity is very weak when compared to the average intraobject feature affinity, the minimum cut measure is optimal. The average cut measure is optimal for graphs whose partition width is less than the mode of distribution of all possible partition widths. The normalized cut measure is optimal for a more restrictive subclass of graphs whose partition width is less than the mode of the partition width distributions and the strength of interobject links is six times less than the intraobject links. Rigorous empirical evaluation on 50 real images indicates that, in practice, the quality of the groups generated using minimum or average or normalized cuts are statistically equivalent for object recognition, i.e., the best, the mean, and the variation of the qualities are statistically equivalent. We also find that, for certain image classes, such as aerial and scenes with man-made objects, in man-made surroundings, the performance of grouping by partitioning is the worst, irrespective of the cut measure.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—In recent years, one of the effective engines for perceptual organization of low-level image features is based on the partitioning of a graph representation that captures Gestalt inspired local structures, such as similarity, proximity, continuity, parallelism, and perpendicularity, over the low-level image features. Mainly motivated by computational efficiency considerations, this graph partitioning process is usually implemented as a recursive bipartitioning process, where, at each step, the graph is broken into two parts based on a partitioning measure. We concentrate on three such measures, namely, the minimum, average, and normalized cuts. The minimum cut partition seeks to minimize the total link weights cut. The average cut measure is proportional to the total link weight cut, normalized by the sizes of the partitions. The normalized cut measure is normalized by the product of the total connectivity (valencies) of the nodes in each partition. We provide theoretical and empirical insight into the nature of the three partitioning measures in terms of the underlying image statistics. In particular, we consider for what kinds of image statistics would optimizing a measure, irrespective of the particular algorithm used, result in correct partitioning. Are the quality of the groups significantly different for each cut measure? Are there classes of images for which grouping by partitioning does not work well? Another question of interest is if the recursive bipartitioning strategy can separate out groups corresponding to K objects from each other. In the analysis, we draw from probability theory and the rich body of work on stochastic ordering of random variables. Our major conclusion is that optimization of none of the three measures is guaranteed to result in the correct partitioning of K objects, in the strict stochastic order sense, for all image statistics. Qualitatively speaking, under very restrictive conditions, when the average interobject feature affinity is very weak when compared to the average intraobject feature affinity, the minimum cut measure is optimal. The average cut measure is optimal for graphs whose partition width is less than the mode of distribution of all possible partition widths. The normalized cut measure is optimal for a more restrictive subclass of graphs whose partition width is less than the mode of the partition width distributions and the strength of interobject links is six times less than the intraobject links. Rigorous empirical evaluation on 50 real images indicates that, in practice, the quality of the groups generated using minimum or average or normalized cuts are statistically equivalent for object recognition, i.e., the best, the mean, and the variation of the qualities are statistically equivalent. We also find that, for certain image classes, such as aerial and scenes with man-made objects, in man-made surroundings, the performance of grouping by partitioning is the worst, irrespective of the cut measure.",
"title": "An In-Depth Study of Graph Partitioning Measures for Perceptual Organization",
"normalizedTitle": "An In-Depth Study of Graph Partitioning Measures for Perceptual Organization",
"fno": "i0642",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Perceptual Organization",
"Grouping",
"Graph Partitioning",
"Stochastic Orders",
"Empirical Evaluation"
],
"authors": [
{
"givenName": "Padmanabhan",
"surname": "Soundararajan",
"fullName": "Padmanabhan Soundararajan",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sudeep",
"surname": "Sarkar",
"fullName": "Sudeep Sarkar",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2003-06-01 00:00:00",
"pubType": "trans",
"pages": "642-660",
"year": "2003",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0641",
"articleId": "13rRUwwsltJ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0661",
"articleId": "13rRUxly8U3",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCxL9Vf",
"title": "April",
"year": "1991",
"issueNum": "04",
"idPrefix": "tp",
"pubType": "journal",
"volume": "13",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvzi",
"doi": "10.1109/34.88567",
"abstract": "Due to the potential for essentially unbounded scene complexity, it is often necessary to translate the sensor-derived signals into richer symbolic representations. A key initial stage in this abstraction process is signal-level perceptual organization (SLPO) involving the processes of partitioning and identification. A parallel SLPO algorithm that follows the global hypothesis testing paradigm, but breaks the iterative structure of conventional region growing through the use of alpha -partitioning and region filtering is presented. These two techniques segment an image such that the gray-level variation within each region can be described by a regression model. Experimental results demonstrate the effectiveness of this algorithm.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Due to the potential for essentially unbounded scene complexity, it is often necessary to translate the sensor-derived signals into richer symbolic representations. A key initial stage in this abstraction process is signal-level perceptual organization (SLPO) involving the processes of partitioning and identification. A parallel SLPO algorithm that follows the global hypothesis testing paradigm, but breaks the iterative structure of conventional region growing through the use of alpha -partitioning and region filtering is presented. These two techniques segment an image such that the gray-level variation within each region can be described by a regression model. Experimental results demonstrate the effectiveness of this algorithm.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Due to the potential for essentially unbounded scene complexity, it is often necessary to translate the sensor-derived signals into richer symbolic representations. A key initial stage in this abstraction process is signal-level perceptual organization (SLPO) involving the processes of partitioning and identification. A parallel SLPO algorithm that follows the global hypothesis testing paradigm, but breaks the iterative structure of conventional region growing through the use of alpha -partitioning and region filtering is presented. These two techniques segment an image such that the gray-level variation within each region can be described by a regression model. Experimental results demonstrate the effectiveness of this algorithm.",
"title": "A Parallel Technique for Signal-Level Perceptual Organization",
"normalizedTitle": "A Parallel Technique for Signal-Level Perceptual Organization",
"fno": "i0317",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Scene Interpretation Parallel Algorithm Image Segmentation Signal Level Perceptual Organization Symbolic Representations Abstraction Process Filtering Gray Level Filtering And Prediction Theory Knowledge Representation Parallel Algorithms Pattern Recognition Picture Processing"
],
"authors": [
{
"givenName": "S.P.",
"surname": "Liou",
"fullName": "S.P. Liou",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "A.H.",
"surname": "Chiu",
"fullName": "A.H. Chiu",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "R.C.",
"surname": "Jain",
"fullName": "R.C. Jain",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "1991-04-01 00:00:00",
"pubType": "trans",
"pages": "317-325",
"year": "1991",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0307",
"articleId": "13rRUILtJrU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0326",
"articleId": "13rRUwI5U8L",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxA3Z0h",
"title": "May",
"year": "2000",
"issueNum": "05",
"idPrefix": "tp",
"pubType": "journal",
"volume": "22",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuct",
"doi": "10.1109/34.857006",
"abstract": "Abstract—Perceptual organization offers an elegant framework to group low-level features that are likely to come from a single object. We offer a novel strategy to adapt this grouping process to objects in a domain. Given a set of training images of objects in context, the associated learning process decides on the relative importance of the basic salient relationships such as proximity, parallelness, continuity, junctions, and common region toward segregating the objects from the background. The parameters of the grouping process are cast as probabilistic specifications of Bayesian networks that need to be learned. This learning is accomplished using a team of stochastic automata in an N-player cooperative game framework. The grouping process, which is based on graph partitioning is, able to form large groups from relationships defined over a small set of primitives and is fast. We statistically demonstrate the robust performance of the grouping and the learning frameworks on a variety of real images. Among the interesting conclusions are the significant role of photometric attributes in grouping and the ability to form large salient groups from a set of local relations, each defined over a small number of primitives.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Perceptual organization offers an elegant framework to group low-level features that are likely to come from a single object. We offer a novel strategy to adapt this grouping process to objects in a domain. Given a set of training images of objects in context, the associated learning process decides on the relative importance of the basic salient relationships such as proximity, parallelness, continuity, junctions, and common region toward segregating the objects from the background. The parameters of the grouping process are cast as probabilistic specifications of Bayesian networks that need to be learned. This learning is accomplished using a team of stochastic automata in an N-player cooperative game framework. The grouping process, which is based on graph partitioning is, able to form large groups from relationships defined over a small set of primitives and is fast. We statistically demonstrate the robust performance of the grouping and the learning frameworks on a variety of real images. Among the interesting conclusions are the significant role of photometric attributes in grouping and the ability to form large salient groups from a set of local relations, each defined over a small number of primitives.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Perceptual organization offers an elegant framework to group low-level features that are likely to come from a single object. We offer a novel strategy to adapt this grouping process to objects in a domain. Given a set of training images of objects in context, the associated learning process decides on the relative importance of the basic salient relationships such as proximity, parallelness, continuity, junctions, and common region toward segregating the objects from the background. The parameters of the grouping process are cast as probabilistic specifications of Bayesian networks that need to be learned. This learning is accomplished using a team of stochastic automata in an N-player cooperative game framework. The grouping process, which is based on graph partitioning is, able to form large groups from relationships defined over a small set of primitives and is fast. We statistically demonstrate the robust performance of the grouping and the learning frameworks on a variety of real images. Among the interesting conclusions are the significant role of photometric attributes in grouping and the ability to form large salient groups from a set of local relations, each defined over a small number of primitives.",
"title": "Supervised Learning of Large Perceptual Organization: Graph Spectral Partitioning and Learning Automata",
"normalizedTitle": "Supervised Learning of Large Perceptual Organization: Graph Spectral Partitioning and Learning Automata",
"fno": "i0504",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Perceptual Organization",
"Learning In Vision",
"Learning Automata",
"Bayesian Networks",
"Feature Grouping",
"Object Recognition",
"Figure Ground Segmentation"
],
"authors": [
{
"givenName": "Sudeep",
"surname": "Sarkar",
"fullName": "Sudeep Sarkar",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Padmanabhan",
"surname": "Soundararajan",
"fullName": "Padmanabhan Soundararajan",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2000-05-01 00:00:00",
"pubType": "trans",
"pages": "504-525",
"year": "2000",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0491",
"articleId": "13rRUILtJAE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0526",
"articleId": "13rRUxBa5sL",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyRg4kV",
"title": "November",
"year": "1989",
"issueNum": "11",
"idPrefix": "tp",
"pubType": "journal",
"volume": "11",
"label": "November",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxbTMzU",
"doi": "10.1109/34.42852",
"abstract": "The authors describe an approach to perceptual grouping for detecting and describing 3-D objects in complex images and apply it to the task of detecting and describing complex buildings in aerial images. They argue that representations of structural relationships in the arrangements of primitive image features, as detected by the perceptual organization process, are essential for analyzing complex imagery. They term these representations collated features. The choice of collated features is determined by the generic shape of the desired objects in the scene. The detection process for collated features is more robust than the local operations for region segmentation and contour tracing. The important structural information encoded in collated features aids various visual tasks such as object segmentation, correspondence processes, and shape description. The proposed method initially detects all reasonable feature groupings. A constraint satisfaction network is then used to model the complex interactions between the collations and select the promising ones. Stereo matching is performed on the collations to obtain height information. This aids in further reasoning on the collated features and results in the 3-D description of the desired objects.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The authors describe an approach to perceptual grouping for detecting and describing 3-D objects in complex images and apply it to the task of detecting and describing complex buildings in aerial images. They argue that representations of structural relationships in the arrangements of primitive image features, as detected by the perceptual organization process, are essential for analyzing complex imagery. They term these representations collated features. The choice of collated features is determined by the generic shape of the desired objects in the scene. The detection process for collated features is more robust than the local operations for region segmentation and contour tracing. The important structural information encoded in collated features aids various visual tasks such as object segmentation, correspondence processes, and shape description. The proposed method initially detects all reasonable feature groupings. A constraint satisfaction network is then used to model the complex interactions between the collations and select the promising ones. Stereo matching is performed on the collations to obtain height information. This aids in further reasoning on the collated features and results in the 3-D description of the desired objects.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The authors describe an approach to perceptual grouping for detecting and describing 3-D objects in complex images and apply it to the task of detecting and describing complex buildings in aerial images. They argue that representations of structural relationships in the arrangements of primitive image features, as detected by the perceptual organization process, are essential for analyzing complex imagery. They term these representations collated features. The choice of collated features is determined by the generic shape of the desired objects in the scene. The detection process for collated features is more robust than the local operations for region segmentation and contour tracing. The important structural information encoded in collated features aids various visual tasks such as object segmentation, correspondence processes, and shape description. The proposed method initially detects all reasonable feature groupings. A constraint satisfaction network is then used to model the complex interactions between the collations and select the promising ones. Stereo matching is performed on the collations to obtain height information. This aids in further reasoning on the collated features and results in the 3-D description of the desired objects.",
"title": "Using Perceptual Organization to Extract 3D Structures",
"normalizedTitle": "Using Perceptual Organization to Extract 3D Structures",
"fno": "i1121",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"3 D Structure Extraction Computerised Picture Processing Computerised Pattern Recognition Perceptual Organization Complex Images Aerial Images Collated Features Segmentation Contour Tracing Correspondence Processes Shape Description Feature Groupings Computerised Pattern Recognition Computerised Picture Processing"
],
"authors": [
{
"givenName": "R.",
"surname": "Mohan",
"fullName": "R. Mohan",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "R.",
"surname": "Nevatia",
"fullName": "R. Nevatia",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "1989-11-01 00:00:00",
"pubType": "trans",
"pages": "1121-1139",
"year": "1989",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "i1140",
"articleId": "13rRUwvBy9H",
"__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": "13rRUwcS1CU",
"doi": "10.1109/TVCG.2012.254",
"abstract": "Contingency tables summarize the relations between categorical variables and arise in both scientific and business domains. Asymmetrically large two-way contingency tables pose a problem for common visualization methods. The Contingency Wheel has been recently proposed as an interactive visual method to explore and analyze such tables. However, the scalability and readability of this method are limited when dealing with large and dense tables. In this paper we present Contingency Wheel++, new visual analytics methods that overcome these major shortcomings: (1) regarding automated methods, a measure of association based on Pearson's residuals alleviates the bias of the raw residuals originally used, (2) regarding visualization methods, a frequency-based abstraction of the visual elements eliminates overlapping and makes analyzing both positive and negative associations possible, and (3) regarding the interactive exploration environment, a multi-level overview+detail interface enables exploring individual data items that are aggregated in the visualization or in the table using coordinated views. We illustrate the applicability of these new methods with a use case and show how they enable discovering and analyzing nontrivial patterns and associations in large categorical data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Contingency tables summarize the relations between categorical variables and arise in both scientific and business domains. Asymmetrically large two-way contingency tables pose a problem for common visualization methods. The Contingency Wheel has been recently proposed as an interactive visual method to explore and analyze such tables. However, the scalability and readability of this method are limited when dealing with large and dense tables. In this paper we present Contingency Wheel++, new visual analytics methods that overcome these major shortcomings: (1) regarding automated methods, a measure of association based on Pearson's residuals alleviates the bias of the raw residuals originally used, (2) regarding visualization methods, a frequency-based abstraction of the visual elements eliminates overlapping and makes analyzing both positive and negative associations possible, and (3) regarding the interactive exploration environment, a multi-level overview+detail interface enables exploring individual data items that are aggregated in the visualization or in the table using coordinated views. We illustrate the applicability of these new methods with a use case and show how they enable discovering and analyzing nontrivial patterns and associations in large categorical data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Contingency tables summarize the relations between categorical variables and arise in both scientific and business domains. Asymmetrically large two-way contingency tables pose a problem for common visualization methods. The Contingency Wheel has been recently proposed as an interactive visual method to explore and analyze such tables. However, the scalability and readability of this method are limited when dealing with large and dense tables. In this paper we present Contingency Wheel++, new visual analytics methods that overcome these major shortcomings: (1) regarding automated methods, a measure of association based on Pearson's residuals alleviates the bias of the raw residuals originally used, (2) regarding visualization methods, a frequency-based abstraction of the visual elements eliminates overlapping and makes analyzing both positive and negative associations possible, and (3) regarding the interactive exploration environment, a multi-level overview+detail interface enables exploring individual data items that are aggregated in the visualization or in the table using coordinated views. We illustrate the applicability of these new methods with a use case and show how they enable discovering and analyzing nontrivial patterns and associations in large categorical data.",
"title": "Reinventing the Contingency Wheel: Scalable Visual Analytics of Large Categorical Data",
"normalizedTitle": "Reinventing the Contingency Wheel: Scalable Visual Analytics of Large Categorical Data",
"fno": "ttg2012122849",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Contingency Wheel",
"Scalable Visual Analytics",
"Large Categorical Data",
"Business Domains",
"Scientific Domains",
"Two Way Contingency Tables",
"Visualization Methods",
"Automated Methods",
"Pearson Residuals",
"Frequency Based Abstraction",
"Visual Elements",
"Positive Associations",
"Negative Associations",
"Interactive Exploration Environment",
"Multilevel Overview Detail Interface",
"Coordinated Views",
"Nontrivial Patterns",
"Motion Pictures",
"Histograms",
"Frequency Measurement",
"Visual Analytics",
"Data Visualization",
"Visual Analytics",
"Large Categorical Data",
"Contingency Table Analysis",
"Information Interfaces And Representation"
],
"authors": [
{
"givenName": "B.",
"surname": "Alsallakh",
"fullName": "B. Alsallakh",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "W.",
"surname": "Aigner",
"fullName": "W. Aigner",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "S.",
"surname": "Miksch",
"fullName": "S. Miksch",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "M. E.",
"surname": "Groller",
"fullName": "M. E. Groller",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2849-2858",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/eisic/2017/2385/0/2385a151",
"title": "A Framework for Measuring Imagination in Visual Analytics Systems",
"doi": null,
"abstractUrl": "/proceedings-article/eisic/2017/2385a151/12OmNAJVcGb",
"parentPublication": {
"id": "proceedings/eisic/2017/2385/0",
"title": "2017 European Intelligence and Security Informatics Conference (EISIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/grc/2012/2310/0/06468603",
"title": "Degree of freedom and numbers of subdeterminants in contingency table",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2012/06468603/12OmNzVoBt9",
"parentPublication": {
"id": "proceedings/grc/2012/2310/0",
"title": "2012 IEEE International Conference on Granular Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/10/07346501",
"title": "PeakVizor: Visual Analytics of Peaks in Video Clickstreams from Massive Open Online Courses",
"doi": null,
"abstractUrl": "/journal/tg/2016/10/07346501/13rRUILtJme",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07534792",
"title": "A Visual Analytics Approach for Categorical Joint Distribution Reconstruction from Marginal Projections",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07534792/13rRUxDIthg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2018/04/mcg2018040084",
"title": "Visual Analytics for Explainable Deep Learning",
"doi": null,
"abstractUrl": "/magazine/cg/2018/04/mcg2018040084/13rRUy3gn2N",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2014/01/mcg2014010042",
"title": "Visual Analytics for Power Grid Contingency Analysis",
"doi": null,
"abstractUrl": "/magazine/cg/2014/01/mcg2014010042/13rRUyg2jNr",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iisa/2022/6390/0/09904353",
"title": "An Advanced Visualisation Engine with Role-Based Access Control for Building Energy Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/iisa/2022/09904353/1H5KAaU5UBi",
"parentPublication": {
"id": "proceedings/iisa/2022/6390/0",
"title": "2022 13th International Conference on Information, Intelligence, Systems & Applications (IISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2020/6677/0/667700a442",
"title": "MAP: A Visual Analytics System for Job Monitoring and Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2020/667700a442/1oqKDv5CbAs",
"parentPublication": {
"id": "proceedings/cluster/2020/6677/0",
"title": "2020 IEEE International Conference on Cluster Computing (CLUSTER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispass/2021/8643/0/864300a073",
"title": "ViStA: Video Streaming and Analytics Benchmark",
"doi": null,
"abstractUrl": "/proceedings-article/ispass/2021/864300a073/1taFjsp7HKo",
"parentPublication": {
"id": "proceedings/ispass/2021/8643/0",
"title": "2021 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2021/3827/0/382700a054",
"title": "VisuaLeague: Visual Analytics of Multiple Games",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2021/382700a054/1y4oI1vKfmg",
"parentPublication": {
"id": "proceedings/iv/2021/3827/0",
"title": "2021 25th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012122839",
"articleId": "13rRUB6Sq0z",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122859",
"articleId": "13rRUx0Pqpw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgG0",
"name": "ttg2012122849s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012122849s1.mp4",
"extension": "mp4",
"size": "27.4 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvGPE8h",
"title": "March-April",
"year": "2012",
"issueNum": "02",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "14",
"label": "March-April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwj7cnz",
"doi": "10.1109/MCSE.2012.27",
"abstract": "The interactive visual exploration of large and complex simulation datasets has become an important methodology that improves data analysis for scientists and professional practitioners.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The interactive visual exploration of large and complex simulation datasets has become an important methodology that improves data analysis for scientists and professional practitioners.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The interactive visual exploration of large and complex simulation datasets has become an important methodology that improves data analysis for scientists and professional practitioners.",
"title": "Interactive Visual Exploration and Analysis of Multivariate Simulation Data",
"normalizedTitle": "Interactive Visual Exploration and Analysis of Multivariate Simulation Data",
"fno": "mcs2012020070",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Interactive Visualization",
"Visual Computing",
"Scientific Computing"
],
"authors": [
{
"givenName": "Helmut",
"surname": "Doleisch",
"fullName": "Helmut Doleisch",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Helwig",
"surname": "Hauser",
"fullName": "Helwig Hauser",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2012-03-01 00:00:00",
"pubType": "mags",
"pages": "70-77",
"year": "2012",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/1999/0001/6/00016008",
"title": "Discovering System Insights using Visual Interactive Meta-Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1999/00016008/12OmNAkWvvK",
"parentPublication": {
"id": "proceedings/hicss/1999/0001/6",
"title": "Proceedings of the 32nd Annual Hawaii International Conference on Systems Sciences. 1999. HICSS-32. Abstracts and CD-ROM of Full Papers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ism/2008/3454/0/3454a460",
"title": "An Interactive, 3D Visual Exploration Tool for Undirected Relationships",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2008/3454a460/12OmNx5YvcI",
"parentPublication": {
"id": "proceedings/ism/2008/3454/0",
"title": "2008 Tenth IEEE International Symposium on Multimedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sccompanion/2012/4956/0/4956a196",
"title": "Scalable Visual Queries for Data Exploration on Large, High-Resolution 3D Displays",
"doi": null,
"abstractUrl": "/proceedings-article/sccompanion/2012/4956a196/12OmNykTNoq",
"parentPublication": {
"id": "proceedings/sccompanion/2012/4956/0",
"title": "2012 SC Companion: High Performance Computing, Networking Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061407",
"title": "Visual Exploration of Nasal Airflow",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061407/13rRUIJcWlj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061340",
"title": "Interactive Visual Analysis of Set-Typed Data",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061340/13rRUIM2VGX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009060945",
"title": "ActiviTree: Interactive Visual Exploration of Sequences in Event-Based Data Using Graph Similarity",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009060945/13rRUxC0SEc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122899",
"title": "A Visual Analytics Approach to Multiscale Exploration of Environmental Time Series",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122899/13rRUxDqS8g",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2013/02/mcg2013020016",
"title": "Data Visualization on Interactive Surfaces: A Research Agenda",
"doi": null,
"abstractUrl": "/magazine/cg/2013/02/mcg2013020016/13rRUxNmPLg",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06876022",
"title": "The Effects of Interactive Latency on Exploratory Visual Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06876022/13rRUxYINfd",
"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"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcs2012020046",
"articleId": "13rRUxCitDc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcs2012020078",
"articleId": "13rRUx0xPAi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwGqBpX",
"title": "June",
"year": "1987",
"issueNum": "06",
"idPrefix": "tp",
"pubType": "journal",
"volume": "9",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILtJmU",
"doi": "10.1109/TPAMI.1987.4767986",
"abstract": "The difficulties in analyzing and clustering (synthesizing) multivariate data of the mixed type (discrete and continuous) are largely due to: 1) nonuniform scaling in different coordinates, 2) the lack of order in nominal data, and 3) the lack of a suitable similarity measure. This paper presents a new approach which bypasses these difficulties and can acquire statistical knowledge from incomplete mixed-mode data. The proposed method adopts an event-covering approach which covers a subset of statistically relevant outcomes in the outcome space of variable-pairs. And once the covered event patterns are acquired, subsequent analysis tasks such as probabilistic inference, cluster analysis, and detection of event patterns for each cluster based on the incomplete probability scheme can be performed. There are four phases in our method: 1) the discretization of the continuous components based on a maximum entropy criterion so that the data can be treated as n-tuples of discrete-valued features; 2) the estimation of the missing values using our newly developed inference procedure; 3) the initial formation of clusters by analyzing the nearest-neighbor distance on subsets of selected samples; and 4) the reclassification of the n-tuples into more reliable clusters based on the detected interdependence relationships. For performance evaluation, experiments have been conducted using both simulated and real life data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The difficulties in analyzing and clustering (synthesizing) multivariate data of the mixed type (discrete and continuous) are largely due to: 1) nonuniform scaling in different coordinates, 2) the lack of order in nominal data, and 3) the lack of a suitable similarity measure. This paper presents a new approach which bypasses these difficulties and can acquire statistical knowledge from incomplete mixed-mode data. The proposed method adopts an event-covering approach which covers a subset of statistically relevant outcomes in the outcome space of variable-pairs. And once the covered event patterns are acquired, subsequent analysis tasks such as probabilistic inference, cluster analysis, and detection of event patterns for each cluster based on the incomplete probability scheme can be performed. There are four phases in our method: 1) the discretization of the continuous components based on a maximum entropy criterion so that the data can be treated as n-tuples of discrete-valued features; 2) the estimation of the missing values using our newly developed inference procedure; 3) the initial formation of clusters by analyzing the nearest-neighbor distance on subsets of selected samples; and 4) the reclassification of the n-tuples into more reliable clusters based on the detected interdependence relationships. For performance evaluation, experiments have been conducted using both simulated and real life data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The difficulties in analyzing and clustering (synthesizing) multivariate data of the mixed type (discrete and continuous) are largely due to: 1) nonuniform scaling in different coordinates, 2) the lack of order in nominal data, and 3) the lack of a suitable similarity measure. This paper presents a new approach which bypasses these difficulties and can acquire statistical knowledge from incomplete mixed-mode data. The proposed method adopts an event-covering approach which covers a subset of statistically relevant outcomes in the outcome space of variable-pairs. And once the covered event patterns are acquired, subsequent analysis tasks such as probabilistic inference, cluster analysis, and detection of event patterns for each cluster based on the incomplete probability scheme can be performed. There are four phases in our method: 1) the discretization of the continuous components based on a maximum entropy criterion so that the data can be treated as n-tuples of discrete-valued features; 2) the estimation of the missing values using our newly developed inference procedure; 3) the initial formation of clusters by analyzing the nearest-neighbor distance on subsets of selected samples; and 4) the reclassification of the n-tuples into more reliable clusters based on the detected interdependence relationships. For performance evaluation, experiments have been conducted using both simulated and real life data.",
"title": "Synthesizing Statistical Knowledge from Incomplete Mixed-Mode Data",
"normalizedTitle": "Synthesizing Statistical Knowledge from Incomplete Mixed-Mode Data",
"fno": "04767986",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Pattern Analysis",
"Decision Making",
"Probability",
"Performance Analysis",
"Data Analysis",
"Spatial Databases",
"Coordinate Measuring Machines",
"Event Detection",
"Entropy",
"Phase Estimation",
"Statistical Knowledge",
"Cluster Analysis",
"Event Covering",
"Incomplete Probability Scheme",
"Mixed Mode Data",
"Probabilistic Inference"
],
"authors": [],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "1987-11-01 00:00:00",
"pubType": "trans",
"pages": "796-805",
"year": "1987",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icsem/2010/4223/2/4223b153",
"title": "Data Analysis in Incomplete Information Systems Based on Granular Computing",
"doi": null,
"abstractUrl": "/proceedings-article/icsem/2010/4223b153/12OmNAWpyrf",
"parentPublication": {
"id": "proceedings/icsem/2010/4223/2",
"title": "2010 International Conference on System Science, Engineering Design and Manufacturing Informatization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd/2008/3263/0/3263a105",
"title": "A New Classifier to Deal with Incomplete Data",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2008/3263a105/12OmNBhZ4he",
"parentPublication": {
"id": "proceedings/snpd/2008/3263/0",
"title": "2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsem/2010/4223/2/4223b147",
"title": "Knowledge Acquisition in Incomplete E-Commerce Information Systems",
"doi": null,
"abstractUrl": "/proceedings-article/icsem/2010/4223b147/12OmNButq7k",
"parentPublication": {
"id": "proceedings/icsem/2010/4223/2",
"title": "2010 International Conference on System Science, Engineering Design and Manufacturing Informatization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/grc/2012/2310/0/06468627",
"title": "Incomplete multigranulation decision rules acquisition",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2012/06468627/12OmNqJq4Es",
"parentPublication": {
"id": "proceedings/grc/2012/2310/0",
"title": "2012 IEEE International Conference on Granular Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2008/3508/2/3508b138",
"title": "Knowledge Reduction in Incomplete and Fuzzy Objective Information Systems",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2008/3508b138/12OmNvD8RDN",
"parentPublication": {
"id": "proceedings/cis/2008/3508/2",
"title": "2008 International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipps/1991/9167/0/00153770",
"title": "Fully normal algorithms for incomplete hypercubes",
"doi": null,
"abstractUrl": "/proceedings-article/ipps/1991/00153770/12OmNxWuif3",
"parentPublication": {
"id": "proceedings/ipps/1991/9167/0",
"title": "Parallel Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/spdp/1993/4222/0/0395517",
"title": "Analysis of link traffic in incomplete hypercubes",
"doi": null,
"abstractUrl": "/proceedings-article/spdp/1993/0395517/12OmNxxdZM0",
"parentPublication": {
"id": "proceedings/spdp/1993/4222/0",
"title": "Parallel and Distributed Processing, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eknow/2010/3956/0/3956a110",
"title": "Querying Incomplete Information Using Bag Relational Algebra",
"doi": null,
"abstractUrl": "/proceedings-article/eknow/2010/3956a110/12OmNy7yEgv",
"parentPublication": {
"id": "proceedings/eknow/2010/3956/0",
"title": "Information, Process, and Knowledge Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/1996/07/l0740",
"title": "Traffic Analysis and Simulation Performance of Incomplete Hypercubes",
"doi": null,
"abstractUrl": "/journal/td/1996/07/l0740/13rRUxjyX3o",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1985/07/01702066",
"title": "On the Use of an Extended Relational Model to Handle Changing Incomplete Information",
"doi": null,
"abstractUrl": "/journal/ts/1985/07/01702066/13rRUyfbwsf",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "04767977",
"articleId": "13rRUyY295w",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyRg49x",
"title": "May",
"year": "1969",
"issueNum": "05",
"idPrefix": "tc",
"pubType": "journal",
"volume": "18",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwI5U1h",
"doi": "10.1109/T-C.1969.222678",
"abstract": "An algorithm for the analysis of multivariate data is presented along with some experimental results. The algorithm is based upon a point mapping of N L-dimensional vectors from the L-space to a lower-dimensional space such that the inherent data \"structure\" is approximately preserved.",
"abstracts": [
{
"abstractType": "Regular",
"content": "An algorithm for the analysis of multivariate data is presented along with some experimental results. The algorithm is based upon a point mapping of N L-dimensional vectors from the L-space to a lower-dimensional space such that the inherent data \"structure\" is approximately preserved.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "An algorithm for the analysis of multivariate data is presented along with some experimental results. The algorithm is based upon a point mapping of N L-dimensional vectors from the L-space to a lower-dimensional space such that the inherent data \"structure\" is approximately preserved.",
"title": "A Nonlinear Mapping for Data Structure Analysis",
"normalizedTitle": "A Nonlinear Mapping for Data Structure Analysis",
"fno": "01671271",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Clustering",
"Dimensionality Reduction",
"Mappings",
"Multidimensional Scaling",
"Multivariate Data Analysis",
"Nonparametric",
"Pattern Recognition",
"Statistics"
],
"authors": [
{
"givenName": "J.W.",
"surname": "Sammon",
"fullName": "J.W. Sammon",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "1969-05-01 00:00:00",
"pubType": "trans",
"pages": "401-409",
"year": "1969",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wcse/2009/3570/2/3570b509",
"title": "The Biorthogonality Property of Vector-Valued Multivariate Wavelet Packets with M-scale",
"doi": null,
"abstractUrl": "/proceedings-article/wcse/2009/3570b509/12OmNAS9zF5",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmla/2008/3495/0/3495a388",
"title": "Mapping Uncharted Waters: Exploratory Analysis, Visualization, and Clustering of Oceanographic Data",
"doi": null,
"abstractUrl": "/proceedings-article/icmla/2008/3495a388/12OmNAio72I",
"parentPublication": {
"id": "proceedings/icmla/2008/3495/0",
"title": "2008 Seventh International Conference on Machine Learning and Applications",
"__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/cesce/2010/3972/1/3972a370",
"title": "The Characteristics of a Type of Biorthogonal Wavelet Packets with Eight-scale Factor in Higher Dimensions",
"doi": null,
"abstractUrl": "/proceedings-article/cesce/2010/3972a370/12OmNCbCs11",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2008/3304/5/3304e471",
"title": "Biorthogonality Property of Vector-Valued Multivariate Wavelet Packets",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2008/3304e471/12OmNCyTyoX",
"parentPublication": {
"id": "proceedings/icnc/2008/3304/5",
"title": "2008 Fourth International Conference on Natural Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iita/2009/3859/3/3859c636",
"title": "The Characterization of a Sort of Biorthogonal Multivariate Wavelet Packets According to an Integer-valued Dilation Matrix",
"doi": null,
"abstractUrl": "/proceedings-article/iita/2009/3859c636/12OmNwHz0aL",
"parentPublication": {
"id": "proceedings/iita/2009/3859/3",
"title": "2009 Third International Symposium on Intelligent Information Technology Application",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1973/10/01672211",
"title": "Representation of Nonlinear Data Surfaces",
"doi": null,
"abstractUrl": "/journal/tc/1973/10/01672211/13rRUNvyajh",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1974/09/01672644",
"title": "A Projection Pursuit Algorithm for Exploratory Data Analysis",
"doi": null,
"abstractUrl": "/journal/tc/1974/09/01672644/13rRUxOdDbw",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__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/2010/06/ttg2010061281",
"title": "Two-Phase Mapping for Projecting Massive Data Sets",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061281/13rRUynHuj5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "01671270",
"articleId": "13rRUxOdD6V",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01671274",
"articleId": "13rRUwIF67K",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"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": "1GNpaBpcJA4",
"doi": "10.1109/TKDE.2022.3207486",
"abstract": "Online service providers benefit from collecting and analyzing preference data from users, including both implicit preference data (e.g., watched videos of a user) and explicit preference data (e.g., ranking data over candidates). However, it brings ethical and legal issues of data privacy at the same time. In this paper, we study the problem of aggregating individual's preference data in the local differential privacy (LDP) setting. One naive approach is to add Laplace random noises, which however suffers from low statistical utility and is fragile to LDP-specific poisoning attacks. Therefore, we propose a novel mechanism to improve the utility and the robustness simultaneously: the <italic>additive mechanism</italic>. The additive mechanism randomly outputs a subset of candidates with a probability proportional to their total scores. For preference data with Borda rule over <inline-formula><tex-math notation=\"LaTeX\">Z_$d$_Z</tex-math></inline-formula> items, its mean squared error bound is optimized from <inline-formula><tex-math notation=\"LaTeX\">Z_$O(\\frac{d^{5}}{n\\epsilon ^{2}})$_Z</tex-math></inline-formula> to <inline-formula><tex-math notation=\"LaTeX\">Z_$O(\\frac{d^{4}}{n\\epsilon ^{2}})$_Z</tex-math></inline-formula>, and its maximum poisoning risk bound is reduced from <inline-formula><tex-math notation=\"LaTeX\">Z_$+\\infty$_Z</tex-math></inline-formula> to <inline-formula><tex-math notation=\"LaTeX\">Z_$O(\\frac{d^{2}}{n\\epsilon })$_Z</tex-math></inline-formula>. We also theoretically investigate minimax lower bounds of <inline-formula><tex-math notation=\"LaTeX\">Z_$\\epsilon$_Z</tex-math></inline-formula>-LDP preference data aggregation, and prove the error rate of <inline-formula><tex-math notation=\"LaTeX\">Z_$O(\\frac{d^{4}}{n\\epsilon ^{2}})$_Z</tex-math></inline-formula> is optimal for the Borda rule. Experimental results validate that our proposed approaches averagely reduce estimation error by 50% and are more robust to adversarial poisoning attacks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Online service providers benefit from collecting and analyzing preference data from users, including both implicit preference data (e.g., watched videos of a user) and explicit preference data (e.g., ranking data over candidates). However, it brings ethical and legal issues of data privacy at the same time. In this paper, we study the problem of aggregating individual's preference data in the local differential privacy (LDP) setting. One naive approach is to add Laplace random noises, which however suffers from low statistical utility and is fragile to LDP-specific poisoning attacks. Therefore, we propose a novel mechanism to improve the utility and the robustness simultaneously: the <italic>additive mechanism</italic>. The additive mechanism randomly outputs a subset of candidates with a probability proportional to their total scores. For preference data with Borda rule over <inline-formula><tex-math notation=\"LaTeX\">$d$</tex-math></inline-formula> items, its mean squared error bound is optimized from <inline-formula><tex-math notation=\"LaTeX\">$O(\\frac{d^{5}}{n\\epsilon ^{2}})$</tex-math></inline-formula> to <inline-formula><tex-math notation=\"LaTeX\">$O(\\frac{d^{4}}{n\\epsilon ^{2}})$</tex-math></inline-formula>, and its maximum poisoning risk bound is reduced from <inline-formula><tex-math notation=\"LaTeX\">$+\\infty$</tex-math></inline-formula> to <inline-formula><tex-math notation=\"LaTeX\">$O(\\frac{d^{2}}{n\\epsilon })$</tex-math></inline-formula>. We also theoretically investigate minimax lower bounds of <inline-formula><tex-math notation=\"LaTeX\">$\\epsilon$</tex-math></inline-formula>-LDP preference data aggregation, and prove the error rate of <inline-formula><tex-math notation=\"LaTeX\">$O(\\frac{d^{4}}{n\\epsilon ^{2}})$</tex-math></inline-formula> is optimal for the Borda rule. Experimental results validate that our proposed approaches averagely reduce estimation error by 50% and are more robust to adversarial poisoning attacks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Online service providers benefit from collecting and analyzing preference data from users, including both implicit preference data (e.g., watched videos of a user) and explicit preference data (e.g., ranking data over candidates). However, it brings ethical and legal issues of data privacy at the same time. In this paper, we study the problem of aggregating individual's preference data in the local differential privacy (LDP) setting. One naive approach is to add Laplace random noises, which however suffers from low statistical utility and is fragile to LDP-specific poisoning attacks. Therefore, we propose a novel mechanism to improve the utility and the robustness simultaneously: the additive mechanism. The additive mechanism randomly outputs a subset of candidates with a probability proportional to their total scores. For preference data with Borda rule over - items, its mean squared error bound is optimized from - to -, and its maximum poisoning risk bound is reduced from - to -. We also theoretically investigate minimax lower bounds of --LDP preference data aggregation, and prove the error rate of - is optimal for the Borda rule. Experimental results validate that our proposed approaches averagely reduce estimation error by 50% and are more robust to adversarial poisoning attacks.",
"title": "Analyzing Preference Data With Local Privacy: Optimal Utility and Enhanced Robustness",
"normalizedTitle": "Analyzing Preference Data With Local Privacy: Optimal Utility and Enhanced Robustness",
"fno": "09894703",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Data Aggregation",
"Robustness",
"Videos",
"Privacy",
"Measurement",
"Differential Privacy",
"Additives",
"Data Aggregation",
"Data Poisoning",
"Differential Privacy",
"Local Privacy",
"Minimax Error",
"Preference Data"
],
"authors": [
{
"givenName": "Shaowei",
"surname": "Wang",
"fullName": "Shaowei Wang",
"affiliation": "Institute of Artificial Intelligence and Blockchain, Guangzhou University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xuandi",
"surname": "Luo",
"fullName": "Xuandi Luo",
"affiliation": "Institute of Artificial Intelligence and Blockchain, Guangzhou University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuqiu",
"surname": "Qian",
"fullName": "Yuqiu Qian",
"affiliation": "Tencent Games, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiachun",
"surname": "Du",
"fullName": "Jiachun Du",
"affiliation": "Tencent Games, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wenqing",
"surname": "Lin",
"fullName": "Wenqing Lin",
"affiliation": "Tencent Games, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Yang",
"fullName": "Wei Yang",
"affiliation": "University of Science and Technology of China, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-09-01 00:00:00",
"pubType": "trans",
"pages": "1-14",
"year": "5555",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tp/2023/01/09712412",
"title": "Centerless Clustering",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09712412/1AZKZVM8b84",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/06/09785611",
"title": "Single-Source Personalized PageRanks With Workload Robustness",
"doi": null,
"abstractUrl": "/journal/tk/2023/06/09785611/1DQLK4ory9y",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/5555/01/09842386",
"title": "Verifiable Homomorphic Secret Sharing for Low Degree Polynomials",
"doi": null,
"abstractUrl": "/journal/tq/5555/01/09842386/1FlM51CnLeo",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/5555/01/09893327",
"title": "Differentially Oblivious Two-Party Pattern Matching With Sublinear Round Complexity",
"doi": null,
"abstractUrl": "/journal/tq/5555/01/09893327/1GGLMHV1tAI",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/5555/01/09976235",
"title": "Efficient Noise Generation Protocols for Differentially Private Multiparty Computation",
"doi": null,
"abstractUrl": "/journal/tq/5555/01/09976235/1IWfPrcSm2Y",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/5555/01/10025677",
"title": "Privacy-Enhanced Decentralized Federated Learning at Dynamic Edge",
"doi": null,
"abstractUrl": "/journal/tc/5555/01/10025677/1KdUSqKKwAo",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/5555/01/10061543",
"title": "Differentially Private Non-Negative Consistent Release for Large-Scale Hierarchical Trees",
"doi": null,
"abstractUrl": "/journal/tq/5555/01/10061543/1Lk41G2LAQM",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2021/01/08713938",
"title": "RoD: Evaluating the Risk of Data Disclosure Using Noise Estimation for Differential Privacy",
"doi": null,
"abstractUrl": "/journal/bd/2021/01/08713938/1a313aIkenm",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/11/09524471",
"title": "A(DP)<inline-formula><tex-math notation=\"LaTeX\">Z_$^2$_Z</tex-math></inline-formula>SGD: Asynchronous Decentralized Parallel Stochastic Gradient Descent With Differential Privacy",
"doi": null,
"abstractUrl": "/journal/tp/2022/11/09524471/1wpq5To7ikU",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/04/09609550",
"title": "Private and Utility Enhanced Recommendations With Local Differential Privacy and Gaussian Mixture Model",
"doi": null,
"abstractUrl": "/journal/tk/2023/04/09609550/1yoxyRZoO3e",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09895199",
"articleId": "1GNpapAirJu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09895303",
"articleId": "1GNpaNZer1m",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1BLmXQDxCbm",
"title": "Jan.-Feb.",
"year": "2022",
"issueNum": "01",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "24",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1ziK7m1pNVC",
"doi": "10.1109/MCSE.2021.3134604",
"abstract": "In this article, we introduce the work of the Massively Parallel Particle Hydrodynamics working group, part of the U.K.'s ExCALIBUR software initiative. The aim of the group is to develop extensible software suitable for simulating complex hydrodynamics problems on exascale computing facilities using a Lagrangian particle-based approach. These methods complement mesh-based approaches, and are particularly suited to problems with a large and fluid dynamic range or that involve free surfaces. The code we are developing uses fine-grained task parallelism to achieve a good load balance, when the workload varies greatly from fluid element to element. We describe how components from astrophysics and engineering are being brought together to further develop this interesting approach, and outline some of the challenges, such as enabling task execution on graphics processing units, that the working group will need to solve in order to extract the full potential of exascale systems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this article, we introduce the work of the Massively Parallel Particle Hydrodynamics working group, part of the U.K.'s ExCALIBUR software initiative. The aim of the group is to develop extensible software suitable for simulating complex hydrodynamics problems on exascale computing facilities using a Lagrangian particle-based approach. These methods complement mesh-based approaches, and are particularly suited to problems with a large and fluid dynamic range or that involve free surfaces. The code we are developing uses fine-grained task parallelism to achieve a good load balance, when the workload varies greatly from fluid element to element. We describe how components from astrophysics and engineering are being brought together to further develop this interesting approach, and outline some of the challenges, such as enabling task execution on graphics processing units, that the working group will need to solve in order to extract the full potential of exascale systems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this article, we introduce the work of the Massively Parallel Particle Hydrodynamics working group, part of the U.K.'s ExCALIBUR software initiative. The aim of the group is to develop extensible software suitable for simulating complex hydrodynamics problems on exascale computing facilities using a Lagrangian particle-based approach. These methods complement mesh-based approaches, and are particularly suited to problems with a large and fluid dynamic range or that involve free surfaces. The code we are developing uses fine-grained task parallelism to achieve a good load balance, when the workload varies greatly from fluid element to element. We describe how components from astrophysics and engineering are being brought together to further develop this interesting approach, and outline some of the challenges, such as enabling task execution on graphics processing units, that the working group will need to solve in order to extract the full potential of exascale systems.",
"title": "Massively Parallel Particle Hydrodynamics at Exascale",
"normalizedTitle": "Massively Parallel Particle Hydrodynamics at Exascale",
"fno": "09647952",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Computational Fluid Dynamics",
"Graphics Processing Units",
"Hydrodynamics",
"Parallel Processing",
"Parallel Programming",
"Complex Hydrodynamics Problems",
"Exascale Computing Facilities",
"Lagrangian Particle Based Approach",
"Mesh Based Approaches",
"Fluid Dynamic Range",
"Fine Grained Task Parallelism",
"Fluid Element",
"Exascale Systems",
"Ex CALIBUR Software Initiative",
"Extensible Software",
"Massively Parallel Particle Hydrodynamics",
"Graphics Processing Units",
"Task Analysis",
"Hydrodynamics",
"Astrophysics",
"Codes",
"Parallel Processing",
"Computational Modeling",
"Mathematical Models"
],
"authors": [
{
"givenName": "Richard",
"surname": "Bower",
"fullName": "Richard Bower",
"affiliation": "University of Durham, Durham, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Benedict",
"surname": "D. Rogers",
"fullName": "Benedict D. Rogers",
"affiliation": "The University of Manchester, Manchester, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matthieu",
"surname": "Schaller",
"fullName": "Matthieu Schaller",
"affiliation": "Leiden University, Leiden, The Netherlands",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "mags",
"pages": "14-25",
"year": "2022",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cgiv/2009/3789/0/3789a038",
"title": "Particle Importance Based Fluid Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2009/3789a038/12OmNAolHa9",
"parentPublication": {
"id": "proceedings/cgiv/2009/3789/0",
"title": "2009 Sixth International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/supercomputing/1996/854/0/01392900",
"title": "A Parallel Cosmological Hydrodynamics Code",
"doi": null,
"abstractUrl": "/proceedings-article/supercomputing/1996/01392900/12OmNBh8h03",
"parentPublication": {
"id": "proceedings/supercomputing/1996/854/0",
"title": "Proceedings of the 1996 ACM/IEEE Conference on Supercomputing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicse/2012/4705/0/4705a193",
"title": "A Load-Balanced Parallel Algorithm of Smooth Particle Hydrodynamics",
"doi": null,
"abstractUrl": "/proceedings-article/icicse/2012/4705a193/12OmNwE9OAr",
"parentPublication": {
"id": "proceedings/icicse/2012/4705/0",
"title": "2012 Sixth International Conference on Internet Computing for Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcabes/2015/6593/0/6593a009",
"title": "The Lager Ship Fluid-Solid Coupling Parallel Algorithm Based on VOSS Mapping Theory",
"doi": null,
"abstractUrl": "/proceedings-article/dcabes/2015/6593a009/12OmNxiKs2o",
"parentPublication": {
"id": "proceedings/dcabes/2015/6593/0",
"title": "2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mcsi/2015/8673/0/8673a212",
"title": "Hydrodynamics of Orthotropic Shapes Utilizing Ellipsoidal Harmonics",
"doi": null,
"abstractUrl": "/proceedings-article/mcsi/2015/8673a212/12OmNzwZ6qP",
"parentPublication": {
"id": "proceedings/mcsi/2015/8673/0",
"title": "2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcs/2017/3250/0/08035103",
"title": "Performance Optimisation of Smoothed Particle Hydrodynamics Algorithms for Multi/Many-Core Architectures",
"doi": null,
"abstractUrl": "/proceedings-article/hpcs/2017/08035103/12OmNzxgHtr",
"parentPublication": {
"id": "proceedings/hpcs/2017/3250/0",
"title": "2017 International Conference on High-Performance Computing & Simulation (HPCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccms/2010/3941/1/3941a290",
"title": "A Particle-Based Unified Model for Non-Newtonian Fluid Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/iccms/2010/3941a290/12OmNzzfToR",
"parentPublication": {
"id": "proceedings/iccms/2010/3941/3",
"title": "Computer Modeling and Simulation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2009/02/mcs2009020034",
"title": "Stellar Core Collapse: A Case Study in the Design of Numerical Algorithms for Scalable Radiation Hydrodynamics",
"doi": null,
"abstractUrl": "/magazine/cs/2009/02/mcs2009020034/13rRUwjoNDB",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2018/8319/0/831900a607",
"title": "Towards a Mini-App for Smoothed Particle Hydrodynamics at Exascale",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2018/831900a607/17D45VsBTZL",
"parentPublication": {
"id": "proceedings/cluster/2018/8319/0",
"title": "2018 IEEE International Conference on Cluster Computing (CLUSTER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2006/2686/0/04027054",
"title": "Particle-based non-Newtonian fluid animation for melting objects",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2006/04027054/17QjJcBGChj",
"parentPublication": {
"id": "proceedings/sibgrapi/2006/2686/0",
"title": "2006 19th Brazilian Symposium on Computer Graphics and Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09566780",
"articleId": "1xC6Rrq0AsE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09734780",
"articleId": "1BLmYvnxYHu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNB9bvma",
"title": "July-September",
"year": "1999",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "5",
"label": "July-September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwgyOj7",
"doi": "10.1109/2945.795213",
"abstract": "Abstract—--Real-time visualization of large volume datasets demands high performance computation, pushing the storage, processing, and data communication requirements to the limits of current technology. General purpose parallel processors have been used to visualize moderate size datasets at interactive frame rates; however, the cost and size of these supercomputers inhibits the widespread use for real-time visualization. This paper surveys several special purpose architectures that seek to render volumes at interactive rates. These specialized visualization accelerators have cost, performance, and size advantages over parallel processors. All architectures implement ray casting using parallel and pipelined hardware. We introduce a new metric that normalizes performance to compare these architectures. The architectures included in this survey are VOGUE, VIRIM, Array Based Ray Casting, EM-Cube, and VIZARD II. We also discuss future applications of special purpose accelerators.Index Terms--Volume rendering, interactive, ray casting, parallel architecture, VOGUE, VIRIM, array based ray casting, EM-Cube, VIZARD II.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—--Real-time visualization of large volume datasets demands high performance computation, pushing the storage, processing, and data communication requirements to the limits of current technology. General purpose parallel processors have been used to visualize moderate size datasets at interactive frame rates; however, the cost and size of these supercomputers inhibits the widespread use for real-time visualization. This paper surveys several special purpose architectures that seek to render volumes at interactive rates. These specialized visualization accelerators have cost, performance, and size advantages over parallel processors. All architectures implement ray casting using parallel and pipelined hardware. We introduce a new metric that normalizes performance to compare these architectures. The architectures included in this survey are VOGUE, VIRIM, Array Based Ray Casting, EM-Cube, and VIZARD II. We also discuss future applications of special purpose accelerators.Index Terms--Volume rendering, interactive, ray casting, parallel architecture, VOGUE, VIRIM, array based ray casting, EM-Cube, VIZARD II.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—--Real-time visualization of large volume datasets demands high performance computation, pushing the storage, processing, and data communication requirements to the limits of current technology. General purpose parallel processors have been used to visualize moderate size datasets at interactive frame rates; however, the cost and size of these supercomputers inhibits the widespread use for real-time visualization. This paper surveys several special purpose architectures that seek to render volumes at interactive rates. These specialized visualization accelerators have cost, performance, and size advantages over parallel processors. All architectures implement ray casting using parallel and pipelined hardware. We introduce a new metric that normalizes performance to compare these architectures. The architectures included in this survey are VOGUE, VIRIM, Array Based Ray Casting, EM-Cube, and VIZARD II. We also discuss future applications of special purpose accelerators.Index Terms--Volume rendering, interactive, ray casting, parallel architecture, VOGUE, VIRIM, array based ray casting, EM-Cube, VIZARD II.",
"title": "Ray Casting Architectures for Volume Visualization",
"normalizedTitle": "Ray Casting Architectures for Volume Visualization",
"fno": "v0210",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [
{
"givenName": "Harvey",
"surname": "Ray",
"fullName": "Harvey Ray",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanspeter",
"surname": "Pfister",
"fullName": "Hanspeter Pfister",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Deborah",
"surname": "Silver",
"fullName": "Deborah Silver",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Todd A.",
"surname": "Cook",
"fullName": "Todd A. Cook",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "1999-07-01 00:00:00",
"pubType": "trans",
"pages": "210-223",
"year": "1999",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0196",
"articleId": "13rRUEgs2th",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0224",
"articleId": "13rRUxly95r",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqzu6WC",
"title": "April-June",
"year": "1997",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "3",
"label": "April-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASu0A",
"doi": "10.1109/2945.597797",
"abstract": "Abstract—Lazy Sweep Ray Casting is a fast algorithm for rendering general irregular grids. It is based on the sweep-plane paradigm, and it is able to accelerate ray casting for rendering irregular grids, including disconnected and nonconvex (even with holes) unstructured irregular grids with a rendering cost that decreases as the \"disconnectedness\" decreases. The algorithm is carefully tailored to exploit spatial coherence even if the image resolution differs substantially from the object space resolution.Lazy Sweep Ray Casting has several desirable properties, including its generality, (depth-sorting) accuracy, low memory consumption, speed, simplicity of implementation, and portability (e.g., no hardware dependencies).We establish the practicality of our method through experimental results based on our implementation, which is shown to be substantially faster (by up to two orders of magnitude) than other algorithms implemented in software.We also provide theoretical results, both lower and upper bounds, on the complexity of ray casting of irregular grids.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Lazy Sweep Ray Casting is a fast algorithm for rendering general irregular grids. It is based on the sweep-plane paradigm, and it is able to accelerate ray casting for rendering irregular grids, including disconnected and nonconvex (even with holes) unstructured irregular grids with a rendering cost that decreases as the \"disconnectedness\" decreases. The algorithm is carefully tailored to exploit spatial coherence even if the image resolution differs substantially from the object space resolution.Lazy Sweep Ray Casting has several desirable properties, including its generality, (depth-sorting) accuracy, low memory consumption, speed, simplicity of implementation, and portability (e.g., no hardware dependencies).We establish the practicality of our method through experimental results based on our implementation, which is shown to be substantially faster (by up to two orders of magnitude) than other algorithms implemented in software.We also provide theoretical results, both lower and upper bounds, on the complexity of ray casting of irregular grids.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Lazy Sweep Ray Casting is a fast algorithm for rendering general irregular grids. It is based on the sweep-plane paradigm, and it is able to accelerate ray casting for rendering irregular grids, including disconnected and nonconvex (even with holes) unstructured irregular grids with a rendering cost that decreases as the \"disconnectedness\" decreases. The algorithm is carefully tailored to exploit spatial coherence even if the image resolution differs substantially from the object space resolution.Lazy Sweep Ray Casting has several desirable properties, including its generality, (depth-sorting) accuracy, low memory consumption, speed, simplicity of implementation, and portability (e.g., no hardware dependencies).We establish the practicality of our method through experimental results based on our implementation, which is shown to be substantially faster (by up to two orders of magnitude) than other algorithms implemented in software.We also provide theoretical results, both lower and upper bounds, on the complexity of ray casting of irregular grids.",
"title": "The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids",
"normalizedTitle": "The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids",
"fno": "v0142",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Volumetric Data",
"Irregular Grids",
"Volume Rendering",
"Sweep Algorithms",
"Ray Tracing",
"Computational Geometry",
"Scientific Visualization"
],
"authors": [
{
"givenName": "Claudio T.",
"surname": "Silva",
"fullName": "Claudio T. Silva",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Joseph S.B.",
"surname": "Mitchell",
"fullName": "Joseph S.B. Mitchell",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "1997-04-01 00:00:00",
"pubType": "trans",
"pages": "142-157",
"year": "1997",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0129",
"articleId": "13rRUEgarnz",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0158",
"articleId": "13rRUxcKzVc",
"__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": "13rRUwIF6dH",
"doi": "10.1109/TVCG.2008.147",
"abstract": "This paper presents a novel method for interactive exploration of industrial CT volumes such as cast metal parts, with the goal of interactively detecting, classifying, and quantifying features using a visualization-driven approach. The standard approach for defect detection builds on region growing, which requires manually tuning parameters such as target ranges for density and size, variance, as well as the specification of seed points. If the results are not satisfactory, region growing must be performed again with different parameters. In contrast, our method allows interactive exploration of the parameter space, completely separated from region growing in an unattended pre-processing stage. The pre-computed feature volume tracks a feature size curve for each voxel\rover time, which is identified with the main region growing parameter such as variance. A novel 3D transfer function domain over (density, feature size, time) allows for interactive exploration of feature classes. Features and feature size curves can also be explored individually, which helps with transfer function specification and allows coloring individual features and disabling features resulting from CT artifacts. Based on the classification obtained through exploration, the classified features can be quantified immediately.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a novel method for interactive exploration of industrial CT volumes such as cast metal parts, with the goal of interactively detecting, classifying, and quantifying features using a visualization-driven approach. The standard approach for defect detection builds on region growing, which requires manually tuning parameters such as target ranges for density and size, variance, as well as the specification of seed points. If the results are not satisfactory, region growing must be performed again with different parameters. In contrast, our method allows interactive exploration of the parameter space, completely separated from region growing in an unattended pre-processing stage. The pre-computed feature volume tracks a feature size curve for each voxel\rover time, which is identified with the main region growing parameter such as variance. A novel 3D transfer function domain over (density, feature size, time) allows for interactive exploration of feature classes. Features and feature size curves can also be explored individually, which helps with transfer function specification and allows coloring individual features and disabling features resulting from CT artifacts. Based on the classification obtained through exploration, the classified features can be quantified immediately.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a novel method for interactive exploration of industrial CT volumes such as cast metal parts, with the goal of interactively detecting, classifying, and quantifying features using a visualization-driven approach. The standard approach for defect detection builds on region growing, which requires manually tuning parameters such as target ranges for density and size, variance, as well as the specification of seed points. If the results are not satisfactory, region growing must be performed again with different parameters. In contrast, our method allows interactive exploration of the parameter space, completely separated from region growing in an unattended pre-processing stage. The pre-computed feature volume tracks a feature size curve for each voxel\rover time, which is identified with the main region growing parameter such as variance. A novel 3D transfer function domain over (density, feature size, time) allows for interactive exploration of feature classes. Features and feature size curves can also be explored individually, which helps with transfer function specification and allows coloring individual features and disabling features resulting from CT artifacts. Based on the classification obtained through exploration, the classified features can be quantified immediately.",
"title": "Interactive Volume Exploration for Feature Detection and Quantification in Industrial CT Data",
"normalizedTitle": "Interactive Volume Exploration for Feature Detection and Quantification in Industrial CT Data",
"fno": "ttg2008061507",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Non Destructive Testing",
"Multi Dimensional Transfer Functions",
"Region Growing",
"Volume Rendering"
],
"authors": [
{
"givenName": "Markus",
"surname": "Hadwiger",
"fullName": "Markus Hadwiger",
"affiliation": "VRVis Research Center, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Laura",
"surname": "Fritz",
"fullName": "Laura Fritz",
"affiliation": "VRVis Research Center, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christof",
"surname": "Rezk-Salama",
"fullName": "Christof Rezk-Salama",
"affiliation": "University of Siegen, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Höllt",
"fullName": "Thomas Höllt",
"affiliation": "VRVis Research Center, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Georg",
"surname": "Geier",
"fullName": "Georg Geier",
"affiliation": "Austrian Foundry Research Institute",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Pabel",
"fullName": "Thomas Pabel",
"affiliation": "Austrian Foundry Research Institute",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1507-1514",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/gcis/2009/3571/3/3571c597",
"title": "Urban Arial Image Segmentation Using Spectral and Direction Features",
"doi": null,
"abstractUrl": "/proceedings-article/gcis/2009/3571c597/12OmNAoDhTP",
"parentPublication": {
"id": "proceedings/gcis/2009/3571/3",
"title": "2009 WRI Global Congress on Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etcs/2010/3987/2/3987b106",
"title": "Ultrasound CT Image Segmentation Based on Region Growing",
"doi": null,
"abstractUrl": "/proceedings-article/etcs/2010/3987b106/12OmNBOCWgK",
"parentPublication": {
"id": "proceedings/etcs/2010/3987/2",
"title": "Education Technology and Computer Science, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisis/2010/3967/0/3967a146",
"title": "Automatic Volumetric Liver Segmentation Using Texture Based Region Growing",
"doi": null,
"abstractUrl": "/proceedings-article/cisis/2010/3967a146/12OmNs0kyFG",
"parentPublication": {
"id": "proceedings/cisis/2010/3967/0",
"title": "2010 International Conference on Complex, Intelligent and Software Intensive Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/2/3336d020",
"title": "CT Image Segmentation Based on Order Morphological Gradient Map and Improved Region Growing Arithmetic",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336d020/12OmNwDj15Z",
"parentPublication": {
"id": "proceedings/csse/2008/3336/6",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300072",
"title": "Visualizing Industrial CT Volume Data for Nondestructive Testing Applications",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300072/12OmNwdtwkW",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bmei/2008/3118/2/3118b263",
"title": "Texture Feature based Automated Seeded Region Growing in Abdominal MRI Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/bmei/2008/3118b263/12OmNyQpgU8",
"parentPublication": {
"id": "proceedings/bmei/2008/3118/2",
"title": "BioMedical Engineering and Informatics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bmei/2008/3118/2/3118b018",
"title": "Automatic Segmentation of Nasopharyngeal Carcinoma from CT Images",
"doi": null,
"abstractUrl": "/proceedings-article/bmei/2008/3118b018/12OmNz2C1rF",
"parentPublication": {
"id": "proceedings/bmei/2008/3118/2",
"title": "BioMedical Engineering and Informatics, International Conference on",
"__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/tp/2005/09/i1446",
"title": "An Efficient Parameterless Quadrilateral-Based Image Segmentation Method",
"doi": null,
"abstractUrl": "/journal/tp/2005/09/i1446/13rRUwdIOTf",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061683",
"title": "Relation-Aware Volume Exploration Pipeline",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061683/13rRUygT7sw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061499",
"articleId": "13rRUyYjKa8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061515",
"articleId": "13rRUy3xY86",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgHm",
"name": "ttg2008061507.avi",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2008061507.avi",
"extension": "avi",
"size": "49.2 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUygBw73",
"doi": "10.1109/TVCG.2008.120",
"abstract": "In this work we present basic methodology for interactive volume editing on GPUs, and we demonstrate the use of these methods to achieve a number of different effects. We present fast techniques to modify the appearance and structure of volumetric scalar fields given on Cartesian grids. Similar to 2D circular brushes as used in surface painting we present 3D spherical brushes for intuitive coloring of particular structures in such fields. This paint metaphor is extended to allow the user to change the data itself, and the use of this functionality for interactive structure isolation, hole filling, and artefact removal is demonstrated. Building on previous work in the field we introduce high-resolution selection volumes, which can be seen as a resolution-based focus+context metaphor. By utilizing such volumes we present a novel approach to interactive volume editing at sub-voxel accuracy. Finally, we introduce a fast technique to paste textures onto iso-surfaces in a 3D scalar field. Since the texture resolution is independent of the volume resolution, this technique allows structure-aligned textures containing appearance properties or textual information to be used for volume augmentation and annotation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this work we present basic methodology for interactive volume editing on GPUs, and we demonstrate the use of these methods to achieve a number of different effects. We present fast techniques to modify the appearance and structure of volumetric scalar fields given on Cartesian grids. Similar to 2D circular brushes as used in surface painting we present 3D spherical brushes for intuitive coloring of particular structures in such fields. This paint metaphor is extended to allow the user to change the data itself, and the use of this functionality for interactive structure isolation, hole filling, and artefact removal is demonstrated. Building on previous work in the field we introduce high-resolution selection volumes, which can be seen as a resolution-based focus+context metaphor. By utilizing such volumes we present a novel approach to interactive volume editing at sub-voxel accuracy. Finally, we introduce a fast technique to paste textures onto iso-surfaces in a 3D scalar field. Since the texture resolution is independent of the volume resolution, this technique allows structure-aligned textures containing appearance properties or textual information to be used for volume augmentation and annotation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this work we present basic methodology for interactive volume editing on GPUs, and we demonstrate the use of these methods to achieve a number of different effects. We present fast techniques to modify the appearance and structure of volumetric scalar fields given on Cartesian grids. Similar to 2D circular brushes as used in surface painting we present 3D spherical brushes for intuitive coloring of particular structures in such fields. This paint metaphor is extended to allow the user to change the data itself, and the use of this functionality for interactive structure isolation, hole filling, and artefact removal is demonstrated. Building on previous work in the field we introduce high-resolution selection volumes, which can be seen as a resolution-based focus+context metaphor. By utilizing such volumes we present a novel approach to interactive volume editing at sub-voxel accuracy. Finally, we introduce a fast technique to paste textures onto iso-surfaces in a 3D scalar field. Since the texture resolution is independent of the volume resolution, this technique allows structure-aligned textures containing appearance properties or textual information to be used for volume augmentation and annotation.",
"title": "Direct Volume Editing",
"normalizedTitle": "Direct Volume Editing",
"fno": "ttg2008061388",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Volume Editing",
"GPU",
"Painting",
"Carving",
"Annotations"
],
"authors": [
{
"givenName": "Kai",
"surname": "Bürger",
"fullName": "Kai Bürger",
"affiliation": "Technische Universität München, tum.3D",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jens",
"surname": "Krüger",
"fullName": "Jens Krüger",
"affiliation": "Scientific Computing and Imaging Institute, University of Utah",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rüdiger",
"surname": "Westermann",
"fullName": "Rüdiger Westermann",
"affiliation": "Technische Universität München, tum.3D",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1388-1395",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/svr/2013/5001/0/06655801",
"title": "Art Making Using an Haptic Device for Interactive Digital Painting",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2013/06655801/12OmNBUAvWs",
"parentPublication": {
"id": "proceedings/svr/2013/5001/0",
"title": "2013 XV Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2010/6685/0/05429597",
"title": "Adaptive proxy geometry for direct volume manipulation",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2010/05429597/12OmNBsue33",
"parentPublication": {
"id": "proceedings/pacificvis/2010/6685/0",
"title": "2010 IEEE Pacific Visualization Symposium (PacificVis 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvgip/2008/3476/0/3476a551",
"title": "Real-Time Rendering and Manipulation of Large Terrains",
"doi": null,
"abstractUrl": "/proceedings-article/icvgip/2008/3476a551/12OmNqFrGFh",
"parentPublication": {
"id": "proceedings/icvgip/2008/3476/0",
"title": "Computer Vision, Graphics & Image Processing, Indian Conference on",
"__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/2008/06/ttg2008061364",
"title": "Texture-based Transfer Functions for Direct Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061364/13rRUwfI0Q1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1992/04/mcg1992040063",
"title": "Direct Visualization of Volume Data",
"doi": null,
"abstractUrl": "/magazine/cg/1992/04/mcg1992040063/13rRUwgQpwN",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061505",
"title": "Direct Interval Volume Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061505/13rRUxcsYLN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/05/v1027",
"title": "Interactive Transfer Function Design Based on Editing Direct Volume Rendered Images",
"doi": null,
"abstractUrl": "/journal/tg/2007/05/v1027/13rRUxly9dL",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122135",
"title": "Interactive Multiscale Tensor Reconstruction for Multiresolution Volume Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122135/13rRUyeCkae",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2018/06/08617734",
"title": "CellPAINT: Interactive Illustration of Dynamic Mesoscale Cellular Environments",
"doi": null,
"abstractUrl": "/magazine/cg/2018/06/08617734/17D45XDIXXb",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061380",
"articleId": "13rRUwIF6l1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061396",
"articleId": "13rRUxYrbUx",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRXO",
"name": "ttg2008061388.avi",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2008061388.avi",
"extension": "avi",
"size": "68.2 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzC5T8j",
"title": "July",
"year": "1992",
"issueNum": "04",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "12",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwgQpwN",
"doi": "10.1109/38.144828",
"abstract": "A combination of segmentation tools and fast volume renderers that provides an interactive exploration environment for volume visualization is discussed. The tools and renderers include mechanisms that distribute volume data across multiple processors, as well as image compositing techniques and solutions to representation problems in the selection and display of subregions within bounding volumes. A volume visualization technique using the interactive control of images rendered directly from volume data coupled with a user-controlled semantic classification tool is described. The variations of parallel volume rendering being explored on the Pixel-Planes 5 system and the region-of-interest selection methods and the interactive tools used by the system are presented. The flexibility and power of combining volume rendering with region-of-interest selection techniques are demonstrated using examples of medical imaging applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A combination of segmentation tools and fast volume renderers that provides an interactive exploration environment for volume visualization is discussed. The tools and renderers include mechanisms that distribute volume data across multiple processors, as well as image compositing techniques and solutions to representation problems in the selection and display of subregions within bounding volumes. A volume visualization technique using the interactive control of images rendered directly from volume data coupled with a user-controlled semantic classification tool is described. The variations of parallel volume rendering being explored on the Pixel-Planes 5 system and the region-of-interest selection methods and the interactive tools used by the system are presented. The flexibility and power of combining volume rendering with region-of-interest selection techniques are demonstrated using examples of medical imaging applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A combination of segmentation tools and fast volume renderers that provides an interactive exploration environment for volume visualization is discussed. The tools and renderers include mechanisms that distribute volume data across multiple processors, as well as image compositing techniques and solutions to representation problems in the selection and display of subregions within bounding volumes. A volume visualization technique using the interactive control of images rendered directly from volume data coupled with a user-controlled semantic classification tool is described. The variations of parallel volume rendering being explored on the Pixel-Planes 5 system and the region-of-interest selection methods and the interactive tools used by the system are presented. The flexibility and power of combining volume rendering with region-of-interest selection techniques are demonstrated using examples of medical imaging applications.",
"title": "Direct Visualization of Volume Data",
"normalizedTitle": "Direct Visualization of Volume Data",
"fno": "mcg1992040063",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [],
"authors": [
{
"givenName": "Terry S.",
"surname": "Yoo",
"fullName": "Terry S. Yoo",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ulrich",
"surname": "Neumann",
"fullName": "Ulrich Neumann",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Henry",
"surname": "Fuchs",
"fullName": "Henry Fuchs",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stephen M.",
"surname": "Pizer",
"fullName": "Stephen M. Pizer",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tim",
"surname": "Cullip",
"fullName": "Tim Cullip",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Rhoades",
"fullName": "John Rhoades",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ross",
"surname": "Whitaker",
"fullName": "Ross Whitaker",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "1992-07-01 00:00:00",
"pubType": "mags",
"pages": "63-71",
"year": "1992",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "mcg1992040054",
"articleId": "13rRUygT7cz",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg1992040073",
"articleId": "13rRUIJcWqO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzxgHw9",
"title": "September/October",
"year": "2007",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxly9dL",
"doi": "10.1109/TVCG.2007.1051",
"abstract": "Abstract—Direct volume rendered images (DVRIs) have been widely used to reveal structures in volumetric data. However, DVRIs generated by many volume visualization techniques can only partially satisfy users' demands. In this paper, we propose a framework for editing DVRIs, which can also be used for interactive transfer function (TF) design. Our approach allows users to fuse multiple features in distinct DVRIs into a comprehensive one, to blend two DVRIs, and/or to delete features in a DVRI. We further present how these editing operations can generate smooth animations for focus + context visualization. Experimental results on some real volumetric data demonstrate the effectiveness of our method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Direct volume rendered images (DVRIs) have been widely used to reveal structures in volumetric data. However, DVRIs generated by many volume visualization techniques can only partially satisfy users' demands. In this paper, we propose a framework for editing DVRIs, which can also be used for interactive transfer function (TF) design. Our approach allows users to fuse multiple features in distinct DVRIs into a comprehensive one, to blend two DVRIs, and/or to delete features in a DVRI. We further present how these editing operations can generate smooth animations for focus + context visualization. Experimental results on some real volumetric data demonstrate the effectiveness of our method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Direct volume rendered images (DVRIs) have been widely used to reveal structures in volumetric data. However, DVRIs generated by many volume visualization techniques can only partially satisfy users' demands. In this paper, we propose a framework for editing DVRIs, which can also be used for interactive transfer function (TF) design. Our approach allows users to fuse multiple features in distinct DVRIs into a comprehensive one, to blend two DVRIs, and/or to delete features in a DVRI. We further present how these editing operations can generate smooth animations for focus + context visualization. Experimental results on some real volumetric data demonstrate the effectiveness of our method.",
"title": "Interactive Transfer Function Design Based on Editing Direct Volume Rendered Images",
"normalizedTitle": "Interactive Transfer Function Design Based on Editing Direct Volume Rendered Images",
"fno": "v1027",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Transfer Functions",
"Rendering Computer Graphics",
"Data Visualization",
"Animation",
"Focusing",
"Biomedical Imaging",
"Fuses",
"User Interfaces",
"Graphics",
"Computational Fluid Dynamics",
"Direct Volume Rendering",
"Image Editing",
"Intuitive User Interface",
"Morphing",
"Transfer Function Design",
"Focus Context",
"Animation"
],
"authors": [
{
"givenName": "Yingcai",
"surname": "Wu",
"fullName": "Yingcai Wu",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Qu",
"fullName": "Huamin Qu",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2007-09-01 00:00:00",
"pubType": "trans",
"pages": "1027-1040",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visual/1994/6627/0/00346321",
"title": "Differential volume rendering: a fast volume visualization technique for flow animation",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1994/00346321/12OmNAoUTre",
"parentPublication": {
"id": "proceedings/visual/1994/6627/0",
"title": "Proceedings Visualization '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1994/6627/0/00346340",
"title": "VolVis: a diversified volume visualization system",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1994/00346340/12OmNroijkk",
"parentPublication": {
"id": "proceedings/visual/1994/6627/0",
"title": "Proceedings Visualization '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vv/2004/8781/0/87810087",
"title": "Spatial and temporal splitting of scalar fields in volume graphics",
"doi": null,
"abstractUrl": "/proceedings-article/vv/2004/87810087/12OmNwD1q0p",
"parentPublication": {
"id": "proceedings/vv/2004/8781/0",
"title": "Volume Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2010/6685/0/05429623",
"title": "Quantitative effectiveness measures for direct volume rendered images",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2010/05429623/12OmNwx3Qch",
"parentPublication": {
"id": "proceedings/pacificvis/2010/6685/0",
"title": "2010 IEEE Pacific Visualization Symposium (PacificVis 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660099",
"title": "Perceptually-Based Comparisons of Direct Volume Rendered Images",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660099/12OmNxX3uxU",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532856",
"title": "VolumeShop: an interactive system for direct volume illustration",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532856/12OmNzYNNaU",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061364",
"title": "Texture-based Transfer Functions for Direct Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061364/13rRUwfI0Q1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/02/v0193",
"title": "Volume Splitting and Its Applications",
"doi": null,
"abstractUrl": "/journal/tg/2007/02/v0193/13rRUxNW1Zc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122364",
"title": "Historygrams: Enabling Interactive Global Illumination in Direct Volume Rendering using Photon Mapping",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122364/13rRUyYjK5h",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061388",
"title": "Direct Volume Editing",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061388/13rRUygBw73",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1015",
"articleId": "13rRUIIVlcE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1041",
"articleId": "13rRUyYSWkU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBhpS2I",
"title": "Nov.-Dec.",
"year": "2018",
"issueNum": "06",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "38",
"label": "Nov.-Dec.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45XDIXXb",
"doi": "10.1109/MCG.2018.2877076",
"abstract": "CellPAINT allows nonexpert users to create interactive mesoscale illustrations that integrate a variety of biological data. Like popular digital painting software, scenes are created using a palette of molecular “brushes.” The current release allows creation of animated scenes with an HIV virion, blood plasma, and a simplified T-cell.",
"abstracts": [
{
"abstractType": "Regular",
"content": "CellPAINT allows nonexpert users to create interactive mesoscale illustrations that integrate a variety of biological data. Like popular digital painting software, scenes are created using a palette of molecular “brushes.” The current release allows creation of animated scenes with an HIV virion, blood plasma, and a simplified T-cell.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "CellPAINT allows nonexpert users to create interactive mesoscale illustrations that integrate a variety of biological data. Like popular digital painting software, scenes are created using a palette of molecular “brushes.” The current release allows creation of animated scenes with an HIV virion, blood plasma, and a simplified T-cell.",
"title": "CellPAINT: Interactive Illustration of Dynamic Mesoscale Cellular Environments",
"normalizedTitle": "CellPAINT: Interactive Illustration of Dynamic Mesoscale Cellular Environments",
"fno": "08617734",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Cellular Biophysics",
"Computer Animation",
"Data Visualisation",
"Interactive Systems",
"Microorganisms",
"Molecular Biophysics",
"Cell PAINT",
"Interactive Illustration",
"Dynamic Mesoscale Cellular Environments",
"Nonexpert Users",
"Interactive Mesoscale Illustrations",
"Biological Data",
"Molecular Brushes",
"Animated Scenes",
"Digital Painting Software",
"Proteins",
"Sprites Computer",
"Painting",
"Shape",
"Visualization",
"Dynamics",
"RNA"
],
"authors": [
{
"givenName": "Adam",
"surname": "Gardner",
"fullName": "Adam Gardner",
"affiliation": "The Scripps Research Institute",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ludovic",
"surname": "Autin",
"fullName": "Ludovic Autin",
"affiliation": "The Scripps Research Institute",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Brett",
"surname": "Barbaro",
"fullName": "Brett Barbaro",
"affiliation": "The Scripps Research Institute",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Arthur J.",
"surname": "Olson",
"fullName": "Arthur J. Olson",
"affiliation": "The Scripps Research Institute",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David S.",
"surname": "Goodsell",
"fullName": "David S. Goodsell",
"affiliation": "The Scripps Research Institute and Rutgers University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2018-11-01 00:00:00",
"pubType": "mags",
"pages": "51-66",
"year": "2018",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2018/01/08019859",
"title": "Instant Construction and Visualization of Crowded Biological Environments",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08019859/13rRUwcAqqm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440077",
"title": "Labels on Levels: Labeling of Multi-Scale Multi-Instance and Crowded 3D Biological Environments",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440077/17D45XH89nI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09224865",
"title": "<italic>Modeling in the Time of COVID-19:</italic> Statistical and Rule-based Mesoscale Models",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09224865/1nWK4ifrIac",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08617747",
"articleId": "17D45VsBTUS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08617746",
"articleId": "17D45Xbl4Oc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNC0PGNI",
"title": "Sept.-Oct.",
"year": "2012",
"issueNum": "05",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "14",
"label": "Sept.-Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0xQ3w",
"doi": "10.1109/MCSE.2012.97",
"abstract": "Novel mathematical descriptions of streak and time lines lead to new methods for visualizing and analyzing flow fields. They enable faster computations and new feature-based methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Novel mathematical descriptions of streak and time lines lead to new methods for visualizing and analyzing flow fields. They enable faster computations and new feature-based methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Novel mathematical descriptions of streak and time lines lead to new methods for visualizing and analyzing flow fields. They enable faster computations and new feature-based methods.",
"title": "Flow Visualization and Analysis Using Streak and Time Lines",
"normalizedTitle": "Flow Visualization and Analysis Using Streak and Time Lines",
"fno": "mcs2012050078",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Mathematics",
"Flow Control",
"Visualization",
"Sientific Computing",
"Fature Extraction",
"Scientific Computing",
"Unsteady Flow Visualization",
"Streak Lines",
"Streak Surfaces",
"Feature Extraction"
],
"authors": [
{
"givenName": "Tino",
"surname": "Weinkauf",
"fullName": "Tino Weinkauf",
"affiliation": "Max Planck Institute for Informatics",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Holger",
"surname": "Theisel",
"fullName": "Holger Theisel",
"affiliation": "University of Magdeburg",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2012-09-01 00:00:00",
"pubType": "mags",
"pages": "78-84",
"year": "2012",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2005/2766/0/27660082",
"title": "Texture-Based Visualization of Uncertainty in Flow Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660082/12OmNB9KHue",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2001/1195/0/11950317",
"title": "Animated Illuminated Lines for Flow Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2001/11950317/12OmNwBT1mq",
"parentPublication": {
"id": "proceedings/iv/2001/1195/0",
"title": "Proceedings Fifth International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122071",
"title": "Vortex Visualization in Ultra Low Reynolds Number Insect Flight",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122071/13rRUILc8f9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061259",
"title": "Interactive Streak Surface Visualization on the GPU",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061259/13rRUwIF69e",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061267",
"title": "Time and Streak Surfaces for Flow Visualization in Large Time-Varying Data Sets",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061267/13rRUxBa5bM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011121949",
"title": "Flow Radar Glyphs—Static Visualization of Unsteady Flow with Uncertainty",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011121949/13rRUxC0SOU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061396",
"title": "Smoke Surfaces: An Interactive Flow Visualization Technique Inspired by Real-World Flow Experiments",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061396/13rRUxYrbUx",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1735",
"title": "Generalized Streak Lines: Analysis and Visualization of Boundary Induced Vortices",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1735/13rRUxcbnCm",
"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": "trans/tg/2010/06/ttg2010061225",
"title": "Streak Lines as Tangent Curves of a Derived Vector Field",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061225/13rRUy0HYRl",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcs2012050072",
"articleId": "13rRUEgarFf",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcs2012050085",
"articleId": "13rRUxbTMt9",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxGAL8S",
"title": "January",
"year": "2006",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": "28",
"label": "January",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILc8g8",
"doi": "10.1109/TPAMI.2006.5",
"abstract": "An \"inconsistent” particle filter produces—in a statistical sense—larger estimation errors than predicted by the model on which the filter is based. Two test variables are introduced that allow the detection of inconsistent behavior. The statistical properties of the variables are analyzed. Experiments confirm their suitability for inconsistency detection.",
"abstracts": [
{
"abstractType": "Regular",
"content": "An \"inconsistent” particle filter produces—in a statistical sense—larger estimation errors than predicted by the model on which the filter is based. Two test variables are introduced that allow the detection of inconsistent behavior. The statistical properties of the variables are analyzed. Experiments confirm their suitability for inconsistency detection.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "An \"inconsistent” particle filter produces—in a statistical sense—larger estimation errors than predicted by the model on which the filter is based. Two test variables are introduced that allow the detection of inconsistent behavior. The statistical properties of the variables are analyzed. Experiments confirm their suitability for inconsistency detection.",
"title": "Consistency Checks for Particle Filters",
"normalizedTitle": "Consistency Checks for Particle Filters",
"fno": "i0140",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Index Terms Particle Filtering",
"Consistency Checks",
"Modeling Errors",
"Fault Detection",
"Model Validation"
],
"authors": [
{
"givenName": "F.",
"surname": "van der Heijden",
"fullName": "F. van der Heijden",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2006-01-01 00:00:00",
"pubType": "trans",
"pages": "140-145",
"year": "2006",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ase/2012/1204/0/2351738",
"title": "MaramaAI: tool support for capturing and managing consistency of multi-lingual requirements",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2012/2351738/12OmNAKuoVG",
"parentPublication": {
"id": "proceedings/ase/2012/1204/0",
"title": "2012 Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ncm/2008/3322/2/3322b244",
"title": "Applying Rough Sets to Maintain Data Consistency for High Degree Relations",
"doi": null,
"abstractUrl": "/proceedings-article/ncm/2008/3322b244/12OmNBB0bXh",
"parentPublication": {
"id": "proceedings/ncm/2008/3322/2",
"title": "Networked Computing and Advanced Information Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gcc/2008/3449/0/3449a589",
"title": "An Automated Negotiation Engine for Consistency of Access Policies in Grid",
"doi": null,
"abstractUrl": "/proceedings-article/gcc/2008/3449a589/12OmNBQC85S",
"parentPublication": {
"id": "proceedings/gcc/2008/3449/0",
"title": "2008 Seventh International Conference on Grid and Cooperative Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/skg/2009/3810/0/3810a448",
"title": "Consistency Checking for Semantic Link Network",
"doi": null,
"abstractUrl": "/proceedings-article/skg/2009/3810a448/12OmNCbCs1w",
"parentPublication": {
"id": "proceedings/skg/2009/3810/0",
"title": "Semantics, Knowledge and Grid, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gcis/2009/3571/2/3571b496",
"title": "The Uniformization and the Feature Selection about the Inconsistent Classification Data Set",
"doi": null,
"abstractUrl": "/proceedings-article/gcis/2009/3571b496/12OmNClQ0p2",
"parentPublication": {
"id": "proceedings/gcis/2009/3571/2",
"title": "2009 WRI Global Congress on Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2006/2832/0/28320292",
"title": "Incremental consistency checking for pervasive context",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2006/28320292/12OmNzmclJt",
"parentPublication": {
"id": "proceedings/icse/2006/2832/0",
"title": "Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nas/2008/3187/0/3187a089",
"title": "Adaptive Consistency Guarantees for Large-Scale Replicated Services",
"doi": null,
"abstractUrl": "/proceedings-article/nas/2008/3187a089/12OmNzvQI8q",
"parentPublication": {
"id": "proceedings/nas/2008/3187/0",
"title": "2008 International Conference on Networking, Architecture, and Storage",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/1999/06/k0896",
"title": "Data Consistency in Intermittently Connected Distributed Systems",
"doi": null,
"abstractUrl": "/journal/tk/1999/06/k0896/13rRUwdIOV2",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1997/11/e0722",
"title": "Visual and Textual Consistency Checking Tools for Graphical User Interfaces",
"doi": null,
"abstractUrl": "/journal/ts/1997/11/e0722/13rRUx0Pqr7",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/1991/02/l0223",
"title": "Consistency in Dataflow Graphs",
"doi": null,
"abstractUrl": "/journal/td/1991/02/l0223/13rRUxNW1Tn",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "i0135",
"articleId": "13rRUygT7ac",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0145",
"articleId": "13rRUNvgzaW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwDAC3C",
"title": "November",
"year": "2005",
"issueNum": "11",
"idPrefix": "tp",
"pubType": "journal",
"volume": "27",
"label": "November",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxlgxUp",
"doi": "10.1109/TPAMI.2005.223",
"abstract": "We describe a particle filter that effectively deals with interacting targets—targets that are influenced by the proximity and/or behavior of other targets. The particle filter includes a Markov random field (MRF) motion prior that helps maintain the identity of targets throughout an interaction, significantly reducing tracker failures. We show that this MRF prior can be easily implemented by including an additional interaction factor in the importance weights of the particle filter. However, the computational requirements of the resulting multitarget filter render it unusable for large numbers of targets. Consequently, we replace the traditional importance sampling step in the particle filter with a novel Markov chain Monte Carlo (MCMC) sampling step to obtain a more efficient MCMC-based multitarget filter. We also show how to extend this MCMC-based filter to address a variable number of interacting targets. Finally, we present both qualitative and quantitative experimental results, demonstrating that the resulting particle filters deal efficiently and effectively with complicated target interactions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We describe a particle filter that effectively deals with interacting targets—targets that are influenced by the proximity and/or behavior of other targets. The particle filter includes a Markov random field (MRF) motion prior that helps maintain the identity of targets throughout an interaction, significantly reducing tracker failures. We show that this MRF prior can be easily implemented by including an additional interaction factor in the importance weights of the particle filter. However, the computational requirements of the resulting multitarget filter render it unusable for large numbers of targets. Consequently, we replace the traditional importance sampling step in the particle filter with a novel Markov chain Monte Carlo (MCMC) sampling step to obtain a more efficient MCMC-based multitarget filter. We also show how to extend this MCMC-based filter to address a variable number of interacting targets. Finally, we present both qualitative and quantitative experimental results, demonstrating that the resulting particle filters deal efficiently and effectively with complicated target interactions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We describe a particle filter that effectively deals with interacting targets—targets that are influenced by the proximity and/or behavior of other targets. The particle filter includes a Markov random field (MRF) motion prior that helps maintain the identity of targets throughout an interaction, significantly reducing tracker failures. We show that this MRF prior can be easily implemented by including an additional interaction factor in the importance weights of the particle filter. However, the computational requirements of the resulting multitarget filter render it unusable for large numbers of targets. Consequently, we replace the traditional importance sampling step in the particle filter with a novel Markov chain Monte Carlo (MCMC) sampling step to obtain a more efficient MCMC-based multitarget filter. We also show how to extend this MCMC-based filter to address a variable number of interacting targets. Finally, we present both qualitative and quantitative experimental results, demonstrating that the resulting particle filters deal efficiently and effectively with complicated target interactions.",
"title": "MCMC-Based Particle Filtering for Tracking a Variable Number of Interacting Targets",
"normalizedTitle": "MCMC-Based Particle Filtering for Tracking a Variable Number of Interacting Targets",
"fno": "i1805",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Index Terms Particle Filters",
"Multitarget Tracking",
"Markov Random Fields",
"Markov Chain Monte Carlo"
],
"authors": [
{
"givenName": "Zia",
"surname": "Khan",
"fullName": "Zia Khan",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tucker",
"surname": "Balch",
"fullName": "Tucker Balch",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Frank",
"surname": "Dellaert",
"fullName": "Frank Dellaert",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2005-11-01 00:00:00",
"pubType": "trans",
"pages": "1805-1918",
"year": "2005",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2008/2174/0/04761045",
"title": "An MCMC-based particle filter for multiple person tracking",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761045/12OmNAio71c",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icece/2010/4031/0/4031b332",
"title": "Multitarget Tracking Before Detection via Probability Hypothesis Density Filter",
"doi": null,
"abstractUrl": "/proceedings-article/icece/2010/4031b332/12OmNBOCWqS",
"parentPublication": {
"id": "proceedings/icece/2010/4031/0",
"title": "Electrical and Control Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicic/2008/3161/0/31610494",
"title": "Adaptive MCMC Particle Filter for Nonlinear and Non-Gaussian State Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/icicic/2008/31610494/12OmNqFrGyM",
"parentPublication": {
"id": "proceedings/icicic/2008/3161/0",
"title": "Innovative Computing ,Information and Control, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fccm/2017/4037/0/07966637",
"title": "Communication-Aware MCMC Method for Big Data Applications on FPGAs",
"doi": null,
"abstractUrl": "/proceedings-article/fccm/2017/07966637/12OmNwJybTz",
"parentPublication": {
"id": "proceedings/fccm/2017/4037/0",
"title": "2017 IEEE 25th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccie/2010/4026/2/4026b441",
"title": "Tracking a Variable Number of Targets in Acoustic Sensor Networks by Particle Filter",
"doi": null,
"abstractUrl": "/proceedings-article/ccie/2010/4026b441/12OmNz61d36",
"parentPublication": {
"id": "proceedings/ccie/2010/4026/2",
"title": "Computing, Control and Industrial Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fccm/2013/4969/0/4969a181",
"title": "On Optimizing the Arithmetic Precision of MCMC Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/fccm/2013/4969a181/12OmNznCkZo",
"parentPublication": {
"id": "proceedings/fccm/2013/4969/0",
"title": "Field-Programmable Custom Computing Machines, Annual IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icctd/2009/3892/2/3892b320",
"title": "Simultaneous Detection and Tracking in Airborne Video",
"doi": null,
"abstractUrl": "/proceedings-article/icctd/2009/3892b320/12OmNzsJ7p0",
"parentPublication": {
"id": "proceedings/icctd/2009/3892/2",
"title": "Computer Technology and Development, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2006/12/i1960",
"title": "MCMC Data Association and Sparse Factorization Updating for Real Time Multitarget Tracking with Merged and Multiple Measurements",
"doi": null,
"abstractUrl": "/journal/tp/2006/12/i1960/13rRUxNW1UT",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/12/ttp2011122477",
"title": "Shape-Based Online Multitarget Tracking and Detection for Targets Causing Multiple Measurements: Variational Bayesian Clustering and Lossless Data Association",
"doi": null,
"abstractUrl": "/journal/tp/2011/12/ttp2011122477/13rRUxjQycZ",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "i1793",
"articleId": "13rRUxAAT2c",
"__typename": "AdjacentArticleType"
},
"next": null,
"__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": "13rRUEgs2BS",
"doi": "10.1109/TVCG.2010.146",
"abstract": "The concept of continuous scatterplot (CSP) is a modern visualization technique. The idea is to define a scalar density value based on the map between an n-dimensional spatial domain and an m-dimensional data domain, which describe the CSP space. Usually the data domain is two-dimensional to visually convey the underlying, density coded, data. In this paper we investigate kinds of map-based discontinuities, especially for the practical cases n = m = 2 and n = 3 | m = 2, and we depict relations between them and attributes of the resulting CSP itself. Additionally, we show that discontinuities build critical line structures, and we introduce algorithms to detect them. Further, we introduce a discontinuity-based visualization approach—called contribution map (CM)—which establishes a relationship between the CSP's data domain and the number of connected components in the spatial domain. We show that CMs enhance the CSP-based linking & brushing interaction. Finally, we apply our approaches to a number of synthetic as well as real data sets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The concept of continuous scatterplot (CSP) is a modern visualization technique. The idea is to define a scalar density value based on the map between an n-dimensional spatial domain and an m-dimensional data domain, which describe the CSP space. Usually the data domain is two-dimensional to visually convey the underlying, density coded, data. In this paper we investigate kinds of map-based discontinuities, especially for the practical cases n = m = 2 and n = 3 | m = 2, and we depict relations between them and attributes of the resulting CSP itself. Additionally, we show that discontinuities build critical line structures, and we introduce algorithms to detect them. Further, we introduce a discontinuity-based visualization approach—called contribution map (CM)—which establishes a relationship between the CSP's data domain and the number of connected components in the spatial domain. We show that CMs enhance the CSP-based linking & brushing interaction. Finally, we apply our approaches to a number of synthetic as well as real data sets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The concept of continuous scatterplot (CSP) is a modern visualization technique. The idea is to define a scalar density value based on the map between an n-dimensional spatial domain and an m-dimensional data domain, which describe the CSP space. Usually the data domain is two-dimensional to visually convey the underlying, density coded, data. In this paper we investigate kinds of map-based discontinuities, especially for the practical cases n = m = 2 and n = 3 | m = 2, and we depict relations between them and attributes of the resulting CSP itself. Additionally, we show that discontinuities build critical line structures, and we introduce algorithms to detect them. Further, we introduce a discontinuity-based visualization approach—called contribution map (CM)—which establishes a relationship between the CSP's data domain and the number of connected components in the spatial domain. We show that CMs enhance the CSP-based linking & brushing interaction. Finally, we apply our approaches to a number of synthetic as well as real data sets.",
"title": "Discontinuities in Continuous Scatter Plots",
"normalizedTitle": "Discontinuities in Continuous Scatter Plots",
"fno": "ttg2010061291",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Discontinuity",
"Scatterplot",
"Topology",
"Data Visualization"
],
"authors": [
{
"givenName": "Dirk J.",
"surname": "Lehmann",
"fullName": "Dirk J. Lehmann",
"affiliation": "University of Magdeburg",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Holger",
"surname": "Theisel",
"fullName": "Holger Theisel",
"affiliation": "University of Magdeburg",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2010-11-01 00:00:00",
"pubType": "trans",
"pages": "1291-1300",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2012/1226/0/233P2B32",
"title": "Video segmentation by tracing discontinuities in a trajectory embedding",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/233P2B32/12OmNAoDidR",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1990/2062/1/00118205",
"title": "Detection of depth and orientation discontinuities in range images using mathematical morphology",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1990/00118205/12OmNApu5fF",
"parentPublication": {
"id": "proceedings/icpr/1990/2062/1",
"title": "Proceedings 10th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2007/1630/0/04408996",
"title": "Variational Stereo Vision with Sharp Discontinuities and Occlusion Handling",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2007/04408996/12OmNC1GuhU",
"parentPublication": {
"id": "proceedings/iccv/2007/1630/0",
"title": "2007 11th IEEE International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ucc/2014/7881/0/7881a345",
"title": "Detecting Discontinuities in Large Scale Systems",
"doi": null,
"abstractUrl": "/proceedings-article/ucc/2014/7881a345/12OmNviHK9d",
"parentPublication": {
"id": "proceedings/ucc/2014/7881/0",
"title": "2014 IEEE/ACM 7th International Conference on Utility and Cloud Computing (UCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/09/ttg2013091526",
"title": "Splatterplots: Overcoming Overdraw in Scatter Plots",
"doi": null,
"abstractUrl": "/journal/tg/2013/09/ttg2013091526/13rRUxC0SEh",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1990/04/i0321",
"title": "Coping with Discontinuities in Computer Vision: Their Detection, Classification, and Measurement",
"doi": null,
"abstractUrl": "/journal/tp/1990/04/i0321/13rRUxDqS4Z",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011121912",
"title": "Features in Continuous Parallel Coordinates",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011121912/13rRUyYBlgy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061428",
"title": "Continuous Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061428/13rRUyYjK5e",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/06/08667672",
"title": "Relaxing Dense Scatter Plots with Pixel-Based Mappings",
"doi": null,
"abstractUrl": "/journal/tg/2019/06/08667672/18q6mW4N2ZW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a080",
"title": "Enhancing Scatter-plots with Start-plots for Visualising Multi-dimensional Data",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a080/1rSR9e3cPi8",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010061281",
"articleId": "13rRUynHuj5",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010061271",
"articleId": "13rRUx0gev4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgLS",
"name": "ttg2010061291s1.txt",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2010061291s1.txt",
"extension": "txt",
"size": "1.06 kB",
"__typename": "WebExtraType"
},
{
"id": "17ShDTXFgLT",
"name": "ttg2010061291s2.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2010061291s2.mov",
"extension": "mov",
"size": "12.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzmclnL",
"title": "November/December",
"year": "2006",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "12",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwkfAZ9",
"doi": "10.1109/TVCG.2006.99",
"abstract": "Abstract—The analysis and exploration of multidimensional and multivariate data is still one of the most challenging areas in the field of visualization. In this paper, we describe an approach to visual analysis of an especially challenging set of problems that exhibit a complex internal data structure. We describe the interactive visual exploration and analysis of data that includes several (usually large) families of function graphs f_i({\\bf{x}},t). We describe analysis procedures and practical aspects of the interactive visual analysis specific to this type of data (with emphasis on the function graph characteristic of the data). We adopted the well-proven approach of multiple, linked views with advanced interactive brushing to assess the data. Standard views such as histograms, scatterplots, and parallel coordinates are used to jointly visualize data. We support iterative visual analysis by providing means to create complex, composite brushes that span multiple views and that are constructed using different combination schemes. We demonstrate that engineering applications represent a challenging but very applicable area for visual analytics. As a case study, we describe the optimization of a fuel injection system in diesel engines of passenger cars. ",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—The analysis and exploration of multidimensional and multivariate data is still one of the most challenging areas in the field of visualization. In this paper, we describe an approach to visual analysis of an especially challenging set of problems that exhibit a complex internal data structure. We describe the interactive visual exploration and analysis of data that includes several (usually large) families of function graphs f_i({\\bf{x}},t). We describe analysis procedures and practical aspects of the interactive visual analysis specific to this type of data (with emphasis on the function graph characteristic of the data). We adopted the well-proven approach of multiple, linked views with advanced interactive brushing to assess the data. Standard views such as histograms, scatterplots, and parallel coordinates are used to jointly visualize data. We support iterative visual analysis by providing means to create complex, composite brushes that span multiple views and that are constructed using different combination schemes. We demonstrate that engineering applications represent a challenging but very applicable area for visual analytics. As a case study, we describe the optimization of a fuel injection system in diesel engines of passenger cars. ",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—The analysis and exploration of multidimensional and multivariate data is still one of the most challenging areas in the field of visualization. In this paper, we describe an approach to visual analysis of an especially challenging set of problems that exhibit a complex internal data structure. We describe the interactive visual exploration and analysis of data that includes several (usually large) families of function graphs f_i({\\bf{x}},t). We describe analysis procedures and practical aspects of the interactive visual analysis specific to this type of data (with emphasis on the function graph characteristic of the data). We adopted the well-proven approach of multiple, linked views with advanced interactive brushing to assess the data. Standard views such as histograms, scatterplots, and parallel coordinates are used to jointly visualize data. We support iterative visual analysis by providing means to create complex, composite brushes that span multiple views and that are constructed using different combination schemes. We demonstrate that engineering applications represent a challenging but very applicable area for visual analytics. As a case study, we describe the optimization of a fuel injection system in diesel engines of passenger cars. ",
"title": "Interactive Visual Analysis of Families of Function Graphs",
"normalizedTitle": "Interactive Visual Analysis of Families of Function Graphs",
"fno": "v1373",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visual Exploration",
"Composite Brushing",
"Linked Views",
"Time Series Data",
"Fuel Injection System"
],
"authors": [
{
"givenName": "Zolt?",
"surname": "Konyha",
"fullName": "Zolt? Konyha",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kresimir",
"surname": "Matkovic",
"fullName": "Kresimir Matkovic",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Denis",
"surname": "Gracanin",
"fullName": "Denis Gracanin",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mario",
"surname": "Jelovic",
"fullName": "Mario Jelovic",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Helwig",
"surname": "Hauser",
"fullName": "Helwig Hauser",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2006-11-01 00:00:00",
"pubType": "trans",
"pages": "1373-1385",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2006/2602/0/26020151",
"title": "Towards Ubiquitous Brushing for Information Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2006/26020151/12OmNBqMDzb",
"parentPublication": {
"id": "proceedings/iv/2006/2602/0",
"title": "Tenth International Conference on Information Visualisation (IV'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmv/2004/2179/0/21790049",
"title": "Interactive Focus+Context Visualization with Linked 2D/3D Scatterplots",
"doi": null,
"abstractUrl": "/proceedings-article/cmv/2004/21790049/12OmNBtl1vO",
"parentPublication": {
"id": "proceedings/cmv/2004/2179/0",
"title": "Proceedings. Second International Conference on Coordinated & Multiple Views in Exploratory Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2007/2900/0/29000059",
"title": "Color LinesView:AnApproach toVisualization of Families of Function Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2007/29000059/12OmNxXl5Ca",
"parentPublication": {
"id": "proceedings/iv/2007/2900/0",
"title": "2007 11th International Conference Information Visualization (IV '07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmv/2005/2396/0/23960054",
"title": "Interactive Visual Analysis of Multi-Parameter Families of Function Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/cmv/2005/23960054/12OmNyp9MkT",
"parentPublication": {
"id": "proceedings/cmv/2005/2396/0",
"title": "Proceedings. Third International Conference on Coordinated and Multiple Views in Exploratory Visualization (CMV 2005)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061351",
"title": "Interactive Visual Analysis of Complex Scientific Data as Families of Data Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061351/13rRUwbs1Sr",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2000/01/v0044",
"title": "Visual Discovery and Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2000/01/v0044/13rRUxASuG5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009060929",
"title": "Conjunctive Visual Forms",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009060929/13rRUxD9gXA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061436",
"title": "Extensions of Parallel Coordinates for Interactive Exploration of Large Multi-Timepoint Data Sets",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061436/13rRUxjQyp8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/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/2011/07/ttg2011070934",
"title": "Interactive Visual Analysis of Heterogeneous Scientific Data across an Interface",
"doi": null,
"abstractUrl": "/journal/tg/2011/07/ttg2011070934/13rRUy0HYRm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1363",
"articleId": "13rRUx0xPIs",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1386",
"articleId": "13rRUwcS1CP",
"__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": "13rRUxYIN41",
"doi": "10.1109/TVCG.2007.70576",
"abstract": "Although real-time interactive volume rendering is available even for very large data sets, this visualization method is used quite rarely in the clinical practice. We suspect this is because it is very complicated and time consuming to adjust the parameters to achieve meaningful results. The clinician has to take care of the appropriate viewpoint, zooming, transfer function setup, clipping planes and other parameters. Because of this, most often only 2D slices of the data set are examined. Our work introduces LiveSync, a new concept to synchronize 2D slice views and volumetric views of medical data sets. Through intuitive picking actions on the slice, the users define the anatomical structures they are interested in. The 3D volumetric view is updated automatically with the goal that the users are provided with expressive result images. To achieve this live synchronization we use a minimal set of derived information without the need for segmented data sets or data-specific pre-computations. The components we consider are the picked point, slice view zoom, patient orientation, viewpoint history, local object shape and visibility. We introduce deformed viewing spheres which encode the viewpoint quality for the components. A combination of these deformed viewing spheres is used to estimate a good viewpoint. Our system provides the physician with synchronized views which help to gain deeper insight into the medical data with minimal user interaction.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Although real-time interactive volume rendering is available even for very large data sets, this visualization method is used quite rarely in the clinical practice. We suspect this is because it is very complicated and time consuming to adjust the parameters to achieve meaningful results. The clinician has to take care of the appropriate viewpoint, zooming, transfer function setup, clipping planes and other parameters. Because of this, most often only 2D slices of the data set are examined. Our work introduces LiveSync, a new concept to synchronize 2D slice views and volumetric views of medical data sets. Through intuitive picking actions on the slice, the users define the anatomical structures they are interested in. The 3D volumetric view is updated automatically with the goal that the users are provided with expressive result images. To achieve this live synchronization we use a minimal set of derived information without the need for segmented data sets or data-specific pre-computations. The components we consider are the picked point, slice view zoom, patient orientation, viewpoint history, local object shape and visibility. We introduce deformed viewing spheres which encode the viewpoint quality for the components. A combination of these deformed viewing spheres is used to estimate a good viewpoint. Our system provides the physician with synchronized views which help to gain deeper insight into the medical data with minimal user interaction.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Although real-time interactive volume rendering is available even for very large data sets, this visualization method is used quite rarely in the clinical practice. We suspect this is because it is very complicated and time consuming to adjust the parameters to achieve meaningful results. The clinician has to take care of the appropriate viewpoint, zooming, transfer function setup, clipping planes and other parameters. Because of this, most often only 2D slices of the data set are examined. Our work introduces LiveSync, a new concept to synchronize 2D slice views and volumetric views of medical data sets. Through intuitive picking actions on the slice, the users define the anatomical structures they are interested in. The 3D volumetric view is updated automatically with the goal that the users are provided with expressive result images. To achieve this live synchronization we use a minimal set of derived information without the need for segmented data sets or data-specific pre-computations. The components we consider are the picked point, slice view zoom, patient orientation, viewpoint history, local object shape and visibility. We introduce deformed viewing spheres which encode the viewpoint quality for the components. A combination of these deformed viewing spheres is used to estimate a good viewpoint. Our system provides the physician with synchronized views which help to gain deeper insight into the medical data with minimal user interaction.",
"title": "LiveSync: Deformed Viewing Spheres for Knowledge-Based Navigation",
"normalizedTitle": "LiveSync: Deformed Viewing Spheres for Knowledge-Based Navigation",
"fno": "v1544",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Navigation",
"Interaction",
"Linked Views",
"Medical Visualization",
"Viewpoint Selection"
],
"authors": [
{
"givenName": "Peter",
"surname": "Kohlmann",
"fullName": "Peter Kohlmann",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefan",
"surname": "Bruckner",
"fullName": "Stefan Bruckner",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Armin",
"surname": "Kanitsar",
"fullName": "Armin Kanitsar",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eduard",
"surname": "Gröller",
"fullName": "Eduard Gröller",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2007-11-01 00:00:00",
"pubType": "trans",
"pages": "1544-1551",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2005/2766/0/27660062",
"title": "View Selection for Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660062/12OmNAkWvwQ",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmv/2004/2179/0/21790049",
"title": "Interactive Focus+Context Visualization with Linked 2D/3D Scatterplots",
"doi": null,
"abstractUrl": "/proceedings-article/cmv/2004/21790049/12OmNBtl1vO",
"parentPublication": {
"id": "proceedings/cmv/2004/2179/0",
"title": "Proceedings. Second International Conference on Coordinated & Multiple Views in Exploratory Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/edoc/2009/3785/0/3785a163",
"title": "Realizing Correspondences in Multi-viewpoint Specifications",
"doi": null,
"abstractUrl": "/proceedings-article/edoc/2009/3785a163/12OmNqFJhMw",
"parentPublication": {
"id": "proceedings/edoc/2009/3785/0",
"title": "2009 IEEE International Enterprise Distributed Object Computing Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660063",
"title": "A Feature-Driven Approach to Locating Optimal Viewpoints for Volume Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660063/12OmNqFrGFS",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/uksim/2012/4682/0/4682a165",
"title": "Feel3D: Free Viewpoint Video Recording Mechanism for Premeditated Scenarios, Using Pre-built Models",
"doi": null,
"abstractUrl": "/proceedings-article/uksim/2012/4682a165/12OmNqI04TB",
"parentPublication": {
"id": "proceedings/uksim/2012/4682/0",
"title": "Computer Modeling and Simulation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wicsa/2011/4351/0/4351a355",
"title": "SAVE: Software Architecture Environment for Modeling Views",
"doi": null,
"abstractUrl": "/proceedings-article/wicsa/2011/4351a355/12OmNscxj3W",
"parentPublication": {
"id": "proceedings/wicsa/2011/4351/0",
"title": "Software Architecture, Working IEEE/IFIP Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssiai/2000/0595/0/05950209",
"title": "Viewpoint Selection-A Classifier Independent Learning Approach",
"doi": null,
"abstractUrl": "/proceedings-article/ssiai/2000/05950209/12OmNwHz08o",
"parentPublication": {
"id": "proceedings/ssiai/2000/0595/0",
"title": "Image Analysis and Interpretation, IEEE Southwest Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1997/8183/2/81832566",
"title": "Interactive control of three dimensional viewing",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1997/81832566/12OmNxVlTKz",
"parentPublication": {
"id": "proceedings/icip/1997/8183/2",
"title": "Proceedings of International Conference on Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2005/01/k0024",
"title": "Selection of Views to Materialize in a Data Warehouse",
"doi": null,
"abstractUrl": "/journal/tk/2005/01/k0024/13rRUxC0SP8",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1991/12/e1253",
"title": "Requirements Validation Through Viewpoint Resolution",
"doi": null,
"abstractUrl": "/journal/ts/1991/12/e1253/13rRUxlgy5o",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "04376198",
"articleId": "13rRUxBa5x8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1552",
"articleId": "13rRUyoPSOZ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNARRYtd",
"title": "December",
"year": "2011",
"issueNum": "12",
"idPrefix": "tp",
"pubType": "journal",
"volume": "33",
"label": "December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwcAqrl",
"doi": "10.1109/TPAMI.2011.84",
"abstract": "Cluster ensembles have recently emerged as a powerful alternative to standard cluster analysis, aggregating several input data clusterings to generate a single output clustering, with improved robustness and stability. From the early work, these techniques held great promise; however, most of them generate the final solution based on incomplete information of a cluster ensemble. The underlying ensemble-information matrix reflects only cluster-data point relations, while those among clusters are generally overlooked. This paper presents a new link-based approach to improve the conventional matrix. It achieves this using the similarity between clusters that are estimated from a link network model of the ensemble. In particular, three new link-based algorithms are proposed for the underlying similarity assessment. The final clustering result is generated from the refined matrix using two different consensus functions of feature-based and graph-based partitioning. This approach is the first to address and explicitly employ the relationship between input partitions, which has not been emphasized by recent studies of matrix refinement. The effectiveness of the link-based approach is empirically demonstrated over 10 data sets (synthetic and real) and three benchmark evaluation measures. The results suggest the new approach is able to efficiently extract information embedded in the input clusterings, and regularly illustrate higher clustering quality in comparison to several state-of-the-art techniques.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Cluster ensembles have recently emerged as a powerful alternative to standard cluster analysis, aggregating several input data clusterings to generate a single output clustering, with improved robustness and stability. From the early work, these techniques held great promise; however, most of them generate the final solution based on incomplete information of a cluster ensemble. The underlying ensemble-information matrix reflects only cluster-data point relations, while those among clusters are generally overlooked. This paper presents a new link-based approach to improve the conventional matrix. It achieves this using the similarity between clusters that are estimated from a link network model of the ensemble. In particular, three new link-based algorithms are proposed for the underlying similarity assessment. The final clustering result is generated from the refined matrix using two different consensus functions of feature-based and graph-based partitioning. This approach is the first to address and explicitly employ the relationship between input partitions, which has not been emphasized by recent studies of matrix refinement. The effectiveness of the link-based approach is empirically demonstrated over 10 data sets (synthetic and real) and three benchmark evaluation measures. The results suggest the new approach is able to efficiently extract information embedded in the input clusterings, and regularly illustrate higher clustering quality in comparison to several state-of-the-art techniques.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Cluster ensembles have recently emerged as a powerful alternative to standard cluster analysis, aggregating several input data clusterings to generate a single output clustering, with improved robustness and stability. From the early work, these techniques held great promise; however, most of them generate the final solution based on incomplete information of a cluster ensemble. The underlying ensemble-information matrix reflects only cluster-data point relations, while those among clusters are generally overlooked. This paper presents a new link-based approach to improve the conventional matrix. It achieves this using the similarity between clusters that are estimated from a link network model of the ensemble. In particular, three new link-based algorithms are proposed for the underlying similarity assessment. The final clustering result is generated from the refined matrix using two different consensus functions of feature-based and graph-based partitioning. This approach is the first to address and explicitly employ the relationship between input partitions, which has not been emphasized by recent studies of matrix refinement. The effectiveness of the link-based approach is empirically demonstrated over 10 data sets (synthetic and real) and three benchmark evaluation measures. The results suggest the new approach is able to efficiently extract information embedded in the input clusterings, and regularly illustrate higher clustering quality in comparison to several state-of-the-art techniques.",
"title": "A Link-Based Approach to the Cluster Ensemble Problem",
"normalizedTitle": "A Link-Based Approach to the Cluster Ensemble Problem",
"fno": "ttp2011122396",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Clustering",
"Cluster Ensembles",
"Cluster Relations",
"Link Based Similarity",
"Data Mining"
],
"authors": [
{
"givenName": "Natthakan",
"surname": "Iam-On",
"fullName": "Natthakan Iam-On",
"affiliation": "Aberystwyth University, Aberystwyth",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tossapon",
"surname": "Boongoen",
"fullName": "Tossapon Boongoen",
"affiliation": "Royal Thai Air Force Academy, Thailand",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Simon",
"surname": "Garrett",
"fullName": "Simon Garrett",
"affiliation": "Aberystwyth University, Aberystwyth",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chris",
"surname": "Price",
"fullName": "Chris Price",
"affiliation": "Aberystwyth University, Aberystwyth",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2011-12-01 00:00:00",
"pubType": "trans",
"pages": "2396-2409",
"year": "2011",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bigcomp/2018/3649/0/364901a190",
"title": "Ensemble Clustering Using Maximum Relative Density Path",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2018/364901a190/12OmNAYGlxw",
"parentPublication": {
"id": "proceedings/bigcomp/2018/3649/0",
"title": "2018 IEEE International Conference on Big Data and Smart Computing (BigComp)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imsccs/2008/3430/0/3430a180",
"title": "A Fast Spectral Method to Solve Document Cluster Ensemble Problem",
"doi": null,
"abstractUrl": "/proceedings-article/imsccs/2008/3430a180/12OmNqJ8tbW",
"parentPublication": {
"id": "proceedings/imsccs/2008/3430/0",
"title": "Computer and Computational Sciences, International Multi-Symposiums on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/paciia/2008/3490/2/3490c003",
"title": "Distributed and Parallelled EM Algorithm for Distributed Cluster Ensemble",
"doi": null,
"abstractUrl": "/proceedings-article/paciia/2008/3490c003/12OmNrHSD2v",
"parentPublication": {
"id": "paciia/2008/3490/2",
"title": "Pacific-Asia Workshop on Computational Intelligence and Industrial Application, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cinc/2009/3645/1/3645a499",
"title": "Comparison of Cluster Ensembles Methods Based on Hierarchical Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/cinc/2009/3645a499/12OmNscOUeN",
"parentPublication": {
"id": "proceedings/cinc/2009/3645/1",
"title": "Computational Intelligence and Natural Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icycs/2008/3398/0/3398a808",
"title": "An Efficient Spectral Method for Document Cluster Ensemble",
"doi": null,
"abstractUrl": "/proceedings-article/icycs/2008/3398a808/12OmNwF0C9K",
"parentPublication": {
"id": "proceedings/icycs/2008/3398/0",
"title": "2008 9th International Conference for Young Computer Scientists",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2015/3854/0/07403717",
"title": "A multiplex-network based approach for clustering ensemble selection",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2015/07403717/12OmNwekjz5",
"parentPublication": {
"id": "proceedings/asonam/2015/3854/0",
"title": "2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2013/5108/0/5108a627",
"title": "Weighted-Object Ensemble Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2013/5108a627/12OmNwxlrdZ",
"parentPublication": {
"id": "proceedings/icdm/2013/5108/0",
"title": "2013 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061444",
"title": "Vectorized Radviz and Its Application to Multiple Cluster Datasets",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061444/13rRUxAASSY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2012/03/ttk2012030413",
"title": "A Link-Based Cluster Ensemble Approach for Categorical Data Clustering",
"doi": null,
"abstractUrl": "/journal/tk/2012/03/ttk2012030413/13rRUxlgxWU",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2019/08/08438893",
"title": "An Information-Theoretical Framework for Cluster Ensemble",
"doi": null,
"abstractUrl": "/journal/tk/2019/08/08438893/13rRUytF41Z",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2011122383",
"articleId": "13rRUwInvmb",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2011122410",
"articleId": "13rRUwvBy9X",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyKJia1",
"title": "December",
"year": "2005",
"issueNum": "12",
"idPrefix": "tp",
"pubType": "journal",
"volume": "27",
"label": "December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjXZKE",
"doi": "10.1109/TPAMI.2005.237",
"abstract": "Clustering ensembles have emerged as a powerful method for improving both the robustness as well as the stability of unsupervised classification solutions. However, finding a consensus clustering from multiple partitions is a difficult problem that can be approached from graph-based, combinatorial, or statistical perspectives. This study extends previous research on clustering ensembles in several respects. First, we introduce a unified representation for multiple clusterings and formulate the corresponding categorical clustering problem. Second, we propose a probabilistic model of consensus using a finite mixture of multinomial distributions in a space of clusterings. A combined partition is found as a solution to the corresponding maximum-likelihood problem using the EM algorithm. Third, we define a new consensus function that is related to the classical intraclass variance criterion using the generalized mutual information definition. Finally, we demonstrate the efficacy of combining partitions generated by weak clustering algorithms that use data projections and random data splits. A simple explanatory model is offered for the behavior of combinations of such weak clustering components. Combination accuracy is analyzed as a function of several parameters that control the power and resolution of component partitions as well as the number of partitions. We also analyze clustering ensembles with incomplete information and the effect of missing cluster labels on the quality of overall consensus. Experimental results demonstrate the effectiveness of the proposed methods on several real-world data sets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Clustering ensembles have emerged as a powerful method for improving both the robustness as well as the stability of unsupervised classification solutions. However, finding a consensus clustering from multiple partitions is a difficult problem that can be approached from graph-based, combinatorial, or statistical perspectives. This study extends previous research on clustering ensembles in several respects. First, we introduce a unified representation for multiple clusterings and formulate the corresponding categorical clustering problem. Second, we propose a probabilistic model of consensus using a finite mixture of multinomial distributions in a space of clusterings. A combined partition is found as a solution to the corresponding maximum-likelihood problem using the EM algorithm. Third, we define a new consensus function that is related to the classical intraclass variance criterion using the generalized mutual information definition. Finally, we demonstrate the efficacy of combining partitions generated by weak clustering algorithms that use data projections and random data splits. A simple explanatory model is offered for the behavior of combinations of such weak clustering components. Combination accuracy is analyzed as a function of several parameters that control the power and resolution of component partitions as well as the number of partitions. We also analyze clustering ensembles with incomplete information and the effect of missing cluster labels on the quality of overall consensus. Experimental results demonstrate the effectiveness of the proposed methods on several real-world data sets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Clustering ensembles have emerged as a powerful method for improving both the robustness as well as the stability of unsupervised classification solutions. However, finding a consensus clustering from multiple partitions is a difficult problem that can be approached from graph-based, combinatorial, or statistical perspectives. This study extends previous research on clustering ensembles in several respects. First, we introduce a unified representation for multiple clusterings and formulate the corresponding categorical clustering problem. Second, we propose a probabilistic model of consensus using a finite mixture of multinomial distributions in a space of clusterings. A combined partition is found as a solution to the corresponding maximum-likelihood problem using the EM algorithm. Third, we define a new consensus function that is related to the classical intraclass variance criterion using the generalized mutual information definition. Finally, we demonstrate the efficacy of combining partitions generated by weak clustering algorithms that use data projections and random data splits. A simple explanatory model is offered for the behavior of combinations of such weak clustering components. Combination accuracy is analyzed as a function of several parameters that control the power and resolution of component partitions as well as the number of partitions. We also analyze clustering ensembles with incomplete information and the effect of missing cluster labels on the quality of overall consensus. Experimental results demonstrate the effectiveness of the proposed methods on several real-world data sets.",
"title": "Clustering Ensembles: Models of Consensus and Weak Partitions",
"normalizedTitle": "Clustering Ensembles: Models of Consensus and Weak Partitions",
"fno": "i1866",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Index Terms Clustering",
"Ensembles",
"Multiple Classifier Systems",
"Consensus Function",
"Mutual Information"
],
"authors": [
{
"givenName": "Alexander",
"surname": "Topchy",
"fullName": "Alexander Topchy",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anil K.",
"surname": "Jain",
"fullName": "Anil K. Jain",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "William",
"surname": "Punch",
"fullName": "William Punch",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2005-12-01 00:00:00",
"pubType": "trans",
"pages": "1866-1881",
"year": "2005",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2007/3018/0/30180607",
"title": "Consensus Clusterings",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2007/30180607/12OmNAYoKq7",
"parentPublication": {
"id": "proceedings/icdm/2007/3018/0",
"title": "Seventh IEEE International Conference on Data Mining (ICDM 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2009/3895/0/3895a794",
"title": "Projective Clustering Ensembles",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2009/3895a794/12OmNAsBFMg",
"parentPublication": {
"id": "proceedings/icdm/2009/3895/0",
"title": "2009 Ninth IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ic3/2014/5172/0/06897160",
"title": "Leveraging frequency and diversity based ensemble selection to consensus clustering",
"doi": null,
"abstractUrl": "/proceedings-article/ic3/2014/06897160/12OmNBDQbnv",
"parentPublication": {
"id": "proceedings/ic3/2014/5172/0",
"title": "2014 Seventh International Conference on Contemporary Computing (IC3)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cinc/2009/3645/1/3645a499",
"title": "Comparison of Cluster Ensembles Methods Based on Hierarchical Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/cinc/2009/3645a499/12OmNscOUeN",
"parentPublication": {
"id": "proceedings/cinc/2009/3645/1",
"title": "Computational Intelligence and Natural Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbrn/2010/4210/0/4210a067",
"title": "Local Feature Selection for Generation of Ensembles in Text Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/sbrn/2010/4210a067/12OmNwHhoP0",
"parentPublication": {
"id": "proceedings/sbrn/2010/4210/0",
"title": "Neural Networks, Brazilian Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2004/2128/1/212810272",
"title": "Adaptive Clustering Ensembles",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2004/212810272/12OmNy6Zs3c",
"parentPublication": {
"id": "proceedings/icpr/2004/2128/1",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itng/2010/3984/0/3984a227",
"title": "Improving of Initial Clusters Fitness in Genetic Guided-Clustering Ensembles",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2010/3984a227/12OmNyeECxT",
"parentPublication": {
"id": "proceedings/itng/2010/3984/0",
"title": "Information Technology: New Generations, Third International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asap/2007/1026/0/04429975",
"title": "Clustering ensembles using genetic algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/asap/2007/04429975/12OmNzJbQWF",
"parentPublication": {
"id": "proceedings/asap/2007/1026/0",
"title": "2007 IEEE International Conf. on Application-specific Systems, Architectures and Processors (ASAP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2008/01/ttp2008010160",
"title": "Cumulative Voting Consensus Method for Partitions with Variable Number of Clusters",
"doi": null,
"abstractUrl": "/journal/tp/2008/01/ttp2008010160/13rRUwI5TYD",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/04/08840892",
"title": "Co-Clustering Ensembles Based on Multiple Relevance Measures",
"doi": null,
"abstractUrl": "/journal/tk/2021/04/08840892/1doNtAM3fri",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "i1856",
"articleId": "13rRUxC0SPy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i1882",
"articleId": "13rRUNvgzjr",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwNwzN7",
"title": "March",
"year": "2012",
"issueNum": "03",
"idPrefix": "tk",
"pubType": "journal",
"volume": "24",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxlgxWU",
"doi": "10.1109/TKDE.2010.268",
"abstract": "Although attempts have been made to solve the problem of clustering categorical data via cluster ensembles, with the results being competitive to conventional algorithms, it is observed that these techniques unfortunately generate a final data partition based on incomplete information. The underlying ensemble-information matrix presents only cluster-data point relations, with many entries being left unknown. The paper presents an analysis that suggests this problem degrades the quality of the clustering result, and it presents a new link-based approach, which improves the conventional matrix by discovering unknown entries through similarity between clusters in an ensemble. In particular, an efficient link-based algorithm is proposed for the underlying similarity assessment. Afterward, to obtain the final clustering result, a graph partitioning technique is applied to a weighted bipartite graph that is formulated from the refined matrix. Experimental results on multiple real data sets suggest that the proposed link-based method almost always outperforms both conventional clustering algorithms for categorical data and well-known cluster ensemble techniques.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Although attempts have been made to solve the problem of clustering categorical data via cluster ensembles, with the results being competitive to conventional algorithms, it is observed that these techniques unfortunately generate a final data partition based on incomplete information. The underlying ensemble-information matrix presents only cluster-data point relations, with many entries being left unknown. The paper presents an analysis that suggests this problem degrades the quality of the clustering result, and it presents a new link-based approach, which improves the conventional matrix by discovering unknown entries through similarity between clusters in an ensemble. In particular, an efficient link-based algorithm is proposed for the underlying similarity assessment. Afterward, to obtain the final clustering result, a graph partitioning technique is applied to a weighted bipartite graph that is formulated from the refined matrix. Experimental results on multiple real data sets suggest that the proposed link-based method almost always outperforms both conventional clustering algorithms for categorical data and well-known cluster ensemble techniques.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Although attempts have been made to solve the problem of clustering categorical data via cluster ensembles, with the results being competitive to conventional algorithms, it is observed that these techniques unfortunately generate a final data partition based on incomplete information. The underlying ensemble-information matrix presents only cluster-data point relations, with many entries being left unknown. The paper presents an analysis that suggests this problem degrades the quality of the clustering result, and it presents a new link-based approach, which improves the conventional matrix by discovering unknown entries through similarity between clusters in an ensemble. In particular, an efficient link-based algorithm is proposed for the underlying similarity assessment. Afterward, to obtain the final clustering result, a graph partitioning technique is applied to a weighted bipartite graph that is formulated from the refined matrix. Experimental results on multiple real data sets suggest that the proposed link-based method almost always outperforms both conventional clustering algorithms for categorical data and well-known cluster ensemble techniques.",
"title": "A Link-Based Cluster Ensemble Approach for Categorical Data Clustering",
"normalizedTitle": "A Link-Based Cluster Ensemble Approach for Categorical Data Clustering",
"fno": "ttk2012030413",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Clustering",
"Categorical Data",
"Cluster Ensembles",
"Link Based Similarity",
"Data Mining"
],
"authors": [
{
"givenName": "Natthakan",
"surname": "Iam-On",
"fullName": "Natthakan Iam-On",
"affiliation": "Mae Fah Luang University, Muang",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tossapon",
"surname": "Boongoen",
"fullName": "Tossapon Boongoen",
"affiliation": "Royal Thai Air Force Academy, Saimai",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Simon",
"surname": "Garrett",
"fullName": "Simon Garrett",
"affiliation": "Aispire Consulting Ltd., Aberystwyth",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chris",
"surname": "Price",
"fullName": "Chris Price",
"affiliation": "Aberystwyth University, Aberystwyth",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2012-03-01 00:00:00",
"pubType": "trans",
"pages": "413-425",
"year": "2012",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bife/2009/3705/0/3705a170",
"title": "Fuzzy Clustering Ensemble Algorithm for Partitioning Categorical Data",
"doi": null,
"abstractUrl": "/proceedings-article/bife/2009/3705a170/12OmNAoUTrW",
"parentPublication": {
"id": "proceedings/bife/2009/3705/0",
"title": "2009 International Conference on Business Intelligence and Financial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cinc/2009/3645/1/3645a499",
"title": "Comparison of Cluster Ensembles Methods Based on Hierarchical Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/cinc/2009/3645a499/12OmNscOUeN",
"parentPublication": {
"id": "proceedings/cinc/2009/3645/1",
"title": "Computational Intelligence and Natural Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aici/2010/4225/2/4225b137",
"title": "Adjust and Explain the Clustering Results of Categorical Data",
"doi": null,
"abstractUrl": "/proceedings-article/aici/2010/4225b137/12OmNvpw7eA",
"parentPublication": {
"id": "proceedings/aici/2010/4225/2",
"title": "Artificial Intelligence and Computational Intelligence, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccea/2010/3982/2/3982b365",
"title": "A Hierarchical Clustering Algorithm for Categorical Attributes",
"doi": null,
"abstractUrl": "/proceedings-article/iccea/2010/3982b365/12OmNvzJG2A",
"parentPublication": {
"id": "proceedings/iccea/2010/3982/2",
"title": "Computer Engineering and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icycs/2008/3398/0/3398a808",
"title": "An Efficient Spectral Method for Document Cluster Ensemble",
"doi": null,
"abstractUrl": "/proceedings-article/icycs/2008/3398a808/12OmNwF0C9K",
"parentPublication": {
"id": "proceedings/icycs/2008/3398/0",
"title": "2008 9th International Conference for Young Computer Scientists",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbrn/2010/4210/0/4210a067",
"title": "Local Feature Selection for Generation of Ensembles in Text Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/sbrn/2010/4210a067/12OmNwHhoP0",
"parentPublication": {
"id": "proceedings/sbrn/2010/4210/0",
"title": "Neural Networks, Brazilian Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2011/4408/0/4408a854",
"title": "A New Markov Model for Clustering Categorical Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2011/4408a854/12OmNxFJXPI",
"parentPublication": {
"id": "proceedings/icdm/2011/4408/0",
"title": "2011 IEEE 11th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccit/2008/3407/1/3407a599",
"title": "Clustering Categorical Data Based on Representatives",
"doi": null,
"abstractUrl": "/proceedings-article/iccit/2008/3407a599/12OmNxFaLCz",
"parentPublication": {
"id": "iccit/2008/3407/1",
"title": "Convergence Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2010/3962/1/3962a032",
"title": "A Cluster Description Method for High Dimensional Data Clustering with Categorical Variables",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2010/3962a032/12OmNxTmHM8",
"parentPublication": {
"id": "proceedings/icmtma/2010/3962/1",
"title": "2010 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/12/ttp2011122396",
"title": "A Link-Based Approach to the Cluster Ensemble Problem",
"doi": null,
"abstractUrl": "/journal/tp/2011/12/ttp2011122396/13rRUwcAqrl",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttk2012030399",
"articleId": "13rRUwI5TRv",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttk2012030426",
"articleId": "13rRUy0HYRS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRTK",
"name": "ttk2012030413s.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttk2012030413s.pdf",
"extension": "pdf",
"size": "851 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1HMOit1lSk8",
"title": "Dec.",
"year": "2022",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1w7aiGb9noI",
"doi": "10.1109/TVCG.2021.3104879",
"abstract": "RadViz contributes to multidimensional analysis by using 2D points for encoding data elements and interpreting them along the original data dimensions. For these characteristics it is used in different application domains, like clustering, anomaly detection, and software visualization. However, it is likely that using the dimension arrangement that comes with the data will produce a plot that leads users to make inaccurate conclusions about points values and data distribution. This article attacks this problem without altering the original RadViz design: It defines, for both a single point and a set of points, the metric of <italic>effectiveness error</italic>, and uses it to define the objective function of a dimension arrangement strategy, arguing that minimizing it increases the overall RadViz <italic>visual quality</italic>. This article investigated the intuition that reducing the effectiveness error is beneficial for other well-known RadViz problems, like points clumping toward the center, many-to-one plotting of non-proportional points, and cluster separation. It presents an algorithm that reduces to zero the effectiveness error for a single point and a heuristic that approximates the dimension arrangement minimizing the effectiveness error for an arbitrary set of points. A set of experiments based on 21 real datasets has been performed, with the goals of analyzing the advantages of reducing the effectiveness error, comparing the proposed dimension arrangement strategy with other related proposals, and investigating the heuristic accuracy. The Effectiveness Error metric, the algorithm, and the heuristic presented in this article have been made available in a <italic>d3.js</italic> plugin at <uri>https://aware-diag-sapienza.github.io/d3-radviz</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "RadViz contributes to multidimensional analysis by using 2D points for encoding data elements and interpreting them along the original data dimensions. For these characteristics it is used in different application domains, like clustering, anomaly detection, and software visualization. However, it is likely that using the dimension arrangement that comes with the data will produce a plot that leads users to make inaccurate conclusions about points values and data distribution. This article attacks this problem without altering the original RadViz design: It defines, for both a single point and a set of points, the metric of <italic>effectiveness error</italic>, and uses it to define the objective function of a dimension arrangement strategy, arguing that minimizing it increases the overall RadViz <italic>visual quality</italic>. This article investigated the intuition that reducing the effectiveness error is beneficial for other well-known RadViz problems, like points clumping toward the center, many-to-one plotting of non-proportional points, and cluster separation. It presents an algorithm that reduces to zero the effectiveness error for a single point and a heuristic that approximates the dimension arrangement minimizing the effectiveness error for an arbitrary set of points. A set of experiments based on 21 real datasets has been performed, with the goals of analyzing the advantages of reducing the effectiveness error, comparing the proposed dimension arrangement strategy with other related proposals, and investigating the heuristic accuracy. The Effectiveness Error metric, the algorithm, and the heuristic presented in this article have been made available in a <italic>d3.js</italic> plugin at <uri>https://aware-diag-sapienza.github.io/d3-radviz</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "RadViz contributes to multidimensional analysis by using 2D points for encoding data elements and interpreting them along the original data dimensions. For these characteristics it is used in different application domains, like clustering, anomaly detection, and software visualization. However, it is likely that using the dimension arrangement that comes with the data will produce a plot that leads users to make inaccurate conclusions about points values and data distribution. This article attacks this problem without altering the original RadViz design: It defines, for both a single point and a set of points, the metric of effectiveness error, and uses it to define the objective function of a dimension arrangement strategy, arguing that minimizing it increases the overall RadViz visual quality. This article investigated the intuition that reducing the effectiveness error is beneficial for other well-known RadViz problems, like points clumping toward the center, many-to-one plotting of non-proportional points, and cluster separation. It presents an algorithm that reduces to zero the effectiveness error for a single point and a heuristic that approximates the dimension arrangement minimizing the effectiveness error for an arbitrary set of points. A set of experiments based on 21 real datasets has been performed, with the goals of analyzing the advantages of reducing the effectiveness error, comparing the proposed dimension arrangement strategy with other related proposals, and investigating the heuristic accuracy. The Effectiveness Error metric, the algorithm, and the heuristic presented in this article have been made available in a d3.js plugin at https://aware-diag-sapienza.github.io/d3-radviz.",
"title": "Effectiveness Error: Measuring and Improving RadViz Visual Effectiveness",
"normalizedTitle": "Effectiveness Error: Measuring and Improving RadViz Visual Effectiveness",
"fno": "09514468",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Mining",
"Data Visualisation",
"Data Dimensions",
"Data Elements",
"Dimension Arrangement Strategy",
"Effectiveness Error Metric",
"Improving Rad Viz Visual Effectiveness",
"Nonproportional Points",
"Original Rad Viz Design",
"Points Values",
"Rad Viz Visual Quality",
"Visualization",
"Linear Programming",
"Image Color Analysis",
"Heuristic Algorithms",
"Statistical Analysis",
"Measurement",
"Dimensionality Reduction",
"Rad Viz",
"Dimension Arrangement",
"Visual Quality Metrics"
],
"authors": [
{
"givenName": "Marco",
"surname": "Angelini",
"fullName": "Marco Angelini",
"affiliation": "Sapienza University of Rome, Rome, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Graziano",
"surname": "Blasilli",
"fullName": "Graziano Blasilli",
"affiliation": "Sapienza University of Rome, Rome, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Simone",
"surname": "Lenti",
"fullName": "Simone Lenti",
"affiliation": "Sapienza University of Rome, Rome, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alessia",
"surname": "Palleschi",
"fullName": "Alessia Palleschi",
"affiliation": "Sapienza University of Rome, Rome, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Giuseppe",
"surname": "Santucci",
"fullName": "Giuseppe Santucci",
"affiliation": "Sapienza University of Rome, Rome, Italy",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "4770-4786",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icse/2008/4486/0/04814146",
"title": "Sufficient mutation operators for measuring test effectiveness",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2008/04814146/12OmNAZx8Nc",
"parentPublication": {
"id": "proceedings/icse/2008/4486/0",
"title": "2008 ACM/IEEE 30th International Conference on Software Engineering. ICSE'08",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2010/3962/2/3962c133",
"title": "Error Separation and Compensation of Inductosyn Angle Measuring System",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2010/3962c133/12OmNAnuTD2",
"parentPublication": {
"id": "proceedings/icmtma/2010/3962/2",
"title": "2010 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1992/2920/0/00201953",
"title": "An algorithm for the optimum piecewise linear approximation of digitized curves",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1992/00201953/12OmNqyUUrV",
"parentPublication": {
"id": "proceedings/icpr/1992/2920/0",
"title": "11th IAPR International Conference on Pattern Recognition. Vol. III. Conference C: Image, Speech and Signal Analysis,",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2015/8660/0/8660a211",
"title": "A Method of Circle Curve Fitting Based on the Cumulative Error of the Radius Error",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2015/8660a211/12OmNviZllu",
"parentPublication": {
"id": "proceedings/cis/2015/8660/0",
"title": "2015 11th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2018/2666/1/266601a980",
"title": "Improving the Effectiveness of SQL Learning Practice: A Data-Driven Approach",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2018/266601a980/144U9bx2KPp",
"parentPublication": {
"id": "proceedings/compsac/2018/2666/2",
"title": "2018 IEEE 42nd Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wcmeim/2021/2172/0/217200a283",
"title": "Research on thermal error measuring point optimization and modeling of machine tool spindle",
"doi": null,
"abstractUrl": "/proceedings-article/wcmeim/2021/217200a283/1ANLyuYWvOU",
"parentPublication": {
"id": "proceedings/wcmeim/2021/2172/0",
"title": "2021 4th World Conference on Mechanical Engineering and Intelligent Manufacturing (WCMEIM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903341",
"title": "BeauVis: A Validated Scale for Measuring the Aesthetic Pleasure of Visual Representations",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903341/1GZonh0vssw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933775",
"title": "Towards Enhancing RadViz Analysis and Interpretation",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933775/1fTgFDJpiq4",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/01/09288929",
"title": "Exploiting Symmetrization and D-Reducibility for Approximate Logic Synthesis",
"doi": null,
"abstractUrl": "/journal/tc/2022/01/09288929/1pq6fPiylOw",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/05/09466430",
"title": "An Approach of Epistasis Detection Using Integer Linear Programming Optimizing Bayesian Network",
"doi": null,
"abstractUrl": "/journal/tb/2022/05/09466430/1uOtyyGeDa8",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09511808",
"articleId": "1vYRHccYKDS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09516987",
"articleId": "1watWKQVFM4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1HMOwc5B0Xe",
"name": "ttg202212-09514468s1-supp2-3104879.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202212-09514468s1-supp2-3104879.mp4",
"extension": "mp4",
"size": "114 MB",
"__typename": "WebExtraType"
},
{
"id": "1HMOx64PCCc",
"name": "ttg202212-09514468s1-supp1-3104879.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202212-09514468s1-supp1-3104879.pdf",
"extension": "pdf",
"size": "527 kB",
"__typename": "WebExtraType"
}
],
"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": "13rRUwInvAW",
"doi": "10.1109/TVCG.2008.168",
"abstract": "In this paper we introduce a technique for applying textual labels to 3D surfaces. An effective labeling must balance the conflicting goals of conveying the shape of the surface while being legible from a range of viewing directions. Shape can be conveyed by placing the text as a texture directly on the surface, providing shape cues, meaningful landmarks and minimally obstructing the rest of the model. But rendering such surface text is problematic both in regions of high curvature, where text would be warped, and in highly occluded regions, where it would be hidden. Our approach achieves both labeling goals by applying surface labels to a ’text scaffold’, a surface explicitly constructed to hold the labels. Text scaffolds conform to the underlying surface whenever possible, but can also float above problem regions, allowing them to be smooth while still conveying the overall shape. This paper provides methods for constructing scaffolds from a variety of input sources, including meshes, constructive solid geometry, and scalar fields. These sources are first mapped into a distance transform, which is then filtered and used to construct a new mesh on which labels are either manually or automatically placed. In the latter case, annotated regions of the input surface are associated with proximal regions on the new mesh, and labels placed using cartographic principles.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper we introduce a technique for applying textual labels to 3D surfaces. An effective labeling must balance the conflicting goals of conveying the shape of the surface while being legible from a range of viewing directions. Shape can be conveyed by placing the text as a texture directly on the surface, providing shape cues, meaningful landmarks and minimally obstructing the rest of the model. But rendering such surface text is problematic both in regions of high curvature, where text would be warped, and in highly occluded regions, where it would be hidden. Our approach achieves both labeling goals by applying surface labels to a ’text scaffold’, a surface explicitly constructed to hold the labels. Text scaffolds conform to the underlying surface whenever possible, but can also float above problem regions, allowing them to be smooth while still conveying the overall shape. This paper provides methods for constructing scaffolds from a variety of input sources, including meshes, constructive solid geometry, and scalar fields. These sources are first mapped into a distance transform, which is then filtered and used to construct a new mesh on which labels are either manually or automatically placed. In the latter case, annotated regions of the input surface are associated with proximal regions on the new mesh, and labels placed using cartographic principles.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper we introduce a technique for applying textual labels to 3D surfaces. An effective labeling must balance the conflicting goals of conveying the shape of the surface while being legible from a range of viewing directions. Shape can be conveyed by placing the text as a texture directly on the surface, providing shape cues, meaningful landmarks and minimally obstructing the rest of the model. But rendering such surface text is problematic both in regions of high curvature, where text would be warped, and in highly occluded regions, where it would be hidden. Our approach achieves both labeling goals by applying surface labels to a ’text scaffold’, a surface explicitly constructed to hold the labels. Text scaffolds conform to the underlying surface whenever possible, but can also float above problem regions, allowing them to be smooth while still conveying the overall shape. This paper provides methods for constructing scaffolds from a variety of input sources, including meshes, constructive solid geometry, and scalar fields. These sources are first mapped into a distance transform, which is then filtered and used to construct a new mesh on which labels are either manually or automatically placed. In the latter case, annotated regions of the input surface are associated with proximal regions on the new mesh, and labels placed using cartographic principles.",
"title": "Text Scaffolds for Effective Surface Labeling",
"normalizedTitle": "Text Scaffolds for Effective Surface Labeling",
"fno": "ttg2008061675",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Surface Labeling",
"Computational Cartography",
"Text Authoring",
"Annotation"
],
"authors": [
{
"givenName": "Gregory",
"surname": "Cipriano",
"fullName": "Gregory Cipriano",
"affiliation": "University of Wisconsin-Madison",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Gleicher",
"fullName": "Michael Gleicher",
"affiliation": "University of Wisconsin-Madison",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1675-1682",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2017/0457/0/0457g269",
"title": "Indoor Scene Parsing with Instance Segmentation, Semantic Labeling and Support Relationship Inference",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457g269/12OmNAq3hLV",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2015/1805/0/07333961",
"title": "Efficient indexing for Query By String text retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2015/07333961/12OmNBTJIxh",
"parentPublication": {
"id": "proceedings/icdar/2015/1805/0",
"title": "2015 13th International Conference on Document Analysis and Recognition (ICDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2000/0750/1/07501734",
"title": "Segmentation and Surface Characterization of Arbitrary 3D Meshes for Object Reconstruction and Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2000/07501734/12OmNBTawqo",
"parentPublication": {
"id": "proceedings/icpr/2000/0750/1",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109d983",
"title": "Scene Text Extraction with Edge Constraint and Text Collinearity",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109d983/12OmNCctffX",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2009/3725/0/3725a951",
"title": "A Tool for Ground-Truthing Text Lines and Characters in Off-Line Handwritten Chinese Documents",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2009/3725a951/12OmNwE9Osv",
"parentPublication": {
"id": "proceedings/icdar/2009/3725/0",
"title": "2009 10th International Conference on Document Analysis and Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/das/2016/1792/0/1792a352",
"title": "Effective Candidate Component Extraction for Text Localization in Born-Digital Images by Combining Text Contours and Stroke Interior Regions",
"doi": null,
"abstractUrl": "/proceedings-article/das/2016/1792a352/12OmNy7h3c8",
"parentPublication": {
"id": "proceedings/das/2016/1792/0",
"title": "2016 12th IAPR Workshop on Document Analysis Systems (DAS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061237",
"title": "Particle-based labeling: Fast point-feature labeling without obscuring other visual features",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061237/13rRUwbaqUM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061531",
"title": "Smooth Surface Extraction from Unstructured Point-based Volume Data Using PDEs",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061531/13rRUwh80uu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2006/02/i0328",
"title": "Implicit Meshes for Surface Reconstruction",
"doi": null,
"abstractUrl": "/journal/tp/2006/02/i0328/13rRUygT7o3",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061667",
"articleId": "13rRUwh80H7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061683",
"articleId": "13rRUygT7sw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgDw",
"name": "ttg2008061675.mpg",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2008061675.mpg",
"extension": "mpg",
"size": "30.9 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUwwJWFJ",
"doi": "10.1109/TVCG.2008.129",
"abstract": "Data transformation, the process of preparing raw data for effective visualization, is one of the key challenges in information visualization. Although researchers have developed many data transformation techniques, there is little empirical study of the general impact of data transformation on visualization. Without such study, it is difficult to systematically decide when and which data transformation techniques are needed. We thus have designed and conducted a two-part empirical study that examines how the use of common data transformation techniques impacts visualization quality, which in turn affects user task performance. Our first experiment studies the impact of data transformation on user performance in single-step, typical visual analytic tasks. The second experiment assesses the impact of data transformation in multi-step analytic tasks. Our results quantify the benefits of data transformation in both experiments. More importantly, our analyses reveal that (1) the benefits of data transformation vary significantly by task and by visualization, and (2) the use of data transformation depends on a user’s interaction context. Based on our findings, we present a set of design recommendations that help guide the development and use of data transformation techniques.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Data transformation, the process of preparing raw data for effective visualization, is one of the key challenges in information visualization. Although researchers have developed many data transformation techniques, there is little empirical study of the general impact of data transformation on visualization. Without such study, it is difficult to systematically decide when and which data transformation techniques are needed. We thus have designed and conducted a two-part empirical study that examines how the use of common data transformation techniques impacts visualization quality, which in turn affects user task performance. Our first experiment studies the impact of data transformation on user performance in single-step, typical visual analytic tasks. The second experiment assesses the impact of data transformation in multi-step analytic tasks. Our results quantify the benefits of data transformation in both experiments. More importantly, our analyses reveal that (1) the benefits of data transformation vary significantly by task and by visualization, and (2) the use of data transformation depends on a user’s interaction context. Based on our findings, we present a set of design recommendations that help guide the development and use of data transformation techniques.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Data transformation, the process of preparing raw data for effective visualization, is one of the key challenges in information visualization. Although researchers have developed many data transformation techniques, there is little empirical study of the general impact of data transformation on visualization. Without such study, it is difficult to systematically decide when and which data transformation techniques are needed. We thus have designed and conducted a two-part empirical study that examines how the use of common data transformation techniques impacts visualization quality, which in turn affects user task performance. Our first experiment studies the impact of data transformation on user performance in single-step, typical visual analytic tasks. The second experiment assesses the impact of data transformation in multi-step analytic tasks. Our results quantify the benefits of data transformation in both experiments. More importantly, our analyses reveal that (1) the benefits of data transformation vary significantly by task and by visualization, and (2) the use of data transformation depends on a user’s interaction context. Based on our findings, we present a set of design recommendations that help guide the development and use of data transformation techniques.",
"title": "Evaluating the Use of Data Transformation for Information Visualization",
"normalizedTitle": "Evaluating the Use of Data Transformation for Information Visualization",
"fno": "ttg2008061309",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Data Transformation",
"Data Cleaning",
"Empirical Evaluation",
"User Studies"
],
"authors": [
{
"givenName": "Zhen",
"surname": "Wen",
"fullName": "Zhen Wen",
"affiliation": "IBM T. J. Watson Research Center",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michelle",
"surname": "Zhou",
"fullName": "Michelle Zhou",
"affiliation": "IBM T. J. Watson Research Center",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1309-1316",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpc/2006/2601/0/26010229",
"title": "Experimental Settings in Program Comprehension: Challenges and Open Issues",
"doi": null,
"abstractUrl": "/proceedings-article/icpc/2006/26010229/12OmNAle6M7",
"parentPublication": {
"id": "proceedings/icpc/2006/2601/0",
"title": "14th IEEE International Conference on Program Comprehension",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2009/3733/0/3733a260",
"title": "A Memory-Saving and Efficient Data Transformation Technique for Mixed Data Sets Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2009/3733a260/12OmNButq4U",
"parentPublication": {
"id": "proceedings/iv/2009/3733/0",
"title": "2009 13th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2007/2900/0/29000074",
"title": "Focus Group Methodology for Evaluating Information Visualization Techniques and Tools",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2007/29000074/12OmNro0Icc",
"parentPublication": {
"id": "proceedings/iv/2007/2900/0",
"title": "2007 11th International Conference Information Visualization (IV '07)",
"__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/icie/2009/3679/1/3679a534",
"title": "Research and Design of Interactive Data Transformation and Migration System for Heterogeneous Data Sources",
"doi": null,
"abstractUrl": "/proceedings-article/icie/2009/3679a534/12OmNya72s4",
"parentPublication": {
"id": "proceedings/icie/2009/3679/1",
"title": "2009 WASE International Conference on Information Engineering (ICIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/27900015",
"title": "Low-Level Components of Analytic Activity in Information Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/27900015/12OmNzWOBdM",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/04/v0432",
"title": "Knowledge Precepts for Design and Evaluation of Information Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2005/04/v0432/13rRUEgarnC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010060943",
"title": "How Information Visualization Novices Construct Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010060943/13rRUwInvAZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2005/04/e0312",
"title": "Profiling Deployed Software: Assessing Strategies and Testing Opportunities",
"doi": null,
"abstractUrl": "/journal/ts/2005/04/e0312/13rRUwjXZLr",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__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"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061301",
"articleId": "13rRUx0xPIx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061317",
"articleId": "13rRUxASuhu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxGAL8S",
"title": "January",
"year": "2006",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": "28",
"label": "January",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxOdD3H",
"doi": "10.1109/TPAMI.2006.11",
"abstract": "The performance of a fingerprint matching system is affected by the nonlinear deformation introduced in the fingerprint impression during image acquisition. This nonlinear deformation causes fingerprint features such as minutiae points and ridge curves to be distorted in a complex manner. A technique is presented to estimate the nonlinear distortion in fingerprint pairs based on ridge curve correspondences. The nonlinear distortion, represented using the thin-plate spline (TPS) function, aids in the estimation of an \"average” deformation model for a specific finger when several impressions of that finger are available. The estimated average deformation is then utilized to distort the template fingerprint prior to matching it with an input fingerprint. The proposed deformation model based on ridge curves leads to a better alignment of two fingerprint images compared to a deformation model based on minutiae patterns. An index of deformation is proposed for selecting the \"optimal” deformation model arising from multiple impressions associated with a finger. Results based on experimental data consisting of 1,600 fingerprints corresponding to 50 different fingers collected over a period of two weeks show that incorporating the proposed deformation model results in an improvement in the matching performance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The performance of a fingerprint matching system is affected by the nonlinear deformation introduced in the fingerprint impression during image acquisition. This nonlinear deformation causes fingerprint features such as minutiae points and ridge curves to be distorted in a complex manner. A technique is presented to estimate the nonlinear distortion in fingerprint pairs based on ridge curve correspondences. The nonlinear distortion, represented using the thin-plate spline (TPS) function, aids in the estimation of an \"average” deformation model for a specific finger when several impressions of that finger are available. The estimated average deformation is then utilized to distort the template fingerprint prior to matching it with an input fingerprint. The proposed deformation model based on ridge curves leads to a better alignment of two fingerprint images compared to a deformation model based on minutiae patterns. An index of deformation is proposed for selecting the \"optimal” deformation model arising from multiple impressions associated with a finger. Results based on experimental data consisting of 1,600 fingerprints corresponding to 50 different fingers collected over a period of two weeks show that incorporating the proposed deformation model results in an improvement in the matching performance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The performance of a fingerprint matching system is affected by the nonlinear deformation introduced in the fingerprint impression during image acquisition. This nonlinear deformation causes fingerprint features such as minutiae points and ridge curves to be distorted in a complex manner. A technique is presented to estimate the nonlinear distortion in fingerprint pairs based on ridge curve correspondences. The nonlinear distortion, represented using the thin-plate spline (TPS) function, aids in the estimation of an \"average” deformation model for a specific finger when several impressions of that finger are available. The estimated average deformation is then utilized to distort the template fingerprint prior to matching it with an input fingerprint. The proposed deformation model based on ridge curves leads to a better alignment of two fingerprint images compared to a deformation model based on minutiae patterns. An index of deformation is proposed for selecting the \"optimal” deformation model arising from multiple impressions associated with a finger. Results based on experimental data consisting of 1,600 fingerprints corresponding to 50 different fingers collected over a period of two weeks show that incorporating the proposed deformation model results in an improvement in the matching performance.",
"title": "Fingerprint Warping Using Ridge Curve Correspondences",
"normalizedTitle": "Fingerprint Warping Using Ridge Curve Correspondences",
"fno": "i0019",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Index Terms Fingerprints",
"Nonlinear Deformation",
"Ridge Curves",
"Thin Plate Spline",
"Index Of Deformation",
"Minutiae Pattern",
"Template Selection"
],
"authors": [
{
"givenName": "Arun",
"surname": "Ross",
"fullName": "Arun Ross",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sarat C.",
"surname": "Dass",
"fullName": "Sarat C. Dass",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anil K.",
"surname": "Jain",
"fullName": "Anil K. Jain",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2006-01-01 00:00:00",
"pubType": "trans",
"pages": "19-30",
"year": "2006",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sibgrapi/2005/2389/0/23890112",
"title": "Ridge-Based Fingerprint Matching Using Hough Transform",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2005/23890112/12OmNC8uRhv",
"parentPublication": {
"id": "proceedings/sibgrapi/2005/2389/0",
"title": "XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icetet/2010/4246/0/4246a207",
"title": "Fingerprint Recognition Using Inter Ridge Variation",
"doi": null,
"abstractUrl": "/proceedings-article/icetet/2010/4246a207/12OmNCcKQvj",
"parentPublication": {
"id": "proceedings/icetet/2010/4246/0",
"title": "Emerging Trends in Engineering & Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2008/3493/0/3493a235",
"title": "A Fast Fingerprint Classification Algorithm by Tracing Ridge-Flow Patterns",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2008/3493a235/12OmNqNG3k1",
"parentPublication": {
"id": "proceedings/sitis/2008/3493/0",
"title": "2008 IEEE International Conference on Signal Image Technology and Internet Based Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aipr/2012/4558/0/06528220",
"title": "Exploring the uses of fingerprint patterns and ridge-counts in biographical associations",
"doi": null,
"abstractUrl": "/proceedings-article/aipr/2012/06528220/12OmNxVlTDJ",
"parentPublication": {
"id": "proceedings/aipr/2012/4558/0",
"title": "2012 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ijcbs/2009/3739/0/3739a604",
"title": "Fingerprint Ridge Distance Estimation Based on Ridge Search",
"doi": null,
"abstractUrl": "/proceedings-article/ijcbs/2009/3739a604/12OmNy3AgBm",
"parentPublication": {
"id": "proceedings/ijcbs/2009/3739/0",
"title": "2009 International Joint Conference on Bioinformatics, Systems Biology and Intelligent Computing (IJCBS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2006/06/i0850",
"title": "Fingerprint Matching Based on Global Comprehensive Similarity",
"doi": null,
"abstractUrl": "/journal/tp/2006/06/i0850/13rRUNvyaaa",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/01/ttp2011010072",
"title": "Global Ridge Orientation Modeling for Partial Fingerprint Identification",
"doi": null,
"abstractUrl": "/journal/tp/2011/01/ttp2011010072/13rRUwInv5w",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2003/08/i1009",
"title": "Fingerprint Matching Using an Orientation-Based Minutia Descriptor",
"doi": null,
"abstractUrl": "/journal/tp/2003/08/i1009/13rRUx0gevW",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1997/04/i0302",
"title": "On-Line Fingerprint Verification",
"doi": null,
"abstractUrl": "/journal/tp/1997/04/i0302/13rRUyYSWtP",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/01/ttp2011010088",
"title": "Latent Fingerprint Matching",
"doi": null,
"abstractUrl": "/journal/tp/2011/01/ttp2011010088/13rRUyuegia",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "i0003",
"articleId": "13rRUxBa5yz",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0031",
"articleId": "13rRUyfbwrS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzmclnL",
"title": "November/December",
"year": "2006",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "12",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwgQpDk",
"doi": "10.1109/TVCG.2006.84",
"abstract": "Abstract—The research reported here integrates computational, visual, and cartographic methods to develop a geovisual analytic approach for exploring and understanding spatio-temporal and multivariate patterns. The developed methodology and tools can help analysts investigate complex patterns across multivariate, spatial, and temporal dimensions via clustering, sorting, and visualization. Specifically, the approach involves a self-organizing map, a parallel coordinate plot, several forms of reorderable matrices (including several ordering methods), a geographic small multiple display, and a 2-dimensional cartographic color design method. The coupling among these methods leverages their independent strengths and facilitates a visual exploration of patterns that are difficult to discover otherwise. The visualization system we developed supports overview of complex patterns and, through a variety of interactions, enables users to focus on specific patterns and examine detailed views. We demonstrate the system with an application to the IEEE InfoVis 2005 Contest data set, which contains time-varying, geographically referenced, and multivariate data for technology companies in the US.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—The research reported here integrates computational, visual, and cartographic methods to develop a geovisual analytic approach for exploring and understanding spatio-temporal and multivariate patterns. The developed methodology and tools can help analysts investigate complex patterns across multivariate, spatial, and temporal dimensions via clustering, sorting, and visualization. Specifically, the approach involves a self-organizing map, a parallel coordinate plot, several forms of reorderable matrices (including several ordering methods), a geographic small multiple display, and a 2-dimensional cartographic color design method. The coupling among these methods leverages their independent strengths and facilitates a visual exploration of patterns that are difficult to discover otherwise. The visualization system we developed supports overview of complex patterns and, through a variety of interactions, enables users to focus on specific patterns and examine detailed views. We demonstrate the system with an application to the IEEE InfoVis 2005 Contest data set, which contains time-varying, geographically referenced, and multivariate data for technology companies in the US.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—The research reported here integrates computational, visual, and cartographic methods to develop a geovisual analytic approach for exploring and understanding spatio-temporal and multivariate patterns. The developed methodology and tools can help analysts investigate complex patterns across multivariate, spatial, and temporal dimensions via clustering, sorting, and visualization. Specifically, the approach involves a self-organizing map, a parallel coordinate plot, several forms of reorderable matrices (including several ordering methods), a geographic small multiple display, and a 2-dimensional cartographic color design method. The coupling among these methods leverages their independent strengths and facilitates a visual exploration of patterns that are difficult to discover otherwise. The visualization system we developed supports overview of complex patterns and, through a variety of interactions, enables users to focus on specific patterns and examine detailed views. We demonstrate the system with an application to the IEEE InfoVis 2005 Contest data set, which contains time-varying, geographically referenced, and multivariate data for technology companies in the US.",
"title": "A Visualization System for Space-Time and Multivariate Patterns (VIS-STAMP)",
"normalizedTitle": "A Visualization System for Space-Time and Multivariate Patterns (VIS-STAMP)",
"fno": "v1461",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Pattern Analysis",
"Data Visualization",
"Displays",
"Spatiotemporal Phenomena",
"Humans",
"Geography",
"Sorting",
"Design Methodology",
"Time Varying Systems",
"Companies",
"Information Visualization",
"Multivariate And Spatio Temporal Data",
"Geovisualization",
"Self Organizing Map SOM",
"Visual Analytics",
"Ordering",
"Small Multiples"
],
"authors": [
{
"givenName": "Diansheng",
"surname": "Guo",
"fullName": "Diansheng Guo",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jin",
"surname": "Chen",
"fullName": "Jin Chen",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alan M.",
"surname": "MacEachren",
"fullName": "Alan M. MacEachren",
"affiliation": "GeoVISTA Center, Department of Geography, Pennsylvania State University, 302 Walker Building, University Park, PA 16802",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ke",
"surname": "Liao",
"fullName": "Ke Liao",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2006-11-01 00:00:00",
"pubType": "trans",
"pages": "1461-1474",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2007/2900/0/29000277",
"title": "Working with patterns in large multivariate datasets - Karnaugh-Veitch-Maps revisited",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2007/29000277/12OmNBSjJ0F",
"parentPublication": {
"id": "proceedings/iv/2007/2900/0",
"title": "2007 11th International Conference Information Visualization (IV '07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2004/2177/0/21770561",
"title": "Visualizing Time-Varying Matrices Using Multidimensional Scaling and Reorderable Matrices",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2004/21770561/12OmNvStcPl",
"parentPublication": {
"id": "proceedings/iv/2004/2177/0",
"title": "Proceedings. Eighth International Conference on Information Visualisation, 2004. IV 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2012/4752/0/06400536",
"title": "The spatiotemporal multivariate hypercube for discovery of patterns in event data",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2012/06400536/12OmNvnOwsG",
"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/pacificvis/2013/4797/0/06596139",
"title": "Interactive selection of multivariate features in large spatiotemporal data",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2013/06596139/12OmNwF0BOI",
"parentPublication": {
"id": "proceedings/pacificvis/2013/4797/0",
"title": "2013 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a033",
"title": "Scalable Lagrangian-Based Attribute Space Projection for Multivariate Unsteady Flow Data",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a033/12OmNyL0THg",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2013/5108/0/5108a201",
"title": "Extraction of Interpretable Multivariate Patterns for Early Diagnostics",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2013/5108a201/12OmNzlD95g",
"parentPublication": {
"id": "proceedings/icdm/2013/5108/0",
"title": "2013 IEEE International Conference on Data Mining (ICDM)",
"__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/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/5555/01/09956758",
"title": "Multivariate Data Explanation by Jumping Emerging Patterns Visualization",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09956758/1Iu2JIUXLR6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vahc/2020/2644/0/264400a004",
"title": "Communicating on Multivariate and Geospatial Data supported by ergonomics criteria: COVID-19 case",
"doi": null,
"abstractUrl": "/proceedings-article/vahc/2020/264400a004/1yhFEm6DljG",
"parentPublication": {
"id": "proceedings/vahc/2020/2644/0",
"title": "2020 Workshop on Visual Analytics in Healthcare (VAHC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1450",
"articleId": "13rRUwbs20M",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1475",
"articleId": "13rRUNvgz9B",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyRg4kZ",
"title": "December",
"year": "2001",
"issueNum": "12",
"idPrefix": "tp",
"pubType": "journal",
"volume": "23",
"label": "December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyv53Gm",
"doi": "10.1109/34.977567",
"abstract": "In this paper, a novel approach based on cubic B-spline wavelet transform is proposed to process Chinese character including character compression, type zooming-in, and typeface composition. The basic idea is that a Chinese character is described by its contours which are represented by cubic B-spline functions, and each contour is decomposed into the details or the control points (wavelet coefficients) at different resolution levels. For character compression, there are two methods, one directly treats the details of wavelet coefficients and the other considers the subcurves piecing together at the different resolution levels. In the type zooming-in, the wavelet reconstruction is used to scale the Chinese character with arbitrary size and the wavelet filter is used to improve the quality of the enlarged type. For typeface composition, the new style typefaces of Chinese character are obtained by editing and modifying the details at different resolution levels. The concrete algorithms are also given in this paper as well as the experimental results.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, a novel approach based on cubic B-spline wavelet transform is proposed to process Chinese character including character compression, type zooming-in, and typeface composition. The basic idea is that a Chinese character is described by its contours which are represented by cubic B-spline functions, and each contour is decomposed into the details or the control points (wavelet coefficients) at different resolution levels. For character compression, there are two methods, one directly treats the details of wavelet coefficients and the other considers the subcurves piecing together at the different resolution levels. In the type zooming-in, the wavelet reconstruction is used to scale the Chinese character with arbitrary size and the wavelet filter is used to improve the quality of the enlarged type. For typeface composition, the new style typefaces of Chinese character are obtained by editing and modifying the details at different resolution levels. The concrete algorithms are also given in this paper as well as the experimental results.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, a novel approach based on cubic B-spline wavelet transform is proposed to process Chinese character including character compression, type zooming-in, and typeface composition. The basic idea is that a Chinese character is described by its contours which are represented by cubic B-spline functions, and each contour is decomposed into the details or the control points (wavelet coefficients) at different resolution levels. For character compression, there are two methods, one directly treats the details of wavelet coefficients and the other considers the subcurves piecing together at the different resolution levels. In the type zooming-in, the wavelet reconstruction is used to scale the Chinese character with arbitrary size and the wavelet filter is used to improve the quality of the enlarged type. For typeface composition, the new style typefaces of Chinese character are obtained by editing and modifying the details at different resolution levels. The concrete algorithms are also given in this paper as well as the experimental results.",
"title": "Basic Processes of Chinese Character Based on Cubic B-Spline Wavelet Transform",
"normalizedTitle": "Basic Processes of Chinese Character Based on Cubic B-Spline Wavelet Transform",
"fno": "i1443",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Wavelet",
"Cubic B Spline",
"Character Processing",
"Compression",
"Type Zooming In",
"Typeface Composition"
],
"authors": [
{
"givenName": "Y.Y.",
"surname": "Tang",
"fullName": "Y.Y. Tang",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "F.",
"surname": "Yang",
"fullName": "F. Yang",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "J.",
"surname": "Liu",
"fullName": "J. Liu",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2001-12-01 00:00:00",
"pubType": "trans",
"pages": "1443-1448",
"year": "2001",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i1430",
"articleId": "13rRUyoPSQ4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i1449",
"articleId": "13rRUxASucu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNy5R3uF",
"title": "February",
"year": "2006",
"issueNum": "02",
"idPrefix": "tp",
"pubType": "journal",
"volume": "28",
"label": "February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILtJAP",
"doi": "10.1109/TPAMI.2006.41",
"abstract": "This paper addresses the problem of estimating the motion of a camera as it observes the outline (or apparent contour) of a solid bounded by a smooth surface in successive image frames. In this context, the surface points that project onto the outline of an object depend on the viewpoint and the only true correspondences between two outlines of the same object are the projections of frontier points where the viewing rays intersect in the tangent plane of the surface. In turn, the epipolar geometry is easily estimated once these correspondences have been identified. Given the apparent contours detected in an image sequence, a robust procedure based on RANSAC and a voting strategy is proposed to simultaneously estimate the camera configurations and a consistent set of frontier point projections by enforcing the redundancy of multiview epipolar geometry. The proposed approach is, in principle, applicable to orthographic, weak-perspective, and affine projection models. Experiments with nine real image sequences are presented for the orthographic projection case, including a quantitative comparison with the ground-truth data for the six data sets for which the latter information is available. Sample visual hulls have been computed from all image sequences for qualitative evaluation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper addresses the problem of estimating the motion of a camera as it observes the outline (or apparent contour) of a solid bounded by a smooth surface in successive image frames. In this context, the surface points that project onto the outline of an object depend on the viewpoint and the only true correspondences between two outlines of the same object are the projections of frontier points where the viewing rays intersect in the tangent plane of the surface. In turn, the epipolar geometry is easily estimated once these correspondences have been identified. Given the apparent contours detected in an image sequence, a robust procedure based on RANSAC and a voting strategy is proposed to simultaneously estimate the camera configurations and a consistent set of frontier point projections by enforcing the redundancy of multiview epipolar geometry. The proposed approach is, in principle, applicable to orthographic, weak-perspective, and affine projection models. Experiments with nine real image sequences are presented for the orthographic projection case, including a quantitative comparison with the ground-truth data for the six data sets for which the latter information is available. Sample visual hulls have been computed from all image sequences for qualitative evaluation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper addresses the problem of estimating the motion of a camera as it observes the outline (or apparent contour) of a solid bounded by a smooth surface in successive image frames. In this context, the surface points that project onto the outline of an object depend on the viewpoint and the only true correspondences between two outlines of the same object are the projections of frontier points where the viewing rays intersect in the tangent plane of the surface. In turn, the epipolar geometry is easily estimated once these correspondences have been identified. Given the apparent contours detected in an image sequence, a robust procedure based on RANSAC and a voting strategy is proposed to simultaneously estimate the camera configurations and a consistent set of frontier point projections by enforcing the redundancy of multiview epipolar geometry. The proposed approach is, in principle, applicable to orthographic, weak-perspective, and affine projection models. Experiments with nine real image sequences are presented for the orthographic projection case, including a quantitative comparison with the ground-truth data for the six data sets for which the latter information is available. Sample visual hulls have been computed from all image sequences for qualitative evaluation.",
"title": "Robust Structure and Motion from Outlines of Smooth Curved Surfaces",
"normalizedTitle": "Robust Structure and Motion from Outlines of Smooth Curved Surfaces",
"fno": "i0302",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Index Terms Image Processing And Computer Vision",
"Motion",
"Shape"
],
"authors": [
{
"givenName": "Yasutaka",
"surname": "Furukawa",
"fullName": "Yasutaka Furukawa",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Amit",
"surname": "Sethi",
"fullName": "Amit Sethi",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jean",
"surname": "Ponce",
"fullName": "Jean Ponce",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David J.",
"surname": "Kriegman",
"fullName": "David J. Kriegman",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2006-02-01 00:00:00",
"pubType": "trans",
"pages": "302-315",
"year": "2006",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/tdscen/1989/2007/0/00068102",
"title": "On recognizing and positioning curved 3D objects from image contours",
"doi": null,
"abstractUrl": "/proceedings-article/tdscen/1989/00068102/12OmNAm4THJ",
"parentPublication": {
"id": "proceedings/tdscen/1989/2007/0",
"title": "Proceedings. Workshop on Interpretation of 3D Scenes",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1990/2057/0/00139535",
"title": "Determining back-facing curved model surfaces by analysis at the boundary",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1990/00139535/12OmNBcj5Cm",
"parentPublication": {
"id": "proceedings/iccv/1990/2057/0",
"title": "Proceedings Third International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1996/7258/0/72580327",
"title": "Structure and motion of curved 3D objects from monocular silhouettes",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1996/72580327/12OmNC3Xhcl",
"parentPublication": {
"id": "proceedings/cvpr/1996/7258/0",
"title": "Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1990/2057/0/00139537",
"title": "Representing surface curvature discontinuities on curved surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1990/00139537/12OmNvT2peK",
"parentPublication": {
"id": "proceedings/iccv/1990/2057/0",
"title": "Proceedings Third International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1995/7042/0/70420269",
"title": "Motion from the frontier of curved surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1995/70420269/12OmNwtEEH5",
"parentPublication": {
"id": "proceedings/iccv/1995/7042/0",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2003/1950/1/195010083",
"title": "The Local Projective Shape of Smooth Surfaces and their Outlines",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2003/195010083/12OmNxuo0ks",
"parentPublication": {
"id": "proceedings/iccv/2003/1950/1",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2009/4442/0/05457427",
"title": "Shape from depth discontinuities under orthographic projection",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2009/05457427/12OmNyvoXiU",
"parentPublication": {
"id": "proceedings/iccvw/2009/4442/0",
"title": "2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1990/2057/0/00139501",
"title": "Shape and motion without depth",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1990/00139501/12OmNz4SOAm",
"parentPublication": {
"id": "proceedings/iccv/1990/2057/0",
"title": "Proceedings Third International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1997/05/i0513",
"title": "3D Surface Estimation and Model Construction From Specular Motion in Image Sequences",
"doi": null,
"abstractUrl": "/journal/tp/1997/05/i0513/13rRUwgyOko",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1997/03/i0206",
"title": "A Paraperspective Factorization Method for Shape and Motion Recovery",
"doi": null,
"abstractUrl": "/journal/tp/1997/03/i0206/13rRUy3xY3y",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "i0290",
"articleId": "13rRUxlgxXx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0316",
"articleId": "13rRUyp7tXP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNy5R3uF",
"title": "February",
"year": "2006",
"issueNum": "02",
"idPrefix": "tp",
"pubType": "journal",
"volume": "28",
"label": "February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygT7o3",
"doi": "10.1109/TPAMI.2006.37",
"abstract": "Deformable 3D models can be represented either as traditional explicit surfaces, such as triangulated meshes, or as implicit surfaces. Explicit surfaces are widely accepted because they are simple to deform and render, but fitting them involves minimizing a nondifferentiable distance function. By contrast, implicit surfaces allow fitting by minimizing a differentiable algebraic distance, but are harder to meaningfully deform and render. Here, we propose a method that combines the strength of both approaches. It relies on a technique that can turn a completely arbitrary triangulated mesh, such as one taken from the Web, into an implicit surface that closely approximates it and can deform in tandem with it. This allows both automated algorithms to take advantage of the attractive properties of implicit surfaces for fitting purposes and people to use standard deformation tools they feel comfortable for interaction and animation purposes. We demonstrate the applicability of our technique to modeling the human upper-body, including face, neck, shoulders, and ears, from noisy stereo and silhouette data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Deformable 3D models can be represented either as traditional explicit surfaces, such as triangulated meshes, or as implicit surfaces. Explicit surfaces are widely accepted because they are simple to deform and render, but fitting them involves minimizing a nondifferentiable distance function. By contrast, implicit surfaces allow fitting by minimizing a differentiable algebraic distance, but are harder to meaningfully deform and render. Here, we propose a method that combines the strength of both approaches. It relies on a technique that can turn a completely arbitrary triangulated mesh, such as one taken from the Web, into an implicit surface that closely approximates it and can deform in tandem with it. This allows both automated algorithms to take advantage of the attractive properties of implicit surfaces for fitting purposes and people to use standard deformation tools they feel comfortable for interaction and animation purposes. We demonstrate the applicability of our technique to modeling the human upper-body, including face, neck, shoulders, and ears, from noisy stereo and silhouette data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Deformable 3D models can be represented either as traditional explicit surfaces, such as triangulated meshes, or as implicit surfaces. Explicit surfaces are widely accepted because they are simple to deform and render, but fitting them involves minimizing a nondifferentiable distance function. By contrast, implicit surfaces allow fitting by minimizing a differentiable algebraic distance, but are harder to meaningfully deform and render. Here, we propose a method that combines the strength of both approaches. It relies on a technique that can turn a completely arbitrary triangulated mesh, such as one taken from the Web, into an implicit surface that closely approximates it and can deform in tandem with it. This allows both automated algorithms to take advantage of the attractive properties of implicit surfaces for fitting purposes and people to use standard deformation tools they feel comfortable for interaction and animation purposes. We demonstrate the applicability of our technique to modeling the human upper-body, including face, neck, shoulders, and ears, from noisy stereo and silhouette data.",
"title": "Implicit Meshes for Surface Reconstruction",
"normalizedTitle": "Implicit Meshes for Surface Reconstruction",
"fno": "i0328",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Index Terms Computer Vision",
"Reconstruction",
"Surface Fitting",
"Modeling",
"Optimization"
],
"authors": [
{
"givenName": "Slobodan",
"surname": "Ilic",
"fullName": "Slobodan Ilic",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pascal",
"surname": "Fua",
"fullName": "Pascal Fua",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2006-02-01 00:00:00",
"pubType": "trans",
"pages": "328-333",
"year": "2006",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isspit/2007/1834/0/04458028",
"title": "A Framework for Implicit Surfaces Reconstruction form Large Clouds of Points",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2007/04458028/12OmNALCNso",
"parentPublication": {
"id": "proceedings/isspit/2007/1834/0",
"title": "2007 IEEE International Symposium on Signal Processing and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hlk/2003/2049/0/20490029",
"title": "Generic Deformable Implicit Mesh Models for Automated Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/hlk/2003/20490029/12OmNBOll5c",
"parentPublication": {
"id": "proceedings/hlk/2003/2049/0",
"title": "Higher-Level Knowledge in 3D Modeling and Motion Analysis, IEEE International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dpvt/2006/2825/0/04155754",
"title": "Beyond Silhouettes: Surface Reconstruction Using Multi-Flash Photography",
"doi": null,
"abstractUrl": "/proceedings-article/3dpvt/2006/04155754/12OmNBa2iEF",
"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/cvpr/2003/1900/2/190020483",
"title": "Implicit Meshes for Modeling and Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2003/190020483/12OmNBqdr5H",
"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/cadgraphics/2011/4497/0/4497a509",
"title": "Implicit Surface Reconstruction Based on Adaptive Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a509/12OmNqJHFLk",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2013/5051/0/5051a068",
"title": "Growing Grid-Evolutionary Algorithm for Surface Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2013/5051a068/12OmNwogh3R",
"parentPublication": {
"id": "proceedings/cgiv/2013/5051/0",
"title": "2013 10th International Conference Computer Graphics, Imaging and Visualization (CGIV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880259",
"title": "Surface Reconstruction of Noisy and Defective Data Sets",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880259/12OmNwvVrCE",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2001/1143/1/00937518",
"title": "A linear dual-space approach to 3D surface reconstruction from occluding contours using algebraic surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2001/00937518/12OmNyyeWw0",
"parentPublication": {
"id": "proceedings/iccv/2001/1143/1",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1512",
"title": "Efficient Surface Reconstruction using Generalized Coulomb Potentials",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1512/13rRUy3xY84",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600e319",
"title": "Recovering Fine Details for Neural Implicit Surface Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600e319/1KxUSVbk6He",
"parentPublication": {
"id": "proceedings/wacv/2023/9346/0",
"title": "2023 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "i0323",
"articleId": "13rRUxjQywt",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCm7Bxm",
"title": "July/August",
"year": "2005",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "11",
"label": "July/August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvgyWb",
"doi": "10.1109/TVCG.2005.62",
"abstract": "This paper presents importance-driven feature enhancement as a technique for the automatic generation of cut-away and ghosted views out of volumetric data. The presented focus+context approach removes or suppresses less important parts of a scene to reveal more important underlying information. However, less important parts are fully visible in those regions, where important visual information is not lost, i.e., more relevant features are not occluded. Features within the volumetric data are first classified according to a new dimension, denoted as object importance. This property determines which structures should be readily discernible and which structures are less important. Next, for each feature, various representations (levels of sparseness) from a dense to a sparse depiction are defined. Levels of sparseness define a spectrum of optical properties or rendering styles. The resulting image is generated by ray-casting and combining the intersected features proportional to their importance (importance compositing). The paper includes an extended discussion on several possible schemes for levels of sparseness specification. Furthermore, different approaches to importance compositing are treated.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents importance-driven feature enhancement as a technique for the automatic generation of cut-away and ghosted views out of volumetric data. The presented focus+context approach removes or suppresses less important parts of a scene to reveal more important underlying information. However, less important parts are fully visible in those regions, where important visual information is not lost, i.e., more relevant features are not occluded. Features within the volumetric data are first classified according to a new dimension, denoted as object importance. This property determines which structures should be readily discernible and which structures are less important. Next, for each feature, various representations (levels of sparseness) from a dense to a sparse depiction are defined. Levels of sparseness define a spectrum of optical properties or rendering styles. The resulting image is generated by ray-casting and combining the intersected features proportional to their importance (importance compositing). The paper includes an extended discussion on several possible schemes for levels of sparseness specification. Furthermore, different approaches to importance compositing are treated.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents importance-driven feature enhancement as a technique for the automatic generation of cut-away and ghosted views out of volumetric data. The presented focus+context approach removes or suppresses less important parts of a scene to reveal more important underlying information. However, less important parts are fully visible in those regions, where important visual information is not lost, i.e., more relevant features are not occluded. Features within the volumetric data are first classified according to a new dimension, denoted as object importance. This property determines which structures should be readily discernible and which structures are less important. Next, for each feature, various representations (levels of sparseness) from a dense to a sparse depiction are defined. Levels of sparseness define a spectrum of optical properties or rendering styles. The resulting image is generated by ray-casting and combining the intersected features proportional to their importance (importance compositing). The paper includes an extended discussion on several possible schemes for levels of sparseness specification. Furthermore, different approaches to importance compositing are treated.",
"title": "Importance-Driven Feature Enhancement in Volume Visualization",
"normalizedTitle": "Importance-Driven Feature Enhancement in Volume Visualization",
"fno": "v0408",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms View Dependent Visualization",
"Volume Rendering",
"Focus Context Techniques",
"Level Of Detail Techniques",
"Illustrative Techniques"
],
"authors": [
{
"givenName": "Ivan",
"surname": "Viola",
"fullName": "Ivan Viola",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Armin",
"surname": "Kanitsar",
"fullName": "Armin Kanitsar",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "M. Eduard",
"surname": "Gr?ller",
"fullName": "M. Eduard Gr?ller",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2005-07-01 00:00:00",
"pubType": "trans",
"pages": "408-418",
"year": "2005",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2004/8788/0/87880139",
"title": "Importance-Driven Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880139/12OmNs0TL1v",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a381",
"title": "Depth-Based Feature Enhancement for Volume Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a381/12OmNvAS4oS",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpp/1994/6620/3/662030039",
"title": "Efficient Parallel Computation of Projections for Animated Volume Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/icpp/1994/662030039/12OmNwHhoND",
"parentPublication": {
"id": "proceedings/icpp/1994/6620/3",
"title": "1994 International Conference on Parallel Processing Vol. 3",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660085",
"title": "VolumeShop: An Interactive System for Direct Volume Illustration",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660085/12OmNwIpNlJ",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vv/2004/8781/0/87810079",
"title": "3D ROAM for Scalable Volume Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vv/2004/87810079/12OmNxbEtIp",
"parentPublication": {
"id": "proceedings/vv/2004/8781/0",
"title": "Volume Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2010/8420/0/05720357",
"title": "Importance-Aware Composition for Illustrative Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2010/05720357/12OmNz5apMR",
"parentPublication": {
"id": "proceedings/sibgrapi/2010/8420/0",
"title": "2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660042",
"title": "High Dynamic Range Volume Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660042/12OmNzUxO6V",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/04/ttg2010040571",
"title": "Illustrative Volume Visualization Using GPU-Based Particle Systems",
"doi": null,
"abstractUrl": "/journal/tg/2010/04/ttg2010040571/13rRUwgyOjh",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/02/ttg2011020171",
"title": "Feature-Preserving Volume Data Reduction and Focus+Context Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2011/02/ttg2011020171/13rRUx0xPTN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061547",
"title": "Importance-Driven Time-Varying Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061547/13rRUxC0SvO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0395",
"articleId": "13rRUIM2VGT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0419",
"articleId": "13rRUy3xY2J",
"__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": "13rRUxOdD8c",
"doi": "10.1109/TVCG.2008.187",
"abstract": "Surveys and opinion polls are extremely popular in the media, especially in the months preceding a general election. However, the available tools for analyzing poll results often require specialized training. Hence, data analysis remains out of reach for many casual computer users. Moreover, the visualizations used to communicate the results of surveys are typically limited to traditional statistical graphics like bar graphs and pie charts, both of which are fundamentally noninteractive. We present a simple interactive visualization that allows users to construct queries on large tabular data sets, and view the results in real time. The results of two separate user studies suggest that our interface lowers the learning curve for naive users, while still providing enough analytical power to discover interesting correlations in the data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Surveys and opinion polls are extremely popular in the media, especially in the months preceding a general election. However, the available tools for analyzing poll results often require specialized training. Hence, data analysis remains out of reach for many casual computer users. Moreover, the visualizations used to communicate the results of surveys are typically limited to traditional statistical graphics like bar graphs and pie charts, both of which are fundamentally noninteractive. We present a simple interactive visualization that allows users to construct queries on large tabular data sets, and view the results in real time. The results of two separate user studies suggest that our interface lowers the learning curve for naive users, while still providing enough analytical power to discover interesting correlations in the data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Surveys and opinion polls are extremely popular in the media, especially in the months preceding a general election. However, the available tools for analyzing poll results often require specialized training. Hence, data analysis remains out of reach for many casual computer users. Moreover, the visualizations used to communicate the results of surveys are typically limited to traditional statistical graphics like bar graphs and pie charts, both of which are fundamentally noninteractive. We present a simple interactive visualization that allows users to construct queries on large tabular data sets, and view the results in real time. The results of two separate user studies suggest that our interface lowers the learning curve for naive users, while still providing enough analytical power to discover interesting correlations in the data.",
"title": "Who Votes For What? A Visual Query Language for Opinion Data",
"normalizedTitle": "Who Votes For What? A Visual Query Language for Opinion Data",
"fno": "ttg2008061197",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Visual Query Languages",
"Radial Visualization",
"Data Analysis",
"Human Computer Interaction"
],
"authors": [
{
"givenName": "Geoffrey",
"surname": "Draper",
"fullName": "Geoffrey Draper",
"affiliation": "University of Utah",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Richard",
"surname": "Riesenfeld",
"fullName": "Richard Riesenfeld",
"affiliation": "University of Utah",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1197-1204",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/adl/1999/0219/0/02190050",
"title": "Refining Query Previews Techniques for Data with Multivalued Attributes: The Case of NASA EOSDIS",
"doi": null,
"abstractUrl": "/proceedings-article/adl/1999/02190050/12OmNAS9zrJ",
"parentPublication": {
"id": "proceedings/adl/1999/0219/0",
"title": "Advances in Digital Libraries Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/saint/2009/3700/0/3700a209",
"title": "IT-Enabled Survey and Its Problems: Analyses of an Australian Internet Poll",
"doi": null,
"abstractUrl": "/proceedings-article/saint/2009/3700a209/12OmNyKJiCs",
"parentPublication": {
"id": "proceedings/saint/2009/3700/0",
"title": "2009 Ninth Annual International Symposium on Applications and the Internet",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/06/v0649",
"title": "Dynamic Interactions in Physically Realistic Collaborative Virtual Environments",
"doi": null,
"abstractUrl": "/journal/tg/2005/06/v0649/13rRUB7a1fH",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061157",
"title": "Balloon Focus: a Seamless Multi-Focus+Context Method for Treemaps",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061157/13rRUxASuAr",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2005/07/k0982",
"title": "Query Processing in a Mobile Computing Environment: Exploiting the Features of Asymmetry",
"doi": null,
"abstractUrl": "/journal/tk/2005/07/k0982/13rRUxBa5xw",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2006/03/k0350",
"title": "Toward Efficient Multifeature Query Processing",
"doi": null,
"abstractUrl": "/journal/tk/2006/03/k0350/13rRUxYIN4r",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1985/10/01701922",
"title": "Statistical Database Query Languages",
"doi": null,
"abstractUrl": "/journal/ts/1985/10/01701922/13rRUxlgxY0",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__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/tk/2005/07/k0997",
"title": "Indexing Useful Structural Patterns for XML Query Processing",
"doi": null,
"abstractUrl": "/journal/tk/2005/07/k0997/13rRUygT7nd",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061141",
"title": "Rolling the Dice: Multidimensional Visual Exploration using Scatterplot Matrix Navigation",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061141/13rRUyuegp1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061189",
"articleId": "13rRUwwJWFI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061205",
"articleId": "13rRUNvgziw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRQC",
"name": "ttg2008061197.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2008061197.mov",
"extension": "mov",
"size": "42.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1smCYMGo6gE",
"title": "March-April",
"year": "2021",
"issueNum": "02",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "23",
"label": "March-April",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1qWIy8Vz5oA",
"doi": "10.1109/MCSE.2021.3057097",
"abstract": "The advent of increasingly large and complex datasets has fundamentally altered the way that scientists conduct astronomy research. The need to work closely to the data has motivated the creation of online science platforms, which include a suite of software tools and services, therefore going beyond data storage and data access. We present two example applications of Jupyter as a part of astrophysical science platforms for professional researchers and students. First, the Astro Data Lab is developed and operated by NOIRLab with a mission to serve the astronomy community with now over 1500 registered users. Second, the Dark Energy Spectroscopic Instrument science platform serves its geographically distributed team comprising about 900 collaborators from over 90 institutions. We describe the main uses of Jupyter and the interfaces that needed to be created to embed it within science platform ecosystems. We use these examples to illustrate the broader concept of empowering researchers and providing them with access to not only large datasets but also cutting-edge software, tools, and data services without requiring any local installation, which can be relevant for a wide range of disciplines. Future advances may involve science platform networks, and tools for simultaneously developing Jupyter notebooks to facilitate collaborations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The advent of increasingly large and complex datasets has fundamentally altered the way that scientists conduct astronomy research. The need to work closely to the data has motivated the creation of online science platforms, which include a suite of software tools and services, therefore going beyond data storage and data access. We present two example applications of Jupyter as a part of astrophysical science platforms for professional researchers and students. First, the Astro Data Lab is developed and operated by NOIRLab with a mission to serve the astronomy community with now over 1500 registered users. Second, the Dark Energy Spectroscopic Instrument science platform serves its geographically distributed team comprising about 900 collaborators from over 90 institutions. We describe the main uses of Jupyter and the interfaces that needed to be created to embed it within science platform ecosystems. We use these examples to illustrate the broader concept of empowering researchers and providing them with access to not only large datasets but also cutting-edge software, tools, and data services without requiring any local installation, which can be relevant for a wide range of disciplines. Future advances may involve science platform networks, and tools for simultaneously developing Jupyter notebooks to facilitate collaborations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The advent of increasingly large and complex datasets has fundamentally altered the way that scientists conduct astronomy research. The need to work closely to the data has motivated the creation of online science platforms, which include a suite of software tools and services, therefore going beyond data storage and data access. We present two example applications of Jupyter as a part of astrophysical science platforms for professional researchers and students. First, the Astro Data Lab is developed and operated by NOIRLab with a mission to serve the astronomy community with now over 1500 registered users. Second, the Dark Energy Spectroscopic Instrument science platform serves its geographically distributed team comprising about 900 collaborators from over 90 institutions. We describe the main uses of Jupyter and the interfaces that needed to be created to embed it within science platform ecosystems. We use these examples to illustrate the broader concept of empowering researchers and providing them with access to not only large datasets but also cutting-edge software, tools, and data services without requiring any local installation, which can be relevant for a wide range of disciplines. Future advances may involve science platform networks, and tools for simultaneously developing Jupyter notebooks to facilitate collaborations.",
"title": "Jupyter-Enabled Astrophysical Analysis Using Data-Proximate Computing Platforms",
"normalizedTitle": "Jupyter-Enabled Astrophysical Analysis Using Data-Proximate Computing Platforms",
"fno": "09347681",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Astronomy Computing",
"Groupware",
"Information Retrieval",
"Internet",
"Storage Management",
"NOIR Lab",
"Data Access",
"Jupyter Enabled Astrophysical Analysis",
"Jupyter Notebooks",
"Science Platform Networks",
"Data Services",
"Science Platform Ecosystems",
"Geographically Distributed Team",
"Dark Energy Spectroscopic Instrument Science Platform",
"Astronomy Community",
"Astro Data Lab",
"Professional Researchers",
"Astrophysical Science Platforms",
"Data Storage",
"Software Tools",
"Online Science Platforms",
"Complex Datasets",
"Large Datasets",
"Data Proximate Computing Platforms",
"Databases",
"Astronomy",
"Servers",
"Data Visualization",
"Dark Energy",
"Cloud Computing",
"Telescopes",
"Astrophysics"
],
"authors": [
{
"givenName": "Stephanie",
"surname": "Juneau",
"fullName": "Stephanie Juneau",
"affiliation": "NSF’s NOIRLab, Tucson, AZ, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Knut",
"surname": "Olsen",
"fullName": "Knut Olsen",
"affiliation": "NSF’s NOIRLab, Tucson, AZ, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert",
"surname": "Nikutta",
"fullName": "Robert Nikutta",
"affiliation": "NSF’s NOIRLab, Tucson, AZ, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alice",
"surname": "Jacques",
"fullName": "Alice Jacques",
"affiliation": "NSF’s NOIRLab, Tucson, AZ, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stephen",
"surname": "Bailey",
"fullName": "Stephen Bailey",
"affiliation": "Lawrence Berkeley National Laboratory, Berkeley, CA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-03-01 00:00:00",
"pubType": "mags",
"pages": "15-25",
"year": "2021",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ldav/2012/4733/0/06378961",
"title": "Panning and zooming the observable universe with prefix-matching indices and pixel-based overlays",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2012/06378961/12OmNApu5tJ",
"parentPublication": {
"id": "proceedings/ldav/2012/4733/0",
"title": "2012 IEEE Symposium on Large Data Analysis and Visualization (LDAV 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2012/0806/0/1000a033",
"title": "Optimizing the computation of n-point correlations on large-scale astronomical data",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2012/1000a033/12OmNs59JXo",
"parentPublication": {
"id": "proceedings/sc/2012/0806/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e-science/2014/4288/1/06972269",
"title": "Producing Data, Producing Software: Developing a Radio Astronomy Research Infrastructure",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2014/06972269/12OmNx6Piwl",
"parentPublication": {
"id": "proceedings/e-science/2014/4288/1",
"title": "2014 IEEE 10th International Conference on e-Science (e-Science)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssdm/1994/6610/0/00336952",
"title": "Modeling complex astrophysics data",
"doi": null,
"abstractUrl": "/proceedings-article/ssdm/1994/00336952/12OmNxymo8M",
"parentPublication": {
"id": "proceedings/ssdm/1994/6610/0",
"title": "Seventh International Working Conference on Scientific and Statistical Database Management",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2015/04/mcs2015040012",
"title": "Citizen Science with Hubble Space Telescope Data",
"doi": null,
"abstractUrl": "/magazine/cs/2015/04/mcs2015040012/13rRUB7a16U",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2014/09/mco2014090062",
"title": "Computing in Astronomy: Applications and Examples",
"doi": null,
"abstractUrl": "/magazine/co/2014/09/mco2014090062/13rRUwgQpya",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2017/02/mex2017020016",
"title": "Big Universe, Big Data: Machine Learning and Image Analysis for Astronomy",
"doi": null,
"abstractUrl": "/magazine/ex/2017/02/mex2017020016/13rRUxjyXeR",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e-science/2018/9156/0/915600a366",
"title": "Building the World's Largest Radio Telescope: The Square Kilometre Array Science Data Processor",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2018/915600a366/17D45WUj90G",
"parentPublication": {
"id": "proceedings/e-science/2018/9156/0",
"title": "2018 IEEE 14th International Conference on e-Science (e-Science)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2021/02/09387494",
"title": "Interactive Supercomputing With Jupyter",
"doi": null,
"abstractUrl": "/magazine/cs/2021/02/09387494/1smD2RIVLos",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msr/2021/8710/0/871000a550",
"title": "KGTorrent: A Dataset of Python Jupyter Notebooks from Kaggle",
"doi": null,
"abstractUrl": "/proceedings-article/msr/2021/871000a550/1tB7kckbXBS",
"parentPublication": {
"id": "proceedings/msr/2021/8710/0/",
"title": "2021 IEEE/ACM 18th International Conference on Mining Software Repositories (MSR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09387490",
"articleId": "1smCZM9XKSY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09354557",
"articleId": "1reXu4gJjri",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAWYKC7",
"title": "Nov.-Dec.",
"year": "2011",
"issueNum": "06",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "13",
"label": "Nov.-Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIJuxsx",
"doi": "10.1109/MCSE.2011.105",
"abstract": "General-relativistic visualization helps us understand what we could see when massive objects curve spacetime.",
"abstracts": [
{
"abstractType": "Regular",
"content": "General-relativistic visualization helps us understand what we could see when massive objects curve spacetime.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "General-relativistic visualization helps us understand what we could see when massive objects curve spacetime.",
"title": "General-Relativistic Visualization",
"normalizedTitle": "General-Relativistic Visualization",
"fno": "mcs2011060064",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"General Relativity",
"Visualization",
"Scientific Programming",
"Diagrams",
"Graphics Software",
"General Relativistic Visualization"
],
"authors": [
{
"givenName": "Thomas",
"surname": "Müller",
"fullName": "Thomas Müller",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Weiskopf",
"fullName": "Daniel Weiskopf",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2011-11-01 00:00:00",
"pubType": "mags",
"pages": "64-71",
"year": "2011",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cgiv/2010/4166/0/4166a035",
"title": "Visual Computer Game Features for Teaching Relativity",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2010/4166a035/12OmNCwCLuJ",
"parentPublication": {
"id": "proceedings/cgiv/2010/4166/0",
"title": "2010 Seventh International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780051",
"title": "Real-World Relativity: Image-Based Special Relativistic Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780051/12OmNrJAdYh",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1990/2056/0/00130108",
"title": "Time dilation visualization in relativity",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1990/00130108/12OmNxFJXs6",
"parentPublication": {
"id": "proceedings/sc/1990/2056/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1990/2056/0/00130104",
"title": "Building black holes, gravitational waves, and relativistic fluid flows: supercomputer cinema",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1990/00130104/12OmNy5hReF",
"parentPublication": {
"id": "proceedings/sc/1990/2056/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1989/341/0/05348962",
"title": "Visualizing relativistic effects in spacetime",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1989/05348962/12OmNyNQSB6",
"parentPublication": {
"id": "proceedings/sc/1989/341/0",
"title": "Proceedings of the 1989 ACM/IEEE Conference on Supercomputing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660074",
"title": "Visualization in the Einstein Year 2005: A Case Study on Explanatory and Illustrative Visualization of Relativity and Astrophysics",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660074/12OmNzTH0TG",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780012",
"title": "Four-Dimensional Non-Linear Ray Tracing as a Visualization Tool for Gravitational Physics",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780012/12OmNzWfoT3",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0522",
"title": "Explanatory and Illustrative Visualization of Special and General Relativity",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0522/13rRUwjXZS0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2011/04/mcs2011040085",
"title": "Special-Relativistic Visualization",
"doi": null,
"abstractUrl": "/magazine/cs/2011/04/mcs2011040085/13rRUx0ge9P",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061243",
"title": "Special Relativistic Visualization by Local Ray Tracing",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061243/13rRUxjyX3U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcs2011060052",
"articleId": "13rRUxC0SSx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcs2011060072",
"articleId": "13rRUyuegkC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxRWI3F",
"title": "April",
"year": "1989",
"issueNum": "04",
"idPrefix": "tp",
"pubType": "journal",
"volume": "11",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjQyic",
"doi": "10.1109/34.19043",
"abstract": "For a given set of n tuples, the binary consistency checking scheme generates a subset wherein no two elements intersect. The application of this scheme is illustrated by two problems in seismic horizon detection; seismic skeletonization and loop tying. After a brief introduction to seismic interpretation, these two examples are used to demonstrate how to cast an application problem into the formulism of the scheme. A comparison of this scheme to the dynamic programming approach to string matching due to S.Y. Lu (1982) is included.",
"abstracts": [
{
"abstractType": "Regular",
"content": "For a given set of n tuples, the binary consistency checking scheme generates a subset wherein no two elements intersect. The application of this scheme is illustrated by two problems in seismic horizon detection; seismic skeletonization and loop tying. After a brief introduction to seismic interpretation, these two examples are used to demonstrate how to cast an application problem into the formulism of the scheme. A comparison of this scheme to the dynamic programming approach to string matching due to S.Y. Lu (1982) is included.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "For a given set of n tuples, the binary consistency checking scheme generates a subset wherein no two elements intersect. The application of this scheme is illustrated by two problems in seismic horizon detection; seismic skeletonization and loop tying. After a brief introduction to seismic interpretation, these two examples are used to demonstrate how to cast an application problem into the formulism of the scheme. A comparison of this scheme to the dynamic programming approach to string matching due to S.Y. Lu (1982) is included.",
"title": "The Binary Consistency Checking Scheme and Its Applications to Seismic Horizon Detection",
"normalizedTitle": "The Binary Consistency Checking Scheme and Its Applications to Seismic Horizon Detection",
"fno": "i0439",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Binary Consistency Checking Seismic Horizon Detection Skeletonization Loop Tying Seismic Interpretation Computerised Pattern Recognition Geophysics Computing Seismology"
],
"authors": [],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "1989-04-01 00:00:00",
"pubType": "trans",
"pages": "439-447",
"year": "1989",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "i0429",
"articleId": "13rRUwfZC1h",
"__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": "13rRUypp57D",
"doi": "10.1109/TVCG.2012.259",
"abstract": "The most important resources to fulfill today's energy demands are fossil fuels, such as oil and natural gas. When exploiting hydrocarbon reservoirs, a detailed and credible model of the subsurface structures is crucial in order to minimize economic and ecological risks. Creating such a model is an inverse problem: reconstructing structures from measured reflection seismics. The major challenge here is twofold: First, the structures in highly ambiguous seismic data are interpreted in the time domain. Second, a velocity model has to be built from this interpretation to match the model to depth measurements from wells. If it is not possible to obtain a match at all positions, the interpretation has to be updated, going back to the first step. This results in a lengthy back and forth between the different steps, or in an unphysical velocity model in many cases. This paper presents a novel, integrated approach to interactively creating subsurface models from reflection seismics. It integrates the interpretation of the seismic data using an interactive horizon extraction technique based on piecewise global optimization with velocity modeling. Computing and visualizing the effects of changes to the interpretation and velocity model on the depth-converted model on the fly enables an integrated feedback loop that enables a completely new connection of the seismic data in time domain and well data in depth domain. Using a novel joint time/depth visualization, depicting side-by-side views of the original and the resulting depth-converted data, domain experts can directly fit their interpretation in time domain to spatial ground truth data. We have conducted a domain expert evaluation, which illustrates that the presented workflow enables the creation of exact subsurface models much more rapidly than previous approaches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The most important resources to fulfill today's energy demands are fossil fuels, such as oil and natural gas. When exploiting hydrocarbon reservoirs, a detailed and credible model of the subsurface structures is crucial in order to minimize economic and ecological risks. Creating such a model is an inverse problem: reconstructing structures from measured reflection seismics. The major challenge here is twofold: First, the structures in highly ambiguous seismic data are interpreted in the time domain. Second, a velocity model has to be built from this interpretation to match the model to depth measurements from wells. If it is not possible to obtain a match at all positions, the interpretation has to be updated, going back to the first step. This results in a lengthy back and forth between the different steps, or in an unphysical velocity model in many cases. This paper presents a novel, integrated approach to interactively creating subsurface models from reflection seismics. It integrates the interpretation of the seismic data using an interactive horizon extraction technique based on piecewise global optimization with velocity modeling. Computing and visualizing the effects of changes to the interpretation and velocity model on the depth-converted model on the fly enables an integrated feedback loop that enables a completely new connection of the seismic data in time domain and well data in depth domain. Using a novel joint time/depth visualization, depicting side-by-side views of the original and the resulting depth-converted data, domain experts can directly fit their interpretation in time domain to spatial ground truth data. We have conducted a domain expert evaluation, which illustrates that the presented workflow enables the creation of exact subsurface models much more rapidly than previous approaches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The most important resources to fulfill today's energy demands are fossil fuels, such as oil and natural gas. When exploiting hydrocarbon reservoirs, a detailed and credible model of the subsurface structures is crucial in order to minimize economic and ecological risks. Creating such a model is an inverse problem: reconstructing structures from measured reflection seismics. The major challenge here is twofold: First, the structures in highly ambiguous seismic data are interpreted in the time domain. Second, a velocity model has to be built from this interpretation to match the model to depth measurements from wells. If it is not possible to obtain a match at all positions, the interpretation has to be updated, going back to the first step. This results in a lengthy back and forth between the different steps, or in an unphysical velocity model in many cases. This paper presents a novel, integrated approach to interactively creating subsurface models from reflection seismics. It integrates the interpretation of the seismic data using an interactive horizon extraction technique based on piecewise global optimization with velocity modeling. Computing and visualizing the effects of changes to the interpretation and velocity model on the depth-converted model on the fly enables an integrated feedback loop that enables a completely new connection of the seismic data in time domain and well data in depth domain. Using a novel joint time/depth visualization, depicting side-by-side views of the original and the resulting depth-converted data, domain experts can directly fit their interpretation in time domain to spatial ground truth data. We have conducted a domain expert evaluation, which illustrates that the presented workflow enables the creation of exact subsurface models much more rapidly than previous approaches.",
"title": "SeiVis: An Interactive Visual Subsurface Modeling Application",
"normalizedTitle": "SeiVis: An Interactive Visual Subsurface Modeling Application",
"fno": "ttg2012122226",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Solid Modelling",
"Data Visualisation",
"Fossil Fuels",
"Geophysics Computing",
"Hydrocarbon Reservoirs",
"Interactive Systems",
"Natural Gas Technology",
"Optimisation",
"Seismology",
"Domain Expert Evaluation",
"Sei Vis",
"Interactive Visual Subsurface Modeling Application",
"Energy Demands",
"Fossil Fuels",
"Oil",
"Natural Gas",
"Hydrocarbon Reservoirs",
"Economic Risks",
"Ecological Risks",
"Measured Reflection Seismics",
"Ambiguous Seismic Data",
"Unphysical Velocity Model",
"Interactive Horizon Extraction Technique",
"Global Optimization",
"Velocity Modeling",
"Depth Converted Model",
"Time Depth Visualization",
"Spatial Ground Truth Data",
"Rendering Computer Graphics",
"Cost Function",
"Computational Modeling",
"Data Visualization",
"Biological System Modeling",
"Seismic Interpretation",
"Seismic Visualization",
"Volume Deformation",
"Exploded Views"
],
"authors": [
{
"givenName": "T.",
"surname": "Hollt",
"fullName": "T. Hollt",
"affiliation": "King Adbullah Univ. of Sci. & Technol., Thuwal, Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "W.",
"surname": "Freiler",
"fullName": "W. Freiler",
"affiliation": "SimVis GmbH, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "F.",
"surname": "Gschwantner",
"fullName": "F. Gschwantner",
"affiliation": "VRVis Res. Center, Vienna, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "H.",
"surname": "Doleisch",
"fullName": "H. Doleisch",
"affiliation": "SimVis GmbH, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "G.",
"surname": "Heinemann",
"fullName": "G. Heinemann",
"affiliation": "Heinemann Oil GmbH, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "M.",
"surname": "Hadwiger",
"fullName": "M. Hadwiger",
"affiliation": "King Adbullah Univ. of Sci. & Technol., Thuwal, Saudi Arabia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2226-2235",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ism/2009/3890/0/3890a495",
"title": "Enhancing the Functionality of Interactive TV with Content-Based Multimedia Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2009/3890a495/12OmNAmVH8Z",
"parentPublication": {
"id": "proceedings/ism/2009/3890/0",
"title": "2009 11th IEEE International Symposium on Multimedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/superc/2001/293/0/01592809",
"title": "Modeling of Seismic Wave Propagation at the Scale of the Earth on a Large Beowulf",
"doi": null,
"abstractUrl": "/proceedings-article/superc/2001/01592809/12OmNBCZnQn",
"parentPublication": {
"id": "proceedings/superc/2001/293/0",
"title": "ACM/IEEE SC 2001 Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2011/935/0/05742373",
"title": "Interactive seismic interpretation with piecewise global energy minimization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742373/12OmNrNh0AL",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1995/7042/0/70420597",
"title": "Perceptual organization in an interactive sketch editing application",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1995/70420597/12OmNxETaey",
"parentPublication": {
"id": "proceedings/iccv/1995/7042/0",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2010/05/mcg2010050032",
"title": "Newdle: Interactive Visual Exploration of Large Online News Collections",
"doi": null,
"abstractUrl": "/magazine/cg/2010/05/mcg2010050032/13rRUEgariC",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/1991/05/s5058",
"title": "Interactive Visual Modeling for Performance",
"doi": null,
"abstractUrl": "/magazine/so/1991/05/s5058/13rRUwI5TVE",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/05/07889056",
"title": "Sculpting Mountains: Interactive Terrain Modeling Based on Subsurface Geology",
"doi": null,
"abstractUrl": "/journal/tg/2018/05/07889056/13rRUwghd58",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2012/01/mcg2012010092",
"title": "Visual Analytics for Converging-Business-Ecosystem Intelligence",
"doi": null,
"abstractUrl": "/magazine/cg/2012/01/mcg2012010092/13rRUxNmPLf",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2005/10/k1363",
"title": "An Interactive Approach to Mining Gene Expression Data",
"doi": null,
"abstractUrl": "/journal/tk/2005/10/k1363/13rRUxly95W",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2001/1990/0/01592809",
"title": "Modeling of Seismic Wave Propagation at the Scale of the Earth on a Large Beowulf",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2001/01592809/1MEX76XUUUw",
"parentPublication": {
"id": "proceedings/sc/2001/1990/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012122216",
"articleId": "13rRUy0HYRo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122236",
"articleId": "13rRUEgarnI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesUE",
"name": "ttg2012122226s2.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012122226s2.mp4",
"extension": "mp4",
"size": "12.1 MB",
"__typename": "WebExtraType"
},
{
"id": "17ShDTYesUD",
"name": "ttg2012122226s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012122226s1.mp4",
"extension": "mp4",
"size": "383 kB",
"__typename": "WebExtraType"
}
],
"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": "13rRUB6Sq0v",
"doi": "10.1109/TVCG.2009.197",
"abstract": "Due to its nonlinear nature, the climate system shows quite high natural variability on different time scales, including multiyear oscillations such as the El Ni&#732;no Southern Oscillation phenomenon. Beside a shift of the mean states and of extreme values of climate variables, climate change may also change the frequency or the spatial patterns of these natural climate variations. Wavelet analysis is a well established tool to investigate variability in the frequency domain. However, due to the size and complexity of the analysis results, only few time series are commonly analyzed concurrently. In this paper we will explore different techniques to visually assist the user in the analysis of variability and variability changes to allow for a holistic analysis of a global climate model data set consisting of several variables and extending over 250 years. Our new framework and data from the IPCC AR4 simulations with the coupled climate model ECHAM5/MPI-OM are used to explore the temporal evolution of El Ni&#732;no due to climate change.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Due to its nonlinear nature, the climate system shows quite high natural variability on different time scales, including multiyear oscillations such as the El Ni&#732;no Southern Oscillation phenomenon. Beside a shift of the mean states and of extreme values of climate variables, climate change may also change the frequency or the spatial patterns of these natural climate variations. Wavelet analysis is a well established tool to investigate variability in the frequency domain. However, due to the size and complexity of the analysis results, only few time series are commonly analyzed concurrently. In this paper we will explore different techniques to visually assist the user in the analysis of variability and variability changes to allow for a holistic analysis of a global climate model data set consisting of several variables and extending over 250 years. Our new framework and data from the IPCC AR4 simulations with the coupled climate model ECHAM5/MPI-OM are used to explore the temporal evolution of El Ni&#732;no due to climate change.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Due to its nonlinear nature, the climate system shows quite high natural variability on different time scales, including multiyear oscillations such as the El Ni˜no Southern Oscillation phenomenon. Beside a shift of the mean states and of extreme values of climate variables, climate change may also change the frequency or the spatial patterns of these natural climate variations. Wavelet analysis is a well established tool to investigate variability in the frequency domain. However, due to the size and complexity of the analysis results, only few time series are commonly analyzed concurrently. In this paper we will explore different techniques to visually assist the user in the analysis of variability and variability changes to allow for a holistic analysis of a global climate model data set consisting of several variables and extending over 250 years. Our new framework and data from the IPCC AR4 simulations with the coupled climate model ECHAM5/MPI-OM are used to explore the temporal evolution of El Ni˜no due to climate change.",
"title": "Visual Exploration of Climate Variability Changes Using Wavelet Analysis",
"normalizedTitle": "Visual Exploration of Climate Variability Changes Using Wavelet Analysis",
"fno": "ttg2009061375",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Climatology",
"Data Visualisation",
"Geophysics Computing",
"Wavelet Transforms",
"Visual Exploration",
"Climate Variability Changes",
"Wavelet Analysis",
"Multiyear Oscillations",
"El Nino Southern Oscillation Phenomenon",
"Frequency Domain",
"IPCC AR 4 Simulations",
"ECHAM 5 MPI OM",
"Wavelet Analysis",
"Data Visualization",
"Ocean Temperature",
"Climate Change",
"Sea Surface",
"Time Series Analysis",
"Data Analysis",
"Fluctuations",
"Environmental Factors",
"Sea Level",
"Wavelet Analysis",
"Multivariate Data",
"Time Dependent Data",
"Climate Variability Change Visualization",
"El Nino"
],
"authors": [
{
"givenName": "Heike",
"surname": "Janicke",
"fullName": "Heike Janicke",
"affiliation": "University of Leipzig",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Bottinger",
"fullName": "Michael Bottinger",
"affiliation": "German Climate Computing Center (DKRZ)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Uwe",
"surname": "Mikolajewicz",
"fullName": "Uwe Mikolajewicz",
"affiliation": "Max Planck Institute for Meteorology (MPI-M)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gerik",
"surname": "Scheuermann",
"fullName": "Gerik Scheuermann",
"affiliation": "University of Leipzig",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2009-11-01 00:00:00",
"pubType": "trans",
"pages": "1375-1382",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sccompanion/2012/4956/0/4956a483",
"title": "Exploratory Climate Data Visualization and Analysis Using DV3D and UVCDAT",
"doi": null,
"abstractUrl": "/proceedings-article/sccompanion/2012/4956a483/12OmNwtn3BU",
"parentPublication": {
"id": "proceedings/sccompanion/2012/4956/0",
"title": "2012 SC Companion: High Performance Computing, Networking Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2011/0868/0/06004058",
"title": "Information Visualization in Climate Research",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2011/06004058/12OmNyO8tVC",
"parentPublication": {
"id": "proceedings/iv/2011/0868/0",
"title": "2011 15th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/2011/06/mso2011060043",
"title": "Managing Software Complexity and Variability in Coupled Climate Models",
"doi": null,
"abstractUrl": "/magazine/so/2011/06/mso2011060043/13rRUwghd7n",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2014/11/mco2014110074",
"title": "Theory-Guided Data Science for Climate Change",
"doi": null,
"abstractUrl": "/magazine/co/2014/11/mco2014110074/13rRUxC0Srh",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061579",
"title": "Hypothesis Generation in Climate Research with Interactive Visual Data Exploration",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061579/13rRUxlgy3y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2015/06/mcs2015060009",
"title": "Climate Computing: The State of Play",
"doi": null,
"abstractUrl": "/magazine/cs/2015/06/mcs2015060009/13rRUyZaxu4",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/03/08305502",
"title": "Exploring Variability within Ensembles of Decadal Climate Predictions",
"doi": null,
"abstractUrl": "/journal/tg/2019/03/08305502/17D45WWzW55",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2018/9288/0/928800a758",
"title": "Extreme Values from Spatiotemporal Chaos: Precipitation Extremes and Climate Variability",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2018/928800a758/18jXFBH7KI8",
"parentPublication": {
"id": "proceedings/icdmw/2018/9288/0",
"title": "2018 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse-euc/2019/1664/0/166400a331",
"title": "Human-AI Symbiosis: Decode Climate Change to Prevent Heat-Related Mortalities and to Protect Our Most Vulnerable Population",
"doi": null,
"abstractUrl": "/proceedings-article/cse-euc/2019/166400a331/1fHkylRfQHe",
"parentPublication": {
"id": "proceedings/cse-euc/2019/1664/0",
"title": "2019 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smartiot/2021/4511/0/451100a275",
"title": "Effects of ENSO on Climate and Garlic Yield in Main Garlic Production Areas of China",
"doi": null,
"abstractUrl": "/proceedings-article/smartiot/2021/451100a275/1xDQbXVBJPG",
"parentPublication": {
"id": "proceedings/smartiot/2021/4511/0",
"title": "2021 IEEE International Conference on Smart Internet of Things (SmartIoT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009061367",
"articleId": "13rRUxly8XB",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2009061383",
"articleId": "13rRUwfI0Q3",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBl6EK8",
"title": "Nov.-Dec.",
"year": "2011",
"issueNum": "06",
"idPrefix": "so",
"pubType": "magazine",
"volume": "28",
"label": "Nov.-Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwgQpBi",
"doi": "10.1109/MS.2011.141",
"abstract": "Climate change is likely to be one of the defining global issues of the 21st century. The past decade—the hottest in recorded history—has witnessed countries around the world struggling to deal with drought, heat waves, and extreme weather. The sheer scale of the problem also makes it hard to understand, predict, and solve. Climate science journals regularly publish special issues on specific climate models, typically timed to present results from a major new release of a given model. However, these tend to focus on the new science that the model enables, rather than to describe the software and its development. This special issue of IEEE Software magazine focuses on the \"software\" behind climate change models.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Climate change is likely to be one of the defining global issues of the 21st century. The past decade—the hottest in recorded history—has witnessed countries around the world struggling to deal with drought, heat waves, and extreme weather. The sheer scale of the problem also makes it hard to understand, predict, and solve. Climate science journals regularly publish special issues on specific climate models, typically timed to present results from a major new release of a given model. However, these tend to focus on the new science that the model enables, rather than to describe the software and its development. This special issue of IEEE Software magazine focuses on the \"software\" behind climate change models.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Climate change is likely to be one of the defining global issues of the 21st century. The past decade—the hottest in recorded history—has witnessed countries around the world struggling to deal with drought, heat waves, and extreme weather. The sheer scale of the problem also makes it hard to understand, predict, and solve. Climate science journals regularly publish special issues on specific climate models, typically timed to present results from a major new release of a given model. However, these tend to focus on the new science that the model enables, rather than to describe the software and its development. This special issue of IEEE Software magazine focuses on the \"software\" behind climate change models.",
"title": "Guest Editors' Introduction: Climate Change - Science and Software",
"normalizedTitle": "Guest Editors' Introduction: Climate Change - Science and Software",
"fno": "mso2011060032",
"hasPdf": true,
"idPrefix": "so",
"keywords": [
"Software Development",
"Meteorology",
"Atmospheric Measurements",
"Weather Forecasting",
"Terrestrial Atmosphere",
"Greenhouse Effect",
"Global Warming",
"Climate Change",
"Earth Systems",
"Climate Models"
],
"authors": [
{
"givenName": "Steve M.",
"surname": "Easterbrook",
"fullName": "Steve M. Easterbrook",
"affiliation": "University of Toronto",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Paul N.",
"surname": "Edwards",
"fullName": "Paul N. Edwards",
"affiliation": "University of Michigan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Venkatramani",
"surname": "Balaji",
"fullName": "Venkatramani Balaji",
"affiliation": "Princeton University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Reinhard",
"surname": "Budich",
"fullName": "Reinhard Budich",
"affiliation": "Max Planck Institute for Meteorology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "06",
"pubDate": "2011-11-01 00:00:00",
"pubType": "mags",
"pages": "32-35",
"year": "2011",
"issn": "0740-7459",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icalt/2011/4346/0/4346a401",
"title": "Paleoclimate Clues: Problem-Based Learning Digital Media for Climate Science",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2011/4346a401/12OmNwAt1DW",
"parentPublication": {
"id": "proceedings/icalt/2011/4346/0",
"title": "Advanced Learning Technologies, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciii/2010/4279/1/4279a209",
"title": "Carbon Management Strategy of Tourism in Response to Climate Change",
"doi": null,
"abstractUrl": "/proceedings-article/iciii/2010/4279a209/12OmNxETalL",
"parentPublication": {
"id": "proceedings/iciii/2010/4279/1",
"title": "International Conference on Information Management, Innovation Management and Industrial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wesaac/2011/4645/0/4645a104",
"title": "Net Logo and the Climate Change Model as a Tool for the Simulation of the Greenhouse Effect",
"doi": null,
"abstractUrl": "/proceedings-article/wesaac/2011/4645a104/12OmNyU63ti",
"parentPublication": {
"id": "proceedings/wesaac/2011/4645/0",
"title": "Agent Systems, their Environment and Applications, Workshop and School of",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2015/04/mcs2015040008",
"title": "Citizen Science [Guest editors' introduction]",
"doi": null,
"abstractUrl": "/magazine/cs/2015/04/mcs2015040008/13rRUx0gejl",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2014/11/mco2014110074",
"title": "Theory-Guided Data Science for Climate Change",
"doi": null,
"abstractUrl": "/magazine/co/2014/11/mco2014110074/13rRUxC0Srh",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2013/05/mcs2013050032",
"title": "Climate Informatics: Accelerating Discovering in Climate Science with Machine Learning",
"doi": null,
"abstractUrl": "/magazine/cs/2013/05/mcs2013050032/13rRUy2YLOR",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2011/05/mcs2011050036",
"title": "Climate Change Modeling: Computational Opportunities and Challenges",
"doi": null,
"abstractUrl": "/magazine/cs/2011/05/mcs2011050036/13rRUyoPSSG",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/2011/06/mso2011060056",
"title": "Enabling Open Development Methodologies in Climate Change Assessment Modeling",
"doi": null,
"abstractUrl": "/magazine/so/2011/06/mso2011060056/13rRUypp55Q",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/01/09325141",
"title": "Visualization of Climate Change",
"doi": null,
"abstractUrl": "/magazine/cg/2021/01/09325141/1qnQSeB3gME",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hipc/2020/2292/0/229200z019",
"title": "Computing and Data Challenges in Climate Change",
"doi": null,
"abstractUrl": "/proceedings-article/hipc/2020/229200z019/1taEYrNTNGo",
"parentPublication": {
"id": "proceedings/hipc/2020/2292/0",
"title": "2020 IEEE 27th International Conference on High Performance Computing, Data, and Analytics (HiPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mso2011060029",
"articleId": "13rRUxBJhte",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mso2011060036",
"articleId": "13rRUwbs2eL",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrIaecf",
"title": "January/February",
"year": "2009",
"issueNum": "01",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "29",
"label": "January/February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjXZMf",
"doi": "10.1109/MCG.2009.19",
"abstract": "Advances in scientific understanding have confirmed the fact of climate change driven primarily by rising carbon dioxide levels. Current understanding of CO&#x2082; emissions at space-time scales that are meaningful for carbon-cycle science, climate-change research, industrial management, and carbon trading is limited. The Vulcan Project quantified 2002 US fossil-fuel CO&#x2082; emissions down to the level of individual factories, power plants, roadways, and subcounty residential areas and placed the complete inventory on a common 10 km2/hourly grid to facilitate atmospheric modeling. Standard volume or GIS techniques can help visualize the data, but its size requires specialized techniques.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Advances in scientific understanding have confirmed the fact of climate change driven primarily by rising carbon dioxide levels. Current understanding of CO&#x2082; emissions at space-time scales that are meaningful for carbon-cycle science, climate-change research, industrial management, and carbon trading is limited. The Vulcan Project quantified 2002 US fossil-fuel CO&#x2082; emissions down to the level of individual factories, power plants, roadways, and subcounty residential areas and placed the complete inventory on a common 10 km2/hourly grid to facilitate atmospheric modeling. Standard volume or GIS techniques can help visualize the data, but its size requires specialized techniques.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Advances in scientific understanding have confirmed the fact of climate change driven primarily by rising carbon dioxide levels. Current understanding of CO₂ emissions at space-time scales that are meaningful for carbon-cycle science, climate-change research, industrial management, and carbon trading is limited. The Vulcan Project quantified 2002 US fossil-fuel CO₂ emissions down to the level of individual factories, power plants, roadways, and subcounty residential areas and placed the complete inventory on a common 10 km2/hourly grid to facilitate atmospheric modeling. Standard volume or GIS techniques can help visualize the data, but its size requires specialized techniques.",
"title": "Visual Exploration of the Vulcan CO&#x2082; Data",
"normalizedTitle": "Visual Exploration of the Vulcan CO₂ Data",
"fno": "mcg2009010006",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Climate Mitigation",
"Data Visualisation",
"Visual Exploration",
"Vulcan Data",
"North American Carbon Program",
"Fossil Fuel Carbon Dioxide Emissions",
"Atmospheric Modeling",
"Industrial Classification",
"Global Warming",
"Carbon Dioxide",
"Data Visualization",
"Fuels",
"Combustion",
"Power Generation",
"Manufacturing Industries",
"Metals Industry",
"Air Pollution",
"Acceleration",
"Climate Change",
"Visual Analytics",
"CO Amp X 2082",
"Multivariate And Spatiotemporal Data",
"Volume Visualization",
"GIS",
"Interactive Visualization",
"Vulcan Project"
],
"authors": [
{
"givenName": "Nathan",
"surname": "Andrysco",
"fullName": "Nathan Andrysco",
"affiliation": "Purdue University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kevin Robert",
"surname": "Gurney",
"fullName": "Kevin Robert Gurney",
"affiliation": "Purdue University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bedrich",
"surname": "Beneš",
"fullName": "Bedrich Beneš",
"affiliation": "Purdue University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kathy",
"surname": "Corbin",
"fullName": "Kathy Corbin",
"affiliation": "Colorado State University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2009-01-01 00:00:00",
"pubType": "mags",
"pages": "6-11",
"year": "2009",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/issst/2010/7094/0/05507704",
"title": "Determining an equitable allocation Of global carbon dioxide emissions",
"doi": null,
"abstractUrl": "/proceedings-article/issst/2010/05507704/12OmNApLGAh",
"parentPublication": {
"id": "proceedings/issst/2010/7094/0",
"title": "IEEE International Symposium on Sustainable Systems and Technology (ISSST 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issst/2010/7094/0/05507678",
"title": "Significant global variability in a facility-level greenhouse gas assessment of primary nickel",
"doi": null,
"abstractUrl": "/proceedings-article/issst/2010/05507678/12OmNArthbw",
"parentPublication": {
"id": "proceedings/issst/2010/7094/0",
"title": "IEEE International Symposium on Sustainable Systems and Technology (ISSST 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icece/2010/4031/0/4031d443",
"title": "Carbon Emissions Trading and Sustainable Development of Power Industry",
"doi": null,
"abstractUrl": "/proceedings-article/icece/2010/4031d443/12OmNvkGW2S",
"parentPublication": {
"id": "proceedings/icece/2010/4031/0",
"title": "Electrical and Control Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciii/2010/4279/1/4279a209",
"title": "Carbon Management Strategy of Tourism in Response to Climate Change",
"doi": null,
"abstractUrl": "/proceedings-article/iciii/2010/4279a209/12OmNxETalL",
"parentPublication": {
"id": "proceedings/iciii/2010/4279/1",
"title": "International Conference on Information Management, Innovation Management and Industrial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cesce/2010/3972/2/3972b085",
"title": "Carbon Dioxide Emissions in Chongqing Industry Sector - Base on Input-Output Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/cesce/2010/3972b085/12OmNyoSbfL",
"parentPublication": {
"id": "proceedings/cesce/2010/3972/1",
"title": "Challenges in Environmental Science and Computer Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbi/2016/3231/1/3231a163",
"title": "Introducing Greenhouse Emissions in Cost Optimization of Fault-Tolerant Data Center Design",
"doi": null,
"abstractUrl": "/proceedings-article/cbi/2016/3231a163/12OmNzDNtuZ",
"parentPublication": {
"id": "proceedings/cbi/2016/3231/2",
"title": "2016 IEEE 18th Conference on Business Informatics (CBI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issst/2011/394/0/05936861",
"title": "Modeling the effects of energy efficiency improvements on life cycle greenhouse gas emissions of products and in determining policy effectiveness",
"doi": null,
"abstractUrl": "/proceedings-article/issst/2011/05936861/12OmNzaQosB",
"parentPublication": {
"id": "proceedings/issst/2011/394/0",
"title": "2011 IEEE International Symposium on Sustainable Systems and Technology (ISSST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icedcs/2022/5541/0/554100a281",
"title": "Intelligent Prediction Model of Emissions Based on Whale Algorithm Optimized BP Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/icedcs/2022/554100a281/1JC1AyGh6iQ",
"parentPublication": {
"id": "proceedings/icedcs/2022/5541/0",
"title": "2022 International Conference on Electronics and Devices, Computational Science (ICEDCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ic3/2019/3591/0/08844902",
"title": "Prediction of CO<inf>2</inf> emissions using deep learning hybrid approach: A Case Study in Indian Context",
"doi": null,
"abstractUrl": "/proceedings-article/ic3/2019/08844902/1dx8pnekj0k",
"parentPublication": {
"id": "proceedings/ic3/2019/3591/0",
"title": "2019 Twelfth International Conference on Contemporary Computing (IC3)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itca/2020/0378/0/037800a420",
"title": "Research on Decomposition and Periodic Fluctuation of Influencing Factors of China's Carbon Emissions Based on Data Mining Technology",
"doi": null,
"abstractUrl": "/proceedings-article/itca/2020/037800a420/1tpBk4gHahi",
"parentPublication": {
"id": "proceedings/itca/2020/0378/0",
"title": "2020 2nd International Conference on Information Technology and Computer Application (ITCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2009010004",
"articleId": "13rRUEgs2Ot",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2009010012",
"articleId": "13rRUx0geC1",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzZEAyh",
"title": "September/October",
"year": "2011",
"issueNum": "05",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "13",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyoPSSG",
"doi": "10.1109/MCSE.2010.147",
"abstract": "High-fidelity climate models are the workhorses of modern climate change sciences. In this article, the authors focus on several computational issues associated with climate change modeling, covering simulation methodologies, temporal and spatial modeling restrictions, the role of high-end computing, as well as the importance of data-driven regional climate impact modeling.",
"abstracts": [
{
"abstractType": "Regular",
"content": "High-fidelity climate models are the workhorses of modern climate change sciences. In this article, the authors focus on several computational issues associated with climate change modeling, covering simulation methodologies, temporal and spatial modeling restrictions, the role of high-end computing, as well as the importance of data-driven regional climate impact modeling.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "High-fidelity climate models are the workhorses of modern climate change sciences. In this article, the authors focus on several computational issues associated with climate change modeling, covering simulation methodologies, temporal and spatial modeling restrictions, the role of high-end computing, as well as the importance of data-driven regional climate impact modeling.",
"title": "Climate Change Modeling: Computational Opportunities and Challenges",
"normalizedTitle": "Climate Change Modeling: Computational Opportunities and Challenges",
"fno": "mcs2011050036",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Heat Transfer",
"Software Engineering",
"Climate Change Modeling",
"High Fidelity Climate Model",
"Spatial Modeling",
"Temporal Modeling",
"Meteorology",
"Atmospheric Measurements",
"Computational Modeling",
"Modeling",
"System Analysis And Design",
"Climate Change",
"Climate Change Modeling",
"Computational Sciences",
"High End Computing",
"Climate Impact Analysis",
"Multiscale System Modeling",
"Scientific Computing"
],
"authors": [
{
"givenName": "Dali",
"surname": "Wang",
"fullName": "Dali Wang",
"affiliation": "Oak Ridge National Laboratory",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wilfred",
"surname": "Post",
"fullName": "Wilfred Post",
"affiliation": "Oak Ridge National Laboratory",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bruce",
"surname": "Wilson",
"fullName": "Bruce Wilson",
"affiliation": "Oak Ridge National Laboratory",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2011-09-01 00:00:00",
"pubType": "mags",
"pages": "36-42",
"year": "2011",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "mags/so/2011/06/mso2011060032",
"title": "Guest Editors' Introduction: Climate Change - Science and Software",
"doi": null,
"abstractUrl": "/magazine/so/2011/06/mso2011060032/13rRUwgQpBi",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2013/05/mcs2013050032",
"title": "Climate Informatics: Accelerating Discovering in Climate Science with Machine Learning",
"doi": null,
"abstractUrl": "/magazine/cs/2013/05/mcs2013050032/13rRUy2YLOR",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2015/06/mcs2015060009",
"title": "Climate Computing: The State of Play",
"doi": null,
"abstractUrl": "/magazine/cs/2015/06/mcs2015060009/13rRUyZaxu4",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/2011/06/mso2011060056",
"title": "Enabling Open Development Methodologies in Climate Change Assessment Modeling",
"doi": null,
"abstractUrl": "/magazine/so/2011/06/mso2011060056/13rRUypp55Q",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2019/4896/0/489600a252",
"title": "Climate Change Perception in Scientific and Public Sphere",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2019/489600a252/1gAwRMf6b3q",
"parentPublication": {
"id": "proceedings/icdmw/2019/4896/0",
"title": "2019 International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/01/09281098",
"title": "Dynamic 3-D Visualization of Climate Model Development and Results",
"doi": null,
"abstractUrl": "/magazine/cg/2021/01/09281098/1phO0N1Fhte",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/01/09325141",
"title": "Visualization of Climate Change",
"doi": null,
"abstractUrl": "/magazine/cg/2021/01/09325141/1qnQSeB3gME",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2021/03/09384262",
"title": "Bringing the Future Into Focus: Benefits and Challenges of High-Resolution Global Climate Change Simulations",
"doi": null,
"abstractUrl": "/magazine/cs/2021/03/09384262/1scDqsJ2diM",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2020/1056/0/09381419",
"title": "Affective Polarization in Online Climate Change Discourse on Twitter",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2020/09381419/1semx89mBhK",
"parentPublication": {
"id": "proceedings/asonam/2020/1056/0",
"title": "2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hipc/2020/2292/0/229200z019",
"title": "Computing and Data Challenges in Climate Change",
"doi": null,
"abstractUrl": "/proceedings-article/hipc/2020/229200z019/1taEYrNTNGo",
"parentPublication": {
"id": "proceedings/hipc/2020/2292/0",
"title": "2020 IEEE 27th International Conference on High Performance Computing, Data, and Analytics (HiPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcs2011050024",
"articleId": "13rRUxBa5fA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcs2011050043",
"articleId": "13rRUxbCbmt",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrYlmwf",
"title": "January",
"year": "1996",
"issueNum": "01",
"idPrefix": "co",
"pubType": "magazine",
"volume": "29",
"label": "January",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgs2Pf",
"doi": "10.1109/2.481465",
"abstract": "During the past few years, new surgical techniques have been developed to improve the quality of operations and reduce patient pain. Minimally invasive surgery, robot-assisted hip replacement, and image-guided treatment planning during the actual operation are key developments. Another new procedure, computer-assisted surgery (CAS), helps surgeons find their bearings during operations under difficult visual conditions. These include brain surgery and other head operations. CAS combines coordinate measurements of the operating instruments and superimposes their positions onto images of the operation area so that surgeons can follow instrument movements on a computer screen. Since 1986, the Institute for Measurement Techniques (Lehrstuhl für Meßtechnik) has been working closely with with the Aachen University Hospital to develop CAS systems. Based on this work, an industrial partner, Philips Medical Systems, has developed a commercial system for neurosurgery. This article provides an overview of the development process and an outlook on possible applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "During the past few years, new surgical techniques have been developed to improve the quality of operations and reduce patient pain. Minimally invasive surgery, robot-assisted hip replacement, and image-guided treatment planning during the actual operation are key developments. Another new procedure, computer-assisted surgery (CAS), helps surgeons find their bearings during operations under difficult visual conditions. These include brain surgery and other head operations. CAS combines coordinate measurements of the operating instruments and superimposes their positions onto images of the operation area so that surgeons can follow instrument movements on a computer screen. Since 1986, the Institute for Measurement Techniques (Lehrstuhl für Meßtechnik) has been working closely with with the Aachen University Hospital to develop CAS systems. Based on this work, an industrial partner, Philips Medical Systems, has developed a commercial system for neurosurgery. This article provides an overview of the development process and an outlook on possible applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "During the past few years, new surgical techniques have been developed to improve the quality of operations and reduce patient pain. Minimally invasive surgery, robot-assisted hip replacement, and image-guided treatment planning during the actual operation are key developments. Another new procedure, computer-assisted surgery (CAS), helps surgeons find their bearings during operations under difficult visual conditions. These include brain surgery and other head operations. CAS combines coordinate measurements of the operating instruments and superimposes their positions onto images of the operation area so that surgeons can follow instrument movements on a computer screen. Since 1986, the Institute for Measurement Techniques (Lehrstuhl für Meßtechnik) has been working closely with with the Aachen University Hospital to develop CAS systems. Based on this work, an industrial partner, Philips Medical Systems, has developed a commercial system for neurosurgery. This article provides an overview of the development process and an outlook on possible applications.",
"title": "An Optical Navigator for Brain Surgery",
"normalizedTitle": "An Optical Navigator for Brain Surgery",
"fno": "r1048",
"hasPdf": true,
"idPrefix": "co",
"keywords": [],
"authors": [
{
"givenName": "Ludwig",
"surname": "Adams",
"fullName": "Ludwig Adams",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Achim",
"surname": "Knepper",
"fullName": "Achim Knepper",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dietrich",
"surname": "Meyer-Ebrecht",
"fullName": "Dietrich Meyer-Ebrecht",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rainer",
"surname": "Rüger",
"fullName": "Rainer Rüger",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Willem",
"surname": "van der Brug",
"fullName": "Willem van der Brug",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "1996-01-01 00:00:00",
"pubType": "mags",
"pages": "48-54",
"year": "1996",
"issn": "0018-9162",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "r1039",
"articleId": "13rRUxC0SqR",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "r1055",
"articleId": "13rRUyv53Iv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBuL16w",
"title": "July",
"year": "1995",
"issueNum": "07",
"idPrefix": "co",
"pubType": "magazine",
"volume": "28",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxC0Szg",
"doi": "10.1109/2.391037",
"abstract": "The authors' computer-based neurosurgical planning system, Netra, incorporates a 3D user interface based on the two-handed physical manipulation of handheld tools in free space. These user-interface props help transfer the neurosurgeon's skills for manipulating tools to operating a user interface for visualizing 3D medical images. From the surgeon's perspective, the interface is analogous to holding a miniature head in one hand. This head can be \"sliced open\" or pointed to via a cross-sectioning plane or a stylus tool, respectively, held in the other hand. The authors' informal evaluations of over 50 neurosurgeons have shown that with a cursory introduction, surgeons can understand and use the interface within about one minute of touching the props. The system is intended for clinical use by neurosurgeons doing real work. The authors have tested it in the context of surgical procedures involving real patients. In fact, various components of Netra have been used for approximately 40 patients in clinical cases involving epilepsy, brain tumors, or neurological-based motor disorders. Initial experiences indicate that technology-based systems such as Netra can significantly contribute to the surgical management of patients with certain neurological diseases.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The authors' computer-based neurosurgical planning system, Netra, incorporates a 3D user interface based on the two-handed physical manipulation of handheld tools in free space. These user-interface props help transfer the neurosurgeon's skills for manipulating tools to operating a user interface for visualizing 3D medical images. From the surgeon's perspective, the interface is analogous to holding a miniature head in one hand. This head can be \"sliced open\" or pointed to via a cross-sectioning plane or a stylus tool, respectively, held in the other hand. The authors' informal evaluations of over 50 neurosurgeons have shown that with a cursory introduction, surgeons can understand and use the interface within about one minute of touching the props. The system is intended for clinical use by neurosurgeons doing real work. The authors have tested it in the context of surgical procedures involving real patients. In fact, various components of Netra have been used for approximately 40 patients in clinical cases involving epilepsy, brain tumors, or neurological-based motor disorders. Initial experiences indicate that technology-based systems such as Netra can significantly contribute to the surgical management of patients with certain neurological diseases.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The authors' computer-based neurosurgical planning system, Netra, incorporates a 3D user interface based on the two-handed physical manipulation of handheld tools in free space. These user-interface props help transfer the neurosurgeon's skills for manipulating tools to operating a user interface for visualizing 3D medical images. From the surgeon's perspective, the interface is analogous to holding a miniature head in one hand. This head can be \"sliced open\" or pointed to via a cross-sectioning plane or a stylus tool, respectively, held in the other hand. The authors' informal evaluations of over 50 neurosurgeons have shown that with a cursory introduction, surgeons can understand and use the interface within about one minute of touching the props. The system is intended for clinical use by neurosurgeons doing real work. The authors have tested it in the context of surgical procedures involving real patients. In fact, various components of Netra have been used for approximately 40 patients in clinical cases involving epilepsy, brain tumors, or neurological-based motor disorders. Initial experiences indicate that technology-based systems such as Netra can significantly contribute to the surgical management of patients with certain neurological diseases.",
"title": "Two-Handed Spatial Interface Tools for Neurosurgical Planning",
"normalizedTitle": "Two-Handed Spatial Interface Tools for Neurosurgical Planning",
"fno": "r7020",
"hasPdf": true,
"idPrefix": "co",
"keywords": [
"3 D Neurosurgical Planning",
"Image Guided Surgery",
"3 D Interaction",
"Two Handed Interaction",
"Haptic Input",
"Desktop Virtual Reality",
"Props Based Interface"
],
"authors": [
{
"givenName": "John C.",
"surname": "Goble",
"fullName": "John C. Goble",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ken",
"surname": "Hinckley",
"fullName": "Ken Hinckley",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Randy",
"surname": "Pausch",
"fullName": "Randy Pausch",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "John W.",
"surname": "Snell",
"fullName": "John W. Snell",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Neal F.",
"surname": "Kassell",
"fullName": "Neal F. Kassell",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "1995-07-01 00:00:00",
"pubType": "mags",
"pages": "20-26",
"year": "1995",
"issn": "0018-9162",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "r7017",
"articleId": "13rRUxEhFvA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "r7027",
"articleId": "13rRUNvyaoc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrFBPWq",
"title": "September-October",
"year": "2006",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "12",
"label": "September-October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjXZS4",
"doi": "10.1109/TVCG.2006.197",
"abstract": "Thread-like structures are becoming more common in modern volumetric data sets as our ability to image vascular and neural tissue at higher resolutions improves. The thread-like structures of neurons and micro-vessels pose a unique problem in visualization since they tend to be densely packed in small volumes of tissue. This makes it difficult for an observer to interpret useful patterns from the data or trace individual fibers. In this paper we describe several methods for dealing with large amounts of thread-like data, such as data sets collected using Knife-Edge Scanning Microscopy (KESM) and Serial Block-Face Scanning Electron Microscopy (SBF-SEM). These methods allow us to collect volumetric data from embedded samples of whole-brain tissue. The neuronal and microvascular data that we acquire consists of thin, branching structures extending over very large regions. Traditional visualization schemes are not sufficient to make sense of the large, dense, complex structures encountered. In this paper, we address three methods to allow a user to explore a fiber network effectively. We describe interactive techniques for rendering large sets of neurons using self-orienting surfaces implemented on the GPU. We also present techniques for rendering fiber networks in a way that provides useful information about flow and orientation. Third, a global illumination framework is used to create high-quality visualizations that emphasize the underlying fiber structure. Implementation details, performance, and advantages and disadvantages of each approach are discussed.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Thread-like structures are becoming more common in modern volumetric data sets as our ability to image vascular and neural tissue at higher resolutions improves. The thread-like structures of neurons and micro-vessels pose a unique problem in visualization since they tend to be densely packed in small volumes of tissue. This makes it difficult for an observer to interpret useful patterns from the data or trace individual fibers. In this paper we describe several methods for dealing with large amounts of thread-like data, such as data sets collected using Knife-Edge Scanning Microscopy (KESM) and Serial Block-Face Scanning Electron Microscopy (SBF-SEM). These methods allow us to collect volumetric data from embedded samples of whole-brain tissue. The neuronal and microvascular data that we acquire consists of thin, branching structures extending over very large regions. Traditional visualization schemes are not sufficient to make sense of the large, dense, complex structures encountered. In this paper, we address three methods to allow a user to explore a fiber network effectively. We describe interactive techniques for rendering large sets of neurons using self-orienting surfaces implemented on the GPU. We also present techniques for rendering fiber networks in a way that provides useful information about flow and orientation. Third, a global illumination framework is used to create high-quality visualizations that emphasize the underlying fiber structure. Implementation details, performance, and advantages and disadvantages of each approach are discussed.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Thread-like structures are becoming more common in modern volumetric data sets as our ability to image vascular and neural tissue at higher resolutions improves. The thread-like structures of neurons and micro-vessels pose a unique problem in visualization since they tend to be densely packed in small volumes of tissue. This makes it difficult for an observer to interpret useful patterns from the data or trace individual fibers. In this paper we describe several methods for dealing with large amounts of thread-like data, such as data sets collected using Knife-Edge Scanning Microscopy (KESM) and Serial Block-Face Scanning Electron Microscopy (SBF-SEM). These methods allow us to collect volumetric data from embedded samples of whole-brain tissue. The neuronal and microvascular data that we acquire consists of thin, branching structures extending over very large regions. Traditional visualization schemes are not sufficient to make sense of the large, dense, complex structures encountered. In this paper, we address three methods to allow a user to explore a fiber network effectively. We describe interactive techniques for rendering large sets of neurons using self-orienting surfaces implemented on the GPU. We also present techniques for rendering fiber networks in a way that provides useful information about flow and orientation. Third, a global illumination framework is used to create high-quality visualizations that emphasize the underlying fiber structure. Implementation details, performance, and advantages and disadvantages of each approach are discussed.",
"title": "Visualization of Fibrous and Thread-like Data",
"normalizedTitle": "Visualization of Fibrous and Thread-like Data",
"fno": "v1165",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Brain",
"Medical Image Processing",
"Neurophysiology",
"Rendering Computer Graphics",
"Scanning Electron Microscopy",
"Fibrous Visualization",
"Thread Like Data",
"Thread Like Neuron Structures",
"Volumetric Data Sets",
"Image Vascular",
"Neural Tissue",
"Knife Edge Scanning Microscopy",
"Serial Block Face Scanning Electron Microscopy",
"Whole Brain Tissue",
"Microvascular Data",
"Fiber Network",
"Interactive Techniques",
"Neuron Rendering",
"Self Orienting Surfaces",
"Fiber Network Rendering",
"Data Visualization",
"Scanning Electron Microscopy",
"Computer Science",
"Neurons",
"Lighting",
"Data Acquisition",
"Image Segmentation",
"Rendering Computer Graphics",
"Hardware",
"Neuron Visualization",
"GPU Acceleration",
"Global Illumination",
"Orientation Filtering"
],
"authors": [
{
"givenName": "Zeki",
"surname": "Melek",
"fullName": "Zeki Melek",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Mayerich",
"fullName": "David Mayerich",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cem",
"surname": "Yuksel",
"fullName": "Cem Yuksel",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Keyser",
"fullName": "John Keyser",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "trans",
"pages": "1165-1172",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icicta/2014/6636/0/6636a218",
"title": "Effect of Fire Residue Structure on Flame Retardancy of HIPS/Silica Nanocomposites",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2014/6636a218/12OmNBhHt6C",
"parentPublication": {
"id": "proceedings/icicta/2014/6636/0",
"title": "2014 7th International Conference on Intelligent Computation Technology and Automation (ICICTA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2017/0733/0/0733a834",
"title": "Nuclei Segmentation of Fluorescence Microscopy Images Using Three Dimensional Convolutional Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2017/0733a834/12OmNwlHSTo",
"parentPublication": {
"id": "proceedings/cvprw/2017/0733/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/biomedvis/1995/7198/0/71980018",
"title": "Crumbs: a virtual environment tracking tool for biological imaging",
"doi": null,
"abstractUrl": "/proceedings-article/biomedvis/1995/71980018/12OmNx3Zjjf",
"parentPublication": {
"id": "proceedings/biomedvis/1995/7198/0",
"title": "Biomedical Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbec/2016/2132/0/07458998",
"title": "Cellulose Nanofibers as a Nucleating Template for Interfacial Crystallization of Poly (Ethylene)-b-Poly (Ethylene Glycol)",
"doi": null,
"abstractUrl": "/proceedings-article/sbec/2016/07458998/12OmNyq0zKD",
"parentPublication": {
"id": "proceedings/sbec/2016/2132/0",
"title": "2016 32nd Southern Biomedical Engineering Conference (SBEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2015/9721/0/9721a023",
"title": "Wrinkle Image Registration for Serial Microscopy Sections",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2015/9721a023/12OmNzTYCaI",
"parentPublication": {
"id": "proceedings/sitis/2015/9721/0",
"title": "2015 11th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122802",
"title": "A Lightweight Tangible 3D Interface for Interactive Visualization of Thin Fiber Structures",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122802/13rRUIJuxpA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061611",
"title": "Visualization of Cellular and Microvascular Relationships",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061611/13rRUwghd4W",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2016/04/07482745",
"title": "Two-Photon Imaging of DiO-Labelled Meissner Corpuscle in Living Mouse's Fingertip",
"doi": null,
"abstractUrl": "/journal/th/2016/04/07482745/13rRUxlgxOt",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440805",
"title": "Visualization of Neuronal Structures in Wide-Field Microscopy Brain Images",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440805/17D45WnnFUX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlhpc/2018/0180/0/08638633",
"title": "Automated Labeling of Electron Microscopy Images Using Deep Learning",
"doi": null,
"abstractUrl": "/proceedings-article/mlhpc/2018/08638633/18jXU8u0DVS",
"parentPublication": {
"id": "proceedings/mlhpc/2018/0180/0",
"title": "2018 IEEE/ACM Machine Learning in HPC Environments (MLHPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1157",
"articleId": "13rRUynHuj0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1173",
"articleId": "13rRUxlgy3u",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvEQsdH",
"title": "April-June",
"year": "2003",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "9",
"label": "April-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwwJWFF",
"doi": "10.1109/TVCG.2003.10000",
"abstract": "Abstract—In this paper, we present a novel visualization technique—kinetic visualization—that uses motion along a surface to aid in the perception of 3D shape and structure of static objects. The method uses particle systems, with rules such that particles flow over the surface of an object to not only bring out, but also attract attention to information on a shape that might not be readily visible with a conventional rendering method which uses lighting and view changes. Replacing still images with animations in this fashion, we demonstrate with both surface and volumetric models in the accompanying videos that, in many cases, the resulting visualizations effectively enhance the perception of three-dimensional shape and structure. We also describe how, for both types of data, a texture-based representation of this motion can be used for interactive visualization using PC graphics hardware. Finally, the results of a user study that we have conducted are presented, which show evidence that the supplemental motion cues can be helpful.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—In this paper, we present a novel visualization technique—kinetic visualization—that uses motion along a surface to aid in the perception of 3D shape and structure of static objects. The method uses particle systems, with rules such that particles flow over the surface of an object to not only bring out, but also attract attention to information on a shape that might not be readily visible with a conventional rendering method which uses lighting and view changes. Replacing still images with animations in this fashion, we demonstrate with both surface and volumetric models in the accompanying videos that, in many cases, the resulting visualizations effectively enhance the perception of three-dimensional shape and structure. We also describe how, for both types of data, a texture-based representation of this motion can be used for interactive visualization using PC graphics hardware. Finally, the results of a user study that we have conducted are presented, which show evidence that the supplemental motion cues can be helpful.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—In this paper, we present a novel visualization technique—kinetic visualization—that uses motion along a surface to aid in the perception of 3D shape and structure of static objects. The method uses particle systems, with rules such that particles flow over the surface of an object to not only bring out, but also attract attention to information on a shape that might not be readily visible with a conventional rendering method which uses lighting and view changes. Replacing still images with animations in this fashion, we demonstrate with both surface and volumetric models in the accompanying videos that, in many cases, the resulting visualizations effectively enhance the perception of three-dimensional shape and structure. We also describe how, for both types of data, a texture-based representation of this motion can be used for interactive visualization using PC graphics hardware. Finally, the results of a user study that we have conducted are presented, which show evidence that the supplemental motion cues can be helpful.",
"title": "Using Motion to Illustrate Static 3D Shape- Kinetic Visualization",
"normalizedTitle": "Using Motion to Illustrate Static 3D Shape- Kinetic Visualization",
"fno": "v0115",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Animation",
"Visual Perception",
"Particle Systems",
"Scientific Visualization",
"Volume Rendering",
"Graphics Hardware",
"Texture"
],
"authors": [
{
"givenName": "Eric B.",
"surname": "Lum",
"fullName": "Eric B. Lum",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Aleksander",
"surname": "Stompel",
"fullName": "Aleksander Stompel",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kwan-Liu",
"surname": "Ma",
"fullName": "Kwan-Liu Ma",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2003-04-01 00:00:00",
"pubType": "trans",
"pages": "115-126",
"year": "2003",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0113",
"articleId": "13rRUx0geuZ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0127",
"articleId": "13rRUIIVlcA",
"__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": "13rRUxBJhvv",
"doi": "10.1109/TVCG.2012.216",
"abstract": "We report the impact of display characteristics (stereo and size) on task performance in diffusion magnetic resonance imaging (DMRI) in a user study with 12 participants. The hypotheses were that (1) adding stereo and increasing display size would improve task accuracy and reduce completion time, and (2) the greater the complexity of a spatial task, the greater the benefits of an improved display. Thus we expected to see greater performance gains when detailed visual reasoning was required. Participants used dense streamtube visualizations to perform five representative tasks: (1) determine the higher average fractional anisotropy (FA) values between two regions, (2) find the endpoints of fiber tracts, (3) name a bundle, (4) mark a brain lesion, and (5) judge if tracts belong to the same bundle. Contrary to our hypotheses, we found the task completion time was not improved by the use of the larger display and that performance accuracy was hurt rather than helped by the introduction of stereo in our study with dense DMRI data. Bigger was not always better. Thus cautious should be taken when selecting displays for scientific visualization applications. We explored the results further using the body-scale unit and subjective size and stereo experiences.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We report the impact of display characteristics (stereo and size) on task performance in diffusion magnetic resonance imaging (DMRI) in a user study with 12 participants. The hypotheses were that (1) adding stereo and increasing display size would improve task accuracy and reduce completion time, and (2) the greater the complexity of a spatial task, the greater the benefits of an improved display. Thus we expected to see greater performance gains when detailed visual reasoning was required. Participants used dense streamtube visualizations to perform five representative tasks: (1) determine the higher average fractional anisotropy (FA) values between two regions, (2) find the endpoints of fiber tracts, (3) name a bundle, (4) mark a brain lesion, and (5) judge if tracts belong to the same bundle. Contrary to our hypotheses, we found the task completion time was not improved by the use of the larger display and that performance accuracy was hurt rather than helped by the introduction of stereo in our study with dense DMRI data. Bigger was not always better. Thus cautious should be taken when selecting displays for scientific visualization applications. We explored the results further using the body-scale unit and subjective size and stereo experiences.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We report the impact of display characteristics (stereo and size) on task performance in diffusion magnetic resonance imaging (DMRI) in a user study with 12 participants. The hypotheses were that (1) adding stereo and increasing display size would improve task accuracy and reduce completion time, and (2) the greater the complexity of a spatial task, the greater the benefits of an improved display. Thus we expected to see greater performance gains when detailed visual reasoning was required. Participants used dense streamtube visualizations to perform five representative tasks: (1) determine the higher average fractional anisotropy (FA) values between two regions, (2) find the endpoints of fiber tracts, (3) name a bundle, (4) mark a brain lesion, and (5) judge if tracts belong to the same bundle. Contrary to our hypotheses, we found the task completion time was not improved by the use of the larger display and that performance accuracy was hurt rather than helped by the introduction of stereo in our study with dense DMRI data. Bigger was not always better. Thus cautious should be taken when selecting displays for scientific visualization applications. We explored the results further using the body-scale unit and subjective size and stereo experiences.",
"title": "Effects of Stereo and Screen Size on the Legibility of Three-Dimensional Streamtube Visualization",
"normalizedTitle": "Effects of Stereo and Screen Size on the Legibility of Three-Dimensional Streamtube Visualization",
"fno": "ttg2012122130",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Retina",
"Virtual Environments",
"Lesions",
"Stereo Image Processing",
"Magnetic Resonance Imaging",
"Virtual Environment",
"Display Characteristics",
"Diffusion Tensor MRI"
],
"authors": [
{
"givenName": "Jian",
"surname": "Chen",
"fullName": "Jian Chen",
"affiliation": "University of Maryland Baltimore County",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haipeng",
"surname": "Cai",
"fullName": "Haipeng Cai",
"affiliation": "University of Southern Mississippi",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alexander P.",
"surname": "Auchus",
"fullName": "Alexander P. Auchus",
"affiliation": "University of Mississippi Medical Center",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David H.",
"surname": "Laidlaw",
"fullName": "David H. Laidlaw",
"affiliation": "Brown University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2130-2139",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vl/1994/6660/0/00363621",
"title": "Viewing a graph in a virtual reality display is three times as good as a 2D diagram",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1994/00363621/12OmNAkWvKo",
"parentPublication": {
"id": "proceedings/vl/1994/6660/0",
"title": "Proceedings of 1994 IEEE Symposium on Visual Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2010/6846/0/05444701",
"title": "Towards a handheld stereo projector system for viewing and interacting in virtual worlds",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2010/05444701/12OmNBKEyzI",
"parentPublication": {
"id": "proceedings/3dui/2010/6846/0",
"title": "2010 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2008/2047/0/04476614",
"title": "Poster: Effects of Head Tracking and Stereo on Non-Isomorphic 3D Rotation",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2008/04476614/12OmNqEAT7R",
"parentPublication": {
"id": "proceedings/3dui/2008/2047/0",
"title": "2008 IEEE Symposium on 3D User Interfaces",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvri/2011/0054/0/05759647",
"title": "Creation of three dimensional dome contents using layered images",
"doi": null,
"abstractUrl": "/proceedings-article/isvri/2011/05759647/12OmNqEji0R",
"parentPublication": {
"id": "proceedings/isvri/2011/0054/0",
"title": "2011 IEEE International Symposium on VR Innovation (ISVRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2016/0836/0/07504759",
"title": "Faster feedback for remote scene viewing with pan-tilt stereo camera",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2016/07504759/12OmNvD8Rz3",
"parentPublication": {
"id": "proceedings/vr/2016/0836/0",
"title": "2016 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2006/0224/0/02240237",
"title": "Combining Wave Field Synthesis and Multi-Viewer Stereo Displays",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2006/02240237/12OmNwDSdLI",
"parentPublication": {
"id": "proceedings/vr/2006/0224/0",
"title": "IEEE Virtual Reality Conference (VR 2006)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/05/07118232",
"title": "The Effects of Avatars, Stereo Vision and Display Size on Reaching and Motion Reproduction",
"doi": null,
"abstractUrl": "/journal/tg/2016/05/07118232/13rRUwdIOUQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2003/04/v0454",
"title": "Visualizing Diffusion Tensor MR Images Using Streamtubes and Streamsurfaces",
"doi": null,
"abstractUrl": "/journal/tg/2003/04/v0454/13rRUxASuAn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2023/4815/0/481500a482",
"title": "Measuring the Effect of Stereo Deficiencies on Peripersonal Space Pointing",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2023/481500a482/1MNgRYfCXU4",
"parentPublication": {
"id": "proceedings/vr/2023/4815/0",
"title": "2023 IEEE Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ctmcd/2021/4856/0/485600a281",
"title": "Monocular Stereo Vision of Image Feature-aware Interactive Generation",
"doi": null,
"abstractUrl": "/proceedings-article/ctmcd/2021/485600a281/1uOunPd003m",
"parentPublication": {
"id": "proceedings/ctmcd/2021/4856/0",
"title": "2021 International Conference on Computer Technology and Media Convergence Design (CTMCD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012122122",
"articleId": "13rRUwd9CLL",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122140",
"articleId": "13rRUwfI0Qa",
"__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": "13rRUILc8aT",
"doi": "10.1109/MCSE.2009.34",
"abstract": "Most computational codes that use irregular grids depend on the single worst triangle's quality: skinny triangles can lead to bad performance and numerical instabilities. Marching cubes (MC) is the standard isosurface grid generation algorithm, and, whereas most triangles it generates are good, it almost always generates some bad triangles. Here, we show how simple changes to MC can lead to a drastically reduced number of degenerate triangles, making it a more practical choice for isosurface grid generation, reducing or eliminating the need for and cost of postprocessing.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Most computational codes that use irregular grids depend on the single worst triangle's quality: skinny triangles can lead to bad performance and numerical instabilities. Marching cubes (MC) is the standard isosurface grid generation algorithm, and, whereas most triangles it generates are good, it almost always generates some bad triangles. Here, we show how simple changes to MC can lead to a drastically reduced number of degenerate triangles, making it a more practical choice for isosurface grid generation, reducing or eliminating the need for and cost of postprocessing.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Most computational codes that use irregular grids depend on the single worst triangle's quality: skinny triangles can lead to bad performance and numerical instabilities. Marching cubes (MC) is the standard isosurface grid generation algorithm, and, whereas most triangles it generates are good, it almost always generates some bad triangles. Here, we show how simple changes to MC can lead to a drastically reduced number of degenerate triangles, making it a more practical choice for isosurface grid generation, reducing or eliminating the need for and cost of postprocessing.",
"title": "Marching Cubes without Skinny Triangles",
"normalizedTitle": "Marching Cubes without Skinny Triangles",
"fno": "mcs2009020082",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Isosurfacing",
"Marching Cubes",
"Numerical Simulation",
"Visualization Corner"
],
"authors": [
{
"givenName": "Carlos A.",
"surname": "Dietrich",
"fullName": "Carlos A. Dietrich",
"affiliation": "Dell",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Carlos E.",
"surname": "Scheidegger",
"fullName": "Carlos E. Scheidegger",
"affiliation": "University of Utah",
"__typename": "ArticleAuthorType"
},
{
"givenName": "João L.D.",
"surname": "Comba",
"fullName": "João L.D. Comba",
"affiliation": "Instituto de Informática, UFRGS",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Luciana P.",
"surname": "Nedel",
"fullName": "Luciana P. Nedel",
"affiliation": "Instituto de Informática, UFRGS",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cláudio T.",
"surname": "Silva",
"fullName": "Cláudio T. Silva",
"affiliation": "University of Utah",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2009-03-01 00:00:00",
"pubType": "mags",
"pages": "82-87",
"year": "2009",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2004/8788/0/87880489",
"title": "Dual Marching Cubes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880489/12OmNAWpynS",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mvhi/2010/4009/0/4009a608",
"title": "Three-Dimensional Reconstruction of Medical Image Based on Improved Marching Cubes Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/mvhi/2010/4009a608/12OmNBtUdOc",
"parentPublication": {
"id": "proceedings/mvhi/2010/4009/0",
"title": "Machine Vision and Human-machine Interface, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etcs/2010/3987/1/3987a194",
"title": "Improvement of Marching Cubes Algorithm Based on Sign Determination",
"doi": null,
"abstractUrl": "/proceedings-article/etcs/2010/3987a194/12OmNxWcH0N",
"parentPublication": {
"id": "proceedings/etcs/2010/3987/1",
"title": "Education Technology and Computer Science, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2005/2432/0/24320565",
"title": "A Robust and Topological Correct Marching Cube Algorithm Without Look-Up Table",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2005/24320565/12OmNy68EBu",
"parentPublication": {
"id": "proceedings/cit/2005/2432/0",
"title": "The Fifth International Conference on Computer and Information Technology CIT 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1996/3673/0/36730335",
"title": "Octree-Based Decimation of Marching Cubes Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1996/36730335/12OmNyprnrJ",
"parentPublication": {
"id": "proceedings/ieee-vis/1996/3673/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300009",
"title": "MC*: Star Functions for Marching Cubes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300009/12OmNyprnzr",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2001/1007/0/10070306",
"title": "A Marching Voxels Method for Surface Rendering of Volume Data",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2001/10070306/12OmNzdoN6A",
"parentPublication": {
"id": "proceedings/cgi/2001/1007/0",
"title": "Proceedings. Computer Graphics International 2001",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498nielson",
"title": "Approximating Normals for Marching Cubes applied to Locally Supported Isosurfaces",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498nielson/12OmNzuZUso",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__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/2003/03/v0283",
"title": "On Marching Cubes",
"doi": null,
"abstractUrl": "/journal/tg/2003/03/v0283/13rRUyYjK58",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcs2009020072",
"articleId": "13rRUwInv8n",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcs2009020088",
"articleId": "13rRUxBa5iX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNy7Qfqa",
"title": "Feb.",
"year": "2013",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwkfAZg",
"doi": "10.1109/TVCG.2012.118",
"abstract": "Many data sets are sampled on regular lattices in two, three or more dimensions, and recent work has shown that statistical properties of these data sets must take into account the continuity of the underlying physical phenomena. However, the effects of quantization on the statistics have not yet been accounted for. This paper therefore reconciles the previous papers to the underlying mathematical theory, develops a mathematical model of quantized statistics of continuous functions, and proves convergence of geometric approximations to continuous statistics for regular sampling lattices. In addition, the computational cost of various approaches is considered, and recommendations made about when to use each type of statistic.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Many data sets are sampled on regular lattices in two, three or more dimensions, and recent work has shown that statistical properties of these data sets must take into account the continuity of the underlying physical phenomena. However, the effects of quantization on the statistics have not yet been accounted for. This paper therefore reconciles the previous papers to the underlying mathematical theory, develops a mathematical model of quantized statistics of continuous functions, and proves convergence of geometric approximations to continuous statistics for regular sampling lattices. In addition, the computational cost of various approaches is considered, and recommendations made about when to use each type of statistic.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Many data sets are sampled on regular lattices in two, three or more dimensions, and recent work has shown that statistical properties of these data sets must take into account the continuity of the underlying physical phenomena. However, the effects of quantization on the statistics have not yet been accounted for. This paper therefore reconciles the previous papers to the underlying mathematical theory, develops a mathematical model of quantized statistics of continuous functions, and proves convergence of geometric approximations to continuous statistics for regular sampling lattices. In addition, the computational cost of various approaches is considered, and recommendations made about when to use each type of statistic.",
"title": "Integrating Isosurface Statistics and Histograms",
"normalizedTitle": "Integrating Isosurface Statistics and Histograms",
"fno": "ttg2013020263",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Statistics",
"Data Visualisation",
"Geometry",
"Geometric Approximations",
"Isosurface Statistics",
"Histograms",
"Data Sets",
"Regular Lattices",
"Histograms",
"Size Measurement",
"Jacobian Matrices",
"Lattices",
"Quantization",
"Extraterrestrial Measurements",
"Approximation Methods",
"Geometric Statistics",
"Histograms",
"Frequency Distribution",
"Integration"
],
"authors": [
{
"givenName": "B.",
"surname": "Duffy",
"fullName": "B. Duffy",
"affiliation": "Oxford Centre for Collaborative Appl. Math. (OCCAM), Univ. of Oxford, Oxford, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "H.",
"surname": "Carr",
"fullName": "H. Carr",
"affiliation": "Visualization & Virtual Reality Group, Univ. of Leeds, Leeds, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "T.",
"surname": "Moller",
"fullName": "T. Moller",
"affiliation": "Graphics, Usability, & Visualization (GrUVi) Lab., Simon Fraser Univ., Burnaby, BC, Canada",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2013-02-01 00:00:00",
"pubType": "trans",
"pages": "263-277",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iacc/2017/1560/0/07976790",
"title": "Higher Order Statistics for Multispectral Satellite Data",
"doi": null,
"abstractUrl": "/proceedings-article/iacc/2017/07976790/12OmNAS9zzi",
"parentPublication": {
"id": "proceedings/iacc/2017/1560/0",
"title": "2017 IEEE 7th International Advance Computing Conference (IACC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1988/0878/0/00028264",
"title": "Fuzzy morphology and image analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1988/00028264/12OmNs0TL09",
"parentPublication": {
"id": "proceedings/icpr/1988/0878/0",
"title": "9th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2010/6984/0/05539907",
"title": "Food recognition using statistics of pairwise local features",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2010/05539907/12OmNvonIJM",
"parentPublication": {
"id": "proceedings/cvpr/2010/6984/0",
"title": "2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1999/0149/1/01491541",
"title": "Statistics of Natural Images and Models",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1999/01491541/12OmNwBT1rB",
"parentPublication": {
"id": "proceedings/cvpr/1999/0149/2",
"title": "Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wsc/1990/72/0/00129538",
"title": "Statistics and deterministic simulation models: why not?",
"doi": null,
"abstractUrl": "/proceedings-article/wsc/1990/00129538/12OmNxRF78X",
"parentPublication": {
"id": "proceedings/wsc/1990/72/0",
"title": "1990 Winter Simulation Conference Proceedings",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icfcse/2011/1562/0/06041647",
"title": "Comparative Study of Sports Statistics Textbooks and Other Disciplines' Statistics Textbooks",
"doi": null,
"abstractUrl": "/proceedings-article/icfcse/2011/06041647/12OmNynJMDB",
"parentPublication": {
"id": "proceedings/icfcse/2011/1562/0",
"title": "2011 International Conference on Future Computer Science and Education",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2003/7961/3/01265969",
"title": "JIT technology support modules in probability and statistics",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2003/01265969/12OmNzICED6",
"parentPublication": {
"id": "proceedings/fie/2003/7961/3",
"title": "33rd Annual Frontiers in Education, 2003. FIE 2003.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061659",
"title": "Revisiting Histograms and Isosurface Statistics",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061659/13rRUxZ0o1p",
"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/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"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013020249",
"articleId": "13rRUxDqS8h",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013020278",
"articleId": "13rRUB7a1fP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFvx",
"name": "ttg2013020263s.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013020263s.zip",
"extension": "zip",
"size": "589 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": "13rRUxC0SvM",
"doi": "10.1109/TVCG.2006.157",
"abstract": "We propose a novel Persistent OcTree (POT) indexing structure for accelerating isosurface extraction and spatial filtering from volumetric data. This data structure efficiently handles a wide range of visualization problems such as the generation of view-dependent isosurfaces, ray tracing, and isocontour slicing for high dimensional data. POT can be viewed as a hybrid data structure between the interval tree and the Branch-On-Need Octree (BONO) in the sense that it achieves the asymptotic bound of the interval tree for identifying the active cells corresponding to an isosurface and is more efficient than BONO for handling spatial queries. We encode a compact octree for each isovalue. Each such octree contains only the corresponding active cells, in such a way that the combined structure has linear space. The inherent hierarchical structure associated with the active cells enables very fast filtering of the active cells based on spatial constraints. We demonstrate the effectiveness of our approach by performing view-dependent isosurfacing on a wide variety of volumetric data sets and 4D isocontour slicing on the time-varying Richtmyer-Meshkov instability dataset.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose a novel Persistent OcTree (POT) indexing structure for accelerating isosurface extraction and spatial filtering from volumetric data. This data structure efficiently handles a wide range of visualization problems such as the generation of view-dependent isosurfaces, ray tracing, and isocontour slicing for high dimensional data. POT can be viewed as a hybrid data structure between the interval tree and the Branch-On-Need Octree (BONO) in the sense that it achieves the asymptotic bound of the interval tree for identifying the active cells corresponding to an isosurface and is more efficient than BONO for handling spatial queries. We encode a compact octree for each isovalue. Each such octree contains only the corresponding active cells, in such a way that the combined structure has linear space. The inherent hierarchical structure associated with the active cells enables very fast filtering of the active cells based on spatial constraints. We demonstrate the effectiveness of our approach by performing view-dependent isosurfacing on a wide variety of volumetric data sets and 4D isocontour slicing on the time-varying Richtmyer-Meshkov instability dataset.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose a novel Persistent OcTree (POT) indexing structure for accelerating isosurface extraction and spatial filtering from volumetric data. This data structure efficiently handles a wide range of visualization problems such as the generation of view-dependent isosurfaces, ray tracing, and isocontour slicing for high dimensional data. POT can be viewed as a hybrid data structure between the interval tree and the Branch-On-Need Octree (BONO) in the sense that it achieves the asymptotic bound of the interval tree for identifying the active cells corresponding to an isosurface and is more efficient than BONO for handling spatial queries. We encode a compact octree for each isovalue. Each such octree contains only the corresponding active cells, in such a way that the combined structure has linear space. The inherent hierarchical structure associated with the active cells enables very fast filtering of the active cells based on spatial constraints. We demonstrate the effectiveness of our approach by performing view-dependent isosurfacing on a wide variety of volumetric data sets and 4D isocontour slicing on the time-varying Richtmyer-Meshkov instability dataset.",
"title": "Isosurface Extraction and Spatial Filtering using Persistent Octree (POT)",
"normalizedTitle": "Isosurface Extraction and Spatial Filtering using Persistent Octree (POT)",
"fno": "v1283",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Spatial Data Structures",
"Data Visualisation",
"Database Indexing",
"Feature Extraction",
"Octrees",
"Richtmyer Meshkov Instability Dataset",
"Isosurface Extraction",
"Spatial Filtering",
"Persistent Octree",
"Hybrid Data Structure",
"Branch On Need Octree",
"4 D Isocontour Slicing",
"Isosurfaces",
"Filtering",
"Data Mining",
"Indexing",
"Acceleration",
"Data Structures",
"Data Visualization",
"Ray Tracing",
"Tree Data Structures",
"Active Filters",
"Indexing",
"Scientific Visualization",
"Isosurface Extraction"
],
"authors": [
{
"givenName": "Qingmin",
"surname": "Shi",
"fullName": "Qingmin Shi",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Joseph",
"surname": "JaJa",
"fullName": "Joseph JaJa",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "trans",
"pages": "1283-1290",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/1988/0862/0/00196247",
"title": "A new strategy for octree representation of three-dimensional objects",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1988/00196247/12OmNAhxjBt",
"parentPublication": {
"id": "proceedings/cvpr/1988/0862/0",
"title": "Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbgames/2011/4648/0/4648a011",
"title": "GPU-Based Data Structure for a Parallel Ray Tracing Illumination Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/sbgames/2011/4648a011/12OmNvwC5ve",
"parentPublication": {
"id": "proceedings/sbgames/2011/4648/0",
"title": "2011 Brazilian Symposium on Games and Digital Entertainment",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sccg/2001/1215/0/12150130",
"title": "An Octree Isosurface Codification Based on Discrete Planes",
"doi": null,
"abstractUrl": "/proceedings-article/sccg/2001/12150130/12OmNwD1q5q",
"parentPublication": {
"id": "proceedings/sccg/2001/1215/0",
"title": "Proceedings Spring Conference on Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rt/2006/0693/0/04061553",
"title": "Interactive Isosurface Ray Tracing of Large Octree Volumes",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2006/04061553/12OmNwlqhK9",
"parentPublication": {
"id": "proceedings/rt/2006/0693/0",
"title": "IEEE Symposium on Interactive Ray Tracing 2006",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rt/2008/2741/0/04634645",
"title": "Ray traversal of octree point clouds on the GPU",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2008/04634645/12OmNyGbIbV",
"parentPublication": {
"id": "proceedings/rt/2008/2741/0",
"title": "Symposium on Interactive Ray Tracing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pccc/1991/2133/0/00113888",
"title": "A new linear octree construction by filling algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/pccc/1991/00113888/12OmNyQGShv",
"parentPublication": {
"id": "proceedings/pccc/1991/2133/0",
"title": "1991Tenth Annual International Phoenix Conference on Computers and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2000/0868/0/08680165",
"title": "Modeling an Isosurface with a Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2000/08680165/12OmNzYeAUP",
"parentPublication": {
"id": "proceedings/pg/2000/0868/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1995/04/v0343",
"title": "Octree-R: An Adaptive Octree for Efficient Ray Tracing",
"doi": null,
"abstractUrl": "/journal/tg/1995/04/v0343/13rRUxcbnH0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061367",
"title": "Isosurface Extraction and View-Dependent Filtering from Time-Varying Fields Using Persistent Time-Octree (PTOT)",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061367/13rRUxly8XB",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08493612",
"title": "CPU Isosurface Ray Tracing of Adaptive Mesh Refinement Data",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08493612/17D45Vw15vd",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1275",
"articleId": "13rRUxd2aYT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1291",
"articleId": "13rRUxBa5bI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAle6QD",
"title": "February",
"year": "2012",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgs2tp",
"doi": "10.1109/TVCG.2011.25",
"abstract": "Vector field visualization techniques have evolved very rapidly over the last two decades, however, visualizing vector fields on complex boundary surfaces from computational flow dynamics (CFD) still remains a challenging task. In part, this is due to the large, unstructured, adaptive resolution characteristics of the meshes used in the modeling and simulation process. Out of the wide variety of existing flow field visualization techniques, vector field clustering algorithms offer the advantage of capturing a detailed picture of important areas of the domain while presenting a simplified view of areas of less importance. This paper presents a novel, robust, automatic vector field clustering algorithm that produces intuitive and insightful images of vector fields on large, unstructured, adaptive resolution boundary meshes from CFD. Our bottom-up, hierarchical approach is the first to combine the properties of the underlying vector field and mesh into a unified error-driven representation. The motivation behind the approach is the fact that CFD engineers may increase the resolution of model meshes according to importance. The algorithm has several advantages. Clusters are generated automatically, no surface parameterization is required, and large meshes are processed efficiently. The most suggestive and important information contained in the meshes and vector fields is preserved while less important areas are simplified in the visualization. Users can interactively control the level of detail by adjusting a range of clustering distance measure parameters. We describe two data structures to accelerate the clustering process. We also introduce novel visualizations of clusters inspired by statistical methods. We apply our method to a series of synthetic and complex, real-world CFD meshes to demonstrate the clustering algorithm results.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Vector field visualization techniques have evolved very rapidly over the last two decades, however, visualizing vector fields on complex boundary surfaces from computational flow dynamics (CFD) still remains a challenging task. In part, this is due to the large, unstructured, adaptive resolution characteristics of the meshes used in the modeling and simulation process. Out of the wide variety of existing flow field visualization techniques, vector field clustering algorithms offer the advantage of capturing a detailed picture of important areas of the domain while presenting a simplified view of areas of less importance. This paper presents a novel, robust, automatic vector field clustering algorithm that produces intuitive and insightful images of vector fields on large, unstructured, adaptive resolution boundary meshes from CFD. Our bottom-up, hierarchical approach is the first to combine the properties of the underlying vector field and mesh into a unified error-driven representation. The motivation behind the approach is the fact that CFD engineers may increase the resolution of model meshes according to importance. The algorithm has several advantages. Clusters are generated automatically, no surface parameterization is required, and large meshes are processed efficiently. The most suggestive and important information contained in the meshes and vector fields is preserved while less important areas are simplified in the visualization. Users can interactively control the level of detail by adjusting a range of clustering distance measure parameters. We describe two data structures to accelerate the clustering process. We also introduce novel visualizations of clusters inspired by statistical methods. We apply our method to a series of synthetic and complex, real-world CFD meshes to demonstrate the clustering algorithm results.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Vector field visualization techniques have evolved very rapidly over the last two decades, however, visualizing vector fields on complex boundary surfaces from computational flow dynamics (CFD) still remains a challenging task. In part, this is due to the large, unstructured, adaptive resolution characteristics of the meshes used in the modeling and simulation process. Out of the wide variety of existing flow field visualization techniques, vector field clustering algorithms offer the advantage of capturing a detailed picture of important areas of the domain while presenting a simplified view of areas of less importance. This paper presents a novel, robust, automatic vector field clustering algorithm that produces intuitive and insightful images of vector fields on large, unstructured, adaptive resolution boundary meshes from CFD. Our bottom-up, hierarchical approach is the first to combine the properties of the underlying vector field and mesh into a unified error-driven representation. The motivation behind the approach is the fact that CFD engineers may increase the resolution of model meshes according to importance. The algorithm has several advantages. Clusters are generated automatically, no surface parameterization is required, and large meshes are processed efficiently. The most suggestive and important information contained in the meshes and vector fields is preserved while less important areas are simplified in the visualization. Users can interactively control the level of detail by adjusting a range of clustering distance measure parameters. We describe two data structures to accelerate the clustering process. We also introduce novel visualizations of clusters inspired by statistical methods. We apply our method to a series of synthetic and complex, real-world CFD meshes to demonstrate the clustering algorithm results.",
"title": "Mesh-Driven Vector Field Clustering and Visualization: An Image-Based Approach",
"normalizedTitle": "Mesh-Driven Vector Field Clustering and Visualization: An Image-Based Approach",
"fno": "ttg2012020283",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Vector Field Visualization",
"Clustering",
"Feature Based",
"Surfaces"
],
"authors": [
{
"givenName": "Zhenmin",
"surname": "Peng",
"fullName": "Zhenmin Peng",
"affiliation": "Swansea University, Swansea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Edward",
"surname": "Grundy",
"fullName": "Edward Grundy",
"affiliation": "Swansea University, Swansea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert S.",
"surname": "Laramee",
"fullName": "Robert S. Laramee",
"affiliation": "Swansea University, Swansea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guoning",
"surname": "Chen",
"fullName": "Guoning Chen",
"affiliation": "University of Utah, Salt Lake City",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nick",
"surname": "Croft",
"fullName": "Nick Croft",
"affiliation": "Swansea University, Swansea",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2012-02-01 00:00:00",
"pubType": "trans",
"pages": "283-298",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sibgrapi/2009/3813/0/3813a104",
"title": "Support Vectors Learning for Vector Field Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2009/3813a104/12OmNASraKX",
"parentPublication": {
"id": "proceedings/sibgrapi/2009/3813/0",
"title": "2009 XXII Brazilian Symposium on Computer Graphics and Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2013/4797/0/06596154",
"title": "Automatic, tensor-guided illustrative vector field visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2013/06596154/12OmNBd9T52",
"parentPublication": {
"id": "proceedings/pacificvis/2013/4797/0",
"title": "2013 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1999/5897/0/58970043",
"title": "C1-Interpolation for Vector Field Topology Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1999/58970043/12OmNCbCrK5",
"parentPublication": {
"id": "proceedings/ieee-vis/1999/5897/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1999/5897/0/58970001",
"title": "Construction of Vector Field Hierarchies",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1999/58970001/12OmNwcUk3c",
"parentPublication": {
"id": "proceedings/ieee-vis/1999/5897/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2011/4602/0/4602a303",
"title": "Fuzzy Feature Visualization of Vector Field by Entropy-Based Texture Adaptation",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2011/4602a303/12OmNyL0Tvi",
"parentPublication": {
"id": "proceedings/icvrv/2011/4602/0",
"title": "2011 International Conference on Virtual Reality and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2009/3813/0/3813a112",
"title": "Random Walks for Vector Field Denoising",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2009/3813a112/12OmNyxXlkf",
"parentPublication": {
"id": "proceedings/sibgrapi/2009/3813/0",
"title": "2009 XXII Brazilian Symposium on Computer Graphics and Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/1/3336a819",
"title": "Weighted Support Vector Machine Based Clustering Vector",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336a819/12OmNzmtWs8",
"parentPublication": {
"id": "proceedings/csse/2008/3336/1",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061560",
"title": "Interactive Vector Field Feature Identification",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061560/13rRUIJuxvg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030407",
"title": "Streamline Embedding for 3D Vector Field Exploration",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030407/13rRUwInvsM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1998/02/v0109",
"title": "Visualizing Nonlinear Vector Field Topology",
"doi": null,
"abstractUrl": "/journal/tg/1998/02/v0109/13rRUxNEqPA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012020270",
"articleId": "13rRUxAAST2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012020299",
"articleId": "13rRUxAAST3",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgLt",
"name": "ttg2012020283s.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012020283s.zip",
"extension": "zip",
"size": "76.4 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1EOzVCQBwyI",
"title": "Aug.",
"year": "2022",
"issueNum": "08",
"idPrefix": "tk",
"pubType": "journal",
"volume": "34",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1nxQ8gROGQ0",
"doi": "10.1109/TKDE.2020.3027950",
"abstract": "Social decisions made by individuals are easily influenced by information from their social neighborhoods. A key predictor of social contagion is the multiplicity of social contexts inside the individual’s contact neighborhood, which is termed structural diversity. However, the existing models have limited decomposability for analyzing large-scale networks, and suffer from the inaccurate reflection of social context diversity. In this paper, we propose a truss-based structural diversity model to overcome the weak decomposability. Based on this model, we study a novel problem of truss-based structural diversity search in a graph <inline-formula><tex-math notation=\"LaTeX\">Z_$G$_Z</tex-math></inline-formula>, that is, to find the <inline-formula><tex-math notation=\"LaTeX\">Z_$r$_Z</tex-math></inline-formula> vertices with the highest truss-based structural diversity and return their social contexts. To tackle this problem, we propose an online structural diversity search algorithm in <inline-formula><tex-math notation=\"LaTeX\">Z_$O(\\rho (m+\\mathcal {T}))$_Z</tex-math></inline-formula> time, where <inline-formula><tex-math notation=\"LaTeX\">Z_$\\rho$_Z</tex-math></inline-formula>, <inline-formula><tex-math notation=\"LaTeX\">Z_$m$_Z</tex-math></inline-formula>, and <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {T}$_Z</tex-math></inline-formula> are respectively the arboricity, the number of edges, and the number of triangles in <inline-formula><tex-math notation=\"LaTeX\">Z_$G$_Z</tex-math></inline-formula>. To improve the efficiency, we design an elegant and compact index, called TSD-index, which keeps the structural diversity information for all individual vertices. We further optimize the structure of TSD-index into a highly compressed GCT-index. Our GCT-index-based structural diversity search utilizes the global triangle information for fast index construction and finds answers in <inline-formula><tex-math notation=\"LaTeX\">Z_$O(m)$_Z</tex-math></inline-formula> time. Extensive experiments demonstrate the effectiveness and efficiency of our proposed model and algorithms, against state-of-the-art methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Social decisions made by individuals are easily influenced by information from their social neighborhoods. A key predictor of social contagion is the multiplicity of social contexts inside the individual’s contact neighborhood, which is termed structural diversity. However, the existing models have limited decomposability for analyzing large-scale networks, and suffer from the inaccurate reflection of social context diversity. In this paper, we propose a truss-based structural diversity model to overcome the weak decomposability. Based on this model, we study a novel problem of truss-based structural diversity search in a graph <inline-formula><tex-math notation=\"LaTeX\">$G$</tex-math><alternatives><mml:math><mml:mi>G</mml:mi></mml:math><inline-graphic xlink:href=\"huang-ieq1-3027950.gif\"/></alternatives></inline-formula>, that is, to find the <inline-formula><tex-math notation=\"LaTeX\">$r$</tex-math><alternatives><mml:math><mml:mi>r</mml:mi></mml:math><inline-graphic xlink:href=\"huang-ieq2-3027950.gif\"/></alternatives></inline-formula> vertices with the highest truss-based structural diversity and return their social contexts. To tackle this problem, we propose an online structural diversity search algorithm in <inline-formula><tex-math notation=\"LaTeX\">$O(\\rho (m+\\mathcal {T}))$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:mi>ρ</mml:mi><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>+</mml:mo><mml:mi mathvariant=\"script\">T</mml:mi><mml:mo>)</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"huang-ieq3-3027950.gif\"/></alternatives></inline-formula> time, where <inline-formula><tex-math notation=\"LaTeX\">$\\rho$</tex-math><alternatives><mml:math><mml:mi>ρ</mml:mi></mml:math><inline-graphic xlink:href=\"huang-ieq4-3027950.gif\"/></alternatives></inline-formula>, <inline-formula><tex-math notation=\"LaTeX\">$m$</tex-math><alternatives><mml:math><mml:mi>m</mml:mi></mml:math><inline-graphic xlink:href=\"huang-ieq5-3027950.gif\"/></alternatives></inline-formula>, and <inline-formula><tex-math notation=\"LaTeX\">$\\mathcal {T}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"script\">T</mml:mi></mml:math><inline-graphic xlink:href=\"huang-ieq6-3027950.gif\"/></alternatives></inline-formula> are respectively the arboricity, the number of edges, and the number of triangles in <inline-formula><tex-math notation=\"LaTeX\">$G$</tex-math><alternatives><mml:math><mml:mi>G</mml:mi></mml:math><inline-graphic xlink:href=\"huang-ieq7-3027950.gif\"/></alternatives></inline-formula>. To improve the efficiency, we design an elegant and compact index, called TSD-index, which keeps the structural diversity information for all individual vertices. We further optimize the structure of TSD-index into a highly compressed GCT-index. Our GCT-index-based structural diversity search utilizes the global triangle information for fast index construction and finds answers in <inline-formula><tex-math notation=\"LaTeX\">$O(m)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"huang-ieq8-3027950.gif\"/></alternatives></inline-formula> time. Extensive experiments demonstrate the effectiveness and efficiency of our proposed model and algorithms, against state-of-the-art methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Social decisions made by individuals are easily influenced by information from their social neighborhoods. A key predictor of social contagion is the multiplicity of social contexts inside the individual’s contact neighborhood, which is termed structural diversity. However, the existing models have limited decomposability for analyzing large-scale networks, and suffer from the inaccurate reflection of social context diversity. In this paper, we propose a truss-based structural diversity model to overcome the weak decomposability. Based on this model, we study a novel problem of truss-based structural diversity search in a graph -, that is, to find the - vertices with the highest truss-based structural diversity and return their social contexts. To tackle this problem, we propose an online structural diversity search algorithm in - time, where -, -, and - are respectively the arboricity, the number of edges, and the number of triangles in -. To improve the efficiency, we design an elegant and compact index, called TSD-index, which keeps the structural diversity information for all individual vertices. We further optimize the structure of TSD-index into a highly compressed GCT-index. Our GCT-index-based structural diversity search utilizes the global triangle information for fast index construction and finds answers in - time. Extensive experiments demonstrate the effectiveness and efficiency of our proposed model and algorithms, against state-of-the-art methods.",
"title": "Truss-Based Structural Diversity Search in Large Graphs",
"normalizedTitle": "Truss-Based Structural Diversity Search in Large Graphs",
"fno": "09210126",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Cultural Differences",
"Context Modeling",
"Indexes",
"Search Problems",
"Analytical Models",
"Facebook",
"Structural Diversity",
"top-<named-content xmlns:xlink=\"http://www.w3.org/1999/xlink\" xmlns:ali=\"http://www.niso.org/schemas/ali/1.0/\" xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" content-type=\"kwd\" xlink:type=\"simple\"> <inline-formula> <tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math> </inline-formula> </named-content> search",
"Social Contagion",
"Truss Mining"
],
"authors": [
{
"givenName": "Jinbin",
"surname": "Huang",
"fullName": "Jinbin Huang",
"affiliation": "Hong Kong Baptist University, Kowloon Tong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xin",
"surname": "Huang",
"fullName": "Xin Huang",
"affiliation": "Hong Kong Baptist University, Kowloon Tong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jianliang",
"surname": "Xu",
"fullName": "Jianliang Xu",
"affiliation": "Hong Kong Baptist University, Kowloon Tong, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2022-08-01 00:00:00",
"pubType": "trans",
"pages": "4037-4051",
"year": "2022",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tb/2019/06/08371302",
"title": "Efficient Algorithms for Finding the Closest <inline-formula><tex-math notation=\"LaTeX\">Z_$l$_Z</tex-math></inline-formula>-Mers in Biological Data",
"doi": null,
"abstractUrl": "/journal/tb/2019/06/08371302/13rRUxlgyai",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2023/01/09930647",
"title": "The High Faulty Tolerant Capability of the Alternating Group Graphs",
"doi": null,
"abstractUrl": "/journal/td/2023/01/09930647/1HMP3UkhGus",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/01/09028268",
"title": "Cohesive Subgraph Search Using Keywords in Large Networks",
"doi": null,
"abstractUrl": "/journal/tk/2022/01/09028268/1i3ALWb6q6A",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2022/03/09126219",
"title": "Efficient Encrypted Data Search With Expressive Queries and Flexible Update",
"doi": null,
"abstractUrl": "/journal/sc/2022/03/09126219/1kWQqX0HGaA",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/07/09199134",
"title": "Computing K-Cores in Large Uncertain Graphs: An Index-Based Optimal Approach",
"doi": null,
"abstractUrl": "/journal/tk/2022/07/09199134/1naBq7vTUIw",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/09/09250607",
"title": "Enumerating Maximum Cliques in Massive Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2022/09/09250607/1oxjS6MBaA8",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2023/01/09420260",
"title": "Age Optimal Information Gathering and Dissemination on Graphs",
"doi": null,
"abstractUrl": "/journal/tm/2023/01/09420260/1tdUGrSPdg4",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/01/09452800",
"title": "Core Decomposition on Uncertain Graphs Revisited",
"doi": null,
"abstractUrl": "/journal/tk/2023/01/09452800/1ulCu0Hdqs8",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/04/09629291",
"title": "Efficient Influential Community Search in Large Uncertain Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2023/04/09629291/1yXvGVkW7ra",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/04/09662190",
"title": "Higher-Order Truss Decomposition in Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2023/04/09662190/1zzl2ZAAVvq",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09204819",
"articleId": "1nmdMjwj61y",
"__typename": "AdjacentArticleType"
},
"next": null,
"__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": "13rRUwh80uu",
"doi": "10.1109/TVCG.2008.164",
"abstract": "Smooth surface extraction using PDEs is a well-known and widely used technique for visualizing volume data. Existing approaches operate on gridded data and mainly on regular structured grids. When considering unstructured point-based volume data where sample points do not form regular patterns nor are they connected in any form, one would typically resample the data over a grid prior to applying the known PDE-based methods. As resampling inserts interpolation inaccuracies, data providers would rather have segmentation methods operate on the actual unstructured data. We propose an approach that directly extracts smooth surfaces from unstructured point-based volume data without prior resampling or mesh generation.When operating on unstructured data one needs to quickly derive neighborhood informations. The respective information is retrieved by partitioning the 3D domain into cells using a kd-tree and operating on its cells. We exploit neighborhood information to estimate gradients and mean curvature at every sample point using a four-dimensional least-squares fitting approach. Gradients and mean curvature are required for applying the chosen PDE-based method that combines hyperbolic advection to an isovalue of a given scalar field and mean curvature flow. Since we are using an explicit time-integration scheme, time steps are bounded by the Courant-Friedrichs-Lewy condition. To avoid small global time steps, we use asynchronous local integration. We extract the surface by successively fitting a smooth function to the data set. This function is initialized with a signed distance function. For each sample and for every time step we compute the respective gradient, the mean curvature, and a stable time step. With these informations the function is manipulated using an explicit Euler time integration. The process continues with the next sample point in time. If the norm of the function gradient in a sample exceeds a given threshold at some time the function is reinitialized to a signed distance function. The resulting smooth surface is obtained by extracting the zero isosurface from the function using isosurface extraction from unstructured data and rendering the surface using point-based methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Smooth surface extraction using PDEs is a well-known and widely used technique for visualizing volume data. Existing approaches operate on gridded data and mainly on regular structured grids. When considering unstructured point-based volume data where sample points do not form regular patterns nor are they connected in any form, one would typically resample the data over a grid prior to applying the known PDE-based methods. As resampling inserts interpolation inaccuracies, data providers would rather have segmentation methods operate on the actual unstructured data. We propose an approach that directly extracts smooth surfaces from unstructured point-based volume data without prior resampling or mesh generation.When operating on unstructured data one needs to quickly derive neighborhood informations. The respective information is retrieved by partitioning the 3D domain into cells using a kd-tree and operating on its cells. We exploit neighborhood information to estimate gradients and mean curvature at every sample point using a four-dimensional least-squares fitting approach. Gradients and mean curvature are required for applying the chosen PDE-based method that combines hyperbolic advection to an isovalue of a given scalar field and mean curvature flow. Since we are using an explicit time-integration scheme, time steps are bounded by the Courant-Friedrichs-Lewy condition. To avoid small global time steps, we use asynchronous local integration. We extract the surface by successively fitting a smooth function to the data set. This function is initialized with a signed distance function. For each sample and for every time step we compute the respective gradient, the mean curvature, and a stable time step. With these informations the function is manipulated using an explicit Euler time integration. The process continues with the next sample point in time. If the norm of the function gradient in a sample exceeds a given threshold at some time the function is reinitialized to a signed distance function. The resulting smooth surface is obtained by extracting the zero isosurface from the function using isosurface extraction from unstructured data and rendering the surface using point-based methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Smooth surface extraction using PDEs is a well-known and widely used technique for visualizing volume data. Existing approaches operate on gridded data and mainly on regular structured grids. When considering unstructured point-based volume data where sample points do not form regular patterns nor are they connected in any form, one would typically resample the data over a grid prior to applying the known PDE-based methods. As resampling inserts interpolation inaccuracies, data providers would rather have segmentation methods operate on the actual unstructured data. We propose an approach that directly extracts smooth surfaces from unstructured point-based volume data without prior resampling or mesh generation.When operating on unstructured data one needs to quickly derive neighborhood informations. The respective information is retrieved by partitioning the 3D domain into cells using a kd-tree and operating on its cells. We exploit neighborhood information to estimate gradients and mean curvature at every sample point using a four-dimensional least-squares fitting approach. Gradients and mean curvature are required for applying the chosen PDE-based method that combines hyperbolic advection to an isovalue of a given scalar field and mean curvature flow. Since we are using an explicit time-integration scheme, time steps are bounded by the Courant-Friedrichs-Lewy condition. To avoid small global time steps, we use asynchronous local integration. We extract the surface by successively fitting a smooth function to the data set. This function is initialized with a signed distance function. For each sample and for every time step we compute the respective gradient, the mean curvature, and a stable time step. With these informations the function is manipulated using an explicit Euler time integration. The process continues with the next sample point in time. If the norm of the function gradient in a sample exceeds a given threshold at some time the function is reinitialized to a signed distance function. The resulting smooth surface is obtained by extracting the zero isosurface from the function using isosurface extraction from unstructured data and rendering the surface using point-based methods.",
"title": "Smooth Surface Extraction from Unstructured Point-based Volume Data Using PDEs",
"normalizedTitle": "Smooth Surface Extraction from Unstructured Point-based Volume Data Using PDEs",
"fno": "ttg2008061531",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms PD Es",
"Surface Extraction",
"Level Sets",
"Point Based Visualization"
],
"authors": [
{
"givenName": "Paul",
"surname": "Rosenthal",
"fullName": "Paul Rosenthal",
"affiliation": "Jacobs University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lars",
"surname": "Linsen",
"fullName": "Lars Linsen",
"affiliation": "Jacobs University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1531-1546",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vrais/1996/7295/0/72950111",
"title": "Generalized Surface and Volume Decimation for Unstructured Tessellated Domains",
"doi": null,
"abstractUrl": "/proceedings-article/vrais/1996/72950111/12OmNBEYzQs",
"parentPublication": {
"id": "proceedings/vrais/1996/7295/0",
"title": "Virtual Reality Annual International Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1997/8262/0/82620379",
"title": "Smooth hierarchical surface triangulations",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1997/82620379/12OmNqH9hgj",
"parentPublication": {
"id": "proceedings/ieee-vis/1997/8262/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2013/4893/0/06456227",
"title": "Estimating Discrete Surface Curvature Based on Voronoi Poles",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2013/06456227/12OmNvT2oWn",
"parentPublication": {
"id": "proceedings/isdea/2013/4893/0",
"title": "2013 Third International Conference on Intelligent System Design and Engineering Applications (ISDEA 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880433",
"title": "TetSplat Real-Time Rendering and Volume Clipping of Large Unstructured Tetrahedral Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880433/12OmNzRHOOj",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dimpvt/2011/4369/0/4369a290",
"title": "Sampling Relevant Points for Surface Registration",
"doi": null,
"abstractUrl": "/proceedings-article/3dimpvt/2011/4369a290/12OmNzSQdsh",
"parentPublication": {
"id": "proceedings/3dimpvt/2011/4369/0",
"title": "2011 International Conference on 3D Imaging, Modeling, Processing, Visualization and Transmission",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imccc/2011/4519/0/4519a137",
"title": "Sampling Method for Similar Section Surface Inspection",
"doi": null,
"abstractUrl": "/proceedings-article/imccc/2011/4519a137/12OmNzkMlHh",
"parentPublication": {
"id": "proceedings/imccc/2011/4519/0",
"title": "Instrumentation, Measurement, Computer, Communication and Control, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2006/02/i0302",
"title": "Robust Structure and Motion from Outlines of Smooth Curved Surfaces",
"doi": null,
"abstractUrl": "/journal/tp/2006/02/i0302/13rRUILtJAP",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061675",
"title": "Text Scaffolds for Effective Surface Labeling",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061675/13rRUwInvAW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/05/v0573",
"title": "A Sampling Framework for Accurate Curvature Estimation in Discrete Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2005/05/v0573/13rRUxC0SOP",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2006/02/i0328",
"title": "Implicit Meshes for Surface Reconstruction",
"doi": null,
"abstractUrl": "/journal/tp/2006/02/i0328/13rRUygT7o3",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061523",
"articleId": "13rRUy0qnLC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061539",
"articleId": "13rRUwInveZ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwGqBqg",
"title": "November/December",
"year": "2009",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "15",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIJcWlj",
"doi": "10.1109/TVCG.2009.198",
"abstract": "Rhinologists are often faced with the challenge of assessing nasal breathing from a functional point of view to derive effective therapeutic interventions. While the complex nasal anatomy can be revealed by visual inspection and medical imaging, only vague information is available regarding the nasal airflow itself: Rhinomanometry delivers rather unspecific integral information on the pressure gradient as well as on total flow and nasal flow resistance. In this article we demonstrate how the understanding of physiological nasal breathing can be improved by simulating and visually analyzing nasal airflow, based on an anatomically correct model of the upper human respiratory tract. In particular we demonstrate how various Information Visualization (InfoVis) techniques, such as a highly scalable implementation of parallel coordinates, time series visualizations, as well as unstructured grid multi-volume rendering, all integrated within a multiple linked views framework, can be utilized to gain a deeper understanding of nasal breathing. Evaluation is accomplished by visual exploration of spatio-temporal airflow characteristics that include not only information on flow features but also on accompanying quantities such as temperature and humidity. To our knowledge, this is the first in-depth visual exploration of the physiological function of the nose over several simulated breathing cycles under consideration of a complete model of the nasal airways, realistic boundary conditions, and all physically relevant time-varying quantities.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Rhinologists are often faced with the challenge of assessing nasal breathing from a functional point of view to derive effective therapeutic interventions. While the complex nasal anatomy can be revealed by visual inspection and medical imaging, only vague information is available regarding the nasal airflow itself: Rhinomanometry delivers rather unspecific integral information on the pressure gradient as well as on total flow and nasal flow resistance. In this article we demonstrate how the understanding of physiological nasal breathing can be improved by simulating and visually analyzing nasal airflow, based on an anatomically correct model of the upper human respiratory tract. In particular we demonstrate how various Information Visualization (InfoVis) techniques, such as a highly scalable implementation of parallel coordinates, time series visualizations, as well as unstructured grid multi-volume rendering, all integrated within a multiple linked views framework, can be utilized to gain a deeper understanding of nasal breathing. Evaluation is accomplished by visual exploration of spatio-temporal airflow characteristics that include not only information on flow features but also on accompanying quantities such as temperature and humidity. To our knowledge, this is the first in-depth visual exploration of the physiological function of the nose over several simulated breathing cycles under consideration of a complete model of the nasal airways, realistic boundary conditions, and all physically relevant time-varying quantities.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Rhinologists are often faced with the challenge of assessing nasal breathing from a functional point of view to derive effective therapeutic interventions. While the complex nasal anatomy can be revealed by visual inspection and medical imaging, only vague information is available regarding the nasal airflow itself: Rhinomanometry delivers rather unspecific integral information on the pressure gradient as well as on total flow and nasal flow resistance. In this article we demonstrate how the understanding of physiological nasal breathing can be improved by simulating and visually analyzing nasal airflow, based on an anatomically correct model of the upper human respiratory tract. In particular we demonstrate how various Information Visualization (InfoVis) techniques, such as a highly scalable implementation of parallel coordinates, time series visualizations, as well as unstructured grid multi-volume rendering, all integrated within a multiple linked views framework, can be utilized to gain a deeper understanding of nasal breathing. Evaluation is accomplished by visual exploration of spatio-temporal airflow characteristics that include not only information on flow features but also on accompanying quantities such as temperature and humidity. To our knowledge, this is the first in-depth visual exploration of the physiological function of the nose over several simulated breathing cycles under consideration of a complete model of the nasal airways, realistic boundary conditions, and all physically relevant time-varying quantities.",
"title": "Visual Exploration of Nasal Airflow",
"normalizedTitle": "Visual Exploration of Nasal Airflow",
"fno": "ttg2009061407",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Flow Visualization",
"Exploratory Data Analysis",
"Interactive Visual Flow Visualization",
"Exploratory Data Analysis",
"Interactive Visual Analysis Of Scientific Data",
"Time Dependent Data"
],
"authors": [
{
"givenName": "Stefan",
"surname": "Zachow",
"fullName": "Stefan Zachow",
"affiliation": "Zuse Institute Berlin (ZIB)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Philipp",
"surname": "Muigg",
"fullName": "Philipp Muigg",
"affiliation": "Vienna University of Technology and SimVis GmbH, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Hildebrandt",
"fullName": "Thomas Hildebrandt",
"affiliation": "Asklepios Clinic Birkenwerder",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Helmut",
"surname": "Doleisch",
"fullName": "Helmut Doleisch",
"affiliation": "SimVis GmbH, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hans-Christian",
"surname": "Hege",
"fullName": "Hans-Christian Hege",
"affiliation": "Zuse Institute Berlin (ZIB)",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2009-11-01 00:00:00",
"pubType": "trans",
"pages": "1407-1414",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cmcsn/2012/4738/0/4738a311",
"title": "Research of Airflow Distribution for Center Data Equipment Room Air Conditioning System",
"doi": null,
"abstractUrl": "/proceedings-article/cmcsn/2012/4738a311/12OmNAOsMPI",
"parentPublication": {
"id": "proceedings/cmcsn/2012/4738/0",
"title": "Computing, Measurement, Control and Sensor Network, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isuvr/2010/4124/0/4124a056",
"title": "Semiautomatic Segmentation of Nasal Airway Based on Collaborative Environment",
"doi": null,
"abstractUrl": "/proceedings-article/isuvr/2010/4124a056/12OmNBE7MoW",
"parentPublication": {
"id": "proceedings/isuvr/2010/4124/0",
"title": "International Symposium on Ubiquitous Virtual Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2015/7143/0/7143b208",
"title": "The Function Design of Nasal Flow Signal Analysis Software",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2015/7143b208/12OmNBp52Br",
"parentPublication": {
"id": "proceedings/icmtma/2015/7143/0",
"title": "2015 Seventh International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2012/4752/0/06400514",
"title": "Big data exploration through visual analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2012/06400514/12OmNC3XhwY",
"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/vr/2005/8929/0/01492778",
"title": "VRhino II: flow field visualization inside the human nasal cavity",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2005/01492778/12OmNCdk2SF",
"parentPublication": {
"id": "proceedings/vr/2005/8929/0",
"title": "IEEE Virtual Reality 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icic/2010/4047/2/4047b029",
"title": "Investigation of Interior Airflow Visualization of U-type Fin-and-Tube Heat Exchanger",
"doi": null,
"abstractUrl": "/proceedings-article/icic/2010/4047b029/12OmNx76TGV",
"parentPublication": {
"id": "proceedings/icic/2010/4047/1",
"title": "2010 Third International Conference on Information and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2009/3801/3/3801c001",
"title": "Visualization Cube: Modeling Interaction for Exploratory Data Analysis of Spatiotemporal Trend Information",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2009/3801c001/12OmNxGj9Qu",
"parentPublication": {
"id": "proceedings/wi-iat/2009/3801/3",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2010/05/mcg2010050032",
"title": "Newdle: Interactive Visual Exploration of Large Online News Collections",
"doi": null,
"abstractUrl": "/magazine/cg/2010/05/mcg2010050032/13rRUEgariC",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icise-ie/2021/3829/0/382900a888",
"title": "A study on the pronunciation of nasal initial syllables in Shigatse dialect based on Glottal MS-110",
"doi": null,
"abstractUrl": "/proceedings-article/icise-ie/2021/382900a888/1C8GHOOe9ji",
"parentPublication": {
"id": "proceedings/icise-ie/2021/3829/0",
"title": "2021 2nd International Conference on Information Science and Education (ICISE-IE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2022/5325/0/532500a215",
"title": "Towards Spatial Airflow Interaction: Schlieren Imaging for Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2022/532500a215/1JrRcUNGnyE",
"parentPublication": {
"id": "proceedings/ismar/2022/5325/0",
"title": "2022 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009061399",
"articleId": "13rRUwI5U2B",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2009061415",
"articleId": "13rRUxYrbMa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRPN",
"name": "ttg2009061407s.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2009061407s.zip",
"extension": "zip",
"size": "20.2 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.