data
dict |
|---|
{
"issue": {
"id": "12OmNwpGgK8",
"title": "Dec.",
"year": "2014",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyeCkai",
"doi": "10.1109/TVCG.2014.2346979",
"abstract": "Despite years of research yielding systems and guidelines to aid visualization design, practitioners still face the challenge of identifying the best visualization for a given dataset and task. One promising approach to circumvent this problem is to leverage perceptual laws to quantitatively evaluate the effectiveness of a visualization design. Following previously established methodologies, we conduct a large scale (n = 1687) crowdsourced experiment to investigate whether the perception of correlation in nine commonly used visualizations can be modeled using Weber's law. The results of this experiment contribute to our understanding of information visualization by establishing that: 1) for all tested visualizations, the precision of correlation judgment could be modeled by Weber's law, 2) correlation judgment precision showed striking variation between negatively and positively correlated data, and 3) Weber models provide a concise means to quantify, compare, and rank the perceptual precision afforded by a visualization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Despite years of research yielding systems and guidelines to aid visualization design, practitioners still face the challenge of identifying the best visualization for a given dataset and task. One promising approach to circumvent this problem is to leverage perceptual laws to quantitatively evaluate the effectiveness of a visualization design. Following previously established methodologies, we conduct a large scale (n = 1687) crowdsourced experiment to investigate whether the perception of correlation in nine commonly used visualizations can be modeled using Weber's law. The results of this experiment contribute to our understanding of information visualization by establishing that: 1) for all tested visualizations, the precision of correlation judgment could be modeled by Weber's law, 2) correlation judgment precision showed striking variation between negatively and positively correlated data, and 3) Weber models provide a concise means to quantify, compare, and rank the perceptual precision afforded by a visualization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Despite years of research yielding systems and guidelines to aid visualization design, practitioners still face the challenge of identifying the best visualization for a given dataset and task. One promising approach to circumvent this problem is to leverage perceptual laws to quantitatively evaluate the effectiveness of a visualization design. Following previously established methodologies, we conduct a large scale (n = 1687) crowdsourced experiment to investigate whether the perception of correlation in nine commonly used visualizations can be modeled using Weber's law. The results of this experiment contribute to our understanding of information visualization by establishing that: 1) for all tested visualizations, the precision of correlation judgment could be modeled by Weber's law, 2) correlation judgment precision showed striking variation between negatively and positively correlated data, and 3) Weber models provide a concise means to quantify, compare, and rank the perceptual precision afforded by a visualization.",
"title": "Ranking Visualizations of Correlation Using Weber's Law",
"normalizedTitle": "Ranking Visualizations of Correlation Using Weber's Law",
"fno": "06875978",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Design Methodology",
"Data Visualization",
"Crowdsourcing",
"Image Color Analysis",
"Data Models",
"Testing",
"Evaluation",
"Perception",
"Visualization"
],
"authors": [
{
"givenName": "Lane",
"surname": "Harrison",
"fullName": "Lane Harrison",
"affiliation": ", Tufts University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fumeng",
"surname": "Yang",
"fullName": "Fumeng Yang",
"affiliation": ", Tufts University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Steven",
"surname": "Franconeri",
"fullName": "Steven Franconeri",
"affiliation": ", Northwestern University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Remco",
"surname": "Chang",
"fullName": "Remco Chang",
"affiliation": ", Tufts University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "1943-1952",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2016/01/07192661",
"title": "Beyond Weber's Law: A Second Look at Ranking Visualizations of Correlation",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192661/13rRUxBa5c2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122053",
"title": "Evaluation of Trend Localization with Multi-Variate Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122053/13rRUxC0SEf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2014/04/mcg2014040063",
"title": "Putting Science First: Distinguishing Visualizations from Pretty Pictures",
"doi": null,
"abstractUrl": "/magazine/cg/2014/04/mcg2014040063/13rRUyv53HS",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08454346",
"title": "Mapping Color to Meaning in Colormap Data Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08454346/17D45VsBU7I",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/03/08305493",
"title": "Correlation Judgment and Visualization Features: A Comparative Study",
"doi": null,
"abstractUrl": "/journal/tg/2019/03/08305493/17D45WaTkmp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2018/7202/0/720200a169",
"title": "An Instrument for Evaluating the Quality of Data Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a169/17D45XvMcd8",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904490",
"title": "A Scanner Deeply: Predicting Gaze Heatmaps on Visualizations Using Crowdsourced Eye Movement Data",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904490/1H1gj9xTTG0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904428",
"title": "Photosensitive Accessibility for Interactive Data Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904428/1H1goP5OTrW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08809223",
"title": "A Comparison of Visualizations for Identifying Correlation over Space and Time",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08809223/1cFV3t4YaVa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09217952",
"title": "A Bayesian cognition approach for belief updating of correlation judgement through uncertainty visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09217952/1nL7qhcUKPe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06875950",
"articleId": "13rRUy3xY2S",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06875989",
"articleId": "13rRUwcAqqk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45WWzW3b",
"doi": "10.1109/TVCG.2018.2865020",
"abstract": "Fuzzy clustering assigns a probability of membership for a datum to a cluster, which veritably reflects real-world clustering scenarios but significantly increases the complexity of understanding fuzzy clusters. Many studies have demonstrated that visualization techniques for multi-dimensional data are beneficial to understand fuzzy clusters. However, no empirical evidence exists on the effectiveness and efficiency of these visualization techniques in solving analytical tasks featured by fuzzy clusters. In this paper, we conduct a controlled experiment to evaluate the ability of fuzzy clusters analysis to use four multi-dimensional visualization techniques, namely, parallel coordinate plot, scatterplot matrix, principal component analysis, and Radviz. First, we define the analytical tasks and their representative questions specific to fuzzy clusters analysis. Then, we design objective questionnaires to compare the accuracy, time, and satisfaction in using the four techniques to solve the questions. We also design subjective questionnaires to collect the experience of the volunteers with the four techniques in terms of ease of use, informativeness, and helpfulness. With a complete experiment process and a detailed result analysis, we test against four hypotheses that are formulated on the basis of our experience, and provide instructive guidance for analysts in selecting appropriate and efficient visualization techniques to analyze fuzzy clusters.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Fuzzy clustering assigns a probability of membership for a datum to a cluster, which veritably reflects real-world clustering scenarios but significantly increases the complexity of understanding fuzzy clusters. Many studies have demonstrated that visualization techniques for multi-dimensional data are beneficial to understand fuzzy clusters. However, no empirical evidence exists on the effectiveness and efficiency of these visualization techniques in solving analytical tasks featured by fuzzy clusters. In this paper, we conduct a controlled experiment to evaluate the ability of fuzzy clusters analysis to use four multi-dimensional visualization techniques, namely, parallel coordinate plot, scatterplot matrix, principal component analysis, and Radviz. First, we define the analytical tasks and their representative questions specific to fuzzy clusters analysis. Then, we design objective questionnaires to compare the accuracy, time, and satisfaction in using the four techniques to solve the questions. We also design subjective questionnaires to collect the experience of the volunteers with the four techniques in terms of ease of use, informativeness, and helpfulness. With a complete experiment process and a detailed result analysis, we test against four hypotheses that are formulated on the basis of our experience, and provide instructive guidance for analysts in selecting appropriate and efficient visualization techniques to analyze fuzzy clusters.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Fuzzy clustering assigns a probability of membership for a datum to a cluster, which veritably reflects real-world clustering scenarios but significantly increases the complexity of understanding fuzzy clusters. Many studies have demonstrated that visualization techniques for multi-dimensional data are beneficial to understand fuzzy clusters. However, no empirical evidence exists on the effectiveness and efficiency of these visualization techniques in solving analytical tasks featured by fuzzy clusters. In this paper, we conduct a controlled experiment to evaluate the ability of fuzzy clusters analysis to use four multi-dimensional visualization techniques, namely, parallel coordinate plot, scatterplot matrix, principal component analysis, and Radviz. First, we define the analytical tasks and their representative questions specific to fuzzy clusters analysis. Then, we design objective questionnaires to compare the accuracy, time, and satisfaction in using the four techniques to solve the questions. We also design subjective questionnaires to collect the experience of the volunteers with the four techniques in terms of ease of use, informativeness, and helpfulness. With a complete experiment process and a detailed result analysis, we test against four hypotheses that are formulated on the basis of our experience, and provide instructive guidance for analysts in selecting appropriate and efficient visualization techniques to analyze fuzzy clusters.",
"title": "Evaluating Multi-Dimensional Visualizations for Understanding Fuzzy Clusters",
"normalizedTitle": "Evaluating Multi-Dimensional Visualizations for Understanding Fuzzy Clusters",
"fno": "08440829",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Fuzzy Set Theory",
"Matrix Algebra",
"Pattern Clustering",
"Principal Component Analysis",
"Probability",
"Scatterplot Matrix",
"Principal Component Analysis",
"Multidimensional Visualization Techniques",
"Fuzzy Clusters Analysis",
"Data Visualization",
"Task Analysis",
"Principal Component Analysis",
"Visualization",
"Encoding",
"Clustering Algorithms",
"Correlation",
"Evaluation",
"Multi Dimensional Visualization",
"Fuzzy Clustering",
"Parallel Coordinate Plot",
"Scatterplot Matrix",
"Principal Component Analysis",
"Radviz"
],
"authors": [
{
"givenName": "Ying",
"surname": "Zhao",
"fullName": "Ying Zhao",
"affiliation": "Central South University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Feng",
"surname": "Luo",
"fullName": "Feng Luo",
"affiliation": "Central South University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Minghui",
"surname": "Chen",
"fullName": "Minghui Chen",
"affiliation": "Central South University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yingchao",
"surname": "Wang",
"fullName": "Yingchao Wang",
"affiliation": "Central South University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiazhi",
"surname": "Xia",
"fullName": "Jiazhi Xia",
"affiliation": "Central South University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fangfang",
"surname": "Zhou",
"fullName": "Fangfang Zhou",
"affiliation": "Central South University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yunhai",
"surname": "Wang",
"fullName": "Yunhai Wang",
"affiliation": "Shandong University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yi",
"surname": "Chen",
"fullName": "Yi Chen",
"affiliation": "Beijing TechnologyBusiness University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Chen",
"fullName": "Wei Chen",
"affiliation": "State Key Lab of CAD & CGZhejiang University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "12-21",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/big-data/2014/5666/0/07004262",
"title": "Evaluating density-based motion for big data visual analytics",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2014/07004262/12OmNB0nWeq",
"parentPublication": {
"id": "proceedings/big-data/2014/5666/0",
"title": "2014 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2012/0227/1/06495126",
"title": "A New Algorithm for Fuzzy Clustering Able to Find the Optimal Number of Clusters",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2012/06495126/12OmNB9bvhV",
"parentPublication": {
"id": "proceedings/ictai/2012/0227/1",
"title": "2012 IEEE 24th International Conference on Tools with Artificial Intelligence (ICTAI 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660012",
"title": "On the Optimization of Visualizations of Complex Phenomena",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660012/12OmNCfSqN3",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2004/2181/0/21810480",
"title": "Student Modeling Using Principal Component Analysis of SOM Clusters",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2004/21810480/12OmNx3HIau",
"parentPublication": {
"id": "proceedings/icalt/2004/2181/0",
"title": "Proceedings. IEEE International Conference on Advanced Learning Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aipr/2016/3284/0/08010591",
"title": "Visualization of high dimensional image features for classification",
"doi": null,
"abstractUrl": "/proceedings-article/aipr/2016/08010591/12OmNyGbI5g",
"parentPublication": {
"id": "proceedings/aipr/2016/3284/0",
"title": "2016 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2004/8779/0/87790081",
"title": "Uncovering Clusters in Crowded Parallel Coordinates Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2004/87790081/12OmNzR8CvT",
"parentPublication": {
"id": "proceedings/ieee-infovis/2004/8779/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/03/07784854",
"title": "Visualizing High-Dimensional Data: Advances in the Past Decade",
"doi": null,
"abstractUrl": "/journal/tg/2017/03/07784854/13rRUwjGoG8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875968",
"title": "Comparative Eye Tracking Study on Node-Link Visualizations of Trajectories",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875968/13rRUy3gn7y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440826",
"title": "Comparing Similarity Perception in Time Series Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440826/17D45XoXP7S",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2020/6553/0/09093469",
"title": "2-MAP: Aligned Visualizations for Comparison of High-Dimensional Point Sets",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2020/09093469/1jPbpOaFbRC",
"parentPublication": {
"id": "proceedings/wacv/2020/6553/0",
"title": "2020 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440840",
"articleId": "17D45XreC6d",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440815",
"articleId": "17D45Wuc38F",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRPS",
"name": "ttg201901-08440829s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08440829s1.zip",
"extension": "zip",
"size": "708 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45XDIXSW",
"doi": "10.1109/TVCG.2018.2865146",
"abstract": "Recently, an approach for determining the value of a visualization was proposed, one moving beyond simple measurements of task accuracy and speed. The value equation contains components for the time savings a visualization provides, the insights and insightful questions it spurs, the overall essence of the data it conveys, and the confidence about the data and its domain it inspires. This articulation of value is purely descriptive, however, providing no actionable method of assessing a visualization's value. In this work, we create a heuristic-based evaluation methodology to accompany the value equation for assessing interactive visualizations. We refer to the methodology colloquially as ICE-T, based on an anagram of the four value components. Our approach breaks the four components down into guidelines, each of which is made up of a small set of low-level heuristics. Evaluators who have knowledge of visualization design principles then assess the visualization with respect to the heuristics. We conducted an initial trial of the methodology on three interactive visualizations of the same data set, each evaluated by 15 visualization experts. We found that the methodology showed promise, obtaining consistent ratings across the three visualizations and mirroring judgments of the utility of the visualizations by instructors of the course in which they were developed.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recently, an approach for determining the value of a visualization was proposed, one moving beyond simple measurements of task accuracy and speed. The value equation contains components for the time savings a visualization provides, the insights and insightful questions it spurs, the overall essence of the data it conveys, and the confidence about the data and its domain it inspires. This articulation of value is purely descriptive, however, providing no actionable method of assessing a visualization's value. In this work, we create a heuristic-based evaluation methodology to accompany the value equation for assessing interactive visualizations. We refer to the methodology colloquially as ICE-T, based on an anagram of the four value components. Our approach breaks the four components down into guidelines, each of which is made up of a small set of low-level heuristics. Evaluators who have knowledge of visualization design principles then assess the visualization with respect to the heuristics. We conducted an initial trial of the methodology on three interactive visualizations of the same data set, each evaluated by 15 visualization experts. We found that the methodology showed promise, obtaining consistent ratings across the three visualizations and mirroring judgments of the utility of the visualizations by instructors of the course in which they were developed.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recently, an approach for determining the value of a visualization was proposed, one moving beyond simple measurements of task accuracy and speed. The value equation contains components for the time savings a visualization provides, the insights and insightful questions it spurs, the overall essence of the data it conveys, and the confidence about the data and its domain it inspires. This articulation of value is purely descriptive, however, providing no actionable method of assessing a visualization's value. In this work, we create a heuristic-based evaluation methodology to accompany the value equation for assessing interactive visualizations. We refer to the methodology colloquially as ICE-T, based on an anagram of the four value components. Our approach breaks the four components down into guidelines, each of which is made up of a small set of low-level heuristics. Evaluators who have knowledge of visualization design principles then assess the visualization with respect to the heuristics. We conducted an initial trial of the methodology on three interactive visualizations of the same data set, each evaluated by 15 visualization experts. We found that the methodology showed promise, obtaining consistent ratings across the three visualizations and mirroring judgments of the utility of the visualizations by instructors of the course in which they were developed.",
"title": "A Heuristic Approach to Value-Driven Evaluation of Visualizations",
"normalizedTitle": "A Heuristic Approach to Value-Driven Evaluation of Visualizations",
"fno": "08454343",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Heuristic Based Evaluation Methodology",
"Interactive Visualizations",
"Value Components",
"Low Level Heuristics",
"Visualization Design Principles",
"Mirroring Judgments",
"Heuristic Approach",
"Value Driven Evaluation",
"Simple Measurements",
"Task Accuracy",
"Visualization Experts",
"Data Visualization",
"Task Analysis",
"Usability",
"Visualization",
"Benchmark Testing",
"Tools",
"Guidelines",
"Visualization Evaluation",
"Heuristics",
"Value Of Visualization"
],
"authors": [
{
"givenName": "Emily",
"surname": "Wall",
"fullName": "Emily Wall",
"affiliation": "Georgia Institute of Technology, Atlanta, GA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Meeshu",
"surname": "Agnihotri",
"fullName": "Meeshu Agnihotri",
"affiliation": "Georgia Institute of Technology, Atlanta, GA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Laura",
"surname": "Matzen",
"fullName": "Laura Matzen",
"affiliation": "Sandia National Laboratories, Albuquerque, NM, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kristin",
"surname": "Divis",
"fullName": "Kristin Divis",
"affiliation": "Sandia National Laboratories, Albuquerque, NM, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Haass",
"fullName": "Michael Haass",
"affiliation": "Sandia National Laboratories, Albuquerque, NM, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alex",
"surname": "Endert",
"fullName": "Alex Endert",
"affiliation": "Georgia Institute of Technology, Atlanta, GA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Stasko",
"fullName": "John Stasko",
"affiliation": "Georgia Institute of Technology, Atlanta, GA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "491-500",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2008/01/ttg2008010120",
"title": "Promoting Insight-Based Evaluation of Visualizations: From Contest to Benchmark Repository",
"doi": null,
"abstractUrl": "/journal/tg/2008/01/ttg2008010120/13rRUxjQyho",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440860",
"title": "Augmenting Visualizations with Interactive Data Facts to Facilitate Interpretation and Communication",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440860/17D45Vw15v5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/beliv/2018/6884/0/08634108",
"title": "Heuristic Evaluation in Visualization: An Empirical Study : Position paper",
"doi": null,
"abstractUrl": "/proceedings-article/beliv/2018/08634108/17D45WHONmZ",
"parentPublication": {
"id": "proceedings/beliv/2018/6884/0",
"title": "2018 IEEE Evaluation and Beyond - Methodological Approaches for Visualization (BELIV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2018/7202/0/720200a169",
"title": "An Instrument for Evaluating the Quality of Data Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a169/17D45XvMcd8",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/05/08744242",
"title": "Data2Vis: Automatic Generation of Data Visualizations Using Sequence-to-Sequence Recurrent Neural Networks",
"doi": null,
"abstractUrl": "/magazine/cg/2019/05/08744242/1cFV5domibu",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/08930077",
"title": "Gaze-Driven Adaptive Interventions for Magazine-Style Narrative Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/08930077/1fCCO10cYW4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/edoc/2019/2702/0/270200a132",
"title": "Modelling the Semantics for Model-Driven Interactive Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/edoc/2019/270200a132/1grPYiG4sbC",
"parentPublication": {
"id": "proceedings/edoc/2019/2702/0",
"title": "2019 IEEE 23rd International Enterprise Distributed Object Computing Conference (EDOC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222289",
"title": "Lyra 2: Designing Interactive Visualizations by Demonstration",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222289/1nTqMd2ZViE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222102",
"title": "Communicative Visualizations as a Learning Problem",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222102/1nTr1JohElO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a206",
"title": "Why Shouldn’t All Charts Be Scatter Plots? Beyond Precision-Driven Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a206/1qRO3t1TelW",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440820",
"articleId": "17D45Xtvp8C",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08454489",
"articleId": "17D45W1Oa3s",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet4y",
"name": "ttg201901-08454343s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08454343s1.zip",
"extension": "zip",
"size": "95.9 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAtstbv",
"title": "Feb.",
"year": "2020",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1gd8NarXyzC",
"doi": "10.1109/TVCG.2018.2867488",
"abstract": "Iso-surfaces or level-sets provide an effective and frequently used means for feature visualization. However, they are restricted to simple features for uni-variate data. The approach does not scale when moving to multi-variate data or when considering more complex feature definitions. In this paper, we introduce the concept of traits and feature level-sets, which can be understood as a generalization of level-sets as it includes iso-surfaces, and fiber surfaces as special cases. The concept is applicable to a large class of traits defined as subsets in attribute space, which can be arbitrary combinations of points, lines, surfaces and volumes. It is implemented into a system that provides an interface to define traits in an interactive way and multiple rendering options. We demonstrate the effectiveness of the approach using multi-variate data sets of different nature, including vector and tensor data, from different application domains.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Iso-surfaces or level-sets provide an effective and frequently used means for feature visualization. However, they are restricted to simple features for uni-variate data. The approach does not scale when moving to multi-variate data or when considering more complex feature definitions. In this paper, we introduce the concept of traits and feature level-sets, which can be understood as a generalization of level-sets as it includes iso-surfaces, and fiber surfaces as special cases. The concept is applicable to a large class of traits defined as subsets in attribute space, which can be arbitrary combinations of points, lines, surfaces and volumes. It is implemented into a system that provides an interface to define traits in an interactive way and multiple rendering options. We demonstrate the effectiveness of the approach using multi-variate data sets of different nature, including vector and tensor data, from different application domains.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Iso-surfaces or level-sets provide an effective and frequently used means for feature visualization. However, they are restricted to simple features for uni-variate data. The approach does not scale when moving to multi-variate data or when considering more complex feature definitions. In this paper, we introduce the concept of traits and feature level-sets, which can be understood as a generalization of level-sets as it includes iso-surfaces, and fiber surfaces as special cases. The concept is applicable to a large class of traits defined as subsets in attribute space, which can be arbitrary combinations of points, lines, surfaces and volumes. It is implemented into a system that provides an interface to define traits in an interactive way and multiple rendering options. We demonstrate the effectiveness of the approach using multi-variate data sets of different nature, including vector and tensor data, from different application domains.",
"title": "Feature Level-Sets: Generalizing Iso-Surfaces to Multi-Variate Data",
"normalizedTitle": "Feature Level-Sets: Generalizing Iso-Surfaces to Multi-Variate Data",
"fno": "08453863",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Feature Extraction",
"Rendering Computer Graphics",
"Tensors",
"Fiber Surfaces",
"Multivariate Data Sets",
"Vector Data",
"Tensor Data",
"Feature Level Sets",
"Feature Visualization",
"Uni Variate Data",
"Complex Feature Definitions",
"Iso Surface Generalization",
"Tensile Stress",
"Data Visualization",
"Rendering Computer Graphics",
"Transfer Functions",
"Geometry",
"Feature Extraction",
"Multivariate Visualization",
"Visualization Techniques And Methodologies",
"Approximation Of Surfaces And Contours"
],
"authors": [
{
"givenName": "Jochen",
"surname": "Jankowai",
"fullName": "Jochen Jankowai",
"affiliation": "Department of Science and Technology, Linköping Institute of Technology, Norrköping, Sweden",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ingrid",
"surname": "Hotz",
"fullName": "Ingrid Hotz",
"affiliation": "Department of Science and Technology, Linköping Institute of Technology, Norrköping, Sweden",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2020-02-01 00:00:00",
"pubType": "trans",
"pages": "1308-1319",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/rt/2006/0693/0/04061556",
"title": "Incremental Raycasting of Piecewise Quadratic Surfaces on the GPU",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2006/04061556/12OmNApcukG",
"parentPublication": {
"id": "proceedings/rt/2006/0693/0",
"title": "IEEE Symposium on Interactive Ray Tracing 2006",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532855",
"title": "Illustrative display of hidden iso-surface structures",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532855/12OmNBRsVxy",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vv/2000/308/0/04384230",
"title": "Reducing Aliasing Artifacts in Iso-Surfaces of Binary Volumes",
"doi": null,
"abstractUrl": "/proceedings-article/vv/2000/04384230/12OmNvIxeUE",
"parentPublication": {
"id": "proceedings/vv/2000/308/0",
"title": "2000 IEEE Symposium on Volume Visualization (VV 2000)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2013/2576/0/06815040",
"title": "Illusory Motions on Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2013/06815040/12OmNxXCGKC",
"parentPublication": {
"id": "proceedings/cad-graphics/2013/2576/0",
"title": "2013 International Conference on Computer-Aided Design and Computer Graphics (CAD/Graphics)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2014/2555/0/06816667",
"title": "Leveraging metadata for identifying local, robust multi-variate temporal (RMT) features",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2014/06816667/12OmNyFCvST",
"parentPublication": {
"id": "proceedings/icde/2014/2555/0",
"title": "2014 IEEE 30th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2015/6879/0/07156371",
"title": "Adaptive particle relaxation for time surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156371/12OmNzJbR3z",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/03/07286850",
"title": "Feature Surfaces in Symmetric Tensor Fields Based on Eigenvalue Manifold",
"doi": null,
"abstractUrl": "/journal/tg/2016/03/07286850/13rRUwhpBE8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/01/v0094",
"title": "Interactive Tensor Field Design and Visualization on Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2007/01/v0094/13rRUxASuG8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08447439",
"title": "Tensor Field Visualization using Fiber Surfaces of Invariant Space",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08447439/17D45W1Oa1M",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900a374",
"title": "Iso-Points: Optimizing Neural Implicit Surfaces with Hybrid Representations",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900a374/1yeHQ7YiMms",
"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": "08466895",
"articleId": "13ElNJSxmG4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08449121",
"articleId": "13rRUxlgxOs",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxGAKWw",
"title": "September/October",
"year": "2008",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "14",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwhpBE3",
"doi": "10.1109/TVCG.2008.58",
"abstract": "We introduce a novel flow visualization method called Flow Charts, which uses a texture atlas approach for the visualization of flows defined over curved surfaces. In this scheme the surface and its associated flow are segmented into overlapping patches which are then parameterized and packed in the texture domain. This scheme allows accurate particle advection across multiple charts in the texture domain, providing a flexible framework that supports various flow visualization techniques. The use of surface parameterization enables flow visualization techniques requiring the global view of the surface over long time spans, such as Unsteady Flow LIC (UFLIC), particle-based Unsteady Flow Advection-Convolution (UFAC), or dye advection. It also prevents visual artifacts normally associated with view-dependent methods. Represented as textures, Flow Charts can be naturally integrated into GPU flow visualization techniques for interactive performance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We introduce a novel flow visualization method called Flow Charts, which uses a texture atlas approach for the visualization of flows defined over curved surfaces. In this scheme the surface and its associated flow are segmented into overlapping patches which are then parameterized and packed in the texture domain. This scheme allows accurate particle advection across multiple charts in the texture domain, providing a flexible framework that supports various flow visualization techniques. The use of surface parameterization enables flow visualization techniques requiring the global view of the surface over long time spans, such as Unsteady Flow LIC (UFLIC), particle-based Unsteady Flow Advection-Convolution (UFAC), or dye advection. It also prevents visual artifacts normally associated with view-dependent methods. Represented as textures, Flow Charts can be naturally integrated into GPU flow visualization techniques for interactive performance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We introduce a novel flow visualization method called Flow Charts, which uses a texture atlas approach for the visualization of flows defined over curved surfaces. In this scheme the surface and its associated flow are segmented into overlapping patches which are then parameterized and packed in the texture domain. This scheme allows accurate particle advection across multiple charts in the texture domain, providing a flexible framework that supports various flow visualization techniques. The use of surface parameterization enables flow visualization techniques requiring the global view of the surface over long time spans, such as Unsteady Flow LIC (UFLIC), particle-based Unsteady Flow Advection-Convolution (UFAC), or dye advection. It also prevents visual artifacts normally associated with view-dependent methods. Represented as textures, Flow Charts can be naturally integrated into GPU flow visualization techniques for interactive performance.",
"title": "Flow Charts: Visualization of Vector Fields on Arbitrary Surfaces",
"normalizedTitle": "Flow Charts: Visualization of Vector Fields on Arbitrary Surfaces",
"fno": "ttg2008051067",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Flow Visualization",
"Textures",
"Graphics Hardware"
],
"authors": [
{
"givenName": "Guo-Shi",
"surname": "Li",
"fullName": "Guo-Shi Li",
"affiliation": "University of Utah, Salt Lake City",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xavier",
"surname": "Tricoche",
"fullName": "Xavier Tricoche",
"affiliation": "Purdue University, West Lafayette",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Weiskopf",
"fullName": "Daniel Weiskopf",
"affiliation": "University of Stuttgart, Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Charles D.",
"surname": "Hansen",
"fullName": "Charles D. Hansen",
"affiliation": "University of Utah, Salt Lake City",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2008-09-01 00:00:00",
"pubType": "trans",
"pages": "1067-1080",
"year": "2008",
"issn": "1077-2626",
"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/ieee-vis/2005/2766/0/27660081",
"title": "Particle and Texture Based Spatiotemporal Visualization of Time-Dependent Vector Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660081/12OmNrHjqKB",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/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": "proceedings/ieee-vis/1997/8262/0/82620317",
"title": "UFLIC: a line integral convolution algorithm for visualizing unsteady flows",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1997/82620317/12OmNxWLTyL",
"parentPublication": {
"id": "proceedings/ieee-vis/1997/8262/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532852",
"title": "Particle and texture based spatiotemporal visualization of time-dependent vector fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532852/12OmNyO8tNJ",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300015",
"title": "A Texture-Based Framework for Spacetime-Coherent Visualization of Time-Dependent Vector Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300015/12OmNyv7mgw",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/04/v0434",
"title": "Interactive Visualization of Three-Dimensional Vector Fields with Flexible Appearance Control",
"doi": null,
"abstractUrl": "/journal/tg/2004/04/v0434/13rRUEgarBk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1998/02/v0098",
"title": "A New Line Integral Convolution Algorithm for Visualizing Time-Varying Flow Fields",
"doi": null,
"abstractUrl": "/journal/tg/1998/02/v0098/13rRUxBa55T",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2002/03/v0211",
"title": "Lagrangian-Eulerian Advection of Noise and Dye Textures for Unsteady Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2002/03/v0211/13rRUxD9h4X",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/06/v1535",
"title": "High-Quality and Interactive Animations of 3D Time-Varying Vector Fields",
"doi": null,
"abstractUrl": "/journal/tg/2006/06/v1535/13rRUxNW1Zb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008051054",
"articleId": "13rRUyuNswU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008051081",
"articleId": "13rRUyY294x",
"__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": "13rRUwIF69e",
"doi": "10.1109/TVCG.2009.154",
"abstract": "In this paper we present techniques for the visualization of unsteady flows using streak surfaces, which allow for the first time an adaptive integration and rendering of such surfaces in real-time. The techniques consist of two main components, which are both realized on the GPU to exploit computational and bandwidth capacities for numerical particle integration and to minimize bandwidth requirements in the rendering of the surface. In the construction stage, an adaptive surface representation is generated. Surface refinement and coarsening strategies are based on local surface properties like distortion and curvature. We compare two different methods to generate a streak surface: a) by computing a patch-based surface representation that avoids any interdependence between patches, and b) by computing a particle-based surface representation including particle connectivity, and by updating this connectivity during particle refinement and coarsening. In the rendering stage, the surface is either rendered as a set of quadrilateral surface patches using high-quality point-based approaches, or a surface triangulation is built in turn from the given particle connectivity and the resulting triangle mesh is rendered. We perform a comparative study of the proposed techniques with respect to surface quality, visual quality and performance by visualizing streak surfaces in real flows using different rendering options.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper we present techniques for the visualization of unsteady flows using streak surfaces, which allow for the first time an adaptive integration and rendering of such surfaces in real-time. The techniques consist of two main components, which are both realized on the GPU to exploit computational and bandwidth capacities for numerical particle integration and to minimize bandwidth requirements in the rendering of the surface. In the construction stage, an adaptive surface representation is generated. Surface refinement and coarsening strategies are based on local surface properties like distortion and curvature. We compare two different methods to generate a streak surface: a) by computing a patch-based surface representation that avoids any interdependence between patches, and b) by computing a particle-based surface representation including particle connectivity, and by updating this connectivity during particle refinement and coarsening. In the rendering stage, the surface is either rendered as a set of quadrilateral surface patches using high-quality point-based approaches, or a surface triangulation is built in turn from the given particle connectivity and the resulting triangle mesh is rendered. We perform a comparative study of the proposed techniques with respect to surface quality, visual quality and performance by visualizing streak surfaces in real flows using different rendering options.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper we present techniques for the visualization of unsteady flows using streak surfaces, which allow for the first time an adaptive integration and rendering of such surfaces in real-time. The techniques consist of two main components, which are both realized on the GPU to exploit computational and bandwidth capacities for numerical particle integration and to minimize bandwidth requirements in the rendering of the surface. In the construction stage, an adaptive surface representation is generated. Surface refinement and coarsening strategies are based on local surface properties like distortion and curvature. We compare two different methods to generate a streak surface: a) by computing a patch-based surface representation that avoids any interdependence between patches, and b) by computing a particle-based surface representation including particle connectivity, and by updating this connectivity during particle refinement and coarsening. In the rendering stage, the surface is either rendered as a set of quadrilateral surface patches using high-quality point-based approaches, or a surface triangulation is built in turn from the given particle connectivity and the resulting triangle mesh is rendered. We perform a comparative study of the proposed techniques with respect to surface quality, visual quality and performance by visualizing streak surfaces in real flows using different rendering options.",
"title": "Interactive Streak Surface Visualization on the GPU",
"normalizedTitle": "Interactive Streak Surface Visualization on the GPU",
"fno": "ttg2009061259",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Unsteady Flow Visualization",
"Streak Surface Generation",
"GP Us"
],
"authors": [
{
"givenName": "Kai",
"surname": "Buerger",
"fullName": "Kai Buerger",
"affiliation": "Technische Universität München",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Florian",
"surname": "Ferstl",
"fullName": "Florian Ferstl",
"affiliation": "Technische Universität München",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Holger",
"surname": "Theisel",
"fullName": "Holger Theisel",
"affiliation": "University of Magdeburg",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rüdiger",
"surname": "Westermann",
"fullName": "Rüdiger Westermann",
"affiliation": "Technische Universität München",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2009-11-01 00:00:00",
"pubType": "trans",
"pages": "1259-1266",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sibgrapi/2010/8420/0/05720358",
"title": "Interactive Simulation and Visualization of Fluids with Surface Raycasting",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2010/05720358/12OmNwAKCLk",
"parentPublication": {
"id": "proceedings/sibgrapi/2010/8420/0",
"title": "2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1992/2897/0/00235226",
"title": "Rendering surface-particles",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1992/00235226/12OmNz61dc1",
"parentPublication": {
"id": "proceedings/visual/1992/2897/0",
"title": "Proceedings Visualization '92",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061391",
"title": "Interactive Visualization of Molecular Surface Dynamics",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061391/13rRUwInvsI",
"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/2002/03/v0211",
"title": "Lagrangian-Eulerian Advection of Noise and Dye Textures for Unsteady Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2002/03/v0211/13rRUxD9h4X",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/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": "ttg2009061251",
"articleId": "13rRUxAAT0J",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2009061267",
"articleId": "13rRUxBa5bM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgBA",
"name": "ttg2009061259s.avi",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2009061259s.avi",
"extension": "avi",
"size": "63.1 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": "13rRUxZ0o1s",
"doi": "10.1109/TVCG.2009.173",
"abstract": "In this paper we present a method for vortex core line extraction which operates directly on the smoothed particle hydrodynamics (SPH) representation and, by this, generates smoother and more (spatially and temporally) coherent results in an efficient way. The underlying predictor-corrector scheme is general enough to be applied to other line-type features and it is extendable to the extraction of surfaces such as isosurfaces or Lagrangian coherent structures. The proposed method exploits temporal coherence to speed up computation for subsequent time steps. We show how the predictor-corrector formulation can be specialized for severalvariants of vortex core line definitions including two recent unsteady extensions, and we contribute a theoretical and practical comparison of these. In particular, we reveal a close relation between unsteady extensions of Fuchs et al. and Weinkauf et al. and we give a proof of the Galilean invariance of the latter.When visualizing SPH data, there is the possibility to use the same interpolation method for visualization as has been used for the simulation. This is different from the case of finite volume simulation results, where it is not possible to recover from the results the spatial interpolation that was used during the simulation. Such data are typically interpolated using the basic trilinear interpolant, and if smoothness is required, some artificial processing is added. In SPH data, however, the smoothing kernels are specified from the simulation, and they provide an exact and smooth interpolation of data or gradients at arbitrary points in the domain.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper we present a method for vortex core line extraction which operates directly on the smoothed particle hydrodynamics (SPH) representation and, by this, generates smoother and more (spatially and temporally) coherent results in an efficient way. The underlying predictor-corrector scheme is general enough to be applied to other line-type features and it is extendable to the extraction of surfaces such as isosurfaces or Lagrangian coherent structures. The proposed method exploits temporal coherence to speed up computation for subsequent time steps. We show how the predictor-corrector formulation can be specialized for severalvariants of vortex core line definitions including two recent unsteady extensions, and we contribute a theoretical and practical comparison of these. In particular, we reveal a close relation between unsteady extensions of Fuchs et al. and Weinkauf et al. and we give a proof of the Galilean invariance of the latter.When visualizing SPH data, there is the possibility to use the same interpolation method for visualization as has been used for the simulation. This is different from the case of finite volume simulation results, where it is not possible to recover from the results the spatial interpolation that was used during the simulation. Such data are typically interpolated using the basic trilinear interpolant, and if smoothness is required, some artificial processing is added. In SPH data, however, the smoothing kernels are specified from the simulation, and they provide an exact and smooth interpolation of data or gradients at arbitrary points in the domain.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper we present a method for vortex core line extraction which operates directly on the smoothed particle hydrodynamics (SPH) representation and, by this, generates smoother and more (spatially and temporally) coherent results in an efficient way. The underlying predictor-corrector scheme is general enough to be applied to other line-type features and it is extendable to the extraction of surfaces such as isosurfaces or Lagrangian coherent structures. The proposed method exploits temporal coherence to speed up computation for subsequent time steps. We show how the predictor-corrector formulation can be specialized for severalvariants of vortex core line definitions including two recent unsteady extensions, and we contribute a theoretical and practical comparison of these. In particular, we reveal a close relation between unsteady extensions of Fuchs et al. and Weinkauf et al. and we give a proof of the Galilean invariance of the latter.When visualizing SPH data, there is the possibility to use the same interpolation method for visualization as has been used for the simulation. This is different from the case of finite volume simulation results, where it is not possible to recover from the results the spatial interpolation that was used during the simulation. Such data are typically interpolated using the basic trilinear interpolant, and if smoothness is required, some artificial processing is added. In SPH data, however, the smoothing kernels are specified from the simulation, and they provide an exact and smooth interpolation of data or gradients at arbitrary points in the domain.",
"title": "Predictor-Corrector Schemes for Visualization ofSmoothed Particle Hydrodynamics Data",
"normalizedTitle": "Predictor-Corrector Schemes for Visualization ofSmoothed Particle Hydrodynamics Data",
"fno": "ttg2009061243",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Smoothed Particle Hydrodynamics",
"Flow Visualization",
"Unsteady Flow",
"Feature Extraction",
"Vortex Core Lines"
],
"authors": [
{
"givenName": "Benjamin",
"surname": "Schindler",
"fullName": "Benjamin Schindler",
"affiliation": "ETH Zurich",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Raphael",
"surname": "Fuchs",
"fullName": "Raphael Fuchs",
"affiliation": "ETH Zurich",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Biddiscombe",
"fullName": "John Biddiscombe",
"affiliation": "CSCS Manno",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ronald",
"surname": "Peikert",
"fullName": "Ronald Peikert",
"affiliation": "ETH Zurich",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2009-11-01 00:00:00",
"pubType": "trans",
"pages": "1243-1250",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2005/2766/0/27660080",
"title": "Extraction of Parallel Vector Surfaces in 3D Time-Dependent Fields and Application to Vortex Core Line Tracking",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660080/12OmNroij9N",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2010/4270/0/4270b212",
"title": "Comparisions of Mirror and Static Boundary Conditions in Incompressible Smoothed Particle Hydrodynamics",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2010/4270b212/12OmNvqEvO1",
"parentPublication": {
"id": "proceedings/iccis/2010/4270/0",
"title": "2010 International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wgec/2009/3899/0/3899a256",
"title": "Parallel Predictor-Corrector Interior-Point Algorithm of Structured Optimization Problems",
"doi": null,
"abstractUrl": "/proceedings-article/wgec/2009/3899a256/12OmNx5GTZZ",
"parentPublication": {
"id": "proceedings/wgec/2009/3899/0",
"title": "Genetic and Evolutionary Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcasia/1997/7901/0/79010419",
"title": "Computational Method for the Prediction of Dynamic Response of Long-Span Bridges due to Unsteady Wind Load",
"doi": null,
"abstractUrl": "/proceedings-article/hpcasia/1997/79010419/12OmNxzMnPS",
"parentPublication": {
"id": "proceedings/hpcasia/1997/7901/0",
"title": "High Performance Computing and Grid in Asia Pacific Region, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/paciia/2008/3490/2/3490c634",
"title": "Smoothed Particle Hydrodynamics for Numerical Simulation of Duct Conveying",
"doi": null,
"abstractUrl": "/proceedings-article/paciia/2008/3490c634/12OmNyQ7FEy",
"parentPublication": {
"id": "paciia/2008/3490/2",
"title": "Pacific-Asia Workshop on Computational Intelligence and Industrial Application, IEEE",
"__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/1995/02/v0151",
"title": "A Predictor-Corrector Technique for Visualizing Unsteady Flow",
"doi": null,
"abstractUrl": "/journal/tg/1995/02/v0151/13rRUwjGoFO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/03/ttg2008030615",
"title": "Parallel Vectors Criteria for Unsteady Flow Vortices",
"doi": null,
"abstractUrl": "/journal/tg/2008/03/ttg2008030615/13rRUxAASSW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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/ccgrid/2019/0912/0/091200a031",
"title": "Detection of Silent Data Corruptions in Smoothed Particle Hydrodynamics Simulations",
"doi": null,
"abstractUrl": "/proceedings-article/ccgrid/2019/091200a031/1bomBR3lgvm",
"parentPublication": {
"id": "proceedings/ccgrid/2019/0912/0",
"title": "2019 19th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009061235",
"articleId": "13rRUxlgxTg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2009061251",
"articleId": "13rRUxAAT0J",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRUq",
"name": "ttg2009061243s.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2009061243s.zip",
"extension": "zip",
"size": "16.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwJPMX5",
"title": "Dec.",
"year": "2011",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILc8f9",
"doi": "10.1109/TVCG.2011.260",
"abstract": "We present the visual analysis of a biologically inspired CFD simulation of the deformable flapping wings of a dragonfly as it takes off and begins to maneuver, using vortex detection and integration-based flow lines. The additional seed placement and perceptual challenges introduced by having multiple dynamically deforming objects in the highly unsteady 3D flow domain are addressed. A brief overview of the high speed photogrammetry setup used to capture the dragonfly takeoff, parametric surfaces used for wing reconstruction, CFD solver and underlying flapping flight theory is presented to clarify the importance of several unsteady flight mechanisms, such as the leading edge vortex, that are captured visually. A novel interactive seed placement method is used to simplify the generation of seed curves that stay in the vicinity of relevant flow phenomena as they move with the flapping wings. This method allows a user to define and evaluate the quality of a seed's trajectory over time while working with a single time step. The seed curves are then used to place particles, streamlines and generalized streak lines. The novel concept of flowing seeds is also introduced in order to add visual context about the instantaneous vector fields surrounding smoothly animate streak lines. Tests show this method to be particularly effective at visually capturing vortices that move quickly or that exist for a very brief period of time. In addition, an automatic camera animation method is used to address occlusion issues caused when animating the immersed wing boundaries alongside many geometric flow lines. Each visualization method is presented at multiple time steps during the up-stroke and down-stroke to highlight the formation, attachment and shedding of the leading edge vortices in pairs of wings. Also, the visualizations show evidence of wake capture at stroke reversal which suggests the existence of previously unknown unsteady lift generation mechanisms that are unique to quad wing insects.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present the visual analysis of a biologically inspired CFD simulation of the deformable flapping wings of a dragonfly as it takes off and begins to maneuver, using vortex detection and integration-based flow lines. The additional seed placement and perceptual challenges introduced by having multiple dynamically deforming objects in the highly unsteady 3D flow domain are addressed. A brief overview of the high speed photogrammetry setup used to capture the dragonfly takeoff, parametric surfaces used for wing reconstruction, CFD solver and underlying flapping flight theory is presented to clarify the importance of several unsteady flight mechanisms, such as the leading edge vortex, that are captured visually. A novel interactive seed placement method is used to simplify the generation of seed curves that stay in the vicinity of relevant flow phenomena as they move with the flapping wings. This method allows a user to define and evaluate the quality of a seed's trajectory over time while working with a single time step. The seed curves are then used to place particles, streamlines and generalized streak lines. The novel concept of flowing seeds is also introduced in order to add visual context about the instantaneous vector fields surrounding smoothly animate streak lines. Tests show this method to be particularly effective at visually capturing vortices that move quickly or that exist for a very brief period of time. In addition, an automatic camera animation method is used to address occlusion issues caused when animating the immersed wing boundaries alongside many geometric flow lines. Each visualization method is presented at multiple time steps during the up-stroke and down-stroke to highlight the formation, attachment and shedding of the leading edge vortices in pairs of wings. Also, the visualizations show evidence of wake capture at stroke reversal which suggests the existence of previously unknown unsteady lift generation mechanisms that are unique to quad wing insects.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present the visual analysis of a biologically inspired CFD simulation of the deformable flapping wings of a dragonfly as it takes off and begins to maneuver, using vortex detection and integration-based flow lines. The additional seed placement and perceptual challenges introduced by having multiple dynamically deforming objects in the highly unsteady 3D flow domain are addressed. A brief overview of the high speed photogrammetry setup used to capture the dragonfly takeoff, parametric surfaces used for wing reconstruction, CFD solver and underlying flapping flight theory is presented to clarify the importance of several unsteady flight mechanisms, such as the leading edge vortex, that are captured visually. A novel interactive seed placement method is used to simplify the generation of seed curves that stay in the vicinity of relevant flow phenomena as they move with the flapping wings. This method allows a user to define and evaluate the quality of a seed's trajectory over time while working with a single time step. The seed curves are then used to place particles, streamlines and generalized streak lines. The novel concept of flowing seeds is also introduced in order to add visual context about the instantaneous vector fields surrounding smoothly animate streak lines. Tests show this method to be particularly effective at visually capturing vortices that move quickly or that exist for a very brief period of time. In addition, an automatic camera animation method is used to address occlusion issues caused when animating the immersed wing boundaries alongside many geometric flow lines. Each visualization method is presented at multiple time steps during the up-stroke and down-stroke to highlight the formation, attachment and shedding of the leading edge vortices in pairs of wings. Also, the visualizations show evidence of wake capture at stroke reversal which suggests the existence of previously unknown unsteady lift generation mechanisms that are unique to quad wing insects.",
"title": "Vortex Visualization in Ultra Low Reynolds Number Insect Flight",
"normalizedTitle": "Vortex Visualization in Ultra Low Reynolds Number Insect Flight",
"fno": "ttg2011122071",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Flow Visualization",
"Flowing Seed Points",
"Streak Lines",
"Streamlines",
"Insect Flight",
"Vortex Visualization",
"Unsteady Flow"
],
"authors": [
{
"givenName": "Christopher",
"surname": "Koehler",
"fullName": "Christopher Koehler",
"affiliation": "Wright State University College of Engineering and Computer Science",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Wischgoll",
"fullName": "Thomas Wischgoll",
"affiliation": "Wright State University College of Engineering and Computer Science",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haibo",
"surname": "Dong",
"fullName": "Haibo Dong",
"affiliation": "Wright State University College of Mechanical and Materials Engineering",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zachary",
"surname": "Gaston",
"fullName": "Zachary Gaston",
"affiliation": "Wright State University College of Mechanical and Materials Engineering",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2011-12-01 00:00:00",
"pubType": "trans",
"pages": "2071-2079",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hpcasia/1997/7901/0/79010744",
"title": "Numerical simulations of wake structure generated by rotating blades using a time marching, free vortex blob method",
"doi": null,
"abstractUrl": "/proceedings-article/hpcasia/1997/79010744/12OmNB9t6rl",
"parentPublication": {
"id": "proceedings/hpcasia/1997/7901/0",
"title": "High Performance Computing and Grid in Asia Pacific Region, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2017/4822/0/07926636",
"title": "Optimal Threshold and LoG Based Feature Identification and Tracking of Bat Flapping Flight",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2017/07926636/12OmNC4eSlk",
"parentPublication": {
"id": "proceedings/wacv/2017/4822/0",
"title": "2017 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcmp-ugc/2009/3946/0/3946a037",
"title": "Control of Boundary-Layer Separation for Lifting Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/hpcmp-ugc/2009/3946a037/12OmNrMZpvB",
"parentPublication": {
"id": "proceedings/hpcmp-ugc/2009/3946/0",
"title": "HPCMP Users Group Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcmp-ugc/2009/3946/0/3946a073",
"title": "Implicit LES Computations with Applications to Micro Air Vehicles",
"doi": null,
"abstractUrl": "/proceedings-article/hpcmp-ugc/2009/3946a073/12OmNwvVrCm",
"parentPublication": {
"id": "proceedings/hpcmp-ugc/2009/3946/0",
"title": "HPCMP Users Group Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/05/v0980",
"title": "Vortex and Strain Skeletons in Eulerian and Lagrangian Frames",
"doi": null,
"abstractUrl": "/journal/tg/2007/05/v0980/13rRUEgs2BM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/03/ttg2008030615",
"title": "Parallel Vectors Criteria for Unsteady Flow Vortices",
"doi": null,
"abstractUrl": "/journal/tg/2008/03/ttg2008030615/13rRUxAASSW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061243",
"title": "Predictor-Corrector Schemes for Visualization ofSmoothed Particle Hydrodynamics Data",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061243/13rRUxZ0o1s",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/06025348",
"title": "Hierarchical Streamline Bundles",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/06025348/13rRUyY28Yt",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011122063",
"articleId": "13rRUy2YLSY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011122080",
"articleId": "13rRUwjGoFV",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet1N",
"name": "ttg2011122071s1.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2011122071s1.mov",
"extension": "mov",
"size": "49.4 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUwInvJi",
"doi": "10.1109/TVCG.2015.2466838",
"abstract": "We propose a method for the vortex extraction and tracking of superconducting magnetic flux vortices for both structured and unstructured mesh data. In the Ginzburg-Landau theory, magnetic flux vortices are well-defined features in a complex-valued order parameter field, and their dynamics determine electromagnetic properties in type-II superconductors. Our method represents each vortex line (a 1D curve embedded in 3D space) as a connected graph extracted from the discretized field in both space and time. For a time-varying discrete dataset, our vortex extraction and tracking method is as accurate as the data discretization. We then apply 3D visualization and 2D event diagrams to the extraction and tracking results to help scientists understand vortex dynamics and macroscale superconductor behavior in greater detail than previously possible.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose a method for the vortex extraction and tracking of superconducting magnetic flux vortices for both structured and unstructured mesh data. In the Ginzburg-Landau theory, magnetic flux vortices are well-defined features in a complex-valued order parameter field, and their dynamics determine electromagnetic properties in type-II superconductors. Our method represents each vortex line (a 1D curve embedded in 3D space) as a connected graph extracted from the discretized field in both space and time. For a time-varying discrete dataset, our vortex extraction and tracking method is as accurate as the data discretization. We then apply 3D visualization and 2D event diagrams to the extraction and tracking results to help scientists understand vortex dynamics and macroscale superconductor behavior in greater detail than previously possible.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose a method for the vortex extraction and tracking of superconducting magnetic flux vortices for both structured and unstructured mesh data. In the Ginzburg-Landau theory, magnetic flux vortices are well-defined features in a complex-valued order parameter field, and their dynamics determine electromagnetic properties in type-II superconductors. Our method represents each vortex line (a 1D curve embedded in 3D space) as a connected graph extracted from the discretized field in both space and time. For a time-varying discrete dataset, our vortex extraction and tracking method is as accurate as the data discretization. We then apply 3D visualization and 2D event diagrams to the extraction and tracking results to help scientists understand vortex dynamics and macroscale superconductor behavior in greater detail than previously possible.",
"title": "Extracting, Tracking, and Visualizing Magnetic Flux Vortices in 3D Complex-Valued Superconductor Simulation Data",
"normalizedTitle": "Extracting, Tracking, and Visualizing Magnetic Flux Vortices in 3D Complex-Valued Superconductor Simulation Data",
"fno": "07192679",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Three Dimensional Displays",
"Data Visualization",
"Superconducting Transmission Lines",
"Feature Extraction",
"Data Mining",
"Superconducting Magnets",
"Magnetic Domains",
"Unstructured Grid",
"Superconductor",
"Vortex Extraction",
"Feature Tracking",
"Unstructured Grid",
"Superconductor",
"Vortex Extraction",
"Feature Tracking"
],
"authors": [
{
"givenName": "Hanqi",
"surname": "Guo",
"fullName": "Hanqi Guo",
"affiliation": "Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Carolyn L.",
"surname": "Phillips",
"fullName": "Carolyn L. Phillips",
"affiliation": "Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tom",
"surname": "Peterka",
"fullName": "Tom Peterka",
"affiliation": "Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dmitry",
"surname": "Karpeyev",
"fullName": "Dmitry Karpeyev",
"affiliation": "Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andreas",
"surname": "Glatz",
"fullName": "Andreas Glatz",
"affiliation": "Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2016-01-01 00:00:00",
"pubType": "trans",
"pages": "827-836",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2017/5738/0/08031581",
"title": "In situ magnetic flux vortex visualization in time-dependent Ginzburg-Landau superconductor simulations",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031581/12OmNAsBFOA",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/shpcc/1994/5680/0/00296713",
"title": "New techniques for parallel simulation of high-temperature superconductors",
"doi": null,
"abstractUrl": "/proceedings-article/shpcc/1994/00296713/12OmNBkP3Ew",
"parentPublication": {
"id": "proceedings/shpcc/1994/5680/0",
"title": "Proceedings of IEEE Scalable High Performance Computing Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccairo/2017/6536/0/6536a160",
"title": "Development of Permanent Magnet Magnetic Field System of Vibroactuatror for Prosthetic Feedback Devices",
"doi": null,
"abstractUrl": "/proceedings-article/iccairo/2017/6536a160/12OmNyNQSGd",
"parentPublication": {
"id": "proceedings/iccairo/2017/6536/0",
"title": "2017 International Conference on Control, Artificial Intelligence, Robotics & Optimization (ICCAIRO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ectc/2017/6315/0/07999762",
"title": "Large Scale Cryogenic Integration Approach for Superconducting High-Performance Computing",
"doi": null,
"abstractUrl": "/proceedings-article/ectc/2017/07999762/12OmNyugz4o",
"parentPublication": {
"id": "proceedings/ectc/2017/6315/0",
"title": "2017 IEEE 67th Electronic Components and Technology Conference (ECTC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1998/02/i0193",
"title": "Extracting 3D Vortices in Turbulent Fluid Flow",
"doi": null,
"abstractUrl": "/journal/tp/1998/02/i0193/13rRUxASuTT",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/04/ttg2011040412",
"title": "Visualizing the Evolution and Interaction of Vortices and Shear Layers in Time-Dependent 3D Flow",
"doi": null,
"abstractUrl": "/journal/tg/2011/04/ttg2011040412/13rRUyYSWsO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/03/08454764",
"title": "Hyper-Objective Vortices",
"doi": null,
"abstractUrl": "/journal/tg/2020/03/08454764/13rRUyeTVia",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/12/09926189",
"title": "JBNN: A Hardware Design for Binarized Neural Networks Using Single-Flux-Quantum Circuits",
"doi": null,
"abstractUrl": "/journal/tc/2022/12/09926189/1HGJpHQU6VW",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2021/8442/0/09910124",
"title": "Symplectic Structure-Preserving Particle-in-Cell Whole-Volume Simulation of Tokamak Plasmas to 111.3 Trillion Particles and 25.7 Billion Grids",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2021/09910124/1HzBzZbsWDS",
"parentPublication": {
"id": "proceedings/sc/2021/8442/0",
"title": "SC21: International Conference for High Performance Computing, Networking, Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/slip/2020/8106/0/09290244",
"title": "Global Interconnects in VLSI Complexity Single Flux Quantum Systems",
"doi": null,
"abstractUrl": "/proceedings-article/slip/2020/09290244/1pQIzAsRcyY",
"parentPublication": {
"id": "proceedings/slip/2020/8106/0",
"title": "2020 ACM/IEEE International Workshop on System Level Interconnect Prediction (SLIP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07192689",
"articleId": "13rRUytF41D",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07192664",
"articleId": "13rRUNvgyWr",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgI7",
"name": "ttg201601-07192679s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201601-07192679s1.zip",
"extension": "zip",
"size": "13.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwJPMX5",
"title": "Dec.",
"year": "2011",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjGoFV",
"doi": "10.1109/TVCG.2011.249",
"abstract": "Acceleration is a fundamental quantity of flow fields that captures Galilean invariant properties of particle motion. Considering the magnitude of this field, minima represent characteristic structures of the flow that can be classified as saddle- or vortex-like. We made the interesting observation that vortex-like minima are enclosed by particularly pronounced ridges. This makes it possible to define boundaries of vortex regions in a parameter-free way. Utilizing scalar field topology, a robust algorithm can be designed to extract such boundaries. They can be arbitrarily shaped. An efficient tracking algorithm allows us to display the temporal evolution of vortices. Various vortex models are used to evaluate the method. We apply our method to two-dimensional model systems from computational fluid dynamics and compare the results to those arising from existing definitions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Acceleration is a fundamental quantity of flow fields that captures Galilean invariant properties of particle motion. Considering the magnitude of this field, minima represent characteristic structures of the flow that can be classified as saddle- or vortex-like. We made the interesting observation that vortex-like minima are enclosed by particularly pronounced ridges. This makes it possible to define boundaries of vortex regions in a parameter-free way. Utilizing scalar field topology, a robust algorithm can be designed to extract such boundaries. They can be arbitrarily shaped. An efficient tracking algorithm allows us to display the temporal evolution of vortices. Various vortex models are used to evaluate the method. We apply our method to two-dimensional model systems from computational fluid dynamics and compare the results to those arising from existing definitions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Acceleration is a fundamental quantity of flow fields that captures Galilean invariant properties of particle motion. Considering the magnitude of this field, minima represent characteristic structures of the flow that can be classified as saddle- or vortex-like. We made the interesting observation that vortex-like minima are enclosed by particularly pronounced ridges. This makes it possible to define boundaries of vortex regions in a parameter-free way. Utilizing scalar field topology, a robust algorithm can be designed to extract such boundaries. They can be arbitrarily shaped. An efficient tracking algorithm allows us to display the temporal evolution of vortices. Various vortex models are used to evaluate the method. We apply our method to two-dimensional model systems from computational fluid dynamics and compare the results to those arising from existing definitions.",
"title": "Two-Dimensional Time-Dependent Vortex Regions Based on the Acceleration Magnitude",
"normalizedTitle": "Two-Dimensional Time-Dependent Vortex Regions Based on the Acceleration Magnitude",
"fno": "ttg2011122080",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Vortex Regions",
"Time Dependent Flow Fields",
"Feature Extraction"
],
"authors": [
{
"givenName": "Jens",
"surname": "Kasten",
"fullName": "Jens Kasten",
"affiliation": "Zuse Institute Berlin",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jan",
"surname": "Reininghaus",
"fullName": "Jan Reininghaus",
"affiliation": "Zuse Institute Berlin",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ingrid",
"surname": "Hotz",
"fullName": "Ingrid Hotz",
"affiliation": "Zuse Institute Berlin",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hans-Christian",
"surname": "Hege",
"fullName": "Hans-Christian Hege",
"affiliation": "Zuse Institute Berlin",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2011-12-01 00:00:00",
"pubType": "trans",
"pages": "2080-2087",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2017/5738/0/08031581",
"title": "In situ magnetic flux vortex visualization in time-dependent Ginzburg-Landau superconductor simulations",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031581/12OmNAsBFOA",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/miar/2001/1113/0/11130222",
"title": "Vortex Segmentation from Cardiac MR 2D Velocity Images Using Region Growing about Vortex Centres",
"doi": null,
"abstractUrl": "/proceedings-article/miar/2001/11130222/12OmNqBbHKc",
"parentPublication": {
"id": "proceedings/miar/2001/1113/0",
"title": "Medical Imaging and Augmented Reality, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660080",
"title": "Extraction of Parallel Vector Surfaces in 3D Time-Dependent Fields and Application to Vortex Core Line Tracking",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660080/12OmNroij9N",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cerma/2011/4563/0/4563a184",
"title": "Vortex Swarm Path Planning Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/cerma/2011/4563a184/12OmNwGIcCh",
"parentPublication": {
"id": "proceedings/cerma/2011/4563/0",
"title": "Electronics, Robotics and Automotive Mechanics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1997/8262/0/82620413",
"title": "Vortex identification-applications in aerodynamics: a case study",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1997/82620413/12OmNxUdv9R",
"parentPublication": {
"id": "proceedings/ieee-vis/1997/8262/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/05/v0980",
"title": "Vortex and Strain Skeletons in Eulerian and Lagrangian Frames",
"doi": null,
"abstractUrl": "/journal/tg/2007/05/v0980/13rRUEgs2BM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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/1995/02/v0151",
"title": "A Predictor-Corrector Technique for Visualizing Unsteady Flow",
"doi": null,
"abstractUrl": "/journal/tg/1995/02/v0151/13rRUwjGoFO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/04/ttg2011040412",
"title": "Visualizing the Evolution and Interaction of Vortices and Shear Layers in Time-Dependent 3D Flow",
"doi": null,
"abstractUrl": "/journal/tg/2011/04/ttg2011040412/13rRUyYSWsO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a261",
"title": "Vortex Boundary Identification using Convolutional Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a261/1qRNPk9QQDe",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011122071",
"articleId": "13rRUILc8f9",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011122088",
"articleId": "13rRUyeTVhX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBCZnUs",
"title": "March",
"year": "2020",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyeTVia",
"doi": "10.1109/TVCG.2018.2868760",
"abstract": "Almost all properties of vector fields, including magnitude, direction, λ<sub>2</sub> and vorticity change under arbitrary movements of the observer. This is undesirable since measurements of physical properties should ideally not depend on the way the (virtual) measurement device moves. There are some properties that are invariant under certain types of reference frame transformations: Galilean invariance (invariance under equal-speed translation) and objectivity (invariance under any smooth rotation and translation of the reference frame). In this paper, we introduce even harder conditions than objectivity: we demand invariance under any smooth similarity transformation (rotation, translation and uniform scale) as well as invariance under any smooth affine transformation of the reference frame. We show that these new hyper-objective measures allow the extraction of vortices that change their volume or deform. Further, we present a generic approach that transforms almost any vortex measure into a hyper-objective one. We apply our methods to vortex extraction in 2D and 3D vector fields, and analyze the numerical robustness, extraction time and the minimization residuals for the Galilean invariant, objective, and the two new hyper-objective approaches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Almost all properties of vector fields, including magnitude, direction, λ<sub>2</sub> and vorticity change under arbitrary movements of the observer. This is undesirable since measurements of physical properties should ideally not depend on the way the (virtual) measurement device moves. There are some properties that are invariant under certain types of reference frame transformations: Galilean invariance (invariance under equal-speed translation) and objectivity (invariance under any smooth rotation and translation of the reference frame). In this paper, we introduce even harder conditions than objectivity: we demand invariance under any smooth similarity transformation (rotation, translation and uniform scale) as well as invariance under any smooth affine transformation of the reference frame. We show that these new hyper-objective measures allow the extraction of vortices that change their volume or deform. Further, we present a generic approach that transforms almost any vortex measure into a hyper-objective one. We apply our methods to vortex extraction in 2D and 3D vector fields, and analyze the numerical robustness, extraction time and the minimization residuals for the Galilean invariant, objective, and the two new hyper-objective approaches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Almost all properties of vector fields, including magnitude, direction, λ2 and vorticity change under arbitrary movements of the observer. This is undesirable since measurements of physical properties should ideally not depend on the way the (virtual) measurement device moves. There are some properties that are invariant under certain types of reference frame transformations: Galilean invariance (invariance under equal-speed translation) and objectivity (invariance under any smooth rotation and translation of the reference frame). In this paper, we introduce even harder conditions than objectivity: we demand invariance under any smooth similarity transformation (rotation, translation and uniform scale) as well as invariance under any smooth affine transformation of the reference frame. We show that these new hyper-objective measures allow the extraction of vortices that change their volume or deform. Further, we present a generic approach that transforms almost any vortex measure into a hyper-objective one. We apply our methods to vortex extraction in 2D and 3D vector fields, and analyze the numerical robustness, extraction time and the minimization residuals for the Galilean invariant, objective, and the two new hyper-objective approaches.",
"title": "Hyper-Objective Vortices",
"normalizedTitle": "Hyper-Objective Vortices",
"fno": "08454764",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Affine Transforms",
"Flow Visualisation",
"Minimisation",
"Vectors",
"Vortices",
"Minimization Residuals",
"2 D Vector Fields",
"3 D Vector Fields",
"Vortex Extraction",
"Vorticity Change",
"Hyper Objective Vortices",
"Hyper Objective Approaches",
"Vector Fields",
"Hyper Objective Measures",
"Smooth Affine Transformation",
"Smooth Similarity Transformation",
"Galilean Invariance",
"Reference Frame Transformations",
"Tensile Stress",
"Two Dimensional Displays",
"Three Dimensional Displays",
"Feature Extraction",
"Sea Measurements",
"Strain",
"Transforms",
"Flow Visualization",
"Vortex Extraction",
"Objectivity",
"Affine Invariance"
],
"authors": [
{
"givenName": "Tobias",
"surname": "Günther",
"fullName": "Tobias Günther",
"affiliation": "Computer Graphics Laboratory, ETH Zürich, Zürich, Switzerland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Holger",
"surname": "Theisel",
"fullName": "Holger Theisel",
"affiliation": "Visual Computing Group, University of Magdeburg, Magdeburg, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2020-03-01 00:00:00",
"pubType": "trans",
"pages": "1532-1547",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icnc/2009/3736/5/3736e495",
"title": "Parameters Identification and IFSHPS in Hyper-Chaotic Systems with Different Structure",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2009/3736e495/12OmNroijlf",
"parentPublication": {
"id": "proceedings/icnc/2009/3736/5",
"title": "2009 Fifth International Conference on Natural Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/navcomp/2013/5123/0/5123a081",
"title": "Utilization of Hyper Environments for Tracking and Monitoring of Processes and Supplies in Construction and Assembly Industries",
"doi": null,
"abstractUrl": "/proceedings-article/navcomp/2013/5123a081/12OmNvlg8mr",
"parentPublication": {
"id": "proceedings/navcomp/2013/5123/0",
"title": "2013 Symposium on Computer and Automation for Offshore Shipbuilding (NAVCOMP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2017/6067/0/08019380",
"title": "Hyper-spectral image reconstruction based on SL0-SL0 minimization",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2017/08019380/12OmNywOWOt",
"parentPublication": {
"id": "proceedings/icme/2017/6067/0",
"title": "2017 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539639",
"title": "Glyphs for General Second-Order 2D and 3D Tensors",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539639/13rRUwwJWFR",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192689",
"title": "Rotation Invariant Vortices for Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192689/13rRUytF41D",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08545827",
"title": "A Game- Theoretic Hyper-Graph Matching Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08545827/17D45WXIkES",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000d935",
"title": "Extreme 3D Face Reconstruction: Seeing Through Occlusions",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000d935/17D45WgziRH",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2019/3131/0/313100a258",
"title": "360° Surface Regression with a Hyper-Sphere Loss",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2019/313100a258/1ezRDMEgU3C",
"parentPublication": {
"id": "proceedings/3dv/2019/3131/0",
"title": "2019 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222512",
"title": "Objective Observer-Relative Flow Visualization in Curved Spaces for Unsteady 2D Geophysical Flows",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222512/1nTq2foekVO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/04/09655471",
"title": "Metric-Driven 3D Frame Field Generation",
"doi": null,
"abstractUrl": "/journal/tg/2023/04/09655471/1zpnFHLrLs4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08481543",
"articleId": "146z4GS1UPK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08468065",
"articleId": "13HFz2XZAUp",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1gZpLdW2HWo",
"name": "ttg202003-08454764s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202003-08454764s1.zip",
"extension": "zip",
"size": "112 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": "1xlvXSp8cco",
"doi": "10.1109/TVCG.2021.3115565",
"abstract": "State-of-the-art computation and visualization of vortices in unsteady fluid flow employ objective vortex criteria, which makes them independent of reference frames or observers. However, objectivity by itself, although crucial, is not sufficient to guarantee that one can identify physically-realizable observers that would perceive or detect the same vortices. Moreover, a significant challenge is that a single reference frame is often not sufficient to accurately observe multiple vortices that follow different motions. This paper presents a novel framework for the exploration and use of an interactively-chosen set of observers, of the resulting relative velocity fields, and of objective vortex structures. We show that our approach facilitates the objective detection and visualization of vortices relative to well-adapted reference frame motions, while at the same time guaranteeing that these observers are in fact physically realizable. In order to represent and manipulate observers efficiently, we make use of the low-dimensional vector space structure of the Lie algebra of physically-realizable observer motions. We illustrate that our framework facilitates the efficient choice and guided exploration of objective vortices in unsteady 2D flow, on planar as well as on spherical domains, using well-adapted reference frames.",
"abstracts": [
{
"abstractType": "Regular",
"content": "State-of-the-art computation and visualization of vortices in unsteady fluid flow employ objective vortex criteria, which makes them independent of reference frames or observers. However, objectivity by itself, although crucial, is not sufficient to guarantee that one can identify physically-realizable observers that would perceive or detect the same vortices. Moreover, a significant challenge is that a single reference frame is often not sufficient to accurately observe multiple vortices that follow different motions. This paper presents a novel framework for the exploration and use of an interactively-chosen set of observers, of the resulting relative velocity fields, and of objective vortex structures. We show that our approach facilitates the objective detection and visualization of vortices relative to well-adapted reference frame motions, while at the same time guaranteeing that these observers are in fact physically realizable. In order to represent and manipulate observers efficiently, we make use of the low-dimensional vector space structure of the Lie algebra of physically-realizable observer motions. We illustrate that our framework facilitates the efficient choice and guided exploration of objective vortices in unsteady 2D flow, on planar as well as on spherical domains, using well-adapted reference frames.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "State-of-the-art computation and visualization of vortices in unsteady fluid flow employ objective vortex criteria, which makes them independent of reference frames or observers. However, objectivity by itself, although crucial, is not sufficient to guarantee that one can identify physically-realizable observers that would perceive or detect the same vortices. Moreover, a significant challenge is that a single reference frame is often not sufficient to accurately observe multiple vortices that follow different motions. This paper presents a novel framework for the exploration and use of an interactively-chosen set of observers, of the resulting relative velocity fields, and of objective vortex structures. We show that our approach facilitates the objective detection and visualization of vortices relative to well-adapted reference frame motions, while at the same time guaranteeing that these observers are in fact physically realizable. In order to represent and manipulate observers efficiently, we make use of the low-dimensional vector space structure of the Lie algebra of physically-realizable observer motions. We illustrate that our framework facilitates the efficient choice and guided exploration of objective vortices in unsteady 2D flow, on planar as well as on spherical domains, using well-adapted reference frames.",
"title": "Interactive Exploration of Physically-Observable Objective Vortices in Unsteady 2D Flow",
"normalizedTitle": "Interactive Exploration of Physically-Observable Objective Vortices in Unsteady 2D Flow",
"fno": "09556604",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"External Flows",
"Flow Simulation",
"Lie Algebras",
"Motion Estimation",
"Object Detection",
"Vectors",
"Vortices",
"Interactive Exploration",
"Physically Observable Objective Vortices",
"Unsteady 2 D Flow",
"Visualization",
"Unsteady Fluid Flow",
"Objective Vortex Criteria",
"Objectivity",
"Physically Realizable Observers",
"Single Reference Frame",
"Multiple Vortices",
"Resulting Relative Velocity Fields",
"Objective Vortex Structures",
"Objective Detection",
"Reference Frame Motions",
"Physically Realizable Observer Motions",
"Well Adapted Reference Frames",
"Observers",
"Visualization",
"Algebra",
"Interpolation",
"Optimization",
"Manifolds",
"Feature Extraction",
"Flow Visualization",
"Vortex Detection",
"Objectivity",
"Observers",
"Reference Frames",
"Lie Algebras"
],
"authors": [
{
"givenName": "Xingdi",
"surname": "Zhang",
"fullName": "Xingdi Zhang",
"affiliation": "King Abdullah University of Science and Technology (KAUST), Visual Computing Center, Thuwal, Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Markus",
"surname": "Hadwiger",
"fullName": "Markus Hadwiger",
"affiliation": "King Abdullah University of Science and Technology (KAUST), Visual Computing Center, Thuwal, Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Theußl",
"fullName": "Thomas Theußl",
"affiliation": "King Abdullah University of Science and Technology (KAUST), Core Labs, Thuwal, Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter",
"surname": "Rautek",
"fullName": "Peter Rautek",
"affiliation": "King Abdullah University of Science and Technology (KAUST), Visual Computing Center, Thuwal, Saudi Arabia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "281-290",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visual/1994/6627/0/00346328",
"title": "3D visualization of unsteady 2D airplane wake vortices",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1994/00346328/12OmNroij7B",
"parentPublication": {
"id": "proceedings/visual/1994/6627/0",
"title": "Proceedings Visualization '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440037",
"title": "Time-Dependent Flow seen through Approximate Observer Killing Fields",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440037/17D45X2fUEW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222512",
"title": "Objective Observer-Relative Flow Visualization in Curved Spaces for Unsteady 2D Geophysical Flows",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222512/1nTq2foekVO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552857",
"articleId": "1xibYEW20Vy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09555911",
"articleId": "1xlvYjicn7i",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zBap0yztWU",
"name": "ttg202201-09556604s1-supp1-3115565.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09556604s1-supp1-3115565.mp4",
"extension": "mp4",
"size": "74.3 MB",
"__typename": "WebExtraType"
},
{
"id": "1zBaoVhzA6A",
"name": "ttg202201-09556604s1-supp2-3115565.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09556604s1-supp2-3115565.pdf",
"extension": "pdf",
"size": "803 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAolH0Q",
"title": "July/August",
"year": "2001",
"issueNum": "04",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "21",
"label": "July/August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASu3c",
"doi": "10.1109/38.933522",
"abstract": "Effective large-scale data visualization remains an important challenge with analysis codes already producing terabyte results on clusters with thousands of processors. Frequently the analysis codes produce distributed data and consume a significant portion of the available memory per node. This article presents an architectural approach to handling these visualization problems based on parallel data streaming to enable visualizations on a parallel cluster. The authors' approach requires less memory than other visualizations while achieving high code reuse.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Effective large-scale data visualization remains an important challenge with analysis codes already producing terabyte results on clusters with thousands of processors. Frequently the analysis codes produce distributed data and consume a significant portion of the available memory per node. This article presents an architectural approach to handling these visualization problems based on parallel data streaming to enable visualizations on a parallel cluster. The authors' approach requires less memory than other visualizations while achieving high code reuse.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Effective large-scale data visualization remains an important challenge with analysis codes already producing terabyte results on clusters with thousands of processors. Frequently the analysis codes produce distributed data and consume a significant portion of the available memory per node. This article presents an architectural approach to handling these visualization problems based on parallel data streaming to enable visualizations on a parallel cluster. The authors' approach requires less memory than other visualizations while achieving high code reuse.",
"title": "Large-Scale Data Visualization Using Parallel Data Streaming",
"normalizedTitle": "Large-Scale Data Visualization Using Parallel Data Streaming",
"fno": "mcg2001040034",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [],
"authors": [
{
"givenName": "James",
"surname": "Ahrens",
"fullName": "James Ahrens",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kristi",
"surname": "Brislawn",
"fullName": "Kristi Brislawn",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ken",
"surname": "Martin",
"fullName": "Ken Martin",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Berk",
"surname": "Geveci",
"fullName": "Berk Geveci",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "C. Charles",
"surname": "Law",
"fullName": "C. Charles Law",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Papka",
"fullName": "Michael Papka",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2001-07-01 00:00:00",
"pubType": "mags",
"pages": "34-41",
"year": "2001",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "mcg2001040024",
"articleId": "13rRUxDqSaR",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2001040042",
"articleId": "13rRUyhaIj1",
"__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": "13rRUxC0SSx",
"doi": "10.1109/MCSE.2010.120",
"abstract": "As exemplified in a state-of-the-art bridge-foundation-ground model simulation, a suite of new visualization techniques let scientists study seismic waves and interactively investigate and explore their data. In so doing, the techniques further scientific understanding and thus facilitate the development of new methods to protect real-world infrastructures against otherwise devastating earthquakes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As exemplified in a state-of-the-art bridge-foundation-ground model simulation, a suite of new visualization techniques let scientists study seismic waves and interactively investigate and explore their data. In so doing, the techniques further scientific understanding and thus facilitate the development of new methods to protect real-world infrastructures against otherwise devastating earthquakes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As exemplified in a state-of-the-art bridge-foundation-ground model simulation, a suite of new visualization techniques let scientists study seismic waves and interactively investigate and explore their data. In so doing, the techniques further scientific understanding and thus facilitate the development of new methods to protect real-world infrastructures against otherwise devastating earthquakes.",
"title": "Visualizing 3D Earthquake Simulation Data",
"normalizedTitle": "Visualizing 3D Earthquake Simulation Data",
"fno": "mcs2011060052",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Computer Visualization",
"Earthquake Simulation",
"Scientific Computing",
"Model Simulation",
"Seismic Wave Visualizations"
],
"authors": [
{
"givenName": "Cheng-Kai",
"surname": "Chen",
"fullName": "Cheng-Kai Chen",
"affiliation": "University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chris",
"surname": "Ho",
"fullName": "Chris Ho",
"affiliation": "University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Carlos",
"surname": "Correa",
"fullName": "Carlos Correa",
"affiliation": "University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kwan-Liu",
"surname": "Ma",
"fullName": "Kwan-Liu Ma",
"affiliation": "University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ahmed",
"surname": "Elgamal",
"fullName": "Ahmed Elgamal",
"affiliation": "University of California, San Diego",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2011-11-01 00:00:00",
"pubType": "mags",
"pages": "52-63",
"year": "2011",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cso/2009/3605/1/3605a258",
"title": "Damage Analysis on a Chinese Ancient Building by Wenchuan Earthquake",
"doi": null,
"abstractUrl": "/proceedings-article/cso/2009/3605a258/12OmNvAAtut",
"parentPublication": {
"id": "cso/2009/3605/1",
"title": "2009 International Joint Conference on Computational Sciences and Optimization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csie/2009/3507/2/3507b389",
"title": "Flash-Based Tool for Earthquake Epicenter Identification",
"doi": null,
"abstractUrl": "/proceedings-article/csie/2009/3507b389/12OmNvlPkw9",
"parentPublication": {
"id": "proceedings/csie/2009/3507/2",
"title": "Computer Science and Information Engineering, World Congress on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciii/2008/3435/3/3435c225",
"title": "Investigation of Seismic Damage to Constructions in Baoji Affected by the 5-12 China's Wenchuan Earthquake",
"doi": null,
"abstractUrl": "/proceedings-article/iciii/2008/3435c225/12OmNxWLTyJ",
"parentPublication": {
"id": "proceedings/iciii/2008/3435/3",
"title": "International Conference on Information Management, Innovation Management and Industrial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2015/7644/0/7644a110",
"title": "Acceleration Response Spectra Considering the Influence of Earthquake",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2015/7644a110/12OmNyS6Rzd",
"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/sc/2003/2113/0/21130048",
"title": "Visualizing Very Large-Scale Earthquake Simulations",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2003/21130048/12OmNzSQdnG",
"parentPublication": {
"id": "proceedings/sc/2003/2113/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2012/05/mcs2012050010",
"title": "Understanding Long-Term Earthquake Behavior through Simulation",
"doi": null,
"abstractUrl": "/magazine/cs/2012/05/mcs2012050010/13rRUwwaKnH",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2011/04/mcs2011040014",
"title": "Large-Scale Earthquake Simulation: Computational Seismology and Complex Engineering Systems",
"doi": null,
"abstractUrl": "/magazine/cs/2011/04/mcs2011040014/13rRUx0xPDO",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2011/04/mcs2011040058",
"title": "OpenSees: A Framework for Earthquake Engineering Simulation",
"doi": null,
"abstractUrl": "/magazine/cs/2011/04/mcs2011040058/13rRUxcKzSf",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2012/05/mcs2012050007",
"title": "Computational Earthquake Science",
"doi": null,
"abstractUrl": "/magazine/cs/2012/05/mcs2012050007/13rRUygBw3c",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbac-pad/2018/7769/0/08645865",
"title": "A Machine Learning Approach for Parameter Screening in Earthquake Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/sbac-pad/2018/08645865/17QjJfrFUVf",
"parentPublication": {
"id": "proceedings/sbac-pad/2018/7769/0",
"title": "2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcs2011060006",
"articleId": "13rRUxOvedE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcs2011060064",
"articleId": "13rRUIJuxsx",
"__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": "13rRUxjQyvb",
"doi": "10.1109/TVCG.2007.70610",
"abstract": "Physics-based flow visualization techniques seek to mimic laboratory flow visualization methods with virtual analogues. In this work we describe the rendering of a virtual rheoscopic fluid to produce images with results strikingly similar to laboratory experiments with real-world rheoscopic fluids using products such as Kalliroscope. These fluid additives consist of microscopic, anisotropic particles which, when suspended in the flow, align with both the flow velocity and the local shear to produce high-quality depictions of complex flow structures. Our virtual rheoscopic fluid is produced by defining a closed-form formula for the orientation of shear layers in the flow and using this orientation to volume render the flow as a material with anisotropic reflectance and transparency. Examples are presented for natural convection, thermocapillary convection, and Taylor-Couette flow simulations. The latter agree well with photographs of experimental results of Taylor-Couette flows from the literature.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Physics-based flow visualization techniques seek to mimic laboratory flow visualization methods with virtual analogues. In this work we describe the rendering of a virtual rheoscopic fluid to produce images with results strikingly similar to laboratory experiments with real-world rheoscopic fluids using products such as Kalliroscope. These fluid additives consist of microscopic, anisotropic particles which, when suspended in the flow, align with both the flow velocity and the local shear to produce high-quality depictions of complex flow structures. Our virtual rheoscopic fluid is produced by defining a closed-form formula for the orientation of shear layers in the flow and using this orientation to volume render the flow as a material with anisotropic reflectance and transparency. Examples are presented for natural convection, thermocapillary convection, and Taylor-Couette flow simulations. The latter agree well with photographs of experimental results of Taylor-Couette flows from the literature.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Physics-based flow visualization techniques seek to mimic laboratory flow visualization methods with virtual analogues. In this work we describe the rendering of a virtual rheoscopic fluid to produce images with results strikingly similar to laboratory experiments with real-world rheoscopic fluids using products such as Kalliroscope. These fluid additives consist of microscopic, anisotropic particles which, when suspended in the flow, align with both the flow velocity and the local shear to produce high-quality depictions of complex flow structures. Our virtual rheoscopic fluid is produced by defining a closed-form formula for the orientation of shear layers in the flow and using this orientation to volume render the flow as a material with anisotropic reflectance and transparency. Examples are presented for natural convection, thermocapillary convection, and Taylor-Couette flow simulations. The latter agree well with photographs of experimental results of Taylor-Couette flows from the literature.",
"title": "Virtual Rheoscopic Fluids for Flow Visualization",
"normalizedTitle": "Virtual Rheoscopic Fluids for Flow Visualization",
"fno": "v1751",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Rendering Computer Graphics",
"Flow Visualisation",
"Mechanical Engineering Computing",
"Taylor Couette Flow Simulations",
"Virtual Rheoscopic Fluids",
"Flow Visualization Techniques",
"Virtual Analogues",
"Virtual Rheoscopic Fluid Rendering",
"Anisotropic Particles",
"Flow Velocity",
"Complex Flow Structures",
"Shear Layers Orientation",
"Natural Convection",
"Thermocapillary Convection",
"Visualization",
"Laboratories",
"Rendering Computer Graphics",
"Additives",
"Microscopy",
"Anisotropic Magnetoresistance",
"Computer Vision",
"Reflectivity",
"Computational Modeling",
"Surface Texture",
"Rheoscopic Fluids",
"Flow Visualization"
],
"authors": [
{
"givenName": "William",
"surname": "Barth",
"fullName": "William Barth",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christopher",
"surname": "Burns",
"fullName": "Christopher Burns",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2007-11-01 00:00:00",
"pubType": "trans",
"pages": "1751-1758",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ldav/2012/4733/0/06378979",
"title": "Virtual rheoscopic fluids for dense, large-scale fluid flow visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2012/06378979/12OmNvAS4pN",
"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/is3c/2012/4655/0/4655a841",
"title": "Multimedia Features for Conjugate Heat Transfer of MHD Mixed Convection with Ohmic Effect for Viscoelastic Fluid Past a Stretching Sheet",
"doi": null,
"abstractUrl": "/proceedings-article/is3c/2012/4655a841/12OmNwCsdJr",
"parentPublication": {
"id": "proceedings/is3c/2012/4655/0",
"title": "Computer, Consumer and Control, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsps/2009/3654/0/3654a879",
"title": "Uncharacteristic Phenomenon in the Nonisothermal Taylor-Couette Flow",
"doi": null,
"abstractUrl": "/proceedings-article/icsps/2009/3654a879/12OmNwMob6a",
"parentPublication": {
"id": "proceedings/icsps/2009/3654/0",
"title": "2009 International Conference on Signal Processing Systems (ICSPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/candar/2013/2796/0/06726955",
"title": "Modeling of Grease Flow Based on Microstructural Interactions by Cellular Automata",
"doi": null,
"abstractUrl": "/proceedings-article/candar/2013/06726955/12OmNx8OuCF",
"parentPublication": {
"id": "proceedings/candar/2013/2796/0",
"title": "2013 First International Symposium on Computing and Networking - Across Practical Development and Theoretical Research (CANDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2014/7502/0/7502a265",
"title": "Computer Simulation of Hot Caloric Test Response in the Three Semicircular Canal",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2014/7502a265/12OmNxw5Bj5",
"parentPublication": {
"id": "proceedings/bibe/2014/7502/0",
"title": "2014 IEEE International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2014/4258/0/4258a065",
"title": "SPH Fluids for Viscous Jet Buckling",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2014/4258a065/12OmNzn38LQ",
"parentPublication": {
"id": "proceedings/sibgrapi/2014/4258/0",
"title": "2014 27th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/01/ttg2010010147",
"title": "Virtual Rheoscopic Fluids",
"doi": null,
"abstractUrl": "/journal/tg/2010/01/ttg2010010147/13rRUwgQpDr",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122198",
"title": "Visualization of Flow Behavior in Earth Mantle Convection",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122198/13rRUwghd4X",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/04/ttg2011040412",
"title": "Visualizing the Evolution and Interaction of Vortices and Shear Layers in Time-Dependent 3D Flow",
"doi": null,
"abstractUrl": "/journal/tg/2011/04/ttg2011040412/13rRUyYSWsO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/memsys/2002/7185/0/00984071",
"title": "Size and shape effects on two-phase flow instabilities in microchannels",
"doi": null,
"abstractUrl": "/proceedings-article/memsys/2002/00984071/1h0QfKntXPO",
"parentPublication": {
"id": "proceedings/memsys/2002/7185/0",
"title": "Technical Digest. MEMS 2002 IEEE International Conference. Fifteenth IEEE International Conference on Micro Electro Mechanical Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1743",
"articleId": "13rRUyoPSP0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1759",
"articleId": "13rRUxly8Xx",
"__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": "13rRUEgarnI",
"doi": "10.1109/TVCG.2012.292",
"abstract": "Scientists, engineers and physicians are used to analyze 3D data with slice-based visualizations. Radiologists for example are trained to read slices of medical imaging data. Despite the numerous examples of sophisticated 3D rendering techniques, domain experts, who still prefer slice-based visualization do not consider these to be very useful. Since 3D renderings have the advantage of providing an overview at a glance, while 2D depictions better serve detailed analyses, it is of general interest to better combine these methods. Recently there have been attempts to bridge this gap between 2D and 3D renderings. These attempts include specialized techniques for volume picking in medical imaging data that result in repositioning slices. In this paper, we present a new volume picking technique called WYSIWYP (“what you see is what you pick”) that, in contrast to previous work, does not require pre-segmented data or metadata and thus is more generally applicable. The positions picked by our method are solely based on the data itself, the transfer function, and the way the volumetric rendering is perceived by the user. To demonstrate the utility of the proposed method, we apply it to automated positioning of slices in volumetric scalar fields from various application areas. Finally, we present results of a user study in which 3D locations selected by users are compared to those resulting from WYSIWYP. The user study confirms our claim that the resulting positions correlate well with those perceived by the user.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Scientists, engineers and physicians are used to analyze 3D data with slice-based visualizations. Radiologists for example are trained to read slices of medical imaging data. Despite the numerous examples of sophisticated 3D rendering techniques, domain experts, who still prefer slice-based visualization do not consider these to be very useful. Since 3D renderings have the advantage of providing an overview at a glance, while 2D depictions better serve detailed analyses, it is of general interest to better combine these methods. Recently there have been attempts to bridge this gap between 2D and 3D renderings. These attempts include specialized techniques for volume picking in medical imaging data that result in repositioning slices. In this paper, we present a new volume picking technique called WYSIWYP (“what you see is what you pick”) that, in contrast to previous work, does not require pre-segmented data or metadata and thus is more generally applicable. The positions picked by our method are solely based on the data itself, the transfer function, and the way the volumetric rendering is perceived by the user. To demonstrate the utility of the proposed method, we apply it to automated positioning of slices in volumetric scalar fields from various application areas. Finally, we present results of a user study in which 3D locations selected by users are compared to those resulting from WYSIWYP. The user study confirms our claim that the resulting positions correlate well with those perceived by the user.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Scientists, engineers and physicians are used to analyze 3D data with slice-based visualizations. Radiologists for example are trained to read slices of medical imaging data. Despite the numerous examples of sophisticated 3D rendering techniques, domain experts, who still prefer slice-based visualization do not consider these to be very useful. Since 3D renderings have the advantage of providing an overview at a glance, while 2D depictions better serve detailed analyses, it is of general interest to better combine these methods. Recently there have been attempts to bridge this gap between 2D and 3D renderings. These attempts include specialized techniques for volume picking in medical imaging data that result in repositioning slices. In this paper, we present a new volume picking technique called WYSIWYP (“what you see is what you pick”) that, in contrast to previous work, does not require pre-segmented data or metadata and thus is more generally applicable. The positions picked by our method are solely based on the data itself, the transfer function, and the way the volumetric rendering is perceived by the user. To demonstrate the utility of the proposed method, we apply it to automated positioning of slices in volumetric scalar fields from various application areas. Finally, we present results of a user study in which 3D locations selected by users are compared to those resulting from WYSIWYP. The user study confirms our claim that the resulting positions correlate well with those perceived by the user.",
"title": "WYSIWYP: What You See Is What You Pick",
"normalizedTitle": "WYSIWYP: What You See Is What You Pick",
"fno": "ttg2012122236",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Rendering Computer Graphics",
"Data Analysis",
"Data Visualisation",
"Medical Image Processing",
"Radiology",
"What You See Is What You Pick",
"3 D Data Analysis",
"Slice Based Visualizations",
"Radiologists",
"Medical Imaging Data",
"3 D Rendering",
"Volume Picking",
"WYSIWYP",
"Rendering Computer Graphics",
"Transfer Functions",
"Equations",
"Image Color Analysis",
"Biomedical Imaging",
"Data Visualization",
"Geometry",
"WYSIWYG",
"Picking",
"Volume Rendering"
],
"authors": [
{
"givenName": "A.",
"surname": "Wiebel",
"fullName": "A. Wiebel",
"affiliation": "Zuse Inst. Berlin (ZIB), Berlin, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "F. M.",
"surname": "Vos",
"fullName": "F. M. Vos",
"affiliation": "Tech. Univ. Delft & AMC Amsterdam, Delft, Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "D.",
"surname": "Foerster",
"fullName": "D. Foerster",
"affiliation": "Zuse Inst. Berlin (ZIB), Berlin, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "H.",
"surname": "Hege",
"fullName": "H. Hege",
"affiliation": "Zuse Inst. Berlin (ZIB), Berlin, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2236-2244",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/1999/5897/0/58970030",
"title": "Mixing Translucent Polygons with Volumes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1999/58970030/12OmNCgrD1Z",
"parentPublication": {
"id": "proceedings/ieee-vis/1999/5897/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl/1998/8712/0/87120096",
"title": "Visual Semantics ? Or: What You See is What You Compute",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1998/87120096/12OmNrYCXTw",
"parentPublication": {
"id": "proceedings/vl/1998/8712/0",
"title": "Visual Languages, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrais/1993/4910/0/00378256",
"title": "What you see is what you hear-Acoustics applied in virtual worlds",
"doi": null,
"abstractUrl": "/proceedings-article/vrais/1993/00378256/12OmNyrqzAY",
"parentPublication": {
"id": "proceedings/vrais/1993/4910/0",
"title": "IEEE 1993 Symposium on Research Frontiers in Virtual Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl/1993/3970/0/00269580",
"title": "A WYSIWYC (what you see is what you compute) spreadsheet",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1993/00269580/12OmNzgeLED",
"parentPublication": {
"id": "proceedings/vl/1993/3970/0",
"title": "Proceedings 1993 IEEE Symposium on Visual Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1994/03/mcg1994030004",
"title": "What You Don't See is What You Get",
"doi": null,
"abstractUrl": "/magazine/cg/1994/03/mcg1994030004/13rRUIJcWqQ",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122106",
"title": "WYSIWYG (What You See is What You Get) Volume Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122106/13rRUxCitJa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mu/2003/03/u3048",
"title": "What You See Is What You Get",
"doi": null,
"abstractUrl": "/magazine/mu/2003/03/u3048/13rRUxDItkr",
"parentPublication": {
"id": "mags/mu",
"title": "IEEE MultiMedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/euros&pw/2019/3026/0/302600a377",
"title": "Is Stellar As Secure As You Think?",
"doi": null,
"abstractUrl": "/proceedings-article/euros&pw/2019/302600a377/1cJ78ymni3m",
"parentPublication": {
"id": "proceedings/euros&pw/2019/3026/0",
"title": "2019 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2020/5697/0/09086206",
"title": "Immersive WYSIWYG (What You See is What You Get) Volume Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2020/09086206/1kuHnwov7cQ",
"parentPublication": {
"id": "proceedings/pacificvis/2020/5697/0",
"title": "2020 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800k0998",
"title": "What You See is What You Get: Exploiting Visibility for 3D Object Detection",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800k0998/1m3orzfcjAc",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012122226",
"articleId": "13rRUypp57D",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122245",
"articleId": "13rRUxASupy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgGL",
"name": "ttg2012122236s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012122236s1.zip",
"extension": "zip",
"size": "14.1 MB",
"__typename": "WebExtraType"
},
{
"id": "17ShDTXFgGK",
"name": "ttg2012122236s1.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012122236s1.pdf",
"extension": "pdf",
"size": "81.3 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzFdtc6",
"title": "November/December",
"year": "2010",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "16",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUB6Sq0w",
"doi": "10.1109/TVCG.2010.156",
"abstract": "Applying certain visualization techniques to datasets described on unstructured grids requires the interpolation of variables of interest at arbitrary locations within the dataset's domain of definition. Typical solutions to the problem of finding the grid element enclosing a given interpolation point make use of a variety of spatial subdivision schemes. However, existing solutions are memory- intensive, do not scale well to large grids, or do not work reliably on grids describing complex geometries. In this paper, we propose a data structure and associated construction algorithm for fast cell location in unstructured grids, and apply it to the interpolation problem. Based on the concept of bounding interval hierarchies, the proposed approach is memory-efficient, fast and numerically robust. We examine the performance characteristics of the proposed approach and compare it to existing approaches using a number of benchmark problems related to vector field visualization. Furthermore, we demonstrate that our approach can successfully accommodate large datasets, and discuss application to visualization on both CPUs and GPUs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Applying certain visualization techniques to datasets described on unstructured grids requires the interpolation of variables of interest at arbitrary locations within the dataset's domain of definition. Typical solutions to the problem of finding the grid element enclosing a given interpolation point make use of a variety of spatial subdivision schemes. However, existing solutions are memory- intensive, do not scale well to large grids, or do not work reliably on grids describing complex geometries. In this paper, we propose a data structure and associated construction algorithm for fast cell location in unstructured grids, and apply it to the interpolation problem. Based on the concept of bounding interval hierarchies, the proposed approach is memory-efficient, fast and numerically robust. We examine the performance characteristics of the proposed approach and compare it to existing approaches using a number of benchmark problems related to vector field visualization. Furthermore, we demonstrate that our approach can successfully accommodate large datasets, and discuss application to visualization on both CPUs and GPUs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Applying certain visualization techniques to datasets described on unstructured grids requires the interpolation of variables of interest at arbitrary locations within the dataset's domain of definition. Typical solutions to the problem of finding the grid element enclosing a given interpolation point make use of a variety of spatial subdivision schemes. However, existing solutions are memory- intensive, do not scale well to large grids, or do not work reliably on grids describing complex geometries. In this paper, we propose a data structure and associated construction algorithm for fast cell location in unstructured grids, and apply it to the interpolation problem. Based on the concept of bounding interval hierarchies, the proposed approach is memory-efficient, fast and numerically robust. We examine the performance characteristics of the proposed approach and compare it to existing approaches using a number of benchmark problems related to vector field visualization. Furthermore, we demonstrate that our approach can successfully accommodate large datasets, and discuss application to visualization on both CPUs and GPUs.",
"title": "Fast, Memory-Efficient Cell Location in Unstructured Grids for Visualization",
"normalizedTitle": "Fast, Memory-Efficient Cell Location in Unstructured Grids for Visualization",
"fno": "ttg2010061541",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Unstructured Grids",
"Cell Location",
"Interpolation",
"Vector Field Visualization"
],
"authors": [
{
"givenName": "Christoph",
"surname": "Garth",
"fullName": "Christoph Garth",
"affiliation": "University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kenneth I.",
"surname": "Joy",
"fullName": "Kenneth I. Joy",
"affiliation": "University of California, Davis",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2010-11-01 00:00:00",
"pubType": "trans",
"pages": "1541-1550",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/1995/7187/0/71870248",
"title": "Vector Plots for Irregular Grids",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1995/71870248/12OmNC2OSMK",
"parentPublication": {
"id": "proceedings/ieee-vis/1995/7187/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660054",
"title": "Marching Diamonds for Unstructured Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660054/12OmNC8dgmy",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1997/8262/0/82620285",
"title": "Extracting feature lines from 3D unstructured grids",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1997/82620285/12OmNCfSqO2",
"parentPublication": {
"id": "proceedings/ieee-vis/1997/8262/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vv/1996/3708/0/37080055",
"title": "Hardware Assisted Volume Rendering of Unstructured Grids by Incremental Slicing",
"doi": null,
"abstractUrl": "/proceedings-article/vv/1996/37080055/12OmNqG0SOT",
"parentPublication": {
"id": "proceedings/vv/1996/3708/0",
"title": "Volume Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1993/4340/0/01263430",
"title": "Automatic partitioning of unstructured grids into connected components",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1993/01263430/12OmNy6HQQI",
"parentPublication": {
"id": "proceedings/sc/1993/4340/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/1997/8028/0/80280206",
"title": "Vortex flow visualization using tetrahedral cell subdivision",
"doi": null,
"abstractUrl": "/proceedings-article/pg/1997/80280206/12OmNyoiZ7K",
"parentPublication": {
"id": "proceedings/pg/1997/8028/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1995/7187/0/71870143",
"title": "Sweeping Simplices: A Fast Iso-Surface Extraction Algorithm for Unstructured Grids",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1995/71870143/12OmNywfKKj",
"parentPublication": {
"id": "proceedings/ieee-vis/1995/7187/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2015/6879/0/07156383",
"title": "Advanced lighting for unstructured-grid data visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156383/12OmNz2C1sz",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0461",
"title": "Projected Tetrahedra Revisited: A Barycentric Formulation Applied to Digital Radiograph Reconstruction Using Higher-Order Attenuation Functions",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0461/13rRUwgQpDh",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122115",
"title": "Interactive Volume Visualization of General Polyhedral Grids",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122115/13rRUxZzAhC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010061533",
"articleId": "13rRUwInvJc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010061551",
"articleId": "13rRUxjyX3V",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgF3",
"name": "ttg2010061541s1.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2010061541s1.mov",
"extension": "mov",
"size": "44.3 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNC36tS6",
"title": "January",
"year": "2007",
"issueNum": "01",
"idPrefix": "td",
"pubType": "journal",
"volume": "18",
"label": "January",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIJcWl5",
"doi": "10.1109/TPDS.2007.11",
"abstract": "Abstract—In this work, image-space-parallel direct volume rendering (DVR) of unstructured grids is investigated for distributed-memory architectures. A hypergraph-partitioning-based model is proposed for the adaptive screen partitioning problem in this context. The proposed model aims to balance the rendering loads of processors while trying to minimize the amount of data replication. In the parallel DVR framework we adopted, each data primitive is statically owned by its home processor, which is responsible from replicating its primitives on other processors. Two appropriate remapping models are proposed by enhancing the above model for use within this framework. These two remapping models aim to minimize the total volume of communication in data replication while balancing the rendering loads of processors. Based on the proposed models, a parallel DVR algorithm is developed. The experiments conducted on a PC cluster show that the proposed remapping models achieve better speedup values compared to the remapping models previously suggested for image-space-parallel DVR.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—In this work, image-space-parallel direct volume rendering (DVR) of unstructured grids is investigated for distributed-memory architectures. A hypergraph-partitioning-based model is proposed for the adaptive screen partitioning problem in this context. The proposed model aims to balance the rendering loads of processors while trying to minimize the amount of data replication. In the parallel DVR framework we adopted, each data primitive is statically owned by its home processor, which is responsible from replicating its primitives on other processors. Two appropriate remapping models are proposed by enhancing the above model for use within this framework. These two remapping models aim to minimize the total volume of communication in data replication while balancing the rendering loads of processors. Based on the proposed models, a parallel DVR algorithm is developed. The experiments conducted on a PC cluster show that the proposed remapping models achieve better speedup values compared to the remapping models previously suggested for image-space-parallel DVR.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—In this work, image-space-parallel direct volume rendering (DVR) of unstructured grids is investigated for distributed-memory architectures. A hypergraph-partitioning-based model is proposed for the adaptive screen partitioning problem in this context. The proposed model aims to balance the rendering loads of processors while trying to minimize the amount of data replication. In the parallel DVR framework we adopted, each data primitive is statically owned by its home processor, which is responsible from replicating its primitives on other processors. Two appropriate remapping models are proposed by enhancing the above model for use within this framework. These two remapping models aim to minimize the total volume of communication in data replication while balancing the rendering loads of processors. Based on the proposed models, a parallel DVR algorithm is developed. The experiments conducted on a PC cluster show that the proposed remapping models achieve better speedup values compared to the remapping models previously suggested for image-space-parallel DVR.",
"title": "Hypergraph-Partitioning-Based Remapping Models for Image-Space-Parallel Direct Volume Rendering of Unstructured Grids",
"normalizedTitle": "Hypergraph-Partitioning-Based Remapping Models for Image-Space-Parallel Direct Volume Rendering of Unstructured Grids",
"fno": "l0003",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Direct Volume Rendering",
"Unstructured Grids",
"Ray Casting",
"Image Space Parallelization",
"Hypergraph Partitioning",
"Screen Partitioning",
"Remapping"
],
"authors": [
{
"givenName": "Berkant Barla",
"surname": "Cambazoglu",
"fullName": "Berkant Barla Cambazoglu",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cevdet",
"surname": "Aykanat",
"fullName": "Cevdet Aykanat",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2007-01-01 00:00:00",
"pubType": "trans",
"pages": "3-16",
"year": "2007",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/frontiers/1995/6965/0/69650367",
"title": "Parallel remapping algorithms for adaptive problems",
"doi": null,
"abstractUrl": "/proceedings-article/frontiers/1995/69650367/12OmNrHSD6O",
"parentPublication": {
"id": "proceedings/frontiers/1995/6965/0",
"title": "Frontiers of Massively Parallel Processing, Symposium on the",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dagstuhl/1997/0503/0/05030137",
"title": "Ray-Based Data Level Comparisons of Direct Volume Rendering Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/dagstuhl/1997/05030137/12OmNzvQHVf",
"parentPublication": {
"id": "proceedings/dagstuhl/1997/0503/0",
"title": "Dagstuhl '97 - Scientific Visualization Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1990/02/t0206",
"title": "Optimal Dynamic Remapping of Data Parallel Computations",
"doi": null,
"abstractUrl": "/journal/tc/1990/02/t0206/13rRUwbs1ZR",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2010/06/05223632",
"title": "Parallel Interleavers Through Optimized Memory Address Remapping",
"doi": null,
"abstractUrl": "/journal/si/2010/06/05223632/13rRUwjXZPR",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2003/01/l0051",
"title": "Optimal Remapping in Dynamic Bulk Synchronous Computations via a Stochastic Control Approach",
"doi": null,
"abstractUrl": "/journal/td/2003/01/l0051/13rRUx0geuM",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2007/01/04020508",
"title": "Hypergraph-Partitioning-Based Remapping Models for Image-Space-Parallel Direct Volume Rendering of Unstructured Grids",
"doi": null,
"abstractUrl": "/journal/td/2007/01/04020508/13rRUygT7eL",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/1999/07/l0673",
"title": "Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication",
"doi": null,
"abstractUrl": "/journal/td/1999/07/l0673/13rRUyuvRwV",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/06/08576679",
"title": "Perceptually Validated Cross-Renderer Analytical BRDF Parameter Remapping",
"doi": null,
"abstractUrl": "/journal/tg/2020/06/08576679/17D45XreC6e",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dagstuhl/1997/0503/0/01423111",
"title": "Ray-Based Data Level Comparisons of Direct Volume Rendering Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/dagstuhl/1997/01423111/1h0N3aF69Lq",
"parentPublication": {
"id": "proceedings/dagstuhl/1997/0503/0",
"title": "Dagstuhl '97 - Scientific Visualization Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09224194",
"title": "Direct Volume Rendering with Nonparametric Models of Uncertainty",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09224194/1nV71j9G3yo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "l0001",
"articleId": "13rRUxAATg8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "l0017",
"articleId": "13rRUxBa5mZ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCau3c0",
"title": "May",
"year": "2004",
"issueNum": "05",
"idPrefix": "tp",
"pubType": "journal",
"volume": "26",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgs2D1",
"doi": "10.1109/TPAMI.2004.1273934",
"abstract": "Abstract—Most computer vision applications require the reliable detection of boundaries. In the presence of outliers, missing data, orientation discontinuities, and occlusion, this problem is particularly challenging. We propose to address it by complementing the tensor voting framework, which was limited to second order properties, with first order representation and voting. First order voting fields and a mechanism to vote for 3D surface and volume boundaries and curve endpoints in 3D are defined. Boundary inference is also useful for a second difficult problem in grouping, namely, automatic scale selection. We propose an algorithm that automatically infers the smallest scale that can preserve the finest details. Our algorithm then proceeds with progressively larger scales to ensure continuity where it has not been achieved. Therefore, the proposed approach does not oversmooth features or delay the handling of boundaries and discontinuities until model misfit occurs. The interaction of smooth features, boundaries, and outliers is accommodated by the unified representation, making possible the perceptual organization of data in curves, surfaces, volumes, and their boundaries simultaneously. We present results on a variety of data sets to show the efficacy of the improved formalism.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Most computer vision applications require the reliable detection of boundaries. In the presence of outliers, missing data, orientation discontinuities, and occlusion, this problem is particularly challenging. We propose to address it by complementing the tensor voting framework, which was limited to second order properties, with first order representation and voting. First order voting fields and a mechanism to vote for 3D surface and volume boundaries and curve endpoints in 3D are defined. Boundary inference is also useful for a second difficult problem in grouping, namely, automatic scale selection. We propose an algorithm that automatically infers the smallest scale that can preserve the finest details. Our algorithm then proceeds with progressively larger scales to ensure continuity where it has not been achieved. Therefore, the proposed approach does not oversmooth features or delay the handling of boundaries and discontinuities until model misfit occurs. The interaction of smooth features, boundaries, and outliers is accommodated by the unified representation, making possible the perceptual organization of data in curves, surfaces, volumes, and their boundaries simultaneously. We present results on a variety of data sets to show the efficacy of the improved formalism.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Most computer vision applications require the reliable detection of boundaries. In the presence of outliers, missing data, orientation discontinuities, and occlusion, this problem is particularly challenging. We propose to address it by complementing the tensor voting framework, which was limited to second order properties, with first order representation and voting. First order voting fields and a mechanism to vote for 3D surface and volume boundaries and curve endpoints in 3D are defined. Boundary inference is also useful for a second difficult problem in grouping, namely, automatic scale selection. We propose an algorithm that automatically infers the smallest scale that can preserve the finest details. Our algorithm then proceeds with progressively larger scales to ensure continuity where it has not been achieved. Therefore, the proposed approach does not oversmooth features or delay the handling of boundaries and discontinuities until model misfit occurs. The interaction of smooth features, boundaries, and outliers is accommodated by the unified representation, making possible the perceptual organization of data in curves, surfaces, volumes, and their boundaries simultaneously. We present results on a variety of data sets to show the efficacy of the improved formalism.",
"title": "First Order Augmentation to Tensor Voting for Boundary Inference and Multiscale Analysis in 3D",
"normalizedTitle": "First Order Augmentation to Tensor Voting for Boundary Inference and Multiscale Analysis in 3D",
"fno": "i0594",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Tensor Voting",
"First Order Voting",
"Boundary Inference",
"Discontinuities",
"Multiscale Analysis",
"3 D Perceptual Organization"
],
"authors": [
{
"givenName": "Wai-Shun",
"surname": "Tong",
"fullName": "Wai-Shun Tong",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chi-Keung",
"surname": "Tang",
"fullName": "Chi-Keung Tang",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Philippos",
"surname": "Mordohai",
"fullName": "Philippos Mordohai",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "G?rard",
"surname": "Medioni",
"fullName": "G?rard Medioni",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2004-05-01 00:00:00",
"pubType": "trans",
"pages": "594-611",
"year": "2004",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0582",
"articleId": "13rRUwInvgi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0612",
"articleId": "13rRUxOveaU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAoDigY",
"title": "December",
"year": "1995",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "1",
"label": "December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILLkvd",
"doi": "10.1109/2945.485616",
"abstract": "Abstract—A scalar volume V={(x, f(x)) | x ∈R}; is described by a function f(x) defined over some region R of the 3D space. In this paper, we present a simple technique for rendering multiscale interval sets of the form Z_${\\cal I}_{\\mbi s}$_Z(a, b) = {(x, fs(x)) |a≤gs(x) ≤b}, where a and b are either real numbers or infinities, and fs(x) is a smoothed version of f(x). At each scale s, the constraint a≤gs (x) ≤b identifies a subvolume in which the most significant variations of V are found. We use dyadic wavelet transform to construct gs(x) from f(x) and derive subvolumes with the following attractive properties: 1) the information contained in the subvolumes are sufficient for reconstructing the entire V, and 2) the shapes of the subvolumes provide a hierarchical description of the geometric structures of V. Numerically, the reconstruction in 1) is only an approximation, but it is visually accurate as errors reside at fine scales where our visual sensitivity is not so acute. We triangulate interval sets as α-shapes, which can be efficiently rendered as semi-transparent clouds. Because interval sets are extracted in the object space, their visual display can respond to changes of the view point or transfer function quite fast. The result is a volume rendering technique that provides faster, more effective user interaction with practically no loss of information from the original data. The hierarchical nature of multiscale interval sets also makes it easier to understand the usual complicated structures in scalar volumes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—A scalar volume V={(x, f(x)) | x ∈R}; is described by a function f(x) defined over some region R of the 3D space. In this paper, we present a simple technique for rendering multiscale interval sets of the form ${\\cal I}_{\\mbi s}$(a, b) = {(x, fs(x)) |a≤gs(x) ≤b}, where a and b are either real numbers or infinities, and fs(x) is a smoothed version of f(x). At each scale s, the constraint a≤gs (x) ≤b identifies a subvolume in which the most significant variations of V are found. We use dyadic wavelet transform to construct gs(x) from f(x) and derive subvolumes with the following attractive properties: 1) the information contained in the subvolumes are sufficient for reconstructing the entire V, and 2) the shapes of the subvolumes provide a hierarchical description of the geometric structures of V. Numerically, the reconstruction in 1) is only an approximation, but it is visually accurate as errors reside at fine scales where our visual sensitivity is not so acute. We triangulate interval sets as α-shapes, which can be efficiently rendered as semi-transparent clouds. Because interval sets are extracted in the object space, their visual display can respond to changes of the view point or transfer function quite fast. The result is a volume rendering technique that provides faster, more effective user interaction with practically no loss of information from the original data. The hierarchical nature of multiscale interval sets also makes it easier to understand the usual complicated structures in scalar volumes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—A scalar volume V={(x, f(x)) | x ∈R}; is described by a function f(x) defined over some region R of the 3D space. In this paper, we present a simple technique for rendering multiscale interval sets of the form -(a, b) = {(x, fs(x)) |a≤gs(x) ≤b}, where a and b are either real numbers or infinities, and fs(x) is a smoothed version of f(x). At each scale s, the constraint a≤gs (x) ≤b identifies a subvolume in which the most significant variations of V are found. We use dyadic wavelet transform to construct gs(x) from f(x) and derive subvolumes with the following attractive properties: 1) the information contained in the subvolumes are sufficient for reconstructing the entire V, and 2) the shapes of the subvolumes provide a hierarchical description of the geometric structures of V. Numerically, the reconstruction in 1) is only an approximation, but it is visually accurate as errors reside at fine scales where our visual sensitivity is not so acute. We triangulate interval sets as α-shapes, which can be efficiently rendered as semi-transparent clouds. Because interval sets are extracted in the object space, their visual display can respond to changes of the view point or transfer function quite fast. The result is a volume rendering technique that provides faster, more effective user interaction with practically no loss of information from the original data. The hierarchical nature of multiscale interval sets also makes it easier to understand the usual complicated structures in scalar volumes.",
"title": "A Multiscale Model for Structure-Based Volume Rendering",
"normalizedTitle": "A Multiscale Model for Structure-Based Volume Rendering",
"fno": "v0291",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Scalar Volume Rendering",
"Interactive Techniques",
"Multiresolution Representation",
"Data Compression",
"Visibility Sorting",
"Α Shapes",
"Wavelet Transforms"
],
"authors": [
{
"givenName": "Baining",
"surname": "Guo",
"fullName": "Baining Guo",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "1995-10-01 00:00:00",
"pubType": "trans",
"pages": "291-301",
"year": "1995",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0289",
"articleId": "13rRUwbs20J",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0302",
"articleId": "13rRUwbs1So",
"__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": "13rRUwI5U2B",
"doi": "10.1109/TVCG.2009.184",
"abstract": "We demonstrate the application of advanced 3D visualization techniques to determine the optimal implant design and position in hip joint replacement planning. Our methods take as input the physiological stress distribution inside a patient's bone under load and the stress distribution inside this bone under the same load after a simulated replacement surgery. The visualization aims at showing principal stress directions and magnitudes, as well as differences in both distributions. By visualizing changes of normal and shear stresses with respect to the principal stress directions of the physiological state, a comparative analysis of the physiological stress distribution and the stress distribution with implant is provided, and the implant parameters that most closely replicate the physiological stress state in order to avoid stress shielding can be determined. Our method combines volume rendering for the visualization of stress magnitudes with the tracing of short line segments for the visualization of stress directions. To improve depth perception, transparent, shaded, and antialiased lines are rendered in correct visibility order, and they are attenuated by the volume rendering. We use a focus+context approach to visually guide the user to relevant regions in the data, and to support a detailed stress analysis in these regions while preserving spatial context information. Since all of our techniques have been realized on the GPU, they can immediately react to changes in the simulated stress tensor field and thus provide an effective means for optimal implant selection and positioning in a computational steering environment.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We demonstrate the application of advanced 3D visualization techniques to determine the optimal implant design and position in hip joint replacement planning. Our methods take as input the physiological stress distribution inside a patient's bone under load and the stress distribution inside this bone under the same load after a simulated replacement surgery. The visualization aims at showing principal stress directions and magnitudes, as well as differences in both distributions. By visualizing changes of normal and shear stresses with respect to the principal stress directions of the physiological state, a comparative analysis of the physiological stress distribution and the stress distribution with implant is provided, and the implant parameters that most closely replicate the physiological stress state in order to avoid stress shielding can be determined. Our method combines volume rendering for the visualization of stress magnitudes with the tracing of short line segments for the visualization of stress directions. To improve depth perception, transparent, shaded, and antialiased lines are rendered in correct visibility order, and they are attenuated by the volume rendering. We use a focus+context approach to visually guide the user to relevant regions in the data, and to support a detailed stress analysis in these regions while preserving spatial context information. Since all of our techniques have been realized on the GPU, they can immediately react to changes in the simulated stress tensor field and thus provide an effective means for optimal implant selection and positioning in a computational steering environment.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We demonstrate the application of advanced 3D visualization techniques to determine the optimal implant design and position in hip joint replacement planning. Our methods take as input the physiological stress distribution inside a patient's bone under load and the stress distribution inside this bone under the same load after a simulated replacement surgery. The visualization aims at showing principal stress directions and magnitudes, as well as differences in both distributions. By visualizing changes of normal and shear stresses with respect to the principal stress directions of the physiological state, a comparative analysis of the physiological stress distribution and the stress distribution with implant is provided, and the implant parameters that most closely replicate the physiological stress state in order to avoid stress shielding can be determined. Our method combines volume rendering for the visualization of stress magnitudes with the tracing of short line segments for the visualization of stress directions. To improve depth perception, transparent, shaded, and antialiased lines are rendered in correct visibility order, and they are attenuated by the volume rendering. We use a focus+context approach to visually guide the user to relevant regions in the data, and to support a detailed stress analysis in these regions while preserving spatial context information. Since all of our techniques have been realized on the GPU, they can immediately react to changes in the simulated stress tensor field and thus provide an effective means for optimal implant selection and positioning in a computational steering environment.",
"title": "Stress Tensor Field Visualization for Implant Planning in Orthopedics",
"normalizedTitle": "Stress Tensor Field Visualization for Implant Planning in Orthopedics",
"fno": "ttg2009061399",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Stress Tensor Fields",
"Biomedical Visualization",
"Comparative Visualization",
"Implant Planning",
"GPU Techniques"
],
"authors": [
{
"givenName": "Christian",
"surname": "Dick",
"fullName": "Christian Dick",
"affiliation": "Technische Universität München",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Joachim",
"surname": "Georgii",
"fullName": "Joachim Georgii",
"affiliation": "Technische Universität München",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rainer",
"surname": "Burgkart",
"fullName": "Rainer Burgkart",
"affiliation": "Technische Universität München",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rüdiger",
"surname": "Westermann",
"fullName": "Rüdiger Westermann",
"affiliation": "Technische Universität München",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2009-11-01 00:00:00",
"pubType": "trans",
"pages": "1399-1406",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2005/2766/0/27660002",
"title": "Exploring 2D Tensor Fields Using Stress Nets",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660002/12OmNBCZnRL",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bsn/2012/4698/0/4698a001",
"title": "Transcutaneous Energy Transfer System Incorporating a Datalink for a Wearable Autonomous Implant",
"doi": null,
"abstractUrl": "/proceedings-article/bsn/2012/4698a001/12OmNqGA5eu",
"parentPublication": {
"id": "proceedings/bsn/2012/4698/0",
"title": "Wearable and Implantable Body Sensor Networks, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scivis/2015/9785/0/07429491",
"title": "Feature-based tensor field visualization for fiber reinforced polymers",
"doi": null,
"abstractUrl": "/proceedings-article/scivis/2015/07429491/12OmNxuXcAB",
"parentPublication": {
"id": "proceedings/scivis/2015/9785/0",
"title": "2015 IEEE Scientific Visualization Conference (SciVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880123",
"title": "Physically Based Methods for Tensor Field Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880123/12OmNzTppFk",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660010",
"title": "The Application of GPU Particle Tracing to Diffusion Tensor Field Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660010/12OmNzmclCU",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bmei/2008/3118/1/3118a478",
"title": "A New Speech Coding for Improving the Quality of Cochlear Implant",
"doi": null,
"abstractUrl": "/proceedings-article/bmei/2008/3118a478/12OmNzw8j7D",
"parentPublication": {
"id": "proceedings/bmei/2008/3118/1",
"title": "2008 International Conference on Biomedical Engineering and Informatics (BMEI 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011121979",
"title": "Asymmetric Tensor Field Visualization for Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011121979/13rRUygT7fa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122173",
"title": "Distance Visualization for Interactive 3D Implant Planning",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122173/13rRUyoPSP3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/07/08967163",
"title": "Visualization of 3D Stress Tensor Fields Using Superquadric Glyphs on Displacement Streamlines",
"doi": null,
"abstractUrl": "/journal/tg/2021/07/08967163/1gPjyn904OA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icedme/2020/8145/0/09122190",
"title": "Effect of internal and external porous structure design on stress distribution of implant bridge: A Finite element analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icedme/2020/09122190/1kRSAvopeJa",
"parentPublication": {
"id": "proceedings/icedme/2020/8145/0",
"title": "2020 3rd International Conference on Electron Device and Mechanical Engineering (ICEDME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009061391",
"articleId": "13rRUwInvsI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2009061407",
"articleId": "13rRUIJcWlj",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgCH",
"name": "ttg2009061399s.avi",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2009061399s.avi",
"extension": "avi",
"size": "50.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzV70rJ",
"title": "July-September",
"year": "2002",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "8",
"label": "July-September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUB7a1fG",
"doi": "10.1109/TVCG.2002.1021579",
"abstract": "Most direct volume renderings produced today employ one-dimensional transfer functions which assign color and opacity to the volume based solely on the single scalar quantity which comprises the data set. Though they have not received widespread attention, multidimensional transfer functions are a very effective way to extract materials and their boundaries for both scalar and multivariate data. However, identifying good transfer functions is difficult enough in one dimension, let alone two or three dimensions. This paper demonstrates an important class of three-dimensional transfer functions for scalar data, and describes the application of multidimensional transfer functions to multivariate data. We present a set of direct manipulation widgets that make specifying such transfer functions intuitive and convenient. We also describe how to use modern graphics hardware to both interactively render with multidimensional transfer functions and to provide interactive shadows for volumes. The transfer functions, widgets, and hardware combine to form a powerful system for interactive volume exploration.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Most direct volume renderings produced today employ one-dimensional transfer functions which assign color and opacity to the volume based solely on the single scalar quantity which comprises the data set. Though they have not received widespread attention, multidimensional transfer functions are a very effective way to extract materials and their boundaries for both scalar and multivariate data. However, identifying good transfer functions is difficult enough in one dimension, let alone two or three dimensions. This paper demonstrates an important class of three-dimensional transfer functions for scalar data, and describes the application of multidimensional transfer functions to multivariate data. We present a set of direct manipulation widgets that make specifying such transfer functions intuitive and convenient. We also describe how to use modern graphics hardware to both interactively render with multidimensional transfer functions and to provide interactive shadows for volumes. The transfer functions, widgets, and hardware combine to form a powerful system for interactive volume exploration.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Most direct volume renderings produced today employ one-dimensional transfer functions which assign color and opacity to the volume based solely on the single scalar quantity which comprises the data set. Though they have not received widespread attention, multidimensional transfer functions are a very effective way to extract materials and their boundaries for both scalar and multivariate data. However, identifying good transfer functions is difficult enough in one dimension, let alone two or three dimensions. This paper demonstrates an important class of three-dimensional transfer functions for scalar data, and describes the application of multidimensional transfer functions to multivariate data. We present a set of direct manipulation widgets that make specifying such transfer functions intuitive and convenient. We also describe how to use modern graphics hardware to both interactively render with multidimensional transfer functions and to provide interactive shadows for volumes. The transfer functions, widgets, and hardware combine to form a powerful system for interactive volume exploration.",
"title": "Multidimensional Transfer Functions for Interactive Volume Rendering",
"normalizedTitle": "Multidimensional Transfer Functions for Interactive Volume Rendering",
"fno": "v0270",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Volume Visualization",
"Direct Volume Rendering",
"Multidimensional Transfer Functions",
"Direct Manipulation Widgets",
"Graphics Hardware"
],
"authors": [
{
"givenName": "Joe",
"surname": "Kniss",
"fullName": "Joe Kniss",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gordon",
"surname": "Kindlmann",
"fullName": "Gordon Kindlmann",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Charles",
"surname": "Hansen",
"fullName": "Charles Hansen",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2002-07-01 00:00:00",
"pubType": "trans",
"pages": "270-285",
"year": "2002",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0255",
"articleId": "13rRUyuegh1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0286",
"articleId": "13rRUxC0SE8",
"__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": "13rRUygBw79",
"doi": "10.1109/TVCG.2013.189",
"abstract": "Cardiovascular diseases (CVD) are the leading cause of death worldwide. Their initiation and evolution depends strongly on the blood flow characteristics. In recent years, advances in 4D PC-MRI acquisition enable reliable and time-resolved 3D flow measuring, which allows a qualitative and quantitative analysis of the patient-specific hemodynamics. Currently, medical researchers investigate the relation between characteristic flow patterns like vortices and different pathologies. The manual extraction and evaluation is tedious and requires expert knowledge. Standardized, (semi-)automatic and reliable techniques are necessary to make the analysis of 4D PC-MRI applicable for the clinical routine. In this work, we present an approach for the extraction of vortex flow in the aorta and pulmonary artery incorporating line predicates. We provide an extensive comparison of existent vortex extraction methods to determine the most suitable vortex criterion for cardiac blood flow and apply our approach to ten datasets with different pathologies like coarctations, Tetralogy of Fallot and aneurysms. For two cases we provide a detailed discussion how our results are capable to complement existent diagnosis information. To ensure real-time feedback for the domain experts we implement our method completely on the GPU.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Cardiovascular diseases (CVD) are the leading cause of death worldwide. Their initiation and evolution depends strongly on the blood flow characteristics. In recent years, advances in 4D PC-MRI acquisition enable reliable and time-resolved 3D flow measuring, which allows a qualitative and quantitative analysis of the patient-specific hemodynamics. Currently, medical researchers investigate the relation between characteristic flow patterns like vortices and different pathologies. The manual extraction and evaluation is tedious and requires expert knowledge. Standardized, (semi-)automatic and reliable techniques are necessary to make the analysis of 4D PC-MRI applicable for the clinical routine. In this work, we present an approach for the extraction of vortex flow in the aorta and pulmonary artery incorporating line predicates. We provide an extensive comparison of existent vortex extraction methods to determine the most suitable vortex criterion for cardiac blood flow and apply our approach to ten datasets with different pathologies like coarctations, Tetralogy of Fallot and aneurysms. For two cases we provide a detailed discussion how our results are capable to complement existent diagnosis information. To ensure real-time feedback for the domain experts we implement our method completely on the GPU.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Cardiovascular diseases (CVD) are the leading cause of death worldwide. Their initiation and evolution depends strongly on the blood flow characteristics. In recent years, advances in 4D PC-MRI acquisition enable reliable and time-resolved 3D flow measuring, which allows a qualitative and quantitative analysis of the patient-specific hemodynamics. Currently, medical researchers investigate the relation between characteristic flow patterns like vortices and different pathologies. The manual extraction and evaluation is tedious and requires expert knowledge. Standardized, (semi-)automatic and reliable techniques are necessary to make the analysis of 4D PC-MRI applicable for the clinical routine. In this work, we present an approach for the extraction of vortex flow in the aorta and pulmonary artery incorporating line predicates. We provide an extensive comparison of existent vortex extraction methods to determine the most suitable vortex criterion for cardiac blood flow and apply our approach to ten datasets with different pathologies like coarctations, Tetralogy of Fallot and aneurysms. For two cases we provide a detailed discussion how our results are capable to complement existent diagnosis information. To ensure real-time feedback for the domain experts we implement our method completely on the GPU.",
"title": "Semi-Automatic Vortex Extraction in 4D PC-MRI Cardiac Blood Flow Data using Line Predicates",
"normalizedTitle": "Semi-Automatic Vortex Extraction in 4D PC-MRI Cardiac Blood Flow Data using Line Predicates",
"fno": "ttg2013122773",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Mining",
"Heart",
"Pathology",
"Arteries",
"Cardiovascular System",
"Biomedical Monitoring",
"Smoothing Methods",
"Blood Flow",
"Line Predicates",
"Data Mining",
"Heart",
"Pathology",
"Arteries",
"Cardiovascular System",
"Biomedical Monitoring",
"Smoothing Methods",
"Blood Flow",
"Vortex Extraction",
"4 D PC MRI",
"Cardiac Blood Flow",
"Hemodynamics"
],
"authors": [
{
"givenName": "Benjamin",
"surname": "Kohler",
"fullName": "Benjamin Kohler",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rocco",
"surname": "Gasteiger",
"fullName": "Rocco Gasteiger",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Uta",
"surname": "Preim",
"fullName": "Uta Preim",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Holger",
"surname": "Theisel",
"fullName": "Holger Theisel",
"affiliation": "Dept. of Simulation & Graphics, Univ. of Magdeburg, Magdeburg, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matthias",
"surname": "Gutberlet",
"fullName": "Matthias Gutberlet",
"affiliation": "Dept. of diagnostic & interventional Radiol., Herzzentrum in Leipzig, Leipzig, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bernhard",
"surname": "Preim",
"fullName": "Bernhard Preim",
"affiliation": "Dept. of Simulation & Graphics, Univ. of Magdeburg, Magdeburg, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2013-12-01 00:00:00",
"pubType": "trans",
"pages": "2773-2782",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/miar/2001/1113/0/11130222",
"title": "Vortex Segmentation from Cardiac MR 2D Velocity Images Using Region Growing about Vortex Centres",
"doi": null,
"abstractUrl": "/proceedings-article/miar/2001/11130222/12OmNqBbHKc",
"parentPublication": {
"id": "proceedings/miar/2001/1113/0",
"title": "Medical Imaging and Augmented Reality, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2012/0863/0/06183580",
"title": "Visual 4D MRI blood flow analysis with line predicates",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2012/06183580/12OmNqBtiQs",
"parentPublication": {
"id": "proceedings/pacificvis/2012/0863/0",
"title": "Visualization Symposium, IEEE Pacific",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660080",
"title": "Extraction of Parallel Vector Surfaces in 3D Time-Dependent Fields and Application to Vortex Core Line Tracking",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660080/12OmNroij9N",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse/2014/7981/0/7981a113",
"title": "Parallel Optical Flow Processing of 4D Cardiac CT Data on Multicore Clusters",
"doi": null,
"abstractUrl": "/proceedings-article/cse/2014/7981a113/12OmNyNzhyu",
"parentPublication": {
"id": "proceedings/cse/2014/7981/0",
"title": "2014 IEEE 17th International Conference on Computational Science and Engineering (CSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2013/4797/0/06596137",
"title": "Illustrative visualization of cardiac and aortic blood flow from 4D MRI data",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2013/06596137/12OmNzC5SHi",
"parentPublication": {
"id": "proceedings/pacificvis/2013/4797/0",
"title": "2013 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532851",
"title": "Extraction of parallel vector surfaces in 3D time-dependent fields and application to vortex core line tracking",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532851/12OmNzcPAD3",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/06/ttg2013060900",
"title": "Visual Analysis of Cardiac 4D MRI Blood Flow Using Line Predicates",
"doi": null,
"abstractUrl": "/journal/tg/2013/06/ttg2013060900/13rRUxAAST9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192711",
"title": "Cluster Analysis of Vortical Flow in Simulations of Cerebral Aneurysm Hemodynamics",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192711/13rRUxASuhC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061339",
"title": "Exploration of 4D MRI Blood Flow using Stylistic Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061339/13rRUxBJhvq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/03/09645173",
"title": "<italic>GUCCI</italic> - Guided Cardiac Cohort Investigation of Blood Flow Data",
"doi": null,
"abstractUrl": "/journal/tg/2023/03/09645173/1zc6CvdsNMc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013122763",
"articleId": "13rRUxNW1Zp",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013122783",
"articleId": "13rRUx0gev8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRXR",
"name": "ttg2013122773s.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013122773s.zip",
"extension": "zip",
"size": "39.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid73",
"title": "May",
"year": "1995",
"issueNum": "05",
"idPrefix": "tc",
"pubType": "journal",
"volume": "44",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILLkuB",
"doi": "10.1109/12.381958",
"abstract": "Abstract—We extend a 2D linear skewed memory organization to 3D and introduce the associated de-skewing scheme designed to provide conflict-free access to projection rays of voxels for use in a volume rendering architecture. This is an application of a 3D linear skewing scheme which supports real-time axonometric projection from 26 primary orientations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—We extend a 2D linear skewed memory organization to 3D and introduce the associated de-skewing scheme designed to provide conflict-free access to projection rays of voxels for use in a volume rendering architecture. This is an application of a 3D linear skewing scheme which supports real-time axonometric projection from 26 primary orientations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—We extend a 2D linear skewed memory organization to 3D and introduce the associated de-skewing scheme designed to provide conflict-free access to projection rays of voxels for use in a volume rendering architecture. This is an application of a 3D linear skewing scheme which supports real-time axonometric projection from 26 primary orientations.",
"title": "A 3D Skewing and De-skewing Scheme for Conflict-Free Access to Rays in Volume Rendering",
"normalizedTitle": "A 3D Skewing and De-skewing Scheme for Conflict-Free Access to Rays in Volume Rendering",
"fno": "t0707",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Skewing Scheme",
"Latin Square",
"Volume Rendering",
"Ray Casting",
"Volume Visualization",
"Voxel",
"Parallel Architecture"
],
"authors": [
{
"givenName": "Arie",
"surname": "Kaufman",
"fullName": "Arie Kaufman",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Cohen-Or",
"fullName": "Daniel Cohen-Or",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "1995-05-01 00:00:00",
"pubType": "trans",
"pages": "707-710",
"year": "1995",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "t0702",
"articleId": "13rRUyoPSOi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "t0710",
"articleId": "13rRUIIVlbD",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAgY7ps",
"title": "Sept.-Oct.",
"year": "2011",
"issueNum": "05",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "31",
"label": "Sept.-Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUzp02il",
"doi": "10.1109/MCG.2011.70",
"abstract": "The winner of the 2010 IEEE Visualization Contest was a system that combines traditional and novel visualization techniques to help neurosurgeons plan brain tumor resections. A set of multimodal 2D and 3D views conveys the relation between the lesion and the various structures at risk and depicts data uncertainty. To facilitate efficient interaction while providing a comprehensible visualization, the system links all views. It also lets surgeons both define access paths by clicking in the 3D views and perform 2D and 3D distance measurements. The Web extra is a video demonstrating an interactive system for planning brain tumor resections.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The winner of the 2010 IEEE Visualization Contest was a system that combines traditional and novel visualization techniques to help neurosurgeons plan brain tumor resections. A set of multimodal 2D and 3D views conveys the relation between the lesion and the various structures at risk and depicts data uncertainty. To facilitate efficient interaction while providing a comprehensible visualization, the system links all views. It also lets surgeons both define access paths by clicking in the 3D views and perform 2D and 3D distance measurements. The Web extra is a video demonstrating an interactive system for planning brain tumor resections.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The winner of the 2010 IEEE Visualization Contest was a system that combines traditional and novel visualization techniques to help neurosurgeons plan brain tumor resections. A set of multimodal 2D and 3D views conveys the relation between the lesion and the various structures at risk and depicts data uncertainty. To facilitate efficient interaction while providing a comprehensible visualization, the system links all views. It also lets surgeons both define access paths by clicking in the 3D views and perform 2D and 3D distance measurements. The Web extra is a video demonstrating an interactive system for planning brain tumor resections.",
"title": "2010 IEEE Visualization Contest Winner: Interactive Planning for Brain Tumor Resections",
"normalizedTitle": "2010 IEEE Visualization Contest Winner: Interactive Planning for Brain Tumor Resections",
"fno": "mcg2011050006",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"IEEE Visualization Contest",
"Medical Visualization",
"Functional Magnetic Resonance Imaging",
"F MRI",
"Computed Tomography",
"CT",
"Diffusion Tensor Imaging",
"DTI",
"Brain Tumor Resections",
"Computer Graphics",
"Graphics And Multimedia"
],
"authors": [
{
"givenName": "Stefan",
"surname": "Diepenbrock",
"fullName": "Stefan Diepenbrock",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jörg-Stefan",
"surname": "Praßni",
"fullName": "Jörg-Stefan Praßni",
"affiliation": "University of Münster",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Florian",
"surname": "Lindemann",
"fullName": "Florian Lindemann",
"affiliation": "University of Münster",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hans-Werner",
"surname": "Bothe",
"fullName": "Hans-Werner Bothe",
"affiliation": "University Hospital Münster",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Timo",
"surname": "Ropinski",
"fullName": "Timo Ropinski",
"affiliation": "Linköping University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2011-09-01 00:00:00",
"pubType": "mags",
"pages": "6-13",
"year": "2011",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cbms/2010/9167/0/06042647",
"title": "A parallel cellular automata with label priors for interactive brain tumor segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2010/06042647/12OmNApcubN",
"parentPublication": {
"id": "proceedings/cbms/2010/9167/0",
"title": "2010 IEEE 23rd International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/prni/2012/4765/0/4765a101",
"title": "Connectivity-informed Sparse Classifiers for fMRI Brain Decoding",
"doi": null,
"abstractUrl": "/proceedings-article/prni/2012/4765a101/12OmNBO3JVE",
"parentPublication": {
"id": "proceedings/prni/2012/4765/0",
"title": "Pattern Recognition in NeuroImaging, IEEE International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icccnt/2013/3926/0/06726524",
"title": "Detection of brain tumor using neural network",
"doi": null,
"abstractUrl": "/proceedings-article/icccnt/2013/06726524/12OmNCga1PD",
"parentPublication": {
"id": "proceedings/icccnt/2013/3926/0",
"title": "2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2011/4541/0/4541a297",
"title": "Brain MR Image Tumor Segmentation with Ventricular Deformation",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2011/4541a297/12OmNqOwQFl",
"parentPublication": {
"id": "proceedings/icig/2011/4541/0",
"title": "Image and Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdcat/2017/3151/0/315101a270",
"title": "MRI Images Enhancement and Tumor Segmentation for Brain",
"doi": null,
"abstractUrl": "/proceedings-article/pdcat/2017/315101a270/12OmNwbLVok",
"parentPublication": {
"id": "proceedings/pdcat/2017/3151/0",
"title": "2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icccnt/2012/9999/0/06395880",
"title": "A parallel segmentation of brain tumor from magnetic resonance images",
"doi": null,
"abstractUrl": "/proceedings-article/icccnt/2012/06395880/12OmNyL0ToA",
"parentPublication": {
"id": "proceedings/icccnt/2012/9999/0",
"title": "2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dese/2011/4593/0/4593a182",
"title": "Multiclass Brain Tumor Classification Using GA-SVM",
"doi": null,
"abstractUrl": "/proceedings-article/dese/2011/4593a182/12OmNyOq4ZC",
"parentPublication": {
"id": "proceedings/dese/2011/4593/0",
"title": "2011 Developments in E-systems Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icaice/2021/2186/0/218600a430",
"title": "Brain Tumor Diagnose Applying CNN through MRI",
"doi": null,
"abstractUrl": "/proceedings-article/icaice/2021/218600a430/1Et4BBYmIYo",
"parentPublication": {
"id": "proceedings/icaice/2021/2186/0",
"title": "2021 2nd International Conference on Artificial Intelligence and Computer Engineering (ICAICE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020780",
"title": "Pseudo slicer on three dimensional brain tumor segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020780/1KfRtjunC7K",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csde/2020/1974/0/09411595",
"title": "Detection and 3D Visualization of Brain Tumor using Deep Learning and Polynomial Interpolation",
"doi": null,
"abstractUrl": "/proceedings-article/csde/2020/09411595/1taF4OwgyUE",
"parentPublication": {
"id": "proceedings/csde/2020/1974/0",
"title": "2020 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2011050004",
"articleId": "13rRUxCitLG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2011050014",
"articleId": "13rRUx0xPOe",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFvF",
"name": "mcg2011050006s.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/mcg2011050006s.mp4",
"extension": "mp4",
"size": "58.6 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": "17D45WHONqh",
"doi": "10.1109/TVCG.2018.2864905",
"abstract": "Before seeing a patient, physicians seek to obtain an overview of the patient's medical history. Text plays a major role in this activity since it represents the bulk of the clinical documentation, but reviewing it quickly becomes onerous when patient charts grow too large. Text visualization methods have been widely explored to manage this large scale through visual summaries that rely on information retrieval algorithms to structure text and make it amenable to visualization. However, the integration with such automated approaches comes with a number of limitations, including significant error rates and the need for healthcare providers to fine-tune algorithms without expert knowledge of their inner mechanics. In addition, several of these approaches obscure or substitute the original clinical text and therefore fail to leverage qualitative and rhetorical flavours of the clinical notes. These drawbacks have limited the adoption of text visualization and other summarization technologies in clinical practice. In this work we present Doccurate, a novel system embodying a curation-based approach for the visualization of large clinical text datasets. Our approach offers automation auditing and customizability to physicians while also preserving and extensively linking to the original text. We discuss findings of a formal qualitative evaluation conducted with 6 domain experts, shedding light onto physicians' information needs, perceived strengths and limitations of automated tools, and the importance of customization while balancing efficiency. We also present use case scenarios to showcase Doccurate's envisioned usage in practice.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Before seeing a patient, physicians seek to obtain an overview of the patient's medical history. Text plays a major role in this activity since it represents the bulk of the clinical documentation, but reviewing it quickly becomes onerous when patient charts grow too large. Text visualization methods have been widely explored to manage this large scale through visual summaries that rely on information retrieval algorithms to structure text and make it amenable to visualization. However, the integration with such automated approaches comes with a number of limitations, including significant error rates and the need for healthcare providers to fine-tune algorithms without expert knowledge of their inner mechanics. In addition, several of these approaches obscure or substitute the original clinical text and therefore fail to leverage qualitative and rhetorical flavours of the clinical notes. These drawbacks have limited the adoption of text visualization and other summarization technologies in clinical practice. In this work we present Doccurate, a novel system embodying a curation-based approach for the visualization of large clinical text datasets. Our approach offers automation auditing and customizability to physicians while also preserving and extensively linking to the original text. We discuss findings of a formal qualitative evaluation conducted with 6 domain experts, shedding light onto physicians' information needs, perceived strengths and limitations of automated tools, and the importance of customization while balancing efficiency. We also present use case scenarios to showcase Doccurate's envisioned usage in practice.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Before seeing a patient, physicians seek to obtain an overview of the patient's medical history. Text plays a major role in this activity since it represents the bulk of the clinical documentation, but reviewing it quickly becomes onerous when patient charts grow too large. Text visualization methods have been widely explored to manage this large scale through visual summaries that rely on information retrieval algorithms to structure text and make it amenable to visualization. However, the integration with such automated approaches comes with a number of limitations, including significant error rates and the need for healthcare providers to fine-tune algorithms without expert knowledge of their inner mechanics. In addition, several of these approaches obscure or substitute the original clinical text and therefore fail to leverage qualitative and rhetorical flavours of the clinical notes. These drawbacks have limited the adoption of text visualization and other summarization technologies in clinical practice. In this work we present Doccurate, a novel system embodying a curation-based approach for the visualization of large clinical text datasets. Our approach offers automation auditing and customizability to physicians while also preserving and extensively linking to the original text. We discuss findings of a formal qualitative evaluation conducted with 6 domain experts, shedding light onto physicians' information needs, perceived strengths and limitations of automated tools, and the importance of customization while balancing efficiency. We also present use case scenarios to showcase Doccurate's envisioned usage in practice.",
"title": "<italic>Doccurate</italic>: A Curation-Based Approach for Clinical Text Visualization",
"normalizedTitle": "Doccurate: A Curation-Based Approach for Clinical Text Visualization",
"fno": "08440832",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Health Care",
"Information Retrieval",
"Medical Information Systems",
"Text Analysis",
"Visual Summaries",
"Information Retrieval Algorithms",
"Expert Knowledge",
"Curation Based Approach",
"Clinical Text Datasets",
"Automation Auditing",
"Physicians",
"Clinical Text Visualization",
"Clinical Documentation",
"Patient Charts",
"Healthcare",
"Patient Medical History",
"Fine Tune Algorithms",
"Doccurate Envisioned Usage",
"Medical Services",
"Visualization",
"Automation",
"Data Visualization",
"Tools",
"Task Analysis",
"Medical Diagnostic Imaging",
"Visual Curation",
"Clinical Text",
"Text Visualization",
"Medical Narrative"
],
"authors": [
{
"givenName": "Nicole",
"surname": "Sultanum",
"fullName": "Nicole Sultanum",
"affiliation": "Hospital for Sick Children",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Devin",
"surname": "Singh",
"fullName": "Devin Singh",
"affiliation": "Hospital for Sick Children",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Brudno",
"fullName": "Michael Brudno",
"affiliation": "University of Toronto",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fanny",
"surname": "Chevalier",
"fullName": "Fanny Chevalier",
"affiliation": "University of Toronto",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "142-151",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ichi/2016/6117/0/6117a271",
"title": "Mining the Clinical Narrative: All Text are Not Equal",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2016/6117a271/12OmNBOll48",
"parentPublication": {
"id": "proceedings/ichi/2016/6117/0",
"title": "2016 IEEE International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2018/4210/0/421001a131",
"title": "Neural Network Based Clinical Treatment Decision Support System for Co-existing Medical Conditions",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2018/421001a131/12OmNqBKUfs",
"parentPublication": {
"id": "proceedings/dsc/2018/4210/0",
"title": "2018 IEEE Third International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2013/1309/0/06732508",
"title": "Clinical multi-label free text classification by exploiting disease label relation",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2013/06732508/12OmNyv7m7V",
"parentPublication": {
"id": "proceedings/bibm/2013/1309/0",
"title": "2013 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2017/3050/0/08217794",
"title": "Automated clinical diagnosis: The role of content in various sections of a clinical document",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2017/08217794/12OmNz61cXD",
"parentPublication": {
"id": "proceedings/bibm/2017/3050/0",
"title": "2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icesd/1994/5780/0/00302269",
"title": "Medical decision support in clinical record management systems",
"doi": null,
"abstractUrl": "/proceedings-article/icesd/1994/00302269/12OmNzdoN2w",
"parentPublication": {
"id": "proceedings/icesd/1994/5780/0",
"title": "Proceedings of International Conference on Expert Systems for Development",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/sp/2013/06/msp2013060012",
"title": "Nonconfidential Patient Types in Emergency Clinical Decision Support",
"doi": null,
"abstractUrl": "/magazine/sp/2013/06/msp2013060012/13rRUwbaqK1",
"parentPublication": {
"id": "mags/sp",
"title": "IEEE Security & Privacy",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192670",
"title": "PhenoBlocks: Phenotype Comparison Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192670/13rRUyYSWt0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09779066",
"title": "ClinicalPath: a Visualization tool to Improve the Evaluation of Electronic Health Records in Clinical Decision-Making",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09779066/1DvgD0GMunm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904479",
"title": "<italic>ChartWalk</italic>: Navigating large collections of text notes in electronic health records for clinical chart review",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904479/1H0GeYv7qog",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoin/2020/4199/0/09016559",
"title": "Semantic based Clinical Notes Mining for Factual Information Extraction",
"doi": null,
"abstractUrl": "/proceedings-article/icoin/2020/09016559/1hQqV7HPQYM",
"parentPublication": {
"id": "proceedings/icoin/2020/4199/0",
"title": "2020 International Conference on Information Networking (ICOIN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08500765",
"articleId": "17D45WYQJ6B",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440852",
"articleId": "17D45WXIkBi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzxgHvU",
"title": "April",
"year": "1990",
"issueNum": "04",
"idPrefix": "tp",
"pubType": "journal",
"volume": "12",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwcAqr2",
"doi": "10.1109/34.50624",
"abstract": "A method that measures the distance between extended objects of nonregular shape is presented. The distance measure is an average of a set of minimal point-to-point distances between the borders of the objects. The set of points is collected with a well-defined criterion based on processing of distance values on a connected medial axis formed between the objects.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A method that measures the distance between extended objects of nonregular shape is presented. The distance measure is an average of a set of minimal point-to-point distances between the borders of the objects. The set of points is collected with a well-defined criterion based on processing of distance values on a connected medial axis formed between the objects.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A method that measures the distance between extended objects of nonregular shape is presented. The distance measure is an average of a set of minimal point-to-point distances between the borders of the objects. The set of points is collected with a well-defined criterion based on processing of distance values on a connected medial axis formed between the objects.",
"title": "An Interobject Distance Measure Based on Medial Axes Retrieved from Discrete Distance Maps",
"normalizedTitle": "An Interobject Distance Measure Based on Medial Axes Retrieved from Discrete Distance Maps",
"fno": "i0390",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Picture Processing Interobject Distance Measure Medial Axes Discrete Distance Maps Minimal Point To Point Distances Distance Measurement Picture Processing"
],
"authors": [
{
"givenName": "P.O.",
"surname": "Forsgren",
"fullName": "P.O. Forsgren",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "P.",
"surname": "Seideman",
"fullName": "P. Seideman",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "1990-04-01 00:00:00",
"pubType": "trans",
"pages": "390-397",
"year": "1990",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0377",
"articleId": "13rRUxly96r",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0398",
"articleId": "13rRUwkxc6l",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRo",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1H2ljAppvkA",
"doi": "10.1109/TVCG.2022.3209631",
"abstract": "We present an approach for interactively visualizing data using color-changing inks without the need for electronic displays or computers. Color-changing inks are a family of physical inks that change their color characteristics in response to an external stimulus such as heat, UV light, water, and pressure. Visualizations created using color-changing inks can embed interactivity in printed material without external computational media. In this paper, we survey current color-changing ink technology and then use these findings to derive a framework for how it can be used to construct interactive data representations. We also enumerate the interaction techniques possible using this technology. We then show some examples of how to use color-changing ink to create interactive visualizations on paper. While obviously limited in scope to situations where no power or computing is present, or as a complement to digital displays, our findings can be employed for paper, data physicalization, and embedded visualizations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present an approach for interactively visualizing data using color-changing inks without the need for electronic displays or computers. Color-changing inks are a family of physical inks that change their color characteristics in response to an external stimulus such as heat, UV light, water, and pressure. Visualizations created using color-changing inks can embed interactivity in printed material without external computational media. In this paper, we survey current color-changing ink technology and then use these findings to derive a framework for how it can be used to construct interactive data representations. We also enumerate the interaction techniques possible using this technology. We then show some examples of how to use color-changing ink to create interactive visualizations on paper. While obviously limited in scope to situations where no power or computing is present, or as a complement to digital displays, our findings can be employed for paper, data physicalization, and embedded visualizations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present an approach for interactively visualizing data using color-changing inks without the need for electronic displays or computers. Color-changing inks are a family of physical inks that change their color characteristics in response to an external stimulus such as heat, UV light, water, and pressure. Visualizations created using color-changing inks can embed interactivity in printed material without external computational media. In this paper, we survey current color-changing ink technology and then use these findings to derive a framework for how it can be used to construct interactive data representations. We also enumerate the interaction techniques possible using this technology. We then show some examples of how to use color-changing ink to create interactive visualizations on paper. While obviously limited in scope to situations where no power or computing is present, or as a complement to digital displays, our findings can be employed for paper, data physicalization, and embedded visualizations.",
"title": "Sensemaking Sans Power: Interactive Data Visualization Using Color-Changing Ink",
"normalizedTitle": "Sensemaking Sans Power: Interactive Data Visualization Using Color-Changing Ink",
"fno": "09904859",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Ink",
"Image Color Analysis",
"Three Dimensional Displays",
"Visualization",
"Media",
"Paints",
"Physical Computing",
"Color Changing Inks",
"Design Space",
"Data Physicalization",
"Data Visualization"
],
"authors": [
{
"givenName": "Biswaksen",
"surname": "Patnaik",
"fullName": "Biswaksen Patnaik",
"affiliation": "University of Maryland, College Park, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huaishu",
"surname": "Peng",
"fullName": "Huaishu Peng",
"affiliation": "University of Maryland, College Park, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Niklas",
"surname": "Elmqvist",
"fullName": "Niklas Elmqvist",
"affiliation": "University of Maryland, College Park, MD, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-09-01 00:00:00",
"pubType": "trans",
"pages": "1-12",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/euc/2011/4552/0/4552a221",
"title": "AmbiKraf: A Nonemissive Fabric Display for Fast Changing Textile Animation",
"doi": null,
"abstractUrl": "/proceedings-article/euc/2011/4552a221/12OmNAo45Kh",
"parentPublication": {
"id": "proceedings/euc/2011/4552/0",
"title": "Embedded and Ubiquitous Computing, IEEE/IFIP International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/das/2018/3346/0/3346a393",
"title": "Automated Forgery Detection in Multispectral Document Images Using Fuzzy Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/das/2018/3346a393/12OmNBa2iFf",
"parentPublication": {
"id": "proceedings/das/2018/3346/0",
"title": "2018 13th IAPR International Workshop on Document Analysis Systems (DAS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2013/4999/0/06628744",
"title": "Hyperspectral Imaging for Ink Mismatch Detection",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2013/06628744/12OmNCd2ryG",
"parentPublication": {
"id": "proceedings/icdar/2013/4999/0",
"title": "2013 12th International Conference on Document Analysis and Recognition (ICDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2009/3992/0/05206554",
"title": "Interval HSV: Extracting ink annotations",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206554/12OmNxb5huc",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1997/8183/1/81831803",
"title": "Multiple layer screening for reducing moire patterning and ink bleeding",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1997/81831803/12OmNxiKs6p",
"parentPublication": {
"id": "proceedings/icip/1997/8183/1",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2017/3586/1/3586b229",
"title": "Towards Automated Ink Mismatch Detection in Hyperspectral Document Images",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2017/3586b229/12OmNzkMlS9",
"parentPublication": {
"id": "proceedings/icdar/2017/3586/1",
"title": "2017 14th IAPR International Conference on Document Analysis and Recognition (ICDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/02/v0235",
"title": "Image-Based Color Ink Diffusion Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2007/02/v0235/13rRUxASuSC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/i-span/2018/8534/0/853400a193",
"title": "Two-Stage Color ink Painting Style Transfer via Convolution Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/i-span/2018/853400a193/17D45XvMcbn",
"parentPublication": {
"id": "proceedings/i-span/2018/8534/0",
"title": "2018 15th International Symposium on Pervasive Systems, Algorithms and Networks (I-SPAN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdiime/2022/9009/0/900900a022",
"title": "Research on Ink Speed Recognition Method of Hyperspectral Imaging Ink Pad Based on Machine Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icdiime/2022/900900a022/1Iz57amKlnG",
"parentPublication": {
"id": "proceedings/icdiime/2022/9009/0",
"title": "2022 International Conference on 3D Immersion, Interaction and Multi-sensory Experiences (ICDIIME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdarw/2019/5054/8/505408a025",
"title": "Comparison of Ink Classification Capabilities of Classic Hyperspectral Similarity Features",
"doi": null,
"abstractUrl": "/proceedings-article/icdarw/2019/505408a025/1eLyft5LBqE",
"parentPublication": {
"id": "icdarw/2019/5054/8",
"title": "2019 International Conference on Document Analysis and Recognition Workshops (ICDARW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09905473",
"articleId": "1H2lfN8dsT6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09905944",
"articleId": "1H3ZWyzEaha",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1H3ZZ9poxJC",
"name": "ttg555501-09904859s1-supp1-3209631.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09904859s1-supp1-3209631.mp4",
"extension": "mp4",
"size": "187 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": "13rRUwInuWs",
"doi": "10.1109/TVCG.2008.171",
"abstract": "The nature of an information visualization can be considered to lie in the visual metaphors it uses to structure information. The process of understanding a visualization therefore involves an interaction between these external visual metaphors and the user's internal knowledge representations. To investigate this claim, we conducted an experiment to test the effects of visual metaphor and verbal metaphor on the understanding of tree visualizations. Participants answered simple data comprehension questions while viewing either a treemap or a node-link diagram. Questions were worded to reflect a verbal metaphor that was either compatible or incompatible with the visualization a participant was using. The results suggest that the visual metaphor indeed affects how a user derives information from a visualization. Additionally, we found that the degree to which a user is affected by the metaphor is strongly correlated with the user's ability to answer task questions correctly. These findings are a first step towards illuminating how visual metaphors shape user understanding, and have significant implications for the evaluation, application, and theory of visualization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The nature of an information visualization can be considered to lie in the visual metaphors it uses to structure information. The process of understanding a visualization therefore involves an interaction between these external visual metaphors and the user's internal knowledge representations. To investigate this claim, we conducted an experiment to test the effects of visual metaphor and verbal metaphor on the understanding of tree visualizations. Participants answered simple data comprehension questions while viewing either a treemap or a node-link diagram. Questions were worded to reflect a verbal metaphor that was either compatible or incompatible with the visualization a participant was using. The results suggest that the visual metaphor indeed affects how a user derives information from a visualization. Additionally, we found that the degree to which a user is affected by the metaphor is strongly correlated with the user's ability to answer task questions correctly. These findings are a first step towards illuminating how visual metaphors shape user understanding, and have significant implications for the evaluation, application, and theory of visualization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The nature of an information visualization can be considered to lie in the visual metaphors it uses to structure information. The process of understanding a visualization therefore involves an interaction between these external visual metaphors and the user's internal knowledge representations. To investigate this claim, we conducted an experiment to test the effects of visual metaphor and verbal metaphor on the understanding of tree visualizations. Participants answered simple data comprehension questions while viewing either a treemap or a node-link diagram. Questions were worded to reflect a verbal metaphor that was either compatible or incompatible with the visualization a participant was using. The results suggest that the visual metaphor indeed affects how a user derives information from a visualization. Additionally, we found that the degree to which a user is affected by the metaphor is strongly correlated with the user's ability to answer task questions correctly. These findings are a first step towards illuminating how visual metaphors shape user understanding, and have significant implications for the evaluation, application, and theory of visualization.",
"title": "The Shaping of Information by Visual Metaphors",
"normalizedTitle": "The Shaping of Information by Visual Metaphors",
"fno": "ttg2008061269",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Cognition",
"Visualization Theory",
"Metaphors",
"Hierarchies",
"Evaluation"
],
"authors": [
{
"givenName": "Caroline",
"surname": "Ziemkiewicz",
"fullName": "Caroline Ziemkiewicz",
"affiliation": "UNC Charlotte",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert",
"surname": "Kosara",
"fullName": "Robert Kosara",
"affiliation": "UNC Charlotte",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1269-1276",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/1991/9999/4/00184065",
"title": "Metaphors and strategic information systems planning",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1991/00184065/12OmNBQ2VYd",
"parentPublication": {
"id": "proceedings/hicss/1991/9999/4",
"title": "Proceedings of the Twenty-Fourth Annual Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2005/2397/0/23970089",
"title": "The Exchangeability of Speech by Cognitive Metaphors",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2005/23970089/12OmNCulYjx",
"parentPublication": {
"id": "proceedings/iv/2005/2397/0",
"title": "Ninth International Conference on Information Visualisation (IV'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/re/2001/1125/0/11250031",
"title": "Metaphors of Intent",
"doi": null,
"abstractUrl": "/proceedings-article/re/2001/11250031/12OmNvAAtui",
"parentPublication": {
"id": "proceedings/re/2001/1125/0",
"title": "Proceedings Fifth IEEE International Symposium on Requirements Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/1991/9999/2/00184010",
"title": "Beyond models and metaphors: visual formalisms in user interface design",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1991/00184010/12OmNx2QUDP",
"parentPublication": {
"id": "proceedings/hicss/1991/9999/2",
"title": "Proceedings of the Twenty-Fourth Annual Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2000/0743/0/07430379",
"title": "Mapping Information onto 3D Virtual Worlds",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2000/07430379/12OmNxRWI8j",
"parentPublication": {
"id": "proceedings/iv/2000/0743/0",
"title": "2000 IEEE Conference on Information Visualization. An International Conference on Computer Visualization and Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiworc/2000/0628/0/06280115",
"title": "Metaphors of Information System for E-Commerce",
"doi": null,
"abstractUrl": "/proceedings-article/aiworc/2000/06280115/12OmNz2kqkh",
"parentPublication": {
"id": "proceedings/aiworc/2000/0628/0",
"title": "Research Challenges, Academia/Industry Working Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2005/2397/0/23970103",
"title": "Icon-Based Visualization Using Mosaic Metaphors",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2005/23970103/12OmNzBwGAp",
"parentPublication": {
"id": "proceedings/iv/2005/2397/0",
"title": "Ninth International Conference on Information Visualisation (IV'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2000/0743/0/07430493",
"title": "A Classification of Multi-Sensory Metaphors for Understanding Abstract Data in a Virtual Environment",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2000/07430493/12OmNzdoMAO",
"parentPublication": {
"id": "proceedings/iv/2000/0743/0",
"title": "2000 IEEE Conference on Information Visualization. An International Conference on Computer Visualization and Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2019/3888/0/08925435",
"title": "Multiple metaphors in metaphoric gesturing",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2019/08925435/1fHGB11ke52",
"parentPublication": {
"id": "proceedings/acii/2019/3888/0",
"title": "2019 8th International Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a704",
"title": "Metaphors We See By",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a704/1rSRbwahpSM",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061253",
"articleId": "13rRUygT7f5",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061261",
"articleId": "13rRUyeCkab",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzZ5onU",
"title": "July-September",
"year": "2003",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "9",
"label": "July-September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0gefg",
"doi": "10.1109/TVCG.2003.1207445",
"abstract": "Abstract—We survey work on the different uses of graphical mapping and interaction techniques for visual data mining of large data sets represented as table data. Basic terminology related to data mining, data sets, and visualization is introduced. Previous work on information visualization is reviewed in light of different categorizations of techniques and systems. The role of interaction techniques is discussed, in addition to work addressing the question of selecting and evaluating visualization techniques. We review some representative work on the use of information visualization techniques in the context of mining data. This includes both visual data exploration and visually expressing the outcome of specific mining algorithms. We also review recent innovative approaches that attempt to integrate visualization into the DM/KDD process, using it to enhance user interaction and comprehension.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—We survey work on the different uses of graphical mapping and interaction techniques for visual data mining of large data sets represented as table data. Basic terminology related to data mining, data sets, and visualization is introduced. Previous work on information visualization is reviewed in light of different categorizations of techniques and systems. The role of interaction techniques is discussed, in addition to work addressing the question of selecting and evaluating visualization techniques. We review some representative work on the use of information visualization techniques in the context of mining data. This includes both visual data exploration and visually expressing the outcome of specific mining algorithms. We also review recent innovative approaches that attempt to integrate visualization into the DM/KDD process, using it to enhance user interaction and comprehension.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—We survey work on the different uses of graphical mapping and interaction techniques for visual data mining of large data sets represented as table data. Basic terminology related to data mining, data sets, and visualization is introduced. Previous work on information visualization is reviewed in light of different categorizations of techniques and systems. The role of interaction techniques is discussed, in addition to work addressing the question of selecting and evaluating visualization techniques. We review some representative work on the use of information visualization techniques in the context of mining data. This includes both visual data exploration and visually expressing the outcome of specific mining algorithms. We also review recent innovative approaches that attempt to integrate visualization into the DM/KDD process, using it to enhance user interaction and comprehension.",
"title": "From Visual Data Exploration to Visual Data Mining: A Survey",
"normalizedTitle": "From Visual Data Exploration to Visual Data Mining: A Survey",
"fno": "v0378",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Information Visualization",
"Visual Data Exploration",
"Visual Data Mining",
"Survey",
"Framework",
"Model"
],
"authors": [
{
"givenName": "Maria Cristina",
"surname": "Ferreira de Oliveira",
"fullName": "Maria Cristina Ferreira de Oliveira",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haim",
"surname": "Levkowitz",
"fullName": "Haim Levkowitz",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2003-07-01 00:00:00",
"pubType": "trans",
"pages": "378-394",
"year": "2003",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0361",
"articleId": "13rRUxBa5x3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0395",
"articleId": "13rRUyuvRxg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxiKs8h",
"title": "January/February",
"year": "1983",
"issueNum": "01",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "3",
"label": "January/February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvyan6",
"doi": "10.1109/MCG.1983.262971",
"abstract": "With color face plots, red eyes don't necessarily indicate lack of sleep. In this study they mean an IC transistor array variable is outside its design limits.",
"abstracts": [
{
"abstractType": "Regular",
"content": "With color face plots, red eyes don't necessarily indicate lack of sleep. In this study they mean an IC transistor array variable is outside its design limits.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "With color face plots, red eyes don't necessarily indicate lack of sleep. In this study they mean an IC transistor array variable is outside its design limits.",
"title": "Color Face Plots for Displaying Product Performance",
"normalizedTitle": "Color Face Plots for Displaying Product Performance",
"fno": "mcg1983010023",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [],
"authors": [
{
"givenName": "G.",
"surname": "Hahn",
"fullName": "G. Hahn",
"affiliation": "General Electric Company",
"__typename": "ArticleAuthorType"
},
{
"givenName": "C.",
"surname": "Morgan",
"fullName": "C. Morgan",
"affiliation": "General Electric Company",
"__typename": "ArticleAuthorType"
},
{
"givenName": "W.",
"surname": "Lorensen",
"fullName": "W. Lorensen",
"affiliation": "General Electric Company",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "1983-01-01 00:00:00",
"pubType": "mags",
"pages": "23-29",
"year": "1983",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sibgrapi/2016/3568/0/3568a173",
"title": "Analysis of the Eyes on Face Images for Compliance with ISO/ICAO Requirements",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2016/3568a173/12OmNBKW9vT",
"parentPublication": {
"id": "proceedings/sibgrapi/2016/3568/0",
"title": "2016 29th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aipr/2015/9558/0/07444542",
"title": "Hybrid sensing face detection and recognition",
"doi": null,
"abstractUrl": "/proceedings-article/aipr/2015/07444542/12OmNBmf3b8",
"parentPublication": {
"id": "proceedings/aipr/2015/9558/0",
"title": "2015 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmlc/2003/7865/5/01260064",
"title": "Real-time human face detection in color image",
"doi": null,
"abstractUrl": "/proceedings-article/icmlc/2003/01260064/12OmNCgJebQ",
"parentPublication": {
"id": "proceedings/icmlc/2003/7865/1",
"title": "Proceedings of the 2003 International Conference on Machine Learning and Cybernetics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdcloud/2015/7183/0/7183a256",
"title": "Face Detection under Particular Environment Based on Skin Color Model and Radial Basis Function Network",
"doi": null,
"abstractUrl": "/proceedings-article/bdcloud/2015/7183a256/12OmNvEhg0k",
"parentPublication": {
"id": "proceedings/bdcloud/2015/7183/0",
"title": "2015 IEEE Fifth International Conference on Big Data and Cloud Computing (BDCloud)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/1996/7713/0/77130345",
"title": "Face and Facial Feature Extraction from Color Image",
"doi": null,
"abstractUrl": "/proceedings-article/fg/1996/77130345/12OmNwO5LXy",
"parentPublication": {
"id": "proceedings/fg/1996/7713/0",
"title": "Proceedings of the Second International Conference on Automatic Face and Gesture Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mines/2009/3843/2/3843b185",
"title": "Face and Facial Feature Localization Based on Color Segmentation and Symmetry Transform",
"doi": null,
"abstractUrl": "/proceedings-article/mines/2009/3843b185/12OmNwqx48b",
"parentPublication": {
"id": "proceedings/mines/2009/3843/2",
"title": "Multimedia Information Networking and Security, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/camp/2005/2255/0/22550243",
"title": "Face Localization in Color Images with Complex Background",
"doi": null,
"abstractUrl": "/proceedings-article/camp/2005/22550243/12OmNx7G5Xb",
"parentPublication": {
"id": "proceedings/camp/2005/2255/0",
"title": "Proceedings. Seventh International Workshop on Computer Architecture for Machine Perception",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2009/2353/0/04959639",
"title": "Postural time-series analysis using Empirical Mode Decomposition and second-order difference plots",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2009/04959639/12OmNxGj9PX",
"parentPublication": {
"id": "proceedings/icassp/2009/2353/0",
"title": "Acoustics, Speech, and Signal Processing, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icetet/2010/4246/0/4246a277",
"title": "Encrypting Informative Color Image Using Color Visual Cryptography",
"doi": null,
"abstractUrl": "/proceedings-article/icetet/2010/4246a277/12OmNyRxFI8",
"parentPublication": {
"id": "proceedings/icetet/2010/4246/0",
"title": "Emerging Trends in Engineering & Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122223",
"title": "Product Plots",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122223/13rRUIM2VH0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg1983010011",
"articleId": "13rRUxCitBr",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg1983010031",
"articleId": "13rRUxBJhoz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzsJ7l0",
"title": "June",
"year": "2010",
"issueNum": "06",
"idPrefix": "tc",
"pubType": "journal",
"volume": "59",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxcbnGi",
"doi": "10.1109/TC.2010.35",
"abstract": "Chip multiprocessors (CMPs) combine increasingly many general-purpose processor cores on a single chip. These cores run several tasks with unpredictable communication needs, resulting in uncertain and often-changing traffic patterns. This unpredictability leads network-on-chip (NoC) designers to plan for the worst case traffic patterns, and significantly overprovision link capacities. In this paper, we provide NoC designers with an alternative statistical approach. We first present the traffic-load distribution plots (T-Plots), illustrating how much capacity overprovisioning is needed to service 90, 99, or 100 percent of all traffic patterns. We prove that in the general case, plotting T-Plots is #P-complete, and therefore extremely complex. We then show how to determine the exact mean and variance of the traffic load on any edge, and use these to provide Gaussian-based models for the T-Plots, as well as guaranteed performance bounds. We also explain how to practically approximate T-Plots using random-walk-based methods. Finally, we use T-Plots to reduce the network power consumption by providing an efficient capacity allocation algorithm with predictable performance guarantees.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Chip multiprocessors (CMPs) combine increasingly many general-purpose processor cores on a single chip. These cores run several tasks with unpredictable communication needs, resulting in uncertain and often-changing traffic patterns. This unpredictability leads network-on-chip (NoC) designers to plan for the worst case traffic patterns, and significantly overprovision link capacities. In this paper, we provide NoC designers with an alternative statistical approach. We first present the traffic-load distribution plots (T-Plots), illustrating how much capacity overprovisioning is needed to service 90, 99, or 100 percent of all traffic patterns. We prove that in the general case, plotting T-Plots is #P-complete, and therefore extremely complex. We then show how to determine the exact mean and variance of the traffic load on any edge, and use these to provide Gaussian-based models for the T-Plots, as well as guaranteed performance bounds. We also explain how to practically approximate T-Plots using random-walk-based methods. Finally, we use T-Plots to reduce the network power consumption by providing an efficient capacity allocation algorithm with predictable performance guarantees.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Chip multiprocessors (CMPs) combine increasingly many general-purpose processor cores on a single chip. These cores run several tasks with unpredictable communication needs, resulting in uncertain and often-changing traffic patterns. This unpredictability leads network-on-chip (NoC) designers to plan for the worst case traffic patterns, and significantly overprovision link capacities. In this paper, we provide NoC designers with an alternative statistical approach. We first present the traffic-load distribution plots (T-Plots), illustrating how much capacity overprovisioning is needed to service 90, 99, or 100 percent of all traffic patterns. We prove that in the general case, plotting T-Plots is #P-complete, and therefore extremely complex. We then show how to determine the exact mean and variance of the traffic load on any edge, and use these to provide Gaussian-based models for the T-Plots, as well as guaranteed performance bounds. We also explain how to practically approximate T-Plots using random-walk-based methods. Finally, we use T-Plots to reduce the network power consumption by providing an efficient capacity allocation algorithm with predictable performance guarantees.",
"title": "Statistical Approach to Networks-on-Chip",
"normalizedTitle": "Statistical Approach to Networks-on-Chip",
"fno": "ttc2010060748",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Networks On Chip",
"Chip Multiprocessors",
"Capacity Allocation",
"Traffic Load Distribution Plot"
],
"authors": [
{
"givenName": "Itamar",
"surname": "Cohen",
"fullName": "Itamar Cohen",
"affiliation": "Jerusalem College of Engineering, Israel",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ori",
"surname": "Rottenstreich",
"fullName": "Ori Rottenstreich",
"affiliation": "Technion, Haifa",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Isaac",
"surname": "Keslassy",
"fullName": "Isaac Keslassy",
"affiliation": "Technion, Haifa",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2010-06-01 00:00:00",
"pubType": "trans",
"pages": "748-761",
"year": "2010",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icinis/2011/4543/0/4543a113",
"title": "Optimal Buffering Resources Allocation of On-Chip Networks with Finite Buffers",
"doi": null,
"abstractUrl": "/proceedings-article/icinis/2011/4543a113/12OmNAle6Om",
"parentPublication": {
"id": "proceedings/icinis/2011/4543/0",
"title": "Intelligent Networks and Intelligent Systems, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nocs/2008/3098/0/3098a171",
"title": "Statistical Approach to NoC Design",
"doi": null,
"abstractUrl": "/proceedings-article/nocs/2008/3098a171/12OmNqEATam",
"parentPublication": {
"id": "proceedings/nocs/2008/3098/0",
"title": "2008 2nd ACM/IEEE International Symposium on Networks-on-Chip (NOCS '08)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hoti/2008/3380/0/3380a031",
"title": "Design Exploration of Optical Interconnection Networks for Chip Multiprocessors",
"doi": null,
"abstractUrl": "/proceedings-article/hoti/2008/3380a031/12OmNqHItzX",
"parentPublication": {
"id": "proceedings/hoti/2008/3380/0",
"title": "2008 16th IEEE Symposium on High Performance Interconnects",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mascots/2006/2573/0/25730104",
"title": "A Statistical Traffic Model for On-Chip Interconnection Networks",
"doi": null,
"abstractUrl": "/proceedings-article/mascots/2006/25730104/12OmNxWLTCN",
"parentPublication": {
"id": "proceedings/mascots/2006/2573/0",
"title": "14th IEEE International Symposium on Modeling, Analysis, and Simulation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/date/2004/2085/2/208520764",
"title": "Cost-Performance Trade-Offs in Networks on Chip: A Simulation-Based Approach",
"doi": null,
"abstractUrl": "/proceedings-article/date/2004/208520764/12OmNxtOO0h",
"parentPublication": {
"id": "proceedings/date/2004/2085/2",
"title": "Design, Automation & Test in Europe Conference & Exhibition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccd/2006/9706/0/04380806",
"title": "Polaris: A System-Level Roadmap for On-Chip Interconnection Networks",
"doi": null,
"abstractUrl": "/proceedings-article/iccd/2006/04380806/12OmNywfKJI",
"parentPublication": {
"id": "proceedings/iccd/2006/9706/0",
"title": "2006 24th International Conference on Computer Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvlsid/2010/4076/0/4076a369",
"title": "Hybrid QoS Method for Networks-on-Chip",
"doi": null,
"abstractUrl": "/proceedings-article/isvlsid/2010/4076a369/12OmNzmtWHL",
"parentPublication": {
"id": "proceedings/isvlsid/2010/4076/0",
"title": "2010 IEEE Computer Society Annual Symposium on VLSI",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2007/08/04276787",
"title": "Polaris: a system-level roadmapping toolchain for on-chip interconnection networks",
"doi": null,
"abstractUrl": "/journal/si/2007/08/04276787/13rRUyYBler",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2011/11/05565545",
"title": "Application-aware topology reconfiguration for on-chip networks",
"doi": null,
"abstractUrl": "/journal/si/2011/11/05565545/13rRUyuNsDj",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2020/09/09144641",
"title": "NeuronLink: An Efficient Chip-to-Chip Interconnect for Large-Scale Neural Network Accelerators",
"doi": null,
"abstractUrl": "/journal/si/2020/09/09144641/1lCloIjFOyk",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttc2010060735",
"articleId": "13rRUxlgxSD",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttc2010060762",
"articleId": "13rRUxC0SDo",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvwoO0",
"title": "June",
"year": "2012",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyoPSP4",
"doi": "10.1109/TVCG.2011.100",
"abstract": "Human discourse contains a rich mixture of conceptual information. Visualization of the global and local patterns within this data stream is a complex and challenging problem. Recurrence plots are an information visualization technique that can reveal trends and features in complex time series data. The recurrence plot technique works by measuring the similarity of points in a time series to all other points in the same time series and plotting the results in two dimensions. Previous studies have applied recurrence plotting techniques to textual data; however, these approaches plot recurrence using term-based similarity rather than conceptual similarity of the text. We introduce conceptual recurrence plots, which use a model of language to measure similarity between pairs of text utterances, and the similarity of all utterances is measured and displayed. In this paper, we explore how the descriptive power of the recurrence plotting technique can be used to discover patterns of interaction across a series of conversation transcripts. The results suggest that the conceptual recurrence plotting technique is a useful tool for exploring the structure of human discourse.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Human discourse contains a rich mixture of conceptual information. Visualization of the global and local patterns within this data stream is a complex and challenging problem. Recurrence plots are an information visualization technique that can reveal trends and features in complex time series data. The recurrence plot technique works by measuring the similarity of points in a time series to all other points in the same time series and plotting the results in two dimensions. Previous studies have applied recurrence plotting techniques to textual data; however, these approaches plot recurrence using term-based similarity rather than conceptual similarity of the text. We introduce conceptual recurrence plots, which use a model of language to measure similarity between pairs of text utterances, and the similarity of all utterances is measured and displayed. In this paper, we explore how the descriptive power of the recurrence plotting technique can be used to discover patterns of interaction across a series of conversation transcripts. The results suggest that the conceptual recurrence plotting technique is a useful tool for exploring the structure of human discourse.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Human discourse contains a rich mixture of conceptual information. Visualization of the global and local patterns within this data stream is a complex and challenging problem. Recurrence plots are an information visualization technique that can reveal trends and features in complex time series data. The recurrence plot technique works by measuring the similarity of points in a time series to all other points in the same time series and plotting the results in two dimensions. Previous studies have applied recurrence plotting techniques to textual data; however, these approaches plot recurrence using term-based similarity rather than conceptual similarity of the text. We introduce conceptual recurrence plots, which use a model of language to measure similarity between pairs of text utterances, and the similarity of all utterances is measured and displayed. In this paper, we explore how the descriptive power of the recurrence plotting technique can be used to discover patterns of interaction across a series of conversation transcripts. The results suggest that the conceptual recurrence plotting technique is a useful tool for exploring the structure of human discourse.",
"title": "Conceptual Recurrence Plots: Revealing Patterns in Human Discourse",
"normalizedTitle": "Conceptual Recurrence Plots: Revealing Patterns in Human Discourse",
"fno": "05887327",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Time Series",
"Data Visualisation",
"Text Analysis",
"Conversation Transcripts",
"Conceptual Recurrence Plot Technique",
"Pattern Revealing",
"Human Discourse",
"Conceptual Information",
"Global Local Pattern Visualization",
"Data Stream",
"Information Visualization Technique",
"Complex Time Series Data",
"Point Similarity Measurement",
"Term Based Similarity",
"Language Modelling",
"Text Utterances",
"Interaction Pattern Discovery",
"Data Visualization",
"Semantics",
"Humans",
"Image Color Analysis",
"Pain",
"Surgery",
"Time Series Analysis",
"Text Analysis",
"Concept Map",
"Recurrence",
"Concept",
"Plotting",
"Conversation Analysis"
],
"authors": [
{
"givenName": "A.",
"surname": "Smith",
"fullName": "A. Smith",
"affiliation": "Sch. of Inf. Technol. & Electr. Eng., Univ. of Queensland, Brisbane, QLD, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "D.",
"surname": "Angus",
"fullName": "D. Angus",
"affiliation": "Sch. of Inf. Technol. & Electr. Eng., Univ. of Queensland, Brisbane, QLD, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "J.",
"surname": "Wiles",
"fullName": "J. Wiles",
"affiliation": "Sch. of Inf. Technol. & Electr. Eng., Univ. of Queensland, Brisbane, QLD, Australia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2012-06-01 00:00:00",
"pubType": "trans",
"pages": "988-997",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cerma/2008/3320/0/3320a183",
"title": "RecurrenceVs: A Software Tool for Analysis of Similarity in Recurrence Plots",
"doi": null,
"abstractUrl": "/proceedings-article/cerma/2008/3320a183/12OmNAkWvl2",
"parentPublication": {
"id": "proceedings/cerma/2008/3320/0",
"title": "Electronics, Robotics and Automotive Mechanics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2008/3299/0/3299a225",
"title": "Self-Similarity Metric for Index Pruning in Conceptual Vector Space Models",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2008/3299a225/12OmNAlvHu9",
"parentPublication": {
"id": "proceedings/dexa/2008/3299/0",
"title": "2008 19th International Workshop on Database and Expert Systems Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbeb/2012/4706/0/4706a951",
"title": "Understanding Coupling and Synchronization in EEG of Epileptic Discharge Using Recurrence Plots with Varying Threshold",
"doi": null,
"abstractUrl": "/proceedings-article/icbeb/2012/4706a951/12OmNApLGpj",
"parentPublication": {
"id": "proceedings/icbeb/2012/4706/0",
"title": "Biomedical Engineering and Biotechnology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2009/3736/5/3736e078",
"title": "Representation and Calculation of Spatial Relations Difference Based on Conceptual Neighborhood",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2009/3736e078/12OmNB7LvCc",
"parentPublication": {
"id": "proceedings/icnc/2009/3736/5",
"title": "2009 Fifth International Conference on Natural Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2013/5108/0/5108a687",
"title": "Time Series Classification Using Compression Distance of Recurrence Plots",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2013/5108a687/12OmNBqdr3r",
"parentPublication": {
"id": "proceedings/icdm/2013/5108/0",
"title": "2013 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qsic/2011/4468/0/4468a102",
"title": "An Information Retrieval Based Approach for Measuring Service Conceptual Cohesion",
"doi": null,
"abstractUrl": "/proceedings-article/qsic/2011/4468a102/12OmNqBbHDf",
"parentPublication": {
"id": "proceedings/qsic/2011/4468/0",
"title": "Quality Software, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/micai/2008/3441/0/3441a111",
"title": "Classification of Data Sequences by Similarity Analysis of Recurrence Plot Patterns",
"doi": null,
"abstractUrl": "/proceedings-article/micai/2008/3441a111/12OmNxFJXv7",
"parentPublication": {
"id": "proceedings/micai/2008/3441/0",
"title": "2008 Seventh Mexican International Conference on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etvis/2016/4731/0/07851157",
"title": "Gaze self-similarity plots as a useful tool for eye movement characteristics analysis",
"doi": null,
"abstractUrl": "/proceedings-article/etvis/2016/07851157/12OmNy3RRHa",
"parentPublication": {
"id": "proceedings/etvis/2016/4731/0",
"title": "2016 IEEE Second Workshop on Eye Tracking and Visualization (ETVIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsc/2009/3800/0/3800a253",
"title": "Conceptual Space Markup Language (CSML): Towards the Cognitive Semantic Web",
"doi": null,
"abstractUrl": "/proceedings-article/icsc/2009/3800a253/12OmNyKrHbE",
"parentPublication": {
"id": "proceedings/icsc/2009/3800/0",
"title": "2009 IEEE International Conference on Semantic Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2016/3568/0/3568a448",
"title": "Partial Similarity of 3D Shapes Using Cross Recurrence Plot",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2016/3568a448/12OmNyQGSnA",
"parentPublication": {
"id": "proceedings/sibgrapi/2016/3568/0",
"title": "2016 29th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012060837",
"articleId": "13rRUwdrdSy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05928335",
"articleId": "13rRUxlgxOi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xic4fDV0di",
"doi": "10.1109/TVCG.2021.3114828",
"abstract": "In the process of developing an infrastructure for providing visualization and visual analytics (VIS) tools to epidemiologists and modeling scientists, we encountered a technical challenge for applying a number of visual designs to numerous datasets rapidly and reliably with limited development resources. In this paper, we present a technical solution to address this challenge. Operationally, we separate the tasks of data management, visual designs, and plots and dashboard deployment in order to streamline the development workflow. Technically, we utilize: an ontology to bring datasets, visual designs, and deployable plots and dashboards under the same management framework; multi-criteria search and ranking algorithms for discovering potential datasets that match a visual design; and a purposely-design user interface for propagating each visual design to appropriate datasets (often in tens and hundreds) and quality-assuring the propagation before the deployment. This technical solution has been used in the development of the RAMPVIS infrastructure for supporting a consortium of epidemiologists and modeling scientists through visualization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In the process of developing an infrastructure for providing visualization and visual analytics (VIS) tools to epidemiologists and modeling scientists, we encountered a technical challenge for applying a number of visual designs to numerous datasets rapidly and reliably with limited development resources. In this paper, we present a technical solution to address this challenge. Operationally, we separate the tasks of data management, visual designs, and plots and dashboard deployment in order to streamline the development workflow. Technically, we utilize: an ontology to bring datasets, visual designs, and deployable plots and dashboards under the same management framework; multi-criteria search and ranking algorithms for discovering potential datasets that match a visual design; and a purposely-design user interface for propagating each visual design to appropriate datasets (often in tens and hundreds) and quality-assuring the propagation before the deployment. This technical solution has been used in the development of the RAMPVIS infrastructure for supporting a consortium of epidemiologists and modeling scientists through visualization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In the process of developing an infrastructure for providing visualization and visual analytics (VIS) tools to epidemiologists and modeling scientists, we encountered a technical challenge for applying a number of visual designs to numerous datasets rapidly and reliably with limited development resources. In this paper, we present a technical solution to address this challenge. Operationally, we separate the tasks of data management, visual designs, and plots and dashboard deployment in order to streamline the development workflow. Technically, we utilize: an ontology to bring datasets, visual designs, and deployable plots and dashboards under the same management framework; multi-criteria search and ranking algorithms for discovering potential datasets that match a visual design; and a purposely-design user interface for propagating each visual design to appropriate datasets (often in tens and hundreds) and quality-assuring the propagation before the deployment. This technical solution has been used in the development of the RAMPVIS infrastructure for supporting a consortium of epidemiologists and modeling scientists through visualization.",
"title": "Propagating Visual Designs to Numerous Plots and Dashboards",
"normalizedTitle": "Propagating Visual Designs to Numerous Plots and Dashboards",
"fno": "09552200",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Visualization",
"Ontologies",
"Tools",
"Programming",
"Analytical Models",
"Time Series Analysis",
"Visualization System",
"Propagation",
"Infrastructure",
"Ontology",
"Quality Assurance",
"Pandemic",
"Emergency Response"
],
"authors": [
{
"givenName": "Saiful",
"surname": "Khan",
"fullName": "Saiful Khan",
"affiliation": "University of Oxford, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Phong H.",
"surname": "Nguyen",
"fullName": "Phong H. Nguyen",
"affiliation": "Redsift Ltd., UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alfie",
"surname": "Abdul-Rahman",
"fullName": "Alfie Abdul-Rahman",
"affiliation": "King's College London, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Benjamin",
"surname": "Bach",
"fullName": "Benjamin Bach",
"affiliation": "Edinburgh University, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Min",
"surname": "Chen",
"fullName": "Min Chen",
"affiliation": "University of Oxford, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Euan",
"surname": "Freeman",
"fullName": "Euan Freeman",
"affiliation": "University of Glasgow, Scotland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cagatay",
"surname": "Turkay",
"fullName": "Cagatay Turkay",
"affiliation": "University of Warwick, UK",
"__typename": "ArticleAuthorType"
}
],
"replicability": {
"isEnabled": false,
"codeDownloadUrl": "https://github.com/saifulkhan/rampvis-ontology-management-ui.git",
"codeRepositoryUrl": "https://github.com/saifulkhan/rampvis-ontology-management-ui",
"__typename": "ArticleReplicabilityType"
},
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "86-95",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cerma/2008/3320/0/3320a183",
"title": "RecurrenceVs: A Software Tool for Analysis of Similarity in Recurrence Plots",
"doi": null,
"abstractUrl": "/proceedings-article/cerma/2008/3320a183/12OmNAkWvl2",
"parentPublication": {
"id": "proceedings/cerma/2008/3320/0",
"title": "Electronics, Robotics and Automotive Mechanics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2017/5738/0/08031609",
"title": "Making many-to-many parallel coordinate plots scalable by asymmetric biclustering",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031609/12OmNrHjqNa",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vahc/2017/3187/0/08387496",
"title": "DataScope: Interactive visual exploratory dashboards for large multidimensional data",
"doi": null,
"abstractUrl": "/proceedings-article/vahc/2017/08387496/12OmNx4Q6FM",
"parentPublication": {
"id": "proceedings/vahc/2017/3187/0",
"title": "2017 IEEE Workshop on Visual Analytics in Healthcare (VAHC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2017/0852/0/0852a099",
"title": "Stem & Leaf Plots Extended for Text Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2017/0852a099/12OmNy5zspa",
"parentPublication": {
"id": "proceedings/cgiv/2017/0852/0",
"title": "2017 14th International Conference on Computer Graphics, Imaging and Visualization (CGiV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192696",
"title": "Orientation-Enhanced Parallel Coordinate Plots",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192696/13rRUwkxc5q",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/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/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/vis/2019/4941/0/08933582",
"title": "Periphery Plots for Contextualizing Heterogeneous Time-Based Charts",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933582/1fTgIueMC7m",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2020/6553/0/09093523",
"title": "PlotQA: Reasoning over Scientific Plots",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2020/09093523/1jPbuLQHNhm",
"parentPublication": {
"id": "proceedings/wacv/2020/6553/0",
"title": "2020 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2020/5697/0/09086292",
"title": "Space-Reclaiming Icicle Plots",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2020/09086292/1kuHnGGBnBS",
"parentPublication": {
"id": "proceedings/pacificvis/2020/5697/0",
"title": "2020 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09645370",
"articleId": "1zc6D7Qkucw",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09559731",
"articleId": "1xs9BhiH0HK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zBaO1Ado1G",
"name": "ttg202201-09552200s1-supp1-3114828.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09552200s1-supp1-3114828.mp4",
"extension": "mp4",
"size": "33.4 MB",
"__typename": "WebExtraType"
},
{
"id": "1zBaNVG2Qes",
"name": "ttg202201-09552200s1-supp2-3114828.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09552200s1-supp2-3114828.pdf",
"extension": "pdf",
"size": "397 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1IRiaDKFcU8",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tm",
"pubType": "journal",
"volume": "22",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1sYYsvkf0By",
"doi": "10.1109/TMC.2021.3074865",
"abstract": "The rapid growth of GPS technology and mobile devices has led to a massive accumulation of location data, bringing considerable benefits to individuals and society. One of the major usages of such data is travel time prediction, a typical service provided by GPS navigation devices and apps. Meanwhile, the constant collection and analysis of the individual location data also pose unprecedented privacy threats. We leverage the notion of geo-indistinguishability, an extension of differential privacy to the location privacy setting, and propose a procedure for privacy-preserving travel time prediction without collecting actual individual GPS trace data. We propose new concepts to examine the impact of geo-indistinguishability-based sanitization on the usefulness of GPS traces and provide analytical and experimental utility analysis for privacy-preserving travel time prediction. We also propose new metrics to measure the adversary error in learning individual GPS traces from the collected sanitized data. Our experiment results suggest that the proposed procedure provides travel time prediction with satisfactory accuracy at reasonably small privacy costs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The rapid growth of GPS technology and mobile devices has led to a massive accumulation of location data, bringing considerable benefits to individuals and society. One of the major usages of such data is travel time prediction, a typical service provided by GPS navigation devices and apps. Meanwhile, the constant collection and analysis of the individual location data also pose unprecedented privacy threats. We leverage the notion of geo-indistinguishability, an extension of differential privacy to the location privacy setting, and propose a procedure for privacy-preserving travel time prediction without collecting actual individual GPS trace data. We propose new concepts to examine the impact of geo-indistinguishability-based sanitization on the usefulness of GPS traces and provide analytical and experimental utility analysis for privacy-preserving travel time prediction. We also propose new metrics to measure the adversary error in learning individual GPS traces from the collected sanitized data. Our experiment results suggest that the proposed procedure provides travel time prediction with satisfactory accuracy at reasonably small privacy costs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The rapid growth of GPS technology and mobile devices has led to a massive accumulation of location data, bringing considerable benefits to individuals and society. One of the major usages of such data is travel time prediction, a typical service provided by GPS navigation devices and apps. Meanwhile, the constant collection and analysis of the individual location data also pose unprecedented privacy threats. We leverage the notion of geo-indistinguishability, an extension of differential privacy to the location privacy setting, and propose a procedure for privacy-preserving travel time prediction without collecting actual individual GPS trace data. We propose new concepts to examine the impact of geo-indistinguishability-based sanitization on the usefulness of GPS traces and provide analytical and experimental utility analysis for privacy-preserving travel time prediction. We also propose new metrics to measure the adversary error in learning individual GPS traces from the collected sanitized data. Our experiment results suggest that the proposed procedure provides travel time prediction with satisfactory accuracy at reasonably small privacy costs.",
"title": "Privacy-Preserving Travel Time Prediction With Uncertainty Using GPS Trace Data",
"normalizedTitle": "Privacy-Preserving Travel Time Prediction With Uncertainty Using GPS Trace Data",
"fno": "09410446",
"hasPdf": true,
"idPrefix": "tm",
"keywords": [
"Data Privacy",
"Global Positioning System",
"Mobile Computing",
"Actual Individual GPS Trace Data",
"Collected Sanitized Data",
"Differential Privacy",
"Individual GPS Traces",
"Individual Location Data",
"Location Privacy Setting",
"Mobile Devices",
"Privacy Preserving Travel Time Prediction",
"Uncertainty Using GPS Trace Data",
"Unprecedented Privacy Threats",
"Data Privacy",
"Global Positioning System",
"Privacy",
"Trajectory",
"Roads",
"Differential Privacy",
"Aggregates",
"Differential Privacy",
"Geo Indistinguishability",
"Effective Number Of Mapped Full Trajectories",
"Usefulness",
"Usable Trajectory",
"Continuous Positioning Degree",
"Average Distance"
],
"authors": [
{
"givenName": "Fang",
"surname": "Liu",
"fullName": "Fang Liu",
"affiliation": "Department of Applied and Computational Mathematics and Statistics, University of Notre Dame, Notre Dame, IN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dong",
"surname": "Wang",
"fullName": "Dong Wang",
"affiliation": "Department of State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhengquan",
"surname": "Xu",
"fullName": "Zhengquan Xu",
"affiliation": "Department of State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "417-428",
"year": "2023",
"issn": "1536-1233",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/mdm/2016/0883/1/0883a325",
"title": "FoGBAT: Combining Bluetooth and GPS Data for Better Traffic Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/mdm/2016/0883a325/12OmNAXxX8a",
"parentPublication": {
"id": "proceedings/mdm/2016/0883/1",
"title": "2016 17th IEEE International Conference on Mobile Data Management (MDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/greencom-ithingscpscom/2013/5046/0/06682115",
"title": "Analysis of Travel Time Patterns in Urban Using Taxi GPS Data",
"doi": null,
"abstractUrl": "/proceedings-article/greencom-ithingscpscom/2013/06682115/12OmNBCqbDa",
"parentPublication": {
"id": "proceedings/greencom-ithingscpscom/2013/5046/0",
"title": "2013 IEEE International Conference on Green Computing and Communications (GreenCom) and IEEE Internet of Things(iThings) and IEEE Cyber, Physical and Social Computing(CPSCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2010/4212/1/4212a797",
"title": "GPS Probe Based Freeway Real-Time Travel Speed Estimation Using Kalman Filter",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2010/4212a797/12OmNCcKQAS",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-css-icess/2014/6123/0/07056894",
"title": "Privacy Risks in Publication of Taxi GPS Data",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-css-icess/2014/07056894/12OmNrNh0Ju",
"parentPublication": {
"id": "proceedings/hpcc-css-icess/2014/6123/0",
"title": "2014 IEEE International Conference on High Performance Computing and Communications (HPCC), 2014 IEEE 6th International Symposium on Cyberspace Safety and Security (CSS) and 2014 IEEE 11th International Conference on Embedded Software and Systems (ICESS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbd/2017/1072/0/1072a261",
"title": "VOut: Mining Sampled GPS Trace for Taximeter Fraud",
"doi": null,
"abstractUrl": "/proceedings-article/cbd/2017/1072a261/12OmNyS6RN2",
"parentPublication": {
"id": "proceedings/cbd/2017/1072/0",
"title": "2017 Fifth International Conference on Advanced Cloud and Big Data (CBD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2017/2715/0/08258062",
"title": "Travel purpose inference with GPS trajectories, POIs, and geo-tagged social media data",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08258062/17D45WYQJ81",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2018/7744/0/774400a712",
"title": "An Ensemble Method for Urban Travel Time Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2018/774400a712/17D45WrVg8S",
"parentPublication": {
"id": "proceedings/itme/2018/7744/0",
"title": "2018 9th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/5555/01/10016678",
"title": "Vector-Indistinguishability: Location Dependency Based Privacy Protection for Successive Location Data",
"doi": null,
"abstractUrl": "/journal/tc/5555/01/10016678/1JU05Q8po0E",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mdm/2020/4663/0/09162195",
"title": "GPS Data Analysis: Travel Time Estimation in Sparse Data Environments",
"doi": null,
"abstractUrl": "/proceedings-article/mdm/2020/09162195/1m6hGvRW3dK",
"parentPublication": {
"id": "proceedings/mdm/2020/4663/0",
"title": "2020 21st IEEE International Conference on Mobile Data Management (MDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/2020/9074/0/907400a585",
"title": "Robust Federated Learning Approach for Travel Mode Identification from Non-IID GPS Trajectories",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2020/907400a585/1rvCrbpHAZi",
"parentPublication": {
"id": "proceedings/icpads/2020/9074/0",
"title": "2020 IEEE 26th International Conference on Parallel and Distributed Systems (ICPADS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09410462",
"articleId": "1t0DmwUxaP6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09405445",
"articleId": "1sP17Iw43GE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNy49sJl",
"title": "Nov.",
"year": "2013",
"issueNum": "11",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxcKzVk",
"doi": "10.1109/TVCG.2013.76",
"abstract": "We present KelpFusion: a method for depicting set membership of items on a map or other visualization using continuous boundaries. KelpFusion is a hybrid representation that bridges hull techniques such as Bubble Sets and Euler diagrams and line- and graph-based techniques such as LineSets and Kelp Diagrams. We describe an algorithm based on shortest-path graphs to compute KelpFusion visualizations. Based on a single parameter, the shortest-path graph varies from the minimal spanning tree to the convex hull of a point set. Shortest-path graphs aim to capture the shape of a point set and smoothly adapt to sets of varying densities. KelpFusion fills enclosed faces based on a set of simple legibility rules. We present the results of a controlled experiment comparing KelpFusion to Bubble Sets and LineSets. We conclude that KelpFusion outperforms Bubble Sets both in accuracy and completion time and outperforms LineSets in completion time.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present KelpFusion: a method for depicting set membership of items on a map or other visualization using continuous boundaries. KelpFusion is a hybrid representation that bridges hull techniques such as Bubble Sets and Euler diagrams and line- and graph-based techniques such as LineSets and Kelp Diagrams. We describe an algorithm based on shortest-path graphs to compute KelpFusion visualizations. Based on a single parameter, the shortest-path graph varies from the minimal spanning tree to the convex hull of a point set. Shortest-path graphs aim to capture the shape of a point set and smoothly adapt to sets of varying densities. KelpFusion fills enclosed faces based on a set of simple legibility rules. We present the results of a controlled experiment comparing KelpFusion to Bubble Sets and LineSets. We conclude that KelpFusion outperforms Bubble Sets both in accuracy and completion time and outperforms LineSets in completion time.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present KelpFusion: a method for depicting set membership of items on a map or other visualization using continuous boundaries. KelpFusion is a hybrid representation that bridges hull techniques such as Bubble Sets and Euler diagrams and line- and graph-based techniques such as LineSets and Kelp Diagrams. We describe an algorithm based on shortest-path graphs to compute KelpFusion visualizations. Based on a single parameter, the shortest-path graph varies from the minimal spanning tree to the convex hull of a point set. Shortest-path graphs aim to capture the shape of a point set and smoothly adapt to sets of varying densities. KelpFusion fills enclosed faces based on a set of simple legibility rules. We present the results of a controlled experiment comparing KelpFusion to Bubble Sets and LineSets. We conclude that KelpFusion outperforms Bubble Sets both in accuracy and completion time and outperforms LineSets in completion time.",
"title": "KelpFusion: A Hybrid Set Visualization Technique",
"normalizedTitle": "KelpFusion: A Hybrid Set Visualization Technique",
"fno": "ttg2013111846",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Silicon",
"Resource Management",
"Shape",
"Geometry",
"Filling",
"Accuracy",
"Visualization Techniques And Methodologies",
"Information Visualization"
],
"authors": [
{
"givenName": "W.",
"surname": "Meulemans",
"fullName": "W. Meulemans",
"affiliation": "Tech. Univ. Eindhoven, Eindhoven, Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "N. H.",
"surname": "Riche",
"fullName": "N. H. Riche",
"affiliation": "Microsoft Res., Redmond, WA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "B.",
"surname": "Speckmann",
"fullName": "B. Speckmann",
"affiliation": "Tech. Univ. Eindhoven, Eindhoven, Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "B.",
"surname": "Alper",
"fullName": "B. Alper",
"affiliation": "Univ. of California, Santa Barbara, Santa Barbara, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "T.",
"surname": "Dwyer",
"fullName": "T. Dwyer",
"affiliation": "Monash Univ., Caulfield East, VIC, Australia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2013-11-01 00:00:00",
"pubType": "trans",
"pages": "1846-1858",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2016/8851/0/8851d346",
"title": "Consistency of Silhouettes and Their Duals",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851d346/12OmNC1Guhz",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robio/2006/0570/0/04142039",
"title": "Path Planning with Steering Sets for Car-Like Robots and Finding an Effective Set",
"doi": null,
"abstractUrl": "/proceedings-article/robio/2006/04142039/12OmNqIzgZX",
"parentPublication": {
"id": "proceedings/robio/2006/0570/0",
"title": "IEEE International Conference on Robotics and Biomimetics - ROBIO2006",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvd/2007/2869/0/28690240",
"title": "Time Convex Hull with a Highway",
"doi": null,
"abstractUrl": "/proceedings-article/isvd/2007/28690240/12OmNqJHFKT",
"parentPublication": {
"id": "proceedings/isvd/2007/2869/0",
"title": "4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2012/4925/0/4925a431",
"title": "Convex-Concave Hull for Classification with Support Vector Machine",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2012/4925a431/12OmNx5Yvqd",
"parentPublication": {
"id": "proceedings/icdmw/2012/4925/0",
"title": "2012 IEEE 12th International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etcs/2009/3557/3/3557e434",
"title": "A Convex Hull Algorithm for Planar Point Set Based on Privacy Protecting",
"doi": null,
"abstractUrl": "/proceedings-article/etcs/2009/3557e434/12OmNzBwGK1",
"parentPublication": {
"id": "proceedings/etcs/2009/3557/3",
"title": "Education Technology and Computer Science, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06876026",
"title": "OnSet: A Visualization Technique for Large-scale Binary Set Data",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06876026/13rRUNvya9l",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/03/ttg2013030393",
"title": "A Unified Approach to Streamline Selection and Viewpoint Selection for 3D Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2013/03/ttg2013030393/13rRUx0xPTR",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2011/01/ttb2011010059",
"title": "Fast Surface-Based Travel Depth Estimation Algorithm for Macromolecule Surface Shape Description",
"doi": null,
"abstractUrl": "/journal/tb/2011/01/ttb2011010059/13rRUxASuLb",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07536208",
"title": "PowerSet: A Comprehensive Visualization of Set Intersections",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07536208/13rRUy0HYRv",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122259",
"title": "Design Study of LineSets, a Novel Set Visualization Technique",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122259/13rRUygBwhE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013111833",
"articleId": "13rRUwI5Ug8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013111859",
"articleId": "13rRUxOve9I",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRVT",
"name": "ttg2013111846s.mpg",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013111846s.mpg",
"extension": "mpg",
"size": "31.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1txPs9C3tok",
"title": "June",
"year": "2021",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1tcfGK6j0Nq",
"doi": "10.1109/TVCG.2021.3074615",
"abstract": "Set systems are used to model data that naturally arises in many contexts: social networks have communities, musicians have genres, and patients have symptoms. Visualizations that accurately reflect the information in the underlying set system make it possible to identify the set elements, the sets themselves, and the relationships between the sets. In static contexts, such as print media or infographics, it is necessary to capture this information without the help of interactions. With this in mind, we consider three different systems for medium-sized set data, LineSets, EulerView, and MetroSets, and report the results of a controlled human-subjects experiment comparing their effectiveness. Specifically, we evaluate the performance, in terms of time and error, on tasks that cover the spectrum of static set-based tasks. We also collect and analyze qualitative data about the three different visualization systems. Our results include statistically significant differences, suggesting that MetroSets performs and scales better.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Set systems are used to model data that naturally arises in many contexts: social networks have communities, musicians have genres, and patients have symptoms. Visualizations that accurately reflect the information in the underlying set system make it possible to identify the set elements, the sets themselves, and the relationships between the sets. In static contexts, such as print media or infographics, it is necessary to capture this information without the help of interactions. With this in mind, we consider three different systems for medium-sized set data, LineSets, EulerView, and MetroSets, and report the results of a controlled human-subjects experiment comparing their effectiveness. Specifically, we evaluate the performance, in terms of time and error, on tasks that cover the spectrum of static set-based tasks. We also collect and analyze qualitative data about the three different visualization systems. Our results include statistically significant differences, suggesting that MetroSets performs and scales better.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Set systems are used to model data that naturally arises in many contexts: social networks have communities, musicians have genres, and patients have symptoms. Visualizations that accurately reflect the information in the underlying set system make it possible to identify the set elements, the sets themselves, and the relationships between the sets. In static contexts, such as print media or infographics, it is necessary to capture this information without the help of interactions. With this in mind, we consider three different systems for medium-sized set data, LineSets, EulerView, and MetroSets, and report the results of a controlled human-subjects experiment comparing their effectiveness. Specifically, we evaluate the performance, in terms of time and error, on tasks that cover the spectrum of static set-based tasks. We also collect and analyze qualitative data about the three different visualization systems. Our results include statistically significant differences, suggesting that MetroSets performs and scales better.",
"title": "On the Readability of Abstract Set Visualizations",
"normalizedTitle": "On the Readability of Abstract Set Visualizations",
"fno": "09418624",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Directed Graphs",
"Set Theory",
"Statistical Analysis",
"Genres",
"Underlying Set System",
"Set Elements",
"Static Contexts",
"Print Media",
"Medium Sized Set Data",
"Controlled Human Subjects",
"Static Set Based Tasks",
"Qualitative Data",
"Different Visualization Systems",
"Readability",
"Abstract Set Visualizations",
"Set Systems",
"Social Networks",
"Musicians",
"Task Analysis",
"Data Visualization",
"Social Networking Online",
"Transmission Line Matrix Methods",
"Shape",
"Bipartite Graph",
"Taxonomy",
"Set Visualization",
"Usability Study",
"Quantitative Evaluation"
],
"authors": [
{
"givenName": "Markus",
"surname": "Wallinger",
"fullName": "Markus Wallinger",
"affiliation": "Algorithms and Complexity Group, TU Wien, Vienna, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ben",
"surname": "Jacobsen",
"fullName": "Ben Jacobsen",
"affiliation": "Dept. of Computer Science, University of Arizona, Tucson, AZ, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stephen",
"surname": "Kobourov",
"fullName": "Stephen Kobourov",
"affiliation": "Dept. of Computer Science, University of Arizona, Tucson, AZ, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Martin",
"surname": "Nöllenburg",
"fullName": "Martin Nöllenburg",
"affiliation": "Algorithms and Complexity Group, TU Wien, Vienna, Austria",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2021-06-01 00:00:00",
"pubType": "trans",
"pages": "2821-2832",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isuma/1990/2107/0/00151257",
"title": "Safety evaluation of existing transmission lines using fuzzy set theory",
"doi": null,
"abstractUrl": "/proceedings-article/isuma/1990/00151257/12OmNA0MZ8G",
"parentPublication": {
"id": "proceedings/isuma/1990/2107/0",
"title": "Proceedings First International Symposium on Uncertainty Modeling and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsme/2015/7532/0/07332514",
"title": "Using stereotypes in the automatic generation of natural language summaries for C++ methods",
"doi": null,
"abstractUrl": "/proceedings-article/icsme/2015/07332514/12OmNAgoV5y",
"parentPublication": {
"id": "proceedings/icsme/2015/7532/0",
"title": "2015 IEEE International Conference on Software Maintenance and Evolution (ICSME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imsccs/2006/2581/1/25810214",
"title": "Point Set Surfaces Representations Based on Hierarchical Geometry Images",
"doi": null,
"abstractUrl": "/proceedings-article/imsccs/2006/25810214/12OmNqHItNY",
"parentPublication": {
"id": "proceedings/imsccs/2006/2581/1",
"title": "Computer and Computational Sciences, International Multi-Symposiums on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccd/1988/0872/0/00025747",
"title": "Set-associative dynamic random access memory",
"doi": null,
"abstractUrl": "/proceedings-article/iccd/1988/00025747/12OmNsd6vnT",
"parentPublication": {
"id": "proceedings/iccd/1988/0872/0",
"title": "Proceedings 1988 IEEE International Conference on Computer Design: VLSI",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsym/2016/3438/0/07858445",
"title": "Total k-Domatic Partition on Some Classes of Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/compsym/2016/07858445/12OmNviHKeH",
"parentPublication": {
"id": "proceedings/compsym/2016/3438/0",
"title": "2016 International Computer Symposium (ICS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse/2014/7981/0/7981b134",
"title": "On the Minimum Hub Set Problem",
"doi": null,
"abstractUrl": "/proceedings-article/cse/2014/7981b134/12OmNwDACde",
"parentPublication": {
"id": "proceedings/cse/2014/7981/0",
"title": "2014 IEEE 17th International Conference on Computational Science and Engineering (CSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2019/7474/0/747400a076",
"title": "Computing a Near-Maximum Independent Set in Dynamic Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2019/747400a076/1aDSTtFsAM0",
"parentPublication": {
"id": "proceedings/icde/2019/7474/0",
"title": "2019 IEEE 35th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2019/7474/0/747400a818",
"title": "Dynamic Set kNN Self-Join",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2019/747400a818/1aDT47QKm9a",
"parentPublication": {
"id": "proceedings/icde/2019/7474/0",
"title": "2019 IEEE 35th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2020/1056/0/09381431",
"title": "Effect of readability of political tweets on positive user engagement",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2020/09381431/1semxWQKvIc",
"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": "trans/tg/2022/12/09495259",
"title": "AI4VIS: Survey on Artificial Intelligence Approaches for Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09495259/1vyjtdJRfXO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09409642",
"articleId": "1sXjFJRdyCY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09359504",
"articleId": "1rlAQHG5pao",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNylsZCb",
"title": "January",
"year": "1991",
"issueNum": "01",
"idPrefix": "td",
"pubType": "journal",
"volume": "2",
"label": "January",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy0qnFL",
"doi": "10.1109/71.80185",
"abstract": "A graph theoretical representation for a class of interconnection networks is suggested.The idea is based on a definition of orthogonal binary vectors and leads to a constructionrule for a class of orthogonal graphs. An orthogonal graph is first defined as a set of2/sup m/ nodes, which in turn are linked by 2/sup m-n/ edges for every link model definedin an integer set Q*. The degree and diameter of an orthogonal graph are determined interms of the parameters n, m, and the number of link modes defined in Q*. Routing inorthogonal graphs is shown to reduce to the node covering problem in bipartite graphs.The proposed theory is applied to describe a number of well-known interconnectionnetworks such as the binary m-cube and spanning-bus meshes. Multidimensional access (MDA) memories are also shown as examples of orthogonal shared memory multiprocessingsystems. Finally, orthogonal graphs are applied to the construction of multistageinterconnection networks. Connectivity and placement rules are given and shown to yielda number of well-known networks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A graph theoretical representation for a class of interconnection networks is suggested.The idea is based on a definition of orthogonal binary vectors and leads to a constructionrule for a class of orthogonal graphs. An orthogonal graph is first defined as a set of2/sup m/ nodes, which in turn are linked by 2/sup m-n/ edges for every link model definedin an integer set Q*. The degree and diameter of an orthogonal graph are determined interms of the parameters n, m, and the number of link modes defined in Q*. Routing inorthogonal graphs is shown to reduce to the node covering problem in bipartite graphs.The proposed theory is applied to describe a number of well-known interconnectionnetworks such as the binary m-cube and spanning-bus meshes. Multidimensional access (MDA) memories are also shown as examples of orthogonal shared memory multiprocessingsystems. Finally, orthogonal graphs are applied to the construction of multistageinterconnection networks. Connectivity and placement rules are given and shown to yielda number of well-known networks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A graph theoretical representation for a class of interconnection networks is suggested.The idea is based on a definition of orthogonal binary vectors and leads to a constructionrule for a class of orthogonal graphs. An orthogonal graph is first defined as a set of2/sup m/ nodes, which in turn are linked by 2/sup m-n/ edges for every link model definedin an integer set Q*. The degree and diameter of an orthogonal graph are determined interms of the parameters n, m, and the number of link modes defined in Q*. Routing inorthogonal graphs is shown to reduce to the node covering problem in bipartite graphs.The proposed theory is applied to describe a number of well-known interconnectionnetworks such as the binary m-cube and spanning-bus meshes. Multidimensional access (MDA) memories are also shown as examples of orthogonal shared memory multiprocessingsystems. Finally, orthogonal graphs are applied to the construction of multistageinterconnection networks. Connectivity and placement rules are given and shown to yielda number of well-known networks.",
"title": "Orthogonal Graphs for the Construction of a Class of Interconnection Networks",
"normalizedTitle": "Orthogonal Graphs for the Construction of a Class of Interconnection Networks",
"fno": "l0003",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Multidimensional Access Memories Connectivity Graph Theoretical Representation Interconnection Networks Orthogonal Binary Vectors Link Modes Node Covering Problem Bipartite Graphs Binary M Cube Spanning Bus Meshes Orthogonal Shared Memorymultiprocessing Systems Placement Graph Theory Multiprocessor Interconnectionnetworks"
],
"authors": [
{
"givenName": "I.D.",
"surname": "Scherson",
"fullName": "I.D. Scherson",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "1991-01-01 00:00:00",
"pubType": "trans",
"pages": "3-19",
"year": "1991",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "l0001",
"articleId": "13rRUyfKIH6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "l0020",
"articleId": "13rRUxBa5ri",
"__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": "13rRUxcbnH9",
"doi": "10.1109/TVCG.2012.196",
"abstract": "Comparing slopes is a fundamental graph reading task and the aspect ratio chosen for a plot influences how easy these comparisons are to make. According to Banking to 45°, a classic design guideline first proposed and studied by Cleveland et al., aspect ratios that center slopes around 45° minimize errors in visual judgments of slope ratios. This paper revisits this earlier work. Through exploratory pilot studies that expand Cleveland et al.’s experimental design, we develop an empirical model of slope ratio estimation that fits more extreme slope ratio judgments and two common slope ratio estimation strategies. We then run two experiments to validate our model. In the first, we show that our model fits more generally than the one proposed by Cleveland et al. and we find that, in general, slope ratio errors are not minimized around 45°. In the second experiment, we explore a novel hypothesis raised by our model: that visible baselines can substantially mitigate errors made in slope judgments. We conclude with an application of our model to aspect ratio selection.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Comparing slopes is a fundamental graph reading task and the aspect ratio chosen for a plot influences how easy these comparisons are to make. According to Banking to 45°, a classic design guideline first proposed and studied by Cleveland et al., aspect ratios that center slopes around 45° minimize errors in visual judgments of slope ratios. This paper revisits this earlier work. Through exploratory pilot studies that expand Cleveland et al.’s experimental design, we develop an empirical model of slope ratio estimation that fits more extreme slope ratio judgments and two common slope ratio estimation strategies. We then run two experiments to validate our model. In the first, we show that our model fits more generally than the one proposed by Cleveland et al. and we find that, in general, slope ratio errors are not minimized around 45°. In the second experiment, we explore a novel hypothesis raised by our model: that visible baselines can substantially mitigate errors made in slope judgments. We conclude with an application of our model to aspect ratio selection.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Comparing slopes is a fundamental graph reading task and the aspect ratio chosen for a plot influences how easy these comparisons are to make. According to Banking to 45°, a classic design guideline first proposed and studied by Cleveland et al., aspect ratios that center slopes around 45° minimize errors in visual judgments of slope ratios. This paper revisits this earlier work. Through exploratory pilot studies that expand Cleveland et al.’s experimental design, we develop an empirical model of slope ratio estimation that fits more extreme slope ratio judgments and two common slope ratio estimation strategies. We then run two experiments to validate our model. In the first, we show that our model fits more generally than the one proposed by Cleveland et al. and we find that, in general, slope ratio errors are not minimized around 45°. In the second experiment, we explore a novel hypothesis raised by our model: that visible baselines can substantially mitigate errors made in slope judgments. We conclude with an application of our model to aspect ratio selection.",
"title": "An Empirical Model of Slope Ratio Comparisons",
"normalizedTitle": "An Empirical Model of Slope Ratio Comparisons",
"fno": "ttg2012122613",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Approximation Methods",
"Estimation",
"Market Research",
"Predictive Models",
"Data Models",
"Slope Analysis",
"Aspect Ratio Selection",
"Banking To 45 Degrees",
"Slope Perception",
"Orientation Resolution"
],
"authors": [
{
"givenName": "Justin",
"surname": "Talbot",
"fullName": "Justin Talbot",
"affiliation": "Stanford University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Gerth",
"fullName": "John Gerth",
"affiliation": "Stanford University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pat",
"surname": "Hanrahan",
"fullName": "Pat Hanrahan",
"affiliation": "Stanford University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2613-2620",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccis/2010/4270/0/4270b236",
"title": "An Extension of LWR Model Considering Slope and Heterogeneous Drivers",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2010/4270b236/12OmNqIhG16",
"parentPublication": {
"id": "proceedings/iccis/2010/4270/0",
"title": "2010 International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2013/4932/0/4932b260",
"title": "Three-Dimensional Rock Slope Stability Analysis of the Longjiang River Bridge",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2013/4932b260/12OmNvD8RrW",
"parentPublication": {
"id": "proceedings/icmtma/2013/4932/0",
"title": "2013 Fifth International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aici/2009/3816/1/3816a204",
"title": "Application of Optimum Perturbation Algorithm for Parameter Inversion Identification of Soil Moisture Model under Ecological Slope Protection",
"doi": null,
"abstractUrl": "/proceedings-article/aici/2009/3816a204/12OmNwEJ0C1",
"parentPublication": {
"id": "proceedings/aici/2009/3816/1",
"title": "2009 International Conference on Artificial Intelligence and Computational Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2016/1451/0/07465245",
"title": "Mathematical foundations of arc length-based aspect ratio selection",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2016/07465245/12OmNxVlTCn",
"parentPublication": {
"id": "proceedings/pacificvis/2016/1451/0",
"title": "2016 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsem/2010/4223/1/4223a114",
"title": "New Approaches to Obtain Reliable Slope Mechanical Parameters under Condition of Limited Samples and Monitored Data",
"doi": null,
"abstractUrl": "/proceedings-article/icsem/2010/4223a114/12OmNxiKs3j",
"parentPublication": {
"id": "proceedings/icsem/2010/4223/1",
"title": "2010 International Conference on System Science, Engineering Design and Manufacturing Informatization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2008/3304/1/3304a520",
"title": "Adapted Genetic Algorithm Applied to Slope Reliability Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2008/3304a520/12OmNxjjEcH",
"parentPublication": {
"id": "icnc/2008/3304/1",
"title": "2008 Fourth International Conference on Natural Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoip/2010/4252/2/4252b376",
"title": "Seismically Induced Rock Slope Instability and the Corresponding Treatment: The Case of Leshan Giant Buddha Scenic Spot",
"doi": null,
"abstractUrl": "/proceedings-article/icoip/2010/4252b376/12OmNyugyGw",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisa/2011/9222/0/05772323",
"title": "A Study on the Security Rating with the Use of the Slope-Ratio Method of a Figure",
"doi": null,
"abstractUrl": "/proceedings-article/icisa/2011/05772323/12OmNzUxOgg",
"parentPublication": {
"id": "proceedings/icisa/2011/9222/0",
"title": "2011 International Conference on Information Science and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/islped/2007/3709/0/37090387",
"title": "Slope interconnect effort: gate-interconnect interdependentdelay model for CMOS logic gates",
"doi": null,
"abstractUrl": "/proceedings-article/islped/2007/37090387/12OmNzcxZv6",
"parentPublication": {
"id": "proceedings/islped/2007/3709/0",
"title": "Low Power Electronics and Design, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122276",
"title": "Arc Length-Based Aspect Ratio Selection",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122276/13rRUNvyatg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012122603",
"articleId": "13rRUxD9h57",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122621",
"articleId": "13rRUygBwhH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyPQ4uQ",
"title": "Dec.",
"year": "2018",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "14H4WN2IC5i",
"doi": "10.1109/TVCG.2017.2787113",
"abstract": "The aspect ratio of a line chart heavily influences the perception of the underlying data. Different methods explore different criteria in choosing aspect ratios, but so far, it was still unclear how to select aspect ratios appropriately for any given data. This paper provides a guideline for the user to choose aspect ratios for any input 1D curves by conducting an in-depth analysis of aspect ratio selection methods both theoretically and experimentally. By formulating several existing methods as line integrals, we explain their parameterization invariance. Moreover, we derive a new and improved aspect ratio selection method, namely the Z_$L_1$_Z -LOR (local orientation resolution), with a certain degree of parameterization invariance. Furthermore, we connect different methods, including AL (arc length based method), the banking to 45 Z_$^\\circ$_Z principle, RV (resultant vector) and AS (average absolute slope), as well as Z_$L_1$_Z -LOR and AO (average absolute orientation). We verify these connections by a comparative evaluation involving various data sets, and show that the selections by RV and Z_$L_1$_Z -LOR are complementary to each other for most data. Accordingly, we propose the dual-scale banking technique that combines the strengths of RV and Z_$L_1$_Z -LOR, and demonstrate its practicability using multiple real-world data sets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The aspect ratio of a line chart heavily influences the perception of the underlying data. Different methods explore different criteria in choosing aspect ratios, but so far, it was still unclear how to select aspect ratios appropriately for any given data. This paper provides a guideline for the user to choose aspect ratios for any input 1D curves by conducting an in-depth analysis of aspect ratio selection methods both theoretically and experimentally. By formulating several existing methods as line integrals, we explain their parameterization invariance. Moreover, we derive a new and improved aspect ratio selection method, namely the $L_1$ -LOR (local orientation resolution), with a certain degree of parameterization invariance. Furthermore, we connect different methods, including AL (arc length based method), the banking to 45 $^\\circ$ principle, RV (resultant vector) and AS (average absolute slope), as well as $L_1$ -LOR and AO (average absolute orientation). We verify these connections by a comparative evaluation involving various data sets, and show that the selections by RV and $L_1$ -LOR are complementary to each other for most data. Accordingly, we propose the dual-scale banking technique that combines the strengths of RV and $L_1$ -LOR, and demonstrate its practicability using multiple real-world data sets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The aspect ratio of a line chart heavily influences the perception of the underlying data. Different methods explore different criteria in choosing aspect ratios, but so far, it was still unclear how to select aspect ratios appropriately for any given data. This paper provides a guideline for the user to choose aspect ratios for any input 1D curves by conducting an in-depth analysis of aspect ratio selection methods both theoretically and experimentally. By formulating several existing methods as line integrals, we explain their parameterization invariance. Moreover, we derive a new and improved aspect ratio selection method, namely the - -LOR (local orientation resolution), with a certain degree of parameterization invariance. Furthermore, we connect different methods, including AL (arc length based method), the banking to 45 - principle, RV (resultant vector) and AS (average absolute slope), as well as - -LOR and AO (average absolute orientation). We verify these connections by a comparative evaluation involving various data sets, and show that the selections by RV and - -LOR are complementary to each other for most data. Accordingly, we propose the dual-scale banking technique that combines the strengths of RV and - -LOR, and demonstrate its practicability using multiple real-world data sets.",
"title": "Is There a Robust Technique for Selecting Aspect Ratios in Line Charts?",
"normalizedTitle": "Is There a Robust Technique for Selecting Aspect Ratios in Line Charts?",
"fno": "08239850",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Banking",
"Market Research",
"Robustness",
"Guidelines",
"Visual Perception",
"Indexes",
"Data Visualization",
"Aspect Ratio",
"Parameterization Invariance",
"Line Integral",
"Banking To 45 Circ",
"Orientation Resolution"
],
"authors": [
{
"givenName": "Yunhai",
"surname": "Wang",
"fullName": "Yunhai Wang",
"affiliation": "Shandong University, Qingdao, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zeyu",
"surname": "Wang",
"fullName": "Zeyu Wang",
"affiliation": "Shandong University, Qingdao",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lifeng",
"surname": "Zhu",
"fullName": "Lifeng Zhu",
"affiliation": "Southeast University, Nanjing, Jiangsu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jian",
"surname": "Zhang",
"fullName": "Jian Zhang",
"affiliation": "Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chi-Wing",
"surname": "Fu",
"fullName": "Chi-Wing Fu",
"affiliation": "Chinese University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhanglin",
"surname": "Cheng",
"fullName": "Zhanglin Cheng",
"affiliation": "VRHIT Shenzhen Institutes of Advanced Technology, Shenzhen, Guangdong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Changhe",
"surname": "Tu",
"fullName": "Changhe Tu",
"affiliation": "Shandong University, Qingdao, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Baoquan",
"surname": "Chen",
"fullName": "Baoquan Chen",
"affiliation": "Shandong University, Qingdao, Shandong, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2018-12-01 00:00:00",
"pubType": "trans",
"pages": "3096-3110",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sitis/2010/4319/0/4319a066",
"title": "Combining Multiple Image Features to Guide Automatic Portrait Cropping for Rendering Different Aspect Ratios",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2010/4319a066/12OmNBO3JVF",
"parentPublication": {
"id": "proceedings/sitis/2010/4319/0",
"title": "2010 Sixth International Conference on Signal-Image Technology and Internet Based Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdp/1996/7376/0/73760102",
"title": "Parallel Formulations of Matrix-Vector Multiplication for Matrices with Large Aspect Ratios",
"doi": null,
"abstractUrl": "/proceedings-article/pdp/1996/73760102/12OmNvjyxA1",
"parentPublication": {
"id": "proceedings/pdp/1996/7376/0",
"title": "4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2002/1695/1/169510218",
"title": "Estimating Fibre Twist and Aspect Ratios in 3D Voxel Volumes",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2002/169510218/12OmNwErpWa",
"parentPublication": {
"id": "proceedings/icpr/2002/1695/1",
"title": "Proceedings of 16th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2016/1451/0/07465245",
"title": "Mathematical foundations of arc length-based aspect ratio selection",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2016/07465245/12OmNxVlTCn",
"parentPublication": {
"id": "proceedings/pacificvis/2016/1451/0",
"title": "2016 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v0701",
"title": "Multi-Scale Banking to 45 Degrees",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v0701/13rRUIM2VGV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010060990",
"title": "Perceptual Guidelines for Creating Rectangular Treemaps",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010060990/13rRUx0gezT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122613",
"title": "An Empirical Model of Slope Ratio Comparisons",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122613/13rRUxcbnH9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122326",
"title": "Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122326/13rRUyuNswX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440843",
"title": "Image-Based Aspect Ratio Selection",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440843/17D45VTRowg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08249874",
"articleId": "14H4WOr0FCU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08106712",
"articleId": "14H4WOGl0Ep",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRZv",
"name": "ttg201812-08239850s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201812-08239850s1.zip",
"extension": "zip",
"size": "12.6 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": "17D45VTRowg",
"doi": "10.1109/TVCG.2018.2865266",
"abstract": "Selecting a good aspect ratio is crucial for effective 2D diagrams. There are several aspect ratio selection methods for function plots and line charts, but only few can handle general, discrete diagrams such as 2D scatter plots. However, these methods either lack a perceptual foundation or heavily rely on intermediate isoline representations, which depend on choosing the right isovalues and are time-consuming to compute. This paper introduces a general image-based approach for selecting aspect ratios for a wide variety of 2D diagrams, ranging from scatter plots and density function plots to line charts. Our approach is derived from Federer's co-area formula and a line integral representation that enable us to directly construct image-based versions of existing selection methods using density fields. In contrast to previous methods, our approach bypasses isoline computation, so it is faster to compute, while following the perceptual foundation to select aspect ratios. Furthermore, this approach is complemented by an anisotropic kernel density estimation to construct density fields, allowing us to more faithfully characterize data patterns, such as the subgroups in scatterplots or dense regions in time series. We demonstrate the effectiveness of our approach by quantitatively comparing to previous methods and revisiting a prior user study. Finally, we present extensions for ROI banking, multi-scale banking, and the application to image data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Selecting a good aspect ratio is crucial for effective 2D diagrams. There are several aspect ratio selection methods for function plots and line charts, but only few can handle general, discrete diagrams such as 2D scatter plots. However, these methods either lack a perceptual foundation or heavily rely on intermediate isoline representations, which depend on choosing the right isovalues and are time-consuming to compute. This paper introduces a general image-based approach for selecting aspect ratios for a wide variety of 2D diagrams, ranging from scatter plots and density function plots to line charts. Our approach is derived from Federer's co-area formula and a line integral representation that enable us to directly construct image-based versions of existing selection methods using density fields. In contrast to previous methods, our approach bypasses isoline computation, so it is faster to compute, while following the perceptual foundation to select aspect ratios. Furthermore, this approach is complemented by an anisotropic kernel density estimation to construct density fields, allowing us to more faithfully characterize data patterns, such as the subgroups in scatterplots or dense regions in time series. We demonstrate the effectiveness of our approach by quantitatively comparing to previous methods and revisiting a prior user study. Finally, we present extensions for ROI banking, multi-scale banking, and the application to image data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Selecting a good aspect ratio is crucial for effective 2D diagrams. There are several aspect ratio selection methods for function plots and line charts, but only few can handle general, discrete diagrams such as 2D scatter plots. However, these methods either lack a perceptual foundation or heavily rely on intermediate isoline representations, which depend on choosing the right isovalues and are time-consuming to compute. This paper introduces a general image-based approach for selecting aspect ratios for a wide variety of 2D diagrams, ranging from scatter plots and density function plots to line charts. Our approach is derived from Federer's co-area formula and a line integral representation that enable us to directly construct image-based versions of existing selection methods using density fields. In contrast to previous methods, our approach bypasses isoline computation, so it is faster to compute, while following the perceptual foundation to select aspect ratios. Furthermore, this approach is complemented by an anisotropic kernel density estimation to construct density fields, allowing us to more faithfully characterize data patterns, such as the subgroups in scatterplots or dense regions in time series. We demonstrate the effectiveness of our approach by quantitatively comparing to previous methods and revisiting a prior user study. Finally, we present extensions for ROI banking, multi-scale banking, and the application to image data.",
"title": "Image-Based Aspect Ratio Selection",
"normalizedTitle": "Image-Based Aspect Ratio Selection",
"fno": "08440843",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Federer Co Area Formula",
"Image Data",
"Anisotropic Kernel Density Estimation",
"Isoline Computation",
"Density Fields",
"Image Based Versions",
"Line Integral Representation",
"Density Function Plots",
"Aspect Ratios",
"General Image Based Approach",
"Intermediate Isoline Representations",
"Perceptual Foundation",
"Scatter Plots",
"Discrete Diagrams",
"General Diagrams",
"Line Charts",
"Aspect Ratio Selection Methods",
"Effective 2 D Diagrams",
"Good Aspect Ratio",
"Two Dimensional Displays",
"Banking",
"Data Visualization",
"Kernel",
"Market Research",
"Estimation",
"Visualization",
"Aspect Ratio",
"Image Based Method",
"Federers Co Area Formula",
"Density Field",
"Anisotropic Kernel Density Estimation"
],
"authors": [
{
"givenName": "Yunhai",
"surname": "Wang",
"fullName": "Yunhai Wang",
"affiliation": "Shandong University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zeyu",
"surname": "Wang",
"fullName": "Zeyu Wang",
"affiliation": "SIAT, Shenzhen VisuCA Key Lab, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chi-Wing",
"surname": "Fu",
"fullName": "Chi-Wing Fu",
"affiliation": "Chinese University of Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hansjörq",
"surname": "Schmauder",
"fullName": "Hansjörq Schmauder",
"affiliation": "VISUS, University of Stuttgart, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Oliver",
"surname": "Deussen",
"fullName": "Oliver Deussen",
"affiliation": "Konstanz University, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Weiskopf",
"fullName": "Daniel Weiskopf",
"affiliation": "VISUS, University of Stuttgart, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "840-849",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccvw/2017/1034/0/1034c001",
"title": "Integrating Boundary and Center Correlation Filters for Visual Tracking with Aspect Ratio Variation",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034c001/12OmNAle6UB",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdva/2015/7343/0/07314294",
"title": "Guiding the Exploration of Scatter Plot Data Using Motif-Based Interest Measures",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2015/07314294/12OmNwHz03z",
"parentPublication": {
"id": "proceedings/bdva/2015/7343/0",
"title": "2015 Big Data Visual Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2016/1451/0/07465245",
"title": "Mathematical foundations of arc length-based aspect ratio selection",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2016/07465245/12OmNxVlTCn",
"parentPublication": {
"id": "proceedings/pacificvis/2016/1451/0",
"title": "2016 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2013/4892/0/4892b522",
"title": "Enhancing Scatter Plots Using Ellipsoid Pixel Placement and Shading",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2013/4892b522/12OmNzwpUnq",
"parentPublication": {
"id": "proceedings/hicss/2013/4892/0",
"title": "2013 46th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122276",
"title": "Arc Length-Based Aspect Ratio Selection",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122276/13rRUNvyatg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/09/ttg2013091526",
"title": "Splatterplots: Overcoming Overdraw in Scatter Plots",
"doi": null,
"abstractUrl": "/journal/tg/2013/09/ttg2013091526/13rRUxC0SEh",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122326",
"title": "Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122326/13rRUyuNswX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/12/08239850",
"title": "Is There a Robust Technique for Selecting Aspect Ratios in Line Charts?",
"doi": null,
"abstractUrl": "/journal/tg/2018/12/08239850/14H4WN2IC5i",
"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/2019/2838/0/283800a062",
"title": "A Technique for Selection and Drawing of Scatterplots for Multi-Dimensional Data Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a062/1cMF8TTAeAw",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440818",
"articleId": "17D45W2WyxG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440809",
"articleId": "17D45XH89qj",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFwY",
"name": "ttg201901-08440843s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08440843s1.zip",
"extension": "zip",
"size": "15.9 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUEgs2tq",
"doi": "10.1109/TVCG.2012.65",
"abstract": "Gaining a true appreciation of high-dimensional space remains difficult since all of the existing high-dimensional space exploration techniques serialize the space travel in some way. This is not so foreign to us since we, when traveling, also experience the world in a serial fashion. But we typically have access to a map to help with positioning, orientation, navigation, and trip planning. Here, we propose a multivariate data exploration tool that compares high-dimensional space navigation with a sightseeing trip. It decomposes this activity into five major tasks: 1) Identify the sights: use a map to identify the sights of interest and their location; 2) Plan the trip: connect the sights of interest along a specifyable path; 3) Go on the trip: travel along the route; 4) Hop off the bus: experience the location, look around, zoom into detail; and 5) Orient and localize: regain bearings in the map. We describe intuitive and interactive tools for all of these tasks, both global navigation within the map and local exploration of the data distributions. For the latter, we describe a polygonal touchpad interface which enables users to smoothly tilt the projection plane in high-dimensional space to produce multivariate scatterplots that best convey the data relationships under investigation. Motion parallax and illustrative motion trails aid in the perception of these transient patterns. We describe the use of our system within two applications: 1) the exploratory discovery of data configurations that best fit a personal preference in the presence of tradeoffs and 2) interactive cluster analysis via cluster sculpting in N-D.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Gaining a true appreciation of high-dimensional space remains difficult since all of the existing high-dimensional space exploration techniques serialize the space travel in some way. This is not so foreign to us since we, when traveling, also experience the world in a serial fashion. But we typically have access to a map to help with positioning, orientation, navigation, and trip planning. Here, we propose a multivariate data exploration tool that compares high-dimensional space navigation with a sightseeing trip. It decomposes this activity into five major tasks: 1) Identify the sights: use a map to identify the sights of interest and their location; 2) Plan the trip: connect the sights of interest along a specifyable path; 3) Go on the trip: travel along the route; 4) Hop off the bus: experience the location, look around, zoom into detail; and 5) Orient and localize: regain bearings in the map. We describe intuitive and interactive tools for all of these tasks, both global navigation within the map and local exploration of the data distributions. For the latter, we describe a polygonal touchpad interface which enables users to smoothly tilt the projection plane in high-dimensional space to produce multivariate scatterplots that best convey the data relationships under investigation. Motion parallax and illustrative motion trails aid in the perception of these transient patterns. We describe the use of our system within two applications: 1) the exploratory discovery of data configurations that best fit a personal preference in the presence of tradeoffs and 2) interactive cluster analysis via cluster sculpting in N-D.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Gaining a true appreciation of high-dimensional space remains difficult since all of the existing high-dimensional space exploration techniques serialize the space travel in some way. This is not so foreign to us since we, when traveling, also experience the world in a serial fashion. But we typically have access to a map to help with positioning, orientation, navigation, and trip planning. Here, we propose a multivariate data exploration tool that compares high-dimensional space navigation with a sightseeing trip. It decomposes this activity into five major tasks: 1) Identify the sights: use a map to identify the sights of interest and their location; 2) Plan the trip: connect the sights of interest along a specifyable path; 3) Go on the trip: travel along the route; 4) Hop off the bus: experience the location, look around, zoom into detail; and 5) Orient and localize: regain bearings in the map. We describe intuitive and interactive tools for all of these tasks, both global navigation within the map and local exploration of the data distributions. For the latter, we describe a polygonal touchpad interface which enables users to smoothly tilt the projection plane in high-dimensional space to produce multivariate scatterplots that best convey the data relationships under investigation. Motion parallax and illustrative motion trails aid in the perception of these transient patterns. We describe the use of our system within two applications: 1) the exploratory discovery of data configurations that best fit a personal preference in the presence of tradeoffs and 2) interactive cluster analysis via cluster sculpting in N-D.",
"title": "TripAdvisor^{N-D}: A Tourism-Inspired High-Dimensional Space Exploration Framework with Overview and Detail",
"normalizedTitle": "TripAdvisor^{N-D}: A Tourism-Inspired High-Dimensional Space Exploration Framework with Overview and Detail",
"fno": "ttg2013020291",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Travel Industry",
"Computational Geometry",
"Data Analysis",
"Data Structures",
"Data Visualisation",
"Interactive Systems",
"Pattern Clustering",
"High D Data Visualization Systems",
"Trip Advisor N D",
"Tourism Inspired High Dimensional Space Exploration Framework",
"Space Travel",
"Positioning",
"Orientation",
"Global Navigation",
"Trip Planning",
"Multivariate Data Exploration Tool",
"Sight Identification",
"Go On The Trip",
"Hop Off The Bus",
"Orient And Localize",
"Interactive Tools",
"Data Distributions",
"Polygonal Touchpad Interface",
"Motion Parallax",
"Illustrative Motion",
"Exploratory Data Discovery",
"Interactive Cluster Analysis",
"Cluster Sculpting",
"Data Representation",
"Vectors",
"Principal Component Analysis",
"Navigation",
"Three Dimensional Displays",
"Data Visualization",
"Space Exploration",
"Measurement",
"Visual Analytics",
"High Dimensional Data",
"Coordinated And Multiple Views",
"Zooming And Navigation Techniques",
"Data Transformation And Representation",
"Data Clustering"
],
"authors": [
{
"givenName": "J. E.",
"surname": "Nam",
"fullName": "J. E. Nam",
"affiliation": "Microsoft Corp., Redmond, WA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "K.",
"surname": "Mueller",
"fullName": "K. Mueller",
"affiliation": "Microsoft Corp., Redmond, WA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2013-02-01 00:00:00",
"pubType": "trans",
"pages": "291-305",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2008/3268/0/3268a011",
"title": "Visualization and Level-of-Detail Control for Multi-Dimensional Bioactive Chemical Data",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2008/3268a011/12OmNBTs7Co",
"parentPublication": {
"id": "proceedings/iv/2008/3268/0",
"title": "2008 12th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1990/2083/0/00146386",
"title": "Exploring N-dimensional databases",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1990/00146386/12OmNqBbHO9",
"parentPublication": {
"id": "proceedings/visual/1990/2083/0",
"title": "1990 First IEEE Conference on Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mdm/2011/4436/1/4436a152",
"title": "Trip-Mine: An Efficient Trip Planning Approach with Travel Time Constraints",
"doi": null,
"abstractUrl": "/proceedings-article/mdm/2011/4436a152/12OmNrFBQ1o",
"parentPublication": {
"id": "proceedings/mdm/2011/4436/1",
"title": "2011 IEEE 12th International Conference on Mobile Data Management",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2018/5114/0/511401a029",
"title": "Dynamical Properties of Strongly Descendible Map on N Dimensional Monomer",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2018/511401a029/12OmNrIJqBT",
"parentPublication": {
"id": "proceedings/icmtma/2018/5114/0",
"title": "2018 10th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse/2009/3823/4/3823e058",
"title": "Visually and Acoustically Exploring the High-Dimensional Space of Music",
"doi": null,
"abstractUrl": "/proceedings-article/cse/2009/3823e058/12OmNwKoZhH",
"parentPublication": {
"id": "proceedings/cse/2009/3823/2",
"title": "2009 International Conference on Computational Science and Engineering",
"__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": "proceedings/vv/2000/308/0/04384228",
"title": "Level-of-Detail Volume Rendering via 3D Textures",
"doi": null,
"abstractUrl": "/proceedings-article/vv/2000/04384228/12OmNz4SOrJ",
"parentPublication": {
"id": "proceedings/vv/2000/308/0",
"title": "2000 IEEE Symposium on Volume Visualization (VV 2000)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122336",
"title": "Interactive Visualizations on Large and Small Displays: The Interrelation of Display Size, Information Space, and Scale",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122336/13rRUwvT9gs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/02/ttg2010020192",
"title": "Cross-Filtered Views for Multidimensional Visual Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2010/02/ttg2010020192/13rRUxBa5bO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2021/9184/0/918400c649",
"title": "SPARQLIt: Interactive SPARQL Query Refinement",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2021/918400c649/1uGXn8N1kPe",
"parentPublication": {
"id": "proceedings/icde/2021/9184/0",
"title": "2021 IEEE 37th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013020278",
"articleId": "13rRUB7a1fP",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013020306",
"articleId": "13rRUy0qnGk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgLu",
"name": "ttg2013020291s.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013020291s.zip",
"extension": "zip",
"size": "19.8 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyPQ4Dx",
"title": "Dec.",
"year": "2012",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5xh",
"doi": "10.1109/TVCG.2012.253",
"abstract": "For many applications involving time series data, people are often interested in the changes of item values over time as well as their ranking changes. For example, people search many words via search engines like Google and Bing every day. Analysts are interested in both the absolute searching number for each word as well as their relative rankings. Both sets of statistics may change over time. For very large time series data with thousands of items, how to visually present ranking changes is an interesting challenge. In this paper, we propose RankExplorer, a novel visualization method based on ThemeRiver to reveal the ranking changes. Our method consists of four major components: 1) a segmentation method which partitions a large set of time series curves into a manageable number of ranking categories; 2) an extended ThemeRiver view with embedded color bars and changing glyphs to show the evolution of aggregation values related to each ranking category over time as well as the content changes in each ranking category; 3) a trend curve to show the degree of ranking changes over time; 4) rich user interactions to support interactive exploration of ranking changes. We have applied our method to some real time series data and the case studies demonstrate that our method can reveal the underlying patterns related to ranking changes which might otherwise be obscured in traditional visualizations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "For many applications involving time series data, people are often interested in the changes of item values over time as well as their ranking changes. For example, people search many words via search engines like Google and Bing every day. Analysts are interested in both the absolute searching number for each word as well as their relative rankings. Both sets of statistics may change over time. For very large time series data with thousands of items, how to visually present ranking changes is an interesting challenge. In this paper, we propose RankExplorer, a novel visualization method based on ThemeRiver to reveal the ranking changes. Our method consists of four major components: 1) a segmentation method which partitions a large set of time series curves into a manageable number of ranking categories; 2) an extended ThemeRiver view with embedded color bars and changing glyphs to show the evolution of aggregation values related to each ranking category over time as well as the content changes in each ranking category; 3) a trend curve to show the degree of ranking changes over time; 4) rich user interactions to support interactive exploration of ranking changes. We have applied our method to some real time series data and the case studies demonstrate that our method can reveal the underlying patterns related to ranking changes which might otherwise be obscured in traditional visualizations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "For many applications involving time series data, people are often interested in the changes of item values over time as well as their ranking changes. For example, people search many words via search engines like Google and Bing every day. Analysts are interested in both the absolute searching number for each word as well as their relative rankings. Both sets of statistics may change over time. For very large time series data with thousands of items, how to visually present ranking changes is an interesting challenge. In this paper, we propose RankExplorer, a novel visualization method based on ThemeRiver to reveal the ranking changes. Our method consists of four major components: 1) a segmentation method which partitions a large set of time series curves into a manageable number of ranking categories; 2) an extended ThemeRiver view with embedded color bars and changing glyphs to show the evolution of aggregation values related to each ranking category over time as well as the content changes in each ranking category; 3) a trend curve to show the degree of ranking changes over time; 4) rich user interactions to support interactive exploration of ranking changes. We have applied our method to some real time series data and the case studies demonstrate that our method can reveal the underlying patterns related to ranking changes which might otherwise be obscured in traditional visualizations.",
"title": "RankExplorer: Visualization of Ranking Changes in Large Time Series Data",
"normalizedTitle": "RankExplorer: Visualization of Ranking Changes in Large Time Series Data",
"fno": "ttg2012122669",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Time Series",
"Data Visualisation",
"Search Engines",
"Interactive Exploration",
"Rank Explorer",
"Ranking Change Visualization",
"Time Series Data",
"Search Engine",
"Google",
"Bing",
"Segmentation Method",
"Time Series Curve",
"Ranking Category",
"Extended Theme River View",
"Embedded Color Bars",
"Changing Glyph",
"User Interaction",
"Image Color Analysis",
"Time Series Analysis",
"Data Visualization",
"Market Research",
"Encoding",
"Interaction Techniques",
"Time Series Data",
"Ranking Change",
"Themeriver"
],
"authors": [
{
"givenName": null,
"surname": "Conglei Shi",
"fullName": "Conglei Shi",
"affiliation": "Hong Kong Univ. of Sci. & Technol., Hong Kong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Weiwei Cui",
"fullName": "Weiwei Cui",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Shixia Liu",
"fullName": "Shixia Liu",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Panpan Xu",
"fullName": "Panpan Xu",
"affiliation": "Hong Kong Univ. of Sci. & Technol., Hong Kong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Wei Chen",
"fullName": "Wei Chen",
"affiliation": "Zhe Jiang Univ., Lin'An, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Huamin Qu",
"fullName": "Huamin Qu",
"affiliation": "Hong Kong Univ. of Sci. & Technol., Hong Kong, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2669-2678",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/synasc/2008/3523/0/3523a507",
"title": "An Evolutionary Approach for Modeling Time Series",
"doi": null,
"abstractUrl": "/proceedings-article/synasc/2008/3523a507/12OmNAlvHzy",
"parentPublication": {
"id": "proceedings/synasc/2008/3523/0",
"title": "2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/01532148",
"title": "Importance-driven visualization layouts for large time series data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/01532148/12OmNBkfRme",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/27900027",
"title": "Importance-Driven Visualization Layouts for Large Time Series Data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/27900027/12OmNs0C9EK",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbrn/2008/3361/0/3361a165",
"title": "Selecting Neural Network Forecasting Models Using the Zoomed-Ranking Approach",
"doi": null,
"abstractUrl": "/proceedings-article/sbrn/2008/3361a165/12OmNx5GU7u",
"parentPublication": {
"id": "proceedings/sbrn/2008/3361/0",
"title": "Neural Networks, Brazilian Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/his/2004/2291/0/22910366",
"title": "Selection of Time Series Forecasting Models based on Performance Information",
"doi": null,
"abstractUrl": "/proceedings-article/his/2004/22910366/12OmNx7G61Q",
"parentPublication": {
"id": "proceedings/his/2004/2291/0",
"title": "Hybrid Intelligent Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2017/02/mcg2017020042",
"title": "Visualizing Rank Time Series of Wikipedia Top-Viewed Pages",
"doi": null,
"abstractUrl": "/magazine/cg/2017/02/mcg2017020042/13rRUxcsYRm",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/12/08267086",
"title": "MultiStream: A Multiresolution Streamgraph Approach to Explore Hierarchical Time Series",
"doi": null,
"abstractUrl": "/journal/tg/2018/12/08267086/14H4WLS3iMM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issre/2022/5132/0/513200a366",
"title": "Identifying Erroneous Software Changes through Self-Supervised Contrastive Learning on Time Series Data",
"doi": null,
"abstractUrl": "/proceedings-article/issre/2022/513200a366/1JhTDKwxQfm",
"parentPublication": {
"id": "proceedings/issre/2022/5132/0",
"title": "2022 IEEE 33rd International Symposium on Software Reliability Engineering (ISSRE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2019/4896/0/489600b110",
"title": "A Pattern-Based Mining System for Exploring Displacement Field Time Series",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2019/489600b110/1gAwSgtF83u",
"parentPublication": {
"id": "proceedings/icdmw/2019/4896/0",
"title": "2019 International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006559",
"title": "MTSAD: Multivariate Time Series Abnormality Detection and Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006559/1hJs2odJYWs",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012122659",
"articleId": "13rRUILtJzy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122679",
"articleId": "13rRUwhHcQR",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRHe",
"name": "ttg2012122669s1.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012122669s1.mov",
"extension": "mov",
"size": "19.3 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBhpS2A",
"title": "July",
"year": "2013",
"issueNum": "07",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyogGA9",
"doi": "10.1109/TVCG.2012.322",
"abstract": "As people continue to author and share increasing amounts of information in social media, the opportunity to leverage such information for relationship discovery tasks increases. In this paper, we describe a set of systems that mine, aggregate, and infer a social graph from social media inside an enterprise, resulting in over 73 million relationships between 450,000 people. We then describe SaNDVis, a novel visual analytics tool that supports people-centric tasks like expertise location, team building, and team coordination in the enterprise. We provide details of a 22-month-long, large-scale deployment to over 2,300 users from which we analyze longitudinal usage patterns, classify types of visual analytics queries and users, and extract dominant use cases from log and interview data. By integrating social position, evidence, and facets into SaNDVis, we demonstrate how users can use a visual analytics tool to reflect on existing relationships as well as build new relationships in an enterprise setting.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As people continue to author and share increasing amounts of information in social media, the opportunity to leverage such information for relationship discovery tasks increases. In this paper, we describe a set of systems that mine, aggregate, and infer a social graph from social media inside an enterprise, resulting in over 73 million relationships between 450,000 people. We then describe SaNDVis, a novel visual analytics tool that supports people-centric tasks like expertise location, team building, and team coordination in the enterprise. We provide details of a 22-month-long, large-scale deployment to over 2,300 users from which we analyze longitudinal usage patterns, classify types of visual analytics queries and users, and extract dominant use cases from log and interview data. By integrating social position, evidence, and facets into SaNDVis, we demonstrate how users can use a visual analytics tool to reflect on existing relationships as well as build new relationships in an enterprise setting.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As people continue to author and share increasing amounts of information in social media, the opportunity to leverage such information for relationship discovery tasks increases. In this paper, we describe a set of systems that mine, aggregate, and infer a social graph from social media inside an enterprise, resulting in over 73 million relationships between 450,000 people. We then describe SaNDVis, a novel visual analytics tool that supports people-centric tasks like expertise location, team building, and team coordination in the enterprise. We provide details of a 22-month-long, large-scale deployment to over 2,300 users from which we analyze longitudinal usage patterns, classify types of visual analytics queries and users, and extract dominant use cases from log and interview data. By integrating social position, evidence, and facets into SaNDVis, we demonstrate how users can use a visual analytics tool to reflect on existing relationships as well as build new relationships in an enterprise setting.",
"title": "The Longitudinal Use of SaNDVis: Visual Social Network Analytics in the Enterprise",
"normalizedTitle": "The Longitudinal Use of SaNDVis: Visual Social Network Analytics in the Enterprise",
"fno": "ttg2013071095",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Social Network Services",
"Visual Analytics",
"Tagging",
"Data Visualization",
"Blogs",
"Databases",
"Social Visualization",
"Information Discovery",
"Social Networks",
"Social Data Mining"
],
"authors": [
{
"givenName": "A.",
"surname": "Perer",
"fullName": "A. Perer",
"affiliation": "Healthcare Analytics Res. Group, IBM T.J. Watson Res. Center, Yorktown Heights, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "I.",
"surname": "Guy",
"fullName": "I. Guy",
"affiliation": "Social Technol. Group, IBM Res., Haifa, Israel",
"__typename": "ArticleAuthorType"
},
{
"givenName": "E.",
"surname": "Uziel",
"fullName": "E. Uziel",
"affiliation": "Anywhere Software, Moshav Yodfat, Israel",
"__typename": "ArticleAuthorType"
},
{
"givenName": "I.",
"surname": "Ronen",
"fullName": "I. Ronen",
"affiliation": "Social Technol. Group, IBM Res., Haifa, Israel",
"__typename": "ArticleAuthorType"
},
{
"givenName": "M.",
"surname": "Jacovi",
"fullName": "M. Jacovi",
"affiliation": "Social Technol. Group, IBM Res., Haifa, Israel",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2013-07-01 00:00:00",
"pubType": "trans",
"pages": "1095-1108",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cts/2016/2300/0/07870996",
"title": "Be the Data: Social Meetings with Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/cts/2016/07870996/12OmNAnMuEx",
"parentPublication": {
"id": "proceedings/cts/2016/2300/0",
"title": "2016 International Conference on Collaboration Technologies and Systems (CTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/edoc/2012/4785/0/4785a201",
"title": "When Social Media Meet the Enterprise",
"doi": null,
"abstractUrl": "/proceedings-article/edoc/2012/4785a201/12OmNro0I0R",
"parentPublication": {
"id": "proceedings/edoc/2012/4785/0",
"title": "2012 IEEE 16th International Enterprise Distributed Object Computing Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdew/2018/6306/0/630601a001",
"title": "Context Analytics: Vision, Architecture, Opportunity",
"doi": null,
"abstractUrl": "/proceedings-article/icdew/2018/630601a001/12OmNwCaCvD",
"parentPublication": {
"id": "proceedings/icdew/2018/6306/0",
"title": "2018 IEEE 34th International Conference on Data Engineering Workshops (ICDEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2010/06/mex2010060013",
"title": "Social Media Analytics and Intelligence",
"doi": null,
"abstractUrl": "/magazine/ex/2010/06/mex2010060013/13rRUytF45s",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122032",
"title": "Visual Analytics for Multimodal Social Network Analysis: A Design Study with Social Scientists",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122032/13rRUyuegp5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020661",
"title": "PROBER: A System for Real-time Propaganda Behavior Analytics on Social Media and Web Data Streams",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020661/1KfT7j4noOs",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdatase/2022/6523/0/652300a013",
"title": "Intellectual Social Scanning and Analytics platform",
"doi": null,
"abstractUrl": "/proceedings-article/bigdatase/2022/652300a013/1Lu4gPafMqI",
"parentPublication": {
"id": "proceedings/bigdatase/2022/6523/0",
"title": "2022 IEEE 16th International Conference on Big Data Science and Engineering (BigDataSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2019/7474/0/747400a350",
"title": "Towards Longitudinal Analytics on Social Media Data",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2019/747400a350/1aDT0SjPBte",
"parentPublication": {
"id": "proceedings/icde/2019/7474/0",
"title": "2019 IEEE 35th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/04/08984335",
"title": "PeckVis: A Visual Analytics Tool to Analyze Dominance Hierarchies in Small Groups",
"doi": null,
"abstractUrl": "/journal/tg/2020/04/08984335/1haTxOaV8eA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/10/09382844",
"title": "Interactive Visual Exploration of Longitudinal Historical Career Mobility Data",
"doi": null,
"abstractUrl": "/journal/tg/2022/10/09382844/1saZr0JHX5C",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013071078",
"articleId": "13rRUxjQyhr",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013071109",
"articleId": "13rRUy3xY2O",
"__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": "13rRUxAAST0",
"doi": "10.1109/TVCG.2009.174",
"abstract": "Despite myriad tools for visualizing data, there remains a gap between the notational efficiency of high-level visualization systems and the expressiveness and accessibility of low-level graphical systems. Powerful visualization systems may be inflexible or impose abstractions foreign to visual thinking, while graphical systems such as rendering APIs and vector-based drawing programs are tedious for complex work. We argue that an easy-to-use graphical system tailored for visualization is needed. In response, we contribute Protovis, an extensible toolkit for constructing visualizations by composing simple graphical primitives. In Protovis, designers specify visualizations as a hierarchy of marks with visual properties defined as functions of data. This representation achieves a level of expressiveness comparable to low-level graphics systems, while improving efficiency--the effort required to specify a visualization--and accessibility--the effort required to learn and modify the representation. We substantiate this claim through a diverse collection of examples and comparative analysis with popular visualization tools.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Despite myriad tools for visualizing data, there remains a gap between the notational efficiency of high-level visualization systems and the expressiveness and accessibility of low-level graphical systems. Powerful visualization systems may be inflexible or impose abstractions foreign to visual thinking, while graphical systems such as rendering APIs and vector-based drawing programs are tedious for complex work. We argue that an easy-to-use graphical system tailored for visualization is needed. In response, we contribute Protovis, an extensible toolkit for constructing visualizations by composing simple graphical primitives. In Protovis, designers specify visualizations as a hierarchy of marks with visual properties defined as functions of data. This representation achieves a level of expressiveness comparable to low-level graphics systems, while improving efficiency--the effort required to specify a visualization--and accessibility--the effort required to learn and modify the representation. We substantiate this claim through a diverse collection of examples and comparative analysis with popular visualization tools.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Despite myriad tools for visualizing data, there remains a gap between the notational efficiency of high-level visualization systems and the expressiveness and accessibility of low-level graphical systems. Powerful visualization systems may be inflexible or impose abstractions foreign to visual thinking, while graphical systems such as rendering APIs and vector-based drawing programs are tedious for complex work. We argue that an easy-to-use graphical system tailored for visualization is needed. In response, we contribute Protovis, an extensible toolkit for constructing visualizations by composing simple graphical primitives. In Protovis, designers specify visualizations as a hierarchy of marks with visual properties defined as functions of data. This representation achieves a level of expressiveness comparable to low-level graphics systems, while improving efficiency--the effort required to specify a visualization--and accessibility--the effort required to learn and modify the representation. We substantiate this claim through a diverse collection of examples and comparative analysis with popular visualization tools.",
"title": "Protovis: A Graphical Toolkit for Visualization",
"normalizedTitle": "Protovis: A Graphical Toolkit for Visualization",
"fno": "ttg2009061121",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Information Visualization",
"User Interfaces",
"Toolkits",
"2 D Graphics"
],
"authors": [
{
"givenName": "Michael",
"surname": "Bostock",
"fullName": "Michael Bostock",
"affiliation": "Stanford University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeffrey",
"surname": "Heer",
"fullName": "Jeffrey Heer",
"affiliation": "Stanford University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2009-11-01 00:00:00",
"pubType": "trans",
"pages": "1121-1128",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wvl/1990/2090/0/00128382",
"title": "A declarative formalism for specifying graphical layout",
"doi": null,
"abstractUrl": "/proceedings-article/wvl/1990/00128382/12OmNrAMF3v",
"parentPublication": {
"id": "proceedings/wvl/1990/2090/0",
"title": "Proceedings of the 1990 IEEE Workshop on Visual Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/tai/1993/4200/0/00634017",
"title": "Concrete browsing of a graphical toolkit library",
"doi": null,
"abstractUrl": "/proceedings-article/tai/1993/00634017/12OmNwDSdFf",
"parentPublication": {
"id": "proceedings/tai/1993/4200/0",
"title": "Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/1993/3752/0/00262968",
"title": "Graphical user interfacing with domain visualization for an intelligent medical tutoring system",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/1993/00262968/12OmNxXCGJO",
"parentPublication": {
"id": "proceedings/cbms/1993/3752/0",
"title": "Proceedings of the Sixth Annual 1993 IEEE Symposium Computer-Based Medical Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wvl/1990/2090/0/00128404",
"title": "Creating graphical interfaces through graphical interaction",
"doi": null,
"abstractUrl": "/proceedings-article/wvl/1990/00128404/12OmNyKrH4Z",
"parentPublication": {
"id": "proceedings/wvl/1990/2090/0",
"title": "Proceedings of the 1990 IEEE Workshop on Visual Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwssd/1996/7361/0/73610056",
"title": "Towards a formal specification method for graphical user interfaces using modularized graph grammars",
"doi": null,
"abstractUrl": "/proceedings-article/iwssd/1996/73610056/12OmNyUnEIw",
"parentPublication": {
"id": "proceedings/iwssd/1996/7361/0",
"title": "Software Specification and Design, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2003/7983/0/01227485",
"title": "A graphical language for defining views in object oriented databases",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2003/01227485/12OmNyjccy1",
"parentPublication": {
"id": "proceedings/aiccsa/2003/7983/0",
"title": "ACS/IEEE International Conference on Computer Systems and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122301",
"title": "D³ Data-Driven Documents",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122301/13rRUwvT9gr",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061149",
"title": "Declarative Language Design for Interactive Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061149/13rRUxAAT0M",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2004/08/e0535",
"title": "Toolkit Design for Interactive Structured Graphics",
"doi": null,
"abstractUrl": "/journal/ts/2004/08/e0535/13rRUxjQyiU",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09557192",
"title": "Gosling: A Grammar-based Toolkit for Scalable and Interactive Genomics Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09557192/1xlw1UFWxDa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009061113",
"articleId": "13rRUy0HYRi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2009061129",
"articleId": "13rRUxZ0o1r",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNySXEWP",
"title": "August",
"year": "2004",
"issueNum": "08",
"idPrefix": "ts",
"pubType": "journal",
"volume": "30",
"label": "August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjQyiU",
"doi": "10.1109/TSE.2004.44",
"abstract": "In this paper, we analyze toolkit designs for building graphical applications with rich user interfaces, comparing polylithic and monolithic toolkit-based solutions. Polylithic toolkits encourage extension by composition and follow a design philosophy similar to 3D scene graphs supported by toolkits including Java3D and OpenInventor. Monolithic toolkits, on the other hand, encourage extension by inheritance, and are more akin to 2D Graphical User Interface toolkits such as Swing or MFC. We describe Jazz (a polylithic toolkit) and Piccolo (a monolithic toolkit), each of which we built to support interactive 2D structured graphics applications in general, and Zoomable User Interface applications in particular. We examine the trade offs of each approach in terms of performance, memory requirements, and programmability. We conclude that a polylithic approach is most suitable for toolkit builders, visual design software where code is automatically generated, and application builders where there is much customization of the toolkit. Correspondingly, we find that monolithic approaches appear to be best for application builders where there is not much customization of the toolkit.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we analyze toolkit designs for building graphical applications with rich user interfaces, comparing polylithic and monolithic toolkit-based solutions. Polylithic toolkits encourage extension by composition and follow a design philosophy similar to 3D scene graphs supported by toolkits including Java3D and OpenInventor. Monolithic toolkits, on the other hand, encourage extension by inheritance, and are more akin to 2D Graphical User Interface toolkits such as Swing or MFC. We describe Jazz (a polylithic toolkit) and Piccolo (a monolithic toolkit), each of which we built to support interactive 2D structured graphics applications in general, and Zoomable User Interface applications in particular. We examine the trade offs of each approach in terms of performance, memory requirements, and programmability. We conclude that a polylithic approach is most suitable for toolkit builders, visual design software where code is automatically generated, and application builders where there is much customization of the toolkit. Correspondingly, we find that monolithic approaches appear to be best for application builders where there is not much customization of the toolkit.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we analyze toolkit designs for building graphical applications with rich user interfaces, comparing polylithic and monolithic toolkit-based solutions. Polylithic toolkits encourage extension by composition and follow a design philosophy similar to 3D scene graphs supported by toolkits including Java3D and OpenInventor. Monolithic toolkits, on the other hand, encourage extension by inheritance, and are more akin to 2D Graphical User Interface toolkits such as Swing or MFC. We describe Jazz (a polylithic toolkit) and Piccolo (a monolithic toolkit), each of which we built to support interactive 2D structured graphics applications in general, and Zoomable User Interface applications in particular. We examine the trade offs of each approach in terms of performance, memory requirements, and programmability. We conclude that a polylithic approach is most suitable for toolkit builders, visual design software where code is automatically generated, and application builders where there is much customization of the toolkit. Correspondingly, we find that monolithic approaches appear to be best for application builders where there is not much customization of the toolkit.",
"title": "Toolkit Design for Interactive Structured Graphics",
"normalizedTitle": "Toolkit Design for Interactive Structured Graphics",
"fno": "e0535",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Monolithic Toolkits",
"Polylithic Toolkits",
"Object Oriented Design",
"Composition",
"Inheritance",
"Zoomable User Interfaces ZU Is",
"Animation",
"Structured Graphics",
"Graphical User Interfaces GU Is",
"Pad",
"Jazz",
"Piccolo"
],
"authors": [
{
"givenName": "Benjamin B.",
"surname": "Bederson",
"fullName": "Benjamin B. Bederson",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jesse",
"surname": "Grosjean",
"fullName": "Jesse Grosjean",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jon",
"surname": "Meyer",
"fullName": "Jon Meyer",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2004-08-01 00:00:00",
"pubType": "trans",
"pages": "535-546",
"year": "2004",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pvg/2001/7223/0/72230129",
"title": "Jupiter: A Toolkit for Interactive Large Model Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pvg/2001/72230129/12OmNAgGweo",
"parentPublication": {
"id": "proceedings/pvg/2001/7223/0",
"title": "Parallel and Large-Data Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2016/5670/0/5670b810",
"title": "Designing for Positive User Experience in Product Design: A Qualitative Analysis of Toolkit Design Elements and Their Implications on Emotional Reactions and Perceptions",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/5670b810/12OmNAnuTmW",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apscc/2010/9396/0/05708631",
"title": "An Event Based GUI Programming Toolkit for Embedded System",
"doi": null,
"abstractUrl": "/proceedings-article/apscc/2010/05708631/12OmNCdBDJT",
"parentPublication": {
"id": "proceedings/apscc/2010/9396/0",
"title": "2010 Asia-Pacific Services Computing Conference (APSCC 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icac/2004/2114/0/01301374",
"title": "A toolkit for policy enablement in autonomic computing",
"doi": null,
"abstractUrl": "/proceedings-article/icac/2004/01301374/12OmNzmLxI6",
"parentPublication": {
"id": "proceedings/icac/2004/2114/0",
"title": "Autonomic Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/03/08468065",
"title": "P4: Portable Parallel Processing Pipelines for Interactive Information Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2020/03/08468065/13HFz2XZAUp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1996/06/e0390",
"title": "A Component- and Message-Based Architectural Style for GUI Software",
"doi": null,
"abstractUrl": "/journal/ts/1996/06/e0390/13rRUwkxc6Z",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122301",
"title": "D³ Data-Driven Documents",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122301/13rRUwvT9gr",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061121",
"title": "Protovis: A Graphical Toolkit for Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061121/13rRUxAAST0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061149",
"title": "Declarative Language Design for Interactive Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061149/13rRUxAAT0M",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/1989/01/s1015",
"title": "User-Interface Tools: Introduction and Survey",
"doi": null,
"abstractUrl": "/magazine/so/1989/01/s1015/13rRUxASu9w",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "e0521",
"articleId": "13rRUEgarpm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "e0547",
"articleId": "13rRUx0xPjX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyRxFiL",
"title": "May/June",
"year": "2008",
"issueNum": "03",
"idPrefix": "ic",
"pubType": "magazine",
"volume": "12",
"label": "May/June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwcS1Ba",
"doi": "10.1109/MIC.2008.55",
"abstract": "Synthetic data sets can be useful for repeatable regression testing and for providing realistic — but not real — data to third parties for testing new software. In some cases, it is desirable that the synthetic data set be realistic, preserving various properties of the original data. Several synthetic data generators generate data that superficially matches known characteristics of data. This paper shows how to generate data that exhibits some of the same hidden patterns that can be discovered by data mining algorithms, in particular, decision tree patterns.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Synthetic data sets can be useful for repeatable regression testing and for providing realistic — but not real — data to third parties for testing new software. In some cases, it is desirable that the synthetic data set be realistic, preserving various properties of the original data. Several synthetic data generators generate data that superficially matches known characteristics of data. This paper shows how to generate data that exhibits some of the same hidden patterns that can be discovered by data mining algorithms, in particular, decision tree patterns.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Synthetic data sets can be useful for repeatable regression testing and for providing realistic — but not real — data to third parties for testing new software. In some cases, it is desirable that the synthetic data set be realistic, preserving various properties of the original data. Several synthetic data generators generate data that superficially matches known characteristics of data. This paper shows how to generate data that exhibits some of the same hidden patterns that can be discovered by data mining algorithms, in particular, decision tree patterns.",
"title": "Generating Synthetic Data to Match Data Mining Patterns",
"normalizedTitle": "Generating Synthetic Data to Match Data Mining Patterns",
"fno": "mic2008030078",
"hasPdf": true,
"idPrefix": "ic",
"keywords": [
"Synthetic Data Generation",
"Data Mining",
"Decision Trees"
],
"authors": [
{
"givenName": "Josh",
"surname": "Eno",
"fullName": "Josh Eno",
"affiliation": "University of Arkansas",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Craig W.",
"surname": "Thompson",
"fullName": "Craig W. Thompson",
"affiliation": "University of Arkansas",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2008-05-01 00:00:00",
"pubType": "mags",
"pages": "78-82",
"year": "2008",
"issn": "1089-7801",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/his/2008/3326/0/3326a507",
"title": "Genetic-Based Synthetic Data Sets for the Analysis of Classifiers Behavior",
"doi": null,
"abstractUrl": "/proceedings-article/his/2008/3326a507/12OmNBsLPdu",
"parentPublication": {
"id": "proceedings/his/2008/3326/0",
"title": "Hybrid Intelligent Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ichi/2013/5089/0/5089a493",
"title": "Perturbed Gibbs Samplers for Generating Large-Scale Privacy-Safe Synthetic Health Data",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2013/5089a493/12OmNvFHfFo",
"parentPublication": {
"id": "proceedings/ichi/2013/5089/0",
"title": "2013 IEEE International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2010/8420/0/05720343",
"title": "Generating Facial Ground Truth with Synthetic Faces",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2010/05720343/12OmNxdVgVR",
"parentPublication": {
"id": "proceedings/sibgrapi/2010/8420/0",
"title": "2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2009/3725/0/3725b295",
"title": "Improving the Enrollment in Dynamic Signature Verfication with Synthetic Samples",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2009/3725b295/12OmNyQYt3t",
"parentPublication": {
"id": "proceedings/icdar/2009/3725/0",
"title": "2009 10th International Conference on Document Analysis and Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsea/2009/3777/0/3777a169",
"title": "Testing of Image Processing Algorithms on Synthetic Data",
"doi": null,
"abstractUrl": "/proceedings-article/icsea/2009/3777a169/12OmNzd7bh1",
"parentPublication": {
"id": "proceedings/icsea/2009/3777/0",
"title": "Software Engineering Advances, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2009/03/mcg2009030018",
"title": "Generating Synthetic Syndromic-Surveillance Data for Evaluating Visual-Analytics Techniques",
"doi": null,
"abstractUrl": "/magazine/cg/2009/03/mcg2009030018/13rRUxBrGjm",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122317",
"title": "Synthetic Generation of High-Dimensional Datasets",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122317/13rRUxjQyvf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2021/3902/0/09671623",
"title": "Generating Topic-Preserving Synthetic News",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2021/09671623/1A8joLTQBwY",
"parentPublication": {
"id": "proceedings/big-data/2021/3902/0",
"title": "2021 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020409",
"title": "Vehicle orientation detection based on synthetic data with image-to-image translation and domain adaptation",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020409/1KfRSXA8H72",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2019/2286/0/228600a126",
"title": "Generating and Evaluating Synthetic UK Primary Care Data: Preserving Data Utility & Patient Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2019/228600a126/1cdNZZBJaV2",
"parentPublication": {
"id": "proceedings/cbms/2019/2286/0",
"title": "2019 IEEE 32nd International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mic2008030074",
"articleId": "13rRUyYSWoJ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mic2008030083",
"articleId": "13rRUyeCkdZ",
"__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": "13rRUIJuxpr",
"doi": "10.1109/TVCG.2009.108",
"abstract": "A common goal in graph visualization research is the design of novel techniques for displaying an overview of an entire graph. However, there are many situations where such an overview is not relevant or practical for users, as analyzing the global structure may not be related to the main task of the users that have semi-specific information needs. Furthermore, users accessing large graph databases through an online connection or users running on less powerful (mobile) hardware simply do not have the resources needed to compute these overviews. In this paper, we advocate an interaction model that allows users to remotely browse the immediate context graph around a specific node of interest. We show how Furnas’ original degree of interest function can be adapted from trees to graphs and how we can use this metric to extract useful contextual subgraphs, control the complexity of the generated visualization and direct users to interesting datapoints in the context. We demeffectiveness of our approach with an exploration of a dense online database containing over 3 million legal citations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A common goal in graph visualization research is the design of novel techniques for displaying an overview of an entire graph. However, there are many situations where such an overview is not relevant or practical for users, as analyzing the global structure may not be related to the main task of the users that have semi-specific information needs. Furthermore, users accessing large graph databases through an online connection or users running on less powerful (mobile) hardware simply do not have the resources needed to compute these overviews. In this paper, we advocate an interaction model that allows users to remotely browse the immediate context graph around a specific node of interest. We show how Furnas’ original degree of interest function can be adapted from trees to graphs and how we can use this metric to extract useful contextual subgraphs, control the complexity of the generated visualization and direct users to interesting datapoints in the context. We demeffectiveness of our approach with an exploration of a dense online database containing over 3 million legal citations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A common goal in graph visualization research is the design of novel techniques for displaying an overview of an entire graph. However, there are many situations where such an overview is not relevant or practical for users, as analyzing the global structure may not be related to the main task of the users that have semi-specific information needs. Furthermore, users accessing large graph databases through an online connection or users running on less powerful (mobile) hardware simply do not have the resources needed to compute these overviews. In this paper, we advocate an interaction model that allows users to remotely browse the immediate context graph around a specific node of interest. We show how Furnas’ original degree of interest function can be adapted from trees to graphs and how we can use this metric to extract useful contextual subgraphs, control the complexity of the generated visualization and direct users to interesting datapoints in the context. We demeffectiveness of our approach with an exploration of a dense online database containing over 3 million legal citations.",
"title": "“Search, Show Context, Expand on Demand”: Supporting Large Graph Exploration with Degree-of-Interest",
"normalizedTitle": "“Search, Show Context, Expand on Demand”: Supporting Large Graph Exploration with Degree-of-Interest",
"fno": "ttg2009060953",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Graph Visualization",
"Network Visualization",
"Degree Of Interest",
"Legal Citation Networks",
"Focus Context"
],
"authors": [
{
"givenName": "Frank",
"surname": "van Ham",
"fullName": "Frank van Ham",
"affiliation": "IBM-ILOG Research in Gentilly, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Adam",
"surname": "Perer",
"fullName": "Adam Perer",
"affiliation": "IBM Research in Haifa, Israel",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2009-11-01 00:00:00",
"pubType": "trans",
"pages": "953-960",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dbta/2009/3604/0/3604a418",
"title": "A Method for Storing Historical Stream Data Based on Degree of Interest",
"doi": null,
"abstractUrl": "/proceedings-article/dbta/2009/3604a418/12OmNrY3LDg",
"parentPublication": {
"id": "proceedings/dbta/2009/3604/0",
"title": "2009 First International Workshop on Database Technology and Applications, DBTA",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/jcdl/2014/5569/0/06970213",
"title": "CKGHV: a comprehensive knowledge graph for history visualization",
"doi": null,
"abstractUrl": "/proceedings-article/jcdl/2014/06970213/12OmNs5rkUa",
"parentPublication": {
"id": "proceedings/jcdl/2014/5569/0",
"title": "2014 IEEE/ACM Joint Conference on Digital Libraries (JCDL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2005/2397/0/23970135",
"title": "Identifying Critical Focuses in Research Domains",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2005/23970135/12OmNwF0BKw",
"parentPublication": {
"id": "proceedings/iv/2005/2397/0",
"title": "Ninth International Conference on Information Visualisation (IV'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/27900023",
"title": "Two-Tone Pseudo Coloring: Compact Visualization for One-Dimensional Data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/27900023/12OmNwnYG1z",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium 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": "trans/tg/2000/01/v0024",
"title": "Graph Visualization and Navigation in Information Visualization: A Survey",
"doi": null,
"abstractUrl": "/journal/tg/2000/01/v0024/13rRUxNW1TM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/05963661",
"title": "Coherent Time-Varying Graph Drawing with Multifocus+Context Interaction",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/05963661/13rRUxYIMUX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1998/03/v0257",
"title": "The Information Mural: A Technique for Displaying and Navigating Large Information Spaces",
"doi": null,
"abstractUrl": "/journal/tg/1998/03/v0257/13rRUxcbnCh",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440850",
"title": "Details-First, Show Context, Overview Last: Supporting Exploration of Viscous Fingers in Large-Scale Ensemble Simulations",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440850/17D45X2fUHm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/10/08673661",
"title": "Eiffel: Evolutionary Flow Map for Influence Graph Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2020/10/08673661/18LF7Q1L3na",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009060945",
"articleId": "13rRUxC0SEc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2009060961",
"articleId": "13rRUwbaqLs",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzUgd8p",
"title": "Mar.-Apr.",
"year": "2016",
"issueNum": "02",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "36",
"label": "Mar.-Apr.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwh80Jc",
"doi": "10.1109/MCG.2016.32",
"abstract": "Visualization builds on the human capacity to quickly process parallel visual inputs and to offload cognitive processes. Interactive visualizations can become interfaces between humans, their data, and the phenomena represented by the data. Such interfaces can allow for exploration, enable serendipitous discoveries, and serve as a mental metaphor to help us remember and reason about the data. This article gives a brief overview of the author's dissertation research, which is concerned with creating and evaluating novel interfaces to explore dynamic networks, supporting analysts in formulating hypotheses, and discussing proper analysis methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visualization builds on the human capacity to quickly process parallel visual inputs and to offload cognitive processes. Interactive visualizations can become interfaces between humans, their data, and the phenomena represented by the data. Such interfaces can allow for exploration, enable serendipitous discoveries, and serve as a mental metaphor to help us remember and reason about the data. This article gives a brief overview of the author's dissertation research, which is concerned with creating and evaluating novel interfaces to explore dynamic networks, supporting analysts in formulating hypotheses, and discussing proper analysis methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visualization builds on the human capacity to quickly process parallel visual inputs and to offload cognitive processes. Interactive visualizations can become interfaces between humans, their data, and the phenomena represented by the data. Such interfaces can allow for exploration, enable serendipitous discoveries, and serve as a mental metaphor to help us remember and reason about the data. This article gives a brief overview of the author's dissertation research, which is concerned with creating and evaluating novel interfaces to explore dynamic networks, supporting analysts in formulating hypotheses, and discussing proper analysis methods.",
"title": "Unfolding Dynamic Networks for Visual Exploration",
"normalizedTitle": "Unfolding Dynamic Networks for Visual Exploration",
"fno": "mcg2016020074",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Visualization",
"Data Visualization",
"Animation",
"Matrix Decomposition",
"Three Dimensional Displays",
"Layout",
"Navigation",
"Multi Piles",
"Computer Graphics",
"Information Visualization",
"Matrix Cube",
"Space Time Cube",
"Network Visualization",
"Visual Analytics",
"Dynamic Networks",
"Dynamic Graphs",
"Cubix"
],
"authors": [
{
"givenName": "Benjamin",
"surname": "Bach",
"fullName": "Benjamin Bach",
"affiliation": "Microsoft Research - Inria Joint Research Centre",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2016-03-01 00:00:00",
"pubType": "mags",
"pages": "74-82",
"year": "2016",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/asonam/2013/2240/0/06785791",
"title": "Visual exploration of academic career paths",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2013/06785791/12OmNAoUT2b",
"parentPublication": {
"id": "proceedings/asonam/2013/2240/0",
"title": "2013 International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/spire/2000/0746/0/07460017",
"title": "New Approaches to Information Management: Attribute-Centric Data Systems",
"doi": null,
"abstractUrl": "/proceedings-article/spire/2000/07460017/12OmNzBwGGy",
"parentPublication": {
"id": "proceedings/spire/2000/0746/0",
"title": "String Processing and Information Retrieval, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2014/6227/0/07042493",
"title": "Serendip: Topic model-driven visual exploration of text corpora",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042493/12OmNzC5Tn8",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192682",
"title": "Intuitive Exploration of Volumetric Data Using Dynamic Galleries",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192682/13rRUwcS1CY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08019860",
"title": "Orko: Facilitating Multimodal Interaction for Visual Exploration and Analysis of Networks",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08019860/13rRUx0gefo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122709",
"title": "PivotPaths: Strolling through Faceted Information Spaces",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122709/13rRUxASuGi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/05/06658746",
"title": "GraphDiaries: Animated Transitions and Temporal Navigation for Dynamic Networks",
"doi": null,
"abstractUrl": "/journal/tg/2014/05/06658746/13rRUxBrGgZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192717",
"title": "Reducing Snapshots to Points: A Visual Analytics Approach to Dynamic Network Exploration",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192717/13rRUyp7tWY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2018/5520/0/552000b208",
"title": "Interactive Visual Data Exploration with Subjective Feedback: An Information-Theoretic Approach",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2018/552000b208/14Fq106Bo4R",
"parentPublication": {
"id": "proceedings/icde/2018/5520/0",
"title": "2018 IEEE 34th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222301",
"title": "The Effectiveness of Interactive Visualization Techniques for Time Navigation of Dynamic Graphs on Large Displays",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222301/1nTrDxA09TG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2016020068",
"articleId": "13rRUB7a13H",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2016020083",
"articleId": "13rRUxBa5zP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1E0Ndbo3sw8",
"title": "May-June",
"year": "2022",
"issueNum": "03",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "42",
"label": "May-June",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1DUa6nnWNsQ",
"doi": "10.1109/MCG.2022.3167044",
"abstract": "The rapid development of high-performance computing systems has led to a rapid increase in the speed of flow field simulation calculations. However, large-scale simulation output data lead to storage bottlenecks and inefficient data analysis. In this work, we used in situ visualization to process the simulation analysis of large-scale flow fields. Combined with narrative visual analysis, we designed a large-scale ocean flow field eddy evolution analysis system based on in situ visualization. Our system can generate high-precision eddy streamline structures in real time and supports eddy statistical analysis and tracking analysis at different ocean regional scales. Through the case data analysis of ocean simulation, we demonstrated the efficiency and effectiveness of the system.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The rapid development of high-performance computing systems has led to a rapid increase in the speed of flow field simulation calculations. However, large-scale simulation output data lead to storage bottlenecks and inefficient data analysis. In this work, we used in situ visualization to process the simulation analysis of large-scale flow fields. Combined with narrative visual analysis, we designed a large-scale ocean flow field eddy evolution analysis system based on in situ visualization. Our system can generate high-precision eddy streamline structures in real time and supports eddy statistical analysis and tracking analysis at different ocean regional scales. Through the case data analysis of ocean simulation, we demonstrated the efficiency and effectiveness of the system.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The rapid development of high-performance computing systems has led to a rapid increase in the speed of flow field simulation calculations. However, large-scale simulation output data lead to storage bottlenecks and inefficient data analysis. In this work, we used in situ visualization to process the simulation analysis of large-scale flow fields. Combined with narrative visual analysis, we designed a large-scale ocean flow field eddy evolution analysis system based on in situ visualization. Our system can generate high-precision eddy streamline structures in real time and supports eddy statistical analysis and tracking analysis at different ocean regional scales. Through the case data analysis of ocean simulation, we demonstrated the efficiency and effectiveness of the system.",
"title": "Narrative <italic>In Situ</italic> Visual Analysis for Large-Scale Ocean Eddy Evolution",
"normalizedTitle": "Narrative In Situ Visual Analysis for Large-Scale Ocean Eddy Evolution",
"fno": "09787979",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"High Performance Computing",
"Visualization",
"Data Visualization",
"Data Models",
"Computational Modeling",
"Analytical Models",
"Real Time Systems"
],
"authors": [
{
"givenName": "Xiaoyang",
"surname": "Han",
"fullName": "Xiaoyang Han",
"affiliation": "Computer Network Information Center, Chinese Academy of Sciences, University of Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaomin",
"surname": "Yu",
"fullName": "Xiaomin Yu",
"affiliation": "Computer Network Information Center, Chinese Academy of Sciences, University of Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guan",
"surname": "Li",
"fullName": "Guan Li",
"affiliation": "Computer Network Information Center, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jun",
"surname": "Liu",
"fullName": "Jun Liu",
"affiliation": "Computer Network Information Center, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ying",
"surname": "Zhao",
"fullName": "Ying Zhao",
"affiliation": "Central South University, Changsha, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guihua",
"surname": "Shan",
"fullName": "Guihua Shan",
"affiliation": "Computer Network Information Center, Chinese Academy of Sciences, University of Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2022-05-01 00:00:00",
"pubType": "mags",
"pages": "65-73",
"year": "2022",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ettandgrs/2008/3563/1/3563a373",
"title": "A Dissymmetrical Ocean Mesoscale Eddy Model for Remote Sensing Data Assimilation",
"doi": null,
"abstractUrl": "/proceedings-article/ettandgrs/2008/3563a373/12OmNBsLPcJ",
"parentPublication": {
"id": "proceedings/ettandgrs/2008/3563/1",
"title": "Education Technology and Training & Geoscience and Remote Sensing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192723",
"title": "In Situ Eddy Analysis in a High-Resolution Ocean Climate Model",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192723/13rRUwghd9b",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2022/02/09722973",
"title": "<italic>In Situ</italic> Visualization of Regional-Scale Natural Hazards With Galaxy and Material Point Method",
"doi": null,
"abstractUrl": "/magazine/cs/2022/02/09722973/1BmTaqFQLU4",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2022/8106/0/810600a538",
"title": "Colza: Enabling Elastic In Situ Visualization for High-performance Computing Simulations",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2022/810600a538/1F1W9cR1VcI",
"parentPublication": {
"id": "proceedings/ipdps/2022/8106/0",
"title": "2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2022/9156/0/09966389",
"title": "Toward Bi-directional In Situ Visualization and Analysis of Blood Flow Simulations With Dynamic Deforming Walls",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2022/09966389/1IT0Emekw48",
"parentPublication": {
"id": "proceedings/ldav/2022/9156/0",
"title": "2022 IEEE 12th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600g384",
"title": "Computer Vision for Ocean Eddy Detection in Infrared Imagery",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600g384/1KxVBWTVXZC",
"parentPublication": {
"id": "proceedings/wacv/2023/9346/0",
"title": "2023 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icftic/2022/2195/0/10075163",
"title": "Research on ocean eddy detection method based on SAR images",
"doi": null,
"abstractUrl": "/proceedings-article/icftic/2022/10075163/1LRl4GJnm9y",
"parentPublication": {
"id": "proceedings/icftic/2022/2195/0",
"title": "2022 4th International Conference on Frontiers Technology of Information and Computer (ICFTIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2018/6873/0/08739172",
"title": "In Situ Visualization and Analysis to Design Large Scale Experiments in Computational Fluid Dynamics",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2018/08739172/1b1xbwkm7te",
"parentPublication": {
"id": "proceedings/ldav/2018/6873/0",
"title": "2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2021/03/09388894",
"title": "<italic>In Situ</italic> Visualization With Temporal Caching",
"doi": null,
"abstractUrl": "/magazine/cs/2021/03/09388894/1smZR2zRFyo",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2021/3283/0/328300a088",
"title": "Instrumenting Multiphysics Blood Flow Simulation Codes for In Situ Visualization and Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2021/328300a088/1zdPxJcfyNO",
"parentPublication": {
"id": "proceedings/ldav/2021/3283/0",
"title": "2021 IEEE 11th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09769955",
"articleId": "1D8dd1LL9fy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09745375",
"articleId": "1CagLGveRxK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqESuij",
"title": "May",
"year": "2012",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuby",
"doi": "10.1109/TVCG.2011.104",
"abstract": "Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational data sets (e.g., transportation networks, citation networks, or social networks). Graphs with dense edges, however, are difficult to visualize because fast layout and good clarity are not always easily achieved. When the number of edges is large, edge bundling can be used to improve the clarity, but in many cases, the edges could be still too cluttered to permit correct interpretation of the relations between nodes. In this paper, we present an ambiguity-free edge-bundling method especially for improving local detailed view of a complex graph. Our method makes more efficient use of display space and supports detail-on-demand viewing through an interactive interface. We demonstrate the effectiveness of our method with public coauthorship network data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational data sets (e.g., transportation networks, citation networks, or social networks). Graphs with dense edges, however, are difficult to visualize because fast layout and good clarity are not always easily achieved. When the number of edges is large, edge bundling can be used to improve the clarity, but in many cases, the edges could be still too cluttered to permit correct interpretation of the relations between nodes. In this paper, we present an ambiguity-free edge-bundling method especially for improving local detailed view of a complex graph. Our method makes more efficient use of display space and supports detail-on-demand viewing through an interactive interface. We demonstrate the effectiveness of our method with public coauthorship network data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational data sets (e.g., transportation networks, citation networks, or social networks). Graphs with dense edges, however, are difficult to visualize because fast layout and good clarity are not always easily achieved. When the number of edges is large, edge bundling can be used to improve the clarity, but in many cases, the edges could be still too cluttered to permit correct interpretation of the relations between nodes. In this paper, we present an ambiguity-free edge-bundling method especially for improving local detailed view of a complex graph. Our method makes more efficient use of display space and supports detail-on-demand viewing through an interactive interface. We demonstrate the effectiveness of our method with public coauthorship network data.",
"title": "Ambiguity-Free Edge-Bundling for Interactive Graph Visualization",
"normalizedTitle": "Ambiguity-Free Edge-Bundling for Interactive Graph Visualization",
"fno": "ttg2012050810",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Graph Theory",
"Data Visualisation",
"Dense Graph Edge",
"Ambiguity Free Edge Bundling Method",
"Interactive Graph Visualization",
"Global Structural Adjacency Information",
"Local Adjacency Information",
"Relational Data Set",
"Complex Graph",
"Display Space",
"Detail On Demand Viewing",
"Interactive Interface",
"Public Coauthorship Network Data",
"Transportation Network",
"Citation Network",
"Social Network",
"Image Edge Detection",
"Visualization",
"Layout",
"Clutter",
"Data Visualization",
"Routing",
"Social Network Services",
"Interactive Navigation",
"Graph Visualization",
"Network Visualization",
"Edge Ambiguity",
"Edge Congestion",
"Edge Bundling",
"Detail On Demand"
],
"authors": [
{
"givenName": null,
"surname": "Sheng-Jie Luo",
"fullName": "Sheng-Jie Luo",
"affiliation": "Nat. Taiwan Univ., Taipei, Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Chun-Liang Liu",
"fullName": "Chun-Liang Liu",
"affiliation": "Nat. Taiwan Univ., Taipei, Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Bing-Yu Chen",
"fullName": "Bing-Yu Chen",
"affiliation": "Nat. Taiwan Univ., Taipei, Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Kwan-Liu Ma",
"fullName": "Kwan-Liu Ma",
"affiliation": "Dept. of Comput. Sci., Univ. of California, Davis, CA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2012-05-01 00:00:00",
"pubType": "trans",
"pages": "810-821",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2015/6879/0/07156354",
"title": "Attribute-driven edge bundling for general graphs with applications in trail analysis",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156354/12OmNCaLEnG",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2016/1451/0/07465267",
"title": "Multilayer graph edge bundling",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2016/07465267/12OmNCbCrKh",
"parentPublication": {
"id": "proceedings/pacificvis/2016/1451/0",
"title": "2016 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2011/0868/0/06004087",
"title": "Edge Routing and Bundling for Graphs with Fixed Node Positions",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2011/06004087/12OmNqFrGu2",
"parentPublication": {
"id": "proceedings/iv/2011/0868/0",
"title": "2011 15th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2011/935/0/05742389",
"title": "Multilevel agglomerative edge bundling for visualizing large graphs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742389/12OmNxj233Y",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2016/1192/0/1192a466",
"title": "Research on Network Simplification by Edge Bundling",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2016/1192a466/12OmNyQpgKZ",
"parentPublication": {
"id": "proceedings/dsc/2016/1192/0",
"title": "2016 IEEE First International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539373",
"title": "Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539373/13rRUwcS1CZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122354",
"title": "Divided Edge Bundling for Directional Network Data",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122354/13rRUzpzeB1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2022/9007/0/900700a021",
"title": "Clustering Ensemble-based Edge Bundling to Improve the Readability of Graph Drawings",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2022/900700a021/1KaH6ONvwzK",
"parentPublication": {
"id": "proceedings/iv/2022/9007/0",
"title": "2022 26th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807234",
"title": "Interactive Structure-aware Blending of Diverse Edge Bundling Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807234/1cG6kigQUVO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552919",
"title": "Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552919/1xibXgJW32U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012050797",
"articleId": "13rRUwInvl0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012050822",
"articleId": "13rRUzp02oi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesVq",
"name": "ttg2012050810s.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012050810s.zip",
"extension": "zip",
"size": "43.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwJPMX5",
"title": "Dec.",
"year": "2011",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjyX3W",
"doi": "10.1109/TVCG.2011.233",
"abstract": "In this paper, we present a novel approach for constructing bundled layouts of general graphs. As layout cues for bundles, we use medial axes, or skeletons, of edges which are similar in terms of position information. We combine edge clustering, distance fields, and 2D skeletonization to construct progressively bundled layouts for general graphs by iteratively attracting edges towards the centerlines of level sets of their distance fields. Apart from clustering, our entire pipeline is image-based with an efficient implementation in graphics hardware. Besides speed and implementation simplicity, our method allows explicit control of the emphasis on structure of the bundled layout, i.e. the creation of strongly branching (organic-like) or smooth bundles. We demonstrate our method on several large real-world graphs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present a novel approach for constructing bundled layouts of general graphs. As layout cues for bundles, we use medial axes, or skeletons, of edges which are similar in terms of position information. We combine edge clustering, distance fields, and 2D skeletonization to construct progressively bundled layouts for general graphs by iteratively attracting edges towards the centerlines of level sets of their distance fields. Apart from clustering, our entire pipeline is image-based with an efficient implementation in graphics hardware. Besides speed and implementation simplicity, our method allows explicit control of the emphasis on structure of the bundled layout, i.e. the creation of strongly branching (organic-like) or smooth bundles. We demonstrate our method on several large real-world graphs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present a novel approach for constructing bundled layouts of general graphs. As layout cues for bundles, we use medial axes, or skeletons, of edges which are similar in terms of position information. We combine edge clustering, distance fields, and 2D skeletonization to construct progressively bundled layouts for general graphs by iteratively attracting edges towards the centerlines of level sets of their distance fields. Apart from clustering, our entire pipeline is image-based with an efficient implementation in graphics hardware. Besides speed and implementation simplicity, our method allows explicit control of the emphasis on structure of the bundled layout, i.e. the creation of strongly branching (organic-like) or smooth bundles. We demonstrate our method on several large real-world graphs.",
"title": "Skeleton-Based Edge Bundling for Graph Visualization",
"normalizedTitle": "Skeleton-Based Edge Bundling for Graph Visualization",
"fno": "ttg2011122364",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Graph Layouts",
"Edge Bundles",
"Image Based Information Visualization"
],
"authors": [
{
"givenName": "Ozan",
"surname": "Ersoy",
"fullName": "Ozan Ersoy",
"affiliation": "University of Groningen, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christophe",
"surname": "Hurter",
"fullName": "Christophe Hurter",
"affiliation": "DGAC/DSNA, Toulouse, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fernando",
"surname": "Paulovich",
"fullName": "Fernando Paulovich",
"affiliation": "University of São Paulo, São Carlos/SP, Brazil",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gabriel",
"surname": "Cantareiro",
"fullName": "Gabriel Cantareiro",
"affiliation": "University of São Paulo, São Carlos/SP, Brazil",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alex",
"surname": "Telea",
"fullName": "Alex Telea",
"affiliation": "University of Groningen, The Netherlands",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2011-12-01 00:00:00",
"pubType": "trans",
"pages": "2364-2373",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2015/6879/0/07156354",
"title": "Attribute-driven edge bundling for general graphs with applications in trail analysis",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156354/12OmNCaLEnG",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apvis/2007/0808/0/04126224",
"title": "Analysis of a high-dimensional approach to interactive graph drawing",
"doi": null,
"abstractUrl": "/proceedings-article/apvis/2007/04126224/12OmNwcCILb",
"parentPublication": {
"id": "proceedings/apvis/2007/0808/0",
"title": "Asia-Pacific Symposium on Visualisation 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2011/935/0/05742389",
"title": "Multilevel agglomerative edge bundling for visualizing large graphs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742389/12OmNxj233Y",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apvis/2007/0808/0/04126231",
"title": "Level-of-detail visualization of clustered graph layouts",
"doi": null,
"abstractUrl": "/proceedings-article/apvis/2007/04126231/12OmNzYeARq",
"parentPublication": {
"id": "proceedings/apvis/2007/0808/0",
"title": "Asia-Pacific Symposium on Visualisation 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2016/8942/0/8942a094",
"title": "On Edge Bundling and Node Layout for Mutually Connected Directed Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2016/8942a094/12OmNzwZ6qg",
"parentPublication": {
"id": "proceedings/iv/2016/8942/0",
"title": "2016 20th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192715",
"title": "BiSet: Semantic Edge Bundling with Biclusters for Sensemaking",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192715/13rRUNvgz9T",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/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/tg/2017/01/07539373",
"title": "Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539373/13rRUwcS1CZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/05/ttg2012050810",
"title": "Ambiguity-Free Edge-Bundling for Interactive Graph Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2012/05/ttg2012050810/13rRUxASuby",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122354",
"title": "Divided Edge Bundling for Directional Network Data",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122354/13rRUzpzeB1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011122354",
"articleId": "13rRUzpzeB1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011122374",
"articleId": "13rRUzp02oh",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRWb",
"name": "ttg2011122364s1.avi",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2011122364s1.avi",
"extension": "avi",
"size": "33.8 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUyv53Fu",
"doi": "10.1109/TVCG.2016.2534519",
"abstract": "Edge concentration in dense bipartite graphs is a technique for reducing the numbers of edges and edge crossings in graph drawings. The conventional method proposed by Newbery is designed to reduce the number of edge crossings; however, it does not always reduce the number of edges. Reducing the number of edges is also an important factor for improving the readability of graphs. However, no edge concentration method with the explicit purpose of minimizing the number of edges has previously been studied. In this study, we propose a novel, efficient heuristic method for minimizing the number of edges during edge concentration. We demonstrate the efficiency of the proposed method via a comparison using randomly generated graphs. We find that Newbery’s method fails to reduce the number of edges when the number of vertices is large. By contrast, the proposed method achieves an average compression ratio of 47 to 82 percent for all generated graph groups. We also present a real-world application of the proposed method using a causality network of biological data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Edge concentration in dense bipartite graphs is a technique for reducing the numbers of edges and edge crossings in graph drawings. The conventional method proposed by Newbery is designed to reduce the number of edge crossings; however, it does not always reduce the number of edges. Reducing the number of edges is also an important factor for improving the readability of graphs. However, no edge concentration method with the explicit purpose of minimizing the number of edges has previously been studied. In this study, we propose a novel, efficient heuristic method for minimizing the number of edges during edge concentration. We demonstrate the efficiency of the proposed method via a comparison using randomly generated graphs. We find that Newbery’s method fails to reduce the number of edges when the number of vertices is large. By contrast, the proposed method achieves an average compression ratio of 47 to 82 percent for all generated graph groups. We also present a real-world application of the proposed method using a causality network of biological data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Edge concentration in dense bipartite graphs is a technique for reducing the numbers of edges and edge crossings in graph drawings. The conventional method proposed by Newbery is designed to reduce the number of edge crossings; however, it does not always reduce the number of edges. Reducing the number of edges is also an important factor for improving the readability of graphs. However, no edge concentration method with the explicit purpose of minimizing the number of edges has previously been studied. In this study, we propose a novel, efficient heuristic method for minimizing the number of edges during edge concentration. We demonstrate the efficiency of the proposed method via a comparison using randomly generated graphs. We find that Newbery’s method fails to reduce the number of edges when the number of vertices is large. By contrast, the proposed method achieves an average compression ratio of 47 to 82 percent for all generated graph groups. We also present a real-world application of the proposed method using a causality network of biological data.",
"title": "Minimizing the Number of Edges via Edge Concentration in Dense Layered Graphs",
"normalizedTitle": "Minimizing the Number of Edges via Edge Concentration in Dense Layered Graphs",
"fno": "07422136",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Bipartite Graph",
"Semantics",
"Data Visualization",
"Visualization",
"Software",
"Heuristic Algorithms",
"Biology",
"Layered Drawing",
"Graph Drawing",
"Edge Concentration",
"Layered Drawing",
"Graph Drawing",
"Edge Concentration"
],
"authors": [
{
"givenName": "Yosuke",
"surname": "Onoue",
"fullName": "Yosuke Onoue",
"affiliation": "Department of Electrical Engineering, Graduate School of Engineering, Kyoto University, Kyoto, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nobuyuki",
"surname": "Kukimoto",
"fullName": "Nobuyuki Kukimoto",
"affiliation": "Center for the Promotion of Interdisciplinary Education and Research, Kyoto University, Kyoto, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Naohisa",
"surname": "Sakamoto",
"fullName": "Naohisa Sakamoto",
"affiliation": "Department of Computational Science, Graduate School of System Informatics, Kobe University, Kobe, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Koji",
"surname": "Koyamada",
"fullName": "Koji Koyamada",
"affiliation": "Academic Center for Computing and Media Studies, Kyoto University, Kyoto, Japan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2016-06-01 00:00:00",
"pubType": "trans",
"pages": "1652-1661",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cso/2011/4335/0/4335a868",
"title": "Remarks on the Removable Edges of a Spectial Network",
"doi": null,
"abstractUrl": "/proceedings-article/cso/2011/4335a868/12OmNxdm4Dn",
"parentPublication": {
"id": "proceedings/cso/2011/4335/0",
"title": "2011 Fourth International Joint Conference on Computational Sciences and Optimization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2017/5738/0/08031597",
"title": "Quasi-biclique edge concentration: A visual analytics method for biclustering",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031597/12OmNyQGSf7",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1988/0862/0/00196237",
"title": "Refining edges detected by a LoG operator",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1988/00196237/12OmNylboEs",
"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/iccvw/2013/3022/0/3022a578",
"title": "Which Edges Matter?",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2013/3022a578/12OmNyr8Yuk",
"parentPublication": {
"id": "proceedings/iccvw/2013/3022/0",
"title": "2013 IEEE International Conference on Computer Vision Workshops (ICCVW)",
"__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/tg/2012/12/ttg2012122449",
"title": "A User Study on Curved Edges in Graph Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122449/13rRUxASuhx",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1989/01/i0043",
"title": "Authenticating Edges Produced by Zero-Crossing Algorithms",
"doi": null,
"abstractUrl": "/journal/tp/1989/01/i0043/13rRUxCitz9",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2004/04/i0479",
"title": "Layered Motion Segmentation and Depth Ordering by Tracking Edges",
"doi": null,
"abstractUrl": "/journal/tp/2004/04/i0479/13rRUy2YLTR",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/5555/01/10093949",
"title": "Splitting Vertices in 2-Layer Graph Drawings",
"doi": null,
"abstractUrl": "/magazine/cg/5555/01/10093949/1M80M7nF2Mg",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933546",
"title": "Interactive Bicluster Aggregation in Bipartite Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933546/1fTgJv5NwT6",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07419266",
"articleId": "13rRUxD9gXM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07422137",
"articleId": "13rRUxYINfh",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1IUAvQtX5zW",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tk",
"pubType": "journal",
"volume": "35",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1u51rZ1F5ew",
"doi": "10.1109/TKDE.2021.3085758",
"abstract": "Dynamic graph embedding learns representation vectors for vertices and edges in a graph that evolves over time. We aim to capture and embed the evolution of vertices’ temporal connectivity. Existing work studies the vertices’ dynamic connection changes but neglects the time it takes for edges to evolve, failing to embed temporal linkage information into the evolution of the graph. To capture vertices’ temporal linkage evolution, we model dynamic graphs as a sequence of snapshot graphs, appending the respective timespans of edges (ToE). We co-train a linear regressor to embed ToE while inferring a common latent space for all snapshot graphs by a matrix-factorization-based model to embed vertices’ dynamic connection changes. Vertices’ temporal linkage evolution is captured as their moving trajectories within the common latent representation space. Our embedding algorithm converges quickly with our proposed training methods, which is very time efficient and scalable. Extensive evaluations on several datasets show that our model can achieve significant performance improvements, i.e., 22.98 percent on average across all datasets, over the state-of-the-art baselines in the tasks of vertex classification, static and time-aware link prediction, and ToE prediction.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Dynamic graph embedding learns representation vectors for vertices and edges in a graph that evolves over time. We aim to capture and embed the evolution of vertices’ temporal connectivity. Existing work studies the vertices’ dynamic connection changes but neglects the time it takes for edges to evolve, failing to embed temporal linkage information into the evolution of the graph. To capture vertices’ temporal linkage evolution, we model dynamic graphs as a sequence of snapshot graphs, appending the respective timespans of edges (ToE). We co-train a linear regressor to embed ToE while inferring a common latent space for all snapshot graphs by a matrix-factorization-based model to embed vertices’ dynamic connection changes. Vertices’ temporal linkage evolution is captured as their moving trajectories within the common latent representation space. Our embedding algorithm converges quickly with our proposed training methods, which is very time efficient and scalable. Extensive evaluations on several datasets show that our model can achieve significant performance improvements, i.e., 22.98 percent on average across all datasets, over the state-of-the-art baselines in the tasks of vertex classification, static and time-aware link prediction, and ToE prediction.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Dynamic graph embedding learns representation vectors for vertices and edges in a graph that evolves over time. We aim to capture and embed the evolution of vertices’ temporal connectivity. Existing work studies the vertices’ dynamic connection changes but neglects the time it takes for edges to evolve, failing to embed temporal linkage information into the evolution of the graph. To capture vertices’ temporal linkage evolution, we model dynamic graphs as a sequence of snapshot graphs, appending the respective timespans of edges (ToE). We co-train a linear regressor to embed ToE while inferring a common latent space for all snapshot graphs by a matrix-factorization-based model to embed vertices’ dynamic connection changes. Vertices’ temporal linkage evolution is captured as their moving trajectories within the common latent representation space. Our embedding algorithm converges quickly with our proposed training methods, which is very time efficient and scalable. Extensive evaluations on several datasets show that our model can achieve significant performance improvements, i.e., 22.98 percent on average across all datasets, over the state-of-the-art baselines in the tasks of vertex classification, static and time-aware link prediction, and ToE prediction.",
"title": "Time-Capturing Dynamic Graph Embedding for Temporal Linkage Evolution",
"normalizedTitle": "Time-Capturing Dynamic Graph Embedding for Temporal Linkage Evolution",
"fno": "09444851",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Graph Theory",
"Learning Artificial Intelligence",
"Matrix Decomposition",
"Embed To E",
"Embed Vertices",
"Embedding Algorithm",
"Latent Representation Space",
"Representation Vectors",
"Snapshot Graphs",
"Temporal Linkage Evolution",
"Temporal Linkage Information",
"Time Aware Link Prediction",
"Time Capturing Dynamic Graph Embedding",
"Timespans Of Edges",
"Heuristic Algorithms",
"Couplings",
"Evolution Biology",
"Prediction Algorithms",
"Trajectory",
"Task Analysis",
"Social Networking Online",
"Dynamic Graph Embedding",
"Graph Evolution",
"Edge Timespan",
"Graph Mining"
],
"authors": [
{
"givenName": "Yu",
"surname": "Yang",
"fullName": "Yu Yang",
"affiliation": "Department of Computing, Hong Kong Polytechnic University, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiannong",
"surname": "Cao",
"fullName": "Jiannong Cao",
"affiliation": "Department of Computing, Hong Kong Polytechnic University, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Milos",
"surname": "Stojmenovic",
"fullName": "Milos Stojmenovic",
"affiliation": "Singidunum University, Beograd, Serbia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Senzhang",
"surname": "Wang",
"fullName": "Senzhang Wang",
"affiliation": "School of Computer Science and Engineering, Central South University, Changsha, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yiran",
"surname": "Cheng",
"fullName": "Yiran Cheng",
"affiliation": "Department of Computing, Hong Kong Polytechnic University, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chun",
"surname": "Lum",
"fullName": "Chun Lum",
"affiliation": "Department of Computing, Hong Kong Polytechnic University, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhetao",
"surname": "Li",
"fullName": "Zhetao Li",
"affiliation": "Hunan International Scientific and Technological Cooperation Base of Intelligent Network, Key Laboratory of Hunan Province for Internet of Things and Information Security, and College of Computer Science, Xiangtan University, Xiangtan, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "958-971",
"year": "2023",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccabs/2014/5786/0/06863930",
"title": "Poster: Efficient record linkage techniques",
"doi": null,
"abstractUrl": "/proceedings-article/iccabs/2014/06863930/12OmNz61daK",
"parentPublication": {
"id": "proceedings/iccabs/2014/5786/0",
"title": "2014 IEEE 4th International Conference on Computational Advances in Bio and Medical Sciences (ICCABS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2018/02/07937913",
"title": "Spatio-Temporal Linkage over Location-Enhanced Services",
"doi": null,
"abstractUrl": "/journal/tm/2018/02/07937913/13rRUxlgxX9",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2015/07/07029102",
"title": "Structured Learning from Heterogeneous Behavior for Social Identity Linkage",
"doi": null,
"abstractUrl": "/journal/tk/2015/07/07029102/13rRUyYSWtg",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2018/9159/0/08594862",
"title": "Privacy-Preserving Temporal Record Linkage",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2018/08594862/17D45VN31gK",
"parentPublication": {
"id": "proceedings/icdm/2018/9159/0",
"title": "2018 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmcce/2018/8481/0/848100a263",
"title": "Roundness Error's Coupling Compensation Control in Eccentric Shaft X-C Linkage Grinding",
"doi": null,
"abstractUrl": "/proceedings-article/icmcce/2018/848100a263/17D45Xh13r8",
"parentPublication": {
"id": "proceedings/icmcce/2018/8481/0",
"title": "2018 3rd International Conference on Mechanical, Control and Computer Engineering (ICMCCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/5555/01/09729535",
"title": "CP-Link: Exploiting Continuous Spatio-Temporal Check-in Patterns for User Identity Linkage",
"doi": null,
"abstractUrl": "/journal/tm/5555/01/09729535/1Bya5Dmrlfy",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10048576",
"title": "Time-Aware Dynamic Graph Embedding for Asynchronous Structural Evolution",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10048576/1KQ5Ef9SXeM",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10061389",
"title": "Semi-Supervised Variational User Identity Linkage via Noise-Aware Self-Learning",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10061389/1LiKKvqTddu",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2019/4253/0/425300a622",
"title": "An Empirical Evaluation of Two Novel Linkage Criteria for Hierarchical Agglomerative Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2019/425300a622/1fHkF0tLNDO",
"parentPublication": {
"id": "proceedings/bracis/2019/4253/0",
"title": "2019 8th Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibw/2007/1604/0/04425419",
"title": "Rapid computation of large numbers of LOD scores in linkage analysis through polynomial expression of genetic likelihoods",
"doi": null,
"abstractUrl": "/proceedings-article/bibw/2007/04425419/1s2V8CNQRwY",
"parentPublication": {
"id": "proceedings/bibw/2007/1604/0",
"title": "2007 IEEE International Conference on Bioinformatics and Biomedicine Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09423565",
"articleId": "1tkyaChrRxS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09404875",
"articleId": "1sNm3Kthmi4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBp52xz",
"title": "Dec.",
"year": "2016",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "22",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwgQpDx",
"doi": "10.1109/TVCG.2016.2515611",
"abstract": "Visualizing very large graphs by edge bundling is a promising method, yet subject to several challenges: speed, clutter, level-of-detail, and parameter control. We present CUBu, a framework that addresses the above problems in an integrated way. Fully GPU-based, CUBu bundles graphs of up to a million edges at interactive framerates, being over 50 times faster than comparable state-of-the-art methods, and has a simple and intuitive control of bundling parameters. CUBu extends and unifies existing bundling techniques, offering ways to control bundle shapes, separate bundles by edge direction, and shade bundles to create a level-of-detail visualization that shows both the graph core structure and its details. We demonstrate CUBu on several large graphs extracted from real-life application domains.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visualizing very large graphs by edge bundling is a promising method, yet subject to several challenges: speed, clutter, level-of-detail, and parameter control. We present CUBu, a framework that addresses the above problems in an integrated way. Fully GPU-based, CUBu bundles graphs of up to a million edges at interactive framerates, being over 50 times faster than comparable state-of-the-art methods, and has a simple and intuitive control of bundling parameters. CUBu extends and unifies existing bundling techniques, offering ways to control bundle shapes, separate bundles by edge direction, and shade bundles to create a level-of-detail visualization that shows both the graph core structure and its details. We demonstrate CUBu on several large graphs extracted from real-life application domains.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visualizing very large graphs by edge bundling is a promising method, yet subject to several challenges: speed, clutter, level-of-detail, and parameter control. We present CUBu, a framework that addresses the above problems in an integrated way. Fully GPU-based, CUBu bundles graphs of up to a million edges at interactive framerates, being over 50 times faster than comparable state-of-the-art methods, and has a simple and intuitive control of bundling parameters. CUBu extends and unifies existing bundling techniques, offering ways to control bundle shapes, separate bundles by edge direction, and shade bundles to create a level-of-detail visualization that shows both the graph core structure and its details. We demonstrate CUBu on several large graphs extracted from real-life application domains.",
"title": "CUBu: Universal Real-Time Bundling for Large Graphs",
"normalizedTitle": "CUBu: Universal Real-Time Bundling for Large Graphs",
"fno": "07374742",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Image Edge Detection",
"Kernel",
"Real Time Systems",
"Scalability",
"Graphics Processing Units",
"Electron Tubes",
"Scattering",
"Computing Methodologies Computer Graphics Methodology And Techniques",
"Computing Methodologies Computer Graphics Picture Image Generation"
],
"authors": [
{
"givenName": "Matthew",
"surname": "van der Zwan",
"fullName": "Matthew van der Zwan",
"affiliation": "University of Groningen, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Valeriu",
"surname": "Codreanu",
"fullName": "Valeriu Codreanu",
"affiliation": "SURFsara, Amsterdam, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alexandru",
"surname": "Telea",
"fullName": "Alexandru Telea",
"affiliation": "University of Groningen, The Netherlands",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2016-12-01 00:00:00",
"pubType": "trans",
"pages": "2550-2563",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/big-data/2015/9926/0/07364046",
"title": "Texture-based edge bundling: A web-based approach for interactively visualizing large graphs",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2015/07364046/12OmNro0Idz",
"parentPublication": {
"id": "proceedings/big-data/2015/9926/0",
"title": "2015 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2013/4797/0/06596126",
"title": "Smooth bundling of large streaming and sequence graphs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2013/06596126/12OmNscfI0r",
"parentPublication": {
"id": "proceedings/pacificvis/2013/4797/0",
"title": "2013 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2011/935/0/05742389",
"title": "Multilevel agglomerative edge bundling for visualizing large graphs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742389/12OmNxj233Y",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2013/5049/0/5049a028",
"title": "Edge Bundling by Rapidly-Exploring Random Trees",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2013/5049a028/12OmNz5s0F9",
"parentPublication": {
"id": "proceedings/iv/2013/5049/0",
"title": "2013 17th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2017/5738/0/08031594",
"title": "FFTEB: Edge bundling of huge graphs by the Fast Fourier Transform",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031594/12OmNzuZUEs",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2016/8942/0/8942a094",
"title": "On Edge Bundling and Node Layout for Mutually Connected Directed Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2016/8942a094/12OmNzwZ6qg",
"parentPublication": {
"id": "proceedings/iv/2016/8942/0",
"title": "2016 20th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539373",
"title": "Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539373/13rRUwcS1CZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122354",
"title": "Divided Edge Bundling for Directional Network Data",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122354/13rRUzpzeB1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/10/08423100",
"title": "The Effect of Edge Bundling and Seriation on Sensemaking of Biclusters in Bipartite Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2019/10/08423100/1d3e5UbWqis",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2023/01/09599491",
"title": "Visual Analysis of Multidimensional Big Data: A Scalable Lightweight Bundling Method for Parallel Coordinates",
"doi": null,
"abstractUrl": "/journal/bd/2023/01/09599491/1yeC5mmD996",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07331662",
"articleId": "13rRUyfKIHR",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07374748",
"articleId": "13rRUxly9dX",
"__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": "13rRUxASuhv",
"doi": "10.1109/TVCG.2010.163",
"abstract": "In this work we present, apply, and evaluate a novel, interactive visualization model for comparative analysis of structural variants and rearrangements in human and cancer genomes, with emphasis on data integration and uncertainty visualization. To support both global trend analysis and local feature detection, this model enables explorations continuously scaled from the high-level, complete genome perspective, down to the low-level, structural rearrangement view, while preserving global context at all times. We have implemented these techniques in Gremlin, a genomic rearrangement explorer with multi-scale, linked interactions, which we apply to four human cancer genome data sets for evaluation. Using an insight-based evaluation methodology, we compare Gremlin to Circos, the state-of-the-art in genomic rearrangement visualization, through a small user study with computational biologists working in rearrangement analysis. Results from user study evaluations demonstrate that this visualization model enables more total insights, more insights per minute, and more complex insights than the current state-of-the-art for visual analysis and exploration of genome rearrangements.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this work we present, apply, and evaluate a novel, interactive visualization model for comparative analysis of structural variants and rearrangements in human and cancer genomes, with emphasis on data integration and uncertainty visualization. To support both global trend analysis and local feature detection, this model enables explorations continuously scaled from the high-level, complete genome perspective, down to the low-level, structural rearrangement view, while preserving global context at all times. We have implemented these techniques in Gremlin, a genomic rearrangement explorer with multi-scale, linked interactions, which we apply to four human cancer genome data sets for evaluation. Using an insight-based evaluation methodology, we compare Gremlin to Circos, the state-of-the-art in genomic rearrangement visualization, through a small user study with computational biologists working in rearrangement analysis. Results from user study evaluations demonstrate that this visualization model enables more total insights, more insights per minute, and more complex insights than the current state-of-the-art for visual analysis and exploration of genome rearrangements.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this work we present, apply, and evaluate a novel, interactive visualization model for comparative analysis of structural variants and rearrangements in human and cancer genomes, with emphasis on data integration and uncertainty visualization. To support both global trend analysis and local feature detection, this model enables explorations continuously scaled from the high-level, complete genome perspective, down to the low-level, structural rearrangement view, while preserving global context at all times. We have implemented these techniques in Gremlin, a genomic rearrangement explorer with multi-scale, linked interactions, which we apply to four human cancer genome data sets for evaluation. Using an insight-based evaluation methodology, we compare Gremlin to Circos, the state-of-the-art in genomic rearrangement visualization, through a small user study with computational biologists working in rearrangement analysis. Results from user study evaluations demonstrate that this visualization model enables more total insights, more insights per minute, and more complex insights than the current state-of-the-art for visual analysis and exploration of genome rearrangements.",
"title": "Gremlin: An Interactive Visualization Model for Analyzing Genomic Rearrangements",
"normalizedTitle": "Gremlin: An Interactive Visualization Model for Analyzing Genomic Rearrangements",
"fno": "ttg2010060918",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Information Visualization",
"Bioinformatics",
"Insight Based Evaluation"
],
"authors": [
{
"givenName": "Trevor",
"surname": "O'Brien",
"fullName": "Trevor O'Brien",
"affiliation": "Brown University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anna",
"surname": "Ritz",
"fullName": "Anna Ritz",
"affiliation": "Brown University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Benjamin",
"surname": "Raphael",
"fullName": "Benjamin Raphael",
"affiliation": "Brown University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Laidlaw",
"fullName": "David Laidlaw",
"affiliation": "Brown University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2010-11-01 00:00:00",
"pubType": "trans",
"pages": "918-926",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibe/2007/1509/0/04375655",
"title": "Towards Construction of Optimal Strip-Exchanging Moves",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2007/04375655/12OmNApcuoJ",
"parentPublication": {
"id": "proceedings/bibe/2007/1509/0",
"title": "7th IEEE International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2017/3050/0/08217647",
"title": "Unraveling complex local genomic rearrangements from long-read data",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2017/08217647/12OmNvDI3WC",
"parentPublication": {
"id": "proceedings/bibm/2017/3050/0",
"title": "2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2004/8779/0/87790001",
"title": "An Evaluation of Microarray Visualization Tools for Biological Insight",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2004/87790001/12OmNvwkukA",
"parentPublication": {
"id": "proceedings/ieee-infovis/2004/8779/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icci/2006/0475/2/04216519",
"title": "Fast Approximate Search in Strings with Rearrangements",
"doi": null,
"abstractUrl": "/proceedings-article/icci/2006/04216519/12OmNybfraT",
"parentPublication": {
"id": "proceedings/icci/2006/0475/2",
"title": "Cognitive Informatics, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1993/3940/0/00398883",
"title": "Computer visualization of long genomic sequences",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1993/00398883/12OmNzXFoxI",
"parentPublication": {
"id": "proceedings/visual/1993/3940/0",
"title": "Proceedings Visualization '93",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122392",
"title": "Sequence Surveyor: Leveraging Overview for Scalable Genomic Alignment Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122392/13rRUxOdD2C",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2006/03/mcg2006030006",
"title": "Toward Measuring Visualization Insight",
"doi": null,
"abstractUrl": "/magazine/cg/2006/03/mcg2006030006/13rRUxZRbrM",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2013/04/ttb2013040819",
"title": "Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes",
"doi": null,
"abstractUrl": "/journal/tb/2013/04/ttb2013040819/13rRUynHuhx",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2019/01/08352816",
"title": "An Exact Algorithm for Sorting by Weighted Preserving Genome Rearrangements",
"doi": null,
"abstractUrl": "/journal/tb/2019/01/08352816/17D45XDIXXl",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/09477014",
"title": "Heuristics for Genome Rearrangement Distance With Replicated Genes",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/09477014/1v2LYKjTPgs",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010060908",
"articleId": "13rRUyYjKaa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010060927",
"articleId": "13rRUxBa5rR",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBl6EKc",
"title": "July-Aug.",
"year": "2014",
"issueNum": "04",
"idPrefix": "tb",
"pubType": "journal",
"volume": "11",
"label": "July-Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxOdD6O",
"doi": "10.1109/TCBB.2014.2306830",
"abstract": "The cell-type diversity is to a large degree driven by transcription regulation, i.e., enhancers. It has been recently shown that in high-level eukaryotes enhancers rarely work alone, instead they collaborate by forming clusters of cis-regulatory modules (CRMs). Even if the binding of transcription factors is sequence-specific, the identification of functionally similar enhancers is very difficult. A similarity measure to detect related regulatory sequences is crucial to understand functional correlation between two enhancers. This will allow large-scale analyses, clustering and genome-wide classifications. In this paper we present Under2, a parameter-free alignment-free statistic based on variable-length words. As opposed to traditional alignment-free methods, which are based on fixed-length patterns or, in other words, tied to a fixed resolution, our statistic is built upon variable-length words, and thus multiple resolutions are allowed. This will capture the great variability of lengths of CRMs. We evaluate several alignment-free statistics on simulated data and real ChIP-seq sequences. The new statistic is highly successful in discriminating functionally related enhancers and, in almost all experiments, it outperforms fixed-resolution methods. Finally, experiments on mouse enhancers show that Under2 can separate enhancers active in different tissues. Availability: http://www.dei.unipd.it/~ciompin/main/UnderIICRMS.html.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The cell-type diversity is to a large degree driven by transcription regulation, i.e., enhancers. It has been recently shown that in high-level eukaryotes enhancers rarely work alone, instead they collaborate by forming clusters of cis-regulatory modules (CRMs). Even if the binding of transcription factors is sequence-specific, the identification of functionally similar enhancers is very difficult. A similarity measure to detect related regulatory sequences is crucial to understand functional correlation between two enhancers. This will allow large-scale analyses, clustering and genome-wide classifications. In this paper we present Under2, a parameter-free alignment-free statistic based on variable-length words. As opposed to traditional alignment-free methods, which are based on fixed-length patterns or, in other words, tied to a fixed resolution, our statistic is built upon variable-length words, and thus multiple resolutions are allowed. This will capture the great variability of lengths of CRMs. We evaluate several alignment-free statistics on simulated data and real ChIP-seq sequences. The new statistic is highly successful in discriminating functionally related enhancers and, in almost all experiments, it outperforms fixed-resolution methods. Finally, experiments on mouse enhancers show that Under2 can separate enhancers active in different tissues. Availability: http://www.dei.unipd.it/~ciompin/main/UnderIICRMS.html.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The cell-type diversity is to a large degree driven by transcription regulation, i.e., enhancers. It has been recently shown that in high-level eukaryotes enhancers rarely work alone, instead they collaborate by forming clusters of cis-regulatory modules (CRMs). Even if the binding of transcription factors is sequence-specific, the identification of functionally similar enhancers is very difficult. A similarity measure to detect related regulatory sequences is crucial to understand functional correlation between two enhancers. This will allow large-scale analyses, clustering and genome-wide classifications. In this paper we present Under2, a parameter-free alignment-free statistic based on variable-length words. As opposed to traditional alignment-free methods, which are based on fixed-length patterns or, in other words, tied to a fixed resolution, our statistic is built upon variable-length words, and thus multiple resolutions are allowed. This will capture the great variability of lengths of CRMs. We evaluate several alignment-free statistics on simulated data and real ChIP-seq sequences. The new statistic is highly successful in discriminating functionally related enhancers and, in almost all experiments, it outperforms fixed-resolution methods. Finally, experiments on mouse enhancers show that Under2 can separate enhancers active in different tissues. Availability: http://www.dei.unipd.it/~ciompin/main/UnderIICRMS.html.",
"title": "Beyond Fixed-Resolution Alignment-Free Measures for Mammalian Enhancers Sequence Comparison",
"normalizedTitle": "Beyond Fixed-Resolution Alignment-Free Measures for Mammalian Enhancers Sequence Comparison",
"fno": "06744577",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Bioinformatics",
"Genomics",
"Customer Relationship Management",
"Computational Modeling",
"Computational Biology",
"Regulatory Sequences Comparison",
"Alignment Free Statistics",
"Pattern Discovery"
],
"authors": [
{
"givenName": "Matteo",
"surname": "Comin",
"fullName": "Matteo Comin",
"affiliation": "Dept. of Inf. Eng., Univ. of Padova, Padua, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Davide",
"surname": "Verzotto",
"fullName": "Davide Verzotto",
"affiliation": "Dept. of Comput. & Syst. Biol., Genome Inst. of Singapore, Singapore, Singapore",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2014-07-01 00:00:00",
"pubType": "trans",
"pages": "628-637",
"year": "2014",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibm/2016/1611/0/07822679",
"title": "K2: Efficient alignment-free sequence similarity measurement using the Kendall statistic",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2016/07822679/12OmNB836JR",
"parentPublication": {
"id": "proceedings/bibm/2016/1611/0",
"title": "2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2016/4840/0/4840a391",
"title": "Study on the Relation between Virus and Host Cell by Alignment-Free Sequence Comparison",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2016/4840a391/12OmNyuPLkd",
"parentPublication": {
"id": "proceedings/cis/2016/4840/0",
"title": "2016 12th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2012/06/ttb2012061629",
"title": "An Efficient Alignment Algorithm for Searching Simple Pseudoknots over Long Genomic Sequence",
"doi": null,
"abstractUrl": "/journal/tb/2012/06/ttb2012061629/13rRUIIVlaT",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/dt/2014/01/06617698",
"title": "CUSHAW2-GPU: Empowering Faster Gapped Short-Read Alignment Using GPU Computing",
"doi": null,
"abstractUrl": "/magazine/dt/2014/01/06617698/13rRUILLkHy",
"parentPublication": {
"id": "mags/dt",
"title": "IEEE Design & Test of Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2014/04/06732885",
"title": "SeeSite: Characterizing Relationships between Splice Junctions and Splicing Enhancers",
"doi": null,
"abstractUrl": "/journal/tb/2014/04/06732885/13rRUwcAqoL",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2014/05/06808521",
"title": "RNA-Seq Analysis Pipeline Based on Oshell Environment",
"doi": null,
"abstractUrl": "/journal/tb/2014/05/06808521/13rRUwjGoKa",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2013/03/ttb2013030793",
"title": "A Genomic Distance for Assembly Comparison Based on Compressed Maximal Exact Matches",
"doi": null,
"abstractUrl": "/journal/tb/2013/03/ttb2013030793/13rRUyXKxSZ",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-smartcity-dss/2019/2058/0/205800a877",
"title": "Co-Regulatory Functional Module Detection Based on Affinity Propagation and Neighborhood Inflation",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2019/205800a877/1dPoxQxDUqY",
"parentPublication": {
"id": "proceedings/hpcc-smartcity-dss/2019/2058/0",
"title": "2019 IEEE 21st International Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; IEEE 5th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2020/6215/0/09313338",
"title": "J*<sub>2</sub>: A New Method for Alignment-free Sequence Similarity Measurement",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2020/09313338/1qmg8PqVP7a",
"parentPublication": {
"id": "proceedings/bibm/2020/6215/0",
"title": "2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2023/01/09656638",
"title": "CD-MAWS: An Alignment-Free Phylogeny Estimation Method Using Cosine Distance on Minimal Absent Word Sets",
"doi": null,
"abstractUrl": "/journal/tb/2023/01/09656638/1zumjpdd5Zu",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06744575",
"articleId": "13rRUxDItfM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06747343",
"articleId": "13rRUxBJhtG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAPBbcB",
"title": "Jan.-Feb.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tb",
"pubType": "journal",
"volume": "16",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45XeKgp1",
"doi": "10.1109/TCBB.2018.2831691",
"abstract": "Covering alignment problems arise from recent developments in genomics; so called pan-genome graphs are replacing reference genomes, and advances in haplotyping enable full content of diploid genomes to be used as basis of sequence analysis. In this paper, we show that the computational complexity will change for natural extensions of alignments to pan-genome representations and to diploid genomes. More broadly, our approach can also be seen as a minimal extension of sequence alignment to labelled directed acyclic graphs (labeled DAGs). Namely, we show that finding a covering alignment of two labeled DAGs is NP-hard even on binary alphabets. A covering alignment asks for two paths Z_$R_1$_Z (red) and Z_$G_1$_Z (green) in DAG Z_$D_1$_Z and two paths Z_$R_2$_Z (red) and Z_$G_2$_Z (green) in DAG Z_$D_2$_Z that cover the nodes of the graphs and maximize the sum of the global alignment scores: Z_$\\mathsf {as}(\\mathsf {sp}(R_1),\\mathsf {sp}(R_2))+\\mathsf {as}(\\mathsf {sp}(G_1),\\mathsf {sp}(G_2))$_Z, where Z_$\\mathsf {sp}(P)$_Z is the concatenation of labels on the path Z_$P$_Z. Pair-wise alignment of haplotype sequences forming a diploid chromosome can be converted to a two-path coverable labelled DAG, and then the covering alignment models the similarity of two diploids over arbitrary recombinations. We also give a reduction to the other direction, to show that such a recombination-oblivious diploid alignment is NP-hard on alphabets of size 3.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Covering alignment problems arise from recent developments in genomics; so called pan-genome graphs are replacing reference genomes, and advances in haplotyping enable full content of diploid genomes to be used as basis of sequence analysis. In this paper, we show that the computational complexity will change for natural extensions of alignments to pan-genome representations and to diploid genomes. More broadly, our approach can also be seen as a minimal extension of sequence alignment to labelled directed acyclic graphs (labeled DAGs). Namely, we show that finding a covering alignment of two labeled DAGs is NP-hard even on binary alphabets. A covering alignment asks for two paths $R_1$ (red) and $G_1$ (green) in DAG $D_1$ and two paths $R_2$ (red) and $G_2$ (green) in DAG $D_2$ that cover the nodes of the graphs and maximize the sum of the global alignment scores: $\\mathsf {as}(\\mathsf {sp}(R_1),\\mathsf {sp}(R_2))+\\mathsf {as}(\\mathsf {sp}(G_1),\\mathsf {sp}(G_2))$, where $\\mathsf {sp}(P)$ is the concatenation of labels on the path $P$. Pair-wise alignment of haplotype sequences forming a diploid chromosome can be converted to a two-path coverable labelled DAG, and then the covering alignment models the similarity of two diploids over arbitrary recombinations. We also give a reduction to the other direction, to show that such a recombination-oblivious diploid alignment is NP-hard on alphabets of size 3.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Covering alignment problems arise from recent developments in genomics; so called pan-genome graphs are replacing reference genomes, and advances in haplotyping enable full content of diploid genomes to be used as basis of sequence analysis. In this paper, we show that the computational complexity will change for natural extensions of alignments to pan-genome representations and to diploid genomes. More broadly, our approach can also be seen as a minimal extension of sequence alignment to labelled directed acyclic graphs (labeled DAGs). Namely, we show that finding a covering alignment of two labeled DAGs is NP-hard even on binary alphabets. A covering alignment asks for two paths - (red) and - (green) in DAG - and two paths - (red) and - (green) in DAG - that cover the nodes of the graphs and maximize the sum of the global alignment scores: -, where - is the concatenation of labels on the path -. Pair-wise alignment of haplotype sequences forming a diploid chromosome can be converted to a two-path coverable labelled DAG, and then the covering alignment models the similarity of two diploids over arbitrary recombinations. We also give a reduction to the other direction, to show that such a recombination-oblivious diploid alignment is NP-hard on alphabets of size 3.",
"title": "Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics",
"normalizedTitle": "Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics",
"fno": "08352774",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Genomics",
"Bioinformatics",
"Computer Science",
"Sequences",
"Silicon",
"Computational Complexity",
"Biological Cells",
"Alignment",
"Edit Distance",
"Directed Acyclic Graph",
"Diploid Genome",
"Pan Genome",
"NP Hard Problem"
],
"authors": [
{
"givenName": "Romeo",
"surname": "Rizzi",
"fullName": "Romeo Rizzi",
"affiliation": "Department of Computer Science, University of Verona, Verona, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Massimo",
"surname": "Cairo",
"fullName": "Massimo Cairo",
"affiliation": "University of Trento, Trento, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Veli",
"surname": "Mäkinen",
"fullName": "Veli Mäkinen",
"affiliation": "Department of Computer Science, University of Helsinki, Helsinki, Finland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alexandru I.",
"surname": "Tomescu",
"fullName": "Alexandru I. Tomescu",
"affiliation": "Department of Computer Science, University of Helsinki, Helsinki, Finland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Valenzuela",
"fullName": "Daniel Valenzuela",
"affiliation": "Department of Computer Science, University of Helsinki, Helsinki, Finland",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "23-30",
"year": "2019",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/big-data/2015/9926/0/07364117",
"title": "Big Data: Cloud computing in genomics applications",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2015/07364117/12OmNAWpyp4",
"parentPublication": {
"id": "proceedings/big-data/2015/9926/0",
"title": "2015 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccabs/2014/5786/0/06863916",
"title": "How genome complexity can explain the hardness of aligning reads to genomes",
"doi": null,
"abstractUrl": "/proceedings-article/iccabs/2014/06863916/12OmNB9KHvM",
"parentPublication": {
"id": "proceedings/iccabs/2014/5786/0",
"title": "2014 IEEE 4th International Conference on Computational Advances in Bio and Medical Sciences (ICCABS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2014/5666/0/07004291",
"title": "Random projection based clustering for population genomics",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2014/07004291/12OmNs0C9Wp",
"parentPublication": {
"id": "proceedings/big-data/2014/5666/0",
"title": "2014 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2010/8420/0/05720339",
"title": "Towards the Solution of the Missing Persons Problem by Simulated Reproduction of Virtual Characters",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2010/05720339/12OmNvDqsRy",
"parentPublication": {
"id": "proceedings/sibgrapi/2010/8420/0",
"title": "2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccgrid/2014/2784/0/2784a711",
"title": "Accelerating Comparative Genomics Workflows in a Distributed Environment with Optimized Data Partitioning",
"doi": null,
"abstractUrl": "/proceedings-article/ccgrid/2014/2784a711/12OmNwF0C5w",
"parentPublication": {
"id": "proceedings/ccgrid/2014/2784/0",
"title": "2014 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2017/1324/0/132401a249",
"title": "Exploration of Natural Alignment Scoring Rules and Clustering Thresholds for Bacterial Core/Pan Genome Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2017/132401a249/12OmNwIpNo2",
"parentPublication": {
"id": "proceedings/bibe/2017/1324/0",
"title": "2017 IEEE 17th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e-science/2017/2686/0/08109164",
"title": "Accelerating Genome Sequence Alignment on Hadoop on Lustre Environment",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2017/08109164/12OmNzBOhAe",
"parentPublication": {
"id": "proceedings/e-science/2017/2686/0",
"title": "2017 IEEE 13th International Conference on e-Science (e-Science)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2018/8319/0/831900a637",
"title": "Simulating SVE-Optimised Genomics Workloads on Gem5",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2018/831900a637/17D45VsBTYI",
"parentPublication": {
"id": "proceedings/cluster/2018/8319/0",
"title": "2018 IEEE International Conference on Cluster Computing (CLUSTER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2019/01/08410020",
"title": "Optimal Binning for Genomics",
"doi": null,
"abstractUrl": "/journal/tc/2019/01/08410020/17D45VsBU46",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09557192",
"title": "Gosling: A Grammar-based Toolkit for Scalable and Interactive Genomics Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09557192/1xlw1UFWxDa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08392709",
"articleId": "17D45VTRozl",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08398459",
"articleId": "17D45Xcttkw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesOK",
"name": "ttb201901-08352774s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttb201901-08352774s1.zip",
"extension": "zip",
"size": "169 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwJPMX5",
"title": "Dec.",
"year": "2011",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0Pqpv",
"doi": "10.1109/TVCG.2011.248",
"abstract": "In this paper we address the difficult problem of parameter-finding in image segmentation. We replace a tedious manual process that is often based on guess-work and luck by a principled approach that systematically explores the parameter space. Our core idea is the following two-stage technique: We start with a sparse sampling of the parameter space and apply a statistical model to estimate the response of the segmentation algorithm. The statistical model incorporates a model of uncertainty of the estimation which we use in conjunction with the actual estimate in (visually) guiding the user towards areas that need refinement by placing additional sample points. In the second stage the user navigates through the parameter space in order to determine areas where the response value (goodness of segmentation) is high. In our exploration we rely on existing ground-truth images in order to evaluate the \"goodness\" of an image segmentation technique. We evaluate its usefulness by demonstrating this technique on two image segmentation algorithms: a three parameter model to detect microtubules in electron tomograms and an eight parameter model to identify functional regions in dynamic Positron Emission Tomography scans.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper we address the difficult problem of parameter-finding in image segmentation. We replace a tedious manual process that is often based on guess-work and luck by a principled approach that systematically explores the parameter space. Our core idea is the following two-stage technique: We start with a sparse sampling of the parameter space and apply a statistical model to estimate the response of the segmentation algorithm. The statistical model incorporates a model of uncertainty of the estimation which we use in conjunction with the actual estimate in (visually) guiding the user towards areas that need refinement by placing additional sample points. In the second stage the user navigates through the parameter space in order to determine areas where the response value (goodness of segmentation) is high. In our exploration we rely on existing ground-truth images in order to evaluate the \"goodness\" of an image segmentation technique. We evaluate its usefulness by demonstrating this technique on two image segmentation algorithms: a three parameter model to detect microtubules in electron tomograms and an eight parameter model to identify functional regions in dynamic Positron Emission Tomography scans.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper we address the difficult problem of parameter-finding in image segmentation. We replace a tedious manual process that is often based on guess-work and luck by a principled approach that systematically explores the parameter space. Our core idea is the following two-stage technique: We start with a sparse sampling of the parameter space and apply a statistical model to estimate the response of the segmentation algorithm. The statistical model incorporates a model of uncertainty of the estimation which we use in conjunction with the actual estimate in (visually) guiding the user towards areas that need refinement by placing additional sample points. In the second stage the user navigates through the parameter space in order to determine areas where the response value (goodness of segmentation) is high. In our exploration we rely on existing ground-truth images in order to evaluate the \"goodness\" of an image segmentation technique. We evaluate its usefulness by demonstrating this technique on two image segmentation algorithms: a three parameter model to detect microtubules in electron tomograms and an eight parameter model to identify functional regions in dynamic Positron Emission Tomography scans.",
"title": "Tuner: Principled Parameter Finding for Image Segmentation Algorithms Using Visual Response Surface Exploration",
"normalizedTitle": "Tuner: Principled Parameter Finding for Image Segmentation Algorithms Using Visual Response Surface Exploration",
"fno": "ttg2011121892",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Parameter Exploration",
"Image Segmentation",
"Gaussian Process Model"
],
"authors": [
{
"givenName": "Thomas",
"surname": "Torsney-Weir",
"fullName": "Thomas Torsney-Weir",
"affiliation": "Simon Fraser University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ahmed",
"surname": "Saad",
"fullName": "Ahmed Saad",
"affiliation": "Simon Fraser University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Torsten",
"surname": "Möller",
"fullName": "Torsten Möller",
"affiliation": "Simon Fraser University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hans-Christian",
"surname": "Hege",
"fullName": "Hans-Christian Hege",
"affiliation": "Zuse Institute Berlin",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Britta",
"surname": "Weber",
"fullName": "Britta Weber",
"affiliation": "Zuse Institute Berlin",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jean-Marc",
"surname": "Verbavatz",
"fullName": "Jean-Marc Verbavatz",
"affiliation": "Max Planck Institute of Molecular Cell Biology and Genetics (MPI-CBG)",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2011-12-01 00:00:00",
"pubType": "trans",
"pages": "1892-1901",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icicta/2010/4077/2/4077c876",
"title": "Parameter Selection for Segmentation in Object-Oriented Classification of Remotely Sensed Imagery",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2010/4077c876/12OmNBqv2bd",
"parentPublication": {
"id": "proceedings/icicta/2010/4077/2",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1988/0862/0/00196289",
"title": "Searching parameter spaces with noisy linear constraints",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1988/00196289/12OmNCf1Djx",
"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/ism/2012/4875/0/4875a153",
"title": "EDContours: High-Speed Parameter-Free Contour Detector Using EDPF",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2012/4875a153/12OmNrIrPgP",
"parentPublication": {
"id": "proceedings/ism/2012/4875/0",
"title": "2012 IEEE International Symposium on Multimedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmla/2010/4300/0/4300a113",
"title": "Multimodal Parameter-exploring Policy Gradients",
"doi": null,
"abstractUrl": "/proceedings-article/icmla/2010/4300a113/12OmNs4S8Gu",
"parentPublication": {
"id": "proceedings/icmla/2010/4300/0",
"title": "Machine Learning and Applications, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2011/06/ttd2011060960",
"title": "Parameter Exploration in Science and Engineering Using Many-Task Computing",
"doi": null,
"abstractUrl": "/journal/td/2011/06/ttd2011060960/13rRUwbs2g6",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1989/08/i0799",
"title": "Simultaneous Parameter Estimation and Segmentation of Gibbs Random Fields Using Simulated Annealing",
"doi": null,
"abstractUrl": "/journal/tp/1989/08/i0799/13rRUwkxc6j",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2001/11/i1240",
"title": "Parameter-Free Geometric Document Layout Analysis",
"doi": null,
"abstractUrl": "/journal/tp/2001/11/i1240/13rRUx0xPUO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1992/12/i1157",
"title": "The Multiple Window Parameter Transform",
"doi": null,
"abstractUrl": "/journal/tp/1992/12/i1157/13rRUytF42n",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2018/7447/0/744701a322",
"title": "Holonomic Approach for Item Response Theory Parameter Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2018/744701a322/19m3B8jSceI",
"parentPublication": {
"id": "proceedings/iiai-aai/2018/7447/0",
"title": "2018 7th International Congress on Advanced Applied Informatics (IIAI-AAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisce/2020/6406/0/640600a008",
"title": "A graphical method - genetic algorithm (GMGA) approach for parameter estimation of twofold Weibull mixture model",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2020/640600a008/1x3kOUEPDNu",
"parentPublication": {
"id": "proceedings/icisce/2020/6406/0",
"title": "2020 7th International Conference on Information Science and Control Engineering (ICISCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011121882",
"articleId": "13rRUytWF9i",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011121902",
"articleId": "13rRUwh80uw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgQi",
"name": "ttg2011121892s1.m4v",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2011121892s1.m4v",
"extension": "m4v",
"size": "16.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNANBZkd",
"title": "March",
"year": "2004",
"issueNum": "03",
"idPrefix": "tp",
"pubType": "journal",
"volume": "26",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuO9",
"doi": "10.1109/TPAMI.2004.1262341",
"abstract": "Abstract—A central issue in stereo algorithm design is the choice of matching cost. Many algorithms simply use squared or absolute intensity differences based on integer disparity steps. In this paper, we address potential problems with such approaches. We begin with a careful analysis of the properties of the continuous disparity space image (DSI) and propose several new matching cost variants based on symmetrically matching interpolated image signals. Using stereo images with ground truth, we empirically evaluate the performance of the different cost variants and show that proper sampling can yield improved matching performance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—A central issue in stereo algorithm design is the choice of matching cost. Many algorithms simply use squared or absolute intensity differences based on integer disparity steps. In this paper, we address potential problems with such approaches. We begin with a careful analysis of the properties of the continuous disparity space image (DSI) and propose several new matching cost variants based on symmetrically matching interpolated image signals. Using stereo images with ground truth, we empirically evaluate the performance of the different cost variants and show that proper sampling can yield improved matching performance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—A central issue in stereo algorithm design is the choice of matching cost. Many algorithms simply use squared or absolute intensity differences based on integer disparity steps. In this paper, we address potential problems with such approaches. We begin with a careful analysis of the properties of the continuous disparity space image (DSI) and propose several new matching cost variants based on symmetrically matching interpolated image signals. Using stereo images with ground truth, we empirically evaluate the performance of the different cost variants and show that proper sampling can yield improved matching performance.",
"title": "Sampling the Disparity Space Image",
"normalizedTitle": "Sampling the Disparity Space Image",
"fno": "i0419",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Stereo Algorithms",
"Matching Cost",
"Subpixel Sampling",
"Disparity Space Image",
"Aliasing"
],
"authors": [
{
"givenName": "Richard",
"surname": "Szeliski",
"fullName": "Richard Szeliski",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Scharstein",
"fullName": "Daniel Scharstein",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2004-03-01 00:00:00",
"pubType": "trans",
"pages": "419-425",
"year": "2004",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0413",
"articleId": "13rRUyv53Gq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0426",
"articleId": "13rRUxASuHi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzA6GUh",
"title": "June",
"year": "2010",
"issueNum": "06",
"idPrefix": "tp",
"pubType": "journal",
"volume": "32",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5yE",
"doi": "10.1109/TPAMI.2009.125",
"abstract": "We consider the problem of inferring and modeling topics in a sequence of documents with known publication dates. The documents at a given time are each characterized by a topic and the topics are drawn from a mixture model. The proposed model infers the change in the topic mixture weights as a function of time. The details of this general framework may take different forms, depending on the specifics of the model. For the examples considered here, we examine base measures based on independent multinomial-Dirichlet measures for representation of topic-dependent word counts. The form of the hierarchical model allows efficient variational Bayesian inference, of interest for large-scale problems. We demonstrate results and make comparisons to the model when the dynamic character is removed, and also compare to latent Dirichlet allocation (LDA) and Topics over Time (TOT). We consider a database of Neural Information Processing Systems papers as well as the US Presidential State of the Union addresses from 1790 to 2008.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We consider the problem of inferring and modeling topics in a sequence of documents with known publication dates. The documents at a given time are each characterized by a topic and the topics are drawn from a mixture model. The proposed model infers the change in the topic mixture weights as a function of time. The details of this general framework may take different forms, depending on the specifics of the model. For the examples considered here, we examine base measures based on independent multinomial-Dirichlet measures for representation of topic-dependent word counts. The form of the hierarchical model allows efficient variational Bayesian inference, of interest for large-scale problems. We demonstrate results and make comparisons to the model when the dynamic character is removed, and also compare to latent Dirichlet allocation (LDA) and Topics over Time (TOT). We consider a database of Neural Information Processing Systems papers as well as the US Presidential State of the Union addresses from 1790 to 2008.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We consider the problem of inferring and modeling topics in a sequence of documents with known publication dates. The documents at a given time are each characterized by a topic and the topics are drawn from a mixture model. The proposed model infers the change in the topic mixture weights as a function of time. The details of this general framework may take different forms, depending on the specifics of the model. For the examples considered here, we examine base measures based on independent multinomial-Dirichlet measures for representation of topic-dependent word counts. The form of the hierarchical model allows efficient variational Bayesian inference, of interest for large-scale problems. We demonstrate results and make comparisons to the model when the dynamic character is removed, and also compare to latent Dirichlet allocation (LDA) and Topics over Time (TOT). We consider a database of Neural Information Processing Systems papers as well as the US Presidential State of the Union addresses from 1790 to 2008.",
"title": "Hierarchical Bayesian Modeling of Topics in Time-Stamped Documents",
"normalizedTitle": "Hierarchical Bayesian Modeling of Topics in Time-Stamped Documents",
"fno": "ttp2010060996",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Hierarchical Models",
"Variational Bayes",
"Dirichlet Process",
"Text Modeling"
],
"authors": [
{
"givenName": "Iulian",
"surname": "Pruteanu-Malinici",
"fullName": "Iulian Pruteanu-Malinici",
"affiliation": "Duke University, Durham",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lu",
"surname": "Ren",
"fullName": "Lu Ren",
"affiliation": "Duke University, Durham",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Paisley",
"fullName": "John Paisley",
"affiliation": "Duke University, Durham",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eric",
"surname": "Wang",
"fullName": "Eric Wang",
"affiliation": "Duke University, Durham",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lawrence",
"surname": "Carin",
"fullName": "Lawrence Carin",
"affiliation": "Duke University, Durham",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2010-06-01 00:00:00",
"pubType": "trans",
"pages": "996-1011",
"year": "2010",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2011/4408/0/4408a141",
"title": "Learning Dirichlet Processes from Partially Observed Groups",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2011/4408a141/12OmNC943By",
"parentPublication": {
"id": "proceedings/icdm/2011/4408/0",
"title": "2011 IEEE 11th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wisa/2010/4193/0/4193a085",
"title": "Mining Hot Topics from Free-Text Customer Reviews—An LDA-Based Approach",
"doi": null,
"abstractUrl": "/proceedings-article/wisa/2010/4193a085/12OmNrJAed0",
"parentPublication": {
"id": "proceedings/wisa/2010/4193/0",
"title": "Web Information Systems and Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2012/4880/3/4880c180",
"title": "Research on Mining Common Concern via Infinite Topic Modelling",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2012/4880c180/12OmNx57HNW",
"parentPublication": {
"id": "proceedings/wi-iat/2012/4880/1",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2011/4408/0/4408b056",
"title": "Tracking and Connecting Topics via Incremental Hierarchical Dirichlet Processes",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2011/4408b056/12OmNx8fi9v",
"parentPublication": {
"id": "proceedings/icdm/2011/4408/0",
"title": "2011 IEEE 11th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2011/4408/0/4408b032",
"title": "Unsupervised Anomaly Intrusion Detection via Localized Bayesian Feature Selection",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2011/4408b032/12OmNxGAL0M",
"parentPublication": {
"id": "proceedings/icdm/2011/4408/0",
"title": "2011 IEEE 11th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2009/3895/0/3895a711",
"title": "Dirichlet Mixture Allocation for Multiclass Document Collections Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2009/3895a711/12OmNyQYtum",
"parentPublication": {
"id": "proceedings/icdm/2009/3895/0",
"title": "2009 Ninth IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109a637",
"title": "CDP Mixture Models for Data Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109a637/12OmNynJMY8",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2008/3496/1/3496a697",
"title": "Name Disambiguation Boosted by Latent Topics from Web Directories",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2008/3496a697/12OmNzd7baU",
"parentPublication": {
"id": "proceedings/wi-iat/2008/3496/1",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122412",
"title": "TextFlow: Towards Better Understanding of Evolving Topics in Text",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122412/13rRUxYrbUE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscbi/2018/9450/0/945000a079",
"title": "Evaluation of the Dirichlet Process Multinomial Mixture Model for Short-Text Topic Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/iscbi/2018/945000a079/18jXwP0j8ys",
"parentPublication": {
"id": "proceedings/iscbi/2018/9450/0",
"title": "2018 6th International Symposium on Computational and Business Intelligence (ISCBI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2010060988",
"articleId": "13rRUwgQprM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2010061012",
"articleId": "13rRUx0xPjk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRHm",
"name": "ttp2010060996s.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp2010060996s.pdf",
"extension": "pdf",
"size": "112 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwCaCzS",
"title": "June",
"year": "2012",
"issueNum": "06",
"idPrefix": "tk",
"pubType": "journal",
"volume": "24",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxDqS8I",
"doi": "10.1109/TKDE.2011.48",
"abstract": "Sentiment analysis or opinion mining aims to use automated tools to detect subjective information such as opinions, attitudes, and feelings expressed in text. This paper proposes a novel probabilistic modeling framework called joint sentiment-topic (JST) model based on latent Dirichlet allocation (LDA), which detects sentiment and topic simultaneously from text. A reparameterized version of the JST model called Reverse-JST, obtained by reversing the sequence of sentiment and topic generation in the modeling process, is also studied. Although JST is equivalent to Reverse-JST without a hierarchical prior, extensive experiments show that when sentiment priors are added, JST performs consistently better than Reverse-JST. Besides, unlike supervised approaches to sentiment classification which often fail to produce satisfactory performance when shifting to other domains, the weakly supervised nature of JST makes it highly portable to other domains. This is verified by the experimental results on data sets from five different domains where the JST model even outperforms existing semi-supervised approaches in some of the data sets despite using no labeled documents. Moreover, the topics and topic sentiment detected by JST are indeed coherent and informative. We hypothesize that the JST model can readily meet the demand of large-scale sentiment analysis from the web in an open-ended fashion.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Sentiment analysis or opinion mining aims to use automated tools to detect subjective information such as opinions, attitudes, and feelings expressed in text. This paper proposes a novel probabilistic modeling framework called joint sentiment-topic (JST) model based on latent Dirichlet allocation (LDA), which detects sentiment and topic simultaneously from text. A reparameterized version of the JST model called Reverse-JST, obtained by reversing the sequence of sentiment and topic generation in the modeling process, is also studied. Although JST is equivalent to Reverse-JST without a hierarchical prior, extensive experiments show that when sentiment priors are added, JST performs consistently better than Reverse-JST. Besides, unlike supervised approaches to sentiment classification which often fail to produce satisfactory performance when shifting to other domains, the weakly supervised nature of JST makes it highly portable to other domains. This is verified by the experimental results on data sets from five different domains where the JST model even outperforms existing semi-supervised approaches in some of the data sets despite using no labeled documents. Moreover, the topics and topic sentiment detected by JST are indeed coherent and informative. We hypothesize that the JST model can readily meet the demand of large-scale sentiment analysis from the web in an open-ended fashion.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Sentiment analysis or opinion mining aims to use automated tools to detect subjective information such as opinions, attitudes, and feelings expressed in text. This paper proposes a novel probabilistic modeling framework called joint sentiment-topic (JST) model based on latent Dirichlet allocation (LDA), which detects sentiment and topic simultaneously from text. A reparameterized version of the JST model called Reverse-JST, obtained by reversing the sequence of sentiment and topic generation in the modeling process, is also studied. Although JST is equivalent to Reverse-JST without a hierarchical prior, extensive experiments show that when sentiment priors are added, JST performs consistently better than Reverse-JST. Besides, unlike supervised approaches to sentiment classification which often fail to produce satisfactory performance when shifting to other domains, the weakly supervised nature of JST makes it highly portable to other domains. This is verified by the experimental results on data sets from five different domains where the JST model even outperforms existing semi-supervised approaches in some of the data sets despite using no labeled documents. Moreover, the topics and topic sentiment detected by JST are indeed coherent and informative. We hypothesize that the JST model can readily meet the demand of large-scale sentiment analysis from the web in an open-ended fashion.",
"title": "Weakly Supervised Joint Sentiment-Topic Detection from Text",
"normalizedTitle": "Weakly Supervised Joint Sentiment-Topic Detection from Text",
"fno": "ttk2012061134",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Sentiment Analysis",
"Opinion Mining",
"Latent Dirichlet Allocation LDA",
"Joint Sentiment Topic JST Model"
],
"authors": [
{
"givenName": "Chenghua",
"surname": "Lin",
"fullName": "Chenghua Lin",
"affiliation": "University of Exeter, Exeter",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yulan",
"surname": "He",
"fullName": "Yulan He",
"affiliation": "The Open University, Milton Keynes",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Richard",
"surname": "Everson",
"fullName": "Richard Everson",
"affiliation": "University of Exeter, Exeter",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefan",
"surname": "Rüger",
"fullName": "Stefan Rüger",
"affiliation": "The Open University, Milton Keynes",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2012-06-01 00:00:00",
"pubType": "trans",
"pages": "1134-1145",
"year": "2012",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wi-iat/2011/4513/1/4513a249",
"title": "Opinion Mining with Sentiment Graph",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2011/4513a249/12OmNBU1jU1",
"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/icdmw/2016/5910/0/07836780",
"title": "Microblog Sentiment Topic Model",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2016/07836780/12OmNviHKcS",
"parentPublication": {
"id": "proceedings/icdmw/2016/5910/0",
"title": "2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iri/2016/3207/0/3207a463",
"title": "A Topic-Independent Hybrid Approach for Sentiment Analysis of Chinese Microblog",
"doi": null,
"abstractUrl": "/proceedings-article/iri/2016/3207a463/12OmNx1Iwcs",
"parentPublication": {
"id": "proceedings/iri/2016/3207/0",
"title": "2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2012/4880/3/4880c306",
"title": "Semi-Supervised Latent Dirichlet Allocation and Its Application for Document Classification",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2012/4880c306/12OmNy3149i",
"parentPublication": {
"id": "proceedings/wi-iat/2012/4880/1",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2014/6572/0/6572a413",
"title": "Dependency-Topic-Affects-Sentiment-LDA Model for Sentiment Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2014/6572a413/12OmNyqRn5J",
"parentPublication": {
"id": "proceedings/ictai/2014/6572/0",
"title": "2014 IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ialp/2010/4288/0/4288a199",
"title": "Multiple Factors-Based Opinion Retrieval and Coarse-to-Fine Sentiment Classification",
"doi": null,
"abstractUrl": "/proceedings-article/ialp/2010/4288a199/12OmNzcxZwg",
"parentPublication": {
"id": "proceedings/ialp/2010/4288/0",
"title": "Asian Language Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2008/3502/0/3502b025",
"title": "Document-Word Co-regularization for Semi-supervised Sentiment Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2008/3502b025/12OmNzd7bDH",
"parentPublication": {
"id": "proceedings/icdm/2008/3502/0",
"title": "2008 Eighth IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2011/4409/0/4409a081",
"title": "Multi-aspect Sentiment Analysis with Topic Models",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2011/4409a081/12OmNzdoMjE",
"parentPublication": {
"id": "proceedings/icdmw/2011/4409/0",
"title": "2011 IEEE 11th International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ialp/2012/4886/0/4886a013",
"title": "Multi-view Learning for Semi-supervised Sentiment Classification",
"doi": null,
"abstractUrl": "/proceedings-article/ialp/2012/4886a013/12OmNzvhvwH",
"parentPublication": {
"id": "proceedings/ialp/2012/4886/0",
"title": "Asian Language Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000h584",
"title": "Weakly Supervised Coupled Networks for Visual Sentiment Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000h584/17D45WrVg58",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttk2012061120",
"articleId": "13rRUwInvyT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttk2012061146",
"articleId": "13rRUyY294X",
"__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": "13rRUwbs2aX",
"doi": "10.1109/TVCG.2010.193",
"abstract": "Electronic test and measurement systems are becoming increasingly sophisticated in order to match the increased complexity and ultra-high speed of the devices under test. A key feature in many such instruments is a vastly increased capacity for storage of digital signals. Storage of Z_$10^9$_Z time points or more is now possible. At the same time, the typical screens on such measurement devices are relatively small. Therefore, these instruments can only render an extremely small fraction of the complete signal at any time. SignalLens uses a Focus+Context approach to provide a means of navigating to and inspecting low-level signal details in the context of the entire signal trace. This approach provides a compact visualization suitable for embedding into the small displays typically provided by electronic measurement instruments. We further augment this display with computed tracks which display time-aligned computed properties of the signal. By combining and filtering these computed tracks it is possible to easily and quickly find computationally detected features in the data which are often obscured by the visual compression required to render the large data sets on a small screen. Further, these tracks can be viewed in the context of the entire signal trace as well as visible high-level signal features. Several examples using real-world electronic measurement data are presented, which demonstrate typical use cases and the effectiveness of the design.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Electronic test and measurement systems are becoming increasingly sophisticated in order to match the increased complexity and ultra-high speed of the devices under test. A key feature in many such instruments is a vastly increased capacity for storage of digital signals. Storage of $10^9$ time points or more is now possible. At the same time, the typical screens on such measurement devices are relatively small. Therefore, these instruments can only render an extremely small fraction of the complete signal at any time. SignalLens uses a Focus+Context approach to provide a means of navigating to and inspecting low-level signal details in the context of the entire signal trace. This approach provides a compact visualization suitable for embedding into the small displays typically provided by electronic measurement instruments. We further augment this display with computed tracks which display time-aligned computed properties of the signal. By combining and filtering these computed tracks it is possible to easily and quickly find computationally detected features in the data which are often obscured by the visual compression required to render the large data sets on a small screen. Further, these tracks can be viewed in the context of the entire signal trace as well as visible high-level signal features. Several examples using real-world electronic measurement data are presented, which demonstrate typical use cases and the effectiveness of the design.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Electronic test and measurement systems are becoming increasingly sophisticated in order to match the increased complexity and ultra-high speed of the devices under test. A key feature in many such instruments is a vastly increased capacity for storage of digital signals. Storage of - time points or more is now possible. At the same time, the typical screens on such measurement devices are relatively small. Therefore, these instruments can only render an extremely small fraction of the complete signal at any time. SignalLens uses a Focus+Context approach to provide a means of navigating to and inspecting low-level signal details in the context of the entire signal trace. This approach provides a compact visualization suitable for embedding into the small displays typically provided by electronic measurement instruments. We further augment this display with computed tracks which display time-aligned computed properties of the signal. By combining and filtering these computed tracks it is possible to easily and quickly find computationally detected features in the data which are often obscured by the visual compression required to render the large data sets on a small screen. Further, these tracks can be viewed in the context of the entire signal trace as well as visible high-level signal features. Several examples using real-world electronic measurement data are presented, which demonstrate typical use cases and the effectiveness of the design.",
"title": "SignalLens: Focus+Context Applied to Electronic Time Series",
"normalizedTitle": "SignalLens: Focus+Context Applied to Electronic Time Series",
"fno": "ttg2010060900",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Focus Context",
"Lens",
"Test And Measurement",
"Electronic Signal",
"Signal Processing"
],
"authors": [
{
"givenName": "Robert",
"surname": "Kincaid",
"fullName": "Robert Kincaid",
"affiliation": "Agilent Laboratories",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2010-11-01 00:00:00",
"pubType": "trans",
"pages": "900-907",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icis/2005/2296/0/22960573",
"title": "Visualizing Hierarchical Information Using a New Focus+Context Method",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2005/22960573/12OmNAJVcDe",
"parentPublication": {
"id": "proceedings/icis/2005/2296/0",
"title": "Proceedings. Fourth Annual ACIS International Conference on Computer and Information Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2014/6636/0/6636a222",
"title": "Electronic Circuit Virtual Laboratory Based on LabVIEW and Multisim",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2014/6636a222/12OmNxVDuJL",
"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/ieee-infovis/2003/2055/0/20550008",
"title": "MoireGraphs: Radial Focus+Context Visualization and Interaction for Graphs with Visual Nodes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2003/20550008/12OmNxiKrV4",
"parentPublication": {
"id": "proceedings/ieee-infovis/2003/2055/0",
"title": "Information Visualization, IEEE Symposium on",
"__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/12/ttg2011122183",
"title": "The FLOWLENS: A Focus-and-Context Visualization Approach for Exploration of Blood Flow in Cerebral Aneurysms",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122183/13rRUx0xPIB",
"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/2011/12/ttg2011122422",
"title": "Exploratory Analysis of Time-Series with ChronoLenses",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122422/13rRUxASuGf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2012/05/mcs2012050063",
"title": "Distance-Based Focus + Context Models for Exploring Large Volumetric Medical Datasets",
"doi": null,
"abstractUrl": "/magazine/cs/2012/05/mcs2012050063/13rRUytF44W",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2020/8961/0/09273921",
"title": "Freewheeling Electronic Laboratory Learning with Pocket Instruments",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2020/09273921/1phRCRXHyrS",
"parentPublication": {
"id": "proceedings/fie/2020/8961/0",
"title": "2020 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010060890",
"articleId": "13rRUxNEqPN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010060908",
"articleId": "13rRUyYjKaa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFpG",
"name": "ttg2010060900s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2010060900s1.mp4",
"extension": "mp4",
"size": "7.79 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNALlciH",
"title": "March",
"year": "2004",
"issueNum": "03",
"idPrefix": "tk",
"pubType": "journal",
"volume": "16",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvyafj",
"doi": "10.1109/TKDE.2003.1262186",
"abstract": "Abstract—Mining of periodic patterns in time-series databases is an interesting data mining problem. It can be envisioned as a tool for forecasting and prediction of the future behavior of time-series data. Incremental mining refers to the issue of maintaining the discovered patterns over time in the presence of more items being added into the database. Because of the mostly append only nature of updating time-series data, incremental mining would be very effective and efficient. Several algorithms for incremental mining of partial periodic patterns in time-series databases are proposed and are analyzed empirically. The new algorithms allow for online adaptation of the thresholds in order to produce interactive mining of partial periodic patterns. The storage overhead of the incremental online mining algorithms is analyzed. Results show that the storage overhead for storing the intermediate data structures pays off as the incremental online mining of partial periodic patterns proves to be significantly more efficient than the nonincremental nononline versions. Moreover, a new problem, termed merge mining, is introduced as a generalization of incremental mining. Merge mining can be defined as merging the discovered patterns of two or more databases that are mined independently of each other. An algorithm for merge mining of partial periodic patterns in time-series databases is proposed and analyzed.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Mining of periodic patterns in time-series databases is an interesting data mining problem. It can be envisioned as a tool for forecasting and prediction of the future behavior of time-series data. Incremental mining refers to the issue of maintaining the discovered patterns over time in the presence of more items being added into the database. Because of the mostly append only nature of updating time-series data, incremental mining would be very effective and efficient. Several algorithms for incremental mining of partial periodic patterns in time-series databases are proposed and are analyzed empirically. The new algorithms allow for online adaptation of the thresholds in order to produce interactive mining of partial periodic patterns. The storage overhead of the incremental online mining algorithms is analyzed. Results show that the storage overhead for storing the intermediate data structures pays off as the incremental online mining of partial periodic patterns proves to be significantly more efficient than the nonincremental nononline versions. Moreover, a new problem, termed merge mining, is introduced as a generalization of incremental mining. Merge mining can be defined as merging the discovered patterns of two or more databases that are mined independently of each other. An algorithm for merge mining of partial periodic patterns in time-series databases is proposed and analyzed.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Mining of periodic patterns in time-series databases is an interesting data mining problem. It can be envisioned as a tool for forecasting and prediction of the future behavior of time-series data. Incremental mining refers to the issue of maintaining the discovered patterns over time in the presence of more items being added into the database. Because of the mostly append only nature of updating time-series data, incremental mining would be very effective and efficient. Several algorithms for incremental mining of partial periodic patterns in time-series databases are proposed and are analyzed empirically. The new algorithms allow for online adaptation of the thresholds in order to produce interactive mining of partial periodic patterns. The storage overhead of the incremental online mining algorithms is analyzed. Results show that the storage overhead for storing the intermediate data structures pays off as the incremental online mining of partial periodic patterns proves to be significantly more efficient than the nonincremental nononline versions. Moreover, a new problem, termed merge mining, is introduced as a generalization of incremental mining. Merge mining can be defined as merging the discovered patterns of two or more databases that are mined independently of each other. An algorithm for merge mining of partial periodic patterns in time-series databases is proposed and analyzed.",
"title": "Incremental, Online, and Merge Mining of Partial Periodic Patterns in Time-Series Databases",
"normalizedTitle": "Incremental, Online, and Merge Mining of Partial Periodic Patterns in Time-Series Databases",
"fno": "k0332",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Data Mining",
"Time Series Databases",
"Incremental Mining",
"Online Mining"
],
"authors": [
{
"givenName": "Walid G.",
"surname": "Aref",
"fullName": "Walid G. Aref",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mohamed G.",
"surname": "Elfeky",
"fullName": "Mohamed G. Elfeky",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ahmed K.",
"surname": "Elmagarmid",
"fullName": "Ahmed K. Elmagarmid",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2004-03-01 00:00:00",
"pubType": "trans",
"pages": "332-342",
"year": "2004",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "k0317",
"articleId": "13rRUyfKIDA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "k0343",
"articleId": "13rRUxcbnCJ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzV70rR",
"title": "February",
"year": "2009",
"issueNum": "02",
"idPrefix": "tk",
"pubType": "journal",
"volume": "21",
"label": "February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwbaqLL",
"doi": "10.1109/TKDE.2008.140",
"abstract": "In this paper, we present BMQ-Processor, a high-performance Border-Crossing Event (BCE) detection framework for large-scale monitoring applications. We first characterize a new query semantics, namely, Border Monitoring Query (BMQ), which is useful for BCE detection in many monitoring applications. It monitors the values of data streams and reports them only when data streams cross the borders of its range. We then propose BMQ-Processor to efficiently handle a large number of BMQs over a high volume of data streams. BMQ-Processor efficiently processes BMQs in a shared and incremental manner. It develops and operates over a novel stateful query index, achieving a high level of scalability over continuous data updates. Also, it utilizes the locality embedded in data streams and greatly accelerates successive BMQ evaluations. We present data structures and algorithms to support 1D as well as multidimensional BMQs. We show that the semantics of border monitoring can be extended toward more advanced ones and build region transition monitoring as a sample case. Lastly, we demonstrate excellent processing performance and low storage cost of BMQ-Processor through extensive analysis and experiments.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present BMQ-Processor, a high-performance Border-Crossing Event (BCE) detection framework for large-scale monitoring applications. We first characterize a new query semantics, namely, Border Monitoring Query (BMQ), which is useful for BCE detection in many monitoring applications. It monitors the values of data streams and reports them only when data streams cross the borders of its range. We then propose BMQ-Processor to efficiently handle a large number of BMQs over a high volume of data streams. BMQ-Processor efficiently processes BMQs in a shared and incremental manner. It develops and operates over a novel stateful query index, achieving a high level of scalability over continuous data updates. Also, it utilizes the locality embedded in data streams and greatly accelerates successive BMQ evaluations. We present data structures and algorithms to support 1D as well as multidimensional BMQs. We show that the semantics of border monitoring can be extended toward more advanced ones and build region transition monitoring as a sample case. Lastly, we demonstrate excellent processing performance and low storage cost of BMQ-Processor through extensive analysis and experiments.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present BMQ-Processor, a high-performance Border-Crossing Event (BCE) detection framework for large-scale monitoring applications. We first characterize a new query semantics, namely, Border Monitoring Query (BMQ), which is useful for BCE detection in many monitoring applications. It monitors the values of data streams and reports them only when data streams cross the borders of its range. We then propose BMQ-Processor to efficiently handle a large number of BMQs over a high volume of data streams. BMQ-Processor efficiently processes BMQs in a shared and incremental manner. It develops and operates over a novel stateful query index, achieving a high level of scalability over continuous data updates. Also, it utilizes the locality embedded in data streams and greatly accelerates successive BMQ evaluations. We present data structures and algorithms to support 1D as well as multidimensional BMQs. We show that the semantics of border monitoring can be extended toward more advanced ones and build region transition monitoring as a sample case. Lastly, we demonstrate excellent processing performance and low storage cost of BMQ-Processor through extensive analysis and experiments.",
"title": "BMQ-Processor: A High-Performance Border-Crossing Event Detection Framework for Large-Scale Monitoring Applications",
"normalizedTitle": "BMQ-Processor: A High-Performance Border-Crossing Event Detection Framework for Large-Scale Monitoring Applications",
"fno": "ttk2009020234",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Data Stream Processing",
"Event Based System",
"Stateful Query Index",
"BMQ Index",
"Incremental Processing",
"Border Monitoring",
"Region Transition Monitoring",
"Mobile Environment",
"Sensor Network"
],
"authors": [
{
"givenName": "Jinwon",
"surname": "Lee",
"fullName": "Jinwon Lee",
"affiliation": "KAIST, Daejeon",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Seungwoo",
"surname": "Kang",
"fullName": "Seungwoo Kang",
"affiliation": "KAIST, Deajeon",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Youngki",
"surname": "Lee",
"fullName": "Youngki Lee",
"affiliation": "KAIST, Daejeon",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sang Jeong",
"surname": "Lee",
"fullName": "Sang Jeong Lee",
"affiliation": "KAIST, Daejeon",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Junehwa",
"surname": "Song",
"fullName": "Junehwa Song",
"affiliation": "KAIST, Daejeon",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2009-02-01 00:00:00",
"pubType": "trans",
"pages": "234-252",
"year": "2009",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2009/3545/0/3545b215",
"title": "Web Monitoring 2.0: Crossing Streams to Satisfy Complex Data Needs",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2009/3545b215/12OmNA0vnV4",
"parentPublication": {
"id": "proceedings/icde/2009/3545/0",
"title": "2009 IEEE 25th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/srii/2012/4770/0/4770a146",
"title": "Cross-Border Challenges in Financial Markets Monitoring and Surveillance: A Case Study of Customer-Driven Service Value Networks",
"doi": null,
"abstractUrl": "/proceedings-article/srii/2012/4770a146/12OmNA1mbf5",
"parentPublication": {
"id": "proceedings/srii/2012/4770/0",
"title": "Annual SRII Global Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eisic/2012/4782/0/4782a362",
"title": "OptaSense: Fibre Optic Distributed Acoustic Sensing for Border Monitoring",
"doi": null,
"abstractUrl": "/proceedings-article/eisic/2012/4782a362/12OmNBBzohK",
"parentPublication": {
"id": "proceedings/eisic/2012/4782/0",
"title": "European Intelligence and Security Informatics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2006/0256/0/04117153",
"title": "Successfully Crossing the Cultural Border between High School and College: Promoting a Sense of Belonging in a Freshman Seminar Course",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2006/04117153/12OmNrFBQ3E",
"parentPublication": {
"id": "proceedings/fie/2006/0256/0",
"title": "Proceedings. Frontiers in Education. 36th Annual Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/spdp/1990/2087/0/00143580",
"title": "On linear speedup of a class of neighborhood functions in an array processor",
"doi": null,
"abstractUrl": "/proceedings-article/spdp/1990/00143580/12OmNsdo6sN",
"parentPublication": {
"id": "proceedings/spdp/1990/2087/0",
"title": "Parallel and Distributed Processing, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mdm/2006/2526/0/25260038",
"title": "BMQ-Index: Shared and Incremental Processing of Border Monitoring Queries over Data Streams",
"doi": null,
"abstractUrl": "/proceedings-article/mdm/2006/25260038/12OmNvwTGA2",
"parentPublication": {
"id": "proceedings/mdm/2006/2526/0",
"title": "7th International Conference on Mobile Data Management (MDM'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eisic/2013/5062/0/06657174",
"title": "Exploiting Twitter for Border Security-Related Intelligence Gathering",
"doi": null,
"abstractUrl": "/proceedings-article/eisic/2013/06657174/12OmNx0RIQO",
"parentPublication": {
"id": "proceedings/eisic/2013/5062/0",
"title": "2013 European Intelligence and Security Informatics Conference (EISIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcabes/2019/2865/0/286500a052",
"title": "A Border Ship Monitoring System Mounted on a Camera",
"doi": null,
"abstractUrl": "/proceedings-article/dcabes/2019/286500a052/1fHlmI05vBS",
"parentPublication": {
"id": "proceedings/dcabes/2019/2865/0",
"title": "2019 18th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/02/09097462",
"title": "Quantitative Verification for Monitoring Event-Streaming Systems",
"doi": null,
"abstractUrl": "/journal/ts/2022/02/09097462/1jZ64bVIxYA",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2020/8577/0/09316539",
"title": "Improvement of K-Coverage and Connectivity: Case of Border Monitoring Application",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2020/09316539/1qmfAONrhOE",
"parentPublication": {
"id": "proceedings/aiccsa/2020/8577/0",
"title": "2020 IEEE/ACS 17th International Conference on Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttk2009020220",
"articleId": "13rRUwd9CGk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttk2009020253",
"articleId": "13rRUILtJms",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrIaebT",
"title": "July",
"year": "1969",
"issueNum": "07",
"idPrefix": "tc",
"pubType": "journal",
"volume": "18",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyfbwpo",
"doi": "10.1109/T-C.1969.222732",
"abstract": "A compact, simple code for a general-purpose incrementally controlled display system is described. The code consists of three 2-bit incremental bytes, three 4-bit state-control bytes, and a 16-bit data byte which supplies various display parameters or data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A compact, simple code for a general-purpose incrementally controlled display system is described. The code consists of three 2-bit incremental bytes, three 4-bit state-control bytes, and a 16-bit data byte which supplies various display parameters or data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A compact, simple code for a general-purpose incrementally controlled display system is described. The code consists of three 2-bit incremental bytes, three 4-bit state-control bytes, and a 16-bit data byte which supplies various display parameters or data.",
"title": "A Variable-Length Code for an Incremental Display System",
"normalizedTitle": "A Variable-Length Code for an Incremental Display System",
"fno": "01671325",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Cathode Ray Tube Display",
"Incremental Display Code",
"Incremental Display System",
"Variable Length Code"
],
"authors": [
{
"givenName": "A.D.",
"surname": "Hause",
"fullName": "A.D. Hause",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "D.R.",
"surname": "Weller",
"fullName": "D.R. Weller",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "1969-07-01 00:00:00",
"pubType": "trans",
"pages": "643-644",
"year": "1969",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isss/2002/576/0/01227166",
"title": "Code compression for VLIW processors using variable-to-fixed coding",
"doi": null,
"abstractUrl": "/proceedings-article/isss/2002/01227166/12OmNCw3zaV",
"parentPublication": {
"id": "proceedings/isss/2002/576/0",
"title": "15th International Symposium on System Synthesis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2001/7041/3/00941292",
"title": "Configurable variable length code for video coding",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2001/00941292/12OmNvjyy5l",
"parentPublication": {
"id": "proceedings/icassp/2001/7041/3",
"title": "Acoustics, Speech, and Signal Processing, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2006/2602/0/26020778",
"title": "A Projection-Based Multi-view Time-multiplexed Autostereoscopic 3D Display System",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2006/26020778/12OmNwDSdGX",
"parentPublication": {
"id": "proceedings/iv/2006/2602/0",
"title": "Tenth International Conference on Information Visualisation (IV'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icinis/2010/4249/0/4249a217",
"title": "ARM9-Based Control System for LED Large Screen Display",
"doi": null,
"abstractUrl": "/proceedings-article/icinis/2010/4249a217/12OmNxuo0kI",
"parentPublication": {
"id": "proceedings/icinis/2010/4249/0",
"title": "Intelligent Networks and Intelligent Systems, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/estmed/2005/9347/0/01518059",
"title": "Frame buffer compression using a limited-size code book for low-power display systems",
"doi": null,
"abstractUrl": "/proceedings-article/estmed/2005/01518059/12OmNyQGSl7",
"parentPublication": {
"id": "proceedings/estmed/2005/9347/0",
"title": "3rd Workshop on Embedded Systems for Real-Time Multimedia, 2005.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2000/0592/0/05920460",
"title": "Data Partitioning and Reversible Variable Length Codes for Robust Video Communications",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2000/05920460/12OmNyywxEG",
"parentPublication": {
"id": "proceedings/dcc/2000/0592/0",
"title": "Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1973/02/01672266",
"title": "A Video Display System for Image Processing by Computer",
"doi": null,
"abstractUrl": "/journal/tc/1973/02/01672266/13rRUILc8e2",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1978/04/01675106",
"title": "Design of a Raster Display Processor for Office Applications",
"doi": null,
"abstractUrl": "/journal/tc/1978/04/01675106/13rRUNvgz2R",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1976/12/01674600",
"title": "Trends in Graphic Display Design",
"doi": null,
"abstractUrl": "/journal/tc/1976/12/01674600/13rRUwh80FL",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/an/2009/03/man2009030034",
"title": "Random and Raster: Display Technologies and the Development of Videogames",
"doi": null,
"abstractUrl": "/magazine/an/2009/03/man2009030034/13rRUxC0SQK",
"parentPublication": {
"id": "mags/an",
"title": "IEEE Annals of the History of Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "01671324",
"articleId": "13rRUwh80Bw",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01671326",
"articleId": "13rRUwbs29Q",
"__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": "13rRUIM2VGY",
"doi": "10.1109/TVCG.2009.183",
"abstract": "Trees and graphs are relevant to many online tasks such as visualizing social networks, product catalogs, educational portals, digital libraries, the semantic web, concept maps and personalized information management. SpicyNodes is an information-visualization technology that builds upon existing research on radial tree layouts and graph structures. Users can browse a tree, clicking from node to node, as well as successively viewing a node, immediately related nodes and the path back to the “home” nodes. SpicyNodes’ layout algorithms maintain balanced layouts using a hybrid mixture of a geometric layout (a succession of spanning radial trees) and force-directed layouts to minimize overlapping nodes, plus several other improvements over prior art. It provides XML-based API and GUI authoring tools. The goal of the SpicyNodes project is to implement familiar principles of radial maps and focus+context with an attractive and inviting look and feel in an open system that is accessible to virtually any Internet user.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Trees and graphs are relevant to many online tasks such as visualizing social networks, product catalogs, educational portals, digital libraries, the semantic web, concept maps and personalized information management. SpicyNodes is an information-visualization technology that builds upon existing research on radial tree layouts and graph structures. Users can browse a tree, clicking from node to node, as well as successively viewing a node, immediately related nodes and the path back to the “home” nodes. SpicyNodes’ layout algorithms maintain balanced layouts using a hybrid mixture of a geometric layout (a succession of spanning radial trees) and force-directed layouts to minimize overlapping nodes, plus several other improvements over prior art. It provides XML-based API and GUI authoring tools. The goal of the SpicyNodes project is to implement familiar principles of radial maps and focus+context with an attractive and inviting look and feel in an open system that is accessible to virtually any Internet user.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Trees and graphs are relevant to many online tasks such as visualizing social networks, product catalogs, educational portals, digital libraries, the semantic web, concept maps and personalized information management. SpicyNodes is an information-visualization technology that builds upon existing research on radial tree layouts and graph structures. Users can browse a tree, clicking from node to node, as well as successively viewing a node, immediately related nodes and the path back to the “home” nodes. SpicyNodes’ layout algorithms maintain balanced layouts using a hybrid mixture of a geometric layout (a succession of spanning radial trees) and force-directed layouts to minimize overlapping nodes, plus several other improvements over prior art. It provides XML-based API and GUI authoring tools. The goal of the SpicyNodes project is to implement familiar principles of radial maps and focus+context with an attractive and inviting look and feel in an open system that is accessible to virtually any Internet user.",
"title": "SpicyNodes: Radial Layout Authoring for the General Public",
"normalizedTitle": "SpicyNodes: Radial Layout Authoring for the General Public",
"fno": "ttg2009061089",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Trees And Network Visualization",
"Radial Tree Layout",
"Information Visualization",
"Interaction",
"Focus Context",
"Hierarchy Visualization",
"Human Computer Interaction"
],
"authors": [
{
"givenName": "Michael",
"surname": "Douma",
"fullName": "Michael Douma",
"affiliation": "IDEA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Grzegorz",
"surname": "Ligierko",
"fullName": "Grzegorz Ligierko",
"affiliation": "IDEA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ovidiu",
"surname": "Ancuta",
"fullName": "Ovidiu Ancuta",
"affiliation": "IDEA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pavel",
"surname": "Gritsai",
"fullName": "Pavel Gritsai",
"affiliation": "IDEA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sean",
"surname": "Liu",
"fullName": "Sean Liu",
"affiliation": "IDEA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2009-11-01 00:00:00",
"pubType": "trans",
"pages": "1089-1096",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-infovis/2000/0804/0/08040057",
"title": "Focus+Context Display and Navigation Techniques for Enhancing Radial, Space-Filling Hierarchy Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2000/08040057/12OmNC3Xhvi",
"parentPublication": {
"id": "proceedings/ieee-infovis/2000/0804/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isda/2009/3872/0/3872a203",
"title": "Classification by Evolutionary Generalized Radial Basis Functions",
"doi": null,
"abstractUrl": "/proceedings-article/isda/2009/3872a203/12OmNrJAdTf",
"parentPublication": {
"id": "proceedings/isda/2009/3872/0",
"title": "Intelligent Systems Design and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2001/1342/0/13420043",
"title": "Animated Exploration of Dynamic Graphs with Radial Layout",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2001/13420043/12OmNvq5jEv",
"parentPublication": {
"id": "proceedings/ieee-infovis/2001/1342/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2012/4771/0/4771a229",
"title": "Voronoi Diagram Based Dimensional Anchor Assessment for Radial Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2012/4771a229/12OmNxVDuUI",
"parentPublication": {
"id": "proceedings/iv/2012/4771/0",
"title": "2012 16th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2003/2055/0/20550008",
"title": "MoireGraphs: Radial Focus+Context Visualization and Interaction for Graphs with Visual Nodes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2003/20550008/12OmNxiKrV4",
"parentPublication": {
"id": "proceedings/ieee-infovis/2003/2055/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2002/1751/0/17510077",
"title": "InterRing: An Interactive Tool for Visually Navigating and Manipulating Hierarchical Structures",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2002/17510077/12OmNzTH0Oy",
"parentPublication": {
"id": "proceedings/ieee-infovis/2002/1751/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122440",
"title": "Evaluation of Traditional, Orthogonal, and Radial Tree Diagrams by an Eye Tracking Study",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122440/13rRUwI5U7W",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010060935",
"title": "Uncovering Strengths and Weaknesses of Radial Visualizations---an Empirical Approach",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010060935/13rRUwjGoFS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09814874",
"title": "Target Netgrams: An Annulus-Constrained Stress Model for Radial Graph Visualization",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09814874/1EJBn7YxwGY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807238",
"title": "A Comparison of Radial and Linear Charts for Visualizing Daily Patterns",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807238/1cG66qf6MKs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009061081",
"articleId": "13rRUyYSWkW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2009061097",
"articleId": "13rRUxNmPDO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBhpS2z",
"title": "Jan.",
"year": "2013",
"issueNum": "01",
"idPrefix": "tk",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgarjO",
"doi": "10.1109/TKDE.2011.209",
"abstract": "With XML becoming a ubiquitous language for data interoperability purposes in various domains, efficiently querying XML data is a critical issue. This has lead to the design of algebraic frameworks based on tree-shaped patterns akin to the tree-structured data model of XML. Tree patterns are graphic representations of queries over data trees. They are actually matched against an input data tree to answer a query. Since the turn of the 21st century, an astounding research effort has been focusing on tree pattern models and matching optimization (a primordial issue). This paper is a comprehensive survey of these topics, in which we outline and compare the various features of tree patterns. We also review and discuss the two main families of approaches for optimizing tree pattern matching, namely pattern tree minimization and holistic matching. We finally present actual tree pattern-based developments, to provide a global overview of this significant research topic.",
"abstracts": [
{
"abstractType": "Regular",
"content": "With XML becoming a ubiquitous language for data interoperability purposes in various domains, efficiently querying XML data is a critical issue. This has lead to the design of algebraic frameworks based on tree-shaped patterns akin to the tree-structured data model of XML. Tree patterns are graphic representations of queries over data trees. They are actually matched against an input data tree to answer a query. Since the turn of the 21st century, an astounding research effort has been focusing on tree pattern models and matching optimization (a primordial issue). This paper is a comprehensive survey of these topics, in which we outline and compare the various features of tree patterns. We also review and discuss the two main families of approaches for optimizing tree pattern matching, namely pattern tree minimization and holistic matching. We finally present actual tree pattern-based developments, to provide a global overview of this significant research topic.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "With XML becoming a ubiquitous language for data interoperability purposes in various domains, efficiently querying XML data is a critical issue. This has lead to the design of algebraic frameworks based on tree-shaped patterns akin to the tree-structured data model of XML. Tree patterns are graphic representations of queries over data trees. They are actually matched against an input data tree to answer a query. Since the turn of the 21st century, an astounding research effort has been focusing on tree pattern models and matching optimization (a primordial issue). This paper is a comprehensive survey of these topics, in which we outline and compare the various features of tree patterns. We also review and discuss the two main families of approaches for optimizing tree pattern matching, namely pattern tree minimization and holistic matching. We finally present actual tree pattern-based developments, to provide a global overview of this significant research topic.",
"title": "A Survey of XML Tree Patterns",
"normalizedTitle": "A Survey of XML Tree Patterns",
"fno": "ttk2013010029",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"XML",
"Pattern Matching",
"Vegetation",
"Algebra",
"Optimization",
"Data Models",
"Computers",
"Tree Pattern Rewriting",
"XML Querying",
"Data Tree",
"Tree Pattern",
"Tree Pattern Query",
"Twig Pattern",
"Matching",
"Containment",
"Tree Pattern Minimization",
"Holistic Matching",
"Tree Pattern Mining"
],
"authors": [
{
"givenName": "Marouane",
"surname": "Hachicha",
"fullName": "Marouane Hachicha",
"affiliation": "Université de Lyon (ERIC Lyon 2), Bron",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jérôme",
"surname": "Darmont",
"fullName": "Jérôme Darmont",
"affiliation": "Université de Lyon (ERIC Lyon 2), Bron",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2013-01-01 00:00:00",
"pubType": "trans",
"pages": "29-46",
"year": "2013",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cyberc/2010/4235/0/4235a033",
"title": "Unordered Tree Matching and Strict Unordered Tree Matching: The Evaluation of Tree Pattern Queries",
"doi": null,
"abstractUrl": "/proceedings-article/cyberc/2010/4235a033/12OmNANTAt5",
"parentPublication": {
"id": "proceedings/cyberc/2010/4235/0",
"title": "2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis/2009/3641/0/3641a457",
"title": "Efficient Processing of XML Twig Queries with All Predicates",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2009/3641a457/12OmNBCqbJw",
"parentPublication": {
"id": "proceedings/icis/2009/3641/0",
"title": "Computer and Information Science, ACIS International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etcs/2009/3557/3/3557e443",
"title": "XConquer: Extended Twig Pattern Matching Based on ftcontains Expression",
"doi": null,
"abstractUrl": "/proceedings-article/etcs/2009/3557e443/12OmNBO3KiA",
"parentPublication": {
"id": "proceedings/etcs/2009/3557/3",
"title": "Education Technology and Computer Science, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-icess/2008/3352/0/3352a605",
"title": "Effective Guidance-Based XML Query Processing",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-icess/2008/3352a605/12OmNyGtjkK",
"parentPublication": {
"id": "proceedings/hpcc-icess/2008/3352/0",
"title": "High Performance Computing and Communication & IEEE International Conference on Embedded Software and Systems, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2008/3299/0/3299a243",
"title": "XML Tree Structure Compression",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2008/3299a243/12OmNybx223",
"parentPublication": {
"id": "proceedings/dexa/2008/3299/0",
"title": "2008 19th International Workshop on Database and Expert Systems Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2012/12/ttk2012122244",
"title": "Processing and Evaluating Partial Tree Pattern Queries on XML Data",
"doi": null,
"abstractUrl": "/journal/tk/2012/12/ttk2012122244/13rRUxASuT7",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__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/2015/04/06880848",
"title": "Multi-Core Processing of XML Twig Patterns",
"doi": null,
"abstractUrl": "/journal/tk/2015/04/06880848/13rRUxly8XX",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2007/10/k1381",
"title": "Efficiently Querying Large XML Data Repositories: A Survey",
"doi": null,
"abstractUrl": "/journal/tk/2007/10/k1381/13rRUyYBlgR",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2008/12/ttk2008121627",
"title": "Scalable Filtering of Multiple Generalized-Tree-Pattern Queries over XML Streams",
"doi": null,
"abstractUrl": "/journal/tk/2008/12/ttk2008121627/13rRUyogGAt",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttk2013010015",
"articleId": "13rRUILtJzP",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttk2013010047",
"articleId": "13rRUxASuT8",
"__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": "13rRUwjoNwT",
"doi": "10.1109/TVCG.2006.147",
"abstract": "A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., non-hierarchical edges, together. We realize this as follows. We assume that the hierarchy is shown via a standard tree visualization method. Next, we bend each adjacency edge, modeled as a B-spline curve, toward the polyline defined by the path via the inclusion edges from one node to another. This hierarchical bundling reduces visual clutter and also visualizes implicit adjacency edges between parent nodes that are the result of explicit adjacency edges between their respective child nodes. Furthermore, hierarchical edge bundling is a generic method which can be used in conjunction with existing tree visualization techniques. We illustrate our technique by providing example visualizations and discuss the results based on an informal evaluation provided by potential users of such visualizations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., non-hierarchical edges, together. We realize this as follows. We assume that the hierarchy is shown via a standard tree visualization method. Next, we bend each adjacency edge, modeled as a B-spline curve, toward the polyline defined by the path via the inclusion edges from one node to another. This hierarchical bundling reduces visual clutter and also visualizes implicit adjacency edges between parent nodes that are the result of explicit adjacency edges between their respective child nodes. Furthermore, hierarchical edge bundling is a generic method which can be used in conjunction with existing tree visualization techniques. We illustrate our technique by providing example visualizations and discuss the results based on an informal evaluation provided by potential users of such visualizations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., non-hierarchical edges, together. We realize this as follows. We assume that the hierarchy is shown via a standard tree visualization method. Next, we bend each adjacency edge, modeled as a B-spline curve, toward the polyline defined by the path via the inclusion edges from one node to another. This hierarchical bundling reduces visual clutter and also visualizes implicit adjacency edges between parent nodes that are the result of explicit adjacency edges between their respective child nodes. Furthermore, hierarchical edge bundling is a generic method which can be used in conjunction with existing tree visualization techniques. We illustrate our technique by providing example visualizations and discuss the results based on an informal evaluation provided by potential users of such visualizations.",
"title": "Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data",
"normalizedTitle": "Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data",
"fno": "v0741",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Tree Graphs",
"Wires",
"Cables",
"Spline",
"Software Systems",
"Social Network Services",
"Displays",
"Tree Data Structures",
"Treemaps",
"Network Visualization",
"Edge Bundling",
"Edge Aggregation",
"Edge Concentration",
"Curves",
"Graph Visualization",
"Tree Visualization",
"Node Link Diagrams",
"Hierarchies"
],
"authors": [
{
"givenName": "Danny",
"surname": "Holten",
"fullName": "Danny Holten",
"affiliation": "Technische Univ. Eindhoven",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "trans",
"pages": "741-748",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/1992/2855/0/00223127",
"title": "Image segmentation via edge contour finding: a graph theoretic approach",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1992/00223127/12OmNBO3K1m",
"parentPublication": {
"id": "proceedings/cvpr/1992/2855/0",
"title": "Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2011/935/0/05742389",
"title": "Multilevel agglomerative edge bundling for visualizing large graphs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742389/12OmNxj233Y",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2013/5049/0/5049a028",
"title": "Edge Bundling by Rapidly-Exploring Random Trees",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2013/5049a028/12OmNz5s0F9",
"parentPublication": {
"id": "proceedings/iv/2013/5049/0",
"title": "2013 17th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/1995/7128/2/71280752",
"title": "Four directional adjacency graphs (FDAG) and their application in locating fields in forms",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/1995/71280752/12OmNzTH0Vm",
"parentPublication": {
"id": "proceedings/icdar/1995/7128/2",
"title": "Proceedings of 3rd International Conference on Document Analysis and Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2010/7846/0/05571159",
"title": "Living Flows: Enhanced Exploration of Edge-Bundled Graphs Based on GPU-Intensive Edge Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2010/05571159/12OmNzUxOfZ",
"parentPublication": {
"id": "proceedings/iv/2010/7846/0",
"title": "2010 14th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122457",
"title": "Compressed Adjacency Matrices: Untangling Gene Regulatory Networks",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122457/13rRUNvyakM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122449",
"title": "TreeNetViz: Revealing Patterns of Networks over Tree Structures",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122449/13rRUwIF69h",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/05/ttg2012050810",
"title": "Ambiguity-Free Edge-Bundling for Interactive Graph Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2012/05/ttg2012050810/13rRUxASuby",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/03/v0583",
"title": "A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information",
"doi": null,
"abstractUrl": "/journal/tg/2007/03/v0583/13rRUyY28Ym",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/04/09833270",
"title": "Adjacency Constraint for Efficient Hierarchical Reinforcement Learning",
"doi": null,
"abstractUrl": "/journal/tp/2023/04/09833270/1F8uMKfV5Di",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0733",
"articleId": "13rRUxASuMv",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0749",
"articleId": "13rRUxBa5rM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBRKwCF",
"title": "Aug.",
"year": "2013",
"issueNum": "08",
"idPrefix": "tk",
"pubType": "journal",
"volume": "25",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjQyvO",
"doi": "10.1109/TKDE.2012.100",
"abstract": "Clustering is an important technique for mining the intrinsic community structures in networks. The density-based network clustering method is able to not only detect communities of arbitrary size and shape, but also identify hubs and outliers. However, it requires manual parameter specification to define clusters, and is sensitive to the parameter of density threshold which is difficult to determine. Furthermore, many real-world networks exhibit a hierarchical structure with communities embedded within other communities. Therefore, the clustering result of a global parameter setting cannot always describe the intrinsic clustering structure accurately. In this paper, we introduce a novel density-based network clustering method, called graph-skeleton-based clustering (gSkeletonClu). By projecting an undirected network to its core-connected maximal spanning tree, the clustering problem can be converted to detect core connectivity components on the tree. The density-based clustering of a specific parameter setting and the hierarchical clustering structure both can be efficiently extracted from the tree. Moreover, it provides a convenient way to automatically select the parameter and to achieve the meaningful cluster tree in a network. Extensive experiments on both real-world and synthetic networks demonstrate the superior performance of gSkeletonClu for effective and efficient density-based clustering.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Clustering is an important technique for mining the intrinsic community structures in networks. The density-based network clustering method is able to not only detect communities of arbitrary size and shape, but also identify hubs and outliers. However, it requires manual parameter specification to define clusters, and is sensitive to the parameter of density threshold which is difficult to determine. Furthermore, many real-world networks exhibit a hierarchical structure with communities embedded within other communities. Therefore, the clustering result of a global parameter setting cannot always describe the intrinsic clustering structure accurately. In this paper, we introduce a novel density-based network clustering method, called graph-skeleton-based clustering (gSkeletonClu). By projecting an undirected network to its core-connected maximal spanning tree, the clustering problem can be converted to detect core connectivity components on the tree. The density-based clustering of a specific parameter setting and the hierarchical clustering structure both can be efficiently extracted from the tree. Moreover, it provides a convenient way to automatically select the parameter and to achieve the meaningful cluster tree in a network. Extensive experiments on both real-world and synthetic networks demonstrate the superior performance of gSkeletonClu for effective and efficient density-based clustering.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Clustering is an important technique for mining the intrinsic community structures in networks. The density-based network clustering method is able to not only detect communities of arbitrary size and shape, but also identify hubs and outliers. However, it requires manual parameter specification to define clusters, and is sensitive to the parameter of density threshold which is difficult to determine. Furthermore, many real-world networks exhibit a hierarchical structure with communities embedded within other communities. Therefore, the clustering result of a global parameter setting cannot always describe the intrinsic clustering structure accurately. In this paper, we introduce a novel density-based network clustering method, called graph-skeleton-based clustering (gSkeletonClu). By projecting an undirected network to its core-connected maximal spanning tree, the clustering problem can be converted to detect core connectivity components on the tree. The density-based clustering of a specific parameter setting and the hierarchical clustering structure both can be efficiently extracted from the tree. Moreover, it provides a convenient way to automatically select the parameter and to achieve the meaningful cluster tree in a network. Extensive experiments on both real-world and synthetic networks demonstrate the superior performance of gSkeletonClu for effective and efficient density-based clustering.",
"title": "Revealing Density-Based Clustering Structure from the Core-Connected Tree of a Network",
"normalizedTitle": "Revealing Density-Based Clustering Structure from the Core-Connected Tree of a Network",
"fno": "ttk2013081876",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Communities",
"Clustering Algorithms",
"Image Edge Detection",
"Educational Institutions",
"Joining Processes",
"Periodic Structures",
"Clustering Methods",
"Parameter Selection",
"Network Clustering",
"Density Based Method",
"Hierarchical Clustering",
"Spanning Tree"
],
"authors": [
{
"givenName": "Jianbin",
"surname": "Huang",
"fullName": "Jianbin Huang",
"affiliation": "Xidian University, Xi'an",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Heli",
"surname": "Sun",
"fullName": "Heli Sun",
"affiliation": "Xi'an Jiaotong University, Xi'an",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qinbao",
"surname": "Song",
"fullName": "Qinbao Song",
"affiliation": "Xi'an Jiaotong University, Xi'an",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongbo",
"surname": "Deng",
"fullName": "Hongbo Deng",
"affiliation": "University of Illinois at Urbana-Champaign, Urbana",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiawei",
"surname": "Han",
"fullName": "Jiawei Han",
"affiliation": "University of Illinois at Urbana-Champaign, Urbana",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2013-08-01 00:00:00",
"pubType": "trans",
"pages": "1876-1889",
"year": "2013",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icycs/2008/3398/0/3398b783",
"title": "The Density Connectivity Information Bottleneck",
"doi": null,
"abstractUrl": "/proceedings-article/icycs/2008/3398b783/12OmNAWH9Dg",
"parentPublication": {
"id": "proceedings/icycs/2008/3398/0",
"title": "2008 9th International Conference for Young Computer Scientists",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2017/3800/0/3800a033",
"title": "Accelerated Hierarchical Density Based Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2017/3800a033/12OmNAZx8SY",
"parentPublication": {
"id": "proceedings/icdmw/2017/3800/0",
"title": "2017 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icinis/2011/4543/0/4543a013",
"title": "A Clustering Algorithm Based on Square Inaccuracy Density",
"doi": null,
"abstractUrl": "/proceedings-article/icinis/2011/4543a013/12OmNBI6acS",
"parentPublication": {
"id": "proceedings/icinis/2011/4543/0",
"title": "Intelligent Networks and Intelligent Systems, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aici/2009/3816/4/3816d260",
"title": "A Grid and Density Based Fast Spatial Clustering Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/aici/2009/3816d260/12OmNvBIROn",
"parentPublication": {
"id": "proceedings/aici/2009/3816/4",
"title": "2009 International Conference on Artificial Intelligence and Computational Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wkdd/2009/3543/0/3543a644",
"title": "Unifying Density-Based Clustering and Outlier Detection",
"doi": null,
"abstractUrl": "/proceedings-article/wkdd/2009/3543a644/12OmNvDqsPE",
"parentPublication": {
"id": "proceedings/wkdd/2009/3543/0",
"title": "2009 Second International Workshop on Knowledge Discovery and Data Mining. WKDD 2009",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2010/4256/0/4256a481",
"title": "gSkeletonClu: Density-Based Network Clustering via Structure-Connected Tree Division or Agglomeration",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2010/4256a481/12OmNwoPtyk",
"parentPublication": {
"id": "proceedings/icdm/2010/4256/0",
"title": "2010 IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2009/07/ttk2009070945",
"title": "A Divide-and-Conquer Approach for Minimum Spanning Tree-Based Clustering",
"doi": null,
"abstractUrl": "/journal/tk/2009/07/ttk2009070945/13rRUwdrdSO",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10100887",
"title": "DEMOS: Clustering by Pruning a Density-Boosting Cluster Tree of Density Mounts",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10100887/1MhE5YsaOt2",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/06/08906027",
"title": "A Domain Adaptive Density Clustering Algorithm for Data With Varying Density Distribution",
"doi": null,
"abstractUrl": "/journal/tk/2021/06/08906027/1f5qKGU8lSo",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/01/09044397",
"title": "RDMN: A Relative Density Measure Based on MST Neighborhood for Clustering Multi-Scale Datasets",
"doi": null,
"abstractUrl": "/journal/tk/2022/01/09044397/1kepUfDIGru",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttk2013081863",
"articleId": "13rRUwbaqVh",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttk2013081890",
"articleId": "13rRUIJuxpV",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrFBPWA",
"title": "Mar.-Apr.",
"year": "2014",
"issueNum": "02",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "34",
"label": "Mar.-Apr.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIJuxxX",
"doi": "10.1109/MCG.2014.2",
"abstract": "Evolutionary relationships between organisms are frequently derived as phylogenetic trees inferred from multiple sequence alignments (MSAs). The MSA parameter space is exponentially large, so tens of thousands of potential trees can emerge for each dataset. A proposed visual-analytics approach can reveal the parameters' impact on the trees. Given input trees created with different parameter settings, it hierarchically clusters the trees according to their structural similarity. The most important clusters of similar trees are shown together with their parameters. This view offers interactive parameter exploration and automatic identification of relevant parameters. Biologists applied this approach to real data of 16S ribosomal RNA and protein sequences of ion channels. It revealed which parameters affected the tree structures. This led to a more reliable selection of the best trees.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Evolutionary relationships between organisms are frequently derived as phylogenetic trees inferred from multiple sequence alignments (MSAs). The MSA parameter space is exponentially large, so tens of thousands of potential trees can emerge for each dataset. A proposed visual-analytics approach can reveal the parameters' impact on the trees. Given input trees created with different parameter settings, it hierarchically clusters the trees according to their structural similarity. The most important clusters of similar trees are shown together with their parameters. This view offers interactive parameter exploration and automatic identification of relevant parameters. Biologists applied this approach to real data of 16S ribosomal RNA and protein sequences of ion channels. It revealed which parameters affected the tree structures. This led to a more reliable selection of the best trees.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Evolutionary relationships between organisms are frequently derived as phylogenetic trees inferred from multiple sequence alignments (MSAs). The MSA parameter space is exponentially large, so tens of thousands of potential trees can emerge for each dataset. A proposed visual-analytics approach can reveal the parameters' impact on the trees. Given input trees created with different parameter settings, it hierarchically clusters the trees according to their structural similarity. The most important clusters of similar trees are shown together with their parameters. This view offers interactive parameter exploration and automatic identification of relevant parameters. Biologists applied this approach to real data of 16S ribosomal RNA and protein sequences of ion channels. It revealed which parameters affected the tree structures. This led to a more reliable selection of the best trees.",
"title": "Visual Exploration of Parameter Influence on Phylogenetic Trees",
"normalizedTitle": "Visual Exploration of Parameter Influence on Phylogenetic Trees",
"fno": "mcg2014020048",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Phylogeny",
"Phylogenetic Trees",
"Analytical Models",
"Organisms",
"Visual Analytics",
"Computer Graphics",
"Visual Analytics",
"Tree Comparison",
"Parameter Selection",
"Phylogenetic Trees"
],
"authors": [
{
"givenName": "Martin",
"surname": "Hess",
"fullName": "Martin Hess",
"affiliation": "Tech. Univ. Darmstadt, Darmstadt, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sebastian",
"surname": "Bremm",
"fullName": "Sebastian Bremm",
"affiliation": "Tech. Univ. Darmstadt, Darmstadt, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stephanie",
"surname": "Weissgraeber",
"fullName": "Stephanie Weissgraeber",
"affiliation": "Tech. Univ. Darmstadt, Darmstadt, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kay",
"surname": "Hamacher",
"fullName": "Kay Hamacher",
"affiliation": "Tech. Univ. Darmstadt, Darmstadt, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Goesele",
"fullName": "Michael Goesele",
"affiliation": "Tech. Univ. Darmstadt, Darmstadt, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Josef",
"surname": "Wiemeyer",
"fullName": "Josef Wiemeyer",
"affiliation": "Tech. Univ. Darmstadt, Darmstadt, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tatiana",
"surname": "von Landesberger",
"fullName": "Tatiana von Landesberger",
"affiliation": "Tech. Univ. Darmstadt, Darmstadt, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2014-03-01 00:00:00",
"pubType": "mags",
"pages": "48-56",
"year": "2014",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibe/2001/1423/0/00974418",
"title": "Discovering common structural motifs from SSU 16 S ribosomal RNA secondary structures",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2001/00974418/12OmNBtCCMu",
"parentPublication": {
"id": "proceedings/bibe/2001/1423/0",
"title": "Proceedings 2nd Annual IEEE International Symposium on Bioinformatics and Bioengineering (BIBE 2001)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2008/3452/0/3452a239",
"title": "New Approaches to Compare Phylogenetic Search Heuristics",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2008/3452a239/12OmNyjtNH4",
"parentPublication": {
"id": "proceedings/bibm/2008/3452/0",
"title": "2008 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/1995/6921/0/69210165",
"title": "Molecular evolutionary phylogenetic trees based on minimum description length principle",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1995/69210165/12OmNzBOhv1",
"parentPublication": {
"id": "proceedings/hicss/1995/6921/0",
"title": "28th Hawaii International Conference on System Sciences (HICSS'95)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2012/02/ttb2012020372",
"title": "Algorithms for Reticulate Networks of Multiple Phylogenetic Trees",
"doi": null,
"abstractUrl": "/journal/tb/2012/02/ttb2012020372/13rRUEgs2rV",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2011/03/ttb2011030785",
"title": "Regular Networks Can be Uniquely Constructed from Their Trees",
"doi": null,
"abstractUrl": "/journal/tb/2011/03/ttb2011030785/13rRUILLku0",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2012/04/06109232",
"title": "A Metric for Phylogenetic Trees Based on Matching",
"doi": null,
"abstractUrl": "/journal/tb/2012/04/06109232/13rRUwhpBMU",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2004/04/n0151",
"title": "Phylogenetic Super-Networks from Partial Trees",
"doi": null,
"abstractUrl": "/journal/tb/2004/04/n0151/13rRUx0xQ6A",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/5555/01/ttb2011990020",
"title": "Matching Split Distance for Unrooted Binary Phylogenetic Trees",
"doi": null,
"abstractUrl": "/journal/tb/5555/01/ttb2011990020/13rRUxYIMTx",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2007/03/n0458",
"title": "Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable",
"doi": null,
"abstractUrl": "/journal/tb/2007/03/n0458/13rRUzphDwi",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2020/04/08554124",
"title": "imPhy: Imputing Phylogenetic Trees with Missing Information Using Mathematical Programming",
"doi": null,
"abstractUrl": "/journal/tb/2020/04/08554124/17D45XfSETx",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2014020038",
"articleId": "13rRUwhpBQ6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2014020058",
"articleId": "13rRUILLky0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvmXJ3E",
"title": "September",
"year": "1979",
"issueNum": "05",
"idPrefix": "ts",
"pubType": "journal",
"volume": "5",
"label": "September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjoNyw",
"doi": "10.1109/TSE.1979.234212",
"abstract": "Trees are extremely common data structures, both as internal objects and as models for program output. But it is unusual to see a program actually draw trees for visual inspection. Although part of the difficulty lies in programming graphics devices, most of the problem arises because naive algorithms to draw trees use too much drawing space and sophisticated algorithms are not obvious. We survey two naive tree drawers, formalize aesthetics for tidy trees, and descnbe two algorithms which draw tidy trees. One of the algorithms may be shown to require the minimum possible paper width. Along with the algorithms proper, we discuss the reasoning behind the algorithm development.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Trees are extremely common data structures, both as internal objects and as models for program output. But it is unusual to see a program actually draw trees for visual inspection. Although part of the difficulty lies in programming graphics devices, most of the problem arises because naive algorithms to draw trees use too much drawing space and sophisticated algorithms are not obvious. We survey two naive tree drawers, formalize aesthetics for tidy trees, and descnbe two algorithms which draw tidy trees. One of the algorithms may be shown to require the minimum possible paper width. Along with the algorithms proper, we discuss the reasoning behind the algorithm development.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Trees are extremely common data structures, both as internal objects and as models for program output. But it is unusual to see a program actually draw trees for visual inspection. Although part of the difficulty lies in programming graphics devices, most of the problem arises because naive algorithms to draw trees use too much drawing space and sophisticated algorithms are not obvious. We survey two naive tree drawers, formalize aesthetics for tidy trees, and descnbe two algorithms which draw tidy trees. One of the algorithms may be shown to require the minimum possible paper width. Along with the algorithms proper, we discuss the reasoning behind the algorithm development.",
"title": "Tidy Drawings of Trees",
"normalizedTitle": "Tidy Drawings of Trees",
"fno": "01702661",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Trees",
"Aesthetics",
"Binary Trees",
"Computer Graphics",
"Drawing Methods"
],
"authors": [
{
"givenName": "C.",
"surname": "Wetherell",
"fullName": "C. Wetherell",
"affiliation": "Computing Science Group, Department of Applied Science, University of California at Davis, and the Lawrence Livermore Laboratory",
"__typename": "ArticleAuthorType"
},
{
"givenName": "A.",
"surname": "Shannon",
"fullName": "A. Shannon",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "1979-09-01 00:00:00",
"pubType": "trans",
"pages": "514-520",
"year": "1979",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icis/2010/4147/0/4147a341",
"title": "An Attribute Graph Grammar Enabling Narrower Drawings of Trees",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2010/4147a341/12OmNvT2pi6",
"parentPublication": {
"id": "proceedings/icis/2010/4147/0",
"title": "Computer and Information Science, ACIS International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmpsac/1993/4440/0/00404192",
"title": "A method of drawing tree-structured program diagrams on the Euclidian plane",
"doi": null,
"abstractUrl": "/proceedings-article/cmpsac/1993/00404192/12OmNya72uS",
"parentPublication": {
"id": "proceedings/cmpsac/1993/4440/0",
"title": "Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2015/06/06964811",
"title": "Evolutionary Bayesian Rose Trees",
"doi": null,
"abstractUrl": "/journal/tk/2015/06/06964811/13rRUwbaqVi",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/1990/04/s4021",
"title": "Drawing Dynamic Trees",
"doi": null,
"abstractUrl": "/magazine/so/1990/04/s4021/13rRUwhpBMh",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1984/11/01676372",
"title": "Efficient Internode Communications in Reconfigurable Binary Trees",
"doi": null,
"abstractUrl": "/journal/tc/1984/11/01676372/13rRUxDItg5",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2000/02/l0136",
"title": "Parallel Construction of Multidimensional Binary Search Trees",
"doi": null,
"abstractUrl": "/journal/td/2000/02/l0136/13rRUxOdD29",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1979/07/01675391",
"title": "Synthesis of Minimal Binary Decision Trees",
"doi": null,
"abstractUrl": "/journal/tc/1979/07/01675391/13rRUxlgxSb",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1981/02/01702828",
"title": "Tidier Drawings of Trees",
"doi": null,
"abstractUrl": "/journal/ts/1981/02/01702828/13rRUxly8Uv",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2013/03/ttb2013030721",
"title": "On the Neighborhoods of Trees",
"doi": null,
"abstractUrl": "/journal/tb/2013/03/ttb2013030721/13rRUyuegnC",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2021/2354/0/235400a033",
"title": "Optimized 2D Ball Trees",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2021/235400a033/1zurrTfGfYY",
"parentPublication": {
"id": "proceedings/sibgrapi/2021/2354/0",
"title": "2021 34th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "01702660",
"articleId": "13rRUxNW20K",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01702662",
"articleId": "13rRUwIF6f8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBKEyo4",
"title": "April",
"year": "1984",
"issueNum": "04",
"idPrefix": "tc",
"pubType": "journal",
"volume": "33",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxYIMTX",
"doi": "10.1109/TC.1984.1676438",
"abstract": "A new multidimensional balanced tree structure is presented for the efficient management of multidimensional data. It is shown that the data structure can be used to manage a set of n k-dimensional records or data items such that the records can be searched or updated in O(log2 n) + k time, which is optimal. The data structure is a multidimensional generalization of the height-balanced trees and retains much of their simplicity and efficiency. The insertion algorithm, in particular, retains a very important property of the height-balanced trees: an insertion of a record results in the application of a restructuring operation at most once.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A new multidimensional balanced tree structure is presented for the efficient management of multidimensional data. It is shown that the data structure can be used to manage a set of n k-dimensional records or data items such that the records can be searched or updated in O(log2 n) + k time, which is optimal. The data structure is a multidimensional generalization of the height-balanced trees and retains much of their simplicity and efficiency. The insertion algorithm, in particular, retains a very important property of the height-balanced trees: an insertion of a record results in the application of a restructuring operation at most once.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A new multidimensional balanced tree structure is presented for the efficient management of multidimensional data. It is shown that the data structure can be used to manage a set of n k-dimensional records or data items such that the records can be searched or updated in O(log2 n) + k time, which is optimal. The data structure is a multidimensional generalization of the height-balanced trees and retains much of their simplicity and efficiency. The insertion algorithm, in particular, retains a very important property of the height-balanced trees: an insertion of a record results in the application of a restructuring operation at most once.",
"title": "Multidimensional Height-Balanced Trees",
"normalizedTitle": "Multidimensional Height-Balanced Trees",
"fno": "01676438",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Multidimensional Data Structures",
"Computational Geometry",
"Dynamic Databases",
"Height Balanced Trees",
"Information Storage And Retrieval",
"Multidimensional Algorithms",
"Multidimensional Balanced Tree Structures"
],
"authors": [
{
"givenName": "V.K.",
"surname": "Vaishnavi",
"fullName": "V.K. Vaishnavi",
"affiliation": "Department of Information Systems, Georgia State University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "1984-04-01 00:00:00",
"pubType": "trans",
"pages": "334-343",
"year": "1984",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/1988/0878/0/00028247",
"title": "MD-tree: a balanced hierarchical data structure for multidimensional data with highly efficient dynamic characteristics",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1988/00028247/12OmNARRYtM",
"parentPublication": {
"id": "proceedings/icpr/1988/0878/0",
"title": "9th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipps/1994/5602/0/0288202",
"title": "Concurrent search and insertion in K-Dimensional Height Balanced Trees",
"doi": null,
"abstractUrl": "/proceedings-article/ipps/1994/0288202/12OmNvkpld4",
"parentPublication": {
"id": "proceedings/ipps/1994/5602/0",
"title": "Parallel Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1981/08/01675838",
"title": "Tree Search in Major/Minor Loop Magnetic Bubble Memories",
"doi": null,
"abstractUrl": "/journal/tc/1981/08/01675838/13rRUIM2VAB",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1989/07/t0968",
"title": "Multidimensional Balanced Binary Trees",
"doi": null,
"abstractUrl": "/journal/tc/1989/07/t0968/13rRUwIF6d3",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1978/05/01675117",
"title": "Rebalancing Height Balanced Trees",
"doi": null,
"abstractUrl": "/journal/tc/1978/05/01675117/13rRUwhHcPI",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/1993/04/k0682",
"title": "A Balanced Hierarchical Data Structure for Multidimensional Data with Highly Efficient Dynamic Characteristics",
"doi": null,
"abstractUrl": "/journal/tk/1993/04/k0682/13rRUwjoNxe",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1976/01/05009208",
"title": "On the Height of Height-Balanced Trees",
"doi": null,
"abstractUrl": "/journal/tc/1976/01/05009208/13rRUx0xPgW",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/1996/07/l0717",
"title": "Balanced Spanning Trees in Complete and Incomplete Star Graphs",
"doi": null,
"abstractUrl": "/journal/td/1996/07/l0717/13rRUx0xPhC",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1986/09/01676837",
"title": "On the Height of Multidimensional Height-Balanced Trees",
"doi": null,
"abstractUrl": "/journal/tc/1986/09/01676837/13rRUxC0SNX",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2005/01/01386269",
"title": "On exploring inter-iteration parallelism within rate-balanced multirate multidimensional DSP algorithms",
"doi": null,
"abstractUrl": "/journal/si/2005/01/01386269/13rRUy2YLQv",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "01676437",
"articleId": "13rRUwfZBZ7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01676439",
"articleId": "13rRUxOdDbK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyr8YrP",
"title": "March/April",
"year": "1989",
"issueNum": "02",
"idPrefix": "so",
"pubType": "magazine",
"volume": "6",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxN5eBj",
"doi": "10.1109/52.23127",
"abstract": "The authors describe a novel design specification method, the tree-structured chart, that has been accepted widely in Japan because it improves productivity and quality. Tree-structured charts use representations of basic programming structures, such as sequence, selection, and iteration, as elements. The support environment then generates source code in many languages automatically. A design specification in a tree-structured chart is considered a program, so these charts will eventually replace conventional programming languages, thus raising the description level of programs. The authors present four design languages based on tree-structured charts: the Hierarchical and Compact Description chart, the Problem Analysis Diagram, the Structured Programming Diagram, and Yet Another Control Chart II. They also summarize their support environments, which incorporate many computer-aided software engineering (CASE) techniques.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The authors describe a novel design specification method, the tree-structured chart, that has been accepted widely in Japan because it improves productivity and quality. Tree-structured charts use representations of basic programming structures, such as sequence, selection, and iteration, as elements. The support environment then generates source code in many languages automatically. A design specification in a tree-structured chart is considered a program, so these charts will eventually replace conventional programming languages, thus raising the description level of programs. The authors present four design languages based on tree-structured charts: the Hierarchical and Compact Description chart, the Problem Analysis Diagram, the Structured Programming Diagram, and Yet Another Control Chart II. They also summarize their support environments, which incorporate many computer-aided software engineering (CASE) techniques.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The authors describe a novel design specification method, the tree-structured chart, that has been accepted widely in Japan because it improves productivity and quality. Tree-structured charts use representations of basic programming structures, such as sequence, selection, and iteration, as elements. The support environment then generates source code in many languages automatically. A design specification in a tree-structured chart is considered a program, so these charts will eventually replace conventional programming languages, thus raising the description level of programs. The authors present four design languages based on tree-structured charts: the Hierarchical and Compact Description chart, the Problem Analysis Diagram, the Structured Programming Diagram, and Yet Another Control Chart II. They also summarize their support environments, which incorporate many computer-aided software engineering (CASE) techniques.",
"title": "Design Specification in Japan: Tree-Structured Charts",
"normalizedTitle": "Design Specification in Japan: Tree-Structured Charts",
"fno": "s2031",
"hasPdf": true,
"idPrefix": "so",
"keywords": [
"Japan Tree Structured Charts Design Specification Programming Structures Support Environment Source Code Conventional Programming Languages Computer Aided Software Engineering Automatic Programming Data Structures Formal Specification Programming Environments Specification Languages Trees Mathematics"
],
"authors": [
{
"givenName": "Mikio",
"surname": "Aoyama",
"fullName": "Mikio Aoyama",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kazugasu",
"surname": "Miyamoto",
"fullName": "Kazugasu Miyamoto",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Noritoshi",
"surname": "Murakami",
"fullName": "Noritoshi Murakami",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hironobu",
"surname": "Nagano",
"fullName": "Hironobu Nagano",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yoshihiro",
"surname": "Oki",
"fullName": "Yoshihiro Oki",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "1989-03-01 00:00:00",
"pubType": "mags",
"pages": "31-37",
"year": "1989",
"issn": "0740-7459",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "s2023",
"articleId": "13rRUwbaqJN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "s2038",
"articleId": "13rRUxjQyfe",
"__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": "13rRUxBa5xa",
"doi": "10.1109/TVCG.2007.70550",
"abstract": "We present novel, comprehensive visualization techniques for the diagnosis of patients with Coronary Artery Disease using segmented cardiac MRI data. We extent an accepted medical visualization technique called the bull?s eye plot by removing discontinuities, preserving the volumetric nature of the left ventricular wall and adding anatomical context. The resulting volumetric bull?s eye plot can be used for the assessment of transmurality. We link these visualizations to a 3D view that presents viability information in a detailed anatomical context. We combine multiple MRI scans (whole heart anatomical data, late enhancement data) and multiple segmentations (polygonal heart model, late enhancement contours, coronary artery tree). By selectively combining different rendering techniques we obtain comprehensive yet intuitive visualizations of the various data sources.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present novel, comprehensive visualization techniques for the diagnosis of patients with Coronary Artery Disease using segmented cardiac MRI data. We extent an accepted medical visualization technique called the bull?s eye plot by removing discontinuities, preserving the volumetric nature of the left ventricular wall and adding anatomical context. The resulting volumetric bull?s eye plot can be used for the assessment of transmurality. We link these visualizations to a 3D view that presents viability information in a detailed anatomical context. We combine multiple MRI scans (whole heart anatomical data, late enhancement data) and multiple segmentations (polygonal heart model, late enhancement contours, coronary artery tree). By selectively combining different rendering techniques we obtain comprehensive yet intuitive visualizations of the various data sources.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present novel, comprehensive visualization techniques for the diagnosis of patients with Coronary Artery Disease using segmented cardiac MRI data. We extent an accepted medical visualization technique called the bull?s eye plot by removing discontinuities, preserving the volumetric nature of the left ventricular wall and adding anatomical context. The resulting volumetric bull?s eye plot can be used for the assessment of transmurality. We link these visualizations to a 3D view that presents viability information in a detailed anatomical context. We combine multiple MRI scans (whole heart anatomical data, late enhancement data) and multiple segmentations (polygonal heart model, late enhancement contours, coronary artery tree). By selectively combining different rendering techniques we obtain comprehensive yet intuitive visualizations of the various data sources.",
"title": "CoViCAD: Comprehensive Visualization of Coronary Artery Disease",
"normalizedTitle": "CoViCAD: Comprehensive Visualization of Coronary Artery Disease",
"fno": "v1632",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Biomedical MRI",
"Cardiology",
"Data Visualisation",
"Image Segmentation",
"Medical Image Processing",
"Co Vi CAD",
"Visualization",
"Coronary Artery Disease",
"Patient Diagnosis",
"Segmented Cardiac MRI Data",
"Medical Visualization",
"Bulls Eye Plot",
"Whole Heart Anatomical Data",
"Late Enhancement Data",
"Polygonal Heart Model",
"Late Enhancement Contours",
"Coronary Artery Tree",
"Coronary Arteriosclerosis",
"Magnetic Resonance Imaging",
"Data Visualization",
"Heart",
"Myocardium",
"Arteries",
"Muscles",
"Medical Diagnostic Imaging",
"Blood",
"Protocols",
"Cardiac MRI",
"Late Enhancement",
"Viability",
"Bulls Eye Plot"
],
"authors": [
{
"givenName": "Maurice",
"surname": "Termeer",
"fullName": "Maurice Termeer",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Javier",
"surname": "Oliván Bescós",
"fullName": "Javier Oliván Bescós",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marcel",
"surname": "Breeuwer",
"fullName": "Marcel Breeuwer",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anna",
"surname": "Vilanova",
"fullName": "Anna Vilanova",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Frans",
"surname": "Gerritsen",
"fullName": "Frans Gerritsen",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eduard",
"surname": "Gröller",
"fullName": "Eduard Gröller",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2007-11-01 00:00:00",
"pubType": "trans",
"pages": "1632-1639",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibe/2007/1509/0/04375574",
"title": "Calcium De-blooming in Coronary CT Image",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2007/04375574/12OmNBEGYIh",
"parentPublication": {
"id": "proceedings/bibe/2007/1509/0",
"title": "7th IEEE International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/esciencew/2010/4295/0/4295a039",
"title": "Haemodynamic Effect of Coronary Angulations on Subsequent Development of Coronary Artery Disease: A Preliminary Study",
"doi": null,
"abstractUrl": "/proceedings-article/esciencew/2010/4295a039/12OmNCctfdQ",
"parentPublication": {
"id": "proceedings/esciencew/2010/4295/0",
"title": "2010 Sixth IEEE International Conference on e-Science Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd/2008/3263/0/3263a513",
"title": "Novelty towards Hybrid Segmentation of Coronary Artery in CT Cardiac Images",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2008/3263a513/12OmNxw5BbZ",
"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/icdmw/2012/4925/0/4925a009",
"title": "Diagnosis of Coronary Artery Disease Using Cost-Sensitive Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2012/4925a009/12OmNy50g7U",
"parentPublication": {
"id": "proceedings/icdmw/2012/4925/0",
"title": "2012 IEEE 12th International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cic/1989/2114/0/00130473",
"title": "Neural networks in detection of coronary artery disease",
"doi": null,
"abstractUrl": "/proceedings-article/cic/1989/00130473/12OmNyz5JX8",
"parentPublication": {
"id": "proceedings/cic/1989/2114/0",
"title": "Proceedings Computers in Cardiology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cash/2014/8822/0/8822a018",
"title": "Cardiac Components Categorization and Coronary Artery Enhancement in CT Angiography",
"doi": null,
"abstractUrl": "/proceedings-article/cash/2014/8822a018/12OmNzV70AK",
"parentPublication": {
"id": "proceedings/cash/2014/8822/0",
"title": "2014 International Conference on Computer Assisted System in Health (CASH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2010/9167/0/06042656",
"title": "Flow simulation in coronary artery models: An investigation of the effect of variable angulations at the left coronary artery",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2010/06042656/12OmNzV70DG",
"parentPublication": {
"id": "proceedings/cbms/2010/9167/0",
"title": "2010 IEEE 23rd International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etd/1995/7085/0/00403483",
"title": "A comparative study of artificial intelligent techniques in the detection of coronary artery disease",
"doi": null,
"abstractUrl": "/proceedings-article/etd/1995/00403483/12OmNzdoMBm",
"parentPublication": {
"id": "proceedings/etd/1995/7085/0",
"title": "Proceedings Electronic Technology Directions to the Year 2000",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061595",
"title": "Visualization of Myocardial Perfusion Derived from Coronary Anatomy",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061595/13rRUxOdD8d",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1624",
"articleId": "13rRUxASuSI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1640",
"articleId": "13rRUy3gn7p",
"__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": "13rRUyYjKa8",
"doi": "10.1109/TVCG.2008.136",
"abstract": "Myocardial perfusion imaging with single photon emission computed tomography (SPECT) is an established method for the detection and evaluation of coronary artery disease (CAD). State-of-the-art SPECT scanners yield a large number of regional parameters of the left-ventricular myocardium (e.g., blood supply at rest and during stress, wall thickness, and wall thickening during heart contraction) that all need to be assessed by the physician. Today, the individual parameters of this multivariate data set are displayed as stacks of 2D slices, bull's eye plots, or, more recently, surfaces in 3D, which depict the left-ventricular wall. In all these visualizations, the data sets are displayed side-by-side rather than in an integrated manner, such that the multivariate data have to be examined sequentially and need to be fused mentally. This is time consuming and error-prone. In this paper we present an interactive 3D glyph visualization, which enables an effective integrated visualization of the multivariate data. Results from semiotic theory are used to optimize the mapping of different variables to glyph properties. This facilitates an improved perception of important information and thus an accelerated diagnosis. The 3D glyphs are linked to the established 2D views, which permit a more detailed inspection, and to relevant meta-information such as known stenoses of coronary vessels supplying the myocardial region. Our method has demonstrated its potential for clinical routine use in real application scenarios assessed by nuclear physicians.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Myocardial perfusion imaging with single photon emission computed tomography (SPECT) is an established method for the detection and evaluation of coronary artery disease (CAD). State-of-the-art SPECT scanners yield a large number of regional parameters of the left-ventricular myocardium (e.g., blood supply at rest and during stress, wall thickness, and wall thickening during heart contraction) that all need to be assessed by the physician. Today, the individual parameters of this multivariate data set are displayed as stacks of 2D slices, bull's eye plots, or, more recently, surfaces in 3D, which depict the left-ventricular wall. In all these visualizations, the data sets are displayed side-by-side rather than in an integrated manner, such that the multivariate data have to be examined sequentially and need to be fused mentally. This is time consuming and error-prone. In this paper we present an interactive 3D glyph visualization, which enables an effective integrated visualization of the multivariate data. Results from semiotic theory are used to optimize the mapping of different variables to glyph properties. This facilitates an improved perception of important information and thus an accelerated diagnosis. The 3D glyphs are linked to the established 2D views, which permit a more detailed inspection, and to relevant meta-information such as known stenoses of coronary vessels supplying the myocardial region. Our method has demonstrated its potential for clinical routine use in real application scenarios assessed by nuclear physicians.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Myocardial perfusion imaging with single photon emission computed tomography (SPECT) is an established method for the detection and evaluation of coronary artery disease (CAD). State-of-the-art SPECT scanners yield a large number of regional parameters of the left-ventricular myocardium (e.g., blood supply at rest and during stress, wall thickness, and wall thickening during heart contraction) that all need to be assessed by the physician. Today, the individual parameters of this multivariate data set are displayed as stacks of 2D slices, bull's eye plots, or, more recently, surfaces in 3D, which depict the left-ventricular wall. In all these visualizations, the data sets are displayed side-by-side rather than in an integrated manner, such that the multivariate data have to be examined sequentially and need to be fused mentally. This is time consuming and error-prone. In this paper we present an interactive 3D glyph visualization, which enables an effective integrated visualization of the multivariate data. Results from semiotic theory are used to optimize the mapping of different variables to glyph properties. This facilitates an improved perception of important information and thus an accelerated diagnosis. The 3D glyphs are linked to the established 2D views, which permit a more detailed inspection, and to relevant meta-information such as known stenoses of coronary vessels supplying the myocardial region. Our method has demonstrated its potential for clinical routine use in real application scenarios assessed by nuclear physicians.",
"title": "Glyph-Based SPECT Visualization for the Diagnosis of Coronary Artery Disease",
"normalizedTitle": "Glyph-Based SPECT Visualization for the Diagnosis of Coronary Artery Disease",
"fno": "ttg2008061499",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Multivariate Visualization",
"Glyph Techniques",
"SPECT",
"Myocardial Perfusion Imaging"
],
"authors": [
{
"givenName": "Jennis",
"surname": "Meyer-Spradow",
"fullName": "Jennis Meyer-Spradow",
"affiliation": "Visualization and Computer Graphics Research Group (VisCG), University of Münster",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lars",
"surname": "Stegger",
"fullName": "Lars Stegger",
"affiliation": "Department of Nuclear Medicine, University Hospital of Münster",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christian",
"surname": "Döring",
"fullName": "Christian Döring",
"affiliation": "Visualization and Computer Graphics Research Group (VisCG), University of Münster",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Timo",
"surname": "Ropinski",
"fullName": "Timo Ropinski",
"affiliation": "Visualization and Computer Graphics Research Group (VisCG), University of Münster",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Klaus",
"surname": "Hinrichs",
"fullName": "Klaus Hinrichs",
"affiliation": "Visualization and Computer Graphics Research Group (VisCG), University of Münster",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1499-1506",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibe/2012/4357/0/06399675",
"title": "Evaluation of T-wave alternans in comparison with ECG stress test and scintigraphic examination in patients with coronary artery disease",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2012/06399675/12OmNBQTJkw",
"parentPublication": {
"id": "proceedings/bibe/2012/4357/0",
"title": "2012 IEEE 12th International Conference on Bioinformatics & Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1995/7310/2/73102480",
"title": "Cardiac SPECT restoration using MR-based support constraints",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1995/73102480/12OmNBl6EE3",
"parentPublication": {
"id": "proceedings/icip/1995/7310/2",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/esciencew/2010/4295/0/4295a039",
"title": "Haemodynamic Effect of Coronary Angulations on Subsequent Development of Coronary Artery Disease: A Preliminary Study",
"doi": null,
"abstractUrl": "/proceedings-article/esciencew/2010/4295a039/12OmNCctfdQ",
"parentPublication": {
"id": "proceedings/esciencew/2010/4295/0",
"title": "2010 Sixth IEEE International Conference on e-Science Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2015/6775/0/6775a072",
"title": "Segmentation and Registration Methods in Short Axis Cardiac MRI and SPECT Images in Chagas Disease",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2015/6775a072/12OmNrYlmUr",
"parentPublication": {
"id": "proceedings/cbms/2015/6775/0",
"title": "2015 IEEE 28th International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/1996/7668/0/76680066",
"title": "Minimally-immersive interactive volumetric information visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/1996/76680066/12OmNwtWfDR",
"parentPublication": {
"id": "proceedings/ieee-infovis/1996/7668/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/synasc/2008/3523/0/3523a243",
"title": "Automatic Assessment of Cardiac Artery Disease by Using DCAD Module",
"doi": null,
"abstractUrl": "/proceedings-article/synasc/2008/3523a243/12OmNzn38Sl",
"parentPublication": {
"id": "proceedings/synasc/2008/3523/0",
"title": "2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1632",
"title": "CoViCAD: Comprehensive Visualization of Coronary Artery Disease",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1632/13rRUxBa5xa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122603",
"title": "Taxonomy-Based Glyph Design—with a Case Study on Visualizing Workflows of Biological Experiments",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122603/13rRUxD9h57",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412674",
"title": "Prediction of Obstructive Coronary Artery Disease from Myocardial Perfusion Scintigraphy using Deep Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412674/1tmhT7OZSPS",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061475",
"articleId": "13rRUyuegp2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061507",
"articleId": "13rRUwIF6dH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesV0",
"name": "ttg2008061499.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2008061499.zip",
"extension": "zip",
"size": "14.9 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxGAKWC",
"title": "Jan.-Mar.",
"year": "2013",
"issueNum": "01",
"idPrefix": "pc",
"pubType": "magazine",
"volume": "12",
"label": "Jan.-Mar.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0genK",
"doi": "10.1109/MPRV.2012.58",
"abstract": "Technological support for sustainable home use lies in more subtle and contextually appropriate interventions that integrate informative models of occupant behavior, provide hybrid levels of automated control, and use ambient sensing for localized decisions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Technological support for sustainable home use lies in more subtle and contextually appropriate interventions that integrate informative models of occupant behavior, provide hybrid levels of automated control, and use ambient sensing for localized decisions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Technological support for sustainable home use lies in more subtle and contextually appropriate interventions that integrate informative models of occupant behavior, provide hybrid levels of automated control, and use ambient sensing for localized decisions.",
"title": "A Smarter Smart Home: Case Studies of Ambient Intelligence",
"normalizedTitle": "A Smarter Smart Home: Case Studies of Ambient Intelligence",
"fno": "mpc2013010058",
"hasPdf": true,
"idPrefix": "pc",
"keywords": [
"Automation",
"Smart Homes",
"Sensors",
"Thermostats",
"Context",
"Educational Institutions",
"Pervasive Computing",
"Smart Home",
"Ambient Intelligence",
"Adaptive Lighting",
"Adaptive HVAC"
],
"authors": [
{
"givenName": "Stephen",
"surname": "Makonin",
"fullName": "Stephen Makonin",
"affiliation": "Simon Fraser University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lyn",
"surname": "Bartram",
"fullName": "Lyn Bartram",
"affiliation": "Simon Fraser University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fred",
"surname": "Popowich",
"fullName": "Fred Popowich",
"affiliation": "Simon Fraser University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2013-01-01 00:00:00",
"pubType": "mags",
"pages": "58-66",
"year": "2013",
"issn": "1536-1268",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ie/2011/4452/0/4452a310",
"title": "Multi-agent Interactions for Ambient Assisted Living",
"doi": null,
"abstractUrl": "/proceedings-article/ie/2011/4452a310/12OmNB836Lu",
"parentPublication": {
"id": "proceedings/ie/2011/4452/0",
"title": "Intelligent Environments, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2010/4191/3/4191c361",
"title": "Ambient Intelligence at the Beach",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2010/4191c361/12OmNrAdsCQ",
"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/nbis/2012/4779/0/4779a703",
"title": "Ambient Widget: An Ambient Information System Using Gesture-Based Interactions",
"doi": null,
"abstractUrl": "/proceedings-article/nbis/2012/4779a703/12OmNxvwp1t",
"parentPublication": {
"id": "proceedings/nbis/2012/4779/0",
"title": "2012 15th International Conference on Network-Based Information Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2014/5669/0/06999237",
"title": "Inferring health metrics from ambient smart home data",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2014/06999237/12OmNyoSbg2",
"parentPublication": {
"id": "proceedings/bibm/2014/5669/0",
"title": "2014 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ares/2009/3564/0/3564a420",
"title": "AVISPA in the Validation of Ambient Intelligence Scenarios",
"doi": null,
"abstractUrl": "/proceedings-article/ares/2009/3564a420/12OmNzZmZrL",
"parentPublication": {
"id": "proceedings/ares/2009/3564/0",
"title": "2009 International Conference on Availability, Reliability and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/computationworld/2009/3862/0/3862a277",
"title": "Design Patterns in Ambient Intelligence",
"doi": null,
"abstractUrl": "/proceedings-article/computationworld/2009/3862a277/12OmNzwpUlG",
"parentPublication": {
"id": "proceedings/computationworld/2009/3862/0",
"title": "Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns, Computation World",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2015/03/mex2015030060",
"title": "Engineering ambient intelligence systems using agent technology",
"doi": null,
"abstractUrl": "/magazine/ex/2015/03/mex2015030060/13rRUNvgzez",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2003/04/x4002",
"title": "From the Editor in Chief: Ambient Intelligence",
"doi": null,
"abstractUrl": "/magazine/ex/2003/04/x4002/13rRUxCRFSn",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itnac/2019/3673/0/09078001",
"title": "Ambient Intelligence for Smart Home using The Internet of Things",
"doi": null,
"abstractUrl": "/proceedings-article/itnac/2019/09078001/1joXs5yk12w",
"parentPublication": {
"id": "proceedings/itnac/2019/3673/0",
"title": "2019 29th International Telecommunication Networks and Applications Conference (ITNAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smartcomp/2020/6997/0/699700a180",
"title": "Smart Auctions for Autonomic Ambient Intelligence Systems",
"doi": null,
"abstractUrl": "/proceedings-article/smartcomp/2020/699700a180/1oxocldigh2",
"parentPublication": {
"id": "proceedings/smartcomp/2020/6997/0",
"title": "2020 IEEE International Conference on Smart Computing (SMARTCOMP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mpc2013010044",
"articleId": "13rRUwgQpob",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mpc2013010068",
"articleId": "13rRUxAAT4y",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1H0GlRvv21y",
"doi": "10.1109/TVCG.2022.3209367",
"abstract": "Visualizations today are used across a wide range of languages and cultures. Yet the extent to which language impacts how we reason about data and visualizations remains unclear. In this paper, we explore the intersection of visualization and language through a cross-language study on estimative probability tasks with icon-array visualizations. Across Arabic, English, French, German, and Mandarin, <inline-formula><tex-math notation=\"LaTeX\">Z_$n=50$_Z</tex-math></inline-formula> participants per language both chose probability expressions — <italic>e.g. likely, probable</italic> — to describe icon-array visualizations (Vis-to-Expression), and drew icon-array visualizations to match a given expression (Expression-to-Vis). Results suggest that there is no clear one-to-one mapping of probability expressions and associated visual ranges between languages. Several translated expressions fell significantly above or below the range of the corresponding English expressions. Compared to other languages, French and German respondents appear to exhibit high levels of consistency between the visualizations they drew and the words they chose. Participants across languages used similar words when describing scenarios above 80% chance, with more variance in expressions targeting mid-range and lower values. We discuss how these results suggest potential differences in the expressiveness of language as it relates to visualization interpretation and design goals, as well as practical implications for translation efforts and future studies at the intersection of languages, culture, and visualization. Experiment data, source code, and analysis scripts are available at the following repository: <uri>https://osf.io/g5d4r/</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visualizations today are used across a wide range of languages and cultures. Yet the extent to which language impacts how we reason about data and visualizations remains unclear. In this paper, we explore the intersection of visualization and language through a cross-language study on estimative probability tasks with icon-array visualizations. Across Arabic, English, French, German, and Mandarin, <inline-formula><tex-math notation=\"LaTeX\">$n=50$</tex-math><alternatives><graphic position=\"float\" orientation=\"portrait\" xlink:href=\"tvcg-rakotondravony-3209367-eqinline-1-small.tif\"/></alternatives></inline-formula> participants per language both chose probability expressions — <italic>e.g. likely, probable</italic> — to describe icon-array visualizations (Vis-to-Expression), and drew icon-array visualizations to match a given expression (Expression-to-Vis). Results suggest that there is no clear one-to-one mapping of probability expressions and associated visual ranges between languages. Several translated expressions fell significantly above or below the range of the corresponding English expressions. Compared to other languages, French and German respondents appear to exhibit high levels of consistency between the visualizations they drew and the words they chose. Participants across languages used similar words when describing scenarios above 80% chance, with more variance in expressions targeting mid-range and lower values. We discuss how these results suggest potential differences in the expressiveness of language as it relates to visualization interpretation and design goals, as well as practical implications for translation efforts and future studies at the intersection of languages, culture, and visualization. Experiment data, source code, and analysis scripts are available at the following repository: <uri>https://osf.io/g5d4r/</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visualizations today are used across a wide range of languages and cultures. Yet the extent to which language impacts how we reason about data and visualizations remains unclear. In this paper, we explore the intersection of visualization and language through a cross-language study on estimative probability tasks with icon-array visualizations. Across Arabic, English, French, German, and Mandarin, - participants per language both chose probability expressions — e.g. likely, probable — to describe icon-array visualizations (Vis-to-Expression), and drew icon-array visualizations to match a given expression (Expression-to-Vis). Results suggest that there is no clear one-to-one mapping of probability expressions and associated visual ranges between languages. Several translated expressions fell significantly above or below the range of the corresponding English expressions. Compared to other languages, French and German respondents appear to exhibit high levels of consistency between the visualizations they drew and the words they chose. Participants across languages used similar words when describing scenarios above 80% chance, with more variance in expressions targeting mid-range and lower values. We discuss how these results suggest potential differences in the expressiveness of language as it relates to visualization interpretation and design goals, as well as practical implications for translation efforts and future studies at the intersection of languages, culture, and visualization. Experiment data, source code, and analysis scripts are available at the following repository: https://osf.io/g5d4r/.",
"title": "<italic>Probablement, Wahrscheinlich, Likely</italic>? A Cross-Language Study of How People Verbalize Probabilities in Icon Array Visualizations",
"normalizedTitle": "Probablement, Wahrscheinlich, Likely? A Cross-Language Study of How People Verbalize Probabilities in Icon Array Visualizations",
"fno": "09904569",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Graphical User Interfaces",
"Language Translation",
"Natural Languages",
"Probability",
"Corresponding English Expressions",
"Cross Language Study",
"Estimative Probability Tasks",
"Icon Array Visualizations",
"Probability Expressions E G",
"Visual Ranges",
"Visualization Interpretation",
"Visualizations Today",
"Visualization",
"Climate Change",
"Codes",
"Pandemics",
"Soft Sensors",
"Sociology",
"Data Visualization",
"Visualization",
"Cross Language Study",
"Icon Arrays"
],
"authors": [
{
"givenName": "Noëlle",
"surname": "Rakotondravony",
"fullName": "Noëlle Rakotondravony",
"affiliation": "Worcester Polytechnic Institute, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yiren",
"surname": "Ding",
"fullName": "Yiren Ding",
"affiliation": "Worcester Polytechnic Institute, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lane",
"surname": "Harrison",
"fullName": "Lane Harrison",
"affiliation": "Worcester Polytechnic Institute, United States",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "1189-1199",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ozchi/1996/7525/0/75250012",
"title": "Automated General Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/ozchi/1996/75250012/12OmNBZYTnu",
"parentPublication": {
"id": "proceedings/ozchi/1996/7525/0",
"title": "Proceedings Sixth Australian Conference on Computer-Human Interaction",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/jcdl/2005/876/0/04118607",
"title": "Icon abacus and ghost icons",
"doi": null,
"abstractUrl": "/proceedings-article/jcdl/2005/04118607/12OmNClQ0AM",
"parentPublication": {
"id": "proceedings/jcdl/2005/876/0",
"title": "Proceedings of the 5th ACM/IEEE Joint Conference on Digital Libraries",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2004/8779/0/87790159",
"title": "Building Highly-Coordinated Visualizations in Improvise",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2004/87790159/12OmNqBtiFh",
"parentPublication": {
"id": "proceedings/ieee-infovis/2004/8779/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2016/8942/0/8942a324",
"title": "Visual Corpus Interface -- Putting Text Visualizations at Use",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2016/8942a324/12OmNwkzuvE",
"parentPublication": {
"id": "proceedings/iv/2016/8942/0",
"title": "2016 20th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2005/2397/0/23970103",
"title": "Icon-Based Visualization Using Mosaic Metaphors",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2005/23970103/12OmNzBwGAp",
"parentPublication": {
"id": "proceedings/iv/2005/2397/0",
"title": "Ninth International Conference on Information Visualisation (IV'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1983/01/01703016",
"title": "Measuring the Performance and Behavior of Icon Programs",
"doi": null,
"abstractUrl": "/journal/ts/1983/01/01703016/13rRUNvya2y",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904455",
"title": "Multiple Forecast Visualizations (MFVs): Trade-offs in Trust and Performance in Multiple COVID-19 Forecast Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904455/1H1gjlaBqVO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/edoc/2019/2702/0/270200a132",
"title": "Modelling the Semantics for Model-Driven Interactive Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/edoc/2019/270200a132/1grPYiG4sbC",
"parentPublication": {
"id": "proceedings/edoc/2019/2702/0",
"title": "2019 IEEE 23rd International Enterprise Distributed Object Computing Conference (EDOC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2020/04/09117084",
"title": "Close Reading for Visualization Evaluation",
"doi": null,
"abstractUrl": "/magazine/cg/2020/04/09117084/1kGgoDW7R2E",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222102",
"title": "Communicative Visualizations as a Learning Problem",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222102/1nTr1JohElO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09904461",
"articleId": "1H1gkbJeuas",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09910021",
"articleId": "1Hcj6hoXqkU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvwoNG",
"title": "April",
"year": "1993",
"issueNum": "04",
"idPrefix": "tp",
"pubType": "journal",
"volume": "15",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvyag2",
"doi": "10.1109/34.206960",
"abstract": "Translations with piecewise cubic trajectories are studied in the frequency domain. This class of motion has as an important subcase: cubic spline trajectories. Translations with trajectories depending on time with general polynomial law are preliminarily considered, and a general theorem concerning this type of motion is introduced. The application of this theorem to the case of cubic time dependence and the consideration of finite-duration effects lead to the solution of the piecewise cubic trajectory case. The results, which are remarkably different from those concerning constant velocity translations, clearly indicate the importance of the role of velocity and time duration. In this respect, they confirm the validity of constant velocity motion as a first-order model for frequency domain analysis of motion.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Translations with piecewise cubic trajectories are studied in the frequency domain. This class of motion has as an important subcase: cubic spline trajectories. Translations with trajectories depending on time with general polynomial law are preliminarily considered, and a general theorem concerning this type of motion is introduced. The application of this theorem to the case of cubic time dependence and the consideration of finite-duration effects lead to the solution of the piecewise cubic trajectory case. The results, which are remarkably different from those concerning constant velocity translations, clearly indicate the importance of the role of velocity and time duration. In this respect, they confirm the validity of constant velocity motion as a first-order model for frequency domain analysis of motion.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Translations with piecewise cubic trajectories are studied in the frequency domain. This class of motion has as an important subcase: cubic spline trajectories. Translations with trajectories depending on time with general polynomial law are preliminarily considered, and a general theorem concerning this type of motion is introduced. The application of this theorem to the case of cubic time dependence and the consideration of finite-duration effects lead to the solution of the piecewise cubic trajectory case. The results, which are remarkably different from those concerning constant velocity translations, clearly indicate the importance of the role of velocity and time duration. In this respect, they confirm the validity of constant velocity motion as a first-order model for frequency domain analysis of motion.",
"title": "Frequency Domain Analysis of Translations with Piecewise Cubic Trajectories",
"normalizedTitle": "Frequency Domain Analysis of Translations with Piecewise Cubic Trajectories",
"fno": "i0411",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Frequency Domain Motion Analysis Motion Estimation Translations Piecewise Cubic Trajectories Cubic Spline Trajectories Finite Duration Effects Constant Velocity Motion First Order Model Frequency Domain Analysis Motion Estimation Splines Mathematics"
],
"authors": [
{
"givenName": "G.",
"surname": "Cortelazzo",
"fullName": "G. Cortelazzo",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "M.",
"surname": "Balanza",
"fullName": "M. Balanza",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "1993-04-01 00:00:00",
"pubType": "trans",
"pages": "411-416",
"year": "1993",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0401",
"articleId": "13rRUxASu1B",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyRxFiQ",
"title": "January/February",
"year": "2012",
"issueNum": "01",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "32",
"label": "January/February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwcS1uV",
"doi": "10.1109/MCG.2011.88",
"abstract": "Trajectories capture the movements of objects with multiple attributes. A visualization method called density maps shows trends in these trajectories. Density map creation involves aggregating smoothed trajectories in a density field and then visualizing the field. Users can explore attributes along trajectories by calculating a density field for multiple data subsets. The method then either combines these density fields into a new density field or visualizes them and then combines them. Using an interactive distribution map, users can define subsets and, supported by graphics hardware, get fast feedback for these computationally expensive density field calculations. Given the generic method and the lack of domain-specific assumptions, this method might also be applicable for trajectories in other domains.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Trajectories capture the movements of objects with multiple attributes. A visualization method called density maps shows trends in these trajectories. Density map creation involves aggregating smoothed trajectories in a density field and then visualizing the field. Users can explore attributes along trajectories by calculating a density field for multiple data subsets. The method then either combines these density fields into a new density field or visualizes them and then combines them. Using an interactive distribution map, users can define subsets and, supported by graphics hardware, get fast feedback for these computationally expensive density field calculations. Given the generic method and the lack of domain-specific assumptions, this method might also be applicable for trajectories in other domains.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Trajectories capture the movements of objects with multiple attributes. A visualization method called density maps shows trends in these trajectories. Density map creation involves aggregating smoothed trajectories in a density field and then visualizing the field. Users can explore attributes along trajectories by calculating a density field for multiple data subsets. The method then either combines these density fields into a new density field or visualizes them and then combines them. Using an interactive distribution map, users can define subsets and, supported by graphics hardware, get fast feedback for these computationally expensive density field calculations. Given the generic method and the lack of domain-specific assumptions, this method might also be applicable for trajectories in other domains.",
"title": "Interactive Density Maps for Moving Objects",
"normalizedTitle": "Interactive Density Maps for Moving Objects",
"fno": "mcg2012010056",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Trajectory",
"Image Color Analysis",
"Density Measurement",
"Data Visualization",
"Rendering Computer Graphics",
"Smoothing Methods",
"Object Recognition",
"Computer Graphics",
"Trajectories",
"Multivariate Data",
"Smoothing",
"Kernel Density Estimation"
],
"authors": [
{
"givenName": "Roeland",
"surname": "Scheepens",
"fullName": "Roeland Scheepens",
"affiliation": "Eindhoven University of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Niels",
"surname": "Willems",
"fullName": "Niels Willems",
"affiliation": "Eindhoven University of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huub",
"surname": "van de Wetering",
"fullName": "Huub van de Wetering",
"affiliation": "Eindhoven University of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jarke J.",
"surname": "van Wijk",
"fullName": "Jarke J. van Wijk",
"affiliation": "Eindhoven University of Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2012-01-01 00:00:00",
"pubType": "mags",
"pages": "56-66",
"year": "2012",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ism/2013/2171/0/06746474",
"title": "Contextualized Privacy Filters in Video Surveillance Using Crowd Density Maps",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2013/06746474/12OmNAS9zqe",
"parentPublication": {
"id": "proceedings/ism/2013/2171/0",
"title": "2013 IEEE International Symposium on Multimedia (ISM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ivapp/2014/8132/0/07294450",
"title": "Hardware-accelerated attribute mapping for interactive visualization of complex 3D trajectories",
"doi": null,
"abstractUrl": "/proceedings-article/ivapp/2014/07294450/12OmNBdru8w",
"parentPublication": {
"id": "proceedings/ivapp/2014/8132/0",
"title": "2014 International Conference on Information Visualization Theory and Applications (IVAPP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2011/935/0/05742384",
"title": "Interactive visualization of multivariate trajectory data with density maps",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742384/12OmNqAU6rq",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a017",
"title": "Non-overlapping Aggregated Multivariate Glyphs for Moving Objects",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a017/12OmNy2agTd",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2017/0733/0/0733b783",
"title": "Richardson-Lucy Deblurring for Moving Light Field Cameras",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2017/0733b783/12OmNy4IF0w",
"parentPublication": {
"id": "proceedings/cvprw/2017/0733/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2018/06/08240703",
"title": "Range Queries on Multi-Attribute Trajectories",
"doi": null,
"abstractUrl": "/journal/tk/2018/06/08240703/13rRUEgs2tP",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122518",
"title": "Composite Density Maps for Multivariate Trajectories",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122518/13rRUwjXZSb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192701",
"title": "Visualization, Selection, and Analysis of Traffic Flows",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192701/13rRUxD9h5a",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2015/02/06589570",
"title": "Road-Network Aware Trajectory Clustering: Integrating Locality, Flow, and Density",
"doi": null,
"abstractUrl": "/journal/tm/2015/02/06589570/13rRUyeTViG",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440817",
"title": "A Declarative Rendering Model for Multiclass Density Maps",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440817/17D45VTRotk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2012010046",
"articleId": "13rRUxjyX9E",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2012010067",
"articleId": "13rRUy0ZzUY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwswg8k",
"title": "September/October",
"year": "2008",
"issueNum": "05",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "28",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILLkxX",
"doi": "10.1109/MCG.2008.99",
"abstract": "Schematic transportation maps usually contain little or no detail describing the environment of stations or their embedding in the surrounding area. The annotation of a distorted city map alleviates this deficiency and further improves the usability of schematic transportation maps by merging two different navigational spaces.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Schematic transportation maps usually contain little or no detail describing the environment of stations or their embedding in the surrounding area. The annotation of a distorted city map alleviates this deficiency and further improves the usability of schematic transportation maps by merging two different navigational spaces.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Schematic transportation maps usually contain little or no detail describing the environment of stations or their embedding in the surrounding area. The annotation of a distorted city map alleviates this deficiency and further improves the usability of schematic transportation maps by merging two different navigational spaces.",
"title": "Map Warping for the Annotation of Metro Maps",
"normalizedTitle": "Map Warping for the Annotation of Metro Maps",
"fno": "mcg2008050056",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Metro Map",
"Annotation",
"Warping",
"Zooming Technique",
"Interaction"
],
"authors": [
{
"givenName": "Joachim",
"surname": "B?ttger",
"fullName": "Joachim B?ttger",
"affiliation": "University of Konstanz",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ulrik",
"surname": "Brandes",
"fullName": "Ulrik Brandes",
"affiliation": "University of Konstanz",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Oliver",
"surname": "Deussen",
"fullName": "Oliver Deussen",
"affiliation": "University of Konstanz",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hendrik",
"surname": "Ziezold",
"fullName": "Hendrik Ziezold",
"affiliation": "University of Konstanz",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2008-09-01 00:00:00",
"pubType": "mags",
"pages": "56-65",
"year": "2008",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2006/2602/0/26020297",
"title": "Schematic Maps as an Alternative to Point Coverages When Topographic Maps are not Available",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2006/26020297/12OmNqzu6RH",
"parentPublication": {
"id": "proceedings/iv/2006/2602/0",
"title": "Tenth International Conference on Information Visualisation (IV'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2008/1966/0/04475477",
"title": "Map Warping for the Annotation of Metro Maps",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2008/04475477/12OmNrHSD43",
"parentPublication": {
"id": "proceedings/pacificvis/2008/1966/0",
"title": "IEEE Pacific Visualization Symposium 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2004/2177/0/21770355",
"title": "Metro Map Layout Using Multicriteria Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2004/21770355/12OmNvJXeDm",
"parentPublication": {
"id": "proceedings/iv/2004/2177/0",
"title": "Proceedings. Eighth International Conference on Information Visualisation, 2004. IV 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/esiat/2009/3682/2/3682b156",
"title": "The Design and Implementation of Public Bike Information System Based on Google Maps",
"doi": null,
"abstractUrl": "/proceedings-article/esiat/2009/3682b156/12OmNviHK50",
"parentPublication": {
"id": "esiat/2009/3682/2",
"title": "Environmental Science and Information Application Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigcomp/2014/3919/0/06741398",
"title": "Octilinear layouts for metro map visualization",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2014/06741398/12OmNvk7JXn",
"parentPublication": {
"id": "proceedings/bigcomp/2014/3919/0",
"title": "2014 International Conference on Big Data and Smart Computing (BIGCOMP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2015/7568/0/7568a009",
"title": "Designing and Annotating Metro Maps with Loop Lines",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2015/7568a009/12OmNylKAKN",
"parentPublication": {
"id": "proceedings/iv/2015/7568/0",
"title": "2015 19th International Conference on Information Visualisation (iV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2005/2397/0/23970203",
"title": "Automatic Layout of Project Plans Using a Metro Map Metaphor",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2005/23970203/12OmNz61dEr",
"parentPublication": {
"id": "proceedings/iv/2005/2397/0",
"title": "Ninth International Conference on Information Visualisation (IV'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/05/ttg2011050626",
"title": "Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming",
"doi": null,
"abstractUrl": "/journal/tg/2011/05/ttg2011050626/13rRUwdrdSw",
"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"
},
{
"id": "proceedings/iv/2018/7202/0/720200a373",
"title": "Progressive Annotation of Schematic Railway Maps",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a373/17D45VTRoyg",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2008050046",
"articleId": "13rRUyv53HN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2008050066",
"articleId": "13rRUxN5evD",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7k",
"title": "May",
"year": "2011",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwdrdSw",
"doi": "10.1109/TVCG.2010.81",
"abstract": "Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualization to automatically draw appealing metro maps. There are two aspects to this problem that depend on each other: the layout problem of finding station and link coordinates and the labeling problem of placing nonoverlapping station labels. In this paper, we present a new integral approach that solves the combined layout and labeling problem (each of which, independently, is known to be NP-hard) using mixed-integer programming (MIP). We identify seven design rules used in most real-world metro maps. We split these rules into hard and soft constraints and translate them into an MIP model. Our MIP formulation finds a metro map that satisfies all hard constraints (if such a drawing exists) and minimizes a weighted sum of costs that correspond to the soft constraints. We have implemented the MIP model and present a case study and the results of an expert assessment to evaluate the performance of our approach in comparison to both manually designed official maps and results of previous layout methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualization to automatically draw appealing metro maps. There are two aspects to this problem that depend on each other: the layout problem of finding station and link coordinates and the labeling problem of placing nonoverlapping station labels. In this paper, we present a new integral approach that solves the combined layout and labeling problem (each of which, independently, is known to be NP-hard) using mixed-integer programming (MIP). We identify seven design rules used in most real-world metro maps. We split these rules into hard and soft constraints and translate them into an MIP model. Our MIP formulation finds a metro map that satisfies all hard constraints (if such a drawing exists) and minimizes a weighted sum of costs that correspond to the soft constraints. We have implemented the MIP model and present a case study and the results of an expert assessment to evaluate the performance of our approach in comparison to both manually designed official maps and results of previous layout methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualization to automatically draw appealing metro maps. There are two aspects to this problem that depend on each other: the layout problem of finding station and link coordinates and the labeling problem of placing nonoverlapping station labels. In this paper, we present a new integral approach that solves the combined layout and labeling problem (each of which, independently, is known to be NP-hard) using mixed-integer programming (MIP). We identify seven design rules used in most real-world metro maps. We split these rules into hard and soft constraints and translate them into an MIP model. Our MIP formulation finds a metro map that satisfies all hard constraints (if such a drawing exists) and minimizes a weighted sum of costs that correspond to the soft constraints. We have implemented the MIP model and present a case study and the results of an expert assessment to evaluate the performance of our approach in comparison to both manually designed official maps and results of previous layout methods.",
"title": "Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming",
"normalizedTitle": "Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming",
"fno": "ttg2011050626",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Network Visualization",
"Graph Drawing",
"Graph Labeling",
"Metro Map",
"Octilinear Layout",
"Mixed Integer Programming"
],
"authors": [
{
"givenName": "Martin",
"surname": "Nöllenburg",
"fullName": "Martin Nöllenburg",
"affiliation": "Karlsruhe Institute of Technology (KIT) , Karlsruhe",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alexander",
"surname": "Wolff",
"fullName": "Alexander Wolff",
"affiliation": "Universität Würzburg, Würzburg",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2011-05-01 00:00:00",
"pubType": "trans",
"pages": "626-641",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2013/5049/0/5049a096",
"title": "Voronoi-Based Label Placement for Metro Maps",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2013/5049a096/12OmNBNM8Ua",
"parentPublication": {
"id": "proceedings/iv/2013/5049/0",
"title": "2013 17th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2004/2177/0/21770355",
"title": "Metro Map Layout Using Multicriteria Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2004/21770355/12OmNvJXeDm",
"parentPublication": {
"id": "proceedings/iv/2004/2177/0",
"title": "Proceedings. Eighth International Conference on Information Visualisation, 2004. IV 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigcomp/2014/3919/0/06741398",
"title": "Octilinear layouts for metro map visualization",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2014/06741398/12OmNvk7JXn",
"parentPublication": {
"id": "proceedings/bigcomp/2014/3919/0",
"title": "2014 International Conference on Big Data and Smart Computing (BIGCOMP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2015/7568/0/7568a009",
"title": "Designing and Annotating Metro Maps with Loop Lines",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2015/7568a009/12OmNylKAKN",
"parentPublication": {
"id": "proceedings/iv/2015/7568/0",
"title": "2015 19th International Conference on Information Visualisation (iV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2008/05/mcg2008050056",
"title": "Map Warping for the Annotation of Metro Maps",
"doi": null,
"abstractUrl": "/magazine/cg/2008/05/mcg2008050056/13rRUILLkxX",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1995/08/e0662",
"title": "Parametric Graph Drawing",
"doi": null,
"abstractUrl": "/journal/ts/1995/08/e0662/13rRUNvya2D",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/01/ttg2011010101",
"title": "Automatic Metro Map Layout Using Multicriteria Optimization",
"doi": null,
"abstractUrl": "/journal/tg/2011/01/ttg2011010101/13rRUx0xPIA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/02/07102775",
"title": "Interactive Metro Map Editing",
"doi": null,
"abstractUrl": "/journal/tg/2016/02/07102775/13rRUx0xPIL",
"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"
},
{
"id": "trans/tg/2021/02/09224192",
"title": "MetroSets: Visualizing Sets as Metro Maps",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09224192/1nV7Me0F3Lq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011050612",
"articleId": "13rRUEgs2LY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011050642",
"articleId": "13rRUwjGoLC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFqh",
"name": "ttg2011050626s1.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2011050626s1.pdf",
"extension": "pdf",
"size": "784 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwIHoDX",
"title": "Feb.",
"year": "2016",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "22",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0xPIL",
"doi": "10.1109/TVCG.2015.2430290",
"abstract": "Manual editing of a metro map is essential because many aesthetic and readability demands in map generation cannot be achieved by using a fully automatic method. In addition, a metro map should be updated when new metro lines are developed in a city. Considering that manually designing a metro map is time-consuming and requires expert skills, we present an interactive editing system that considers human knowledge and adjusts the layout to make it consistent with user expectations. In other words, only a few stations are controlled and the remaining stations are relocated by our system. Our system supports both curvilinear and octilinear layouts when creating metro maps. It solves an optimization problem, in which even spaces, route straightness, and maximum included angles at junctions are considered to obtain a curvilinear result. The system then rotates each edge to extend either vertically, horizontally, or diagonally while approximating the station positions provided by users to generate an octilinear layout. Experimental results, quantitative and qualitative evaluations, and user studies show that our editing system is easy to use and allows even non-professionals to design a metro map.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Manual editing of a metro map is essential because many aesthetic and readability demands in map generation cannot be achieved by using a fully automatic method. In addition, a metro map should be updated when new metro lines are developed in a city. Considering that manually designing a metro map is time-consuming and requires expert skills, we present an interactive editing system that considers human knowledge and adjusts the layout to make it consistent with user expectations. In other words, only a few stations are controlled and the remaining stations are relocated by our system. Our system supports both curvilinear and octilinear layouts when creating metro maps. It solves an optimization problem, in which even spaces, route straightness, and maximum included angles at junctions are considered to obtain a curvilinear result. The system then rotates each edge to extend either vertically, horizontally, or diagonally while approximating the station positions provided by users to generate an octilinear layout. Experimental results, quantitative and qualitative evaluations, and user studies show that our editing system is easy to use and allows even non-professionals to design a metro map.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Manual editing of a metro map is essential because many aesthetic and readability demands in map generation cannot be achieved by using a fully automatic method. In addition, a metro map should be updated when new metro lines are developed in a city. Considering that manually designing a metro map is time-consuming and requires expert skills, we present an interactive editing system that considers human knowledge and adjusts the layout to make it consistent with user expectations. In other words, only a few stations are controlled and the remaining stations are relocated by our system. Our system supports both curvilinear and octilinear layouts when creating metro maps. It solves an optimization problem, in which even spaces, route straightness, and maximum included angles at junctions are considered to obtain a curvilinear result. The system then rotates each edge to extend either vertically, horizontally, or diagonally while approximating the station positions provided by users to generate an octilinear layout. Experimental results, quantitative and qualitative evaluations, and user studies show that our editing system is easy to use and allows even non-professionals to design a metro map.",
"title": "Interactive Metro Map Editing",
"normalizedTitle": "Interactive Metro Map Editing",
"fno": "07102775",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Layout",
"Optimization",
"Junctions",
"Visualization",
"Linear Programming",
"Topology",
"Cities And Towns",
"Least Squares Optimization",
"Metro Map",
"Interactive Editing",
"Octilinear",
"Least Squares Optimization",
"Metro Map",
"Interactive Editing",
"Octilinear"
],
"authors": [
{
"givenName": "Yu-Shuen",
"surname": "Wang",
"fullName": "Yu-Shuen Wang",
"affiliation": "Department of Computer Science, National Chiao Tung University, Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wan-Yu",
"surname": "Peng",
"fullName": "Wan-Yu Peng",
"affiliation": "Department of Computer Science, National Chiao Tung University, Taiwan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2016-02-01 00:00:00",
"pubType": "trans",
"pages": "1115-1126",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2004/2177/0/21770488",
"title": "Getting to more Abstract Places using the Metro Map Metaphor",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2004/21770488/12OmNANBZs7",
"parentPublication": {
"id": "proceedings/iv/2004/2177/0",
"title": "Proceedings. Eighth International Conference on Information Visualisation, 2004. IV 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2008/1966/0/04475477",
"title": "Map Warping for the Annotation of Metro Maps",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2008/04475477/12OmNrHSD43",
"parentPublication": {
"id": "proceedings/pacificvis/2008/1966/0",
"title": "IEEE Pacific Visualization Symposium 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2004/2177/0/21770355",
"title": "Metro Map Layout Using Multicriteria Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2004/21770355/12OmNvJXeDm",
"parentPublication": {
"id": "proceedings/iv/2004/2177/0",
"title": "Proceedings. Eighth International Conference on Information Visualisation, 2004. IV 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2015/7568/0/7568a009",
"title": "Designing and Annotating Metro Maps with Loop Lines",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2015/7568a009/12OmNylKAKN",
"parentPublication": {
"id": "proceedings/iv/2015/7568/0",
"title": "2015 19th International Conference on Information Visualisation (iV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2005/2397/0/23970203",
"title": "Automatic Layout of Project Plans Using a Metro Map Metaphor",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2005/23970203/12OmNz61dEr",
"parentPublication": {
"id": "proceedings/iv/2005/2397/0",
"title": "Ninth International Conference on Information Visualisation (IV'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/05/ttg2011050626",
"title": "Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming",
"doi": null,
"abstractUrl": "/journal/tg/2011/05/ttg2011050626/13rRUwdrdSw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/01/ttg2011010101",
"title": "Automatic Metro Map Layout Using Multicriteria Optimization",
"doi": null,
"abstractUrl": "/journal/tg/2011/01/ttg2011010101/13rRUx0xPIA",
"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"
},
{
"id": "proceedings/iv/2022/9007/0/900700a167",
"title": "Effects of Image Features and Task Complexity on Eye Movement while searching Metro Map routes",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2022/900700a167/1KaH4YF3DRm",
"parentPublication": {
"id": "proceedings/iv/2022/9007/0",
"title": "2022 26th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09224192",
"title": "MetroSets: Visualizing Sets as Metro Maps",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09224192/1nV7Me0F3Lq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07102749",
"articleId": "13rRUy3xY2U",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07102754",
"articleId": "13rRUxASuvh",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgNt",
"name": "ttg201602-07102775s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201602-07102775s1.zip",
"extension": "zip",
"size": "46.9 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": "1MDGjfriXp6",
"doi": "10.1109/TKDE.2023.3269771",
"abstract": "Urban metro flow prediction is of great value for metro operation scheduling, passenger flow management and personal travel planning. However, the problem is challenging. First, different metro stations, e.g. transfer stations and non-transfer stations have unique traffic patterns. Second, it is difficult to model complex spatio-temporal dynamic relation of metro stations. To address these challenges, we develop a spatio-temporal dynamic graph relational learning model (STDGRL) to predict urban metro station flow. First, we propose a spatio-temporal node embedding representation module to capture the traffic patterns of different stations. Second, we employ a dynamic graph relationship learning module to learn dynamic spatial relationships between metro stations without a predefined graph adjacency matrix. Finally, we provide a transformer-based long-term relationship prediction module for long-term metro flow prediction. Extensive experiments are conducted based on metro data in four cities, China, with experimental results demonstrating the advantages of our method compared over 14 baselines for urban metro flow prediction.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Urban metro flow prediction is of great value for metro operation scheduling, passenger flow management and personal travel planning. However, the problem is challenging. First, different metro stations, e.g. transfer stations and non-transfer stations have unique traffic patterns. Second, it is difficult to model complex spatio-temporal dynamic relation of metro stations. To address these challenges, we develop a spatio-temporal dynamic graph relational learning model (STDGRL) to predict urban metro station flow. First, we propose a spatio-temporal node embedding representation module to capture the traffic patterns of different stations. Second, we employ a dynamic graph relationship learning module to learn dynamic spatial relationships between metro stations without a predefined graph adjacency matrix. Finally, we provide a transformer-based long-term relationship prediction module for long-term metro flow prediction. Extensive experiments are conducted based on metro data in four cities, China, with experimental results demonstrating the advantages of our method compared over 14 baselines for urban metro flow prediction.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Urban metro flow prediction is of great value for metro operation scheduling, passenger flow management and personal travel planning. However, the problem is challenging. First, different metro stations, e.g. transfer stations and non-transfer stations have unique traffic patterns. Second, it is difficult to model complex spatio-temporal dynamic relation of metro stations. To address these challenges, we develop a spatio-temporal dynamic graph relational learning model (STDGRL) to predict urban metro station flow. First, we propose a spatio-temporal node embedding representation module to capture the traffic patterns of different stations. Second, we employ a dynamic graph relationship learning module to learn dynamic spatial relationships between metro stations without a predefined graph adjacency matrix. Finally, we provide a transformer-based long-term relationship prediction module for long-term metro flow prediction. Extensive experiments are conducted based on metro data in four cities, China, with experimental results demonstrating the advantages of our method compared over 14 baselines for urban metro flow prediction.",
"title": "Spatio-Temporal Dynamic Graph Relation Learning for Urban Metro Flow Prediction",
"normalizedTitle": "Spatio-Temporal Dynamic Graph Relation Learning for Urban Metro Flow Prediction",
"fno": "10107812",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Task Analysis",
"Spatiotemporal Phenomena",
"Urban Areas",
"Predictive Models",
"Graph Neural Networks",
"Data Models",
"Roads",
"Spatio Temporal Data",
"Urban Flow Prediction",
"Graph Neural Networks"
],
"authors": [
{
"givenName": "Peng",
"surname": "Xie",
"fullName": "Peng Xie",
"affiliation": "School of Computing and Artificial Intelligence, Southwest Jiaotong University, Chengdu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Minbo",
"surname": "Ma",
"fullName": "Minbo Ma",
"affiliation": "School of Computing and Artificial Intelligence, Southwest Jiaotong University, Chengdu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tianrui",
"surname": "Li",
"fullName": "Tianrui Li",
"affiliation": "School of Computing and Artificial Intelligence, Southwest Jiaotong University, Chengdu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shenggong",
"surname": "Ji",
"fullName": "Shenggong Ji",
"affiliation": "Tencent Inc., Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shengdong",
"surname": "Du",
"fullName": "Shengdong Du",
"affiliation": "School of Computing and Artificial Intelligence, Southwest Jiaotong University, Chengdu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zeng",
"surname": "Yu",
"fullName": "Zeng Yu",
"affiliation": "School of Computing and Artificial Intelligence, Southwest Jiaotong University, Chengdu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Junbo",
"surname": "Zhang",
"fullName": "Junbo Zhang",
"affiliation": "JD iCity, JD Technology, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "1-12",
"year": "5555",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "mags/cg/2018/05/mcg2018050026",
"title": "Spatio-Temporal Urban Data Analysis: A Visual Analytics Perspective",
"doi": null,
"abstractUrl": "/magazine/cg/2018/05/mcg2018050026/13WBGTItFGV",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2018/9288/0/928800b497",
"title": "Understanding Urban Spatio-Temporal Usage Patterns Using Matrix Tensor Factorization",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2018/928800b497/18jXHtpdEaI",
"parentPublication": {
"id": "proceedings/icdmw/2018/9288/0",
"title": "2018 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigcomp/2022/2197/0/219700a234",
"title": "Urban Event Detection from Spatio-temporal IoT Sensor Data Using Graph-Based Machine Learning",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2022/219700a234/1BYICHFmoM0",
"parentPublication": {
"id": "proceedings/bigcomp/2022/2197/0",
"title": "2022 IEEE International Conference on Big Data and Smart Computing (BigComp)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ai/2023/02/09721618",
"title": "High-Resolution Urban Flows Forecasting With Coarse-Grained Spatiotemporal Data",
"doi": null,
"abstractUrl": "/journal/ai/2023/02/09721618/1BhzGsasS3K",
"parentPublication": {
"id": "trans/ai",
"title": "IEEE Transactions on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/05/09729432",
"title": "Shortening Passengers’ Travel Time: A Dynamic Metro Train Scheduling Approach Using Deep Reinforcement Learning",
"doi": null,
"abstractUrl": "/journal/tk/2023/05/09729432/1Bya1Z9QgBW",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09793708",
"title": "Classification-Labeled Continuousization and Multi-Domain Spatio-Temporal Fusion for Fine-Grained Urban Crime Prediction",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09793708/1E5LzI2tveE",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006289",
"title": "Understanding Spatio-Temporal Urban Processes",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006289/1hJrXYjoEWA",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/02/09063494",
"title": "Online Spatio-Temporal Crowd Flow Distribution Prediction for Complex Metro System",
"doi": null,
"abstractUrl": "/journal/tk/2022/02/09063494/1iUHIBjXvCo",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/03/09096591",
"title": "Spatio-Temporal Meta Learning for Urban Traffic Prediction",
"doi": null,
"abstractUrl": "/journal/tk/2022/03/09096591/1jXqZCthRCM",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icedeg/2020/5882/0/09096855",
"title": "Spatio-temporal Analysis: Using Instagram Posts to Characterize Urban Point-of-interest",
"doi": null,
"abstractUrl": "/proceedings-article/icedeg/2020/09096855/1l6SAYuQYyk",
"parentPublication": {
"id": "proceedings/icedeg/2020/5882/0",
"title": "2020 Seventh International Conference on eDemocracy & eGovernment (ICEDEG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10108535",
"articleId": "1MDGj8hmjYc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10108034",
"articleId": "1MDGjv0YjUA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzgNXTl",
"title": "Jan.-March",
"year": "2012",
"issueNum": "01",
"idPrefix": "th",
"pubType": "journal",
"volume": "5",
"label": "Jan.-March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvfg",
"doi": "10.1109/TOH.2012.1",
"abstract": "This paper proposes a method for generating a smooth directional vibrotactile flow on a thin plate. While actuating two piezoelectric actuators spatially across the plate, temporal sweeping of the input excitation frequency from zero to the first mode of the resonance frequency can smooth the perceived directional vibrotactile flow, as compared to a vibrotactile flow generated by conventional apparent tactile movement and phantom sensation methods. In order to ascertain important factors in the excitation pattern, a user study was conducted for three factors (amplitude (constant versus modulated), frequency (constant versus swept), and ending shape (sharp versus smooth)). The results showed that frequency sweeping in addition to amplitude modulation and smooth ending were the most important factors in smoothing vibrotactile flows. Moreover, an excitation signal with a smooth ending shape was important for generating nonspiky flows at the midpoint. In this study, a vibration isolation design is also proposed in order to substantially decrease the transmission of the actuator vibration to the mockup housing. As such, it is expected that the proposed vibrotactile flow generation method and vibration isolation design may be useful in applications including generating directional information in navigation maps or for identifying callers in mobile devices.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper proposes a method for generating a smooth directional vibrotactile flow on a thin plate. While actuating two piezoelectric actuators spatially across the plate, temporal sweeping of the input excitation frequency from zero to the first mode of the resonance frequency can smooth the perceived directional vibrotactile flow, as compared to a vibrotactile flow generated by conventional apparent tactile movement and phantom sensation methods. In order to ascertain important factors in the excitation pattern, a user study was conducted for three factors (amplitude (constant versus modulated), frequency (constant versus swept), and ending shape (sharp versus smooth)). The results showed that frequency sweeping in addition to amplitude modulation and smooth ending were the most important factors in smoothing vibrotactile flows. Moreover, an excitation signal with a smooth ending shape was important for generating nonspiky flows at the midpoint. In this study, a vibration isolation design is also proposed in order to substantially decrease the transmission of the actuator vibration to the mockup housing. As such, it is expected that the proposed vibrotactile flow generation method and vibration isolation design may be useful in applications including generating directional information in navigation maps or for identifying callers in mobile devices.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper proposes a method for generating a smooth directional vibrotactile flow on a thin plate. While actuating two piezoelectric actuators spatially across the plate, temporal sweeping of the input excitation frequency from zero to the first mode of the resonance frequency can smooth the perceived directional vibrotactile flow, as compared to a vibrotactile flow generated by conventional apparent tactile movement and phantom sensation methods. In order to ascertain important factors in the excitation pattern, a user study was conducted for three factors (amplitude (constant versus modulated), frequency (constant versus swept), and ending shape (sharp versus smooth)). The results showed that frequency sweeping in addition to amplitude modulation and smooth ending were the most important factors in smoothing vibrotactile flows. Moreover, an excitation signal with a smooth ending shape was important for generating nonspiky flows at the midpoint. In this study, a vibration isolation design is also proposed in order to substantially decrease the transmission of the actuator vibration to the mockup housing. As such, it is expected that the proposed vibrotactile flow generation method and vibration isolation design may be useful in applications including generating directional information in navigation maps or for identifying callers in mobile devices.",
"title": "Smooth Vibrotactile Flow Generation Using Two Piezoelectric Actuators",
"normalizedTitle": "Smooth Vibrotactile Flow Generation Using Two Piezoelectric Actuators",
"fno": "tth2012010021",
"hasPdf": true,
"idPrefix": "th",
"keywords": [
"Vibration Isolation",
"Cartography",
"Haptic Interfaces",
"Mobile Computing",
"Piezoelectric Actuators",
"Vibrotactile Flow Generation Method",
"Smooth Vibrotactile Flow Generation",
"Piezoelectric Actuator",
"Input Excitation Frequency",
"Resonance Frequency",
"Perceived Directional Vibrotactile Flow",
"Apparent Tactile Movement",
"Phantom Sensation Method",
"Excitation Pattern",
"User Study",
"Amplitude Factor",
"Frequency Factor",
"Ending Shape Factor",
"Frequency Sweeping",
"Amplitude Modulation",
"Smooth Ending",
"Vibration Isolation Design",
"Actuator Vibration",
"Directional Information",
"Navigation Map",
"Mobile Device",
"Vibrations",
"Resonant Frequency",
"Piezoelectric Actuators",
"Frequency Modulation",
"Shape",
"Trajectory",
"Mobile Device",
"Vibrotactile Flow",
"Vibration Isolation",
"Piezoelectric Actuator"
],
"authors": [
{
"givenName": null,
"surname": "Jeonggoo Kang",
"fullName": "Jeonggoo Kang",
"affiliation": "Dept. of Mechatron., Gwangju Inst. of Sci. & Technol., Gwangju, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Jongsuh Lee",
"fullName": "Jongsuh Lee",
"affiliation": "Dept. of Mechatron., Gwangju Inst. of Sci. & Technol., Gwangju, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Heewon Kim",
"fullName": "Heewon Kim",
"affiliation": "Dept. of Mechatron., Gwangju Inst. of Sci. & Technol., Gwangju, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Kwangsu Cho",
"fullName": "Kwangsu Cho",
"affiliation": "Dept. of Interaction Sci., Sungkyunkwan Univ., Seoul, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Semyung Wang",
"fullName": "Semyung Wang",
"affiliation": "Dept. of Mechatron., Gwangju Inst. of Sci. & Technol., Gwangju, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Jeha Ryu",
"fullName": "Jeha Ryu",
"affiliation": "Dept. of Mechatron., Gwangju Inst. of Sci. & Technol., Gwangju, South Korea",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2012-01-01 00:00:00",
"pubType": "trans",
"pages": "21-32",
"year": "2012",
"issn": "1939-1412",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ssst/2005/8808/0/01460873",
"title": "Active vibration control of flexible steel cantilever beam using piezoelectric actuators",
"doi": null,
"abstractUrl": "/proceedings-article/ssst/2005/01460873/12OmNA2cYzz",
"parentPublication": {
"id": "proceedings/ssst/2005/8808/0",
"title": "Proceedings of the Thirty-Seventh Southeastern Symposium on System Theory (SSST05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2006/0226/0/02260081",
"title": "Determining the Feasibility of Forearm Mounted Vibrotactile Displays",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2006/02260081/12OmNB0nWcu",
"parentPublication": {
"id": "proceedings/haptics/2006/0226/0",
"title": "2006 14th Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iseim/2005/6063/3/01496264",
"title": "A research on the piezoelectric vibration actuator for mobile phone",
"doi": null,
"abstractUrl": "/proceedings-article/iseim/2005/01496264/12OmNrJAeap",
"parentPublication": {
"id": "proceedings/iseim/2005/6063/3",
"title": "International Symposium on Electrical Insulating Materials",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2011/4296/2/4296c100",
"title": "Experiment Study on Vibration Elimination of MSMA Actuator",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2011/4296c100/12OmNrMZpwC",
"parentPublication": {
"id": "proceedings/icmtma/2011/4296/2",
"title": "2011 Third International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2013/4932/0/4932b255",
"title": "The Vibration Analysis of the Piezoelectric Crystal Disk with Thin Barrel Shell Transducer",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2013/4932b255/12OmNwE9OQc",
"parentPublication": {
"id": "proceedings/icmtma/2013/4932/0",
"title": "2013 Fifth International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isuc/2008/3433/0/3433a274",
"title": "Psychophysical Measurement of Multiple Tactile Sensations Using a Broadband Vibrotactile Display",
"doi": null,
"abstractUrl": "/proceedings-article/isuc/2008/3433a274/12OmNwO5LYZ",
"parentPublication": {
"id": "proceedings/isuc/2008/3433/0",
"title": "2008 Second International Symposium on Universal Communication",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icece/2010/4031/0/4031c371",
"title": "The Mechanical Performance of Piezoelectric Fiber Composite Actuators",
"doi": null,
"abstractUrl": "/proceedings-article/icece/2010/4031c371/12OmNx4yvqY",
"parentPublication": {
"id": "proceedings/icece/2010/4031/0",
"title": "Electrical and Control Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icecs/2009/3937/0/3937a165",
"title": "Control of Vibration Suppression of an Smart Beam by Pizoelectric Elements",
"doi": null,
"abstractUrl": "/proceedings-article/icecs/2009/3937a165/12OmNyRxFzc",
"parentPublication": {
"id": "proceedings/icecs/2009/3937/0",
"title": "Environmental and Computer Science, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2010/02/tth2010020138",
"title": "Vibrotactile Feedback for Information Delivery in the Vehicle",
"doi": null,
"abstractUrl": "/journal/th/2010/02/tth2010020138/13rRUwcS1D4",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2013/03/tth2013030352",
"title": "Vibrotactile Perceived Intensity for Mobile Devices as a Function of Direction, Amplitude, and Frequency",
"doi": null,
"abstractUrl": "/journal/th/2013/03/tth2013030352/13rRUxNEqQ5",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "tth2012010014",
"articleId": "13rRUEgs2C8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "tth2012010033",
"articleId": "13rRUEgs2tw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgK8",
"title": "Dec.",
"year": "2014",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxYrbUK",
"doi": "10.1109/TVCG.2014.2346271",
"abstract": "This paper presents a new approach to flow mapping that extracts inherent patterns from massive geographic mobility data and constructs effective visual representations of the data for the understanding of complex flow trends. This approach involves a new method for origin-destination flow density estimation and a new method for flow map generalization, which together can remove spurious data variance, normalize flows with control population, and detect high-level patterns that are not discernable with existing approaches. The approach achieves three main objectives in addressing the challenges for analyzing and mapping massive flow data. First, it removes the effect of size differences among spatial units via kernel-based density estimation, which produces a measurement of flow volume between each pair of origin and destination. Second, it extracts major flow patterns in massive flow data through a new flow sampling method, which filters out duplicate information in the smoothed flows. Third, it enables effective flow mapping and allows intuitive perception of flow patterns among origins and destinations without bundling or altering flow paths. The approach can work with both point-based flow data (such as taxi trips with GPS locations) and area-based flow data (such as county-to-county migration). Moreover, the approach can be used to detect and compare flow patterns at different scales or in relatively sparse flow datasets, such as migration for each age group. We evaluate and demonstrate the new approach with case studies of U.S. migration data and experiments with synthetic data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a new approach to flow mapping that extracts inherent patterns from massive geographic mobility data and constructs effective visual representations of the data for the understanding of complex flow trends. This approach involves a new method for origin-destination flow density estimation and a new method for flow map generalization, which together can remove spurious data variance, normalize flows with control population, and detect high-level patterns that are not discernable with existing approaches. The approach achieves three main objectives in addressing the challenges for analyzing and mapping massive flow data. First, it removes the effect of size differences among spatial units via kernel-based density estimation, which produces a measurement of flow volume between each pair of origin and destination. Second, it extracts major flow patterns in massive flow data through a new flow sampling method, which filters out duplicate information in the smoothed flows. Third, it enables effective flow mapping and allows intuitive perception of flow patterns among origins and destinations without bundling or altering flow paths. The approach can work with both point-based flow data (such as taxi trips with GPS locations) and area-based flow data (such as county-to-county migration). Moreover, the approach can be used to detect and compare flow patterns at different scales or in relatively sparse flow datasets, such as migration for each age group. We evaluate and demonstrate the new approach with case studies of U.S. migration data and experiments with synthetic data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a new approach to flow mapping that extracts inherent patterns from massive geographic mobility data and constructs effective visual representations of the data for the understanding of complex flow trends. This approach involves a new method for origin-destination flow density estimation and a new method for flow map generalization, which together can remove spurious data variance, normalize flows with control population, and detect high-level patterns that are not discernable with existing approaches. The approach achieves three main objectives in addressing the challenges for analyzing and mapping massive flow data. First, it removes the effect of size differences among spatial units via kernel-based density estimation, which produces a measurement of flow volume between each pair of origin and destination. Second, it extracts major flow patterns in massive flow data through a new flow sampling method, which filters out duplicate information in the smoothed flows. Third, it enables effective flow mapping and allows intuitive perception of flow patterns among origins and destinations without bundling or altering flow paths. The approach can work with both point-based flow data (such as taxi trips with GPS locations) and area-based flow data (such as county-to-county migration). Moreover, the approach can be used to detect and compare flow patterns at different scales or in relatively sparse flow datasets, such as migration for each age group. We evaluate and demonstrate the new approach with case studies of U.S. migration data and experiments with synthetic data.",
"title": "Origin-Destination Flow Data Smoothing and Mapping",
"normalizedTitle": "Origin-Destination Flow Data Smoothing and Mapping",
"fno": "06875983",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Pattern Classification",
"Traffic Engineering Computing",
"Origin Destination Flow Data",
"Flow Data Smooting",
"Flow Data Mapping",
"Massive Geographic Mobility Data",
"Visual Data Representation",
"Origin Destination Flow Density Estimation",
"Flow Map Generalization",
"Control Population",
"High Level Pattern Detection",
"Flow Data Analysis",
"Taxi Trips",
"County To County Migration",
"Point Based Flow Data",
"Area Based Flow Data",
"Flow Graphs",
"Statistics",
"Smoothing Methods",
"Bandwidth Allocation",
"Feature Extraction",
"Data Visualization",
"Flow Mapping",
"Kernel Smoothing",
"Generalization",
"Multi Resolution Mapping",
"Graph Drawing",
"Spatial Data Mining"
],
"authors": [
{
"givenName": "Diansheng",
"surname": "Guo",
"fullName": "Diansheng Guo",
"affiliation": "Department of Geography, University of South Carolina",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xi",
"surname": "Zhu",
"fullName": "Xi Zhu",
"affiliation": "Department of Geography, University of South Carolina",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "2043-2052",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/infvis/2005/9464/0/01532150",
"title": "Flow map layout",
"doi": null,
"abstractUrl": "/proceedings-article/infvis/2005/01532150/12OmNs59JIW",
"parentPublication": {
"id": "proceedings/infvis/2005/9464/0",
"title": "IEEE Symposium on Information Visualization (InfoVis 05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/euromicro/1996/7487/0/74870051",
"title": "Mapping of Neural Networks onto Data Flow Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/euromicro/1996/74870051/12OmNxEBz5b",
"parentPublication": {
"id": "proceedings/euromicro/1996/7487/0",
"title": "EUROMICRO Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2005/2392/0/23920397",
"title": "Directional Smoothing of Triangular Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2005/23920397/12OmNxiKrZS",
"parentPublication": {
"id": "proceedings/cgiv/2005/2392/0",
"title": "International Conference on Computer Graphics, Imaging and Visualization (CGIV'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/services/2012/4756/0/4756a234",
"title": "WMS-Based Flow Mapping Services",
"doi": null,
"abstractUrl": "/proceedings-article/services/2012/4756a234/12OmNym2c7A",
"parentPublication": {
"id": "proceedings/services/2012/4756/0",
"title": "2012 IEEE Eighth World Congress on Services",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/01532150",
"title": "Flow map layout",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/01532150/12OmNzV70DQ",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061041",
"title": "Flow Mapping and Multivariate Visualization of Large Spatial Interaction Data",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061041/13rRUx0xPmV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440844",
"title": "Origin-Destination Flow Maps in Immersive Environments",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440844/17D45Vw15vc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10105504",
"title": "GODDAG: Generating Origin-destination Flow for New Cities via Domain Adversarial Training",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10105504/1MtgpyzxSoM",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2020/8316/0/831600b160",
"title": "Multi-attention 3D Residual Neural Network for Origin-Destination Crowd Flow Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2020/831600b160/1r54CJAvOFy",
"parentPublication": {
"id": "proceedings/icdm/2020/8316/0",
"title": "2020 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/01/09416848",
"title": "Inferring Origin-Destination Flows From Population Distribution",
"doi": null,
"abstractUrl": "/journal/tk/2023/01/09416848/1t8VNb1SvEk",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06875987",
"articleId": "13rRUIM2VH2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06876003",
"articleId": "13rRUxly9dV",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwoxSiz",
"title": "August",
"year": "1986",
"issueNum": "08",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "6",
"label": "August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwbs1UE",
"doi": "10.1109/MCG.1986.276770",
"abstract": "The Programmer's Hierarchical Interactive Graphics System (PHIGS) is a draft standard for computer graphics programming. PHIGS is useful for applications that manipulate complex displays of 2D or 3D data in a highly interactive environment. This is done through the hierarchical data organization and flexible editing capabilities provided in PHIGS. This article describes the goals and underlying model of PHIGS, reviews its capabilities, and provides some brief application examples. The similarities and differences of PHIGS and GKS are discussed.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The Programmer's Hierarchical Interactive Graphics System (PHIGS) is a draft standard for computer graphics programming. PHIGS is useful for applications that manipulate complex displays of 2D or 3D data in a highly interactive environment. This is done through the hierarchical data organization and flexible editing capabilities provided in PHIGS. This article describes the goals and underlying model of PHIGS, reviews its capabilities, and provides some brief application examples. The similarities and differences of PHIGS and GKS are discussed.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The Programmer's Hierarchical Interactive Graphics System (PHIGS) is a draft standard for computer graphics programming. PHIGS is useful for applications that manipulate complex displays of 2D or 3D data in a highly interactive environment. This is done through the hierarchical data organization and flexible editing capabilities provided in PHIGS. This article describes the goals and underlying model of PHIGS, reviews its capabilities, and provides some brief application examples. The similarities and differences of PHIGS and GKS are discussed.",
"title": "PHIGS: A Standard, Dynamic, Interactive Graphics Interface",
"normalizedTitle": "PHIGS: A Standard, Dynamic, Interactive Graphics Interface",
"fno": "mcg1986080050",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [],
"authors": [
{
"givenName": "David",
"surname": "Shuey",
"fullName": "David Shuey",
"affiliation": "McDonnell Douglas",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Bailey",
"fullName": "David Bailey",
"affiliation": "Sanders/CalComp",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Morrissey",
"fullName": "Thomas Morrissey",
"affiliation": "Hewlett-Packard",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "1986-08-01 00:00:00",
"pubType": "mags",
"pages": "50-57",
"year": "1986",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cbms/1991/2164/0/00128951",
"title": "An interactive graphics package with standard examples of the Bloom and Richardson histological grading technique",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/1991/00128951/12OmNyprnqn",
"parentPublication": {
"id": "proceedings/cbms/1991/2164/0",
"title": "Computer-Based Medical Systems - Proceedings of the Fourth Annual IEEE Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1980/020/0/01585282",
"title": "An Interactive Graphics System for Custom Design",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1980/01585282/12OmNz3bdLk",
"parentPublication": {
"id": "proceedings/dac/1980/020/0",
"title": "17th Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1986/02/mcg1986020012",
"title": "An Implementer's View of PHIGS",
"doi": null,
"abstractUrl": "/magazine/cg/1986/02/mcg1986020012/13rRUIIVleG",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1988/02/mcg1988020026",
"title": "A PHIGS-Based Graphics Input Interface for Spatial-Mechanism Design",
"doi": null,
"abstractUrl": "/magazine/cg/1988/02/mcg1988020026/13rRUILLkxK",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/1978/11/01646747",
"title": "Interactive Graphics Devices",
"doi": null,
"abstractUrl": "/magazine/co/1978/11/01646747/13rRUxASu3x",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1990/04/mcg1990040070",
"title": "Portability of Interactive Graphics Software",
"doi": null,
"abstractUrl": "/magazine/cg/1990/04/mcg1990040070/13rRUxN5evs",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1986/08/mcg1986080033",
"title": "The Computer Graphics Virtual Device Interface",
"doi": null,
"abstractUrl": "/magazine/cg/1986/08/mcg1986080033/13rRUxYINaq",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1982/05/mcg1982050009",
"title": "GKS ?The First Graphics Standard",
"doi": null,
"abstractUrl": "/magazine/cg/1982/05/mcg1982050009/13rRUxk89gs",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1989/04/mcg1989040014",
"title": "PEX: A Network-Transparent 3D Graphics System",
"doi": null,
"abstractUrl": "/magazine/cg/1989/04/mcg1989040014/13rRUzp02ib",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2020/05/09175079",
"title": "Interactive Graphics in Industry: The Early Days",
"doi": null,
"abstractUrl": "/magazine/cg/2020/05/09175079/1myrz9MdA76",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg1986080042",
"articleId": "13rRUwcAqur",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg1986080058",
"articleId": "13rRUwjXZM2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNA0MYXT",
"title": "November",
"year": "1978",
"issueNum": "11",
"idPrefix": "co",
"pubType": "magazine",
"volume": "11",
"label": "November",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASu3x",
"doi": "10.1109/C-M.1978.217972",
"abstract": "The new user of interactive graphics systems probably doesn't know much about the tradeoffs and options involved with using interactive input/output equipment. And there are few sources of introductory material on the subject. This issue attempts to provide such a source.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The new user of interactive graphics systems probably doesn't know much about the tradeoffs and options involved with using interactive input/output equipment. And there are few sources of introductory material on the subject. This issue attempts to provide such a source.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The new user of interactive graphics systems probably doesn't know much about the tradeoffs and options involved with using interactive input/output equipment. And there are few sources of introductory material on the subject. This issue attempts to provide such a source.",
"title": "Interactive Graphics Devices",
"normalizedTitle": "Interactive Graphics Devices",
"fno": "01646747",
"hasPdf": true,
"idPrefix": "co",
"keywords": [],
"authors": [
{
"givenName": "A.P.",
"surname": "Lucido",
"fullName": "A.P. Lucido",
"affiliation": "Texas A&M University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "11",
"pubDate": "1978-11-01 00:00:00",
"pubType": "mags",
"pages": "7",
"year": "1978",
"issn": "0018-9162",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2001/1198/0/11980234",
"title": "Data Placement for Multi-user Interactive DTV",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2001/11980234/12OmNBrV1Uc",
"parentPublication": {
"id": "proceedings/icme/2001/1198/0",
"title": "IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/euro-dac/1996/7573/0/75730356",
"title": "EXPLORER : An Interactive Floorplanner for Design Space Exploration",
"doi": null,
"abstractUrl": "/proceedings-article/euro-dac/1996/75730356/12OmNwwd2Lz",
"parentPublication": {
"id": "proceedings/euro-dac/1996/7573/0",
"title": "European Design Automation Conference with EURO-VHDL",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1986/08/mcg1986080050",
"title": "PHIGS: A Standard, Dynamic, Interactive Graphics Interface",
"doi": null,
"abstractUrl": "/magazine/cg/1986/08/mcg1986080050/13rRUwbs1UE",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1995/03/v0218",
"title": "Collision Detection for Interactive Graphics Applications",
"doi": null,
"abstractUrl": "/journal/tg/1995/03/v0218/13rRUxBJhFh",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/1972/06/01641631",
"title": "Increasing Capabilities in Interactive Computer Graphics Terminals",
"doi": null,
"abstractUrl": "/magazine/co/1972/06/01641631/13rRUxBa5zV",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mu/2008/02/mmu2008020072",
"title": "Interactive TV Services on Mobile Devices",
"doi": null,
"abstractUrl": "/magazine/mu/2008/02/mmu2008020072/13rRUxbCbqt",
"parentPublication": {
"id": "mags/mu",
"title": "IEEE MultiMedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/08/mco2013080085",
"title": "Designing Bespoke Interactive Devices",
"doi": null,
"abstractUrl": "/magazine/co/2013/08/mco2013080085/13rRUxly90S",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/1979/11/01658539",
"title": "Special Feature: Interactive Graphics Teleconferencing",
"doi": null,
"abstractUrl": "/magazine/co/1979/11/01658539/13rRUyeTVkN",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1983/02/mcg1983020033",
"title": "Interactive Graphics Developments in Energy Exploration",
"doi": null,
"abstractUrl": "/magazine/cg/1983/02/mcg1983020033/13rRUyfKIKb",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2020/05/09175079",
"title": "Interactive Graphics in Industry: The Early Days",
"doi": null,
"abstractUrl": "/magazine/cg/2020/05/09175079/1myrz9MdA76",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "01646745",
"articleId": "13rRUEgs2FR",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01646749",
"articleId": "13rRUwghdbP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxb5hpF",
"title": "Sept.",
"year": "2014",
"issueNum": "09",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwbs2b5",
"doi": "10.1109/TVCG.2014.2312010",
"abstract": "Tourist and destination maps are thematic maps designed to represent specific themes in maps. The road network topologies in these maps are generally more important than the geometric accuracy of roads. A road network warping method is proposed to facilitate map generation and improve theme representation in maps. The basic idea is deforming a road network to meet a user-specified mental map while an optimization process is performed to propagate distortions originating from road network warping. To generate a map, the proposed method includes algorithms for estimating road significance and for deforming a road network according to various geometric and aesthetic constraints. The proposed method can produce an iconic mark of a theme from a road network and meet a user-specified mental map. Therefore, the resulting map can serve as a tourist or destination map that not only provides visual aids for route planning and navigation tasks, but also visually emphasizes the presentation of a theme in a map for the purpose of advertising. In the experiments, the demonstrations of map generations show that our method enables map generation systems to generate deformed tourist and destination maps efficiently.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Tourist and destination maps are thematic maps designed to represent specific themes in maps. The road network topologies in these maps are generally more important than the geometric accuracy of roads. A road network warping method is proposed to facilitate map generation and improve theme representation in maps. The basic idea is deforming a road network to meet a user-specified mental map while an optimization process is performed to propagate distortions originating from road network warping. To generate a map, the proposed method includes algorithms for estimating road significance and for deforming a road network according to various geometric and aesthetic constraints. The proposed method can produce an iconic mark of a theme from a road network and meet a user-specified mental map. Therefore, the resulting map can serve as a tourist or destination map that not only provides visual aids for route planning and navigation tasks, but also visually emphasizes the presentation of a theme in a map for the purpose of advertising. In the experiments, the demonstrations of map generations show that our method enables map generation systems to generate deformed tourist and destination maps efficiently.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Tourist and destination maps are thematic maps designed to represent specific themes in maps. The road network topologies in these maps are generally more important than the geometric accuracy of roads. A road network warping method is proposed to facilitate map generation and improve theme representation in maps. The basic idea is deforming a road network to meet a user-specified mental map while an optimization process is performed to propagate distortions originating from road network warping. To generate a map, the proposed method includes algorithms for estimating road significance and for deforming a road network according to various geometric and aesthetic constraints. The proposed method can produce an iconic mark of a theme from a road network and meet a user-specified mental map. Therefore, the resulting map can serve as a tourist or destination map that not only provides visual aids for route planning and navigation tasks, but also visually emphasizes the presentation of a theme in a map for the purpose of advertising. In the experiments, the demonstrations of map generations show that our method enables map generation systems to generate deformed tourist and destination maps efficiently.",
"title": "Drawing Road Networks with Mental Maps",
"normalizedTitle": "Drawing Road Networks with Mental Maps",
"fno": "06774478",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Roads",
"Shape",
"Optimization",
"Navigation",
"Visualization",
"Network Topology",
"Distortion Measurement",
"Information Visualization",
"Map Generation",
"Mesh Warping"
],
"authors": [
{
"givenName": "Shih-Syun",
"surname": "Lin",
"fullName": "Shih-Syun Lin",
"affiliation": "Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chao-Hung",
"surname": "Lin",
"fullName": "Chao-Hung Lin",
"affiliation": "Department of Geomatics, National Cheng Kung University, Tainan, Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yan-Jhang",
"surname": "Hu",
"fullName": "Yan-Jhang Hu",
"affiliation": "Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tong-Yee",
"surname": "Lee",
"fullName": "Tong-Yee Lee",
"affiliation": "Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2014-09-01 00:00:00",
"pubType": "trans",
"pages": "1241-1252",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdar/2009/3725/0/3725a838",
"title": "A Method for Automatically Extracting Road Layers from Raster Maps",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2009/3725a838/12OmNANTArL",
"parentPublication": {
"id": "proceedings/icdar/2009/3725/0",
"title": "2009 10th International Conference on Document Analysis and Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icfcse/2011/1562/0/06041663",
"title": "Research on the Silk Road Tourism Development from the Perspective of Tourist Destination",
"doi": null,
"abstractUrl": "/proceedings-article/icfcse/2011/06041663/12OmNBAqZHA",
"parentPublication": {
"id": "proceedings/icfcse/2011/1562/0",
"title": "2011 International Conference on Future Computer Science and Education",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bwcca/2015/8315/0/8315a150",
"title": "An Analysis of Road Maps Based on Voronoi Diagram for Vehicular Broadcast",
"doi": null,
"abstractUrl": "/proceedings-article/bwcca/2015/8315a150/12OmNCctf9F",
"parentPublication": {
"id": "proceedings/bwcca/2015/8315/0",
"title": "2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lcn/2011/926/0/06115522",
"title": "MapCorrect: Automatic correction and validation of road maps using public sensing",
"doi": null,
"abstractUrl": "/proceedings-article/lcn/2011/06115522/12OmNwxlrgo",
"parentPublication": {
"id": "proceedings/lcn/2011/926/0",
"title": "2011 IEEE 36th Conference on Local Computer Networks",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmcs/1996/7436/0/74360497",
"title": "A method to fuse two kinds of digital road maps",
"doi": null,
"abstractUrl": "/proceedings-article/icmcs/1996/74360497/12OmNxwENwT",
"parentPublication": {
"id": "proceedings/icmcs/1996/7436/0",
"title": "Multimedia Computing and Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/is3c/2012/4655/0/4655a101",
"title": "Ubiquitous Navigation Based on Physical Maps and GPS",
"doi": null,
"abstractUrl": "/proceedings-article/is3c/2012/4655a101/12OmNz4SOAL",
"parentPublication": {
"id": "proceedings/is3c/2012/4655/0",
"title": "Computer, Consumer and Control, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122555",
"title": "Drawing Road Networks with Focus Regions",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122555/13rRUyYjKac",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200l1885",
"title": "Beyond Road Extraction: A Dataset for Map Update using Aerial Images",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200l1885/1BmESLQ7F2U",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mdm/2022/5176/0/517600a230",
"title": "A Geospatial Method for Detecting Map-Based Road Segment Discrepancies",
"doi": null,
"abstractUrl": "/proceedings-article/mdm/2022/517600a230/1G89KdgyIgw",
"parentPublication": {
"id": "proceedings/mdm/2022/5176/0",
"title": "2022 23rd IEEE International Conference on Mobile Data Management (MDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101626",
"title": "Automatic Calibration of Road Intersection Topology using Trajectories",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101626/1kaMMZBeWZi",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06846294",
"articleId": "13rRUwvT9gu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06702511",
"articleId": "13rRUyY28Yx",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1GhRC5fLtjq",
"title": "Oct.",
"year": "2022",
"issueNum": "05",
"idPrefix": "bd",
"pubType": "journal",
"volume": "8",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1qWHcWcel8I",
"doi": "10.1109/TBDATA.2021.3057095",
"abstract": "With the enhancement of location-acquisition technologies, GPS trajectories play an essential role in data-driven intelligent transportation applications, which requires an accurate approach to match raw GPS trajectories to road segments on a digital map. However, for complex urban roads containing elevated roads and surface roads, map matching for low-frequency GPS data is still challenging. This article aims to address the biases and instability problem in existing approaches. To this end, we combine the spatial-temporal characteristics of GPS data in complex roads with driving behaviours and present a novel global map matching method including truncated density clustering algorithm, statistic features based spatial-temporal analysis, and driving-behaviour-based track modification. Additionally, a weighted-matrix based interactive voting algorithm is proposed to select the best results from a global perspective. The experiments are conducted with two real GPS trajectory datasets under three road conditions. The result shows that our approach outperforms state-of-art approaches for urban complex road networks in both accuracy and efficiency.",
"abstracts": [
{
"abstractType": "Regular",
"content": "With the enhancement of location-acquisition technologies, GPS trajectories play an essential role in data-driven intelligent transportation applications, which requires an accurate approach to match raw GPS trajectories to road segments on a digital map. However, for complex urban roads containing elevated roads and surface roads, map matching for low-frequency GPS data is still challenging. This article aims to address the biases and instability problem in existing approaches. To this end, we combine the spatial-temporal characteristics of GPS data in complex roads with driving behaviours and present a novel global map matching method including truncated density clustering algorithm, statistic features based spatial-temporal analysis, and driving-behaviour-based track modification. Additionally, a weighted-matrix based interactive voting algorithm is proposed to select the best results from a global perspective. The experiments are conducted with two real GPS trajectory datasets under three road conditions. The result shows that our approach outperforms state-of-art approaches for urban complex road networks in both accuracy and efficiency.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "With the enhancement of location-acquisition technologies, GPS trajectories play an essential role in data-driven intelligent transportation applications, which requires an accurate approach to match raw GPS trajectories to road segments on a digital map. However, for complex urban roads containing elevated roads and surface roads, map matching for low-frequency GPS data is still challenging. This article aims to address the biases and instability problem in existing approaches. To this end, we combine the spatial-temporal characteristics of GPS data in complex roads with driving behaviours and present a novel global map matching method including truncated density clustering algorithm, statistic features based spatial-temporal analysis, and driving-behaviour-based track modification. Additionally, a weighted-matrix based interactive voting algorithm is proposed to select the best results from a global perspective. The experiments are conducted with two real GPS trajectory datasets under three road conditions. The result shows that our approach outperforms state-of-art approaches for urban complex road networks in both accuracy and efficiency.",
"title": "RCIVMM: A Route Choice-Based Interactive Voting Map Matching Approach for Complex Urban Road Networks",
"normalizedTitle": "RCIVMM: A Route Choice-Based Interactive Voting Map Matching Approach for Complex Urban Road Networks",
"fno": "09347692",
"hasPdf": true,
"idPrefix": "bd",
"keywords": [
"Cartography",
"Global Positioning System",
"Intelligent Transportation Systems",
"Interactive Systems",
"Matrix Algebra",
"Object Tracking",
"Pattern Clustering",
"Road Traffic",
"Statistical Analysis",
"Town And Country Planning",
"Traffic Engineering Computing",
"Route Choice Based Interactive Voting Map Matching Approach",
"Complex Urban Road Networks",
"Location Acquisition Technologies",
"Data Driven Intelligent Transportation Applications",
"Digital Map",
"Surface Roads",
"Low Frequency GPS Data",
"Spatial Temporal Characteristics",
"Global Map Matching Method",
"Truncated Density Clustering Algorithm",
"Driving Behaviour Based Track Modification",
"Weighted Matrix Based Interactive Voting Algorithm",
"GPS Trajectory Datasets",
"Statistic Features Based Spatial Temporal Analysis",
"Roads",
"Global Positioning System",
"Hidden Markov Models",
"Trajectory",
"Big Data",
"Heuristic Algorithms",
"Noise Measurement",
"Map Matching",
"GPS Data Analysis",
"Interactive Voting",
"Outliers Detection",
"Complex Urban Road Networks"
],
"authors": [
{
"givenName": "Yaying",
"surname": "Zhang",
"fullName": "Yaying Zhang",
"affiliation": "Key Laboratory of Embedded System and Service Computing, Tongji University, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xinyuan",
"surname": "Sui",
"fullName": "Xinyuan Sui",
"affiliation": "Key Laboratory of Embedded System and Service Computing, Tongji University, Shanghai, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2022-10-01 00:00:00",
"pubType": "trans",
"pages": "1414-1427",
"year": "2022",
"issn": "2332-7790",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bigcomp/2018/3649/0/364901a426",
"title": "A Map Matching Algorithm for Complex Road Conditions Based on Base Station Data",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2018/364901a426/12OmNApu5hN",
"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/icpr/2012/2216/0/06460610",
"title": "Map matching with Hidden Markov Model on sampled road network",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460610/12OmNqIzha8",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/uic-atc/2013/2482/0/06726207",
"title": "Private Map Matching: Realistic Private Route Cognition on Road Networks",
"doi": null,
"abstractUrl": "/proceedings-article/uic-atc/2013/06726207/12OmNxVDuLW",
"parentPublication": {
"id": "proceedings/uic-atc/2013/2482/0",
"title": "2013 IEEE 10th International Conference on Ubiquitous Intelligence & Computing and 2013 IEEE 10th International Conference on Autonomic & Trusted Computing (UIC/ATC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc2/2017/5862/0/5862a271",
"title": "A Hidden Markov Model-Based Map-Matching Approach for Low-Sampling-Rate GPS Trajectories",
"doi": null,
"abstractUrl": "/proceedings-article/sc2/2017/5862a271/12OmNxWcHq0",
"parentPublication": {
"id": "proceedings/sc2/2017/5862/0",
"title": "2017 IEEE 7th International Symposium on Cloud and Service Computing (SC2)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nbis/2012/4779/0/4779a082",
"title": "Estimating the Number of Lanes on Rapid Road Map Survey System Using GPS Trajectories as Collective Intelligence",
"doi": null,
"abstractUrl": "/proceedings-article/nbis/2012/4779a082/12OmNxbEtIl",
"parentPublication": {
"id": "proceedings/nbis/2012/4779/0",
"title": "2012 15th International Conference on Network-Based Information Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2017/6543/0/6543a009",
"title": "IF-Matching: Towards Accurate Map-Matching with Information Fusion",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2017/6543a009/12OmNxy4N0U",
"parentPublication": {
"id": "proceedings/icde/2017/6543/0",
"title": "2017 IEEE 33rd International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2017/01/07590096",
"title": "IF-Matching: Towards Accurate Map-Matching with Information Fusion",
"doi": null,
"abstractUrl": "/journal/tk/2017/01/07590096/13rRUNvya9x",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/06/08320847",
"title": "Visual Interactive Map Matching",
"doi": null,
"abstractUrl": "/journal/tg/2018/06/08320847/13rRUwInvBd",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bwcca/2010/4236/0/05633020",
"title": "A Road Location Estimating Method by Many Trajectories to Realize Rapid Map Survey for a Car Navigation System",
"doi": null,
"abstractUrl": "/proceedings-article/bwcca/2010/05633020/183rAfmup6p",
"parentPublication": {
"id": "proceedings/bwcca/2010/4236/0",
"title": "2010 International Conference on Broadband, Wireless Computing, Communication and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigcomp/2019/7789/0/08679461",
"title": "Road Segment Interpolation for Incomplete Road Data",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2019/08679461/18Xkis4mchy",
"parentPublication": {
"id": "proceedings/bigcomp/2019/7789/0",
"title": "2019 IEEE International Conference on Big Data and Smart Computing (BigComp)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09328314",
"articleId": "1qutMKfYW1a",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09216493",
"articleId": "1nJsokioqA0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzmclO0",
"title": "July",
"year": "1993",
"issueNum": "07",
"idPrefix": "tp",
"pubType": "journal",
"volume": "15",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwvBy9J",
"doi": "10.1109/34.221169",
"abstract": "Edges in a scene generally project to smooth continuous curves nearly everywhere in the image, which results in low angular deviation of the intensity gradients in small neighborhoods straddling edges. Angular deviation is shown to be a measure of SNR. A theoretical analysis of angular deviation arising due to independent and identically distributed N(0, sigma /sup 2/) random noise is presented. Angular deviation thresholds for neighborhood sizes from 3*3 to 11*11 pixels are determined both from this analysis and numerical examples. The proposed gradient angular dispersion detection algorithm detects edge elements by comparing the measured angular deviation with values computed for the minimum acceptable SNR. Low values of deviation violate the 'no edge' hypothesis. The algorithm is shown to make good use of the limited dynamic range of the imaging system. The sensitivity and selectivity of the strategy are both shown to be high.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Edges in a scene generally project to smooth continuous curves nearly everywhere in the image, which results in low angular deviation of the intensity gradients in small neighborhoods straddling edges. Angular deviation is shown to be a measure of SNR. A theoretical analysis of angular deviation arising due to independent and identically distributed N(0, sigma /sup 2/) random noise is presented. Angular deviation thresholds for neighborhood sizes from 3*3 to 11*11 pixels are determined both from this analysis and numerical examples. The proposed gradient angular dispersion detection algorithm detects edge elements by comparing the measured angular deviation with values computed for the minimum acceptable SNR. Low values of deviation violate the 'no edge' hypothesis. The algorithm is shown to make good use of the limited dynamic range of the imaging system. The sensitivity and selectivity of the strategy are both shown to be high.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Edges in a scene generally project to smooth continuous curves nearly everywhere in the image, which results in low angular deviation of the intensity gradients in small neighborhoods straddling edges. Angular deviation is shown to be a measure of SNR. A theoretical analysis of angular deviation arising due to independent and identically distributed N(0, sigma /sup 2/) random noise is presented. Angular deviation thresholds for neighborhood sizes from 3*3 to 11*11 pixels are determined both from this analysis and numerical examples. The proposed gradient angular dispersion detection algorithm detects edge elements by comparing the measured angular deviation with values computed for the minimum acceptable SNR. Low values of deviation violate the 'no edge' hypothesis. The algorithm is shown to make good use of the limited dynamic range of the imaging system. The sensitivity and selectivity of the strategy are both shown to be high.",
"title": "Using Angular Dispersion of Gradient Direction for Detecting Edge Ribbons",
"normalizedTitle": "Using Angular Dispersion of Gradient Direction for Detecting Edge Ribbons",
"fno": "i0682",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Image Recognition Edge Detection Angular Deviation Distributed Random Noise Angular Dispersion Gradient Direction Intensity Gradients Gradient Angular Dispersion Detection Sensitivity Selectivity 11 Pixels 121 Pixels 3 Pixels 9 Pixels Edge Detection Noise Numerical Analysis"
],
"authors": [
{
"givenName": "P.H.",
"surname": "Gregson",
"fullName": "P.H. Gregson",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "1993-07-01 00:00:00",
"pubType": "trans",
"pages": "682-696",
"year": "1993",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0668",
"articleId": "13rRUxly96t",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0697",
"articleId": "13rRUyueghU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrJRP1W",
"title": "August",
"year": "2002",
"issueNum": "08",
"idPrefix": "tc",
"pubType": "journal",
"volume": "51",
"label": "August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxNEqOY",
"doi": "10.1109/TC.2002.1024743",
"abstract": "In this paper, we propose a new addition formula in projective coordinates for elliptic curves over GF(2^n). The new formula speeds up the elliptic curve scalar multiplication by reducing the number of field multiplications. This was achieved by rewriting the elliptic curve addition formula. The complexity analysis shows that the new addition formula speeds up the addition in projective coordinates by about 10-2 percent, which leads to enhanced scalar multiplication methods for random and Koblitz curves.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we propose a new addition formula in projective coordinates for elliptic curves over GF(2^n). The new formula speeds up the elliptic curve scalar multiplication by reducing the number of field multiplications. This was achieved by rewriting the elliptic curve addition formula. The complexity analysis shows that the new addition formula speeds up the addition in projective coordinates by about 10-2 percent, which leads to enhanced scalar multiplication methods for random and Koblitz curves.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we propose a new addition formula in projective coordinates for elliptic curves over GF(2^n). The new formula speeds up the elliptic curve scalar multiplication by reducing the number of field multiplications. This was achieved by rewriting the elliptic curve addition formula. The complexity analysis shows that the new addition formula speeds up the addition in projective coordinates by about 10-2 percent, which leads to enhanced scalar multiplication methods for random and Koblitz curves.",
"title": "A New Addition Formula for Elliptic Curves over GF(2^n)",
"normalizedTitle": "A New Addition Formula for Elliptic Curves over GF(2^n)",
"fno": "t0972",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Public Key Cryptography",
"Elliptic Curves",
"Point Addition",
"Projective Coordinates",
"Scalar Multiplication"
],
"authors": [
{
"givenName": "Essame",
"surname": "Al-Daoud",
"fullName": "Essame Al-Daoud",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ramlan",
"surname": "Mahmod",
"fullName": "Ramlan Mahmod",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mohammad",
"surname": "Rushdan",
"fullName": "Mohammad Rushdan",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Adem",
"surname": "Kilicman",
"fullName": "Adem Kilicman",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2002-08-01 00:00:00",
"pubType": "trans",
"pages": "972-975",
"year": "2002",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "t0963",
"articleId": "13rRUxOdDc2",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAIMOaz",
"title": "November",
"year": "2006",
"issueNum": "11",
"idPrefix": "tk",
"pubType": "journal",
"volume": "18",
"label": "November",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygBw7p",
"doi": "10.1109/TKDE.2006.165",
"abstract": "Angular similarity measures have been utilized by several database applications to define semantic similarity between various data types such as text documents, time-series, images, and scientific data. Although similarity searches based on Euclidean distance have been extensively studied in the database community, processing of angular similarity searches has been relatively untouched. Problems due to a mismatch in the underlying geometry as well as the high dimensionality of the data make current techniques either inapplicable or their use results in poor performance. This brings up the need for effective indexing methods for angular similarity queries. We first discuss how to efficiently process such queries and propose effective access structures suited to angular similarity measures. In particular, we propose two classes of access structures, namely, Angular-sweep and Cone-shell, which perform different types of quantization based on the angular orientation of the data objects. We also develop query processing algorithms that utilize these structures as dense indices. The proposed techniques are shown to be scalable with respect to both dimensionality and the size of the data. Our experimental results on real data sets from various applications show two to three orders of magnitude of speedup over the current techniques.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Angular similarity measures have been utilized by several database applications to define semantic similarity between various data types such as text documents, time-series, images, and scientific data. Although similarity searches based on Euclidean distance have been extensively studied in the database community, processing of angular similarity searches has been relatively untouched. Problems due to a mismatch in the underlying geometry as well as the high dimensionality of the data make current techniques either inapplicable or their use results in poor performance. This brings up the need for effective indexing methods for angular similarity queries. We first discuss how to efficiently process such queries and propose effective access structures suited to angular similarity measures. In particular, we propose two classes of access structures, namely, Angular-sweep and Cone-shell, which perform different types of quantization based on the angular orientation of the data objects. We also develop query processing algorithms that utilize these structures as dense indices. The proposed techniques are shown to be scalable with respect to both dimensionality and the size of the data. Our experimental results on real data sets from various applications show two to three orders of magnitude of speedup over the current techniques.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Angular similarity measures have been utilized by several database applications to define semantic similarity between various data types such as text documents, time-series, images, and scientific data. Although similarity searches based on Euclidean distance have been extensively studied in the database community, processing of angular similarity searches has been relatively untouched. Problems due to a mismatch in the underlying geometry as well as the high dimensionality of the data make current techniques either inapplicable or their use results in poor performance. This brings up the need for effective indexing methods for angular similarity queries. We first discuss how to efficiently process such queries and propose effective access structures suited to angular similarity measures. In particular, we propose two classes of access structures, namely, Angular-sweep and Cone-shell, which perform different types of quantization based on the angular orientation of the data objects. We also develop query processing algorithms that utilize these structures as dense indices. The proposed techniques are shown to be scalable with respect to both dimensionality and the size of the data. Our experimental results on real data sets from various applications show two to three orders of magnitude of speedup over the current techniques.",
"title": "Access Structures for Angular Similarity Queries",
"normalizedTitle": "Access Structures for Angular Similarity Queries",
"fno": "k1512",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Angular Query",
"Performance",
"Indexing",
"Angular Similarity Measures",
"High Dimensional Data"
],
"authors": [
{
"givenName": "Tan",
"surname": "Apaydin",
"fullName": "Tan Apaydin",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hakan",
"surname": "Ferhatosmanoglu",
"fullName": "Hakan Ferhatosmanoglu",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2006-11-01 00:00:00",
"pubType": "trans",
"pages": "1512-1525",
"year": "2006",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icip/1995/7310/2/73102157",
"title": "Edge detection operators for angular data",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1995/73102157/12OmNAXglVw",
"parentPublication": {
"id": "proceedings/icip/1995/7310/2",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2000/0750/2/07502021",
"title": "Distance between Histograms of Angular Measurements and its Application to Handwritten Character Similarity",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2000/07502021/12OmNvq5jvQ",
"parentPublication": {
"id": "proceedings/icpr/2000/0750/2",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icfcc/2009/3591/0/3591a172",
"title": "Hierarchical Structures Based on Fuzzy Similarity Relation",
"doi": null,
"abstractUrl": "/proceedings-article/icfcc/2009/3591a172/12OmNxEBzcw",
"parentPublication": {
"id": "proceedings/icfcc/2009/3591/0",
"title": "2009 International Conference on Future Computer and Communication (ICFCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdew/2018/6306/0/630601a078",
"title": "Towards Artificial Priority Queues for Similarity Query Execution",
"doi": null,
"abstractUrl": "/proceedings-article/icdew/2018/630601a078/12OmNxG1yJh",
"parentPublication": {
"id": "proceedings/icdew/2018/6306/0",
"title": "2018 IEEE 34th International Conference on Data Engineering Workshops (ICDEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2011/4439/0/4439a547",
"title": "Analysis of Concept Similarity Methods Applied to an LSH Function",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2011/4439a547/12OmNz5apw0",
"parentPublication": {
"id": "proceedings/compsac/2011/4439/0",
"title": "2011 IEEE 35th Annual Computer Software and Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dasc/2009/3929/0/3929a323",
"title": "Similarity Computation Using Reconfigurable Embedded Hardware",
"doi": null,
"abstractUrl": "/proceedings-article/dasc/2009/3929a323/12OmNzzxusA",
"parentPublication": {
"id": "proceedings/dasc/2009/3929/0",
"title": "Dependable, Autonomic and Secure Computing, IEEE International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1999/09/i0871",
"title": "Similarity Measures",
"doi": null,
"abstractUrl": "/journal/tp/1999/09/i0871/13rRUB6Sq1l",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2014/10/06783789",
"title": "Batch-Orthogonal Locality-Sensitive Hashing for Angular Similarity",
"doi": null,
"abstractUrl": "/journal/tp/2014/10/06783789/13rRUwhpBFe",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2008/04/ttk2008040504",
"title": "Adaptive Broadcasting for Similarity Queries in Wireless Content Delivery Systems",
"doi": null,
"abstractUrl": "/journal/tk/2008/04/ttk2008040504/13rRUxNmPE9",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2001/01/k0079",
"title": "Multiple Similarity Queries: A Basic DBMS Operation for Mining in Metric Databases",
"doi": null,
"abstractUrl": "/journal/tk/2001/01/k0079/13rRUxly9ed",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "k1497",
"articleId": "13rRUxBrGhg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "k1526",
"articleId": "13rRUygT7yr",
"__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": "13rRUNvya9i",
"doi": "10.1109/TVCG.2010.138",
"abstract": "When analyzing multidimensional, quantitative data, the comparison of two or more groups of dimensions is a common task. Typical sources of such data are experiments in biology, physics or engineering, which are conducted in different configurations and use replicates to ensure statistically significant results. One common way to analyze this data is to filter it using statistical methods and then run clustering algorithms to group similar values. The clustering results can be visualized using heat maps, which show differences between groups as changes in color. However, in cases where groups of dimensions have an a priori meaning, it is not desirable to cluster all dimensions combined, since a clustering algorithm can fragment continuous blocks of records. Furthermore, identifying relevant elements in heat maps becomes more difficult as the number of dimensions increases. To aid in such situations, we have developed Matchmaker, a visualization technique that allows researchers to arbitrarily arrange and compare multiple groups of dimensions at the same time. We create separate groups of dimensions which can be clustered individually, and place them in an arrangement of heat maps reminiscent of parallel coordinates. To identify relations, we render bundled curves and ribbons between related records in different groups. We then allow interactive drill-downs using enlarged detail views of the data, which enable in-depth comparisons of clusters between groups. To reduce visual clutter, we minimize crossings between the views. This paper concludes with two case studies. The first demonstrates the value of our technique for the comparison of clustering algorithms. In the second, biologists use our system to investigate why certain strains of mice develop liver disease while others remain healthy, informally showing the efficacy of our system when analyzing multidimensional data containing distinct groups of dimensions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "When analyzing multidimensional, quantitative data, the comparison of two or more groups of dimensions is a common task. Typical sources of such data are experiments in biology, physics or engineering, which are conducted in different configurations and use replicates to ensure statistically significant results. One common way to analyze this data is to filter it using statistical methods and then run clustering algorithms to group similar values. The clustering results can be visualized using heat maps, which show differences between groups as changes in color. However, in cases where groups of dimensions have an a priori meaning, it is not desirable to cluster all dimensions combined, since a clustering algorithm can fragment continuous blocks of records. Furthermore, identifying relevant elements in heat maps becomes more difficult as the number of dimensions increases. To aid in such situations, we have developed Matchmaker, a visualization technique that allows researchers to arbitrarily arrange and compare multiple groups of dimensions at the same time. We create separate groups of dimensions which can be clustered individually, and place them in an arrangement of heat maps reminiscent of parallel coordinates. To identify relations, we render bundled curves and ribbons between related records in different groups. We then allow interactive drill-downs using enlarged detail views of the data, which enable in-depth comparisons of clusters between groups. To reduce visual clutter, we minimize crossings between the views. This paper concludes with two case studies. The first demonstrates the value of our technique for the comparison of clustering algorithms. In the second, biologists use our system to investigate why certain strains of mice develop liver disease while others remain healthy, informally showing the efficacy of our system when analyzing multidimensional data containing distinct groups of dimensions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "When analyzing multidimensional, quantitative data, the comparison of two or more groups of dimensions is a common task. Typical sources of such data are experiments in biology, physics or engineering, which are conducted in different configurations and use replicates to ensure statistically significant results. One common way to analyze this data is to filter it using statistical methods and then run clustering algorithms to group similar values. The clustering results can be visualized using heat maps, which show differences between groups as changes in color. However, in cases where groups of dimensions have an a priori meaning, it is not desirable to cluster all dimensions combined, since a clustering algorithm can fragment continuous blocks of records. Furthermore, identifying relevant elements in heat maps becomes more difficult as the number of dimensions increases. To aid in such situations, we have developed Matchmaker, a visualization technique that allows researchers to arbitrarily arrange and compare multiple groups of dimensions at the same time. We create separate groups of dimensions which can be clustered individually, and place them in an arrangement of heat maps reminiscent of parallel coordinates. To identify relations, we render bundled curves and ribbons between related records in different groups. We then allow interactive drill-downs using enlarged detail views of the data, which enable in-depth comparisons of clusters between groups. To reduce visual clutter, we minimize crossings between the views. This paper concludes with two case studies. The first demonstrates the value of our technique for the comparison of clustering algorithms. In the second, biologists use our system to investigate why certain strains of mice develop liver disease while others remain healthy, informally showing the efficacy of our system when analyzing multidimensional data containing distinct groups of dimensions.",
"title": "Comparative Analysis of Multidimensional, Quantitative Data",
"normalizedTitle": "Comparative Analysis of Multidimensional, Quantitative Data",
"fno": "ttg2010061027",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Statistical Analysis",
"Data Analysis",
"Data Visualisation",
"Pattern Clustering",
"Multidimensional Data",
"Comparative Analysis",
"Multidimensional Quantitative Data",
"Biology",
"Physics",
"Engineering",
"Statistical Method",
"Clustering Algorithm",
"Heat Maps",
"Matchmaker",
"Visualization Technique",
"Interactive Drill Downs",
"Visual Clutter",
"Liver Disease",
"Data Visualization",
"Clustering Algorithms",
"Image Color Analysis",
"Heating",
"Biological Cells",
"Joining Processes",
"Bioinformatics Visualization",
"Multidimensional Data",
"Cluster Comparison"
],
"authors": [
{
"givenName": "A",
"surname": "Lex",
"fullName": "A Lex",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "M",
"surname": "Streit",
"fullName": "M Streit",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "C",
"surname": "Partl",
"fullName": "C Partl",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Karl",
"surname": "Kashofer",
"fullName": "Karl Kashofer",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dieter",
"surname": "Schmalstieg",
"fullName": "Dieter Schmalstieg",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2010-11-01 00:00:00",
"pubType": "trans",
"pages": "1027-1035",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wi-iat/2011/4513/1/4513a479",
"title": "Clustering and Visualizing Geographic Data Using Geo-tree",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2011/4513a479/12OmNC8MsHu",
"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/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": "proceedings/ccem/2017/2450/0/2450a003",
"title": "User Behaviour Anomaly Detection in Multidimensional Data",
"doi": null,
"abstractUrl": "/proceedings-article/ccem/2017/2450a003/12OmNxbmSGc",
"parentPublication": {
"id": "proceedings/ccem/2017/2450/0",
"title": "2017 IEEE International Conference on Cloud Computing in Emerging Markets (CCEM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isda/2007/2976/0/29760377",
"title": "Construction and Analysis of Evolving Data Summaries: An Application on Web Usage Data",
"doi": null,
"abstractUrl": "/proceedings-article/isda/2007/29760377/12OmNzcPAD4",
"parentPublication": {
"id": "proceedings/isda/2007/2976/0",
"title": "2007 7th International Conference on Intelligent Systems Design and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2002/03/x3048",
"title": "Using Data Compression for Multidimensional Distribution Analysis",
"doi": null,
"abstractUrl": "/magazine/ex/2002/03/x3048/13rRUwI5TTB",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/02/ttg2010020192",
"title": "Cross-Filtered Views for Multidimensional Visual Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2010/02/ttg2010020192/13rRUxBa5bO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122129",
"title": "Space-Time Visual Analytics of Eye-Tracking Data for Dynamic Stimuli",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122129/13rRUxBa5rW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2019/7474/0/747400b618",
"title": "Modeling Multidimensional User Preferences for Collaborative Filtering",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2019/747400b618/1aDSXAHcalO",
"parentPublication": {
"id": "proceedings/icde/2019/7474/0",
"title": "2019 IEEE 35th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlbdbi/2019/5094/0/509400a225",
"title": "Multi-Dimensional Visualization Analysis of China's Big Data Research from 2012 to 2019",
"doi": null,
"abstractUrl": "/proceedings-article/mlbdbi/2019/509400a225/1gjRHE1HUSk",
"parentPublication": {
"id": "proceedings/mlbdbi/2019/5094/0",
"title": "2019 International Conference on Machine Learning, Big Data and Business Intelligence (MLBDBI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2021/3931/0/393100a196",
"title": "A Visual Analytics Approach for the Diagnosis of Heterogeneous and Multidimensional Machine Maintenance Data",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2021/393100a196/1tTtsrCBB8A",
"parentPublication": {
"id": "proceedings/pacificvis/2021/3931/0",
"title": "2021 IEEE 14th Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010061044",
"articleId": "13rRUwbs1St",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010061053",
"articleId": "13rRUwd9CG0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRFz",
"name": "ttg2010061027s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2010061027s1.zip",
"extension": "zip",
"size": "2.22 MB",
"__typename": "WebExtraType"
},
{
"id": "17ShDTXWRFA",
"name": "ttg2010061027s2.avi",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2010061027s2.avi",
"extension": "avi",
"size": "45.9 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyaoDzf",
"title": "March/April",
"year": "2010",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "16",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5bO",
"doi": "10.1109/TVCG.2009.94",
"abstract": "Analysis of multidimensional data often requires careful examination of relationships across dimensions. Coordinated multiple view approaches have become commonplace in visual analysis tools because they directly support expression of complex multidimensional queries using simple interactions. However, generating such tools remains difficult because of the need to map domain-specific data structures and semantics into the idiosyncratic combinations of interdependent data and visual abstractions needed to reveal particular patterns and distributions in cross-dimensional relationships. This paper describes: 1) a method for interactively expressing sequences of multidimensional set queries by cross-filtering data values across pairs of views and 2) design strategies for constructing coordinated multiple view interfaces for cross-filtered visual analysis of multidimensional data sets. Using examples of cross-filtered visualizations of data from several different domains, we describe how cross-filtering can be modularized and reused across designs, flexibly customized with respect to data types across multiple dimensions, and incorporated into more wide-ranging multiple view designs. We also identify several important limitations of the approach. The demonstrated analytic utility of these examples suggests that cross-filtering is a suitable design pattern for instantiation in a wide variety of visual analysis tools.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Analysis of multidimensional data often requires careful examination of relationships across dimensions. Coordinated multiple view approaches have become commonplace in visual analysis tools because they directly support expression of complex multidimensional queries using simple interactions. However, generating such tools remains difficult because of the need to map domain-specific data structures and semantics into the idiosyncratic combinations of interdependent data and visual abstractions needed to reveal particular patterns and distributions in cross-dimensional relationships. This paper describes: 1) a method for interactively expressing sequences of multidimensional set queries by cross-filtering data values across pairs of views and 2) design strategies for constructing coordinated multiple view interfaces for cross-filtered visual analysis of multidimensional data sets. Using examples of cross-filtered visualizations of data from several different domains, we describe how cross-filtering can be modularized and reused across designs, flexibly customized with respect to data types across multiple dimensions, and incorporated into more wide-ranging multiple view designs. We also identify several important limitations of the approach. The demonstrated analytic utility of these examples suggests that cross-filtering is a suitable design pattern for instantiation in a wide variety of visual analysis tools.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Analysis of multidimensional data often requires careful examination of relationships across dimensions. Coordinated multiple view approaches have become commonplace in visual analysis tools because they directly support expression of complex multidimensional queries using simple interactions. However, generating such tools remains difficult because of the need to map domain-specific data structures and semantics into the idiosyncratic combinations of interdependent data and visual abstractions needed to reveal particular patterns and distributions in cross-dimensional relationships. This paper describes: 1) a method for interactively expressing sequences of multidimensional set queries by cross-filtering data values across pairs of views and 2) design strategies for constructing coordinated multiple view interfaces for cross-filtered visual analysis of multidimensional data sets. Using examples of cross-filtered visualizations of data from several different domains, we describe how cross-filtering can be modularized and reused across designs, flexibly customized with respect to data types across multiple dimensions, and incorporated into more wide-ranging multiple view designs. We also identify several important limitations of the approach. The demonstrated analytic utility of these examples suggests that cross-filtering is a suitable design pattern for instantiation in a wide variety of visual analysis tools.",
"title": "Cross-Filtered Views for Multidimensional Visual Analysis",
"normalizedTitle": "Cross-Filtered Views for Multidimensional Visual Analysis",
"fno": "ttg2010020192",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Information Visualization",
"Interactive Data Exploration And Discovery",
"Coordinated Views",
"Multidimensional Visual Analysis"
],
"authors": [
{
"givenName": "Chris",
"surname": "Weaver",
"fullName": "Chris Weaver",
"affiliation": "University of Oklahoma, Norman",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2010-03-01 00:00:00",
"pubType": "trans",
"pages": "192-204",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cmv/2004/2179/0/21790015",
"title": "Exploiting Multiple Views to Support Visual Exploration and Mining",
"doi": null,
"abstractUrl": "/proceedings-article/cmv/2004/21790015/12OmNrFBQ2S",
"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/cmv/2007/2903/0/29030061",
"title": "State of the Art: Coordinated & Multiple Views in Exploratory Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/cmv/2007/29030061/12OmNrGb2h5",
"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/2008/3268/0/3268a113",
"title": "The Impact of Multiple Coordinated Views on the Visual Data Exploration and Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2008/3268a113/12OmNrY3LB9",
"parentPublication": {
"id": "proceedings/iv/2008/3268/0",
"title": "2008 12th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2003/2055/0/20550012",
"title": "A Visual Workspace for Hybrid Multidimensional Scaling Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2003/20550012/12OmNsd6vmw",
"parentPublication": {
"id": "proceedings/ieee-infovis/2003/2055/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2011/4375/0/4375a490",
"title": "Finding and Characterizing Communities in Multidimensional Networks",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2011/4375a490/12OmNyv7mkU",
"parentPublication": {
"id": "proceedings/asonam/2011/4375/0",
"title": "2011 International Conference on Advances in Social Networks Analysis and Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmv/2004/2179/0/21790084",
"title": "Integrating UML Views with Visual Cues",
"doi": null,
"abstractUrl": "/proceedings-article/cmv/2004/21790084/12OmNz2C1mb",
"parentPublication": {
"id": "proceedings/cmv/2004/2179/0",
"title": "Proceedings. Second International Conference on Coordinated & Multiple Views in Exploratory Visualization",
"__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/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"
},
{
"id": "trans/tg/2013/12/ttg2013122070",
"title": "Visual Analysis of Higher-Order Conjunctive Relationships in Multidimensional Data Using a Hypergraph Query System",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122070/13rRUyYSWsW",
"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"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010020352",
"articleId": "13rRUNvgz9D",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010020205",
"articleId": "13rRUytWF9g",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqAU6sq",
"title": "October",
"year": "2005",
"issueNum": "10",
"idPrefix": "tk",
"pubType": "journal",
"volume": "17",
"label": "October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxD9h5u",
"doi": "10.1109/TKDE.2005.157",
"abstract": "Existing data analysis techniques have difficulty in handling multidimensional data. Multidimensional data has been a challenge for data analysis because of the inherent sparsity of the points. In this paper, we first present a novel data preprocessing technique called shrinking which optimizes the inherent characteristic of distribution of data. This data reorganization concept can be applied in many fields such as pattern recognition, data clustering, and signal processing. Then, as an important application of the data shrinking preprocessing, we propose a shrinking-based approach for multidimensional data analysis which consists of three steps: data shrinking, cluster detection, and cluster evaluation and selection. The process of data shrinking moves data points along the direction of the density gradient, thus generating condensed, widely-separated clusters. Following data shrinking, clusters are detected by finding the connected components of dense cells (and evaluated by their compactness). The data-shrinking and cluster-detection steps are conducted on a sequence of grids with different cell sizes. The clusters detected at these scales are compared by a cluster-wise evaluation measurement, and the best clusters are selected as the final result. The experimental results show that this approach can effectively and efficiently detect clusters in both low and high-dimensional spaces.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Existing data analysis techniques have difficulty in handling multidimensional data. Multidimensional data has been a challenge for data analysis because of the inherent sparsity of the points. In this paper, we first present a novel data preprocessing technique called shrinking which optimizes the inherent characteristic of distribution of data. This data reorganization concept can be applied in many fields such as pattern recognition, data clustering, and signal processing. Then, as an important application of the data shrinking preprocessing, we propose a shrinking-based approach for multidimensional data analysis which consists of three steps: data shrinking, cluster detection, and cluster evaluation and selection. The process of data shrinking moves data points along the direction of the density gradient, thus generating condensed, widely-separated clusters. Following data shrinking, clusters are detected by finding the connected components of dense cells (and evaluated by their compactness). The data-shrinking and cluster-detection steps are conducted on a sequence of grids with different cell sizes. The clusters detected at these scales are compared by a cluster-wise evaluation measurement, and the best clusters are selected as the final result. The experimental results show that this approach can effectively and efficiently detect clusters in both low and high-dimensional spaces.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Existing data analysis techniques have difficulty in handling multidimensional data. Multidimensional data has been a challenge for data analysis because of the inherent sparsity of the points. In this paper, we first present a novel data preprocessing technique called shrinking which optimizes the inherent characteristic of distribution of data. This data reorganization concept can be applied in many fields such as pattern recognition, data clustering, and signal processing. Then, as an important application of the data shrinking preprocessing, we propose a shrinking-based approach for multidimensional data analysis which consists of three steps: data shrinking, cluster detection, and cluster evaluation and selection. The process of data shrinking moves data points along the direction of the density gradient, thus generating condensed, widely-separated clusters. Following data shrinking, clusters are detected by finding the connected components of dense cells (and evaluated by their compactness). The data-shrinking and cluster-detection steps are conducted on a sequence of grids with different cell sizes. The clusters detected at these scales are compared by a cluster-wise evaluation measurement, and the best clusters are selected as the final result. The experimental results show that this approach can effectively and efficiently detect clusters in both low and high-dimensional spaces.",
"title": "A Shrinking-Based Clustering Approach for Multidimensional Data",
"normalizedTitle": "A Shrinking-Based Clustering Approach for Multidimensional Data",
"fno": "k1389",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Index Terms Data Shrinking Preprocessing",
"Clustering",
"Cluster Evaluation"
],
"authors": [
{
"givenName": "Yong",
"surname": "Shi",
"fullName": "Yong Shi",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuqing",
"surname": "Song",
"fullName": "Yuqing Song",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Aidong",
"surname": "Zhang",
"fullName": "Aidong Zhang",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2005-10-01 00:00:00",
"pubType": "trans",
"pages": "1389-1403",
"year": "2005",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/trustcom-bigdatase-i-spa/2016/3205/0/07847228",
"title": "CSBD: A Nonlinear Clustering Method Based on Cluster Shrinking and Border Detection",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom-bigdatase-i-spa/2016/07847228/12OmNBQTJgz",
"parentPublication": {
"id": "proceedings/trustcom-bigdatase-i-spa/2016/3205/0",
"title": "2016 IEEE Trustcom/BigDataSE/ISPA",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cimca/2008/3514/0/3514a368",
"title": "A Probabilistic Cluster Validity Index for Agglomerative Bayesian Fuzzy Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/cimca/2008/3514a368/12OmNwM6zZV",
"parentPublication": {
"id": "proceedings/cimca/2008/3514/0",
"title": "2008 International Conference on Computational Intelligence for Modelling Control & Automation (CIMCA 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"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/ipps/1991/9167/0/00153780",
"title": "Reconfigurable mesh algorithms for image shrinking, expanding, clustering, and template matching",
"doi": null,
"abstractUrl": "/proceedings-article/ipps/1991/00153780/12OmNyPQ4II",
"parentPublication": {
"id": "proceedings/ipps/1991/9167/0",
"title": "Parallel Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2007/2932/0/29320382",
"title": "Mining Multidimensional Data Using Clustering Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2007/29320382/12OmNzJbR3j",
"parentPublication": {
"id": "proceedings/dexa/2007/2932/0",
"title": "18th International Workshop on Database and Expert Systems Applications (DEXA 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/1994/02/l0193",
"title": "On Loop Transformations for Generalized Cycle Shrinking",
"doi": null,
"abstractUrl": "/journal/td/1994/02/l0193/13rRUIJuxuN",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2005/10/k1379",
"title": "A Data Envelopment Analysis-Based Approach for Data Preprocessing",
"doi": null,
"abstractUrl": "/journal/tk/2005/10/k1379/13rRUx0xPZQ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122581",
"title": "DICON: Interactive Visual Analysis of Multidimensional Clusters",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122581/13rRUxcbnH8",
"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"
}
],
"adjacentArticles": {
"previous": {
"fno": "k1379",
"articleId": "13rRUx0xPZQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "k1404",
"articleId": "13rRUIJcWlD",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1JYYLoKcKoU",
"title": "Feb.",
"year": "2023",
"issueNum": "01",
"idPrefix": "bd",
"pubType": "journal",
"volume": "9",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1yeC5mmD996",
"doi": "10.1109/TBDATA.2021.3123982",
"abstract": "Varied edge bundling methods have been used to reduce visual clutter in parallel coordinates plots (PCP). However, existing edge-bundled PCP do not scale well for visual analysis of multidimensional big data and often overplot the bundles in the area near the axes. In this study, we propose a scalable lightweight bundling method to support visual analysis of multidimensional big data in PCP. It helps the users discover trends and detect outliers in the data by bundling the edges between each two adjacent axes independently. We integrate human judgments into the two-dimensional data binning by novel interactions to accelerate the clustering process of the data. We use the frequency-based representation to render the clusters as histogram-like bundles to reveal the distribution of the data and eliminate the overplotting of the bundles. Based on our method, we build a lightweight web-based visual analytics system for exploring multidimensional big data in PCP. The scalability analysis of our method shows that its clustering time increases linearly with the size of the data. Its rendering time is independent of the size of the data. It can cluster and visualize 1 million data records with 6 dimensions in about 1 second in web-based visualization without pre-computation of the data or hardware-accelerated rendering. We conduct two case studies and a user study to compare our method with classic PCP and two state-of-the-art edge-bundled PCP. The results show that our method is more efficient and effective for visually analyzing multidimensional big data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Varied edge bundling methods have been used to reduce visual clutter in parallel coordinates plots (PCP). However, existing edge-bundled PCP do not scale well for visual analysis of multidimensional big data and often overplot the bundles in the area near the axes. In this study, we propose a scalable lightweight bundling method to support visual analysis of multidimensional big data in PCP. It helps the users discover trends and detect outliers in the data by bundling the edges between each two adjacent axes independently. We integrate human judgments into the two-dimensional data binning by novel interactions to accelerate the clustering process of the data. We use the frequency-based representation to render the clusters as histogram-like bundles to reveal the distribution of the data and eliminate the overplotting of the bundles. Based on our method, we build a lightweight web-based visual analytics system for exploring multidimensional big data in PCP. The scalability analysis of our method shows that its clustering time increases linearly with the size of the data. Its rendering time is independent of the size of the data. It can cluster and visualize 1 million data records with 6 dimensions in about 1 second in web-based visualization without pre-computation of the data or hardware-accelerated rendering. We conduct two case studies and a user study to compare our method with classic PCP and two state-of-the-art edge-bundled PCP. The results show that our method is more efficient and effective for visually analyzing multidimensional big data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Varied edge bundling methods have been used to reduce visual clutter in parallel coordinates plots (PCP). However, existing edge-bundled PCP do not scale well for visual analysis of multidimensional big data and often overplot the bundles in the area near the axes. In this study, we propose a scalable lightweight bundling method to support visual analysis of multidimensional big data in PCP. It helps the users discover trends and detect outliers in the data by bundling the edges between each two adjacent axes independently. We integrate human judgments into the two-dimensional data binning by novel interactions to accelerate the clustering process of the data. We use the frequency-based representation to render the clusters as histogram-like bundles to reveal the distribution of the data and eliminate the overplotting of the bundles. Based on our method, we build a lightweight web-based visual analytics system for exploring multidimensional big data in PCP. The scalability analysis of our method shows that its clustering time increases linearly with the size of the data. Its rendering time is independent of the size of the data. It can cluster and visualize 1 million data records with 6 dimensions in about 1 second in web-based visualization without pre-computation of the data or hardware-accelerated rendering. We conduct two case studies and a user study to compare our method with classic PCP and two state-of-the-art edge-bundled PCP. The results show that our method is more efficient and effective for visually analyzing multidimensional big data.",
"title": "Visual Analysis of Multidimensional Big Data: A Scalable Lightweight Bundling Method for Parallel Coordinates",
"normalizedTitle": "Visual Analysis of Multidimensional Big Data: A Scalable Lightweight Bundling Method for Parallel Coordinates",
"fno": "09599491",
"hasPdf": true,
"idPrefix": "bd",
"keywords": [
"Big Data",
"Data Analysis",
"Data Visualisation",
"Rendering Computer Graphics",
"Edge Bundled PCP",
"Frequency Based Representation",
"Hardware Accelerated Rendering",
"Lightweight Web Based Visual Analytics System",
"Multidimensional Big Data",
"Parallel Coordinates Plots",
"Two Dimensional Data Binning",
"Varied Edge Bundling Methods",
"Web Based Visualization",
"Data Visualization",
"Big Data",
"Rendering Computer Graphics",
"Image Edge Detection",
"Clutter",
"Visual Analytics",
"Scalability",
"Parallel Coordinates",
"Edge Bundling",
"Visual Analytics",
"Big Data Visualization",
"Anomaly Detection"
],
"authors": [
{
"givenName": "Wenqiang",
"surname": "Cui",
"fullName": "Wenqiang Cui",
"affiliation": "Department of ICT and Natural Sciences, Norwegian University of Science and Technology, Ålesund, Norway",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Girts",
"surname": "Strazdins",
"fullName": "Girts Strazdins",
"affiliation": "Department of ICT and Natural Sciences, Norwegian University of Science and Technology, Ålesund, Norway",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hao",
"surname": "Wang",
"fullName": "Hao Wang",
"affiliation": "Department of Computer Science, Norwegian University of Science and Technology, Gjøvik, Norway",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-02-01 00:00:00",
"pubType": "trans",
"pages": "106-117",
"year": "2023",
"issn": "2332-7790",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2010/7846/0/05571244",
"title": "3D Edge Bundling for Geographical Data Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2010/05571244/12OmNqzu6LL",
"parentPublication": {
"id": "proceedings/iv/2010/7846/0",
"title": "2010 14th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2013/4797/0/06596126",
"title": "Smooth bundling of large streaming and sequence graphs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2013/06596126/12OmNscfI0r",
"parentPublication": {
"id": "proceedings/pacificvis/2013/4797/0",
"title": "2013 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a057",
"title": "An Edge-Bundling Layout for Interactive Parallel Coordinates",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a057/12OmNwEJ0Cx",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2011/935/0/05742389",
"title": "Multilevel agglomerative edge bundling for visualizing large graphs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742389/12OmNxj233Y",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2017/4822/0/482201a419",
"title": "Segmental Offset-Mapping Parallel Coordinates for Multidimensional Integer Dataset",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2017/482201a419/12OmNyrqzG9",
"parentPublication": {
"id": "proceedings/cis/2017/4822/0",
"title": "2017 13th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wetice/2014/4249/0/4249a015",
"title": "Adaptive Constraint and Rule-Based Product Bundling in Enterprise Networks",
"doi": null,
"abstractUrl": "/proceedings-article/wetice/2014/4249a015/12OmNyvoXnt",
"parentPublication": {
"id": "proceedings/wetice/2014/4249/0",
"title": "2014 IEEE 23rd International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprise (WETICE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539373",
"title": "Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539373/13rRUwcS1CZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/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": "trans/tg/2019/10/08423100",
"title": "The Effect of Edge Bundling and Seriation on Sensemaking of Biclusters in Bipartite Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2019/10/08423100/1d3e5UbWqis",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552919",
"title": "Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552919/1xibXgJW32U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09594444",
"articleId": "1y5Z0R4UMk8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09601269",
"articleId": "1yfWqH5KaEE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1JYYS208eAg",
"name": "tbd202301-09599491s1-supp1-3123982.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/tbd202301-09599491s1-supp1-3123982.mp4",
"extension": "mp4",
"size": "12.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1KsQUyqsSje",
"title": "Jan.-Feb.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tb",
"pubType": "journal",
"volume": "20",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1z0u2hspu0M",
"doi": "10.1109/TCBB.2021.3132292",
"abstract": "Accurate diagnosis of cancer subtypes is crucial for precise treatment, because different cancer subtypes are involved with different pathology and require different therapies. Although deep learning techniques have made great success in computer vision and other fields, they do not work well on Lung cancer subtype diagnosis, due to the distinction of slide images between different cancer subtypes is ambiguous. Furthermore, they often over-fit to high-dimensional genomics data with limited samples, and do not fuse the image and genomics data in a sensible way. In this paper, we propose a hybrid deep network based approach <italic>LungDIG</italic> for <underline><italic>Lung</italic></underline> cancer subtype <underline><bold>D</bold></underline>iagnosis by fusing <underline><bold>I</bold></underline>mage-<underline><bold>G</bold></underline>enomics data. LungDIG first tiles the tissue slide image into small patches and extracts the patch-level features by fine-tuning an Inception-V3 model. Since the patches may contain some false positives in non-diagnostic regions, it further designs a patch-level feature combination strategy to integrate the extracted patch features and maintain the diversity between different cancer subtypes. At the same time, it extracts the genomics features from Copy Number Variation data by an attention based nonlinear extractor. Next, it fuses the image and genomics features by an attention based multilayer perceptron (MLP) to diagnose cancer subtype. Experiments on TCGA lung cancer data show that LungDIG can not only achieve higher accuracy for cancer subtype diagnosis than state-of-the-art methods, but also have a high authenticity and good interpretability.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Accurate diagnosis of cancer subtypes is crucial for precise treatment, because different cancer subtypes are involved with different pathology and require different therapies. Although deep learning techniques have made great success in computer vision and other fields, they do not work well on Lung cancer subtype diagnosis, due to the distinction of slide images between different cancer subtypes is ambiguous. Furthermore, they often over-fit to high-dimensional genomics data with limited samples, and do not fuse the image and genomics data in a sensible way. In this paper, we propose a hybrid deep network based approach <italic>LungDIG</italic> for <underline><italic>Lung</italic></underline> cancer subtype <underline><bold>D</bold></underline>iagnosis by fusing <underline><bold>I</bold></underline>mage-<underline><bold>G</bold></underline>enomics data. LungDIG first tiles the tissue slide image into small patches and extracts the patch-level features by fine-tuning an Inception-V3 model. Since the patches may contain some false positives in non-diagnostic regions, it further designs a patch-level feature combination strategy to integrate the extracted patch features and maintain the diversity between different cancer subtypes. At the same time, it extracts the genomics features from Copy Number Variation data by an attention based nonlinear extractor. Next, it fuses the image and genomics features by an attention based multilayer perceptron (MLP) to diagnose cancer subtype. Experiments on TCGA lung cancer data show that LungDIG can not only achieve higher accuracy for cancer subtype diagnosis than state-of-the-art methods, but also have a high authenticity and good interpretability.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Accurate diagnosis of cancer subtypes is crucial for precise treatment, because different cancer subtypes are involved with different pathology and require different therapies. Although deep learning techniques have made great success in computer vision and other fields, they do not work well on Lung cancer subtype diagnosis, due to the distinction of slide images between different cancer subtypes is ambiguous. Furthermore, they often over-fit to high-dimensional genomics data with limited samples, and do not fuse the image and genomics data in a sensible way. In this paper, we propose a hybrid deep network based approach LungDIG for Lung cancer subtype Diagnosis by fusing Image-Genomics data. LungDIG first tiles the tissue slide image into small patches and extracts the patch-level features by fine-tuning an Inception-V3 model. Since the patches may contain some false positives in non-diagnostic regions, it further designs a patch-level feature combination strategy to integrate the extracted patch features and maintain the diversity between different cancer subtypes. At the same time, it extracts the genomics features from Copy Number Variation data by an attention based nonlinear extractor. Next, it fuses the image and genomics features by an attention based multilayer perceptron (MLP) to diagnose cancer subtype. Experiments on TCGA lung cancer data show that LungDIG can not only achieve higher accuracy for cancer subtype diagnosis than state-of-the-art methods, but also have a high authenticity and good interpretability.",
"title": "Lung Cancer Subtype Diagnosis by Fusing Image-Genomics Data and Hybrid Deep Networks",
"normalizedTitle": "Lung Cancer Subtype Diagnosis by Fusing Image-Genomics Data and Hybrid Deep Networks",
"fno": "09633203",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Biological Tissues",
"Cancer",
"Computer Vision",
"Convolutional Neural Nets",
"Deep Learning Artificial Intelligence",
"Feature Extraction",
"Genomics",
"Image Fusion",
"Lung",
"Medical Image Processing",
"Multilayer Perceptrons",
"Patient Treatment",
"Attention Based Multilayer Perceptron",
"Attention Based Nonlinear Extractor",
"Cancer Therapies",
"Cancer Treatment",
"Computer Vision",
"Copy Number Variation Data",
"Deep Learning",
"High Dimensional Genomics Data",
"Hybrid Deep Network",
"Image Genomics Data Fusion",
"Inception V 3 Model",
"Lung Cancer Subtype Diagnosis",
"Lung DIG",
"MLP",
"Patch Feature Extraction",
"Patch Level Feature Combination Strategy",
"Pathology",
"TCGA Lung Cancer Data",
"Tissue Slide Image",
"Cancer",
"Feature Extraction",
"Genomics",
"Bioinformatics",
"Lung Cancer",
"Data Mining",
"Fuses",
"Cancer Subtypes Diagnosis",
"Image Genomics Data Fusion",
"Deep Neural Network",
"Attention Mechanism"
],
"authors": [
{
"givenName": "Xingze",
"surname": "Wang",
"fullName": "Xingze Wang",
"affiliation": "School of Software, Shandong University, Jinan, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guoxian",
"surname": "Yu",
"fullName": "Guoxian Yu",
"affiliation": "School of Software, Shandong University, Jinan, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhongmin",
"surname": "Yan",
"fullName": "Zhongmin Yan",
"affiliation": "School of Software, Shandong University, Jinan, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lin",
"surname": "Wan",
"fullName": "Lin Wan",
"affiliation": "School of Software, Shandong University, Jinan, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Wang",
"fullName": "Wei Wang",
"affiliation": "School of Computer and Information Technology, Beijing Jiaotong University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lizhen",
"surname": "Cui",
"fullName": "Lizhen Cui",
"affiliation": "School of Software, Shandong University, Jinan, Shandong, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "512-523",
"year": "2023",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tb/2017/05/07707443",
"title": "Cancer Subtype Discovery Based on Integrative Model of Multigenomic Data",
"doi": null,
"abstractUrl": "/journal/tb/2017/05/07707443/13rRUEgs2Kr",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2014/02/mcg2014020038",
"title": "Characterizing Cancer Subtypes Using Dual Analysis in Caleydo StratomeX",
"doi": null,
"abstractUrl": "/magazine/cg/2014/02/mcg2014020038/13rRUwhpBQ6",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2018/6217/0/247100a147",
"title": "Deep Learning with Evolutionary and Genomic Profiles for Identifying Cancer Subtypes",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2018/247100a147/17D45WODasR",
"parentPublication": {
"id": "proceedings/bibe/2018/6217/0",
"title": "2018 IEEE 18th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2023/01/09740426",
"title": "Identifying miRNA-Gene Common and Specific Regulatory Modules for Cancer Subtyping by a High-Order Graph Matching Model",
"doi": null,
"abstractUrl": "/journal/tb/2023/01/09740426/1BYE7aj5A3K",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2022/9062/0/09956514",
"title": "Lung Nodule Malignancy Subtype Discovery with Semantic Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2022/09956514/1IHpUzlnM6k",
"parentPublication": {
"id": "proceedings/icpr/2022/9062/0",
"title": "2022 26th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/01/08890799",
"title": "Integrating Multi-Omic Data With Deep Subspace Fusion Clustering for Cancer Subtype Prediction",
"doi": null,
"abstractUrl": "/journal/tb/2021/01/08890799/1eGx9jtvC92",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/02/09145808",
"title": "Supervised Graph Clustering for Cancer Subtyping Based on Survival Analysis and Integration of Multi-Omic Tumor Data",
"doi": null,
"abstractUrl": "/journal/tb/2022/02/09145808/1lDZVZB6BK8",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2020/04/08668541",
"title": "Gene Expression Classification of Lung Adenocarcinoma into Molecular Subtypes",
"doi": null,
"abstractUrl": "/journal/tb/2020/04/08668541/1m4ytWax61i",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2020/6215/0/09313502",
"title": "Integrative network analysis identified master regulatory long non-coding RNAs underlying the squamous subtype of pancreatic ductal adenocarcinoma",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2020/09313502/1qmg4p6tp9m",
"parentPublication": {
"id": "proceedings/bibm/2020/6215/0",
"title": "2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/01/09354013",
"title": "Effective Cancer Subtype and Stage Prediction via Dropfeature-DNNs",
"doi": null,
"abstractUrl": "/journal/tb/2022/01/09354013/1r9YzhCM79S",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09645237",
"articleId": "1zc6nhrcvaE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09705141",
"articleId": "1AIHUkyTaqA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAWYKCi",
"title": "May",
"year": "2018",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUB7a1g0",
"doi": "10.1109/TVCG.2017.2693151",
"abstract": "We present a method for outdoor markerless motion capture with sparse handheld video cameras. In the simplest setting, it only involves two mobile phone cameras following the character. This setup can maximize the flexibilities of data capture and broaden the applications of motion capture. To solve the character pose under such challenge settings, we exploit the generative motion capture methods and propose a novel model-view consistency that considers both foreground and background in the tracking stage. The background is modeled as a deformable 2D grid, which allows us to compute the background-view consistency for sparse moving cameras. The 3D character pose is tracked with a global-local optimization through minimizing our consistency cost. A novel Z_$L_1$_Z motion regularizer is also proposed in the optimization to constrain the solution pose space. The whole process of the proposed method is simple as frame by frame video segmentation is not required. Our method outperforms several alternative methods on various examples demonstrated in the paper.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a method for outdoor markerless motion capture with sparse handheld video cameras. In the simplest setting, it only involves two mobile phone cameras following the character. This setup can maximize the flexibilities of data capture and broaden the applications of motion capture. To solve the character pose under such challenge settings, we exploit the generative motion capture methods and propose a novel model-view consistency that considers both foreground and background in the tracking stage. The background is modeled as a deformable 2D grid, which allows us to compute the background-view consistency for sparse moving cameras. The 3D character pose is tracked with a global-local optimization through minimizing our consistency cost. A novel $L_1$ motion regularizer is also proposed in the optimization to constrain the solution pose space. The whole process of the proposed method is simple as frame by frame video segmentation is not required. Our method outperforms several alternative methods on various examples demonstrated in the paper.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a method for outdoor markerless motion capture with sparse handheld video cameras. In the simplest setting, it only involves two mobile phone cameras following the character. This setup can maximize the flexibilities of data capture and broaden the applications of motion capture. To solve the character pose under such challenge settings, we exploit the generative motion capture methods and propose a novel model-view consistency that considers both foreground and background in the tracking stage. The background is modeled as a deformable 2D grid, which allows us to compute the background-view consistency for sparse moving cameras. The 3D character pose is tracked with a global-local optimization through minimizing our consistency cost. A novel - motion regularizer is also proposed in the optimization to constrain the solution pose space. The whole process of the proposed method is simple as frame by frame video segmentation is not required. Our method outperforms several alternative methods on various examples demonstrated in the paper.",
"title": "Outdoor Markerless Motion Capture with Sparse Handheld Video Cameras",
"normalizedTitle": "Outdoor Markerless Motion Capture with Sparse Handheld Video Cameras",
"fno": "07896626",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Cameras",
"Skeleton",
"Computational Modeling",
"Optimization",
"Image Color Analysis",
"Deformable Models",
"Three Dimensional Displays",
"Markerless Motion Capture",
"Handheld Video Cameras",
"Model View Consistency"
],
"authors": [
{
"givenName": "Yangang",
"surname": "Wang",
"fullName": "Yangang Wang",
"affiliation": "Microsoft Research Asia, Microsoft Research, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yebin",
"surname": "Liu",
"fullName": "Yebin Liu",
"affiliation": "Department of Automation, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xin",
"surname": "Tong",
"fullName": "Xin Tong",
"affiliation": "Microsoft Research Asia, Microsoft Research, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qionghai",
"surname": "Dai",
"fullName": "Qionghai Dai",
"affiliation": "Department of Automation, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ping",
"surname": "Tan",
"fullName": "Ping Tan",
"affiliation": "School of Computing Science, Simon Fraser University, Burnaby, BC, Canada",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2018-05-01 00:00:00",
"pubType": "trans",
"pages": "1856-1866",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2009/3992/0/05206859",
"title": "Markerless Motion Capture with unsynchronized moving cameras",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206859/12OmNqI04JK",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2012/1226/0/236P2B35",
"title": "Spatio-temporal motion tracking with unsynchronized cameras",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/236P2B35/12OmNvrMUjR",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2016/2491/0/2491a024",
"title": "Real-Time Human Motion Capture with Multiple Depth Cameras",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2016/2491a024/12OmNwBT1rW",
"parentPublication": {
"id": "proceedings/crv/2016/2491/0",
"title": "2016 13th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cviie/2005/2524/0/25240015",
"title": "Markerless Motion Capture using Multiple Cameras",
"doi": null,
"abstractUrl": "/proceedings-article/cviie/2005/25240015/12OmNxymo7V",
"parentPublication": {
"id": "proceedings/cviie/2005/2524/0",
"title": "Computer Vision for Interactive and Intelligent Environment",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2011/0063/0/06130445",
"title": "Motion capture from dynamic orthographic cameras",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2011/06130445/12OmNyQ7FSA",
"parentPublication": {
"id": "proceedings/iccvw/2011/0063/0",
"title": "2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2017/03/07457717",
"title": "MARCOnI—ConvNet-Based MARker-Less Motion Capture in Outdoor and Indoor Scenes",
"doi": null,
"abstractUrl": "/journal/tp/2017/03/07457717/13rRUIJcWmw",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/08/07983006",
"title": "FlyCap: Markerless Motion Capture Using Multiple Autonomous Flying Cameras",
"doi": null,
"abstractUrl": "/journal/tg/2018/08/07983006/13rRUxYrbUO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/11/08458443",
"title": "Towards Fully Mobile 3D Face, Body, and Environment Capture Using Only Head-worn Cameras",
"doi": null,
"abstractUrl": "/journal/tg/2018/11/08458443/14M3E0YMV5C",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300a823",
"title": "Markerless Outdoor Human Motion Capture Using Multiple Autonomous Micro Aerial Vehicles",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300a823/1hQqk33280w",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800b321",
"title": "4D Association Graph for Realtime Multi-Person Motion Capture Using Multiple Video Cameras",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800b321/1m3nitGIUTK",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07895170",
"articleId": "13rRUwI5U2S",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07917262",
"articleId": "13rRUwI5TR4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgBY",
"name": "ttg201805-07896626s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201805-07896626s1.zip",
"extension": "zip",
"size": "288 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwIYZyo",
"title": "November",
"year": "2002",
"issueNum": "11",
"idPrefix": "tp",
"pubType": "journal",
"volume": "24",
"label": "November",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxC0SPu",
"doi": "10.1109/TPAMI.2002.1046162",
"abstract": " Disclaimer A claim of priority in research and publication appeared on page 1486 in the paper \"Relative Fuzzy Connectedness and Object Definition: Theory, Algorithms, and Applications in Image Segmentation\" by J.K. Udupa, P.K. Saha, and R.A. Lotufo (IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 11, pp. 1485-1500, Nov. 2002) with respect to the paper \"Multiseeded Segmentation Using Fuzzy Connectedness\" by G.T. Herman and B.M. Carvalho (IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 23, no. 5, pp. 460-474, May 2001). Furthermore, the wording of this claim suggests professional misconduct on the part of G.T. Herman and B.M. Carvalho. Responsibility for the content of published papers rests with the authors. The peer review process is intended to determine the overall significance of the technical contribution of a manuscript. The peer review process does not provide a way to validate every statement in a manuscript. In particular, the IEEE has not validated the claim referred to in the first paragraph above. The IEEE regrets publishing this unauthenticated statement and the pain that such publication may have caused to G.T. Herman and B.M. Carvalho. Abstract—The notion of fuzzy connectedness captures the idea of \"hanging-togetherness\" of image elements in an object by assigning a strength of connectedness to every possible path between every possible pair of image elements. This concept leads to powerful image segmentation algorithms based on dynamic programming whose effectiveness has been demonstrated on 1,000s of images in a variety of applications. In the previous framework, a fuzzy connected object is defined with a threshold on the strength of connectedness. In this paper, we introduce the notion of relative connectedness that overcomes the need for a threshold and that leads to more effective segmentations. The central idea is that an object gets defined in an image because of the presence of other co-objects. Each object is initialized by a seed element. An image element c is considered to belong to that object with respect to whose reference image element c has the highest strength of connectedness. In this fashion, objects compete among each other utilizing fuzzy connectedness to grab membership of image elements. We present a theoretical and algorithmic framework for defining objects via relative connectedness and demonstrate utilizing the theory that the objects defined are independent of reference elements chosen as long as they are not in the fuzzy boundary between objects. An iterative strategy is also introduced wherein the strongest relative connected core parts are first defined and iteratively relaxed to conservatively capture the more fuzzy parts subsequently. Examples from medical imaging are presented to illustrate visually the effectiveness of relative fuzzy connectedness. A quantitative mathematical phantom study involving 160 images is conducted to demonstrate objectively the effectiveness of relative fuzzy connectedness.",
"abstracts": [
{
"abstractType": "Regular",
"content": " Disclaimer A claim of priority in research and publication appeared on page 1486 in the paper \"Relative Fuzzy Connectedness and Object Definition: Theory, Algorithms, and Applications in Image Segmentation\" by J.K. Udupa, P.K. Saha, and R.A. Lotufo (IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 11, pp. 1485-1500, Nov. 2002) with respect to the paper \"Multiseeded Segmentation Using Fuzzy Connectedness\" by G.T. Herman and B.M. Carvalho (IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 23, no. 5, pp. 460-474, May 2001). Furthermore, the wording of this claim suggests professional misconduct on the part of G.T. Herman and B.M. Carvalho. Responsibility for the content of published papers rests with the authors. The peer review process is intended to determine the overall significance of the technical contribution of a manuscript. The peer review process does not provide a way to validate every statement in a manuscript. In particular, the IEEE has not validated the claim referred to in the first paragraph above. The IEEE regrets publishing this unauthenticated statement and the pain that such publication may have caused to G.T. Herman and B.M. Carvalho. Abstract—The notion of fuzzy connectedness captures the idea of \"hanging-togetherness\" of image elements in an object by assigning a strength of connectedness to every possible path between every possible pair of image elements. This concept leads to powerful image segmentation algorithms based on dynamic programming whose effectiveness has been demonstrated on 1,000s of images in a variety of applications. In the previous framework, a fuzzy connected object is defined with a threshold on the strength of connectedness. In this paper, we introduce the notion of relative connectedness that overcomes the need for a threshold and that leads to more effective segmentations. The central idea is that an object gets defined in an image because of the presence of other co-objects. Each object is initialized by a seed element. An image element c is considered to belong to that object with respect to whose reference image element c has the highest strength of connectedness. In this fashion, objects compete among each other utilizing fuzzy connectedness to grab membership of image elements. We present a theoretical and algorithmic framework for defining objects via relative connectedness and demonstrate utilizing the theory that the objects defined are independent of reference elements chosen as long as they are not in the fuzzy boundary between objects. An iterative strategy is also introduced wherein the strongest relative connected core parts are first defined and iteratively relaxed to conservatively capture the more fuzzy parts subsequently. Examples from medical imaging are presented to illustrate visually the effectiveness of relative fuzzy connectedness. A quantitative mathematical phantom study involving 160 images is conducted to demonstrate objectively the effectiveness of relative fuzzy connectedness.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": " Disclaimer A claim of priority in research and publication appeared on page 1486 in the paper \"Relative Fuzzy Connectedness and Object Definition: Theory, Algorithms, and Applications in Image Segmentation\" by J.K. Udupa, P.K. Saha, and R.A. Lotufo (IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 11, pp. 1485-1500, Nov. 2002) with respect to the paper \"Multiseeded Segmentation Using Fuzzy Connectedness\" by G.T. Herman and B.M. Carvalho (IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 23, no. 5, pp. 460-474, May 2001). Furthermore, the wording of this claim suggests professional misconduct on the part of G.T. Herman and B.M. Carvalho. Responsibility for the content of published papers rests with the authors. The peer review process is intended to determine the overall significance of the technical contribution of a manuscript. The peer review process does not provide a way to validate every statement in a manuscript. In particular, the IEEE has not validated the claim referred to in the first paragraph above. The IEEE regrets publishing this unauthenticated statement and the pain that such publication may have caused to G.T. Herman and B.M. Carvalho. Abstract—The notion of fuzzy connectedness captures the idea of \"hanging-togetherness\" of image elements in an object by assigning a strength of connectedness to every possible path between every possible pair of image elements. This concept leads to powerful image segmentation algorithms based on dynamic programming whose effectiveness has been demonstrated on 1,000s of images in a variety of applications. In the previous framework, a fuzzy connected object is defined with a threshold on the strength of connectedness. In this paper, we introduce the notion of relative connectedness that overcomes the need for a threshold and that leads to more effective segmentations. The central idea is that an object gets defined in an image because of the presence of other co-objects. Each object is initialized by a seed element. An image element c is considered to belong to that object with respect to whose reference image element c has the highest strength of connectedness. In this fashion, objects compete among each other utilizing fuzzy connectedness to grab membership of image elements. We present a theoretical and algorithmic framework for defining objects via relative connectedness and demonstrate utilizing the theory that the objects defined are independent of reference elements chosen as long as they are not in the fuzzy boundary between objects. An iterative strategy is also introduced wherein the strongest relative connected core parts are first defined and iteratively relaxed to conservatively capture the more fuzzy parts subsequently. Examples from medical imaging are presented to illustrate visually the effectiveness of relative fuzzy connectedness. A quantitative mathematical phantom study involving 160 images is conducted to demonstrate objectively the effectiveness of relative fuzzy connectedness.",
"title": "Relative Fuzzy Connectedness and Object Definition: Theory, Algorithms, and Applications in Image Segmentation",
"normalizedTitle": "Relative Fuzzy Connectedness and Object Definition: Theory, Algorithms, and Applications in Image Segmentation",
"fno": "i1485",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Fuzzy Connectedness",
"Image Segmentation",
"Object Definition",
"Digital Topology"
],
"authors": [
{
"givenName": "Jayaram K.",
"surname": "Udupa",
"fullName": "Jayaram K. Udupa",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Punam K.",
"surname": "Saha",
"fullName": "Punam K. Saha",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Roberto A.",
"surname": "Lotufo",
"fullName": "Roberto A. Lotufo",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2002-11-01 00:00:00",
"pubType": "trans",
"pages": "1485-1500",
"year": "2002",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i1468",
"articleId": "13rRUxAAT27",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i1501",
"articleId": "13rRUwInvBV",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.