data
dict |
|---|
{
"issue": {
"id": "1MNboCLDDZC",
"title": "June",
"year": "2023",
"issueNum": "06",
"idPrefix": "tk",
"pubType": "journal",
"volume": "35",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1D6nkGgxd6w",
"doi": "10.1109/TKDE.2022.3172048",
"abstract": "Learning representations of nodes in a low dimensional space is a crucial task with numerous interesting applications in network analysis, including link prediction, node classification, and visualization. Two popular approaches for this problem are <italic>matrix factorization</italic> and <italic>random walk</italic>-based models. In this paper, we aim to bring together the best of both worlds, towards learning node representations. In particular, we propose a weighted matrix factorization model that encodes random walk-based information about nodes of the network. The benefit of this novel formulation is that it enables us to utilize kernel functions without realizing the exact proximity matrix so that it enhances the expressiveness of existing matrix decomposition methods with kernels and alleviates their computational complexities. We extend the approach with a multiple kernel learning formulation that provides the flexibility of learning the kernel as the linear combination of a dictionary of kernels in data-driven fashion. We perform an empirical evaluation on real-world networks, showing that the proposed model outperforms baseline node embedding algorithms in downstream machine learning tasks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Learning representations of nodes in a low dimensional space is a crucial task with numerous interesting applications in network analysis, including link prediction, node classification, and visualization. Two popular approaches for this problem are <italic>matrix factorization</italic> and <italic>random walk</italic>-based models. In this paper, we aim to bring together the best of both worlds, towards learning node representations. In particular, we propose a weighted matrix factorization model that encodes random walk-based information about nodes of the network. The benefit of this novel formulation is that it enables us to utilize kernel functions without realizing the exact proximity matrix so that it enhances the expressiveness of existing matrix decomposition methods with kernels and alleviates their computational complexities. We extend the approach with a multiple kernel learning formulation that provides the flexibility of learning the kernel as the linear combination of a dictionary of kernels in data-driven fashion. We perform an empirical evaluation on real-world networks, showing that the proposed model outperforms baseline node embedding algorithms in downstream machine learning tasks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Learning representations of nodes in a low dimensional space is a crucial task with numerous interesting applications in network analysis, including link prediction, node classification, and visualization. Two popular approaches for this problem are matrix factorization and random walk-based models. In this paper, we aim to bring together the best of both worlds, towards learning node representations. In particular, we propose a weighted matrix factorization model that encodes random walk-based information about nodes of the network. The benefit of this novel formulation is that it enables us to utilize kernel functions without realizing the exact proximity matrix so that it enhances the expressiveness of existing matrix decomposition methods with kernels and alleviates their computational complexities. We extend the approach with a multiple kernel learning formulation that provides the flexibility of learning the kernel as the linear combination of a dictionary of kernels in data-driven fashion. We perform an empirical evaluation on real-world networks, showing that the proposed model outperforms baseline node embedding algorithms in downstream machine learning tasks.",
"title": "Multiple Kernel Representation Learning on Networks",
"normalizedTitle": "Multiple Kernel Representation Learning on Networks",
"fno": "09768031",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Kernel",
"Computational Modeling",
"Task Analysis",
"Data Models",
"Matrix Decomposition",
"Predictive Models",
"Representation Learning",
"Graph Representation Learning",
"Node Embeddings",
"Kernel Methods",
"Node Classification",
"Link Prediction"
],
"authors": [
{
"givenName": "Abdulkadir",
"surname": "Çelikkanat",
"fullName": "Abdulkadir Çelikkanat",
"affiliation": "Department of Applied Mathematics and Computer Science, Technical University of Denmark, Lyngby, Denmark",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yanning",
"surname": "Shen",
"fullName": "Yanning Shen",
"affiliation": "Department of EECS and the Center for Pervasive Communications and Computing, University of California, Irvine, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fragkiskos D.",
"surname": "Malliaros",
"fullName": "Fragkiskos D. Malliaros",
"affiliation": "CentraleSupélec, Inria, Centre for Visual Computing (CVN), Paris-Saclay University, Gif-Sur-Yvette, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2023-06-01 00:00:00",
"pubType": "trans",
"pages": "6113-6125",
"year": "2023",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ipdps/2017/3914/0/07967179",
"title": "An N log N Parallel Fast Direct Solver for Kernel Matrices",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2017/07967179/12OmNAkniYs",
"parentPublication": {
"id": "proceedings/ipdps/2017/3914/0",
"title": "2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2011/4584/0/4584b298",
"title": "Approximation Kernel 2DPCA by Mixture of Vector and Matrix Representation",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584b298/12OmNBDyAas",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2011/4584/0/4584a445",
"title": "Class-Incremental Kernel Discriminative Common Vectors",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584a445/12OmNxcdG2R",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2014/5118/0/5118a963",
"title": "Beta Process Multiple Kernel Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118a963/12OmNxwENw0",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mcsi/2014/4324/0/4324a195",
"title": "Tridiagonal Kernel Enhanced Multivariance Products Representation (TKEMPR) for Univariate Integral Operator Kernels",
"doi": null,
"abstractUrl": "/proceedings-article/mcsi/2014/4324a195/12OmNyL0TzK",
"parentPublication": {
"id": "proceedings/mcsi/2014/4324/0",
"title": "2014 International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460350",
"title": "An improved entropy-based multiple kernel learning",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460350/12OmNywxlPN",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209d203",
"title": "A Kernel-Based Representation to Support 3D MRI Unsupervised Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209d203/12OmNzvQI7M",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08545404",
"title": "A Linear Incremental Nyström Method for Online Kernel Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08545404/17D45VtKiut",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/06/09937157",
"title": "Adaptive Transfer Kernel Learning for Transfer Gaussian Process Regression",
"doi": null,
"abstractUrl": "/journal/tp/2023/06/09937157/1I05uIgMI1i",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/10061269",
"title": "Contrastive Multi-View Kernel Learning",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/10061269/1LiKLk3JxyU",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09774907",
"articleId": "1Dlie1q2gZa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09782541",
"articleId": "1DGRWsbL2SI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxRWI3C",
"title": "November",
"year": "1981",
"issueNum": "06",
"idPrefix": "ts",
"pubType": "journal",
"volume": "7",
"label": "November",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwbs22n",
"doi": "10.1109/TSE.1981.226473",
"abstract": "In this paper a hierarchical graph model for programs based on the concepts of recursive graphs (RG's) and Codd relations is presented. The purpose of the model is to clearly represent the structure of a program implemented in a structured language, such as Pascal, Algol, or PL/1, so that the program can be analyzed and modifications to the program can be clearly specified. The model uses an RG representation for the control flow and the data flow with an equivalent relational representation. It also has a relational representation for the objects defmed within the program. The various aspects of the model are illustrated using Pascal constructs and a model for an example Pascal program is given.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper a hierarchical graph model for programs based on the concepts of recursive graphs (RG's) and Codd relations is presented. The purpose of the model is to clearly represent the structure of a program implemented in a structured language, such as Pascal, Algol, or PL/1, so that the program can be analyzed and modifications to the program can be clearly specified. The model uses an RG representation for the control flow and the data flow with an equivalent relational representation. It also has a relational representation for the objects defmed within the program. The various aspects of the model are illustrated using Pascal constructs and a model for an example Pascal program is given.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper a hierarchical graph model for programs based on the concepts of recursive graphs (RG's) and Codd relations is presented. The purpose of the model is to clearly represent the structure of a program implemented in a structured language, such as Pascal, Algol, or PL/1, so that the program can be analyzed and modifications to the program can be clearly specified. The model uses an RG representation for the control flow and the data flow with an equivalent relational representation. It also has a relational representation for the objects defmed within the program. The various aspects of the model are illustrated using Pascal constructs and a model for an example Pascal program is given.",
"title": "A Model for Representing Programs Using Hierarchical Graphs",
"normalizedTitle": "A Model for Representing Programs Using Hierarchical Graphs",
"fno": "01702888",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Recursive Graph",
"Codd Relations",
"Control Flow",
"Data Flow",
"Graph Grammar",
"Hierarchical Graphs",
"Program Analysis",
"Program Model",
"Program Modifications",
"Program Objects"
],
"authors": [
{
"givenName": "S.S.",
"surname": "Yau",
"fullName": "S.S. Yau",
"affiliation": "Department of Electrical Engineering and Computer Science, Northwestern University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "P.C.",
"surname": "Grabow",
"fullName": "P.C. Grabow",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "1981-11-01 00:00:00",
"pubType": "trans",
"pages": "556-574",
"year": "1981",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/issre/1996/7707/0/77070256",
"title": "Method for designing and placing check sets based on control flow analysis of programs",
"doi": null,
"abstractUrl": "/proceedings-article/issre/1996/77070256/12OmNAMbZIV",
"parentPublication": {
"id": "proceedings/issre/1996/7707/0",
"title": "Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsec/1999/0509/0/05090216",
"title": "Using Multiple Graphs of Programs to Modify Specifications",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/1999/05090216/12OmNAle6Ag",
"parentPublication": {
"id": "proceedings/apsec/1999/0509/0",
"title": "Proceedings Sixth Asia Pacific Software Engineering Conference (ASPEC'99) (Cat. No.PR00509)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdp/1996/7376/0/73760080",
"title": "Object-Oriented Model of Parallel Programs",
"doi": null,
"abstractUrl": "/proceedings-article/pdp/1996/73760080/12OmNAtst8D",
"parentPublication": {
"id": "proceedings/pdp/1996/7376/0",
"title": "4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmpsac/1989/1964/0/00065117",
"title": "Representing programs in multiparadigm software development environments",
"doi": null,
"abstractUrl": "/proceedings-article/cmpsac/1989/00065117/12OmNCfAPLe",
"parentPublication": {
"id": "proceedings/cmpsac/1989/1964/0",
"title": "Proceedings of the Thirteenth Annual International Computer Software & Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpc/2009/3998/0/05090077",
"title": "Representing source code with Granular hierarchical structures",
"doi": null,
"abstractUrl": "/proceedings-article/icpc/2009/05090077/12OmNqIhFPE",
"parentPublication": {
"id": "proceedings/icpc/2009/3998/0",
"title": "2009 IEEE 17th International Conference on Program Comprehension (ICPC 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/weit/2011/4628/0/4628a095",
"title": "A Graph Grammar to Transform DAGs into Graphs Describing Multithreaded Programs",
"doi": null,
"abstractUrl": "/proceedings-article/weit/2011/4628a095/12OmNrF2DNh",
"parentPublication": {
"id": "proceedings/weit/2011/4628/0",
"title": "Theoretical Computer Science, Workshop-School on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apaqs/2000/0825/0/08250039",
"title": "An Approach to Analyzing Dependency of Concurrent Programs",
"doi": null,
"abstractUrl": "/proceedings-article/apaqs/2000/08250039/12OmNyQYtkH",
"parentPublication": {
"id": "proceedings/apaqs/2000/0825/0",
"title": "Asia-Pacific Conference on Quality Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdse/1999/0191/0/01910013",
"title": "Multithreaded Dependence Graphs for Concurrent Java Program",
"doi": null,
"abstractUrl": "/proceedings-article/pdse/1999/01910013/12OmNzzfToh",
"parentPublication": {
"id": "proceedings/pdse/1999/0191/0",
"title": "Software Engineering for Parallel and Distributed Systems, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1990/05/e0498",
"title": "Data Dependency Graphs for Ada Programs",
"doi": null,
"abstractUrl": "/journal/ts/1990/05/e0498/13rRUxOdD4i",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1988/11/e1621",
"title": "Web Structures: A Tool for Representing and Manipulating Programs",
"doi": null,
"abstractUrl": "/journal/ts/1988/11/e1621/13rRUygBw8D",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "01702887",
"articleId": "13rRUxlgxUZ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01702889",
"articleId": "13rRUxjQyiI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx7ouJX",
"title": "July",
"year": "1990",
"issueNum": "07",
"idPrefix": "ts",
"pubType": "journal",
"volume": "16",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjoNyG",
"doi": "10.1109/32.56101",
"abstract": "A relational notation for specifying state transition systems is presented. Several refinement relations between specifications are defined. To illustrate the concepts and methods, three specifications of the alternating-bit protocol are given. The theory is applied to explain auxiliary variables. Other applications of the theory to protocol verification, composition, and conversion are discussed. The approach is compared with previously published approaches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A relational notation for specifying state transition systems is presented. Several refinement relations between specifications are defined. To illustrate the concepts and methods, three specifications of the alternating-bit protocol are given. The theory is applied to explain auxiliary variables. Other applications of the theory to protocol verification, composition, and conversion are discussed. The approach is compared with previously published approaches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A relational notation for specifying state transition systems is presented. Several refinement relations between specifications are defined. To illustrate the concepts and methods, three specifications of the alternating-bit protocol are given. The theory is applied to explain auxiliary variables. Other applications of the theory to protocol verification, composition, and conversion are discussed. The approach is compared with previously published approaches.",
"title": "A Relational Notation for State Transition Systems",
"normalizedTitle": "A Relational Notation for State Transition Systems",
"fno": "e0755",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Relational Notation Specifying State Transition Systems Refinement Relations Alternating Bit Protocol Composition Formal Specification Protocols"
],
"authors": [
{
"givenName": "S.S.",
"surname": "Lam",
"fullName": "S.S. Lam",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "A.U.",
"surname": "Shankar",
"fullName": "A.U. Shankar",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "1990-07-01 00:00:00",
"pubType": "trans",
"pages": "755-775",
"year": "1990",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "e0741",
"articleId": "13rRUwjXZLn",
"__typename": "AdjacentArticleType"
},
"next": null,
"__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": "13rRUyY28Yj",
"doi": "10.1109/TVCG.2006.161",
"abstract": "Data abstraction techniques are widely used in multiresolution visualization systems to reduce visual clutter and facilitate analysis from overview to detail. However, analysts are usually unaware of how well the abstracted data represent the original dataset, which can impact the reliability of results gleaned from the abstractions. In this paper, we define two data abstraction quality measures for computing the degree to which the abstraction conveys the original dataset: the Histogram Difference Measure and the Nearest Neighbor Measure. They have been integrated within XmdvTool, a public-domain multiresolution visualization system for multivariate data analysis that supports sampling as well as clustering to simplify data. Several interactive operations are provided, including adjusting the data abstraction level, changing selected regions, and setting the acceptable data abstraction quality level. Conducting these operations, analysts can select an optimal data abstraction level. Also, analysts can compare different abstraction methods using the measures to see how well relative data density and outliers are maintained, and then select an abstraction method that meets the requirement of their analytic tasks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Data abstraction techniques are widely used in multiresolution visualization systems to reduce visual clutter and facilitate analysis from overview to detail. However, analysts are usually unaware of how well the abstracted data represent the original dataset, which can impact the reliability of results gleaned from the abstractions. In this paper, we define two data abstraction quality measures for computing the degree to which the abstraction conveys the original dataset: the Histogram Difference Measure and the Nearest Neighbor Measure. They have been integrated within XmdvTool, a public-domain multiresolution visualization system for multivariate data analysis that supports sampling as well as clustering to simplify data. Several interactive operations are provided, including adjusting the data abstraction level, changing selected regions, and setting the acceptable data abstraction quality level. Conducting these operations, analysts can select an optimal data abstraction level. Also, analysts can compare different abstraction methods using the measures to see how well relative data density and outliers are maintained, and then select an abstraction method that meets the requirement of their analytic tasks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Data abstraction techniques are widely used in multiresolution visualization systems to reduce visual clutter and facilitate analysis from overview to detail. However, analysts are usually unaware of how well the abstracted data represent the original dataset, which can impact the reliability of results gleaned from the abstractions. In this paper, we define two data abstraction quality measures for computing the degree to which the abstraction conveys the original dataset: the Histogram Difference Measure and the Nearest Neighbor Measure. They have been integrated within XmdvTool, a public-domain multiresolution visualization system for multivariate data analysis that supports sampling as well as clustering to simplify data. Several interactive operations are provided, including adjusting the data abstraction level, changing selected regions, and setting the acceptable data abstraction quality level. Conducting these operations, analysts can select an optimal data abstraction level. Also, analysts can compare different abstraction methods using the measures to see how well relative data density and outliers are maintained, and then select an abstraction method that meets the requirement of their analytic tasks.",
"title": "Measuring Data Abstraction Quality in Multiresolution Visualizations",
"normalizedTitle": "Measuring Data Abstraction Quality in Multiresolution Visualizations",
"fno": "v0709",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Structures",
"Data Visualisation",
"Pattern Clustering",
"Sampling Methods",
"Very Large Databases",
"Data Abstraction Quality Measures",
"Histogram Difference Measure",
"Nearest Neighbor Measure",
"Xmdv Tool",
"Public Domain Multiresolution Visualization System",
"Multivariate Data Analysis",
"Data Clustering",
"Data Visualization",
"Sampling Methods",
"Data Analysis",
"Nearest Neighbor Searches",
"Histograms",
"Displays",
"Delay",
"Coordinate Measuring Machines",
"Density Measurement",
"Bioinformatics",
"Metrics",
"Clustering",
"Sampling",
"Multiresolution Visualization Authors 1"
],
"authors": [
{
"givenName": "Qingguang",
"surname": "Cui",
"fullName": "Qingguang Cui",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matthew",
"surname": "Ward",
"fullName": "Matthew Ward",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Elke",
"surname": "Rundensteiner",
"fullName": "Elke Rundensteiner",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jing",
"surname": "Yang",
"fullName": "Jing Yang",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "trans",
"pages": "709-716",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iscc/2008/2702/0/04625601",
"title": "Searching nearest neighbor in overlay network",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2008/04625601/12OmNAio6Zu",
"parentPublication": {
"id": "proceedings/iscc/2008/2702/0",
"title": "2008 IEEE Symposium on Computers and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/coginf/2010/8042/0/05599779",
"title": "Modeling Gestalt laws for classification",
"doi": null,
"abstractUrl": "/proceedings-article/coginf/2010/05599779/12OmNC8dgf6",
"parentPublication": {
"id": "proceedings/coginf/2010/8042/0",
"title": "2010 9th IEEE International Conference on Cognitive Informatics (ICCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761711",
"title": "Memory efficient recognition of specific objects with local features",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761711/12OmNrIaem4",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04760937",
"title": "3. Similarity searching: Indexing, nearest neighbor finding, dimensionality reduction, and embedding methods for applications in multimedia databases",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04760937/12OmNwnH4UD",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispan-fcst-iscc/2017/0840/0/0840a046",
"title": "Grid-Based Indexing and Search Algorithms for Large-Scale and High-Dimensional Data",
"doi": null,
"abstractUrl": "/proceedings-article/ispan-fcst-iscc/2017/0840a046/12OmNz6iOo7",
"parentPublication": {
"id": "proceedings/ispan-fcst-iscc/2017/0840/0",
"title": "2017 14th International Symposium on Pervasive Systems, Algorithms and Networks & 2017 11th International Conference on Frontier of Computer Science and Technology & 2017 Third International Symposium of Creative Computing (ISPAN-FCST-ISCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2003/7983/0/01227559",
"title": "Early-halting criteria for instance-based learning",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2003/01227559/12OmNzayNjf",
"parentPublication": {
"id": "proceedings/aiccsa/2003/7983/0",
"title": "ACS/IEEE International Conference on Computer Systems and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2013/06/ttk2013061380",
"title": "Semi-Supervised Nonlinear Hashing Using Bootstrap Sequential Projection Learning",
"doi": null,
"abstractUrl": "/journal/tk/2013/06/ttk2013061380/13rRUIJcWlJ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2013/01/ttb2013010236",
"title": "Walks on SPR Neighborhoods",
"doi": null,
"abstractUrl": "/journal/tb/2013/01/ttb2013010236/13rRUwwJWEm",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2017/04/07776935",
"title": "Efficient Sub-Window Nearest Neighbor Search on Matrix",
"doi": null,
"abstractUrl": "/journal/tk/2017/04/07776935/13rRUx0gevr",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2011/10/ttk2011101526",
"title": "Group Enclosing Queries",
"doi": null,
"abstractUrl": "/journal/tk/2011/10/ttk2011101526/13rRUxNEqQr",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0701",
"articleId": "13rRUIM2VGV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0717",
"articleId": "13rRUxly8SO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzZ5oat",
"title": "June",
"year": "2013",
"issueNum": "06",
"idPrefix": "tk",
"pubType": "journal",
"volume": "25",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIJcWlJ",
"doi": "10.1109/TKDE.2012.76",
"abstract": "In this paper, we study the effective semi-supervised hashing method under the framework of regularized learning-based hashing. A nonlinear hash function is introduced to capture the underlying relationship among data points. Thus, the dimensionality of the matrix for computation is not only independent from the dimensionality of the original data space but also much smaller than the one using linear hash function. To effectively deal with the error accumulated during converting the real-value embeddings into the binary code after relaxation, we propose a semi-supervised nonlinear hashing algorithm using bootstrap sequential projection learning which effectively corrects the errors by taking into account of all the previous learned bits holistically without incurring the extra computational overhead. Experimental results on the six benchmark data sets demonstrate that the presented method outperforms the state-of-the-art hashing algorithms at a large margin.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we study the effective semi-supervised hashing method under the framework of regularized learning-based hashing. A nonlinear hash function is introduced to capture the underlying relationship among data points. Thus, the dimensionality of the matrix for computation is not only independent from the dimensionality of the original data space but also much smaller than the one using linear hash function. To effectively deal with the error accumulated during converting the real-value embeddings into the binary code after relaxation, we propose a semi-supervised nonlinear hashing algorithm using bootstrap sequential projection learning which effectively corrects the errors by taking into account of all the previous learned bits holistically without incurring the extra computational overhead. Experimental results on the six benchmark data sets demonstrate that the presented method outperforms the state-of-the-art hashing algorithms at a large margin.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we study the effective semi-supervised hashing method under the framework of regularized learning-based hashing. A nonlinear hash function is introduced to capture the underlying relationship among data points. Thus, the dimensionality of the matrix for computation is not only independent from the dimensionality of the original data space but also much smaller than the one using linear hash function. To effectively deal with the error accumulated during converting the real-value embeddings into the binary code after relaxation, we propose a semi-supervised nonlinear hashing algorithm using bootstrap sequential projection learning which effectively corrects the errors by taking into account of all the previous learned bits holistically without incurring the extra computational overhead. Experimental results on the six benchmark data sets demonstrate that the presented method outperforms the state-of-the-art hashing algorithms at a large margin.",
"title": "Semi-Supervised Nonlinear Hashing Using Bootstrap Sequential Projection Learning",
"normalizedTitle": "Semi-Supervised Nonlinear Hashing Using Bootstrap Sequential Projection Learning",
"fno": "ttk2013061380",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Binary Codes",
"Semantics",
"Hamming Distance",
"Boosting",
"Nearest Neighbor Searches",
"Computer Science",
"Training",
"Nearest Neighbor Search",
"Hashing",
"Semi Supervised Hashing"
],
"authors": [
{
"givenName": "Chenxia",
"surname": "Wu",
"fullName": "Chenxia Wu",
"affiliation": "Zhejiang University, Hangzhou",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jianke",
"surname": "Zhu",
"fullName": "Jianke Zhu",
"affiliation": "Zhejiang University, Hangzhou",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Deng",
"surname": "Cai",
"fullName": "Deng Cai",
"affiliation": "Zhejiang Univerisity, Hangzhou",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chun",
"surname": "Chen",
"fullName": "Chun Chen",
"affiliation": "Zhejiang University, Hangzhou",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiajun",
"surname": "Bu",
"fullName": "Jiajun Bu",
"affiliation": "Zhejiang University, Hangzhou",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2013-06-01 00:00:00",
"pubType": "trans",
"pages": "1380-1393",
"year": "2013",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2014/5118/0/5118c147",
"title": "Collaborative Hashing",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118c147/12OmNApcuh5",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2011/4408/0/4408b122",
"title": "Semi-supervised Discriminant Hashing",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2011/4408b122/12OmNB7LvGO",
"parentPublication": {
"id": "proceedings/icdm/2011/4408/0",
"title": "2011 IEEE 11th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2014/4761/0/06890219",
"title": "Scalable forest hashing for fast similarity search",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2014/06890219/12OmNBU1jI4",
"parentPublication": {
"id": "proceedings/icme/2014/4761/0",
"title": "2014 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851f119",
"title": "Multilinear Hyperplane Hashing",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851f119/12OmNCuVaAL",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2012/1226/0/262O2D04",
"title": "Supervised hashing with kernels",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/262O2D04/12OmNCzsKHo",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2016/0641/0/07477690",
"title": "Kernel auto-encoder for semi-supervised hashing",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2016/07477690/12OmNvs4vnM",
"parentPublication": {
"id": "proceedings/wacv/2016/0641/0",
"title": "2016 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032a437",
"title": "MIHash: Online Hashing with Mutual Information",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032a437/12OmNwEJ0VH",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2012/12/ttp2012122393",
"title": "Semi-Supervised Hashing for Large-Scale Search",
"doi": null,
"abstractUrl": "/journal/tp/2012/12/ttp2012122393/13rRUwbs1TI",
"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/tp/2012/12/ttp2012122481",
"title": "A Fast Approximate Nearest Neighbor Search Algorithm in the Hamming Space",
"doi": null,
"abstractUrl": "/journal/tp/2012/12/ttp2012122481/13rRUxCitKz",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttk2013061368",
"articleId": "13rRUxd2aZo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttk2013061394",
"articleId": "13rRUwbs1ST",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxFJXw7",
"title": "April",
"year": "2017",
"issueNum": "04",
"idPrefix": "tk",
"pubType": "journal",
"volume": "29",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0gevr",
"doi": "10.1109/TKDE.2016.2633357",
"abstract": "We study a nearest neighbor search problem on a matrix by its element values. Given a data matrix Z_$D$_Z and a query matrix Z_$q$_Z , the sub-window nearest neighbor search problem finds a sub-window of Z_$D$_Z that is the most similar to Z_$q$_Z . This problem has a wide range of applications, e.g., geospatial data integration, object detection, and motion estimation. In this paper, we propose an efficient progressive search solution that overcomes the drawbacks of existing solutions. First, we present a generic approach to build level-based lower bound functions on top of basic lower bound functions. Second, we develop a novel lower bound function for a group of sub-windows, in order to boost the efficiency of our solution. Furthermore, we extend our solution to support irregular-shaped queries. Experimental results on real data demonstrate the efficiency of our proposed methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We study a nearest neighbor search problem on a matrix by its element values. Given a data matrix $D$ and a query matrix $q$ , the sub-window nearest neighbor search problem finds a sub-window of $D$ that is the most similar to $q$ . This problem has a wide range of applications, e.g., geospatial data integration, object detection, and motion estimation. In this paper, we propose an efficient progressive search solution that overcomes the drawbacks of existing solutions. First, we present a generic approach to build level-based lower bound functions on top of basic lower bound functions. Second, we develop a novel lower bound function for a group of sub-windows, in order to boost the efficiency of our solution. Furthermore, we extend our solution to support irregular-shaped queries. Experimental results on real data demonstrate the efficiency of our proposed methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We study a nearest neighbor search problem on a matrix by its element values. Given a data matrix - and a query matrix - , the sub-window nearest neighbor search problem finds a sub-window of - that is the most similar to - . This problem has a wide range of applications, e.g., geospatial data integration, object detection, and motion estimation. In this paper, we propose an efficient progressive search solution that overcomes the drawbacks of existing solutions. First, we present a generic approach to build level-based lower bound functions on top of basic lower bound functions. Second, we develop a novel lower bound function for a group of sub-windows, in order to boost the efficiency of our solution. Furthermore, we extend our solution to support irregular-shaped queries. Experimental results on real data demonstrate the efficiency of our proposed methods.",
"title": "Efficient Sub-Window Nearest Neighbor Search on Matrix",
"normalizedTitle": "Efficient Sub-Window Nearest Neighbor Search on Matrix",
"fno": "07776935",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Search Problems",
"Upper Bound",
"Nearest Neighbor Searches",
"Satellites",
"Clouds",
"Shape",
"Junctions",
"Similarity Search",
"Nearest Neighbor"
],
"authors": [
{
"givenName": "Tsz Nam",
"surname": "Chan",
"fullName": "Tsz Nam Chan",
"affiliation": "Department of Computing, Hong Kong Polytechnic University, Hong Kong, Hung Hom, Kowloon",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Man Lung",
"surname": "Yiu",
"fullName": "Man Lung Yiu",
"affiliation": "Department of Computing, Hong Kong Polytechnic University, Hong Kong, Hung Hom, Kowloon",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kien A.",
"surname": "Hua",
"fullName": "Kien A. Hua",
"affiliation": "College of Engineering & Computer Science, University of Central Florida, Orlando, FL",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2017-04-01 00:00:00",
"pubType": "trans",
"pages": "784-797",
"year": "2017",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2013/4909/0/06544822",
"title": "Voronoi-based nearest neighbor search for multi-dimensional uncertain databases",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2013/06544822/12OmNqHItMe",
"parentPublication": {
"id": "proceedings/icde/2013/4909/0",
"title": "2013 29th IEEE International Conference on Data Engineering (ICDE 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aina/2014/3630/0/3629a560",
"title": "Processing Probabilistic K-Nearest Neighbor Query Using Rlsd-Tree",
"doi": null,
"abstractUrl": "/proceedings-article/aina/2014/3629a560/12OmNrAMETN",
"parentPublication": {
"id": "proceedings/aina/2014/3630/0",
"title": "2014 IEEE 28th International Conference on Advanced Information Networking and Applications (AINA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2009/3545/0/3545b203",
"title": "Visible Reverse k-Nearest Neighbor Queries",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2009/3545b203/12OmNvFpEyt",
"parentPublication": {
"id": "proceedings/icde/2009/3545/0",
"title": "2009 IEEE 25th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd/2016/2239/0/07515874",
"title": "Projection search for approximate nearest neighbor",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2016/07515874/12OmNwwd2NU",
"parentPublication": {
"id": "proceedings/snpd/2016/2239/0",
"title": "2016 17th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460749",
"title": "A Pyramid Nearest Neighbor Search Kernel for object categorization",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460749/12OmNyoSbdL",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2001/1143/1/00937551",
"title": "Fast algorithm for nearest neighbor search based on a lower bound tree",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2001/00937551/12OmNznkJZp",
"parentPublication": {
"id": "proceedings/iccv/2001/1143/1",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2008/07/ttk2008070894",
"title": "Ranked Reverse Nearest Neighbor Search",
"doi": null,
"abstractUrl": "/journal/tk/2008/07/ttk2008070894/13rRUwInvyQ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2010/07/ttk2010071041",
"title": "Superseding Nearest Neighbor Search on Uncertain Spatial Databases",
"doi": null,
"abstractUrl": "/journal/tk/2010/07/ttk2010071041/13rRUwbs21f",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2018/02/08081813",
"title": "Reverse Approximate Nearest Neighbor Queries",
"doi": null,
"abstractUrl": "/journal/tk/2018/02/08081813/13rRUwbs21q",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2008/02/ttp2008020243",
"title": "K-Nearest Neighbor Finding Using MaxNearestDist",
"doi": null,
"abstractUrl": "/journal/tp/2008/02/ttp2008020243/13rRUygT7ag",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07784781",
"articleId": "13rRUxZzAi3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07790915",
"articleId": "13rRUxcKzVM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwJPMX5",
"title": "Dec.",
"year": "2011",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwfI0Q9",
"doi": "10.1109/TVCG.2011.223",
"abstract": "We present MoleView, a novel technique for interactive exploration of multivariate relational data. Given a spatial embedding of the data, in terms of a scatter plot or graph layout, we propose a semantic lens which selects a specific spatial and attribute-related data range. The lens keeps the selected data in focus unchanged and continuously deforms the data out of the selection range in order to maintain the context around the focus. Specific deformations include distance-based repulsion of scatter plot points, deforming straight-line node-link graph drawings, and as varying the simplification degree of bundled edge graph layouts. Using a brushing-based technique, we further show the applicability of our semantic lens for scenarios requiring a complex selection of the zones of interest. Our technique is simple to implement and provides real-time performance on large datasets. We demonstrate our technique with actual data from air and road traffic control, medical imaging, and software comprehension applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present MoleView, a novel technique for interactive exploration of multivariate relational data. Given a spatial embedding of the data, in terms of a scatter plot or graph layout, we propose a semantic lens which selects a specific spatial and attribute-related data range. The lens keeps the selected data in focus unchanged and continuously deforms the data out of the selection range in order to maintain the context around the focus. Specific deformations include distance-based repulsion of scatter plot points, deforming straight-line node-link graph drawings, and as varying the simplification degree of bundled edge graph layouts. Using a brushing-based technique, we further show the applicability of our semantic lens for scenarios requiring a complex selection of the zones of interest. Our technique is simple to implement and provides real-time performance on large datasets. We demonstrate our technique with actual data from air and road traffic control, medical imaging, and software comprehension applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present MoleView, a novel technique for interactive exploration of multivariate relational data. Given a spatial embedding of the data, in terms of a scatter plot or graph layout, we propose a semantic lens which selects a specific spatial and attribute-related data range. The lens keeps the selected data in focus unchanged and continuously deforms the data out of the selection range in order to maintain the context around the focus. Specific deformations include distance-based repulsion of scatter plot points, deforming straight-line node-link graph drawings, and as varying the simplification degree of bundled edge graph layouts. Using a brushing-based technique, we further show the applicability of our semantic lens for scenarios requiring a complex selection of the zones of interest. Our technique is simple to implement and provides real-time performance on large datasets. We demonstrate our technique with actual data from air and road traffic control, medical imaging, and software comprehension applications.",
"title": "MoleView: An Attribute and Structure-Based Semantic Lens for Large Element-Based Plots",
"normalizedTitle": "MoleView: An Attribute and Structure-Based Semantic Lens for Large Element-Based Plots",
"fno": "ttg2011122600",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Semantic Lenses",
"Magic Lenses",
"Graph Bundling",
"Attribute Filtering"
],
"authors": [
{
"givenName": "Christophe",
"surname": "Hurter",
"fullName": "Christophe Hurter",
"affiliation": "DSNA, IRIT, Toulouse France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alexandru",
"surname": "Telea",
"fullName": "Alexandru Telea",
"affiliation": "University of Groningen",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ozan",
"surname": "Ersoy",
"fullName": "Ozan Ersoy",
"affiliation": "University of Groningen",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2011-12-01 00:00:00",
"pubType": "trans",
"pages": "2600-2609",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2015/6759/0/07301373",
"title": "Fresnel lens imaging with post-capture image processing",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2015/07301373/12OmNBLdKJ7",
"parentPublication": {
"id": "proceedings/cvprw/2015/6759/0",
"title": "2015 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2015/7143/0/7143a492",
"title": "Finite Element Analysis on Infrared Aspherical Glass Lens Molding Process",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2015/7143a492/12OmNBghtr2",
"parentPublication": {
"id": "proceedings/icmtma/2015/7143/0",
"title": "2015 Seventh International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e-science/2013/5083/0/06683908",
"title": "Lens: A Faceted Browser for Research Networking Platforms",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2013/06683908/12OmNqzu6Pn",
"parentPublication": {
"id": "proceedings/e-science/2013/5083/0",
"title": "2013 IEEE 9th International Conference on eScience (eScience)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2007/1749/0/04538825",
"title": "A 3D Flexible and Tangible Magic Lens in Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2007/04538825/12OmNwNwzHD",
"parentPublication": {
"id": "proceedings/ismar/2007/1749/0",
"title": "2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/date/2006/1/1/01657016",
"title": "Lens Aberration Aware Timing-Driven Placement",
"doi": null,
"abstractUrl": "/proceedings-article/date/2006/01657016/12OmNxZ2Glb",
"parentPublication": {
"id": "proceedings/date/2006/1/1",
"title": "2006 Design, Automation and Test in Europe",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2012/4660/0/06402557",
"title": "A hand-held AR magic lens with user-perspective rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2012/06402557/12OmNz5s0SW",
"parentPublication": {
"id": "proceedings/ismar/2012/4660/0",
"title": "2012 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/06/ttg2011060795",
"title": "Color Lens: Adaptive Color Scale Optimization for Visual Exploration",
"doi": null,
"abstractUrl": "/journal/tg/2011/06/ttg2011060795/13rRUwInuWt",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v0717",
"title": "Enabling Automatic Clutter Reduction in Parallel Coordinate Plots",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v0717/13rRUxly8SO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/06/08667672",
"title": "Relaxing Dense Scatter Plots with Pixel-Based Mappings",
"doi": null,
"abstractUrl": "/journal/tg/2019/06/08667672/18q6mW4N2ZW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a080",
"title": "Enhancing Scatter-plots with Start-plots for Visualising Multi-dimensional Data",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a080/1rSR9e3cPi8",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011122591",
"articleId": "13rRUwInvf4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg201006000xxv",
"articleId": "13rRUILLkDM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRYZ",
"name": "ttg2011122600s1.wmv",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2011122600s1.wmv",
"extension": "wmv",
"size": "59.3 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": "1quudoPtP6U",
"doi": "10.1109/TVCG.2021.3052167",
"abstract": "We present a neural optimization model trained with reinforcement learning to solve the coordinate ordering problem for sets of star glyphs. Given a set of star glyphs associated to multiple class labels, we propose to use shape context descriptors to measure the perceptual distance between pairs of glyphs, and use the derived silhouette coefficient to measure the perception of class separability within the entire set. To find the optimal coordinate order for the given set, we train a neural network using reinforcement learning to reward orderings with high silhouette coefficients. The network consists of an encoder and a decoder with an attention mechanism. The encoder employs a recurrent neural network (RNN) to encode input shape and class information, while the decoder together with the attention mechanism employs another RNN to output a sequence with the new coordinate order. In addition, we introduce a neural network to efficiently estimate the similarity between shape context descriptors, which allows to speed up the computation of silhouette coefficients and thus the training of the axis ordering network. Two user studies demonstrate that the orders provided by our method are preferred by users for perceiving class separation. We tested our model on different settings to show its robustness and generalization abilities and demonstrate that it allows to order input sets with unseen data size, data dimension, or number of classes. We also demonstrate that our model can be adapted to coordinate ordering of other types of plots such as RadViz by replacing the proposed shape-aware silhouette coefficient with the corresponding quality metric to guide network training.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a neural optimization model trained with reinforcement learning to solve the coordinate ordering problem for sets of star glyphs. Given a set of star glyphs associated to multiple class labels, we propose to use shape context descriptors to measure the perceptual distance between pairs of glyphs, and use the derived silhouette coefficient to measure the perception of class separability within the entire set. To find the optimal coordinate order for the given set, we train a neural network using reinforcement learning to reward orderings with high silhouette coefficients. The network consists of an encoder and a decoder with an attention mechanism. The encoder employs a recurrent neural network (RNN) to encode input shape and class information, while the decoder together with the attention mechanism employs another RNN to output a sequence with the new coordinate order. In addition, we introduce a neural network to efficiently estimate the similarity between shape context descriptors, which allows to speed up the computation of silhouette coefficients and thus the training of the axis ordering network. Two user studies demonstrate that the orders provided by our method are preferred by users for perceiving class separation. We tested our model on different settings to show its robustness and generalization abilities and demonstrate that it allows to order input sets with unseen data size, data dimension, or number of classes. We also demonstrate that our model can be adapted to coordinate ordering of other types of plots such as RadViz by replacing the proposed shape-aware silhouette coefficient with the corresponding quality metric to guide network training.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a neural optimization model trained with reinforcement learning to solve the coordinate ordering problem for sets of star glyphs. Given a set of star glyphs associated to multiple class labels, we propose to use shape context descriptors to measure the perceptual distance between pairs of glyphs, and use the derived silhouette coefficient to measure the perception of class separability within the entire set. To find the optimal coordinate order for the given set, we train a neural network using reinforcement learning to reward orderings with high silhouette coefficients. The network consists of an encoder and a decoder with an attention mechanism. The encoder employs a recurrent neural network (RNN) to encode input shape and class information, while the decoder together with the attention mechanism employs another RNN to output a sequence with the new coordinate order. In addition, we introduce a neural network to efficiently estimate the similarity between shape context descriptors, which allows to speed up the computation of silhouette coefficients and thus the training of the axis ordering network. Two user studies demonstrate that the orders provided by our method are preferred by users for perceiving class separation. We tested our model on different settings to show its robustness and generalization abilities and demonstrate that it allows to order input sets with unseen data size, data dimension, or number of classes. We also demonstrate that our model can be adapted to coordinate ordering of other types of plots such as RadViz by replacing the proposed shape-aware silhouette coefficient with the corresponding quality metric to guide network training.",
"title": "Shape-Driven Coordinate Ordering for Star Glyph Sets via Reinforcement Learning",
"normalizedTitle": "Shape-Driven Coordinate Ordering for Star Glyph Sets via Reinforcement Learning",
"fno": "09328215",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Learning Artificial Intelligence",
"Neural Nets",
"Recurrent Neural Nets",
"Derived Silhouette Coefficient",
"Class Separability",
"Reinforcement Learning",
"High Silhouette Coefficients",
"Encoder",
"Decoder",
"Attention Mechanism",
"Recurrent Neural Network",
"Input Shape",
"Class Information",
"Coordinate Order",
"Shape Context Descriptors",
"Axis Ordering Network",
"Class Separation",
"Order Input Sets",
"Shape Aware Silhouette Coefficient",
"Network Training",
"Shape Driven Coordinate Ordering",
"Star Glyph Sets",
"Neural Optimization Model",
"Coordinate Ordering Problem",
"Star Glyphs",
"Multiple Class Labels",
"Perceptual Distance",
"Shape",
"Shape Measurement",
"Task Analysis",
"Coordinate Measuring Machines",
"Reinforcement Learning",
"Recurrent Neural Networks",
"Optimization",
"Star Glyph Set",
"Coordinate Ordering",
"Reinforcement Learning",
"Shape Context"
],
"authors": [
{
"givenName": "Ruizhen",
"surname": "Hu",
"fullName": "Ruizhen Hu",
"affiliation": "College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bin",
"surname": "Chen",
"fullName": "Bin Chen",
"affiliation": "College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Juzhan",
"surname": "Xu",
"fullName": "Juzhan Xu",
"affiliation": "College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Oliver",
"surname": "van Kaick",
"fullName": "Oliver van Kaick",
"affiliation": "School of Computer Science, Carleton University, Ottawa, ON, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Oliver",
"surname": "Deussen",
"fullName": "Oliver Deussen",
"affiliation": "Department of Computer and Information Science, University of Konstanz, Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hui",
"surname": "Huang",
"fullName": "Hui Huang",
"affiliation": "College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": {
"isEnabled": true,
"codeDownloadUrl": "https://github.com/Bachery/Shape-driven-Coordinate-Ordering.git",
"codeRepositoryUrl": "https://github.com/Bachery/Shape-driven-Coordinate-Ordering",
"__typename": "ArticleReplicabilityType"
},
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2021-06-01 00:00:00",
"pubType": "trans",
"pages": "3034-3047",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iscid/2009/3865/1/3865a483",
"title": "A Coordinate-Based Quantitative Directional Relations Model",
"doi": null,
"abstractUrl": "/proceedings-article/iscid/2009/3865a483/12OmNAS9zp8",
"parentPublication": {
"id": "proceedings/iscid/2009/3865/1",
"title": "Computational Intelligence and Design, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2011/289/1/05750709",
"title": "Research on the Coordinate Transformation Methods between National System and Local Independent System",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2011/05750709/12OmNAY79j2",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/netsys/2013/5645/0/06529238",
"title": "Bounds for the Security of the Vivaldi Network Coordinate System",
"doi": null,
"abstractUrl": "/proceedings-article/netsys/2013/06529238/12OmNAm4TFX",
"parentPublication": {
"id": "proceedings/netsys/2013/5645/0",
"title": "2013 Conference on Networked Systems (NetSys)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcoss/2016/1460/0/1460a052",
"title": "Greedy Routing on Virtual Raw Anchor Coordinate (VRAC) System",
"doi": null,
"abstractUrl": "/proceedings-article/dcoss/2016/1460a052/12OmNweTvLt",
"parentPublication": {
"id": "proceedings/dcoss/2016/1460/0",
"title": "2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2009/3583/2/3583b128",
"title": "Structural Parameter Identification for Articulated Arm Coordinate Measuring Machines",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2009/3583b128/12OmNzxPTGQ",
"parentPublication": {
"id": "proceedings/icmtma/2009/3583/2",
"title": "2009 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539643",
"title": "GlyphLens: View-Dependent Occlusion Management in the Interactive Glyph Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539643/13rRUwInvJk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875973",
"title": "The Influence of Contour on Similarity Perception of Star Glyphs",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875973/13rRUwhHcQV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/06/v1363",
"title": "High-Dimensional Visual Analytics: Interactive Exploration Guided by Pairwise Views of Point Distributions",
"doi": null,
"abstractUrl": "/journal/tg/2006/06/v1363/13rRUx0xPIs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v0717",
"title": "Enabling Automatic Clutter Reduction in Parallel Coordinate Plots",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v0717/13rRUxly8SO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933656",
"title": "Evaluating Ordering Strategies of Star Glyph Axes",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933656/1fTgJ3IVtjq",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08924770",
"articleId": "1fvZlX1pNU4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08939459",
"articleId": "1fZRynxLXGM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNviZlCx",
"title": "Oct.",
"year": "1998",
"issueNum": "05",
"idPrefix": "nt",
"pubType": "journal",
"volume": "6",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIJuxuj",
"doi": "10.1109/90.731185",
"abstract": "This paper examines the network interdomain routing information exchanged between backbone service providers at the major US public Internet exchange points. Internet routing instability, or the rapid fluctuation of network reachability information, is an important problem currently facing the Internet engineering community. High levels of network instability can lead to packet loss, increased network latency and time to convergence. At the extreme, high levels of routing instability have led to the loss of internal connectivity in wide-area, national networks. We describe several unexpected trends in routing instability, and examine a number of anomalies and pathologies observed in the exchange of inter-domain routing information. The analysis in this paper is based on data collected from border gateway protocol (BGP) routing messages generated by border routers at five of the Internet core's public exchange points during a nine month period. We show that the volume of these routing updates is several orders of magnitude more than expected and that the majority of this routing information is redundant, or pathological. Furthermore, our analysis reveals several unexpected trends and ill-behaved systematic properties in Internet routing. We finally posit a number of explanations for these anomalies and evaluate their potential impact on the Internet infrastructure.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper examines the network interdomain routing information exchanged between backbone service providers at the major US public Internet exchange points. Internet routing instability, or the rapid fluctuation of network reachability information, is an important problem currently facing the Internet engineering community. High levels of network instability can lead to packet loss, increased network latency and time to convergence. At the extreme, high levels of routing instability have led to the loss of internal connectivity in wide-area, national networks. We describe several unexpected trends in routing instability, and examine a number of anomalies and pathologies observed in the exchange of inter-domain routing information. The analysis in this paper is based on data collected from border gateway protocol (BGP) routing messages generated by border routers at five of the Internet core's public exchange points during a nine month period. We show that the volume of these routing updates is several orders of magnitude more than expected and that the majority of this routing information is redundant, or pathological. Furthermore, our analysis reveals several unexpected trends and ill-behaved systematic properties in Internet routing. We finally posit a number of explanations for these anomalies and evaluate their potential impact on the Internet infrastructure.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper examines the network interdomain routing information exchanged between backbone service providers at the major US public Internet exchange points. Internet routing instability, or the rapid fluctuation of network reachability information, is an important problem currently facing the Internet engineering community. High levels of network instability can lead to packet loss, increased network latency and time to convergence. At the extreme, high levels of routing instability have led to the loss of internal connectivity in wide-area, national networks. We describe several unexpected trends in routing instability, and examine a number of anomalies and pathologies observed in the exchange of inter-domain routing information. The analysis in this paper is based on data collected from border gateway protocol (BGP) routing messages generated by border routers at five of the Internet core's public exchange points during a nine month period. We show that the volume of these routing updates is several orders of magnitude more than expected and that the majority of this routing information is redundant, or pathological. Furthermore, our analysis reveals several unexpected trends and ill-behaved systematic properties in Internet routing. We finally posit a number of explanations for these anomalies and evaluate their potential impact on the Internet infrastructure.",
"title": "Internet routing instability",
"normalizedTitle": "Internet routing instability",
"fno": "00731185",
"hasPdf": true,
"idPrefix": "nt",
"keywords": [
"Internet",
"Telecommunication Network Routing",
"Stability",
"Packet Switching",
"Transport Protocols",
"Internet Routing Instability",
"Network Interdomain Routing Information",
"Backbone Service Providers",
"USA",
"Network Reachability Information",
"Packet Loss",
"Network Latency",
"Wide Area National Networks",
"Inter Domain Routing",
"BGP Routing Messages",
"Ill Behaved Systematic Properties",
"Internet Infrastructure",
"Pathological Routing",
"TCP",
"Border Gateway Protocol",
"Routing",
"IP Networks",
"Spine",
"Web And Internet Services",
"Convergence",
"Pathology",
"Degradation",
"Fluctuations",
"Delay",
"Computer Networks"
],
"authors": [
{
"givenName": "C.",
"surname": "Labovitz",
"fullName": "C. Labovitz",
"affiliation": "Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "G.R.",
"surname": "Malan",
"fullName": "G.R. Malan",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "F.",
"surname": "Jahanian",
"fullName": "F. Jahanian",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "1998-09-01 00:00:00",
"pubType": "trans",
"pages": "515-528",
"year": "1998",
"issn": "1063-6692",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "00731182",
"articleId": "13rRUxlgxWx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00731187",
"articleId": "13rRUxYrbRx",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxwENDN",
"title": "May/June",
"year": "2007",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "May/June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyY28Ym",
"doi": "10.1109/TVCG.2007.1000",
"abstract": "Abstract—In radial drawings of hierarchical graphs, the vertices are placed on concentric circles rather than on horizontal lines and the edges are drawn as outward monotone segments of spirals rather than straight lines as it is done in the standard Sugiyama framework. This drawing style is well suited for the visualization of centrality in social networks and similar concepts. Radial drawings also allow a more flexible edge routing than horizontal drawings, as edges can be routed around the center in two directions. In experimental results, this reduces the number of crossings by approximately 30 percent on average. Few crossings are one of the major criteria for human readability. This paper is a detailed description of a complete framework for visualizing hierarchical information in a new radial fashion. Particularly, we briefly cover extensions of the level assignment step to benefit from the increasing perimeters of the circles, present three heuristics for crossing reduction in radial level drawings, and also show how to visualize the results.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—In radial drawings of hierarchical graphs, the vertices are placed on concentric circles rather than on horizontal lines and the edges are drawn as outward monotone segments of spirals rather than straight lines as it is done in the standard Sugiyama framework. This drawing style is well suited for the visualization of centrality in social networks and similar concepts. Radial drawings also allow a more flexible edge routing than horizontal drawings, as edges can be routed around the center in two directions. In experimental results, this reduces the number of crossings by approximately 30 percent on average. Few crossings are one of the major criteria for human readability. This paper is a detailed description of a complete framework for visualizing hierarchical information in a new radial fashion. Particularly, we briefly cover extensions of the level assignment step to benefit from the increasing perimeters of the circles, present three heuristics for crossing reduction in radial level drawings, and also show how to visualize the results.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—In radial drawings of hierarchical graphs, the vertices are placed on concentric circles rather than on horizontal lines and the edges are drawn as outward monotone segments of spirals rather than straight lines as it is done in the standard Sugiyama framework. This drawing style is well suited for the visualization of centrality in social networks and similar concepts. Radial drawings also allow a more flexible edge routing than horizontal drawings, as edges can be routed around the center in two directions. In experimental results, this reduces the number of crossings by approximately 30 percent on average. Few crossings are one of the major criteria for human readability. This paper is a detailed description of a complete framework for visualizing hierarchical information in a new radial fashion. Particularly, we briefly cover extensions of the level assignment step to benefit from the increasing perimeters of the circles, present three heuristics for crossing reduction in radial level drawings, and also show how to visualize the results.",
"title": "A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information",
"normalizedTitle": "A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information",
"fno": "v0583",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Graph Theory",
"Computational Geometry",
"Data Visualisation",
"Hierarchical Graph Radial Drawings",
"Sugiyama Framework",
"Hierarchical Information Visualization",
"Spirals",
"Social Network Services",
"Data Visualization",
"Tree Graphs",
"Routing",
"Humans",
"Web Pages",
"Spiral Segments",
"Graph Drawing",
"Radial",
"Crossing Reduction",
"Sugiyama Framework"
],
"authors": [
{
"givenName": "Christian",
"surname": "Bachmaier",
"fullName": "Christian Bachmaier",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2007-05-01 00:00:00",
"pubType": "trans",
"pages": "583-594",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2012/4771/0/4771a074",
"title": "Angular Treemaps - A New Technique for Visualizing and Emphasizing Hierarchical Structures",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2012/4771a074/12OmNqFJhII",
"parentPublication": {
"id": "proceedings/iv/2012/4771/0",
"title": "2012 16th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2007/2900/0/29000232",
"title": "Visualizing Web Navigation Data with Polygon Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2007/29000232/12OmNvDZEV1",
"parentPublication": {
"id": "proceedings/iv/2007/2900/0",
"title": "2007 11th International Conference Information Visualization (IV '07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl/1993/3970/0/00269552",
"title": "A framework for visualizing data structures",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1993/00269552/12OmNvF83o0",
"parentPublication": {
"id": "proceedings/vl/1993/3970/0",
"title": "Proceedings 1993 IEEE Symposium on Visual Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl/1993/3970/0/00269619",
"title": "Constraint-driven diagram layout",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1993/00269619/12OmNwvVrCN",
"parentPublication": {
"id": "proceedings/vl/1993/3970/0",
"title": "Proceedings 1993 IEEE Symposium on Visual Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2008/1966/0/04475471",
"title": "FanLens: A Visual Toolkit for Dynamically Exploring the Distribution of Hierarchical Attributes",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2008/04475471/12OmNxETapG",
"parentPublication": {
"id": "proceedings/pacificvis/2008/1966/0",
"title": "IEEE Pacific Visualization Symposium 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/tai/1989/1984/0/00065312",
"title": "Multisearch systems with hierarchical control: a tool for solving complex AI problems",
"doi": null,
"abstractUrl": "/proceedings-article/tai/1989/00065312/12OmNxwncuD",
"parentPublication": {
"id": "proceedings/tai/1989/1984/0",
"title": "IEEE International Workshop on Tools for Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2002/1573/0/01016635",
"title": "Graph visualization of web data with domain-specific attributes",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2002/01016635/12OmNyQpgUo",
"parentPublication": {
"id": "proceedings/ipdps/2002/1573/1",
"title": "Parallel and Distributed Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wvl/1992/3090/0/00275746",
"title": "Blush and Zebrackets: large- and small-scale typographical representation of nested associativity",
"doi": null,
"abstractUrl": "/proceedings-article/wvl/1992/00275746/12OmNzlD9Ct",
"parentPublication": {
"id": "proceedings/wvl/1992/3090/0",
"title": "Proceedings IEEE Workshop on Visual Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0569",
"articleId": "13rRUwIF6dF",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0595",
"articleId": "13rRUwInv4f",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1Lk2nmMLR6M",
"title": "April",
"year": "2023",
"issueNum": "04",
"idPrefix": "tp",
"pubType": "journal",
"volume": "45",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1F8uMKfV5Di",
"doi": "10.1109/TPAMI.2022.3192418",
"abstract": "Goal-conditioned Hierarchical Reinforcement Learning (HRL) is a promising approach for scaling up reinforcement learning (RL) techniques. However, it often suffers from training inefficiency as the action space of the high-level, i.e., the goal space, is large. Searching in a large goal space poses difficulty for both high-level subgoal generation and low-level policy learning. In this article, we show that this problem can be effectively alleviated by restricting the high-level action space from the whole goal space to a <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-step adjacent region of the current state using an adjacency constraint. We theoretically prove that in a deterministic Markov Decision Process (MDP), the proposed adjacency constraint preserves the optimal hierarchical policy, while in a stochastic MDP the adjacency constraint induces a bounded state-value suboptimality determined by the MDP's transition structure. We further show that this constraint can be practically implemented by training an adjacency network that can discriminate between adjacent and non-adjacent subgoals. Experimental results on discrete and continuous control tasks including challenging simulated robot locomotion and manipulation tasks show that incorporating the adjacency constraint significantly boosts the performance of state-of-the-art goal-conditioned HRL approaches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Goal-conditioned Hierarchical Reinforcement Learning (HRL) is a promising approach for scaling up reinforcement learning (RL) techniques. However, it often suffers from training inefficiency as the action space of the high-level, i.e., the goal space, is large. Searching in a large goal space poses difficulty for both high-level subgoal generation and low-level policy learning. In this article, we show that this problem can be effectively alleviated by restricting the high-level action space from the whole goal space to a <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"zhang-ieq1-3192418.gif\"/></alternatives></inline-formula>-step adjacent region of the current state using an adjacency constraint. We theoretically prove that in a deterministic Markov Decision Process (MDP), the proposed adjacency constraint preserves the optimal hierarchical policy, while in a stochastic MDP the adjacency constraint induces a bounded state-value suboptimality determined by the MDP's transition structure. We further show that this constraint can be practically implemented by training an adjacency network that can discriminate between adjacent and non-adjacent subgoals. Experimental results on discrete and continuous control tasks including challenging simulated robot locomotion and manipulation tasks show that incorporating the adjacency constraint significantly boosts the performance of state-of-the-art goal-conditioned HRL approaches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Goal-conditioned Hierarchical Reinforcement Learning (HRL) is a promising approach for scaling up reinforcement learning (RL) techniques. However, it often suffers from training inefficiency as the action space of the high-level, i.e., the goal space, is large. Searching in a large goal space poses difficulty for both high-level subgoal generation and low-level policy learning. In this article, we show that this problem can be effectively alleviated by restricting the high-level action space from the whole goal space to a --step adjacent region of the current state using an adjacency constraint. We theoretically prove that in a deterministic Markov Decision Process (MDP), the proposed adjacency constraint preserves the optimal hierarchical policy, while in a stochastic MDP the adjacency constraint induces a bounded state-value suboptimality determined by the MDP's transition structure. We further show that this constraint can be practically implemented by training an adjacency network that can discriminate between adjacent and non-adjacent subgoals. Experimental results on discrete and continuous control tasks including challenging simulated robot locomotion and manipulation tasks show that incorporating the adjacency constraint significantly boosts the performance of state-of-the-art goal-conditioned HRL approaches.",
"title": "Adjacency Constraint for Efficient Hierarchical Reinforcement Learning",
"normalizedTitle": "Adjacency Constraint for Efficient Hierarchical Reinforcement Learning",
"fno": "09833270",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Learning Artificial Intelligence",
"Manipulators",
"Markov Processes",
"Mobile Robots",
"Reinforcement Learning",
"Adjacency Constraint",
"Adjacency Network",
"Efficient Hierarchical Reinforcement Learning",
"Goal Space",
"Goal Conditioned Hierarchical Reinforcement Learning",
"High Level Action Space",
"High Level Subgoal Generation",
"Low Level Policy Learning",
"Nonadjacent Subgoals",
"Optimal Hierarchical Policy",
"Reinforcement Learning Techniques",
"State Of The Art Goal Conditioned HRL Approaches",
"Step Adjacent Region",
"Task Analysis",
"Reinforcement Learning",
"Training",
"Random Variables",
"Postal Services",
"Markov Processes",
"Games",
"Hierarchical Reinforcement Learning HRL",
"Reinforcement Learning RL",
"Goal Conditioning",
"Subgoal Generation",
"Adjacency Constraint"
],
"authors": [
{
"givenName": "Tianren",
"surname": "Zhang",
"fullName": "Tianren Zhang",
"affiliation": "Department of Automation, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shangqi",
"surname": "Guo",
"fullName": "Shangqi Guo",
"affiliation": "Department of Automation, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tian",
"surname": "Tan",
"fullName": "Tian Tan",
"affiliation": "Department of Civil and Environmental Engineering, Stanford University, Stanford, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaolin",
"surname": "Hu",
"fullName": "Xiaolin Hu",
"affiliation": "Department of Computer Science and Technology, Institute for Artificial Intelligence, Beijing National Research Center for Information Science and Technology, State Key Laboratory of Intelligent Technology and Systems, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Feng",
"surname": "Chen",
"fullName": "Feng Chen",
"affiliation": "Department of Automation, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "4152-4166",
"year": "2023",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/aamas/2004/2092/3/20921114",
"title": "Learning to Communicate and Act Using Hierarchical Reinforcement Learning",
"doi": null,
"abstractUrl": "/proceedings-article/aamas/2004/20921114/12OmNClQ0ux",
"parentPublication": {
"id": "proceedings/aamas/2004/2092/3",
"title": "Autonomous Agents and Multiagent Systems, International Joint Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icws/2016/2675/0/2675a057",
"title": "Automatic Hierarchical Reinforcement Learning for Efficient Large-Scale Service Composition",
"doi": null,
"abstractUrl": "/proceedings-article/icws/2016/2675a057/12OmNwO5LYr",
"parentPublication": {
"id": "proceedings/icws/2016/2675/0",
"title": "2016 IEEE International Conference on Web Services (ICWS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvlsid/2016/9039/0/9039a595",
"title": "Soft-Error Tolerant Datapath Synthesis Considering Adjacency Constraint between Components",
"doi": null,
"abstractUrl": "/proceedings-article/isvlsid/2016/9039a595/12OmNxxNbRV",
"parentPublication": {
"id": "proceedings/isvlsid/2016/9039/0",
"title": "2016 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csie/2009/3507/4/3507d687",
"title": "Research and Application of Reinforcement Learning Based on Constraint MDP in Coal Mine",
"doi": null,
"abstractUrl": "/proceedings-article/csie/2009/3507d687/12OmNz61dj9",
"parentPublication": {
"id": "proceedings/csie/2009/3507/4",
"title": "Computer Science and Information Engineering, World Congress on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2020/05/07979546",
"title": "A Reinforcement Learning Method for Constraint-Satisfied Services Composition",
"doi": null,
"abstractUrl": "/journal/sc/2020/05/07979546/13rRUytnsUi",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2022/8563/0/09859878",
"title": "Searching Latent Sub-Goals in Hierarchical Reinforcement Learning as Riemannian Manifold Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2022/09859878/1G9EqL5o4bm",
"parentPublication": {
"id": "proceedings/icme/2022/8563/0",
"title": "2022 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2020/6251/0/09377951",
"title": "State Action Separable Reinforcement Learning",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09377951/1s650UEUYEw",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisce/2020/6406/0/640600a405",
"title": "Context-based Fine Hierarchical Object Detection with Deep Reinforcement Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2020/640600a405/1x3l3LOijAc",
"parentPublication": {
"id": "proceedings/icisce/2020/6406/0",
"title": "2020 7th International Conference on Information Science and Control Engineering (ICISCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/2021/4513/0/451300a326",
"title": "An Efficient Message Dissemination Scheme for Cooperative Drivings via Multi-Agent Hierarchical Attention Reinforcement Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2021/451300a326/1xqz3Uiky2Y",
"parentPublication": {
"id": "proceedings/icdcs/2021/4513/0",
"title": "2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2021/3574/0/357400b027",
"title": "Deep reinforcement learning for partial offloading with reliability guarantees",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-bdcloud-socialcom-sustaincom/2021/357400b027/1zxKYkReH3W",
"parentPublication": {
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2021/3574/0",
"title": "2021 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09826380",
"articleId": "1EVdzKEc4OQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09826427",
"articleId": "1EVdAacWA12",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Lk2wZ3tmFi",
"name": "ttp202304-09833270s1-supp1-3192418.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp202304-09833270s1-supp1-3192418.pdf",
"extension": "pdf",
"size": "343 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvStcCF",
"title": "April",
"year": "2018",
"issueNum": "02",
"idPrefix": "nt",
"pubType": "journal",
"volume": "26",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxDItel",
"doi": "10.1109/TNET.2018.2811374",
"abstract": "This paper studies two design tasks faced by a geo-distributed cloud data market: which data to purchase (data purchasing) and where to place/replicate the data for delivery (data placement). We show that the joint problem of data purchasing and data placement within a cloud data market can be viewed as a facility location problem and is thus NP-hard. However, we give a provably optimal algorithm for the case of a data market made up of a single data center and then generalize the structure from the single data center setting in order to develop a near-optimal, polynomial-time algorithm for a geo-distributed data market. The resulting design, Z_$\\mathsf {Datum}$_Z , decomposes the joint purchasing and placement problem into two subproblems, one for data purchasing and one for data placement, using a transformation of the underlying bandwidth costs. We show, via a case study, that Z_$\\mathsf {Datum}$_Z is near optimal (within 1.6%) in practical settings.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper studies two design tasks faced by a geo-distributed cloud data market: which data to purchase (data purchasing) and where to place/replicate the data for delivery (data placement). We show that the joint problem of data purchasing and data placement within a cloud data market can be viewed as a facility location problem and is thus NP-hard. However, we give a provably optimal algorithm for the case of a data market made up of a single data center and then generalize the structure from the single data center setting in order to develop a near-optimal, polynomial-time algorithm for a geo-distributed data market. The resulting design, $\\mathsf {Datum}$ , decomposes the joint purchasing and placement problem into two subproblems, one for data purchasing and one for data placement, using a transformation of the underlying bandwidth costs. We show, via a case study, that $\\mathsf {Datum}$ is near optimal (within 1.6%) in practical settings.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper studies two design tasks faced by a geo-distributed cloud data market: which data to purchase (data purchasing) and where to place/replicate the data for delivery (data placement). We show that the joint problem of data purchasing and data placement within a cloud data market can be viewed as a facility location problem and is thus NP-hard. However, we give a provably optimal algorithm for the case of a data market made up of a single data center and then generalize the structure from the single data center setting in order to develop a near-optimal, polynomial-time algorithm for a geo-distributed data market. The resulting design, - , decomposes the joint purchasing and placement problem into two subproblems, one for data purchasing and one for data placement, using a transformation of the underlying bandwidth costs. We show, via a case study, that - is near optimal (within 1.6%) in practical settings.",
"title": "Datum: Managing Data Purchasing and Data Placement in a Geo-Distributed Data Market",
"normalizedTitle": "Datum: Managing Data Purchasing and Data Placement in a Geo-Distributed Data Market",
"fno": "08319923",
"hasPdf": true,
"idPrefix": "nt",
"keywords": [
"Distributed Databases",
"Task Analysis",
"Data Centers",
"Pricing",
"Bandwidth",
"Cloud Computing",
"Data Analysis",
"Data Market",
"Geo Distributed Analytics"
],
"authors": [
{
"givenName": "Xiaoqi",
"surname": "Ren",
"fullName": "Xiaoqi Ren",
"affiliation": "Department of Computing and Mathematical Sciences, California Institute of Technology, Pasadena, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Palma",
"surname": "London",
"fullName": "Palma London",
"affiliation": "Department of Computing and Mathematical Sciences, California Institute of Technology, Pasadena, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Juba",
"surname": "Ziani",
"fullName": "Juba Ziani",
"affiliation": "Department of Computing and Mathematical Sciences, California Institute of Technology, Pasadena, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Adam",
"surname": "Wierman",
"fullName": "Adam Wierman",
"affiliation": "Department of Computing and Mathematical Sciences, California Institute of Technology, Pasadena, CA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2018-03-01 00:00:00",
"pubType": "trans",
"pages": "893-905",
"year": "2018",
"issn": "1063-6692",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isise/2009/6325/0/05447203",
"title": "Risk Decision-Making for Purchasing Electricity in Multi-market on the Basis of Variance",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2009/05447203/12OmNAYGlF2",
"parentPublication": {
"id": "proceedings/isise/2009/6325/0",
"title": "2009 Second International Symposium on Information Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ecbi/2009/3661/0/3661a353",
"title": "Private Placement Stock Pricing in Chinese Stock Market",
"doi": null,
"abstractUrl": "/proceedings-article/ecbi/2009/3661a353/12OmNBOCWzN",
"parentPublication": {
"id": "proceedings/ecbi/2009/3661/0",
"title": "Electronic Commerce and Business Intelligence, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acsat/2013/2758/0/2758a120",
"title": "Discovering Purchasing Pattern of Sport Items Using Market Basket Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/acsat/2013/2758a120/12OmNwF0BTC",
"parentPublication": {
"id": "proceedings/acsat/2013/2758/0",
"title": "2013 International Conference on Advanced Computer Science Applications and Technologies (ACSAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2008/3305/4/3305d621",
"title": "Return Forecasting and Risk Analysis of Purchasing New Issues in Chinese Primary Market Based on Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2008/3305d621/12OmNwvVrKo",
"parentPublication": {
"id": "proceedings/fskd/2008/3305/4",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2011/9618/0/05718939",
"title": "Unexpected Motivations behind Joining Group Purchasing Organization (GPO)",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2011/05718939/12OmNxWLTmF",
"parentPublication": {
"id": "proceedings/hicss/2011/9618/0",
"title": "2011 44th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cd/2016/01/mcd2016010024",
"title": "Price Elasticity in the Enterprise Computing Resource Market",
"doi": null,
"abstractUrl": "/magazine/cd/2016/01/mcd2016010024/13rRUy3gn2o",
"parentPublication": {
"id": "mags/cd",
"title": "IEEE Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbfd/2021/1227/0/122700a499",
"title": "Currency Market Portfolio Constructions Based on Purchasing Power Parity Strategy and Refinement",
"doi": null,
"abstractUrl": "/proceedings-article/cbfd/2021/122700a499/1CJfH5QSlmE",
"parentPublication": {
"id": "proceedings/cbfd/2021/1227/0",
"title": "2021 International Conference on Computer, Blockchain and Financial Development (CBFD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2020/02/08805417",
"title": "Wiera: Policy-Driven Multi-Tiered Geo-Distributed Cloud Storage System",
"doi": null,
"abstractUrl": "/journal/td/2020/02/08805417/1cG4NgXnQkw",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/igsc/2019/5416/0/08957179",
"title": "Green Computing with Geo-Distributed Heterogeneous Data Centers",
"doi": null,
"abstractUrl": "/proceedings-article/igsc/2019/08957179/1gAudqD1bPi",
"parentPublication": {
"id": "proceedings/igsc/2019/5416/0",
"title": "2019 Tenth International Green and Sustainable Computing Conference (IGSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ic2e/2020/1099/0/09096448",
"title": "Hedge Your Bets: Optimizing Long-term Cloud Costs by Mixing VM Purchasing Options",
"doi": null,
"abstractUrl": "/proceedings-article/ic2e/2020/09096448/1jXvsr6afvi",
"parentPublication": {
"id": "proceedings/ic2e/2020/1099/0",
"title": "2020 IEEE International Conference on Cloud Engineering (IC2E)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08320958",
"articleId": "13rRUILc8cF",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08314544",
"articleId": "13rRUwbs2dQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRGN",
"name": "tnt201802-08319923s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/tnt201802-08319923s1.zip",
"extension": "zip",
"size": "237 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyeWdDf",
"title": "July-Aug.",
"year": "2016",
"issueNum": "04",
"idPrefix": "it",
"pubType": "magazine",
"volume": "18",
"label": "July-Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxlgxVO",
"doi": "10.1109/MITP.2016.64",
"abstract": "The authors' approach to intelligent marketing in smart cities uses large-scale crowdsourcing based on mobile user behavior for market planning. Unlike most work, which focuses on the client side, the proposed method is intended for market planning from a marketer perspective. The proposed system tracks and examines user trails via mobile devices. To support distributed analysis for big data, computer clusters project user trajectories onto blocks in a layout map of an actual geo-location. The trajectory falling into a block is independently handled by a distributed computer that detects crowd flows. Because traffic flows are highly relevant to geo-conquesting marketing, two methods are proposed: local longest common subsequence-based (LLCS-based) clustering, and the computation of transition flows and heat maps. Both help marketers analyze crowd flows for geo-conquesting. Simulation of the proposed methods revealed that the system facilitated computation of large-scale crowdsourced data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The authors' approach to intelligent marketing in smart cities uses large-scale crowdsourcing based on mobile user behavior for market planning. Unlike most work, which focuses on the client side, the proposed method is intended for market planning from a marketer perspective. The proposed system tracks and examines user trails via mobile devices. To support distributed analysis for big data, computer clusters project user trajectories onto blocks in a layout map of an actual geo-location. The trajectory falling into a block is independently handled by a distributed computer that detects crowd flows. Because traffic flows are highly relevant to geo-conquesting marketing, two methods are proposed: local longest common subsequence-based (LLCS-based) clustering, and the computation of transition flows and heat maps. Both help marketers analyze crowd flows for geo-conquesting. Simulation of the proposed methods revealed that the system facilitated computation of large-scale crowdsourced data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The authors' approach to intelligent marketing in smart cities uses large-scale crowdsourcing based on mobile user behavior for market planning. Unlike most work, which focuses on the client side, the proposed method is intended for market planning from a marketer perspective. The proposed system tracks and examines user trails via mobile devices. To support distributed analysis for big data, computer clusters project user trajectories onto blocks in a layout map of an actual geo-location. The trajectory falling into a block is independently handled by a distributed computer that detects crowd flows. Because traffic flows are highly relevant to geo-conquesting marketing, two methods are proposed: local longest common subsequence-based (LLCS-based) clustering, and the computation of transition flows and heat maps. Both help marketers analyze crowd flows for geo-conquesting. Simulation of the proposed methods revealed that the system facilitated computation of large-scale crowdsourced data.",
"title": "Intelligent Marketing in Smart Cities: Crowdsourced Data for Geo-Conquesting",
"normalizedTitle": "Intelligent Marketing in Smart Cities: Crowdsourced Data for Geo-Conquesting",
"fno": "mit2016040018",
"hasPdf": true,
"idPrefix": "it",
"keywords": [
"Trajectory",
"Smart Cities",
"Mobile Communication",
"Advertising",
"Computational Modeling",
"Crowdsourcing",
"Mathematical Model",
"Marketing And Sales",
"Distributed Processing",
"Pervasive Computing",
"Crowdsourcing",
"Crowd Flow",
"Transition Flow",
"Trails",
"Distributed Analysis",
"Computational Advertising",
"Geo Conquesting",
"Distributed Systems",
"Mobile"
],
"authors": [
{
"givenName": "Bo-Wei",
"surname": "Chen",
"fullName": "Bo-Wei Chen",
"affiliation": "Monash University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wen",
"surname": "Ji",
"fullName": "Wen Ji",
"affiliation": "Chinese Academy of Sciences",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2016-07-01 00:00:00",
"pubType": "mags",
"pages": "18-24",
"year": "2016",
"issn": "1520-9202",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icsssm/2005/8971/1/01499456",
"title": "Reciprocity factors in relationship marketing",
"doi": null,
"abstractUrl": "/proceedings-article/icsssm/2005/01499456/12OmNAgGwi3",
"parentPublication": {
"id": "proceedings/icsssm/2005/8971/1",
"title": "2005 International Conference on Services Systems and Services Management",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2009/3450/0/07-04-06",
"title": "Discovering Influential Nodes for Viral Marketing",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2009/07-04-06/12OmNqBKTPB",
"parentPublication": {
"id": "proceedings/hicss/2009/3450/0",
"title": "2009 42nd Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icebe/2007/3003/0/30030513",
"title": "The Design and Implementation of A Search Engine Marketing Management System (SEMMS) Based on Service-Oriented Architecture Platform",
"doi": null,
"abstractUrl": "/proceedings-article/icebe/2007/30030513/12OmNrFBQ5e",
"parentPublication": {
"id": "proceedings/icebe/2007/3003/0",
"title": "IEEE International Conference on e-Business Engineering (ICEBE'07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/agile/2012/4804/0/4804a136",
"title": "Can Marketing Go Agile?",
"doi": null,
"abstractUrl": "/proceedings-article/agile/2012/4804a136/12OmNxveNPK",
"parentPublication": {
"id": "proceedings/agile/2012/4804/0",
"title": "2012 Agile Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2012/4789/0/4789a408",
"title": "Core Group Marketing Strategy in Web Viral Marketing",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2012/4789a408/12OmNzd7bgY",
"parentPublication": {
"id": "proceedings/iccis/2012/4789/0",
"title": "2012 Fourth International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/niss/2009/3687/0/3687a983",
"title": "Some Strategies of Marketing Academic Library to College Students",
"doi": null,
"abstractUrl": "/proceedings-article/niss/2009/3687a983/12OmNzgwmQ8",
"parentPublication": {
"id": "proceedings/niss/2009/3687/0",
"title": "2009 International Conference on New Trends in Information and Service Science (NISS 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmecg/2010/8507/0/05628652",
"title": "The Game Research between a Direct Internet Marketer and N Retailers in Hybrid Marketing",
"doi": null,
"abstractUrl": "/proceedings-article/icmecg/2010/05628652/12OmNzn38RA",
"parentPublication": {
"id": "proceedings/icmecg/2010/8507/0",
"title": "2010 Fourth International Conference on Management of E-Commerce and E-Government (ICMeCG 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/it/2010/03/mit2010030008",
"title": "Marketing Smart",
"doi": null,
"abstractUrl": "/magazine/it/2010/03/mit2010030008/13rRUxBa52F",
"parentPublication": {
"id": "mags/it",
"title": "IT Professional",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/an/2013/04/man2013040056",
"title": "Computer Dealer Demos: Selling Home Computers with Bouncing Balls and Animated Logos",
"doi": null,
"abstractUrl": "/magazine/an/2013/04/man2013040056/13rRUyoyhFF",
"parentPublication": {
"id": "mags/an",
"title": "IEEE Annals of the History of Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmb/2006/2595/0/04124098",
"title": "How do consumers react to mobile marketing?",
"doi": null,
"abstractUrl": "/proceedings-article/icmb/2006/04124098/17D45WYQJ77",
"parentPublication": {
"id": "proceedings/icmb/2006/2595/0",
"title": "Mobile Business, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mit2016040014",
"articleId": "13rRUx0geke",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mit2016040026",
"articleId": "13rRUwhpBA7",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCxL9VN",
"title": "April",
"year": "2020",
"issueNum": "04",
"idPrefix": "td",
"pubType": "journal",
"volume": "31",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1fh3dx46oRq",
"doi": "10.1109/TPDS.2019.2955935",
"abstract": "Geo-distributed machine learning (ML) often uses large geo-dispersed data collections produced over time to train global models, without consolidating the data to a central site. In the parameter server architecture, “workers” and “parameter servers” for a geo-distributed ML job should be strategically deployed and adjusted on the fly, to allow easy access to the datasets and fast exchange of the model parameters at anytime. Despite many cloud platforms now provide volume discounts to encourage the usage of their ML resources, different geo-distributed ML jobs that run in the clouds often rent cloud resources separately and respectively, thus rarely enjoying the benefit of discounts. We study an ML broker service that aggregates geo-distributed ML jobs into cloud data centers for volume discounts via dynamic online placement and scaling of workers and parameter servers in individual jobs for long-term cost minimization. To decide the number and the placement of workers and parameter servers, we propose an efficient online algorithm which first decomposes the online problem into a series of one-shot optimization problems solvable at each individual time slot by the technique of regularization, and afterwards round the fractional decisions to the integer ones via a carefully-designed dependent rounding method. We prove a parameterized-constant competitive ratio for our online algorithm as the theoretical performance analysis, and also conduct extensive simulation studies to exhibit its close-to-offline-optimum practical performance in realistic settings.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Geo-distributed machine learning (ML) often uses large geo-dispersed data collections produced over time to train global models, without consolidating the data to a central site. In the parameter server architecture, “workers” and “parameter servers” for a geo-distributed ML job should be strategically deployed and adjusted on the fly, to allow easy access to the datasets and fast exchange of the model parameters at anytime. Despite many cloud platforms now provide volume discounts to encourage the usage of their ML resources, different geo-distributed ML jobs that run in the clouds often rent cloud resources separately and respectively, thus rarely enjoying the benefit of discounts. We study an ML broker service that aggregates geo-distributed ML jobs into cloud data centers for volume discounts via dynamic online placement and scaling of workers and parameter servers in individual jobs for long-term cost minimization. To decide the number and the placement of workers and parameter servers, we propose an efficient online algorithm which first decomposes the online problem into a series of one-shot optimization problems solvable at each individual time slot by the technique of regularization, and afterwards round the fractional decisions to the integer ones via a carefully-designed dependent rounding method. We prove a parameterized-constant competitive ratio for our online algorithm as the theoretical performance analysis, and also conduct extensive simulation studies to exhibit its close-to-offline-optimum practical performance in realistic settings.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Geo-distributed machine learning (ML) often uses large geo-dispersed data collections produced over time to train global models, without consolidating the data to a central site. In the parameter server architecture, “workers” and “parameter servers” for a geo-distributed ML job should be strategically deployed and adjusted on the fly, to allow easy access to the datasets and fast exchange of the model parameters at anytime. Despite many cloud platforms now provide volume discounts to encourage the usage of their ML resources, different geo-distributed ML jobs that run in the clouds often rent cloud resources separately and respectively, thus rarely enjoying the benefit of discounts. We study an ML broker service that aggregates geo-distributed ML jobs into cloud data centers for volume discounts via dynamic online placement and scaling of workers and parameter servers in individual jobs for long-term cost minimization. To decide the number and the placement of workers and parameter servers, we propose an efficient online algorithm which first decomposes the online problem into a series of one-shot optimization problems solvable at each individual time slot by the technique of regularization, and afterwards round the fractional decisions to the integer ones via a carefully-designed dependent rounding method. We prove a parameterized-constant competitive ratio for our online algorithm as the theoretical performance analysis, and also conduct extensive simulation studies to exhibit its close-to-offline-optimum practical performance in realistic settings.",
"title": "Online Placement and Scaling of Geo-Distributed Machine Learning Jobs via Volume-Discounting Brokerage",
"normalizedTitle": "Online Placement and Scaling of Geo-Distributed Machine Learning Jobs via Volume-Discounting Brokerage",
"fno": "08913598",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Cloud Computing",
"Computer Centres",
"Learning Artificial Intelligence",
"Minimisation",
"Geo Distributed ML Job",
"Cloud Platforms",
"ML Resources",
"Cloud Resources",
"ML Broker Service",
"Cloud Data Centers",
"Dynamic Online Placement",
"Online Algorithm",
"Volume Discounting Brokerage",
"Geo Distributed Machine Learning",
"Geo Dispersed Data Collections",
"Parameter Server Architecture",
"Geo Distributed ML Jobs",
"Data Centers",
"Data Models",
"Servers",
"Cloud Computing",
"Machine Learning",
"Optimization",
"Minimization",
"Geo Distributed Machine Learning",
"Online Placement",
"Volume Discount Brokerage"
],
"authors": [
{
"givenName": "Xiaotong",
"surname": "Li",
"fullName": "Xiaotong Li",
"affiliation": "School of Computer Science, Wuhan University, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ruiting",
"surname": "Zhou",
"fullName": "Ruiting Zhou",
"affiliation": "Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, School of Cyber Science and Engineering, Wuhan University, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lei",
"surname": "Jiao",
"fullName": "Lei Jiao",
"affiliation": "Department of Computer and Information Science, University of Oregon, Eugene, OR, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chuan",
"surname": "Wu",
"fullName": "Chuan Wu",
"affiliation": "University of Hong Kong, Kowloon, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuhang",
"surname": "Deng",
"fullName": "Yuhang Deng",
"affiliation": "School of Computer Science, Wuhan University, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zongpeng",
"surname": "Li",
"fullName": "Zongpeng Li",
"affiliation": "School of Computer Science, Wuhan University, Wuhan, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2020-04-01 00:00:00",
"pubType": "trans",
"pages": "948-966",
"year": "2020",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccce/2016/2427/0/2427a241",
"title": "Analysis of Cost Minimization Methods in Geo-distributed Data Centers",
"doi": null,
"abstractUrl": "/proceedings-article/iccce/2016/2427a241/12OmNsbY6Nn",
"parentPublication": {
"id": "proceedings/iccce/2016/2427/0",
"title": "2016 International Conference on Computer and Communication Engineering (ICCCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/cc/2020/03/08299454",
"title": "Revenue Maximization for Dynamic Expansion of Geo-Distributed Cloud Data Centers",
"doi": null,
"abstractUrl": "/journal/cc/2020/03/08299454/13rRUB6SpUm",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2018/02/08319923",
"title": "Datum: Managing Data Purchasing and Data Placement in a Geo-Distributed Data Market",
"doi": null,
"abstractUrl": "/journal/nt/2018/02/08319923/13rRUxDItel",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2019/08/08632727",
"title": "Privacy Regulation Aware Process Mapping in Geo-Distributed Cloud Data Centers",
"doi": null,
"abstractUrl": "/journal/td/2019/08/08632727/17D45WgziUc",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/cc/5555/01/09682563",
"title": "Online Scheduling Algorithm for Heterogeneous Distributed Machine Learning Jobs",
"doi": null,
"abstractUrl": "/journal/cc/5555/01/09682563/1A9QZiosdxK",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/5555/01/09847354",
"title": "DPS: Dynamic Pricing and Scheduling for Distributed Machine Learning Jobs in Edge-Cloud Networks",
"doi": null,
"abstractUrl": "/journal/tm/5555/01/09847354/1FvJrqOSMo0",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/su/2023/01/09899733",
"title": "A Survey on Machine Learning for Geo-Distributed Cloud Data Center Managements",
"doi": null,
"abstractUrl": "/journal/su/2023/01/09899733/1GSnwtG2J3y",
"parentPublication": {
"id": "trans/su",
"title": "IEEE Transactions on Sustainable Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/igsc/2019/5416/0/08957179",
"title": "Green Computing with Geo-Distributed Heterogeneous Data Centers",
"doi": null,
"abstractUrl": "/proceedings-article/igsc/2019/08957179/1gAudqD1bPi",
"parentPublication": {
"id": "proceedings/igsc/2019/5416/0",
"title": "2019 Tenth International Green and Sustainable Computing Conference (IGSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigcom/2020/8275/0/09160463",
"title": "Dynamic Pricing and Placement for Distributed Machine Learning Jobs",
"doi": null,
"abstractUrl": "/proceedings-article/bigcom/2020/09160463/1m4CK7RKm8U",
"parentPublication": {
"id": "proceedings/bigcom/2020/8275/0",
"title": "2020 6th International Conference on Big Data Computing and Communications (BIGCOM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nana/2021/4158/0/415800a136",
"title": "Online Scheduling of Machine Learning Jobs in Edge-Cloud Networks",
"doi": null,
"abstractUrl": "/proceedings-article/nana/2021/415800a136/1zdPKwOqs9i",
"parentPublication": {
"id": "proceedings/nana/2021/4158/0",
"title": "2021 International Conference on Networking and Network Applications (NaNA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08907491",
"articleId": "1f75WTIo1AA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08877859",
"articleId": "1gDHlyIHdN6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzICEFh",
"title": "March/April",
"year": "2004",
"issueNum": "02",
"idPrefix": "so",
"pubType": "magazine",
"volume": "21",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwbs2eH",
"doi": "10.1109/MS.2004.1270760",
"abstract": "We hear a lot about how collaboration is the key to implementing the right requirements. But how can clients and developers achieve this collaboration? The author gives us the benefit of his experience on how prototypes and professionalism make this happen.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We hear a lot about how collaboration is the key to implementing the right requirements. But how can clients and developers achieve this collaboration? The author gives us the benefit of his experience on how prototypes and professionalism make this happen.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We hear a lot about how collaboration is the key to implementing the right requirements. But how can clients and developers achieve this collaboration? The author gives us the benefit of his experience on how prototypes and professionalism make this happen.",
"title": "Never Go to a Client Meeting without a Prototype",
"normalizedTitle": "Never Go to a Client Meeting without a Prototype",
"fno": "s2042",
"hasPdf": true,
"idPrefix": "so",
"keywords": [
"Software Prototyping",
"Prototypes",
"Programming",
"Collaboration",
"Costs",
"Software Prototyping",
"Scheduling",
"Power Generation Economics",
"Environmental Economics",
"Collaborative Software",
"Risk Management"
],
"authors": [
{
"givenName": "Michael",
"surname": "Schrage",
"fullName": "Michael Schrage",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2004-03-01 00:00:00",
"pubType": "mags",
"pages": "42-45",
"year": "2004",
"issn": "0740-7459",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "s2034",
"articleId": "13rRUxNW1Xv",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "s2046",
"articleId": "13rRUxBJhl1",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrIaece",
"title": "May/June",
"year": "2008",
"issueNum": "03",
"idPrefix": "ex",
"pubType": "magazine",
"volume": "23",
"label": "May/June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIJcWsN",
"doi": "10.1109/MIS.2008.53",
"abstract": "This article discusses what kind of entity the proposed Semantic Web (SW) is, principally by reference to the relationship of natural language structure to knowledge representation (KR). There are three distinct views on this issue. The first is that the SW is basically a renaming of the traditional AI KR task, with all its problems and challenges. The second view is that the SW will be, at a minimum, the World Wide Web with its constituent documents annotated so as to yield their content, or meaning structure, more directly. This view makes natural language processing central as the procedural bridge from texts to KR, usually via some form of automated information extraction. The third view is that the SW is about trusted databases as the foundation of a system of Web processes and services. There's also a fourth view, which is much more difficult to define and discuss: If the SW just keeps moving as an engineering development and is lucky, then real problems won't arise. This article is part of a special issue called Semantic Web Update.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This article discusses what kind of entity the proposed Semantic Web (SW) is, principally by reference to the relationship of natural language structure to knowledge representation (KR). There are three distinct views on this issue. The first is that the SW is basically a renaming of the traditional AI KR task, with all its problems and challenges. The second view is that the SW will be, at a minimum, the World Wide Web with its constituent documents annotated so as to yield their content, or meaning structure, more directly. This view makes natural language processing central as the procedural bridge from texts to KR, usually via some form of automated information extraction. The third view is that the SW is about trusted databases as the foundation of a system of Web processes and services. There's also a fourth view, which is much more difficult to define and discuss: If the SW just keeps moving as an engineering development and is lucky, then real problems won't arise. This article is part of a special issue called Semantic Web Update.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This article discusses what kind of entity the proposed Semantic Web (SW) is, principally by reference to the relationship of natural language structure to knowledge representation (KR). There are three distinct views on this issue. The first is that the SW is basically a renaming of the traditional AI KR task, with all its problems and challenges. The second view is that the SW will be, at a minimum, the World Wide Web with its constituent documents annotated so as to yield their content, or meaning structure, more directly. This view makes natural language processing central as the procedural bridge from texts to KR, usually via some form of automated information extraction. The third view is that the SW is about trusted databases as the foundation of a system of Web processes and services. There's also a fourth view, which is much more difficult to define and discuss: If the SW just keeps moving as an engineering development and is lucky, then real problems won't arise. This article is part of a special issue called Semantic Web Update.",
"title": "The Semantic Web: Apotheosis of Annotation, but What Are Its Semantics?",
"normalizedTitle": "The Semantic Web: Apotheosis of Annotation, but What Are Its Semantics?",
"fno": "mex2008030041",
"hasPdf": true,
"idPrefix": "ex",
"keywords": [
"Semantic Web",
"Artificial Intelligence",
"Natural Language Processing",
"World Wide Web",
"Meaning",
"Biological Databases",
"Language Models",
"Corpora",
"N Grams"
],
"authors": [
{
"givenName": "Yorick",
"surname": "Wilks",
"fullName": "Yorick Wilks",
"affiliation": "University of Sheffield",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2008-05-01 00:00:00",
"pubType": "mags",
"pages": "41-49",
"year": "2008",
"issn": "1541-1672",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hotweb/2016/5409/0/5409a072",
"title": "What Ad Blockers Are (and Are Not) Doing",
"doi": null,
"abstractUrl": "/proceedings-article/hotweb/2016/5409a072/12OmNqIQSjO",
"parentPublication": {
"id": "proceedings/hotweb/2016/5409/0",
"title": "2016 Fourth IEEE Workshop on Hot Topics in Web Systems and Technologies (HotWeb)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccgrid/2008/3156/0/3156a534",
"title": "The Ontology Relation Extraction for Semantic Web Annotation",
"doi": null,
"abstractUrl": "/proceedings-article/ccgrid/2008/3156a534/12OmNs0C9KR",
"parentPublication": {
"id": "proceedings/ccgrid/2008/3156/0",
"title": "Cluster Computing and the Grid, IEEE International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nwesp/2005/2452/0/24520069",
"title": "Modeling Views for the Semantic Web: As a Mechanism for Modeling Sub-Ontologies",
"doi": null,
"abstractUrl": "/proceedings-article/nwesp/2005/24520069/12OmNvDI3R7",
"parentPublication": {
"id": "proceedings/nwesp/2005/2452/0",
"title": "International Conference on Next Generation Web Services Practices",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2009/3804/4/3804e338",
"title": "The Power Law of Social and Economic Indexes Based on Languages on the Web",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2009/3804e338/12OmNx5piOk",
"parentPublication": {
"id": "proceedings/icicta/2009/3804/4",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/advcomp/2008/3369/0/3369a021",
"title": "Everything You Ever Wanted to Learn from the Semantic Web but Were Unable to Ask",
"doi": null,
"abstractUrl": "/proceedings-article/advcomp/2008/3369a021/12OmNxHJ9tf",
"parentPublication": {
"id": "proceedings/advcomp/2008/3369/0",
"title": "Advanced Engineering Computing and Applications in Sciences, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicse/2008/3112/0/3112a187",
"title": "The Ontology Relation Extraction for Semantic Web Annotation",
"doi": null,
"abstractUrl": "/proceedings-article/icicse/2008/3112a187/12OmNxRnvO6",
"parentPublication": {
"id": "proceedings/icicse/2008/3112/0",
"title": "2008 International Conference on Internet Computing in Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisis/2009/3575/0/3575a475",
"title": "Semi-Automatic Annotation System for OWL-Based Semantic Search",
"doi": null,
"abstractUrl": "/proceedings-article/cisis/2009/3575a475/12OmNzlUKAv",
"parentPublication": {
"id": "proceedings/cisis/2009/3575/0",
"title": "2009 International Conference on Complex, Intelligent and Software Intensive Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ic/2009/05/mic2009050096",
"title": "The Semantics of \"Semantics\"",
"doi": null,
"abstractUrl": "/magazine/ic/2009/05/mic2009050096/13rRUEgarFO",
"parentPublication": {
"id": "mags/ic",
"title": "IEEE Internet Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/2011/04/mso2011040084",
"title": "What Time Is It, Eccles?",
"doi": null,
"abstractUrl": "/magazine/so/2011/04/mso2011040084/13rRUxly9bV",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2003/05/x5076",
"title": "Where Are the Rules?",
"doi": null,
"abstractUrl": "/magazine/ex/2003/05/x5076/13rRUy08MAp",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mex2008030029",
"articleId": "13rRUB7a1bB",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mex2008030050",
"articleId": "13rRUx0xPEs",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwkR5xL",
"title": "January",
"year": "2012",
"issueNum": "01",
"idPrefix": "tk",
"pubType": "journal",
"volume": "24",
"label": "January",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwdrdSP",
"doi": "10.1109/TKDE.2010.221",
"abstract": "Dynamic XML labeling schemes have important applications in XML Database Management Systems. In this paper, we explore dynamic XML labeling schemes from a novel order-centric perspective. We compare the various labeling schemes proposed in the literature with a special focus on their orders of labels. We show that the order of labels fundamentally impacts the update performance of a labeling scheme and develop an order-based framework to classify and characterize XML labeling schemes. Although there are dynamic XML labeling schemes that can completely avoid relabeling, the gain in update performance all come with considerable costs such as larger label size and lower query performance, even if the XML documents are hardly updated. We introduce vector order which is the foundation of the dynamic labeling schemes we propose. Compared with previous solutions that are based on natural order or lexicographical order, vector order is a simple, yet most effective solution to process updates in XML DBMS. We show that vector order can be gracefully applied to both range-based and prefix-based labeling schemes with little overhead introduced. Moreover, vector order-based labeling schemes are not only efficient to process, but also resilient to skewed insertions. Qualitative and experimental evaluations confirm the benefits of our approach compared to previous solutions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Dynamic XML labeling schemes have important applications in XML Database Management Systems. In this paper, we explore dynamic XML labeling schemes from a novel order-centric perspective. We compare the various labeling schemes proposed in the literature with a special focus on their orders of labels. We show that the order of labels fundamentally impacts the update performance of a labeling scheme and develop an order-based framework to classify and characterize XML labeling schemes. Although there are dynamic XML labeling schemes that can completely avoid relabeling, the gain in update performance all come with considerable costs such as larger label size and lower query performance, even if the XML documents are hardly updated. We introduce vector order which is the foundation of the dynamic labeling schemes we propose. Compared with previous solutions that are based on natural order or lexicographical order, vector order is a simple, yet most effective solution to process updates in XML DBMS. We show that vector order can be gracefully applied to both range-based and prefix-based labeling schemes with little overhead introduced. Moreover, vector order-based labeling schemes are not only efficient to process, but also resilient to skewed insertions. Qualitative and experimental evaluations confirm the benefits of our approach compared to previous solutions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Dynamic XML labeling schemes have important applications in XML Database Management Systems. In this paper, we explore dynamic XML labeling schemes from a novel order-centric perspective. We compare the various labeling schemes proposed in the literature with a special focus on their orders of labels. We show that the order of labels fundamentally impacts the update performance of a labeling scheme and develop an order-based framework to classify and characterize XML labeling schemes. Although there are dynamic XML labeling schemes that can completely avoid relabeling, the gain in update performance all come with considerable costs such as larger label size and lower query performance, even if the XML documents are hardly updated. We introduce vector order which is the foundation of the dynamic labeling schemes we propose. Compared with previous solutions that are based on natural order or lexicographical order, vector order is a simple, yet most effective solution to process updates in XML DBMS. We show that vector order can be gracefully applied to both range-based and prefix-based labeling schemes with little overhead introduced. Moreover, vector order-based labeling schemes are not only efficient to process, but also resilient to skewed insertions. Qualitative and experimental evaluations confirm the benefits of our approach compared to previous solutions.",
"title": "Labeling Dynamic XML Documents: An Order-Centric Approach",
"normalizedTitle": "Labeling Dynamic XML Documents: An Order-Centric Approach",
"fno": "ttk2012010100",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Tree Node Labeling",
"XML Data Management",
"Update Processing",
"Query Processing"
],
"authors": [
{
"givenName": "Liang",
"surname": "Xu",
"fullName": "Liang Xu",
"affiliation": "National University of Singapore, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tok Wang",
"surname": "Ling",
"fullName": "Tok Wang Ling",
"affiliation": "National University of Singapore, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huayu",
"surname": "Wu",
"fullName": "Huayu Wu",
"affiliation": "Institute for Infocomm Research, Singapore",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2012-01-01 00:00:00",
"pubType": "trans",
"pages": "100-113",
"year": "2012",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cit/2008/2357/0/04594715",
"title": "Efficient labeling scheme of XML data considering update operations",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2008/04594715/12OmNApu5Ca",
"parentPublication": {
"id": "proceedings/cit/2008/2357/0",
"title": "2008 8th IEEE International Conference on Computer and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wism/2009/3817/0/3817a277",
"title": "A Labeling Scheme for Temporal XML",
"doi": null,
"abstractUrl": "/proceedings-article/wism/2009/3817a277/12OmNwJybR3",
"parentPublication": {
"id": "proceedings/wism/2009/3817/0",
"title": "Web Information Systems and Mining, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccrd/2010/4043/0/4043a781",
"title": "Mapping and Labeling XML Data for Dynamic Update",
"doi": null,
"abstractUrl": "/proceedings-article/iccrd/2010/4043a781/12OmNy50g4n",
"parentPublication": {
"id": "proceedings/iccrd/2010/4043/0",
"title": "Computer Research and Development, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2010/4108/0/4108b639",
"title": "Group-Based Prime Number Labeling Scheme for XML Data",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2010/4108b639/12OmNyKrHnG",
"parentPublication": {
"id": "proceedings/cit/2010/4108/0",
"title": "Computer and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2009/3836/1/3836a318",
"title": "A New Labeling Scheme without Re-labeling Using Circular Concepts for Dynamic XML Data",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2009/3836a318/12OmNyqzLVV",
"parentPublication": {
"id": "proceedings/cit/2009/3836/1",
"title": "2009 Ninth IEEE International Conference on Computer and Information Technology. CIT 2009",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/4/3336g704",
"title": "An Efficient Numbering Scheme for Dynamic XML Trees",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336g704/12OmNzBOhTO",
"parentPublication": {
"id": "csse/2008/3336/4",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gpc-workshops/2008/3177/0/3177a329",
"title": "Access Control and Labeling Scheme for Dynamic XML Data",
"doi": null,
"abstractUrl": "/proceedings-article/gpc-workshops/2008/3177a329/12OmNzcPAvS",
"parentPublication": {
"id": "proceedings/gpc-workshops/2008/3177/0",
"title": "GPC Workshops - 2008 3rd International Conference on Grid and Pervasive Computing Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wisa/2013/3218/0/06778608",
"title": "Triple Code: An Efficient Labeling Scheme for Query Answering in XML Data",
"doi": null,
"abstractUrl": "/proceedings-article/wisa/2013/06778608/12OmNzlD9gY",
"parentPublication": {
"id": "proceedings/wisa/2013/3218/0",
"title": "2013 10th Web Information System and Application Conference (WISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2010/04/ttk2010040602",
"title": "A Binary String Approach for Updates in Dynamic Ordered XML Data",
"doi": null,
"abstractUrl": "/journal/tk/2010/04/ttk2010040602/13rRUwfZC0y",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wiri/2005/2414/0/01552999",
"title": "A Mapping Scheme of XML Documents into Relational Databases using Schema-based Path Identi.ers",
"doi": null,
"abstractUrl": "/proceedings-article/wiri/2005/01552999/1hVkWekCW5i",
"parentPublication": {
"id": "proceedings/wiri/2005/2414/0",
"title": "Proceedings. International Workshop on Challenges in Web Information Retrieval and Integration",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttk2012010086",
"articleId": "13rRUwbs1SQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttk2012010114",
"articleId": "13rRUxD9h5C",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrIrPny",
"title": "June",
"year": "1982",
"issueNum": "06",
"idPrefix": "tp",
"pubType": "journal",
"volume": "4",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwgQpru",
"doi": "10.1109/TPAMI.1982.4767325",
"abstract": "Current implementations of relaxation labeling are homogeneous, where each pixel is in an identical relationship to a static neighbor set. These systems maintain the iterative probabilistic labeling but use a nonhomogeneous dynamic neighborhood to establish a local consistency. Neighborhoods are created at each iteration through the broadcasting and reception of label information according to semantically established broadcasting patterns for each label. Augmented relaxation labeling is a two stage process which contains a separate relaxation stage with a top-down direction capability for specific pixel label updating. Dynamic relaxation is a one step process where every pixel label is updated through the dynamic neighborhoods. Both labeling processes are demonstrated on simple line drawings.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Current implementations of relaxation labeling are homogeneous, where each pixel is in an identical relationship to a static neighbor set. These systems maintain the iterative probabilistic labeling but use a nonhomogeneous dynamic neighborhood to establish a local consistency. Neighborhoods are created at each iteration through the broadcasting and reception of label information according to semantically established broadcasting patterns for each label. Augmented relaxation labeling is a two stage process which contains a separate relaxation stage with a top-down direction capability for specific pixel label updating. Dynamic relaxation is a one step process where every pixel label is updated through the dynamic neighborhoods. Both labeling processes are demonstrated on simple line drawings.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Current implementations of relaxation labeling are homogeneous, where each pixel is in an identical relationship to a static neighbor set. These systems maintain the iterative probabilistic labeling but use a nonhomogeneous dynamic neighborhood to establish a local consistency. Neighborhoods are created at each iteration through the broadcasting and reception of label information according to semantically established broadcasting patterns for each label. Augmented relaxation labeling is a two stage process which contains a separate relaxation stage with a top-down direction capability for specific pixel label updating. Dynamic relaxation is a one step process where every pixel label is updated through the dynamic neighborhoods. Both labeling processes are demonstrated on simple line drawings.",
"title": "Augmented Relaxation Labeling and Dynamic Relaxation Labeling",
"normalizedTitle": "Augmented Relaxation Labeling and Dynamic Relaxation Labeling",
"fno": "04767325",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [],
"authors": [
{
"givenName": "Stephen A.",
"surname": "Kuschel",
"fullName": "Stephen A. Kuschel",
"affiliation": "Radar and Optics Division, Environmental Research Institute of Michigan, Ann Arbor, MI 48107.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Carl V.",
"surname": "Page",
"fullName": "Carl V. Page",
"affiliation": "Department of Computer Science, Michigan State University, East Lansing, MI 48824.",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "1982-11-01 00:00:00",
"pubType": "trans",
"pages": "676-682",
"year": "1982",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/1993/3880/0/00341033",
"title": "Multiscale relaxation labeling of fractal images",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1993/00341033/12OmNBTJIJ2",
"parentPublication": {
"id": "proceedings/cvpr/1993/3880/0",
"title": "Proceedings of IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1989/1952/0/00037824",
"title": "Edge reinforcement using parametrized relaxation labeling",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1989/00037824/12OmNwtn3rw",
"parentPublication": {
"id": "proceedings/cvpr/1989/1952/0",
"title": "1989 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/1996/3192/6/00550609",
"title": "A unification of relaxation labeling and associative memory",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/1996/00550609/12OmNyU63s1",
"parentPublication": {
"id": "proceedings/icassp/1996/3192/6",
"title": "Acoustics, Speech, and Signal Processing, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1994/6265/1/00576334",
"title": "Relaxation labeling of Markov random fields",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1994/00576334/12OmNzVXNPD",
"parentPublication": {
"id": "proceedings/icpr/1994/6265/1",
"title": "Proceedings of 12th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1992/05/i0502",
"title": "Reinforcement of Linear Structure using Parametrized Relaxation Labeling",
"doi": null,
"abstractUrl": "/journal/tp/1992/05/i0502/13rRUNvgyXo",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1984/03/04767530",
"title": "Adaptive Relaxation Labeling",
"doi": null,
"abstractUrl": "/journal/tp/1984/03/04767530/13rRUwInvlK",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1983/03/04767390",
"title": "On the Foundations of Relaxation Labeling Processes",
"doi": null,
"abstractUrl": "/journal/tp/1983/03/04767390/13rRUwfZBVY",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1990/02/i0165",
"title": "Edge-Labeling Using Dictionary-Based Relaxation",
"doi": null,
"abstractUrl": "/journal/tp/1990/02/i0165/13rRUxAASUa",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1997/04/i0328",
"title": "An Edge Detection Technique Using the Facet Model and Parameterized Relaxation Labeling",
"doi": null,
"abstractUrl": "/journal/tp/1997/04/i0328/13rRUxASuHc",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1981/02/04767077",
"title": "Pixel Labeling by Supervised Probabilistic Relaxation",
"doi": null,
"abstractUrl": "/journal/tp/1981/02/04767077/13rRUygT7nL",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "04767324",
"articleId": "13rRUx0Pqqe",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04767326",
"articleId": "13rRUwh80Cn",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAgY7pg",
"title": "March",
"year": "2001",
"issueNum": "03",
"idPrefix": "tp",
"pubType": "journal",
"volume": "23",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxDItic",
"doi": "10.1109/34.910886",
"abstract": "Abstract—This paper addresses the problem of spatio-temporal segmentation of video sequences. An initial intensity segmentation method (watershed segmentation) provides a number of initial segments which are subsequently labeled, with a known number of labels, according to motion information. The label field is modeled as a Markov Random Field where the statistical spatial and temporal interactions are expressed on the basis of the initial watershed segments. The labeling criterion is the maximization of the conditional a posteriori probability of the label field given the motion hypotheses, the estimate of the label field of the previous frame, and the image intensities. For the optimization, an iterative motion estimation-labeling algorithm is proposed and experimental results are presented.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—This paper addresses the problem of spatio-temporal segmentation of video sequences. An initial intensity segmentation method (watershed segmentation) provides a number of initial segments which are subsequently labeled, with a known number of labels, according to motion information. The label field is modeled as a Markov Random Field where the statistical spatial and temporal interactions are expressed on the basis of the initial watershed segments. The labeling criterion is the maximization of the conditional a posteriori probability of the label field given the motion hypotheses, the estimate of the label field of the previous frame, and the image intensities. For the optimization, an iterative motion estimation-labeling algorithm is proposed and experimental results are presented.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—This paper addresses the problem of spatio-temporal segmentation of video sequences. An initial intensity segmentation method (watershed segmentation) provides a number of initial segments which are subsequently labeled, with a known number of labels, according to motion information. The label field is modeled as a Markov Random Field where the statistical spatial and temporal interactions are expressed on the basis of the initial watershed segments. The labeling criterion is the maximization of the conditional a posteriori probability of the label field given the motion hypotheses, the estimate of the label field of the previous frame, and the image intensities. For the optimization, an iterative motion estimation-labeling algorithm is proposed and experimental results are presented.",
"title": "Video Segmentation by MAP Labeling of Watershed Segments",
"normalizedTitle": "Video Segmentation by MAP Labeling of Watershed Segments",
"fno": "i0326",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Markov Random Fields",
"Motion Based Segmentation",
"Region Labeling",
"Watershed Segmentation",
"Motion Estimation"
],
"authors": [
{
"givenName": "Ioannis",
"surname": "Patras",
"fullName": "Ioannis Patras",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "E.a.",
"surname": "Hendriks",
"fullName": "E.a. Hendriks",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "R.l.",
"surname": "Lagendijk",
"fullName": "R.l. Lagendijk",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2001-03-01 00:00:00",
"pubType": "trans",
"pages": "326-332",
"year": "2001",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0323",
"articleId": "13rRUILtJn3",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAgY7pB",
"title": "May-June",
"year": "2017",
"issueNum": "03",
"idPrefix": "tb",
"pubType": "journal",
"volume": "14",
"label": "May-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUB6SpYX",
"doi": "10.1109/TCBB.2016.2522421",
"abstract": "RNA visualization is crucial in order to understand the relationship that exists between RNA structure and its function, as well as the development of better RNA structure prediction algorithms. However, in the context of RNA visualization, one key structure remains difficult to visualize: Pseudoknots. Pseudoknots occur in RNA folding when two secondary structural components form base-pairs between them. The three-dimensional nature of these components makes them challenging to visualize in two-dimensional media, such as print media or screens. In this review, we focus on the advancements that have been made in the field of RNA visualization in two-dimensional media in the past two decades. The review aims at presenting all relevant aspects of pseudoknot visualization. We start with an overview of several pseudoknotted structures and their relevance in RNA function. Next, we discuss the theoretical basis for RNA structural topology classification and present RNA classification systems for both pseudoknotted and non-pseudoknotted RNAs. Each description of RNA classification system is followed by a discussion of the software tools and algorithms developed to date to visualize RNA, comparing the different tools’ strengths and shortcomings.",
"abstracts": [
{
"abstractType": "Regular",
"content": "RNA visualization is crucial in order to understand the relationship that exists between RNA structure and its function, as well as the development of better RNA structure prediction algorithms. However, in the context of RNA visualization, one key structure remains difficult to visualize: Pseudoknots. Pseudoknots occur in RNA folding when two secondary structural components form base-pairs between them. The three-dimensional nature of these components makes them challenging to visualize in two-dimensional media, such as print media or screens. In this review, we focus on the advancements that have been made in the field of RNA visualization in two-dimensional media in the past two decades. The review aims at presenting all relevant aspects of pseudoknot visualization. We start with an overview of several pseudoknotted structures and their relevance in RNA function. Next, we discuss the theoretical basis for RNA structural topology classification and present RNA classification systems for both pseudoknotted and non-pseudoknotted RNAs. Each description of RNA classification system is followed by a discussion of the software tools and algorithms developed to date to visualize RNA, comparing the different tools’ strengths and shortcomings.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "RNA visualization is crucial in order to understand the relationship that exists between RNA structure and its function, as well as the development of better RNA structure prediction algorithms. However, in the context of RNA visualization, one key structure remains difficult to visualize: Pseudoknots. Pseudoknots occur in RNA folding when two secondary structural components form base-pairs between them. The three-dimensional nature of these components makes them challenging to visualize in two-dimensional media, such as print media or screens. In this review, we focus on the advancements that have been made in the field of RNA visualization in two-dimensional media in the past two decades. The review aims at presenting all relevant aspects of pseudoknot visualization. We start with an overview of several pseudoknotted structures and their relevance in RNA function. Next, we discuss the theoretical basis for RNA structural topology classification and present RNA classification systems for both pseudoknotted and non-pseudoknotted RNAs. Each description of RNA classification system is followed by a discussion of the software tools and algorithms developed to date to visualize RNA, comparing the different tools’ strengths and shortcomings.",
"title": "RNA Visualization: Relevance and the Current State-of-the-Art Focusing on Pseudoknots",
"normalizedTitle": "RNA Visualization: Relevance and the Current State-of-the-Art Focusing on Pseudoknots",
"fno": "07414427",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"RNA",
"Proteins",
"Visualization",
"DNA",
"Genomics",
"Viruses Medical",
"Media",
"Bioinformatics",
"RNA Structure",
"RNA Topology",
"RNA Visualization",
"Pseudoknots"
],
"authors": [
{
"givenName": "Boris",
"surname": "Shabash",
"fullName": "Boris Shabash",
"affiliation": "School of Computing Science, Simon Fraser University, Burnaby, BC",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kay C.",
"surname": "Wiese",
"fullName": "Kay C. Wiese",
"affiliation": "School of Computing Science, Simon Fraser University, Burnaby, BC",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2017-05-01 00:00:00",
"pubType": "trans",
"pages": "696-712",
"year": "2017",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cis/2017/4822/0/482201a469",
"title": "The Algorithm and Scheme of Prediction in RNA Folding Structure with Pseudoknots",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2017/482201a469/12OmNASraXN",
"parentPublication": {
"id": "proceedings/cis/2017/4822/0",
"title": "2017 13th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2015/8660/0/8660a034",
"title": "Predicting Algorithm of RNA Folding Structure with Pseudoknots",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2015/8660a034/12OmNApcuqF",
"parentPublication": {
"id": "proceedings/cis/2015/8660/0",
"title": "2015 11th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2013/2549/0/06746345",
"title": "An Approximation Scheme for RNA Folding Structure Prediction Including Pseudoknots",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2013/06746345/12OmNC8uRwv",
"parentPublication": {
"id": "proceedings/cis/2013/2549/0",
"title": "2013 Ninth International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2016/4840/0/4840a001",
"title": "The PTAS of Prediction for RNA Pseudoknotted Structure",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2016/4840a001/12OmNy50geR",
"parentPublication": {
"id": "proceedings/cis/2016/4840/0",
"title": "2016 12th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ichit/2006/2674/1/04021165",
"title": "Recognition and Modeling of RNA Pseudoknots Using Context-Sensitive Pattern Matching",
"doi": null,
"abstractUrl": "/proceedings-article/ichit/2006/04021165/12OmNyVes2H",
"parentPublication": {
"id": "proceedings/ichit/2006/2674/1",
"title": "2006 International Conference on Hybrid Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2006/2517/0/25170659",
"title": "jViz.Rna - An Interactive Graphical Tool for Visualizing RNA Secondary Structure Including Pseudoknots",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2006/25170659/12OmNzCF4VQ",
"parentPublication": {
"id": "proceedings/cbms/2006/2517/0",
"title": "19th IEEE Symposium on Computer-Based Medical Systems (CBMS'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2004/02/n0066",
"title": "Prediction of Consensus RNA Secondary Structures Including Pseudoknots",
"doi": null,
"abstractUrl": "/journal/tb/2004/02/n0066/13rRUEgs2Kc",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2009/07/ttk2009070974",
"title": "Discovery of Structural and Functional Features in RNA Pseudoknots",
"doi": null,
"abstractUrl": "/journal/tk/2009/07/ttk2009070974/13rRUxYrbMF",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2018/0169/0/016900a196",
"title": "Algorithm and Scheme in RNA Structure Prediction Including Pseudoknots",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2018/016900a196/17D45Xh13w4",
"parentPublication": {
"id": "proceedings/cis/2018/0169/0",
"title": "2018 14th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/03/08807142",
"title": "RNA Secondary Structure Prediction with Pseudoknots Using Chemical Reaction Optimization Algorithm",
"doi": null,
"abstractUrl": "/journal/tb/2021/03/08807142/1cG5VRDQ2VW",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07406753",
"articleId": "13rRUIJuxo4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07457296",
"articleId": "13rRUwbs1R3",
"__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": "13rRUwInvJ8",
"doi": "10.1109/TVCG.2006.111",
"abstract": "This paper presents an interactive visualization system, named WebSearchViz, for visualizing the Web search results and facilitating users' navigation and exploration. The metaphor in our model is the solar system with its planets and asteroids revolving around the sun. Location, color, movement, and spatial distance of objects in the visual space are used to represent the semantic relationships between a query and relevant Web pages. Especially, the movement of objects and their speeds add a new dimension to the visual space, illustrating the degree of relevance among a query and Web search results in the context of users' subjects of interest. By interacting with the visual space, users are able to observe the semantic relevance between a query and a resulting Web page with respect to their subjects of interest, context information, or concern. Users' subjects of interest can be dynamically changed, redefined, added, or deleted from the visual space.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents an interactive visualization system, named WebSearchViz, for visualizing the Web search results and facilitating users' navigation and exploration. The metaphor in our model is the solar system with its planets and asteroids revolving around the sun. Location, color, movement, and spatial distance of objects in the visual space are used to represent the semantic relationships between a query and relevant Web pages. Especially, the movement of objects and their speeds add a new dimension to the visual space, illustrating the degree of relevance among a query and Web search results in the context of users' subjects of interest. By interacting with the visual space, users are able to observe the semantic relevance between a query and a resulting Web page with respect to their subjects of interest, context information, or concern. Users' subjects of interest can be dynamically changed, redefined, added, or deleted from the visual space.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents an interactive visualization system, named WebSearchViz, for visualizing the Web search results and facilitating users' navigation and exploration. The metaphor in our model is the solar system with its planets and asteroids revolving around the sun. Location, color, movement, and spatial distance of objects in the visual space are used to represent the semantic relationships between a query and relevant Web pages. Especially, the movement of objects and their speeds add a new dimension to the visual space, illustrating the degree of relevance among a query and Web search results in the context of users' subjects of interest. By interacting with the visual space, users are able to observe the semantic relevance between a query and a resulting Web page with respect to their subjects of interest, context information, or concern. Users' subjects of interest can be dynamically changed, redefined, added, or deleted from the visual space.",
"title": "A Novel Visualization Model for Web Search Results",
"normalizedTitle": "A Novel Visualization Model for Web Search Results",
"fno": "v0981",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Interactive Systems",
"Online Front Ends",
"Query Processing",
"Search Engines",
"Solar System",
"Interactive Visualization System",
"Web Search Viz",
"User Navigation",
"User Exploration",
"Solar System",
"Visual Space",
"Semantic Relationships",
"Web Pages",
"Web Search",
"Web Pages",
"Data Visualization",
"Humans",
"Navigation",
"Solar System",
"Planets",
"Sun",
"Visual Perception",
"Web Sites",
"Visualization Model",
"Web Search Results",
"Movement",
"Speed"
],
"authors": [
{
"givenName": "Tien",
"surname": "Nguyen",
"fullName": "Tien Nguyen",
"affiliation": "Electrical and Computer Engineering Department at Iowa State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jun",
"surname": "Zhang",
"fullName": "Jun Zhang",
"affiliation": "University of Wisconsin at Milwaukee",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "trans",
"pages": "981-988",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/waina/2016/2461/0/2461a455",
"title": "Selecting Web Search Results of Diverse Contents with Search Engine Suggests and a Topic Model",
"doi": null,
"abstractUrl": "/proceedings-article/waina/2016/2461a455/12OmNwtn3zF",
"parentPublication": {
"id": "proceedings/waina/2016/2461/0",
"title": "2016 30th International Conference on Advanced Information Networking and Applications Workshops (WAINA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2010/6984/0/05540092",
"title": "Improving web image search results using query-relative classifiers",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2010/05540092/12OmNxbEtIu",
"parentPublication": {
"id": "proceedings/cvpr/2010/6984/0",
"title": "2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisce/2016/2535/0/2535a352",
"title": "Dynamic Integration for Deep Web Search Results",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2016/2535a352/12OmNy3RRKs",
"parentPublication": {
"id": "proceedings/icisce/2016/2535/0",
"title": "2016 3rd International Conference on Information Science and Control Engineering (ICISCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2012/0227/1/06495133",
"title": "Extracting Knowledge from Web Search Engine Results",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2012/06495133/12OmNyNzhxF",
"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/iv/2008/3268/0/3268a208",
"title": "PEx-WEB: Content-based Visualization of Web Search Results",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2008/3268a208/12OmNzYNNf5",
"parentPublication": {
"id": "proceedings/iv/2008/3268/0",
"title": "2008 12th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2009/3801/3/3801c108",
"title": "CubanSea: Cluster-Based Visualization of Search Results",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2009/3801c108/12OmNzvz6HF",
"parentPublication": {
"id": "proceedings/wi-iat/2009/3801/3",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/03/ttg2014030457",
"title": "Similarity Preserving Snippet-Based Visualization of Web Search Results",
"doi": null,
"abstractUrl": "/journal/tg/2014/03/ttg2014030457/13rRUIIVlcJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2008/03/ttk2008030411",
"title": "Beyond Single-Page Web Search Results",
"doi": null,
"abstractUrl": "/journal/tk/2008/03/ttk2008030411/13rRUwbs2bm",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2010/01/tth2010010063",
"title": "Visually Guided Haptic Search",
"doi": null,
"abstractUrl": "/journal/th/2010/01/tth2010010063/13rRUxly9e5",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2001/1116/0/00959926",
"title": "Web search via hub synthesis",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2001/00959926/18j8zO6roDC",
"parentPublication": {
"id": "proceedings/cluster/2001/1116/0",
"title": "Third IEEE International Conference on Cluster Computing (CLUSTER'01)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0973",
"articleId": "13rRUwbaqUH",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0989",
"articleId": "13rRUyfKIHC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1qV2M7t4S1q",
"title": "March",
"year": "2021",
"issueNum": "03",
"idPrefix": "tk",
"pubType": "journal",
"volume": "33",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1ddbbHabDGg",
"doi": "10.1109/TKDE.2019.2940459",
"abstract": "Node embedding techniques have gained prominence since they produce continuous and low-dimensional features, which are effective for various tasks. Most existing approaches learn node embeddings by exploring the structure of networks and are mainly focused on static non-attributed graphs. However, many real-world applications, such as stock markets and public review websites, involve bipartite graphs with dynamic and attributed edges, called attributed interaction graphs. Different from conventional graph data, attributed interaction graphs involve two kinds of entities (e.g. investors/stocks and users/businesses) and edges of temporal interactions with attributes (e.g. transactions and reviews). In this paper, we study the problem of node embedding in attributed interaction graphs. Learning embeddings in interaction graphs is highly challenging due to the dynamics and heterogeneous attributes of edges. Different from conventional static graphs, in attributed interaction graphs, each edge can have totally different meanings when the interaction is at different times or associated with different attributes. To tackle the above challenges, we introduce the temporal dependency and conditional proximity, which are two fundamental characteristics of interaction graphs. Then, we propose a deep node embedding method called IGE+ (Interaction Graph Embedding+). By preserving these two characteristics, IGE+ is able to produce effective node embeddings in interaction graphs. We evaluate our proposed method and various comparing methods on four real-world datasets. The experimental results prove the effectiveness of the learned embeddings by IGE+ on both node-based and edge-based tasks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Node embedding techniques have gained prominence since they produce continuous and low-dimensional features, which are effective for various tasks. Most existing approaches learn node embeddings by exploring the structure of networks and are mainly focused on static non-attributed graphs. However, many real-world applications, such as stock markets and public review websites, involve bipartite graphs with dynamic and attributed edges, called attributed interaction graphs. Different from conventional graph data, attributed interaction graphs involve two kinds of entities (e.g. investors/stocks and users/businesses) and edges of temporal interactions with attributes (e.g. transactions and reviews). In this paper, we study the problem of node embedding in attributed interaction graphs. Learning embeddings in interaction graphs is highly challenging due to the dynamics and heterogeneous attributes of edges. Different from conventional static graphs, in attributed interaction graphs, each edge can have totally different meanings when the interaction is at different times or associated with different attributes. To tackle the above challenges, we introduce the temporal dependency and conditional proximity, which are two fundamental characteristics of interaction graphs. Then, we propose a deep node embedding method called IGE+ (Interaction Graph Embedding+). By preserving these two characteristics, IGE+ is able to produce effective node embeddings in interaction graphs. We evaluate our proposed method and various comparing methods on four real-world datasets. The experimental results prove the effectiveness of the learned embeddings by IGE+ on both node-based and edge-based tasks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Node embedding techniques have gained prominence since they produce continuous and low-dimensional features, which are effective for various tasks. Most existing approaches learn node embeddings by exploring the structure of networks and are mainly focused on static non-attributed graphs. However, many real-world applications, such as stock markets and public review websites, involve bipartite graphs with dynamic and attributed edges, called attributed interaction graphs. Different from conventional graph data, attributed interaction graphs involve two kinds of entities (e.g. investors/stocks and users/businesses) and edges of temporal interactions with attributes (e.g. transactions and reviews). In this paper, we study the problem of node embedding in attributed interaction graphs. Learning embeddings in interaction graphs is highly challenging due to the dynamics and heterogeneous attributes of edges. Different from conventional static graphs, in attributed interaction graphs, each edge can have totally different meanings when the interaction is at different times or associated with different attributes. To tackle the above challenges, we introduce the temporal dependency and conditional proximity, which are two fundamental characteristics of interaction graphs. Then, we propose a deep node embedding method called IGE+ (Interaction Graph Embedding+). By preserving these two characteristics, IGE+ is able to produce effective node embeddings in interaction graphs. We evaluate our proposed method and various comparing methods on four real-world datasets. The experimental results prove the effectiveness of the learned embeddings by IGE+ on both node-based and edge-based tasks.",
"title": "IGE+: A Framework for Learning Node Embeddings in Interaction Graphs",
"normalizedTitle": "IGE+: A Framework for Learning Node Embeddings in Interaction Graphs",
"fno": "08827965",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Graph Theory",
"Learning Artificial Intelligence",
"Node Based Tasks",
"Edge Based Tasks",
"Attributed Interaction Graphs",
"IGE",
"Learned Embeddings",
"Effective Node Embeddings",
"Interaction Graph Embedding",
"Deep Node Embedding Method",
"Conventional Static Graphs",
"Heterogeneous Attributes",
"Temporal Interactions",
"Conventional Graph Data",
"Bipartite Graphs",
"Node Embedding Techniques",
"Task Analysis",
"Stock Markets",
"Bipartite Graph",
"Image Edge Detection",
"Encoding",
"Investment",
"Computer Science",
"Graph Mining",
"Representation Learning",
"Attributed Interaction Graph",
"Node Embedding"
],
"authors": [
{
"givenName": "Yao",
"surname": "Zhang",
"fullName": "Yao Zhang",
"affiliation": "Shanghai Key Laboratory of Data Science, School of Computer Science, Fudan University, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yun",
"surname": "Xiong",
"fullName": "Yun Xiong",
"affiliation": "Shanghai Key Laboratory of Data Science, School of Computer Science, Fudan University, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiangnan",
"surname": "Kong",
"fullName": "Xiangnan Kong",
"affiliation": "Department of Computer Science, Worcester Polytechnic Institute, Worcester, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhuang",
"surname": "Niu",
"fullName": "Zhuang Niu",
"affiliation": "Shanghai Stock Exchange, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yangyong",
"surname": "Zhu",
"fullName": "Yangyong Zhu",
"affiliation": "Shanghai Key Laboratory of Data Science, School of Computer Science, Fudan University, Shanghai, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2021-03-01 00:00:00",
"pubType": "trans",
"pages": "1032-1044",
"year": "2021",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/focs/1999/0409/0/04090399",
"title": "Cuts, Trees and -Embeddings of Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1999/04090399/12OmNB836OY",
"parentPublication": {
"id": "proceedings/focs/1999/0409/0",
"title": "40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2015/3854/0/07403520",
"title": "Node embeddings in social network analysis",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2015/07403520/12OmNBTawkM",
"parentPublication": {
"id": "proceedings/asonam/2015/3854/0",
"title": "2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/1997/8227/0/82270436",
"title": "Optimal embeddings of multiple graphs into a hypermesh",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/1997/82270436/12OmNwMXnn0",
"parentPublication": {
"id": "proceedings/icpads/1997/8227/0",
"title": "Parallel and Distributed Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209a750",
"title": "Prime Rigid Graphs and Multidimensional Scaling with Missing Data",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209a750/12OmNx8wThv",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2017/2715/0/08258435",
"title": "An augmented fama and french three-factor model using social interaction",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08258435/17D45VN31go",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/05/09709650",
"title": "Streaming Graph Embeddings via Incremental Neighborhood Sketching",
"doi": null,
"abstractUrl": "/journal/tk/2023/05/09709650/1ASFjMEiQZW",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/06/09737419",
"title": "Learning Adaptive Node Embeddings Across Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2023/06/09737419/1BQi9Njgzja",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09815165",
"title": "HATR-I: Hierarchical Adaptive Temporal Relational Interaction for Stock Trend Prediction",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09815165/1EJBfh6MFm8",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2019/4604/0/460400a289",
"title": "Distribution of Node Embeddings as Multiresolution Features for Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2019/460400a289/1h5XLcVdD20",
"parentPublication": {
"id": "proceedings/icdm/2019/4604/0",
"title": "2019 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/05/09132694",
"title": "Role-Based Graph Embeddings",
"doi": null,
"abstractUrl": "/journal/tk/2022/05/09132694/1l8sM2wFJAs",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08798763",
"articleId": "1cumOfxsYy4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08798598",
"articleId": "1cumOr2vli8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzsJ7kY",
"title": "January-March",
"year": "2009",
"issueNum": "01",
"idPrefix": "tb",
"pubType": "journal",
"volume": "6",
"label": "January-March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjQyam",
"doi": "10.1109/TCBB.2008.58",
"abstract": "The evolutionary history of a collection of species is usually represented by a phylogenetic tree. Sometimes, phylogenetic networks are used as a means of representing reticulate evolution or of showing uncertainty and incompatibilities in evolutionary datasets. This is often done using unrooted phylogenetic networks such as split networks, due in part, to the availability of software (SplitsTree) for their computation and visualization. In this paper we discuss the problem of drawing rooted phylogenetic networks as cladograms or phylograms in a number of different views that are commonly used for rooted trees. Implementations of the algorithms are available in new releases of the Dendroscope and SplitsTree programs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The evolutionary history of a collection of species is usually represented by a phylogenetic tree. Sometimes, phylogenetic networks are used as a means of representing reticulate evolution or of showing uncertainty and incompatibilities in evolutionary datasets. This is often done using unrooted phylogenetic networks such as split networks, due in part, to the availability of software (SplitsTree) for their computation and visualization. In this paper we discuss the problem of drawing rooted phylogenetic networks as cladograms or phylograms in a number of different views that are commonly used for rooted trees. Implementations of the algorithms are available in new releases of the Dendroscope and SplitsTree programs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The evolutionary history of a collection of species is usually represented by a phylogenetic tree. Sometimes, phylogenetic networks are used as a means of representing reticulate evolution or of showing uncertainty and incompatibilities in evolutionary datasets. This is often done using unrooted phylogenetic networks such as split networks, due in part, to the availability of software (SplitsTree) for their computation and visualization. In this paper we discuss the problem of drawing rooted phylogenetic networks as cladograms or phylograms in a number of different views that are commonly used for rooted trees. Implementations of the algorithms are available in new releases of the Dendroscope and SplitsTree programs.",
"title": "Drawing Rooted Phylogenetic Networks",
"normalizedTitle": "Drawing Rooted Phylogenetic Networks",
"fno": "ttb2009010103",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Rooted Phylogenetic Networks",
"Graph Drawing"
],
"authors": [
{
"givenName": "Daniel H.",
"surname": "Huson",
"fullName": "Daniel H. Huson",
"affiliation": "Tuebinge University, Tuebingen",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2009-01-01 00:00:00",
"pubType": "trans",
"pages": "103-109",
"year": "2009",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/csb/2005/2344/0/23440093",
"title": "Reconstructing Phylogenetic Networks Using Maximum Parsimony",
"doi": null,
"abstractUrl": "/proceedings-article/csb/2005/23440093/12OmNzV70qS",
"parentPublication": {
"id": "proceedings/csb/2005/2344/0",
"title": "Proceedings. 2005 IEEE Computational Systems Bioinformatics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2010/02/ttb2010020218",
"title": "A Metric on the Space of Reduced Phylogenetic Networks",
"doi": null,
"abstractUrl": "/journal/tb/2010/02/ttb2010020218/13rRUB7a1ee",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2018/01/07586129",
"title": "Nonbinary Tree-Based Phylogenetic Networks",
"doi": null,
"abstractUrl": "/journal/tb/2018/01/07586129/13rRUEgs2Kt",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2008/03/ttb2008030472",
"title": "Improved Layout of Phylogenetic Networks",
"doi": null,
"abstractUrl": "/journal/tb/2008/03/ttb2008030472/13rRUILLktY",
"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/2009/04/ttb2009040552",
"title": "Comparison of Tree-Child Phylogenetic Networks",
"doi": null,
"abstractUrl": "/journal/tb/2009/04/ttb2009040552/13rRUy2YLWG",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2004/01/n0013",
"title": "Phylogenetic Networks: Modeling, Reconstructibility, and Accuracy",
"doi": null,
"abstractUrl": "/journal/tb/2004/01/n0013/13rRUyY28WI",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2011/03/ttb2011030635",
"title": "A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks",
"doi": null,
"abstractUrl": "/journal/tb/2011/03/ttb2011030635/13rRUynHuht",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2012/01/ttb2012010150",
"title": "Matching Split Distance for Unrooted Binary Phylogenetic Trees",
"doi": null,
"abstractUrl": "/journal/tb/2012/01/ttb2012010150/13rRUytF47T",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2023/02/09804871",
"title": "Planar Rooted Phylogenetic Networks",
"doi": null,
"abstractUrl": "/journal/tb/2023/02/09804871/1ErlfIX7ZAs",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttb2009010097",
"articleId": "13rRUypp56a",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttb2009010110",
"articleId": "13rRUxASuLa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNySXEWS",
"title": "July/August",
"year": "2007",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "July/August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIJuxvd",
"doi": "10.1109/TVCG.2007.1024",
"abstract": "Abstract—Interactive visualization of architecture provides a way to quickly visualize existing or novel buildings and structures. Such applications require both fast rendering and an effortless input regimen for creating and changing architecture using high-level editing operations that automatically fill in the necessary details. Procedural modeling and synthesis is a powerful paradigm that yields high data amplification and can be coupled with fast-rendering techniques to quickly generate plausible details of a scene without much or any user interaction. Previously, forward generating procedural methods have been proposed where a procedure is explicitly created to generate particular content. In this paper, we present our work in inverse procedural modeling of buildings and describe how to use an extracted repertoire of building grammars to facilitate the visualization and quick modification of architectural structures and buildings. We demonstrate an interactive application where the user draws simple building blocks and, using our system, can automatically complete the building \"in the style of” other buildings using view-dependent texture mapping or nonphotorealistic rendering techniques. Our system supports an arbitrary number of building grammars created from user subdivided building models and captured photographs. Using only edit, copy, and paste metaphors, the entire building styles can be altered and transferred from one building to another in a few operations, enhancing the ability to modify an existing architectural structure or to visualize a novel building in the style of the others.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Interactive visualization of architecture provides a way to quickly visualize existing or novel buildings and structures. Such applications require both fast rendering and an effortless input regimen for creating and changing architecture using high-level editing operations that automatically fill in the necessary details. Procedural modeling and synthesis is a powerful paradigm that yields high data amplification and can be coupled with fast-rendering techniques to quickly generate plausible details of a scene without much or any user interaction. Previously, forward generating procedural methods have been proposed where a procedure is explicitly created to generate particular content. In this paper, we present our work in inverse procedural modeling of buildings and describe how to use an extracted repertoire of building grammars to facilitate the visualization and quick modification of architectural structures and buildings. We demonstrate an interactive application where the user draws simple building blocks and, using our system, can automatically complete the building \"in the style of” other buildings using view-dependent texture mapping or nonphotorealistic rendering techniques. Our system supports an arbitrary number of building grammars created from user subdivided building models and captured photographs. Using only edit, copy, and paste metaphors, the entire building styles can be altered and transferred from one building to another in a few operations, enhancing the ability to modify an existing architectural structure or to visualize a novel building in the style of the others.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Interactive visualization of architecture provides a way to quickly visualize existing or novel buildings and structures. Such applications require both fast rendering and an effortless input regimen for creating and changing architecture using high-level editing operations that automatically fill in the necessary details. Procedural modeling and synthesis is a powerful paradigm that yields high data amplification and can be coupled with fast-rendering techniques to quickly generate plausible details of a scene without much or any user interaction. Previously, forward generating procedural methods have been proposed where a procedure is explicitly created to generate particular content. In this paper, we present our work in inverse procedural modeling of buildings and describe how to use an extracted repertoire of building grammars to facilitate the visualization and quick modification of architectural structures and buildings. We demonstrate an interactive application where the user draws simple building blocks and, using our system, can automatically complete the building \"in the style of” other buildings using view-dependent texture mapping or nonphotorealistic rendering techniques. Our system supports an arbitrary number of building grammars created from user subdivided building models and captured photographs. Using only edit, copy, and paste metaphors, the entire building styles can be altered and transferred from one building to another in a few operations, enhancing the ability to modify an existing architectural structure or to visualize a novel building in the style of the others.",
"title": "Style Grammars for Interactive Visualization of Architecture",
"normalizedTitle": "Style Grammars for Interactive Visualization of Architecture",
"fno": "v0786",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Architectural CAD",
"Data Visualisation",
"Rendering Computer Graphics",
"Structural Engineering Computing",
"Interactive Visualization",
"Nonphotorealistic Rendering Techniques",
"Inverse Procedural Modeling",
"Building Grammars",
"Architectural Structures",
"View Dependent Texture Mapping",
"Photographs",
"Buildings",
"Power Generation",
"Layout",
"Rendering Computer Graphics",
"Computer Architecture",
"Computer Graphics",
"Data Visualization",
"Inverse Problems",
"Software Algorithms",
"Software Packages",
"Display Algorithms",
"Image Based Rendering",
"Modeling Packages",
"Visualization Systems And Software"
],
"authors": [
{
"givenName": "Daniel G.",
"surname": "Aliaga",
"fullName": "Daniel G. Aliaga",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Paul A.",
"surname": "Rosen",
"fullName": "Paul A. Rosen",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel R.",
"surname": "Bekins",
"fullName": "Daniel R. Bekins",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2007-07-01 00:00:00",
"pubType": "trans",
"pages": "786-797",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dimpvt/2011/4369/0/4369a304",
"title": "Procedural 3D Building Reconstruction Using Shape Grammars and Detectors",
"doi": null,
"abstractUrl": "/proceedings-article/3dimpvt/2011/4369a304/12OmNCwCLqd",
"parentPublication": {
"id": "proceedings/3dimpvt/2011/4369/0",
"title": "2011 International Conference on 3D Imaging, Modeling, Processing, Visualization and Transmission",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2013/2246/0/2246a004",
"title": "Deformation-Aware Split Grammars for Architectural Models",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2013/2246a004/12OmNvAiSFS",
"parentPublication": {
"id": "proceedings/cw/2013/2246/0",
"title": "2013 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2010/6984/0/05540068",
"title": "Segmentation of building facades using procedural shape priors",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2010/05540068/12OmNvjyxZf",
"parentPublication": {
"id": "proceedings/cvpr/2010/6984/0",
"title": "2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/svr/2015/7204/0/7204a075",
"title": "Split Grammar Evolution for Procedural Modeling of Virtual Buildings",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2015/7204a075/12OmNx2QUDr",
"parentPublication": {
"id": "proceedings/svr/2015/7204/0",
"title": "2015 XVII Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2017/2219/0/2219a031",
"title": "CAD Shape Grammar: Procedural Generation for Massive CAD Model",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2017/2219a031/12OmNy6qfJ2",
"parentPublication": {
"id": "proceedings/sibgrapi/2017/2219/0",
"title": "2017 30th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl/1994/6660/0/00363633",
"title": "Constraint multiset grammars",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1994/00363633/12OmNyxXlkh",
"parentPublication": {
"id": "proceedings/vl/1994/6660/0",
"title": "Proceedings of 1994 IEEE Symposium on Visual Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl/1993/3970/0/00269572",
"title": "Relational grammars for interactive design",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1993/00269572/12OmNzmtWyl",
"parentPublication": {
"id": "proceedings/vl/1993/3970/0",
"title": "Proceedings 1993 IEEE Symposium on Visual Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/04/v0798",
"title": "NPU-Based Image Compositing in a Distributed Visualization System",
"doi": null,
"abstractUrl": "/journal/tg/2007/04/v0798/13rRUwI5U2x",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2021/0337/0/033700a456",
"title": "Learning Highly Recursive Input Grammars",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2021/033700a456/1AjT214qFcA",
"parentPublication": {
"id": "proceedings/ase/2021/0337/0",
"title": "2021 36th IEEE/ACM International Conference on Automated Software Engineering (ASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a025",
"title": "Semantic-driven Visualization Techniques for Interactive Exploration of 3D Indoor Models",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a025/1cMFcgVrWk8",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0769",
"articleId": "13rRUyfbwqz",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0798",
"articleId": "13rRUwI5U2x",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwoxSj9",
"title": "April-June",
"year": "2020",
"issueNum": "02",
"idPrefix": "ta",
"pubType": "journal",
"volume": "11",
"label": "April-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwhHcPg",
"doi": "10.1109/TAFFC.2017.2775616",
"abstract": "State of the art brain-computer interfaces (BCIs) largely focus on detecting single, specific, often experimentally induced or manipulated aspects of the user state. In a less controlled, more naturalistic environment, a larger variety of mental processes may be active and possibly interacting. When moving BCI applications from the lab to real-life applications, these additional unaccounted mental processes could interfere with user state decoding, thus decreasing system efficacy and decreasing real-world applicability. Here, we assess the impact of affective valence on classification of working memory load, by re-analyzing a dataset that used an affective N-back task with picture stimuli. Our analyses showed that classification of working memory load under affective valence can lead to good classification accuracies (> 70 percent), which can be further improved via data integration over time. However, positive as well as negative affective valence resulted in decreased classification accuracies, when compared to the neutral affective context. Furthermore, classifiers failed to generalize across affective contexts, highlighting the need for user state models that can account for different contexts or new, context-independent, EEG features.",
"abstracts": [
{
"abstractType": "Regular",
"content": "State of the art brain-computer interfaces (BCIs) largely focus on detecting single, specific, often experimentally induced or manipulated aspects of the user state. In a less controlled, more naturalistic environment, a larger variety of mental processes may be active and possibly interacting. When moving BCI applications from the lab to real-life applications, these additional unaccounted mental processes could interfere with user state decoding, thus decreasing system efficacy and decreasing real-world applicability. Here, we assess the impact of affective valence on classification of working memory load, by re-analyzing a dataset that used an affective N-back task with picture stimuli. Our analyses showed that classification of working memory load under affective valence can lead to good classification accuracies (> 70 percent), which can be further improved via data integration over time. However, positive as well as negative affective valence resulted in decreased classification accuracies, when compared to the neutral affective context. Furthermore, classifiers failed to generalize across affective contexts, highlighting the need for user state models that can account for different contexts or new, context-independent, EEG features.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "State of the art brain-computer interfaces (BCIs) largely focus on detecting single, specific, often experimentally induced or manipulated aspects of the user state. In a less controlled, more naturalistic environment, a larger variety of mental processes may be active and possibly interacting. When moving BCI applications from the lab to real-life applications, these additional unaccounted mental processes could interfere with user state decoding, thus decreasing system efficacy and decreasing real-world applicability. Here, we assess the impact of affective valence on classification of working memory load, by re-analyzing a dataset that used an affective N-back task with picture stimuli. Our analyses showed that classification of working memory load under affective valence can lead to good classification accuracies (> 70 percent), which can be further improved via data integration over time. However, positive as well as negative affective valence resulted in decreased classification accuracies, when compared to the neutral affective context. Furthermore, classifiers failed to generalize across affective contexts, highlighting the need for user state models that can account for different contexts or new, context-independent, EEG features.",
"title": "Context Sensitivity of EEG-Based Workload Classification Under Different Affective Valence",
"normalizedTitle": "Context Sensitivity of EEG-Based Workload Classification Under Different Affective Valence",
"fno": "08118137",
"hasPdf": true,
"idPrefix": "ta",
"keywords": [
"Brain Computer Interfaces",
"Electroencephalography",
"Medical Signal Processing",
"Neurophysiology",
"Pattern Classification",
"Unaccounted Mental Processes",
"Brain Computer Interfaces",
"EEG Based Workload Classification",
"User State Models",
"Neutral Affective Context",
"N Back Task",
"Memory Load",
"BCI Applications",
"Electroencephalography",
"Brain Computer Interfaces",
"Adaptive Systems",
"Brain Computer Interface BCI",
"Electroencephalography EEG",
"Working Memory Load WML",
"Affective Valence VAL",
"Emoback"
],
"authors": [
{
"givenName": "Sebastian",
"surname": "Grissmann",
"fullName": "Sebastian Grissmann",
"affiliation": "LEAD Graduate School & Research Network, University of Tübingen, Tübingen, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Martin",
"surname": "Spüler",
"fullName": "Martin Spüler",
"affiliation": "Wilhelm-Schickard-Institute for Computer Science, University of Tübingen, Tübingen, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Josef",
"surname": "Faller",
"fullName": "Josef Faller",
"affiliation": "Laboratory for Intelligent Imaging and Neural Computing, Columbia University, New York, NY",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tanja",
"surname": "Krumpe",
"fullName": "Tanja Krumpe",
"affiliation": "Wilhelm-Schickard-Institute for Computer Science, University of Tübingen, Tübingen, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thorsten O.",
"surname": "Zander",
"fullName": "Thorsten O. Zander",
"affiliation": "Team PhyPA, Berlin Institute of Technology, Berlin, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Augustin",
"surname": "Kelava",
"fullName": "Augustin Kelava",
"affiliation": "Hector Research Institute of Education Science and Psychology, University of Tübingen, Tübingen, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christian",
"surname": "Scharinger",
"fullName": "Christian Scharinger",
"affiliation": "Leibniz-Institut für Wissensmedien, Tübingen, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter",
"surname": "Gerjets",
"fullName": "Peter Gerjets",
"affiliation": "Leibniz-Institut für Wissensmedien, Tübingen, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2020-04-01 00:00:00",
"pubType": "trans",
"pages": "327-334",
"year": "2020",
"issn": "1949-3045",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icmla/2016/6167/0/07838292",
"title": "Robust Modeling of Continuous 4-D Affective Space from EEG Recording",
"doi": null,
"abstractUrl": "/proceedings-article/icmla/2016/07838292/12OmNC2fGwi",
"parentPublication": {
"id": "proceedings/icmla/2016/6167/0",
"title": "2016 15th IEEE International Conference on Machine Learning and Applications (ICMLA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acsat/2015/0423/0/07478752",
"title": "EEG-based Emotion Recognition while Listening to Quran Recitation Compared with Relaxing Music Using Valence-Arousal Model",
"doi": null,
"abstractUrl": "/proceedings-article/acsat/2015/07478752/12OmNwE9Ow2",
"parentPublication": {
"id": "proceedings/acsat/2015/0423/0",
"title": "2015 4th International Conference on Advanced Computer Science Applications and Technologies (ACSAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2012/4814/0/4814a053",
"title": "EEG-based Valence Level Recognition for Real-Time Applications",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2012/4814a053/12OmNwp74MG",
"parentPublication": {
"id": "proceedings/cw/2012/4814/0",
"title": "2012 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2013/5048/0/5048a838",
"title": "Development of a Binary fMRI-BCI for Alzheimer Patients: A Semantic Conditioning Paradigm Using Affective Unconditioned Stimuli",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2013/5048a838/12OmNyFU78X",
"parentPublication": {
"id": "proceedings/acii/2013/5048/0",
"title": "2013 Humaine Association Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2014/4761/0/06890301",
"title": "Continuous emotion detection using EEG signals and facial expressions",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2014/06890301/12OmNyQYtb1",
"parentPublication": {
"id": "proceedings/icme/2014/4761/0",
"title": "2014 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2015/9953/0/07344552",
"title": "Identifying valence and arousal levels via connectivity between EEG channels",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2015/07344552/12OmNz5JBO6",
"parentPublication": {
"id": "proceedings/acii/2015/9953/0",
"title": "2015 International Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2013/5048/0/5048a707",
"title": "EEG-Enabled Affective Applications",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2013/5048a707/12OmNzw8j9T",
"parentPublication": {
"id": "proceedings/acii/2013/5048/0",
"title": "2013 Humaine Association Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2014/04/06866179",
"title": "Clustering Affective Qualities of Classical Music: Beyond the Valence-Arousal Plane",
"doi": null,
"abstractUrl": "/journal/ta/2014/04/06866179/13rRUEgarrm",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2020/01/08078217",
"title": "Affective Recognition in Dynamic and Interactive Virtual Environments",
"doi": null,
"abstractUrl": "/journal/ta/2020/01/08078217/13rRUILLktW",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2018/01/07588100",
"title": "Attention Recognition in EEG-Based Affective Learning Research Using CFS+KNN Algorithm",
"doi": null,
"abstractUrl": "/journal/tb/2018/01/07588100/13rRUy0qnCd",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08252762",
"articleId": "13rRUwhpBCr",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08074743",
"articleId": "13rRUxAStZm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNC8uRnt",
"title": "Sept.-Oct.",
"year": "2012",
"issueNum": "05",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "32",
"label": "Sept.-Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyg2jQ6",
"doi": "10.1109/MCG.2012.66",
"abstract": "Many programs have been designed to view the 3D structures of protein molecules in 2D. However, three types of linked information haven't been previously defined in a systematic way that highlights the interface design challenge. Specifically, a scientist must have sequence, structure, and homology information in working memory to manipulate and understand a protein structure or related protein structures. Categorizing information types enables the application of classical interaction principles to the design of an intuitive interface for both expert and novice users. In a comparative user evaluation, their Molli system enhances the exploratory process of manipulating proteins of varying complexity by preserving the underlying data's linkages and relations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Many programs have been designed to view the 3D structures of protein molecules in 2D. However, three types of linked information haven't been previously defined in a systematic way that highlights the interface design challenge. Specifically, a scientist must have sequence, structure, and homology information in working memory to manipulate and understand a protein structure or related protein structures. Categorizing information types enables the application of classical interaction principles to the design of an intuitive interface for both expert and novice users. In a comparative user evaluation, their Molli system enhances the exploratory process of manipulating proteins of varying complexity by preserving the underlying data's linkages and relations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Many programs have been designed to view the 3D structures of protein molecules in 2D. However, three types of linked information haven't been previously defined in a systematic way that highlights the interface design challenge. Specifically, a scientist must have sequence, structure, and homology information in working memory to manipulate and understand a protein structure or related protein structures. Categorizing information types enables the application of classical interaction principles to the design of an intuitive interface for both expert and novice users. In a comparative user evaluation, their Molli system enhances the exploratory process of manipulating proteins of varying complexity by preserving the underlying data's linkages and relations.",
"title": "Molli: Interactive Visualization for Exploratory Protein Analysis",
"normalizedTitle": "Molli: Interactive Visualization for Exploratory Protein Analysis",
"fno": "mcg2012050062",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Proteins",
"Three Dimensional Displays",
"Solid Modeling",
"Rendering Computer Graphics",
"Data Visualization",
"Biological System Modeling",
"Multiple Structure Alignment",
"Proteins",
"Three Dimensional Displays",
"Solid Modeling",
"Rendering Computer Graphics",
"Data Visualization",
"Biological System Modeling",
"Homology",
"Protein Structure",
"Protein Visualization",
"Coordinated Views"
],
"authors": [
{
"givenName": "Sara",
"surname": "Su",
"fullName": "Sara Su",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "C.",
"surname": "Gramazio",
"fullName": "C. Gramazio",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "D.",
"surname": "Extrum-Fernandez",
"fullName": "D. Extrum-Fernandez",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "C.",
"surname": "Crumm",
"fullName": "C. Crumm",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "L. J.",
"surname": "Cowen",
"fullName": "L. J. Cowen",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "M.",
"surname": "Menke",
"fullName": "M. Menke",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "M.",
"surname": "Strait",
"fullName": "M. Strait",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2012-09-01 00:00:00",
"pubType": "mags",
"pages": "62-69",
"year": "2012",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibm/2011/1799/0/06120403",
"title": "VASP-S: A Volumetric Analysis and Statistical Model for Predicting Steric Influences on Protein-Ligand Binding Specificity",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2011/06120403/12OmNrAMF30",
"parentPublication": {
"id": "proceedings/bibm/2011/1799/0",
"title": "2011 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icica/2014/3966/0/3966a184",
"title": "An Analytical Study of NP-Hard Protein Folding Problems",
"doi": null,
"abstractUrl": "/proceedings-article/icica/2014/3966a184/12OmNx8Ouyc",
"parentPublication": {
"id": "proceedings/icica/2014/3966/0",
"title": "2014 International Conference on Intelligent Computing Applications (ICICA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460906",
"title": "Protein structure similarity based on multi-view images generated from 3D molecular visualization",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460906/12OmNyp9MiK",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300077",
"title": "Interactive Protein Manipulation",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300077/12OmNzXFowr",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2014/06/06819461",
"title": "A Basic Protein Comparative Three-Dimensional Modeling Methodological Workflow Theory and Practice",
"doi": null,
"abstractUrl": "/journal/tb/2014/06/06819461/13rRUxYrbT6",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2019/02/08219359",
"title": "New Deep Learning Methods for Protein Loop Modeling",
"doi": null,
"abstractUrl": "/journal/tb/2019/02/08219359/13rRUy0qnEO",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2020/04/08528889",
"title": "Two New Heuristic Methods for Protein Model Quality Assessment",
"doi": null,
"abstractUrl": "/journal/tb/2020/04/08528889/17D45Xtvp83",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09995502",
"title": "Equivariant Encoding based GVAE (EqEn-GVAE) for Protein Tertiary Structure Generation",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995502/1JC1KNlVWUw",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/02/08794636",
"title": "A Novel Branch-and-Bound Algorithm for the Protein Folding Problem in the 3D HP Model",
"doi": null,
"abstractUrl": "/journal/tb/2021/02/08794636/1kepEjtvjMs",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/05/09512473",
"title": "Inferring Gene Co-Expression Networks by Incorporating Prior Protein-Protein Interaction Networks",
"doi": null,
"abstractUrl": "/journal/tb/2022/05/09512473/1w0wwLnnpAc",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2012050050",
"articleId": "13rRUyfbwt8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2012050070",
"articleId": "13rRUx0gecf",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNz2C1BC",
"title": "July",
"year": "2012",
"issueNum": "07",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvgz9L",
"doi": "10.1109/TVCG.2011.278",
"abstract": "In Virtual Reality, immersive systems such as the CAVE provide an important tool for the collaborative exploration of large 3D data. Unlike head-mounted displays, these systems are often only partially immersive due to space, access, or cost constraints. The resulting loss of visual information becomes a major obstacle for critical tasks that need to utilize the users' entire field of vision. We have developed a conformal visualization technique that establishes a conformal mapping between the full 360^\\circ field of view and the display geometry of a given visualization system. The mapping is provably angle-preserving and has the desirable property of preserving shapes locally, which is important for identifying shape-based features in the visual data. We apply the conformal visualization to both forward and backward rendering pipelines in a variety of retargeting scenarios, including CAVEs and angled arrangements of flat panel displays. In contrast to image-based retargeting approaches, our technique constructs accurate stereoscopic images that are free of resampling artifacts. Our user study shows that on the visual polyp detection task in Immersive Virtual Colonoscopy, conformal visualization leads to imprrenderingoved sensitivity at comparable examination times against the traditional rendering approach. We also develop a novel user interface based on the interactive recreation of the conformal mapping and the real-time regeneration of the view direction correspondence.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In Virtual Reality, immersive systems such as the CAVE provide an important tool for the collaborative exploration of large 3D data. Unlike head-mounted displays, these systems are often only partially immersive due to space, access, or cost constraints. The resulting loss of visual information becomes a major obstacle for critical tasks that need to utilize the users' entire field of vision. We have developed a conformal visualization technique that establishes a conformal mapping between the full 360^\\circ field of view and the display geometry of a given visualization system. The mapping is provably angle-preserving and has the desirable property of preserving shapes locally, which is important for identifying shape-based features in the visual data. We apply the conformal visualization to both forward and backward rendering pipelines in a variety of retargeting scenarios, including CAVEs and angled arrangements of flat panel displays. In contrast to image-based retargeting approaches, our technique constructs accurate stereoscopic images that are free of resampling artifacts. Our user study shows that on the visual polyp detection task in Immersive Virtual Colonoscopy, conformal visualization leads to imprrenderingoved sensitivity at comparable examination times against the traditional rendering approach. We also develop a novel user interface based on the interactive recreation of the conformal mapping and the real-time regeneration of the view direction correspondence.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In Virtual Reality, immersive systems such as the CAVE provide an important tool for the collaborative exploration of large 3D data. Unlike head-mounted displays, these systems are often only partially immersive due to space, access, or cost constraints. The resulting loss of visual information becomes a major obstacle for critical tasks that need to utilize the users' entire field of vision. We have developed a conformal visualization technique that establishes a conformal mapping between the full 360^\\circ field of view and the display geometry of a given visualization system. The mapping is provably angle-preserving and has the desirable property of preserving shapes locally, which is important for identifying shape-based features in the visual data. We apply the conformal visualization to both forward and backward rendering pipelines in a variety of retargeting scenarios, including CAVEs and angled arrangements of flat panel displays. In contrast to image-based retargeting approaches, our technique constructs accurate stereoscopic images that are free of resampling artifacts. Our user study shows that on the visual polyp detection task in Immersive Virtual Colonoscopy, conformal visualization leads to imprrenderingoved sensitivity at comparable examination times against the traditional rendering approach. We also develop a novel user interface based on the interactive recreation of the conformal mapping and the real-time regeneration of the view direction correspondence.",
"title": "Interactive Visibility Retargeting in VR Using Conformal Visualization",
"normalizedTitle": "Interactive Visibility Retargeting in VR Using Conformal Visualization",
"fno": "06086538",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Virtual Reality",
"Conformal Mapping",
"Data Visualisation",
"User Interfaces",
"Real Time Regeneration",
"Interactive Visibility",
"Virtual Reality",
"Visual Information",
"Conformal Visualization Technique",
"Conformal Mapping",
"Shape Based Features",
"Backward Rendering Pipelines",
"Forward Rendering Pipelines",
"Stereoscopic Images",
"Visual Polyp Detection Task",
"Immersive Virtual Colonoscopy",
"User Interface",
"Measurement",
"Data Visualization",
"Rendering Computer Graphics",
"Conformal Mapping",
"Geometry",
"Shape",
"Visualization",
"Partially Immersive",
"Virtual Reality",
"Conformal Visualization",
"Ricci Flow",
"GPU",
"Immersive Cabin",
"CAVE"
],
"authors": [
{
"givenName": null,
"surname": "Min Zhang",
"fullName": "Min Zhang",
"affiliation": "Dept. of Comput. Sci., Stony Brook Univ., Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "C.",
"surname": "Papadopoulos",
"fullName": "C. Papadopoulos",
"affiliation": "Dept. of Comput. Sci., Stony Brook Univ., Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "K.",
"surname": "Petkov",
"fullName": "K. Petkov",
"affiliation": "Dept. of Comput. Sci., Stony Brook Univ., Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "A. E.",
"surname": "Kaufman",
"fullName": "A. E. Kaufman",
"affiliation": "Dept. of Comput. Sci., Stony Brook Univ., Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Xianfeng Gu",
"fullName": "Xianfeng Gu",
"affiliation": "Dept. of Comput. Sci., Stony Brook Univ., Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2012-07-01 00:00:00",
"pubType": "trans",
"pages": "1027-1040",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/fg/2013/5545/0/06553749",
"title": "An automatic 3D expression recognition framework based on sparse representation of conformal images",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2013/06553749/12OmNC4eSAM",
"parentPublication": {
"id": "proceedings/fg/2013/5545/0",
"title": "2013 10th IEEE International Conference and Workshops on Automatic Face and Gesture Recognition (FG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisce/2015/6850/0/6850a645",
"title": "Calculation of Power Frequency Electric Field under Overhead Lines with Sloping Ground by Conformal Mapping",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2015/6850a645/12OmNCm7BKN",
"parentPublication": {
"id": "proceedings/icisce/2015/6850/0",
"title": "2015 2nd International Conference on Information Science and Control Engineering (ICISCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2011/0039/0/05759453",
"title": "Conformal visualization for partially-immersive platforms",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2011/05759453/12OmNqNosaO",
"parentPublication": {
"id": "proceedings/vr/2011/0039/0",
"title": "2011 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1993/3880/0/00341074",
"title": "Conformal transplantation of lightness to varying resolution sensors",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1993/00341074/12OmNs59JQL",
"parentPublication": {
"id": "proceedings/cvpr/1993/3880/0",
"title": "Proceedings of IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109b505",
"title": "Partial Face Biometry Using Shape Decomposition on 2D Conformal Maps of Faces",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109b505/12OmNvvtGY9",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1992/2720/0/00220261",
"title": "Real-time velocity feedback obstacle avoidance via complex variables and conformal mapping",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1992/00220261/12OmNx5YvjZ",
"parentPublication": {
"id": "proceedings/robot/1992/2720/0",
"title": "Proceedings 1992 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851c507",
"title": "Conformal Surface Alignment with Optimal Möbius Search",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851c507/12OmNzT7Osv",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2000/02/v0181",
"title": "Conformal Surface Parameterization for Texture Mapping",
"doi": null,
"abstractUrl": "/journal/tg/2000/02/v0181/13rRUxBJhFj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111928",
"title": "Conformal Magnifier: A Focus+Context Technique with Local Shape Preservation",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111928/13rRUxNmPDQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2014/02/mcg2014020072",
"title": "Beautiful Math, Part 3: Hyperbolic Aesthetic Patterns Based on Conformal Mappings",
"doi": null,
"abstractUrl": "/magazine/cg/2014/02/mcg2014020072/13rRUy3gn2J",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06081857",
"articleId": "13rRUwInvyu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06143941",
"articleId": "13rRUwjGoFY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAoDih4",
"title": "April",
"year": "2002",
"issueNum": "04",
"idPrefix": "tp",
"pubType": "journal",
"volume": "24",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygT7ge",
"doi": "10.1109/34.993558",
"abstract": "We present a novel approach to measuring similarity between shapes and exploit it for object recognition. In our framework, the measurement of similarity is preceded by 1) solving for correspondences between points on the two shapes, 2) using the correspondences to estimate an aligning transform. In order to solve the correspondence problem, we attach a descriptor, the shape context, to each point. The shape context at a reference point captures the distribution of the remaining points relative to it, thus offering a globally discriminative characterization. Corresponding points on two similar shapes will have similar shape contexts, enabling us to solve for correspondences as an optimal assignment problem. Given the point correspondences, we estimate the transformation that best aligns the two shapes; regularized thin-plate splines provide a flexible class of transformation maps for this purpose. The dissimilarity between the two shapes is computed as a sum of matching errors between corresponding points, together with a term measuring the magnitude of the aligning transform. We treat recognition in a nearest-neighbor classification framework as the problem of finding the stored prototype shape that is maximally similar to that in the image. Results are presented for silhouettes, trademarks, handwritten digits, and the COIL data set.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a novel approach to measuring similarity between shapes and exploit it for object recognition. In our framework, the measurement of similarity is preceded by 1) solving for correspondences between points on the two shapes, 2) using the correspondences to estimate an aligning transform. In order to solve the correspondence problem, we attach a descriptor, the shape context, to each point. The shape context at a reference point captures the distribution of the remaining points relative to it, thus offering a globally discriminative characterization. Corresponding points on two similar shapes will have similar shape contexts, enabling us to solve for correspondences as an optimal assignment problem. Given the point correspondences, we estimate the transformation that best aligns the two shapes; regularized thin-plate splines provide a flexible class of transformation maps for this purpose. The dissimilarity between the two shapes is computed as a sum of matching errors between corresponding points, together with a term measuring the magnitude of the aligning transform. We treat recognition in a nearest-neighbor classification framework as the problem of finding the stored prototype shape that is maximally similar to that in the image. Results are presented for silhouettes, trademarks, handwritten digits, and the COIL data set.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a novel approach to measuring similarity between shapes and exploit it for object recognition. In our framework, the measurement of similarity is preceded by 1) solving for correspondences between points on the two shapes, 2) using the correspondences to estimate an aligning transform. In order to solve the correspondence problem, we attach a descriptor, the shape context, to each point. The shape context at a reference point captures the distribution of the remaining points relative to it, thus offering a globally discriminative characterization. Corresponding points on two similar shapes will have similar shape contexts, enabling us to solve for correspondences as an optimal assignment problem. Given the point correspondences, we estimate the transformation that best aligns the two shapes; regularized thin-plate splines provide a flexible class of transformation maps for this purpose. The dissimilarity between the two shapes is computed as a sum of matching errors between corresponding points, together with a term measuring the magnitude of the aligning transform. We treat recognition in a nearest-neighbor classification framework as the problem of finding the stored prototype shape that is maximally similar to that in the image. Results are presented for silhouettes, trademarks, handwritten digits, and the COIL data set.",
"title": "Shape Matching and Object Recognition Using Shape Contexts",
"normalizedTitle": "Shape Matching and Object Recognition Using Shape Contexts",
"fno": "i0509",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Shape",
"Object Recognition",
"Digit Recognition",
"Correspondence Problem",
"MPEG 7",
"Image Registration",
"Deformable Templates"
],
"authors": [
{
"givenName": "S.",
"surname": "Belongie",
"fullName": "S. Belongie",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "J.",
"surname": "Malik",
"fullName": "J. Malik",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "J.",
"surname": "Puzicha",
"fullName": "J. Puzicha",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2002-04-01 00:00:00",
"pubType": "trans",
"pages": "509-522",
"year": "2002",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0495",
"articleId": "13rRUxBa57a",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0523",
"articleId": "13rRUyv53Gn",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvA1hs2",
"title": "Feb.",
"year": "2018",
"issueNum": "02",
"idPrefix": "tp",
"pubType": "journal",
"volume": "40",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUytWFas",
"doi": "10.1109/TPAMI.2017.2675980",
"abstract": "Digitally unwrapping images of paper sheets is crucial for accurate document scanning and text recognition. This paper presents a method for automatically rectifying curved or folded paper sheets from a few images captured from multiple viewpoints. Prior methods either need expensive 3D scanners or model deformable surfaces using over-simplified parametric representations. In contrast, our method uses regular images and is based on general developable surface models that can represent a wide variety of paper deformations. Our main contribution is a new robust rectification method based on ridge-aware 3D reconstruction of a paper sheet and unwrapping the reconstructed surface using properties of developable surfaces via Z_$\\ell _1$_Z conformal mapping. We present results on several examples including book pages, folded letters and shopping receipts.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Digitally unwrapping images of paper sheets is crucial for accurate document scanning and text recognition. This paper presents a method for automatically rectifying curved or folded paper sheets from a few images captured from multiple viewpoints. Prior methods either need expensive 3D scanners or model deformable surfaces using over-simplified parametric representations. In contrast, our method uses regular images and is based on general developable surface models that can represent a wide variety of paper deformations. Our main contribution is a new robust rectification method based on ridge-aware 3D reconstruction of a paper sheet and unwrapping the reconstructed surface using properties of developable surfaces via $\\ell _1$ conformal mapping. We present results on several examples including book pages, folded letters and shopping receipts.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Digitally unwrapping images of paper sheets is crucial for accurate document scanning and text recognition. This paper presents a method for automatically rectifying curved or folded paper sheets from a few images captured from multiple viewpoints. Prior methods either need expensive 3D scanners or model deformable surfaces using over-simplified parametric representations. In contrast, our method uses regular images and is based on general developable surface models that can represent a wide variety of paper deformations. Our main contribution is a new robust rectification method based on ridge-aware 3D reconstruction of a paper sheet and unwrapping the reconstructed surface using properties of developable surfaces via - conformal mapping. We present results on several examples including book pages, folded letters and shopping receipts.",
"title": "Multiview Rectification of Folded Documents",
"normalizedTitle": "Multiview Rectification of Folded Documents",
"fno": "07866848",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Surface Reconstruction",
"Three Dimensional Displays",
"Image Reconstruction",
"Robustness",
"Shape",
"Conformal Mapping",
"Electronic Mail",
"Robust Digitally Unwarpping",
"Ridge Aware Surface Reconstruction",
"Mobile Phone Friendly Algorithms"
],
"authors": [
{
"givenName": "Shaodi",
"surname": "You",
"fullName": "Shaodi You",
"affiliation": "Data61-CSIRO, Canberra, ACT, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yasuyuki",
"surname": "Matsushita",
"fullName": "Yasuyuki Matsushita",
"affiliation": "Osaka University, Suita, Osaka Prefecture, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sudipta",
"surname": "Sinha",
"fullName": "Sudipta Sinha",
"affiliation": "Microsoft Research, Redmond, WA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yusuke",
"surname": "Bou",
"fullName": "Yusuke Bou",
"affiliation": "Microsoft, Tokyo, 108-0075, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Katsushi",
"surname": "Ikeuchi",
"fullName": "Katsushi Ikeuchi",
"affiliation": "Microsoft Research Asia, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2018-02-01 00:00:00",
"pubType": "trans",
"pages": "505-511",
"year": "2018",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2013/2840/0/2840c632",
"title": "Geometric Registration Based on Distortion Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2013/2840c632/12OmNButq7h",
"parentPublication": {
"id": "proceedings/iccv/2013/2840/0",
"title": "2013 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-cg/2005/2473/0/24730238",
"title": "Five-Axis Flank Machining of Ruled Surfaces with Developable Surface Approximation",
"doi": null,
"abstractUrl": "/proceedings-article/cad-cg/2005/24730238/12OmNvAAtmg",
"parentPublication": {
"id": "proceedings/cad-cg/2005/2473/0",
"title": "Ninth International Conference on Computer Aided Design and Computer Graphics (CAD-CG'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457e560",
"title": "The Surfacing of Multiview 3D Drawings via Lofting and Occlusion Reasoning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457e560/12OmNvSbBzp",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2012/1226/0/256O2C02",
"title": "On template-based reconstruction from a single view: Analytical solutions and proofs of well-posedness for developable, isometric and conformal surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/256O2C02/12OmNx76TQA",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1990/2062/1/00118116",
"title": "Shape determination from intensity images-a new algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1990/00118116/12OmNy7h3bJ",
"parentPublication": {
"id": "proceedings/icpr/1990/2062/1",
"title": "Proceedings 10th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2009/3725/0/3725a226",
"title": "Locally Developable Constraint for Document Surface Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2009/3725a226/12OmNyrIaCe",
"parentPublication": {
"id": "proceedings/icdar/2009/3725/0",
"title": "2009 10th International Conference on Document Analysis and Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032f400",
"title": "Intrinsic 3D Dynamic Surface Tracking based on Dynamic Ricci Flow and Teichmüller Map",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032f400/12OmNyv7mb8",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2009/4442/0/05457426",
"title": "Posture invariant correspondence of triangular meshes in shape space",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2009/05457426/12OmNzVoBPz",
"parentPublication": {
"id": "proceedings/iccvw/2009/4442/0",
"title": "2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/euros&pw/2019/3026/0/302600a414",
"title": "Master of Sheets: A Tale of Compromised Cloud Documents",
"doi": null,
"abstractUrl": "/proceedings-article/euros&pw/2019/302600a414/1cJ7a2RkU2Q",
"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/cw/2019/2297/0/229700a155",
"title": "Realistic Folded Surface Modeling from Sketching",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2019/229700a155/1fHkotoz84w",
"parentPublication": {
"id": "proceedings/cw/2019/2297/0",
"title": "2019 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07888599",
"articleId": "13rRUEgarCH",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08249509",
"articleId": "13rRUEgs2Dd",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet2g",
"name": "ttp201802-07866848s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp201802-07866848s1.zip",
"extension": "zip",
"size": "4.49 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzaQoM9",
"title": "November/December",
"year": "2010",
"issueNum": "06",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "30",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUB6SpOa",
"doi": "10.1109/MCG.2009.154",
"abstract": "Developing visualization applications is nontrivial and poses special challenges. This is because typical visualization software processes a large amount of data, resulting in large and sometimes very complex data structures. Traditional debugging tools have limited use because they decouple the information they report from the spatiotemporal domain in which unexpected problems occur. This article presents a set of guidelines specifically for debugging visualization software. The guidelines come from experience in developing applications in both industry and research. The key is to exploit the strengths of computer graphics and visualization, while still using good software development practices.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Developing visualization applications is nontrivial and poses special challenges. This is because typical visualization software processes a large amount of data, resulting in large and sometimes very complex data structures. Traditional debugging tools have limited use because they decouple the information they report from the spatiotemporal domain in which unexpected problems occur. This article presents a set of guidelines specifically for debugging visualization software. The guidelines come from experience in developing applications in both industry and research. The key is to exploit the strengths of computer graphics and visualization, while still using good software development practices.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Developing visualization applications is nontrivial and poses special challenges. This is because typical visualization software processes a large amount of data, resulting in large and sometimes very complex data structures. Traditional debugging tools have limited use because they decouple the information they report from the spatiotemporal domain in which unexpected problems occur. This article presents a set of guidelines specifically for debugging visualization software. The guidelines come from experience in developing applications in both industry and research. The key is to exploit the strengths of computer graphics and visualization, while still using good software development practices.",
"title": "Using Visualization to Debug Visualization Software",
"normalizedTitle": "Using Visualization to Debug Visualization Software",
"fno": "mcg2010060067",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Guidelines",
"Computer Bugs",
"Software Debugging",
"Data Visualization",
"Application Software",
"Computer Graphics",
"Software Algorithms",
"Computer Science",
"Data Structures",
"Programming Profession",
"Graphics And Multimedia",
"Computing Methodologies",
"Computer Graphics",
"Methodology And Techniques",
"Computer Graphics Applications"
],
"authors": [
{
"givenName": "Robert",
"surname": "Laramee",
"fullName": "Robert Laramee",
"affiliation": "University of Wales, Swansea , Swansea, Wales",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2010-11-01 00:00:00",
"pubType": "mags",
"pages": "67-73",
"year": "2010",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/compsac/2013/4986/0/4986a633",
"title": "Isolating and Understanding Program Errors Using Probabilistic Dispute Model",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2013/4986a633/12OmNApLGQC",
"parentPublication": {
"id": "proceedings/compsac/2013/4986/0",
"title": "2013 IEEE 37th Annual Computer Software and Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vissoft/2015/7526/0/07332412",
"title": "Vestige: A visualization framework for engineering geometry-related software",
"doi": null,
"abstractUrl": "/proceedings-article/vissoft/2015/07332412/12OmNBBQZoB",
"parentPublication": {
"id": "proceedings/vissoft/2015/7526/0",
"title": "2015 IEEE 3rd Working Conference on Software Visualization (VISSOFT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icst/2017/6031/0/07983292",
"title": "Debugging Multithreaded Programs Using Symbolic Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icst/2017/07983292/12OmNyQphdR",
"parentPublication": {
"id": "proceedings/icst/2017/6031/0",
"title": "2017 IEEE International Conference on Software Testing, Verification and Validation (ICST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-c/2017/1589/0/07965318",
"title": "How Developers Debug Software — The DBGBENCH Dataset",
"doi": null,
"abstractUrl": "/proceedings-article/icse-c/2017/07965318/12OmNyxXljJ",
"parentPublication": {
"id": "proceedings/icse-c/2017/1589/0",
"title": "2017 IEEE/ACM 39th International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlhcc/2017/0443/0/08103457",
"title": "TraceDiff: Debugging unexpected code behavior using trace divergences",
"doi": null,
"abstractUrl": "/proceedings-article/vlhcc/2017/08103457/17D45XeKgx3",
"parentPublication": {
"id": "proceedings/vlhcc/2017/0443/0",
"title": "2017 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/irc/2019/9245/0/924500a086",
"title": "VizRob: Effective Visualizations to Debug Robotic Behaviors",
"doi": null,
"abstractUrl": "/proceedings-article/irc/2019/924500a086/18M7exGNTWw",
"parentPublication": {
"id": "proceedings/irc/2019/9245/0",
"title": "2019 Third IEEE International Conference on Robotic Computing (IRC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-seis/2022/9594/0/959400a090",
"title": "How to Debug Inclusivity Bugs? A Debugging Process with Information Architecture",
"doi": null,
"abstractUrl": "/proceedings-article/icse-seis/2022/959400a090/1EmrhU2EkcE",
"parentPublication": {
"id": "proceedings/icse-seis/2022/9594/0",
"title": "2022 IEEE/ACM 44th International Conference on Software Engineering: Software Engineering in Society (ICSE-SEIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-companion/2019/1764/0/176400a194",
"title": "Improving the Software Logging Practices in DevOps",
"doi": null,
"abstractUrl": "/proceedings-article/icse-companion/2019/176400a194/1cJ7oqx4ri8",
"parentPublication": {
"id": "proceedings/icse-companion/2019/1764/0",
"title": "2019 IEEE/ACM 41st International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2020/6768/0/676800a907",
"title": "On the Effectiveness of Unified Debugging: An Extensive Study on 16 Program Repair Systems",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2020/676800a907/1pP3IGGU5IA",
"parentPublication": {
"id": "proceedings/ase/2020/6768/0",
"title": "2020 35th IEEE/ACM International Conference on Automated Software Engineering (ASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ser&ip/2021/4476/0/447600a037",
"title": "What we can learn from how programmers debug their code",
"doi": null,
"abstractUrl": "/proceedings-article/ser&ip/2021/447600a037/1v2QjtQwspy",
"parentPublication": {
"id": "proceedings/ser&ip/2021/4476/0",
"title": "2021 IEEE/ACM 8th International Workshop on Software Engineering Research and Industrial Practice (SER&IP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2010060054",
"articleId": "13rRUzpzeHJ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2010060074",
"articleId": "13rRUwjXZMh",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNB8Cj4z",
"title": "September/October",
"year": "2001",
"issueNum": "05",
"idPrefix": "so",
"pubType": "magazine",
"volume": "18",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwcS1wL",
"doi": "10.1109/52.951498",
"abstract": "The reuse of accepted software solutions that have proven to be usable is one of the key concepts of modern and successful software development. This contribution focuses on the reuse of good design and presents an approach that is based on over 10 years of experience. Like most modern methods, this approach relies on so-called frameworks and design patterns—technical aids typically used in the heart of software labs. The approach presented here, however, goes much further in that it completely integrates frameworks and design patterns into the developmental process, where they have proven to be an excellent way to improve user participation throughout the developmental life cycle. Moreover, it even becomes possible to determine which units are suitable for reuse by a high degree of user participation thus achieving the aim of reusing \"good design.\" Finally, these concepts provide elegant methods for adapting application systems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The reuse of accepted software solutions that have proven to be usable is one of the key concepts of modern and successful software development. This contribution focuses on the reuse of good design and presents an approach that is based on over 10 years of experience. Like most modern methods, this approach relies on so-called frameworks and design patterns—technical aids typically used in the heart of software labs. The approach presented here, however, goes much further in that it completely integrates frameworks and design patterns into the developmental process, where they have proven to be an excellent way to improve user participation throughout the developmental life cycle. Moreover, it even becomes possible to determine which units are suitable for reuse by a high degree of user participation thus achieving the aim of reusing \"good design.\" Finally, these concepts provide elegant methods for adapting application systems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The reuse of accepted software solutions that have proven to be usable is one of the key concepts of modern and successful software development. This contribution focuses on the reuse of good design and presents an approach that is based on over 10 years of experience. Like most modern methods, this approach relies on so-called frameworks and design patterns—technical aids typically used in the heart of software labs. The approach presented here, however, goes much further in that it completely integrates frameworks and design patterns into the developmental process, where they have proven to be an excellent way to improve user participation throughout the developmental life cycle. Moreover, it even becomes possible to determine which units are suitable for reuse by a high degree of user participation thus achieving the aim of reusing \"good design.\" Finally, these concepts provide elegant methods for adapting application systems.",
"title": "Design Reuse through Frameworks and Patterns",
"normalizedTitle": "Design Reuse through Frameworks and Patterns",
"fno": "s5071",
"hasPdf": true,
"idPrefix": "so",
"keywords": [
"Keywords Software Development",
"Metaphor",
"Software Architecture",
"Interaction Design",
"Office Computing",
"Participatory Design",
"Design Pattern",
"Usability Engineering"
],
"authors": [
{
"givenName": "Peter W.",
"surname": "Fach",
"fullName": "Peter W. Fach",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2001-09-01 00:00:00",
"pubType": "mags",
"pages": "71-76",
"year": "2001",
"issn": "0740-7459",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "s5062",
"articleId": "13rRUwjXZQf",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "s5077",
"articleId": "13rRUypp55J",
"__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": "13rRUyuegoZ",
"doi": "10.1109/TVCG.2006.158",
"abstract": "Computer-aided diagnosis (CAD) is a helpful addition to laborious visual inspection for preselection of suspected colonic polyps in virtual colonoscopy. Most of the previous work on automatic polyp detection makes use of indicators based on the scalar curvature of the colon wall and can result in many false-positive detections. Our work tries to reduce the number of false-positive detections in the preselection of polyp candidates. Polyp surface shape can be characterized and visualized using lines of curvature. In this paper, we describe techniques for generating and rendering lines of curvature on surfaces and we show that these lines can be used as part of a polyp detection approach. We have adapted existing approaches on explicit triangular surface meshes, and developed a new algorithm on implicit surfaces embedded in 3D volume data. The visualization of shaded colonic surfaces can be enhanced by rendering the derived lines of curvature on these surfaces. Features strongly correlated with true-positive detections were calculated on lines of curvature and used for the polyp candidate selection. We studied the performance of these features on 5 data sets that included 331 pre-detected candidates, of which 50 sites were true polyps. The winding angle had a significant discriminating power for true-positive detections, which was demonstrated by a Wilcoxon rank sum test with p<0.001. The median winding angle and inter-quartile range (IQR) for true polyps were 7.817 and 6.770-9.288 compared to 2.954 and 1.995-3.749 for false-positive detections.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Computer-aided diagnosis (CAD) is a helpful addition to laborious visual inspection for preselection of suspected colonic polyps in virtual colonoscopy. Most of the previous work on automatic polyp detection makes use of indicators based on the scalar curvature of the colon wall and can result in many false-positive detections. Our work tries to reduce the number of false-positive detections in the preselection of polyp candidates. Polyp surface shape can be characterized and visualized using lines of curvature. In this paper, we describe techniques for generating and rendering lines of curvature on surfaces and we show that these lines can be used as part of a polyp detection approach. We have adapted existing approaches on explicit triangular surface meshes, and developed a new algorithm on implicit surfaces embedded in 3D volume data. The visualization of shaded colonic surfaces can be enhanced by rendering the derived lines of curvature on these surfaces. Features strongly correlated with true-positive detections were calculated on lines of curvature and used for the polyp candidate selection. We studied the performance of these features on 5 data sets that included 331 pre-detected candidates, of which 50 sites were true polyps. The winding angle had a significant discriminating power for true-positive detections, which was demonstrated by a Wilcoxon rank sum test with p<0.001. The median winding angle and inter-quartile range (IQR) for true polyps were 7.817 and 6.770-9.288 compared to 2.954 and 1.995-3.749 for false-positive detections.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Computer-aided diagnosis (CAD) is a helpful addition to laborious visual inspection for preselection of suspected colonic polyps in virtual colonoscopy. Most of the previous work on automatic polyp detection makes use of indicators based on the scalar curvature of the colon wall and can result in many false-positive detections. Our work tries to reduce the number of false-positive detections in the preselection of polyp candidates. Polyp surface shape can be characterized and visualized using lines of curvature. In this paper, we describe techniques for generating and rendering lines of curvature on surfaces and we show that these lines can be used as part of a polyp detection approach. We have adapted existing approaches on explicit triangular surface meshes, and developed a new algorithm on implicit surfaces embedded in 3D volume data. The visualization of shaded colonic surfaces can be enhanced by rendering the derived lines of curvature on these surfaces. Features strongly correlated with true-positive detections were calculated on lines of curvature and used for the polyp candidate selection. We studied the performance of these features on 5 data sets that included 331 pre-detected candidates, of which 50 sites were true polyps. The winding angle had a significant discriminating power for true-positive detections, which was demonstrated by a Wilcoxon rank sum test with p<0.001. The median winding angle and inter-quartile range (IQR) for true polyps were 7.817 and 6.770-9.288 compared to 2.954 and 1.995-3.749 for false-positive detections.",
"title": "Lines of Curvature for Polyp Detection in Virtual Colonoscopy",
"normalizedTitle": "Lines of Curvature for Polyp Detection in Virtual Colonoscopy",
"fno": "v0885",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Colonic Polyps",
"Virtual Colonoscopy",
"Colon",
"Data Visualization",
"Colonography",
"Shape",
"Cancer",
"Biomedical Imaging",
"Medical Diagnostic Imaging",
"Computer Aided Diagnosis",
"Implicit Surface",
"Medical Visualization",
"Virtual Colonoscopy",
"Polyp Detection",
"Line Of Curvature"
],
"authors": [
{
"givenName": "Lingxiao",
"surname": "Zhao",
"fullName": "Lingxiao Zhao",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Charl",
"surname": "Botha",
"fullName": "Charl Botha",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Javier",
"surname": "Bescos",
"fullName": "Javier Bescos",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Roel",
"surname": "Truyen",
"fullName": "Roel Truyen",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Frans",
"surname": "Vos",
"fullName": "Frans Vos",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Frits",
"surname": "Post",
"fullName": "Frits Post",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "trans",
"pages": "885-892",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ibica/2012/2838/0/06337653",
"title": "An Automatic Colonic Polyp Type Identification System by Narrow-Band Imaging and Focal Zone Features of Vascular Shapes and Patterns",
"doi": null,
"abstractUrl": "/proceedings-article/ibica/2012/06337653/12OmNAS9zAo",
"parentPublication": {
"id": "proceedings/ibica/2012/2838/0",
"title": "2012 Third International Conference on Innovations in Bio-Inspired Computing and Applications (IBICA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2004/2173/0/21730159",
"title": "Interactive Polyp Biopsy based on Automatic Segmentation of Virtual Colonoscopy",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2004/21730159/12OmNAtst5z",
"parentPublication": {
"id": "proceedings/bibe/2004/2173/0",
"title": "Fourth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'04)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04760992",
"title": "Matching colonic polyps from prone and supine CT colonography scans based on statistical curvature information",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04760992/12OmNqzu6IB",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icraect/2017/6701/0/6701a005",
"title": "Principal Curvature Based Polyp Detection in Wireless Capsule Endoscopy Images",
"doi": null,
"abstractUrl": "/proceedings-article/icraect/2017/6701a005/12OmNwGZNGI",
"parentPublication": {
"id": "proceedings/icraect/2017/6701/0",
"title": "2017 International Conference on Recent Advances in Electronics and Communication Technology (ICRAECT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2017/4662/0/08388684",
"title": "Automatic colon polyp detection using Convolutional encoder-decoder model",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2017/08388684/12OmNyq0zLR",
"parentPublication": {
"id": "proceedings/isspit/2017/4662/0",
"title": "2017 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532806",
"title": "Teniae coli guided navigation and registration for virtual colonoscopy",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532806/12OmNzUPpfH",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v0861",
"title": "A Pipeline for Computer Aided Polyp Detection",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v0861/13rRUIJuxpp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2022/9062/0/09956700",
"title": "Cooperation of Boundary Attention and Negative Matrix L1 Regularization Loss Function for Polyp Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2022/09956700/1IHqCApt4lO",
"parentPublication": {
"id": "proceedings/icpr/2022/9062/0",
"title": "2022 26th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2020/9228/0/922800a706",
"title": "Colorectal Polyp Detection in Real-world Scenario: Design and Experiment Study",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2020/922800a706/1pP3u5LHq2A",
"parentPublication": {
"id": "proceedings/ictai/2020/9228/0",
"title": "2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ecie/2021/1869/0/186900a211",
"title": "Polyp Detection in CT Colonography based on Online Learning",
"doi": null,
"abstractUrl": "/proceedings-article/ecie/2021/186900a211/1sXnSnAJ0oU",
"parentPublication": {
"id": "proceedings/ecie/2021/1869/0",
"title": "2021 International Conference on Electronics, Circuits and Information Engineering (ECIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0877",
"articleId": "13rRUytF41r",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0893",
"articleId": "13rRUx0xPmS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBfIhaQ",
"title": "July-Aug.",
"year": "2012",
"issueNum": "04",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "32",
"label": "July-Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUzp02qv",
"doi": "10.1109/MCG.2012.75",
"abstract": "An interactive framework prepares raw computed-tomography and magnetic-resonance-imaging scans for courtroom presentations. The framework makes use of combined computer graphics and computer vision techniques to enable a forensic case analysis workflow.",
"abstracts": [
{
"abstractType": "Regular",
"content": "An interactive framework prepares raw computed-tomography and magnetic-resonance-imaging scans for courtroom presentations. The framework makes use of combined computer graphics and computer vision techniques to enable a forensic case analysis workflow.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "An interactive framework prepares raw computed-tomography and magnetic-resonance-imaging scans for courtroom presentations. The framework makes use of combined computer graphics and computer vision techniques to enable a forensic case analysis workflow.",
"title": "Forensic-Case Analysis: From 3D Imaging to Interactive Visualization",
"normalizedTitle": "Forensic-Case Analysis: From 3D Imaging to Interactive Visualization",
"fno": "mcg2012040079",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Visual Analytics",
"Three Dimensional Displays",
"Interactive Systems",
"Computed Tomography",
"Magnetic Resonance Imaging",
"Forensics",
"Computer Graphics",
"Visual Analytics",
"Three Dimensional Displays",
"Interactive Systems",
"Computed Tomography",
"Magnetic Resonance Imaging",
"Forensics",
"3 D Segmentation",
"Computed Tomography",
"Magnetic Resonance Imaging",
"3 D Rendering",
"3 D Forensics"
],
"authors": [
{
"givenName": "Martin",
"surname": "Urschler",
"fullName": "Martin Urschler",
"affiliation": "Ludwig Boltzmann Institute for Clinical Forensic Imaging",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alexander",
"surname": "Bornik",
"fullName": "Alexander Bornik",
"affiliation": "Ludwig Boltzmann Institute for Clinical Forensic Imaging",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eva",
"surname": "Scheurer",
"fullName": "Eva Scheurer",
"affiliation": "Ludwig Boltzmann Institute for Clinical Forensic Imaging",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kathrin",
"surname": "Yen",
"fullName": "Kathrin Yen",
"affiliation": "Heidelberg University Hospital",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Horst",
"surname": "Bischof",
"fullName": "Horst Bischof",
"affiliation": "Graz University of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dieter",
"surname": "Schmalstieg",
"fullName": "Dieter Schmalstieg",
"affiliation": "Graz University of Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2012-07-01 00:00:00",
"pubType": "mags",
"pages": "79-87",
"year": "2012",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ichit/2008/3328/0/3328a466",
"title": "Network Forensic Analysis Using Visualization Effect",
"doi": null,
"abstractUrl": "/proceedings-article/ichit/2008/3328a466/12OmNvk7JNF",
"parentPublication": {
"id": "proceedings/ichit/2008/3328/0",
"title": "2008 International Conference on Convergence and Hybrid Information Technology (ICHIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2013/5051/0/5051a093",
"title": "Parallel Coordinates Visualization of Large Data Investigation on HDDs",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2013/5051a093/12OmNvkpkUw",
"parentPublication": {
"id": "proceedings/cgiv/2013/5051/0",
"title": "2013 10th International Conference Computer Graphics, Imaging and Visualization (CGIV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isa/2008/3126/0/3126a248",
"title": "Detection of Hidden Information in Forensic Tools",
"doi": null,
"abstractUrl": "/proceedings-article/isa/2008/3126a248/12OmNwlZu1z",
"parentPublication": {
"id": "proceedings/isa/2008/3126/0",
"title": "2008 International Conference on Information Security and Assurance (ISA '08)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ares/2009/3564/0/3564a995",
"title": "Enhancement of Forensic Computing Investigations through Memory Forensic Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/ares/2009/3564a995/12OmNwtn3u6",
"parentPublication": {
"id": "proceedings/ares/2009/3564/0",
"title": "2009 International Conference on Availability, Reliability and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2007/2928/0/29280148",
"title": "Interactive 3D Forensic Visualisation: Virtual Interactive Prototype",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2007/29280148/12OmNx0A7GK",
"parentPublication": {
"id": "proceedings/cgiv/2007/2928/0",
"title": "Computer Graphics, Imaging and Visualisation (CGIV 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fgcn/2008/3431/2/3431b283",
"title": "A Methodology for Forensic Analysis of Embedded Systems",
"doi": null,
"abstractUrl": "/proceedings-article/fgcn/2008/3431b283/12OmNyo1nNq",
"parentPublication": {
"id": "proceedings/fgcn/2008/3431/1",
"title": "Future Generation Communication and Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asea/2008/3432/0/3432a241",
"title": "A Forensic Investigation for Suspects",
"doi": null,
"abstractUrl": "/proceedings-article/asea/2008/3432a241/12OmNzVXNYu",
"parentPublication": {
"id": "proceedings/asea/2008/3432/0",
"title": "Advanced Software Engineering and Its Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2021/0126/0/09669644",
"title": "Deep CNN-Based Computer-Aided Diagnosis for Drowning Detection using Post-mortem Lungs CT Images",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2021/09669644/1A9VdYH4ube",
"parentPublication": {
"id": "proceedings/bibm/2021/0126/0",
"title": "2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2022/9007/0/900700a442",
"title": "Preoperative Image Segmentation for Organ Visualization Using Augmented Reality Technology During Open Liver Surgery",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2022/900700a442/1KaH0Cb2h9K",
"parentPublication": {
"id": "proceedings/iv/2022/9007/0",
"title": "2022 26th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2021/4121/0/412100a166",
"title": "3D Deep Learning for Anatomical Structure Segmentation in Multiple Imaging Modalities",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2021/412100a166/1vb8NkLk1gc",
"parentPublication": {
"id": "proceedings/cbms/2021/4121/0",
"title": "2021 IEEE 34th International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2012040068",
"articleId": "13rRUxjyX6u",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2012040088",
"articleId": "13rRUypp5al",
"__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": "13rRUIJuxpp",
"doi": "10.1109/TVCG.2006.112",
"abstract": "We present a novel pipeline for computer-aided detection (CAD) of colonic polyps by integrating texture and shape analysis with volume rendering and conformal colon flattening. Using our automatic method, the 3D polyp detection problem is converted into a 2D pattern recognition problem. The colon surface is first segmented and extracted from the CT data set of the patient's abdomen, which is then mapped to a 2D rectangle using conformal mapping. This flattened image is rendered using a direct volume rendering technique with a translucent electronic biopsy transfer function. The polyps are detected by a 2D clustering method on the flattened image. The false positives are further reduced by analyzing the volumetric shape and texture features. Compared with shape based methods, our method is much more efficient without the need of computing curvature and other shape parameters for the whole colon surface. The final detection results are stored in the 2D image, which can be easily incorporated into a virtual colonoscopy (VC) system to highlight the polyp locations. The extracted colon surface mesh can be used to accelerate the volumetric ray casting algorithm used to generate the VC endoscopic view. The proposed automatic CAD pipeline is incorporated into an interactive VC system, with a goal of helping radiologists detect polyps faster and with higher accuracy.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a novel pipeline for computer-aided detection (CAD) of colonic polyps by integrating texture and shape analysis with volume rendering and conformal colon flattening. Using our automatic method, the 3D polyp detection problem is converted into a 2D pattern recognition problem. The colon surface is first segmented and extracted from the CT data set of the patient's abdomen, which is then mapped to a 2D rectangle using conformal mapping. This flattened image is rendered using a direct volume rendering technique with a translucent electronic biopsy transfer function. The polyps are detected by a 2D clustering method on the flattened image. The false positives are further reduced by analyzing the volumetric shape and texture features. Compared with shape based methods, our method is much more efficient without the need of computing curvature and other shape parameters for the whole colon surface. The final detection results are stored in the 2D image, which can be easily incorporated into a virtual colonoscopy (VC) system to highlight the polyp locations. The extracted colon surface mesh can be used to accelerate the volumetric ray casting algorithm used to generate the VC endoscopic view. The proposed automatic CAD pipeline is incorporated into an interactive VC system, with a goal of helping radiologists detect polyps faster and with higher accuracy.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a novel pipeline for computer-aided detection (CAD) of colonic polyps by integrating texture and shape analysis with volume rendering and conformal colon flattening. Using our automatic method, the 3D polyp detection problem is converted into a 2D pattern recognition problem. The colon surface is first segmented and extracted from the CT data set of the patient's abdomen, which is then mapped to a 2D rectangle using conformal mapping. This flattened image is rendered using a direct volume rendering technique with a translucent electronic biopsy transfer function. The polyps are detected by a 2D clustering method on the flattened image. The false positives are further reduced by analyzing the volumetric shape and texture features. Compared with shape based methods, our method is much more efficient without the need of computing curvature and other shape parameters for the whole colon surface. The final detection results are stored in the 2D image, which can be easily incorporated into a virtual colonoscopy (VC) system to highlight the polyp locations. The extracted colon surface mesh can be used to accelerate the volumetric ray casting algorithm used to generate the VC endoscopic view. The proposed automatic CAD pipeline is incorporated into an interactive VC system, with a goal of helping radiologists detect polyps faster and with higher accuracy.",
"title": "A Pipeline for Computer Aided Polyp Detection",
"normalizedTitle": "A Pipeline for Computer Aided Polyp Detection",
"fno": "v0861",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Pipelines",
"Colonic Polyps",
"Shape",
"Colon",
"Virtual Colonoscopy",
"Colonography",
"Rendering Computer Graphics",
"Image Converters",
"Pattern Recognition",
"Image Segmentation",
"Volume Rendering",
"Computer Aided Detection",
"Virtual Colonoscopy",
"Texture Analysis"
],
"authors": [
{
"givenName": "Wei",
"surname": "Hong",
"fullName": "Wei Hong",
"affiliation": "Department of Computer Science, Stony Brook University, Stony Brook, NY",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Feng",
"surname": "Qiu",
"fullName": "Feng Qiu",
"affiliation": "Department of Computer Science, Stony Brook University, Stony Brook, NY",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Arie",
"surname": "kaufman",
"fullName": "Arie kaufman",
"affiliation": "Department of Computer Science, Stony Brook University, Stony Brook, NY",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "trans",
"pages": "861-868",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2008/2174/0/04760969",
"title": "Detection of anatomical landmarks in human colon from computed tomographic colonography images",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04760969/12OmNC8MsH2",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04760992",
"title": "Matching colonic polyps from prone and supine CT colonography scans based on statistical curvature information",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04760992/12OmNqzu6IB",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04760993",
"title": "Thin layer tissue classification for electronic cleansing of CT colonography data",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04760993/12OmNwMFMm0",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2017/4662/0/08388684",
"title": "Automatic colon polyp detection using Convolutional encoder-decoder model",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2017/08388684/12OmNyq0zLR",
"parentPublication": {
"id": "proceedings/isspit/2017/4662/0",
"title": "2017 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532806",
"title": "Teniae coli guided navigation and registration for virtual colonoscopy",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532806/12OmNzUPpfH",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v0885",
"title": "Lines of Curvature for Polyp Detection in Virtual Colonoscopy",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v0885/13rRUyuegoZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2018/7568/0/08642748",
"title": "Colon Polyp Segmentation Using Texture Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2018/08642748/17QjJcqkF4B",
"parentPublication": {
"id": "proceedings/isspit/2018/7568/0",
"title": "2018 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800e695",
"title": "Augmenting Colonoscopy Using Extended and Directional CycleGAN for Lossy Image Translation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800e695/1m3o8Getc4w",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2020/9228/0/922800a706",
"title": "Colorectal Polyp Detection in Real-world Scenario: Design and Experiment Study",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2020/922800a706/1pP3u5LHq2A",
"parentPublication": {
"id": "proceedings/ictai/2020/9228/0",
"title": "2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ecie/2021/1869/0/186900a211",
"title": "Polyp Detection in CT Colonography based on Online Learning",
"doi": null,
"abstractUrl": "/proceedings-article/ecie/2021/186900a211/1sXnSnAJ0oU",
"parentPublication": {
"id": "proceedings/ecie/2021/1869/0",
"title": "2021 International Conference on Electronics, Circuits and Information Engineering (ECIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0853",
"articleId": "13rRUxlgy3t",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0869",
"articleId": "13rRUIJuxpq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04P",
"title": "May",
"year": "2016",
"issueNum": "05",
"idPrefix": "tm",
"pubType": "journal",
"volume": "15",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjQyw8",
"doi": "10.1109/TMC.2015.2451639",
"abstract": "One of the major applications of wireless sensor networks (WSNs) is the navigation service for emergency evacuation, the goal of which is to assist people in escaping from a hazardous region safely and quickly when an emergency occurs. Most existing solutions focus on finding the safest path for each person, while ignoring possible large detours and congestions caused by plenty of people rushing to the exit. In this paper, we present CANS, a C ongestion-Adaptive and small stretch emergency Navigation algorithm with WSNs. Specifically, CANS leverages the idea of level set method to track the evolution of the exit and the boundary of the hazardous area, so that people nearby the hazardous area achieve a mild congestion at the cost of a slight detour, while people distant from the danger avoid unnecessary detours. CANS also considers the situation in the event of emergency dynamics by incorporating a local yet simple status updating scheme. To the best of our knowledge, CANS is the first WSN-assisted emergency navigation algorithm achieving both mild congestion and small stretch, where all operations are in-situ carried out by cyber-physical interactions among people and sensor nodes. CANS does not require location information, nor the reliance on any particular communication model. It is also distributed and scalable to the size of the network with limited storage on each node. Both experiments and simulations validate the effectiveness and efficiency of CANS.",
"abstracts": [
{
"abstractType": "Regular",
"content": "One of the major applications of wireless sensor networks (WSNs) is the navigation service for emergency evacuation, the goal of which is to assist people in escaping from a hazardous region safely and quickly when an emergency occurs. Most existing solutions focus on finding the safest path for each person, while ignoring possible large detours and congestions caused by plenty of people rushing to the exit. In this paper, we present CANS, a C ongestion-Adaptive and small stretch emergency Navigation algorithm with WSNs. Specifically, CANS leverages the idea of level set method to track the evolution of the exit and the boundary of the hazardous area, so that people nearby the hazardous area achieve a mild congestion at the cost of a slight detour, while people distant from the danger avoid unnecessary detours. CANS also considers the situation in the event of emergency dynamics by incorporating a local yet simple status updating scheme. To the best of our knowledge, CANS is the first WSN-assisted emergency navigation algorithm achieving both mild congestion and small stretch, where all operations are in-situ carried out by cyber-physical interactions among people and sensor nodes. CANS does not require location information, nor the reliance on any particular communication model. It is also distributed and scalable to the size of the network with limited storage on each node. Both experiments and simulations validate the effectiveness and efficiency of CANS.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "One of the major applications of wireless sensor networks (WSNs) is the navigation service for emergency evacuation, the goal of which is to assist people in escaping from a hazardous region safely and quickly when an emergency occurs. Most existing solutions focus on finding the safest path for each person, while ignoring possible large detours and congestions caused by plenty of people rushing to the exit. In this paper, we present CANS, a C ongestion-Adaptive and small stretch emergency Navigation algorithm with WSNs. Specifically, CANS leverages the idea of level set method to track the evolution of the exit and the boundary of the hazardous area, so that people nearby the hazardous area achieve a mild congestion at the cost of a slight detour, while people distant from the danger avoid unnecessary detours. CANS also considers the situation in the event of emergency dynamics by incorporating a local yet simple status updating scheme. To the best of our knowledge, CANS is the first WSN-assisted emergency navigation algorithm achieving both mild congestion and small stretch, where all operations are in-situ carried out by cyber-physical interactions among people and sensor nodes. CANS does not require location information, nor the reliance on any particular communication model. It is also distributed and scalable to the size of the network with limited storage on each node. Both experiments and simulations validate the effectiveness and efficiency of CANS.",
"title": "CANS: Towards Congestion-Adaptive and Small Stretch Emergency Navigation with Wireless Sensor Networks",
"normalizedTitle": "CANS: Towards Congestion-Adaptive and Small Stretch Emergency Navigation with Wireless Sensor Networks",
"fno": "07145456",
"hasPdf": true,
"idPrefix": "tm",
"keywords": [
"Level Set",
"Hazardous Areas",
"Navigation",
"Wireless Sensor Networks",
"Roads",
"Level Set Method",
"Emergency Navigation",
"WSN Assisted",
"Congestion Adaptive",
"Small Stretch",
"Level Set Method",
"Emergency Navigation",
"WSN Assisted",
"Congestion Adaptive",
"Small Stretch"
],
"authors": [
{
"givenName": "Chen",
"surname": "Wang",
"fullName": "Chen Wang",
"affiliation": "School of Electronic Information and Communications, Huazhong University of Science and Technology, Wuhan, P.R. China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongzhi",
"surname": "Lin",
"fullName": "Hongzhi Lin",
"affiliation": "School of Electronic Information and Communications, Huazhong University of Science and Technology, Wuhan, P.R. China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongbo",
"surname": "Jiang",
"fullName": "Hongbo Jiang",
"affiliation": "School of Electronic Information and Communications, Huazhong University of Science and Technology, Wuhan, P.R. China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2016-05-01 00:00:00",
"pubType": "trans",
"pages": "1077-1089",
"year": "2016",
"issn": "1536-1233",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icoip/2010/4252/1/4252a509",
"title": "Evaluation Emergency Transport Performances in Response for Hazardous Materials Road Transportation Accident Based on SPN: A Case of Jiangsu",
"doi": null,
"abstractUrl": "/proceedings-article/icoip/2010/4252a509/12OmNBIFmsB",
"parentPublication": {
"id": "proceedings/icoip/2010/4252/2",
"title": "Optoelectronics and Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mmit/2008/3556/0/3556a442",
"title": "A Novel Application of WebGIS in Intelligent Emergency Response System",
"doi": null,
"abstractUrl": "/proceedings-article/mmit/2008/3556a442/12OmNC3o516",
"parentPublication": {
"id": "proceedings/mmit/2008/3556/0",
"title": "MultiMedia and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dese/2011/4593/0/4593a318",
"title": "Intelligent Navigation of Emergency Vehicles",
"doi": null,
"abstractUrl": "/proceedings-article/dese/2011/4593a318/12OmNwcUjPt",
"parentPublication": {
"id": "proceedings/dese/2011/4593/0",
"title": "2011 Developments in E-systems Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isuc/2008/3433/0/3433a079",
"title": "Indoor Emergency Evacuation Service on Autonomous Navigation System using Mobile Phone",
"doi": null,
"abstractUrl": "/proceedings-article/isuc/2008/3433a079/12OmNwdtwbq",
"parentPublication": {
"id": "proceedings/isuc/2008/3433/0",
"title": "2008 Second International Symposium on Universal Communication",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percomw/2015/8425/0/07134088",
"title": "Emergency support system with directional extensions",
"doi": null,
"abstractUrl": "/proceedings-article/percomw/2015/07134088/12OmNxGj9Kq",
"parentPublication": {
"id": "proceedings/percomw/2015/8425/0",
"title": "2015 IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1992/2720/0/00220333",
"title": "HAZBOT: a hazardous materials emergency response mobile robot",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1992/00220333/12OmNxVlTEe",
"parentPublication": {
"id": "proceedings/robot/1992/2720/0",
"title": "Proceedings 1992 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gocict/2015/2314/0/2314a104",
"title": "An Agent Based Simulation Model Applied to Emergency Vehicles in High Traffic Urban Environments",
"doi": null,
"abstractUrl": "/proceedings-article/gocict/2015/2314a104/12OmNzmclvo",
"parentPublication": {
"id": "proceedings/gocict/2015/2314/0",
"title": "2015 Annual Global Online Conference on Information and Computer Technology (GOCICT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2006/07/r7055",
"title": "Wireless Sensor Networks for Emergency Navigation",
"doi": null,
"abstractUrl": "/magazine/co/2006/07/r7055/13rRUwgyOgi",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2017/04/07506055",
"title": "SEND: A Situation-Aware Emergency Navigation Algorithm with Sensor Networks",
"doi": null,
"abstractUrl": "/journal/tm/2017/04/07506055/13rRUx0xPJj",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsn-w/2021/3950/0/395000a055",
"title": "Certifying Emergency Landing for Safe Urban UAV",
"doi": null,
"abstractUrl": "/proceedings-article/dsn-w/2021/395000a055/1vNjB52RjJS",
"parentPublication": {
"id": "proceedings/dsn-w/2021/3950/0",
"title": "2021 51st Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops (DSN-W)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07159083",
"articleId": "13rRUxC0SWV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07445933",
"articleId": "13rRUwhpBOA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBqMDkj",
"title": "September/October",
"year": "2000",
"issueNum": "05",
"idPrefix": "ex",
"pubType": "magazine",
"volume": "15",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUzpQPPO",
"doi": "10.1109/5254.889108",
"abstract": "This article describes Shoslif, an appearance-based approach for vision-system-based control. The state-based learning method presented in this article is applicable to virtually any vision-based control problem. The authors use navigation as an example. The authors have applied this approach to Shoslif-N, a prototype navigation system for environments that are not fully predictable before the system design. Such an application requires that the system is trainable at the application sites for various driving conditions. So, for human designers to predefine the visual features that the navigation system will use is impractical. Shoslif-N uses a learning-based method to automatically derive, during training, the visual features that are best suited for the navigation task. It then uses these features to organize and store the information learned through its navigation experience. Furthermore, the authors explain why a system state is important for navigation and how to incorporate the state into the appearance-based framework. System states let the system use both local and global views for navigation. So, the system can disregard unrelated scene parts according to the visual context and achieve better generalization. The state-based navigation system is trained interactively, incrementally, online, in real time. A general-purpose workstation performs the real-time computation, without any special-purpose image-processing hardware. The authors have successfully tested the system in a relatively extensive indoor environment along an extended navigation course, in the presence of passers-by.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This article describes Shoslif, an appearance-based approach for vision-system-based control. The state-based learning method presented in this article is applicable to virtually any vision-based control problem. The authors use navigation as an example. The authors have applied this approach to Shoslif-N, a prototype navigation system for environments that are not fully predictable before the system design. Such an application requires that the system is trainable at the application sites for various driving conditions. So, for human designers to predefine the visual features that the navigation system will use is impractical. Shoslif-N uses a learning-based method to automatically derive, during training, the visual features that are best suited for the navigation task. It then uses these features to organize and store the information learned through its navigation experience. Furthermore, the authors explain why a system state is important for navigation and how to incorporate the state into the appearance-based framework. System states let the system use both local and global views for navigation. So, the system can disregard unrelated scene parts according to the visual context and achieve better generalization. The state-based navigation system is trained interactively, incrementally, online, in real time. A general-purpose workstation performs the real-time computation, without any special-purpose image-processing hardware. The authors have successfully tested the system in a relatively extensive indoor environment along an extended navigation course, in the presence of passers-by.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This article describes Shoslif, an appearance-based approach for vision-system-based control. The state-based learning method presented in this article is applicable to virtually any vision-based control problem. The authors use navigation as an example. The authors have applied this approach to Shoslif-N, a prototype navigation system for environments that are not fully predictable before the system design. Such an application requires that the system is trainable at the application sites for various driving conditions. So, for human designers to predefine the visual features that the navigation system will use is impractical. Shoslif-N uses a learning-based method to automatically derive, during training, the visual features that are best suited for the navigation task. It then uses these features to organize and store the information learned through its navigation experience. Furthermore, the authors explain why a system state is important for navigation and how to incorporate the state into the appearance-based framework. System states let the system use both local and global views for navigation. So, the system can disregard unrelated scene parts according to the visual context and achieve better generalization. The state-based navigation system is trained interactively, incrementally, online, in real time. A general-purpose workstation performs the real-time computation, without any special-purpose image-processing hardware. The authors have successfully tested the system in a relatively extensive indoor environment along an extended navigation course, in the presence of passers-by.",
"title": "Visual Learning with Navigation as an Example",
"normalizedTitle": "Visual Learning with Navigation as an Example",
"fno": "x5063",
"hasPdf": true,
"idPrefix": "ex",
"keywords": [
"Autonomous Navigation",
"Feature Derivation",
"Sensorimotor Control",
"Supervised Learning",
"Unstructured Environment"
],
"authors": [
{
"givenName": "Juyang",
"surname": "Weng",
"fullName": "Juyang Weng",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shaoyun",
"surname": "Chen",
"fullName": "Shaoyun Chen",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2000-09-01 00:00:00",
"pubType": "mags",
"pages": "63-71",
"year": "2000",
"issn": "1541-1672",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "x5056",
"articleId": "13rRUxASulV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "x5072",
"articleId": "13rRUwI5TTA",
"__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": "13rRUwjGoG0",
"doi": "10.1109/TVCG.2012.269",
"abstract": "This paper introduces a new feature analysis and visualization method for multifield datasets. Our approach applies a surface-centric model to characterize salient features and form an effective, schematic representation of the data. We propose a simple, geometrically motivated, multifield feature definition. This definition relies on an iterative algorithm that applies existing theory of skeleton derivation to fuse the structures from the constitutive fields into a coherent data description, while addressing noise and spurious details. This paper also presents a new method for non-rigid surface registration between the surfaces of consecutive time steps. This matching is used in conjunction with clustering to discover the interaction patterns between the different fields and their evolution over time. We document the unified visual analysis achieved by our method in the context of several multifield problems from large-scale time-varying simulations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper introduces a new feature analysis and visualization method for multifield datasets. Our approach applies a surface-centric model to characterize salient features and form an effective, schematic representation of the data. We propose a simple, geometrically motivated, multifield feature definition. This definition relies on an iterative algorithm that applies existing theory of skeleton derivation to fuse the structures from the constitutive fields into a coherent data description, while addressing noise and spurious details. This paper also presents a new method for non-rigid surface registration between the surfaces of consecutive time steps. This matching is used in conjunction with clustering to discover the interaction patterns between the different fields and their evolution over time. We document the unified visual analysis achieved by our method in the context of several multifield problems from large-scale time-varying simulations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper introduces a new feature analysis and visualization method for multifield datasets. Our approach applies a surface-centric model to characterize salient features and form an effective, schematic representation of the data. We propose a simple, geometrically motivated, multifield feature definition. This definition relies on an iterative algorithm that applies existing theory of skeleton derivation to fuse the structures from the constitutive fields into a coherent data description, while addressing noise and spurious details. This paper also presents a new method for non-rigid surface registration between the surfaces of consecutive time steps. This matching is used in conjunction with clustering to discover the interaction patterns between the different fields and their evolution over time. We document the unified visual analysis achieved by our method in the context of several multifield problems from large-scale time-varying simulations.",
"title": "Surface-Based Structure Analysis and Visualization for Multifield Time-Varying Datasets",
"normalizedTitle": "Surface-Based Structure Analysis and Visualization for Multifield Time-Varying Datasets",
"fno": "ttg2012122392",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Iterative Methods",
"Data Visualisation",
"Large Scale Time Varying Simulation",
"Surface Based Structure Analysis",
"Multifield Time Varying Dataset Visualization",
"Feature Analysis",
"Surface Centric Model",
"Salient Feature",
"Multifield Feature Definition",
"Iterative Algorithm",
"Nonrigid Surface Registration",
"Visual Analysis",
"Feature Extraction",
"Correlation",
"Data Visualization",
"Shape Analysis",
"Context Awareness",
"Surface Structures",
"Multifield",
"Time Varying"
],
"authors": [
{
"givenName": "S. S.",
"surname": "Barakat",
"fullName": "S. S. Barakat",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "M.",
"surname": "Rutten",
"fullName": "M. Rutten",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "X.",
"surname": "Tricoche",
"fullName": "X. Tricoche",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2392-2401",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icicta/2009/3804/3/3804c172",
"title": "Comparison of Stochastic Response Surface Method and Response Surface Method for Structure Reliability Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2009/3804c172/12OmNwnYFXp",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rvsp/2011/4581/0/4581a110",
"title": "Model-Following Control of Single-Phase Inverters Using Time-Varying Sliding Surface",
"doi": null,
"abstractUrl": "/proceedings-article/rvsp/2011/4581a110/12OmNxVDuTG",
"parentPublication": {
"id": "proceedings/rvsp/2011/4581/0",
"title": "International Conference on Robot, Vision and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2014/4261/0/4261a662",
"title": "Obliquely Incidence Scattering by an Anisotropic Impedance Wedge: Surface Waves and the Diffraction of the Surface Waves",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2014/4261a662/12OmNxb5hul",
"parentPublication": {
"id": "proceedings/isdea/2014/4261/0",
"title": "2014 Fifth International Conference on Intelligent Systems Design and Engineering Applications (ISDEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "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": "trans/tp/2017/05/07469384",
"title": "Hyperbolic Harmonic Mapping for Surface Registration",
"doi": null,
"abstractUrl": "/journal/tp/2017/05/07469384/13rRUwd9CHh",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/06035704",
"title": "Inference-Based Surface Reconstruction of Cluttered Environments",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/06035704/13rRUwj7cp9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1990/09/i0833",
"title": "Inferring Surface Trace and Differential Structure from 3-D Images",
"doi": null,
"abstractUrl": "/journal/tp/1990/09/i0833/13rRUx0geqR",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061267",
"title": "Time and Streak Surfaces for Flow Visualization in Large Time-Varying Data Sets",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061267/13rRUxBa5bM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/02/ttg2011020182",
"title": "Relation-Aware Isosurface Extraction in Multifield Data",
"doi": null,
"abstractUrl": "/journal/tg/2011/02/ttg2011020182/13rRUyfKIHF",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2009/03/mcg2009030085",
"title": "Linking Multidimensional Feature Space Cluster Visualization to Multifield Surface Extraction",
"doi": null,
"abstractUrl": "/magazine/cg/2009/03/mcg2009030085/13rRUzphDsu",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012122382",
"articleId": "13rRUxly8SV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122402",
"articleId": "13rRUyY28Yu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFu7",
"name": "ttg2012122392s1.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012122392s1.mov",
"extension": "mov",
"size": "13.4 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAZx8OB",
"title": "Sept.-Oct.",
"year": "2018",
"issueNum": "05",
"idPrefix": "tb",
"pubType": "journal",
"volume": "15",
"label": "Sept.-Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "14dcEdLb3x2",
"doi": "10.1109/TCBB.2017.2731849",
"abstract": "Several anatomical magnetic resonance imaging (MRI) markers for Alzheimer's disease (AD) have been identified. Cortical gray matter volume, cortical thickness, and subcortical volume have been used successfully to assist the diagnosis of Alzheimer's disease including its early warning and developing stages, e.g., mild cognitive impairment (MCI) including MCI converted to AD (MCIc) and MCI not converted to AD (MCInc). Currently, these anatomical MRI measures have mainly been used separately. Thus, the full potential of anatomical MRI scans for AD diagnosis might not yet have been used optimally. Meanwhile, most studies currently only focused on morphological features of regions of interest (ROIs) or interregional features without considering the combination of them. To further improve the diagnosis of AD, we propose a novel approach of extracting ROI features and interregional features based on multiple measures from MRI images to distinguish AD, MCI (including MCIc and MCInc), and health control (HC). First, we construct six individual networks based on six different anatomical measures (i.e., CGMV, CT, CSA, CC, CFI, and SV) and Automated Anatomical Labeling (AAL) atlas for each subject. Then, for each individual network, we extract all node (ROI) features and edge (interregional) features, and denoted as node feature set and edge feature set, respectively. Therefore, we can obtain six node feature sets and six edge feature sets from six different anatomical measures. Next, each feature within a feature set is ranked by <inline-formula><tex-math notation=\"LaTeX\">Z_$F$_Z</tex-math></inline-formula>-score in descending order, and the top ranked features of each feature set are applied to MKBoost algorithm to obtain the best classification accuracy. After obtaining the best classification accuracy, we can get the optimal feature subset and the corresponding classifier for each node or edge feature set. Afterwards, to investigate the classification performance with only node features, we proposed a weighted multiple kernel learning (wMKL) framework to combine these six optimal node feature subsets, and obtain a combined classifier to perform AD classification. Similarly, we can obtain the classification performance with only edge features. Finally, we combine both six optimal node feature subsets and six optimal edge feature subsets to further improve the classification performance. Experimental results show that the proposed method outperforms some state-of-the-art methods in AD classification, and demonstrate that different measures contain complementary information.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Several anatomical magnetic resonance imaging (MRI) markers for Alzheimer's disease (AD) have been identified. Cortical gray matter volume, cortical thickness, and subcortical volume have been used successfully to assist the diagnosis of Alzheimer's disease including its early warning and developing stages, e.g., mild cognitive impairment (MCI) including MCI converted to AD (MCIc) and MCI not converted to AD (MCInc). Currently, these anatomical MRI measures have mainly been used separately. Thus, the full potential of anatomical MRI scans for AD diagnosis might not yet have been used optimally. Meanwhile, most studies currently only focused on morphological features of regions of interest (ROIs) or interregional features without considering the combination of them. To further improve the diagnosis of AD, we propose a novel approach of extracting ROI features and interregional features based on multiple measures from MRI images to distinguish AD, MCI (including MCIc and MCInc), and health control (HC). First, we construct six individual networks based on six different anatomical measures (i.e., CGMV, CT, CSA, CC, CFI, and SV) and Automated Anatomical Labeling (AAL) atlas for each subject. Then, for each individual network, we extract all node (ROI) features and edge (interregional) features, and denoted as node feature set and edge feature set, respectively. Therefore, we can obtain six node feature sets and six edge feature sets from six different anatomical measures. Next, each feature within a feature set is ranked by <inline-formula><tex-math notation=\"LaTeX\">$F$</tex-math><alternatives> <inline-graphic xlink:href=\"wang-ieq1-2731849.gif\"/></alternatives></inline-formula>-score in descending order, and the top ranked features of each feature set are applied to MKBoost algorithm to obtain the best classification accuracy. After obtaining the best classification accuracy, we can get the optimal feature subset and the corresponding classifier for each node or edge feature set. Afterwards, to investigate the classification performance with only node features, we proposed a weighted multiple kernel learning (wMKL) framework to combine these six optimal node feature subsets, and obtain a combined classifier to perform AD classification. Similarly, we can obtain the classification performance with only edge features. Finally, we combine both six optimal node feature subsets and six optimal edge feature subsets to further improve the classification performance. Experimental results show that the proposed method outperforms some state-of-the-art methods in AD classification, and demonstrate that different measures contain complementary information.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Several anatomical magnetic resonance imaging (MRI) markers for Alzheimer's disease (AD) have been identified. Cortical gray matter volume, cortical thickness, and subcortical volume have been used successfully to assist the diagnosis of Alzheimer's disease including its early warning and developing stages, e.g., mild cognitive impairment (MCI) including MCI converted to AD (MCIc) and MCI not converted to AD (MCInc). Currently, these anatomical MRI measures have mainly been used separately. Thus, the full potential of anatomical MRI scans for AD diagnosis might not yet have been used optimally. Meanwhile, most studies currently only focused on morphological features of regions of interest (ROIs) or interregional features without considering the combination of them. To further improve the diagnosis of AD, we propose a novel approach of extracting ROI features and interregional features based on multiple measures from MRI images to distinguish AD, MCI (including MCIc and MCInc), and health control (HC). First, we construct six individual networks based on six different anatomical measures (i.e., CGMV, CT, CSA, CC, CFI, and SV) and Automated Anatomical Labeling (AAL) atlas for each subject. Then, for each individual network, we extract all node (ROI) features and edge (interregional) features, and denoted as node feature set and edge feature set, respectively. Therefore, we can obtain six node feature sets and six edge feature sets from six different anatomical measures. Next, each feature within a feature set is ranked by --score in descending order, and the top ranked features of each feature set are applied to MKBoost algorithm to obtain the best classification accuracy. After obtaining the best classification accuracy, we can get the optimal feature subset and the corresponding classifier for each node or edge feature set. Afterwards, to investigate the classification performance with only node features, we proposed a weighted multiple kernel learning (wMKL) framework to combine these six optimal node feature subsets, and obtain a combined classifier to perform AD classification. Similarly, we can obtain the classification performance with only edge features. Finally, we combine both six optimal node feature subsets and six optimal edge feature subsets to further improve the classification performance. Experimental results show that the proposed method outperforms some state-of-the-art methods in AD classification, and demonstrate that different measures contain complementary information.",
"title": "Improving Alzheimer's Disease Classification by Combining Multiple Measures",
"normalizedTitle": "Improving Alzheimer's Disease Classification by Combining Multiple Measures",
"fno": "07990572",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Magnetic Resonance Imaging",
"Feature Extraction",
"Computed Tomography",
"Dementia",
"Kernel",
"Surface Reconstruction",
"Alzheimers Disease",
"Anatomical MRI",
"Multiple Measures",
"Multiple Kernel Learning",
"Classification"
],
"authors": [
{
"givenName": "Jin",
"surname": "Liu",
"fullName": "Jin Liu",
"affiliation": "School of Information Science and Engineering, Central South University, Changsha, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jianxin",
"surname": "Wang",
"fullName": "Jianxin Wang",
"affiliation": "School of Information Science and Engineering, Central South University, Changsha, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhenjun",
"surname": "Tang",
"fullName": "Zhenjun Tang",
"affiliation": "School of Computer Science and Information Technology, Guangxi Normal University, Guilin, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bin",
"surname": "Hu",
"fullName": "Bin Hu",
"affiliation": "School of Information Science and Engineering, Lanzhou University, Lanzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fang-Xiang",
"surname": "Wu",
"fullName": "Fang-Xiang Wu",
"affiliation": "Division of Biomedical Engineering and Department of Mechanical Engineering, University of Saskatchewan, Saskatoon, SK, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yi",
"surname": "Pan",
"fullName": "Yi Pan",
"affiliation": "Department of Computer Science, Georgia State University, Atlanta, GA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2018-09-01 00:00:00",
"pubType": "trans",
"pages": "1649-1659",
"year": "2018",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ichi/2017/4881/0/4881a547",
"title": "Diagnosis on Mild Cognitive Impairment Patients for Alzheimer Disease with Missing Data",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2017/4881a547/12OmNxGALhR",
"parentPublication": {
"id": "proceedings/ichi/2017/4881/0",
"title": "2017 IEEE International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2018/02/07765123",
"title": "Classification of Alzheimer's Disease Using Whole Brain Hierarchical Network",
"doi": null,
"abstractUrl": "/journal/tb/2018/02/07765123/13rRUEgs2Al",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mu/2022/02/09729422",
"title": "Multimodal Fusion-Based Deep Learning Network for Effective Diagnosis of Alzheimer’s Disease",
"doi": null,
"abstractUrl": "/magazine/mu/2022/02/09729422/1Bya7rcGbNC",
"parentPublication": {
"id": "mags/mu",
"title": "IEEE MultiMedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ichi/2022/6845/0/684500a550",
"title": "Racial Disparities in Alzheimer's Disease and Alzheimer's Disease-Related Dementias from the Disease Progression Perspective",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2022/684500a550/1GvdzUKWPAI",
"parentPublication": {
"id": "proceedings/ichi/2022/6845/0",
"title": "2022 IEEE 10th International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2022/8487/0/848700a168",
"title": "Multi-Modal Deep Learning Models for Alzheimer's Disease Prediction Using MRI and EHR",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2022/848700a168/1J6hJbUkXV6",
"parentPublication": {
"id": "proceedings/bibe/2022/8487/0",
"title": "2022 IEEE 22nd International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icrss/2022/6403/0/640300a064",
"title": "Diagnosis of Alzheimer's disease based on logistic regression algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/icrss/2022/640300a064/1M2MlQWepYA",
"parentPublication": {
"id": "proceedings/icrss/2022/6403/0",
"title": "2022 International Conference on Computing, Robotics and System Sciences (ICRSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbd/2019/5141/0/514100a309",
"title": "Mild Cognitive Impairment Identification Based on Multi-View Graph Convolutional Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cbd/2019/514100a309/1fw1Ous3z6o",
"parentPublication": {
"id": "proceedings/cbd/2019/5141/0",
"title": "2019 Seventh International Conference on Advanced Cloud and Big Data (CBD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2020/1331/0/09102776",
"title": "S3F: A Multi-View Slow-Fast Network For Alzheimer’s Disease Diagnosis",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2020/09102776/1kwrdsckWYM",
"parentPublication": {
"id": "proceedings/icme/2020/1331/0",
"title": "2020 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciev-&-icivpr/2020/9331/0/09306649",
"title": "Alzheimer's Disease Prediction Using Convolutional Neural Network Models Leveraging Pre-existing Architecture and Transfer Learning",
"doi": null,
"abstractUrl": "/proceedings-article/iciev-&-icivpr/2020/09306649/1qcieBtxlcs",
"parentPublication": {
"id": "proceedings/iciev-&-icivpr/2020/9331/0",
"title": "2020 Joint 9th International Conference on Informatics, Electronics & Vision (ICIEV) and 2020 4th International Conference on Imaging, Vision & Pattern Recognition (icIVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdh/2020/9234/0/923400a288",
"title": "Alzheimer’s Disease Classification Based on One Dimensional Convolutional Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2020/923400a288/1uGXW1uOyhG",
"parentPublication": {
"id": "proceedings/icdh/2020/9234/0",
"title": "2020 8th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08063914",
"articleId": "14dcDYMpxVX",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08006238",
"articleId": "14dcEibWLrw",
"__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": "13rRUwcS1CN",
"doi": "10.1109/TVCG.2006.199",
"abstract": "Vortices are undesirable in many applications while indispensable in others. It is therefore of common interest to understand their mechanisms of creation. This paper aims at analyzing the transport of vorticity inside incompressible flow. The analysis is based on the vorticity equation and is performed along pathlines which are typically started in upstream direction from vortex regions. Different methods for the quantitative and explorative analysis of vorticity transport are presented and applied to CFD simulations of water turbines. Simulation quality is accounted for by including the errors of meshing and convergence into analysis and visualization. The obtained results are discussed and interpretations with respect to engineering questions are given.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Vortices are undesirable in many applications while indispensable in others. It is therefore of common interest to understand their mechanisms of creation. This paper aims at analyzing the transport of vorticity inside incompressible flow. The analysis is based on the vorticity equation and is performed along pathlines which are typically started in upstream direction from vortex regions. Different methods for the quantitative and explorative analysis of vorticity transport are presented and applied to CFD simulations of water turbines. Simulation quality is accounted for by including the errors of meshing and convergence into analysis and visualization. The obtained results are discussed and interpretations with respect to engineering questions are given.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Vortices are undesirable in many applications while indispensable in others. It is therefore of common interest to understand their mechanisms of creation. This paper aims at analyzing the transport of vorticity inside incompressible flow. The analysis is based on the vorticity equation and is performed along pathlines which are typically started in upstream direction from vortex regions. Different methods for the quantitative and explorative analysis of vorticity transport are presented and applied to CFD simulations of water turbines. Simulation quality is accounted for by including the errors of meshing and convergence into analysis and visualization. The obtained results are discussed and interpretations with respect to engineering questions are given.",
"title": "Visualization Tools for Vorticity Transport Analysis in Incompressible Flow",
"normalizedTitle": "Visualization Tools for Vorticity Transport Analysis in Incompressible Flow",
"fno": "v0949",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Fluid Dynamics",
"Data Visualisation",
"Flow Visualisation",
"Turbines",
"Vortices",
"Visualization Tools",
"Vorticity Transport Analysis",
"Incompressible Flow",
"Vorticity Equation",
"Upstream Direction",
"Vortex Regions",
"Quantitative Analysis",
"Explorative Analysis",
"CFD Simulations",
"Computational Fluid Dynamics",
"Water Turbines",
"Simulation Quality",
"Meshing Errors",
"Convergence",
"Visualization",
"Equations",
"Analytical Models",
"Performance Analysis",
"Computational Fluid Dynamics",
"Turbines",
"Convergence",
"Turbomachinery",
"Angular Velocity",
"Silver",
"Flow Visualization",
"Vorticity Transport",
"Unsteady Flow",
"Linked Views"
],
"authors": [
{
"givenName": "Filip",
"surname": "Sadlo",
"fullName": "Filip Sadlo",
"affiliation": "Computer Graphics Laboratory, Computer Science Department, ETH Zurich, Switzerland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ronald",
"surname": "Peikert",
"fullName": "Ronald Peikert",
"affiliation": "Computer Graphics Laboratory, Computer Science Department, ETH Zurich, Switzerland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mirjam",
"surname": "Sick",
"fullName": "Mirjam Sick",
"affiliation": "VA Tech Hydro, Zurich, Switzerland",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "trans",
"pages": "949-956",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"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/pg/2000/0868/0/08680135",
"title": "Modeling of Smoke Flow Taking Obstacles into Account",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2000/08680135/12OmNvjyxxt",
"parentPublication": {
"id": "proceedings/pg/2000/0868/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cdc/2000/6638/2/00912030",
"title": "An optimal control formulation for inviscid incompressible ideal fluid flow",
"doi": null,
"abstractUrl": "/proceedings-article/cdc/2000/00912030/12OmNxwENyd",
"parentPublication": {
"id": "proceedings/cdc/2000/6638/4",
"title": "Proceedings of the 39th IEEE Conference on Decision and Control",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icic/2009/3634/1/3634a139",
"title": "Second Order Accuracy N-S Equations for Incompressible Flow",
"doi": null,
"abstractUrl": "/proceedings-article/icic/2009/3634a139/12OmNyPQ4NO",
"parentPublication": {
"id": "icic/2009/3634/1",
"title": "2009 Second International Conference on Information and Computing Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880179",
"title": "Vorticity Based Flow Analysis and Visualization for Pelton Turbine Design Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880179/12OmNyfdOQW",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccea/2010/6079/1/05445858",
"title": "Mesoscale Computational Approach for Shear Driven Cavity Flow",
"doi": null,
"abstractUrl": "/proceedings-article/iccea/2010/05445858/12OmNzlD9su",
"parentPublication": {
"id": "proceedings/iccea/2010/6079/1",
"title": "2010 Second International Conference on Computer Engineering and Applications (ICCEA 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/05/v1055",
"title": "Visualization of Vorticity and Vortices in Wall-Bounded Turbulent Flows",
"doi": null,
"abstractUrl": "/journal/tg/2007/05/v1055/13rRUILLkvi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122149",
"title": "Derived Metric Tensors for Flow Surface Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122149/13rRUwd9CG1",
"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": "proceedings/sc/2021/8442/0/09910096",
"title": "Preparing an Incompressible-Flow Fluid Dynamics Code for Exascale-Class Wind Energy Simulations",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2021/09910096/1HzBCRG2aNa",
"parentPublication": {
"id": "proceedings/sc/2021/8442/0",
"title": "SC21: International Conference for High Performance Computing, Networking, Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0933",
"articleId": "13rRUyYjKa5",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0957",
"articleId": "13rRUxlgxTd",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAHW0J9",
"title": "Sept.",
"year": "2017",
"issueNum": "09",
"idPrefix": "tc",
"pubType": "journal",
"volume": "66",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxCitIC",
"doi": "10.1109/TC.2017.2695447",
"abstract": "The Unix shell dgsh provides an expressive way to construct sophisticated and efficient non-linear pipelines. Such pipelines can use standard Unix tools, as well as third-party and custom-built components. Dgsh allows the specification of pipelines that perform non-uniform non-linear processing. These form a directed acyclic process graph, which is typically executed by multiple processor cores, thus increasing the processing task’s throughput. A number of existing Unix tools have been adapted to take advantage of the new shell’s multiple pipe input/output capabilities. The shell supports visualization of the process graphs, which can also aid debugging. Dgsh was evaluated through a number of common data processing and domain-specific examples, and was found to offer an expressive way to specify processing topologies, while also generally increasing processing throughput.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The Unix shell dgsh provides an expressive way to construct sophisticated and efficient non-linear pipelines. Such pipelines can use standard Unix tools, as well as third-party and custom-built components. Dgsh allows the specification of pipelines that perform non-uniform non-linear processing. These form a directed acyclic process graph, which is typically executed by multiple processor cores, thus increasing the processing task’s throughput. A number of existing Unix tools have been adapted to take advantage of the new shell’s multiple pipe input/output capabilities. The shell supports visualization of the process graphs, which can also aid debugging. Dgsh was evaluated through a number of common data processing and domain-specific examples, and was found to offer an expressive way to specify processing topologies, while also generally increasing processing throughput.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The Unix shell dgsh provides an expressive way to construct sophisticated and efficient non-linear pipelines. Such pipelines can use standard Unix tools, as well as third-party and custom-built components. Dgsh allows the specification of pipelines that perform non-uniform non-linear processing. These form a directed acyclic process graph, which is typically executed by multiple processor cores, thus increasing the processing task’s throughput. A number of existing Unix tools have been adapted to take advantage of the new shell’s multiple pipe input/output capabilities. The shell supports visualization of the process graphs, which can also aid debugging. Dgsh was evaluated through a number of common data processing and domain-specific examples, and was found to offer an expressive way to specify processing topologies, while also generally increasing processing throughput.",
"title": "Extending Unix Pipelines to DAGs",
"normalizedTitle": "Extending Unix Pipelines to DAGs",
"fno": "07903579",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Pipelines",
"Syntactics",
"Standards",
"Throughput",
"Topology",
"Computer Architecture",
"Parallel Processing",
"Process Level Parallelism",
"Unix",
"Pipeline",
"Pipes And Filters Architecture"
],
"authors": [
{
"givenName": "Diomidis",
"surname": "Spinellis",
"fullName": "Diomidis Spinellis",
"affiliation": "Department of Managment Science and Technology, Athens University of Economics and Business, Athens, Greece",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marios",
"surname": "Fragkoulis",
"fullName": "Marios Fragkoulis",
"affiliation": "Department of Managment Science and Technology, Athens University of Economics and Business, Athens, Greece",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "09",
"pubDate": "2017-09-01 00:00:00",
"pubType": "trans",
"pages": "1547-1561",
"year": "2017",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/async/2002/1540/0/01000293",
"title": "Energy-efficient pipelines",
"doi": null,
"abstractUrl": "/proceedings-article/async/2002/01000293/12OmNBfZSiQ",
"parentPublication": {
"id": "proceedings/async/2002/1540/0",
"title": "Proceedings Eighth International Symposium on Asynchronous Circuits and Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/reconfig/2010/4314/0/4314a103",
"title": "Cascading Deep Pipelines to Achieve High Throughput in Numerical Reduction Operations",
"doi": null,
"abstractUrl": "/proceedings-article/reconfig/2010/4314a103/12OmNBqMDrw",
"parentPublication": {
"id": "proceedings/reconfig/2010/4314/0",
"title": "Reconfigurable Computing and FPGAs, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2014/4308/0/4308a800",
"title": "A Stream Algebra for Computer Vision Pipelines",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2014/4308a800/12OmNqJ8trK",
"parentPublication": {
"id": "proceedings/cvprw/2014/4308/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hipc/2013/0730/0/06799119",
"title": "Adding data parallelism to streaming pipelines for throughput optimization",
"doi": null,
"abstractUrl": "/proceedings-article/hipc/2013/06799119/12OmNyLA5y1",
"parentPublication": {
"id": "proceedings/hipc/2013/0730/0",
"title": "2013 20th International Conference on High Performance Computing (HiPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nas/2015/7891/0/07255216",
"title": "Evaluation of a hash-compress-encrypt pipeline for storage system applications",
"doi": null,
"abstractUrl": "/proceedings-article/nas/2015/07255216/12OmNyRPgS1",
"parentPublication": {
"id": "proceedings/nas/2015/7891/0",
"title": "2015 IEEE International Conference on Networking, Architecture and Storage (NAS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/2003/06/s6017",
"title": "Pipelines",
"doi": null,
"abstractUrl": "/magazine/so/2003/06/s6017/13rRUILtJxf",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2020/03/08566007",
"title": "Scheduling Resources to Multiple Pipelines of One Query in a Main Memory Database Cluster",
"doi": null,
"abstractUrl": "/journal/tk/2020/03/08566007/17D45X2fUH6",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/seaa/2020/9532/0/09226318",
"title": "PACE: A DSL-based Approach to Manage Complex Build Pipelines",
"doi": null,
"abstractUrl": "/proceedings-article/seaa/2020/09226318/1nYsThIOube",
"parentPublication": {
"id": "proceedings/seaa/2020/9532/0",
"title": "2020 46th Euromicro Conference on Software Engineering and Advanced Applications (SEAA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cloud/2021/0060/0/006000a698",
"title": "Neon: Low-Latency Streaming Pipelines for HPC",
"doi": null,
"abstractUrl": "/proceedings-article/cloud/2021/006000a698/1ymJ50EdTOM",
"parentPublication": {
"id": "proceedings/cloud/2021/0060/0",
"title": "2021 IEEE 14th International Conference on Cloud Computing (CLOUD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07884964",
"articleId": "13rRUxZ0o0K",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07884927",
"articleId": "13rRUyft7Cp",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzaQoM6",
"title": "March",
"year": "2008",
"issueNum": "03",
"idPrefix": "tk",
"pubType": "journal",
"volume": "20",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwbs2bm",
"doi": "10.1109/TKDE.2007.190703",
"abstract": "Given a user keyword query, current Web search engines return a list of individual web pages ranked by their \"goodness\" with respect to the query. Thus the basic unit for search and retrieval is an individual page, even though information on a topic is often spread across multiple pages. This degrades the quality of search results especially for long or uncorrelated (multi-topic) queries (in which individual keywords rarely occur together in the same document) where a single page is unlikely to satisfy the user's information need. We propose a technique that given a keyword query, on-the-fly generates new pages, called composed pages, which contain all query keywords. The composed pages are generated by extracting and stitching together relevant pieces from hyperlinked Web pages, and retaining links to the original Web pages. To rank the composed pages we consider both the hyperlink structure of the original pages, as well as the associations between the keywords within each page. Furthermore, we present and experimentally evaluate heuristic algorithms to efficiently generate the top composed pages. The quality of our method is compared to current approaches using user surveys. Finally, we also show how our techniques can be used to perform query-specific summarization of web pages.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Given a user keyword query, current Web search engines return a list of individual web pages ranked by their \"goodness\" with respect to the query. Thus the basic unit for search and retrieval is an individual page, even though information on a topic is often spread across multiple pages. This degrades the quality of search results especially for long or uncorrelated (multi-topic) queries (in which individual keywords rarely occur together in the same document) where a single page is unlikely to satisfy the user's information need. We propose a technique that given a keyword query, on-the-fly generates new pages, called composed pages, which contain all query keywords. The composed pages are generated by extracting and stitching together relevant pieces from hyperlinked Web pages, and retaining links to the original Web pages. To rank the composed pages we consider both the hyperlink structure of the original pages, as well as the associations between the keywords within each page. Furthermore, we present and experimentally evaluate heuristic algorithms to efficiently generate the top composed pages. The quality of our method is compared to current approaches using user surveys. Finally, we also show how our techniques can be used to perform query-specific summarization of web pages.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Given a user keyword query, current Web search engines return a list of individual web pages ranked by their \"goodness\" with respect to the query. Thus the basic unit for search and retrieval is an individual page, even though information on a topic is often spread across multiple pages. This degrades the quality of search results especially for long or uncorrelated (multi-topic) queries (in which individual keywords rarely occur together in the same document) where a single page is unlikely to satisfy the user's information need. We propose a technique that given a keyword query, on-the-fly generates new pages, called composed pages, which contain all query keywords. The composed pages are generated by extracting and stitching together relevant pieces from hyperlinked Web pages, and retaining links to the original Web pages. To rank the composed pages we consider both the hyperlink structure of the original pages, as well as the associations between the keywords within each page. Furthermore, we present and experimentally evaluate heuristic algorithms to efficiently generate the top composed pages. The quality of our method is compared to current approaches using user surveys. Finally, we also show how our techniques can be used to perform query-specific summarization of web pages.",
"title": "Beyond Single-Page Web Search Results",
"normalizedTitle": "Beyond Single-Page Web Search Results",
"fno": "ttk2008030411",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Internet Search",
"Retrieval Models",
"Search Process",
"Web Search"
],
"authors": [
{
"givenName": "Ramakrishna",
"surname": "Varadarajan",
"fullName": "Ramakrishna Varadarajan",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vagelis",
"surname": "Hristidis",
"fullName": "Vagelis Hristidis",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tao",
"surname": "Li",
"fullName": "Tao Li",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2008-03-01 00:00:00",
"pubType": "trans",
"pages": "411-424",
"year": "2008",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cit/2011/4388/0/4388a455",
"title": "Utilizing SSTAG: A Novel Tag Recommendation Mechanism to Web Page Search",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2011/4388a455/12OmNBsLPb0",
"parentPublication": {
"id": "proceedings/cit/2011/4388/0",
"title": "Computer and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccee/2009/3925/1/3925a569",
"title": "Exploring HTML Tags and Metadata to Improve the Expressiveness of Web Search Engine's Queries",
"doi": null,
"abstractUrl": "/proceedings-article/iccee/2009/3925a569/12OmNC3FGkQ",
"parentPublication": {
"id": "iccee/2009/3925/1",
"title": "Computer and Electrical Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi/2005/2415/0/01517860",
"title": "Visual similarity comparison for Web page retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/wi/2005/01517860/12OmNqIzgTg",
"parentPublication": {
"id": "proceedings/wi/2005/2415/0",
"title": "Proceedings. The 2005 IEEE/WIC/ACM International Conference on Web Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/waina/2016/2461/0/2461a455",
"title": "Selecting Web Search Results of Diverse Contents with Search Engine Suggests and a Topic Model",
"doi": null,
"abstractUrl": "/proceedings-article/waina/2016/2461a455/12OmNwtn3zF",
"parentPublication": {
"id": "proceedings/waina/2016/2461/0",
"title": "2016 30th International Conference on Advanced Information Networking and Applications Workshops (WAINA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dasfaa/2001/0996/0/06044759",
"title": "WebCarousel: Restructuring web search results for passive viewing in mobile environments",
"doi": null,
"abstractUrl": "/proceedings-article/dasfaa/2001/06044759/12OmNwuvrWD",
"parentPublication": {
"id": "proceedings/dasfaa/2001/0996/0",
"title": "Proceedings Seventh International Conference on Database Systems for Advanced Applications. DASFAA 2001",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2012/0227/1/06495133",
"title": "Extracting Knowledge from Web Search Engine Results",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2012/06495133/12OmNyNzhxF",
"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/act/2009/3915/0/05376757",
"title": "Search Engine that Enhances Search Results by Categorizing the Search Results Based on Conditional Probability",
"doi": null,
"abstractUrl": "/proceedings-article/act/2009/05376757/13bd1ftOBCS",
"parentPublication": {
"id": "proceedings/act/2009/3915/0",
"title": "Advances in Computing, Control, and Telecommunication Technologies, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2009/01/ttk2009010123",
"title": "A Relation-Based Page Rank Algorithm for Semantic Web Search Engines",
"doi": null,
"abstractUrl": "/journal/tk/2009/01/ttk2009010123/13rRUEgarjL",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2003/04/k0784",
"title": "Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search",
"doi": null,
"abstractUrl": "/journal/tk/2003/04/k0784/13rRUNvyafi",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2008/11/ttk2008111550",
"title": "Web People Search via Connection Analysis",
"doi": null,
"abstractUrl": "/journal/tk/2008/11/ttk2008111550/13rRUxNEqQp",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttk2008030397",
"articleId": "13rRUytWF9B",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttk2008030425",
"articleId": "13rRUwghd5p",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAPjA9N",
"title": "January-March",
"year": "2010",
"issueNum": "01",
"idPrefix": "th",
"pubType": "journal",
"volume": "3",
"label": "January-March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxly9e5",
"doi": "10.1109/TOH.2009.43",
"abstract": "In this study, we investigate the influence of visual feedback on haptic exploration. A haptic search task was designed in which subjects had to haptically explore a virtual display using a force-feedback device and to determine whether a target was present among distractor items. Although the target was recognizable only haptically, visual feedback of finger position or possible target positions could be given. Our results show that subjects could use visual feedback on possible target positions even in the absence of feedback on finger position. When there was no feedback on possible target locations, subjects scanned the whole display systematically. When feedback on finger position was present, subjects could make well-directed movements back to areas of interest. This was not the case without feedback on finger position, indicating that showing finger position helps to form a spatial representation of the display. In addition, we show that response time models of visual serial search do not generally apply for haptic serial search. Consequently, in teleoperation systems, for instance, it is helpful to show the position of the probe even if visual information on the scene is poor.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this study, we investigate the influence of visual feedback on haptic exploration. A haptic search task was designed in which subjects had to haptically explore a virtual display using a force-feedback device and to determine whether a target was present among distractor items. Although the target was recognizable only haptically, visual feedback of finger position or possible target positions could be given. Our results show that subjects could use visual feedback on possible target positions even in the absence of feedback on finger position. When there was no feedback on possible target locations, subjects scanned the whole display systematically. When feedback on finger position was present, subjects could make well-directed movements back to areas of interest. This was not the case without feedback on finger position, indicating that showing finger position helps to form a spatial representation of the display. In addition, we show that response time models of visual serial search do not generally apply for haptic serial search. Consequently, in teleoperation systems, for instance, it is helpful to show the position of the probe even if visual information on the scene is poor.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this study, we investigate the influence of visual feedback on haptic exploration. A haptic search task was designed in which subjects had to haptically explore a virtual display using a force-feedback device and to determine whether a target was present among distractor items. Although the target was recognizable only haptically, visual feedback of finger position or possible target positions could be given. Our results show that subjects could use visual feedback on possible target positions even in the absence of feedback on finger position. When there was no feedback on possible target locations, subjects scanned the whole display systematically. When feedback on finger position was present, subjects could make well-directed movements back to areas of interest. This was not the case without feedback on finger position, indicating that showing finger position helps to form a spatial representation of the display. In addition, we show that response time models of visual serial search do not generally apply for haptic serial search. Consequently, in teleoperation systems, for instance, it is helpful to show the position of the probe even if visual information on the scene is poor.",
"title": "Visually Guided Haptic Search",
"normalizedTitle": "Visually Guided Haptic Search",
"fno": "tth2010010063",
"hasPdf": true,
"idPrefix": "th",
"keywords": [
"Haptic Search",
"Psychophysics",
"Perception"
],
"authors": [
{
"givenName": "Myrthe A.",
"surname": "Plaisier",
"fullName": "Myrthe A. Plaisier",
"affiliation": "Universiteit Utrecht, Utrecht",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Astrid M.L.",
"surname": "Kappers",
"fullName": "Astrid M.L. Kappers",
"affiliation": "Universiteit Utrecht, Utrecht",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wouter M. Bergmann",
"surname": "Tiest",
"fullName": "Wouter M. Bergmann Tiest",
"affiliation": "Universiteit Utrecht, Utrecht",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marc O.",
"surname": "Ernst",
"fullName": "Marc O. Ernst",
"affiliation": "Max Planck Institute for Biological Cybernetics, Tuebingen",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2010-01-01 00:00:00",
"pubType": "trans",
"pages": "63-72",
"year": "2010",
"issn": "1939-1412",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/whc/2007/2738/0/04145237",
"title": "Quantifying the Value of Visual and Haptic Position Feedback During Force-Based Motion Control",
"doi": null,
"abstractUrl": "/proceedings-article/whc/2007/04145237/12OmNvStcVe",
"parentPublication": {
"id": "proceedings/whc/2007/2738/0",
"title": "2007 2nd Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environments and Teleoperator Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2009/04/tth2009040189",
"title": "Cues for Haptic Perception of Compliance",
"doi": null,
"abstractUrl": "/journal/th/2009/04/tth2009040189/13rRUEgarsN",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2010/01/tth2010010028",
"title": "Effects of Packet Loss and Latency on the Temporal Discrimination of Visual-Haptic Events",
"doi": null,
"abstractUrl": "/journal/th/2010/01/tth2010010028/13rRUEgarsO",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2012/01/tth2012010058",
"title": "Influence of Local Properties on the Perception of Global Object Orientation",
"doi": null,
"abstractUrl": "/journal/th/2012/01/tth2012010058/13rRUwI5U2U",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2012/02/tth2012020131",
"title": "Haptic Detection of Artificial Tumors by Hand and with a Tool in a MIS Environment",
"doi": null,
"abstractUrl": "/journal/th/2012/02/tth2012020131/13rRUwfZBVs",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2013/04/tth2013040399",
"title": "Anisotropy in the Haptic Perception of Force Direction and Magnitude",
"doi": null,
"abstractUrl": "/journal/th/2013/04/tth2013040399/13rRUwjGoLR",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2010/02/tth2010020109",
"title": "Rendering Softness: Integration of Kinesthetic and Cutaneous Information in a Haptic Device",
"doi": null,
"abstractUrl": "/journal/th/2010/02/tth2010020109/13rRUwwJWFX",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2016/01/07353205",
"title": "Systematic Movements in Haptic Search: Spirals, Zigzags, and Parallel Sweeps",
"doi": null,
"abstractUrl": "/journal/th/2016/01/07353205/13rRUxZ0o1G",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2010/04/tth2010040257",
"title": "Haptic Object Individuation",
"doi": null,
"abstractUrl": "/journal/th/2010/04/tth2010040257/13rRUxjyX47",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2009/04/tth2009040212",
"title": "Fingerpad Skin Stretch Increases the Perception of Virtual Friction",
"doi": null,
"abstractUrl": "/journal/th/2009/04/tth2009040212/13rRUxly8T7",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "tth2010010056",
"articleId": "13rRUxYIMVc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "tth2010010073",
"articleId": "13rRUIJcWlu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1qL5hsvvVkc",
"title": "Feb.",
"year": "2021",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1nTrMx8JcGI",
"doi": "10.1109/TVCG.2020.3030366",
"abstract": "Tools and interfaces are increasingly expected to be synchronous and distributed to accommodate remote collaboration. Yet, adoption of these techniques for data visualization is low partly because development is difficult: existing collaboration software systems either do not support simultaneous interaction or require expensive redevelopment of existing visualizations. We contribute VisConnect: a web-based synchronous distributed collaborative visualization system that supports most web-based SVG data visualizations, balances system safety with responsiveness, and supports simultaneous interaction from many collaborators. VisConnect works with existing visualization implementations with little-to-no code changes by synchronizing low-level JavaScript events across clients such that visualization updates proceed transparently across clients. This is accomplished via a peer-to-peer system that establishes consensus among clients on the per-element sequence of events, and uses a lock service to grant access over elements to clients. We contribute collaborative extensions of traditional visualization interaction techniques, such as drag, brush, and lasso, and discuss different strategies for collaborative visualization interactions. To demonstrate the utility of VisConnect, we present novel examples of collaborative visualizations in the healthcare domain, remote collaboration with annotation, and show in an education case study for e-learning with 22 participants that students found the ability to remotely collaborate on class activities helpful and enjoyable for understanding concepts. A free copy of this paper and source code are available on OSF at osf.io/ut7e6 and at visconnect.us.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Tools and interfaces are increasingly expected to be synchronous and distributed to accommodate remote collaboration. Yet, adoption of these techniques for data visualization is low partly because development is difficult: existing collaboration software systems either do not support simultaneous interaction or require expensive redevelopment of existing visualizations. We contribute VisConnect: a web-based synchronous distributed collaborative visualization system that supports most web-based SVG data visualizations, balances system safety with responsiveness, and supports simultaneous interaction from many collaborators. VisConnect works with existing visualization implementations with little-to-no code changes by synchronizing low-level JavaScript events across clients such that visualization updates proceed transparently across clients. This is accomplished via a peer-to-peer system that establishes consensus among clients on the per-element sequence of events, and uses a lock service to grant access over elements to clients. We contribute collaborative extensions of traditional visualization interaction techniques, such as drag, brush, and lasso, and discuss different strategies for collaborative visualization interactions. To demonstrate the utility of VisConnect, we present novel examples of collaborative visualizations in the healthcare domain, remote collaboration with annotation, and show in an education case study for e-learning with 22 participants that students found the ability to remotely collaborate on class activities helpful and enjoyable for understanding concepts. A free copy of this paper and source code are available on OSF at osf.io/ut7e6 and at visconnect.us.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Tools and interfaces are increasingly expected to be synchronous and distributed to accommodate remote collaboration. Yet, adoption of these techniques for data visualization is low partly because development is difficult: existing collaboration software systems either do not support simultaneous interaction or require expensive redevelopment of existing visualizations. We contribute VisConnect: a web-based synchronous distributed collaborative visualization system that supports most web-based SVG data visualizations, balances system safety with responsiveness, and supports simultaneous interaction from many collaborators. VisConnect works with existing visualization implementations with little-to-no code changes by synchronizing low-level JavaScript events across clients such that visualization updates proceed transparently across clients. This is accomplished via a peer-to-peer system that establishes consensus among clients on the per-element sequence of events, and uses a lock service to grant access over elements to clients. We contribute collaborative extensions of traditional visualization interaction techniques, such as drag, brush, and lasso, and discuss different strategies for collaborative visualization interactions. To demonstrate the utility of VisConnect, we present novel examples of collaborative visualizations in the healthcare domain, remote collaboration with annotation, and show in an education case study for e-learning with 22 participants that students found the ability to remotely collaborate on class activities helpful and enjoyable for understanding concepts. A free copy of this paper and source code are available on OSF at osf.io/ut7e6 and at visconnect.us.",
"title": "VisConnect: Distributed Event Synchronization for Collaborative Visualization",
"normalizedTitle": "VisConnect: Distributed Event Synchronization for Collaborative Visualization",
"fno": "09222110",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Groupware",
"Internet",
"Web Based Synchronous Distributed Collaborative Visualization System",
"Collaborative Visualization Interactions",
"Peer To Peer System",
"Low Level Java Script Events",
"Web Based SVG Data Visualizations",
"Simultaneous Interaction",
"Collaboration Software Systems",
"Data Visualization",
"Distributed Event Synchronization",
"Remote Collaboration",
"Data Visualization",
"Collaboration",
"Synchronization",
"Visualization",
"Computer Architecture",
"Peer To Peer Computing",
"Safety",
"Collaborative Visualization",
"Distributed Visualization",
"Toolkit"
],
"authors": [
{
"givenName": "Michail",
"surname": "Schwab",
"fullName": "Michail Schwab",
"affiliation": "Northeastern University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Saffo",
"fullName": "David Saffo",
"affiliation": "Northeastern University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yixuan",
"surname": "Zhang",
"fullName": "Yixuan Zhang",
"affiliation": "Northeastern University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shash",
"surname": "Sinha",
"fullName": "Shash Sinha",
"affiliation": "Brown University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cristina",
"surname": "Nita-Rotaru",
"fullName": "Cristina Nita-Rotaru",
"affiliation": "Northeastern University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "James",
"surname": "Tompkin",
"fullName": "James Tompkin",
"affiliation": "Brown University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cody",
"surname": "Dunne",
"fullName": "Cody Dunne",
"affiliation": "Northeastern University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michelle A.",
"surname": "Borkin",
"fullName": "Michelle A. Borkin",
"affiliation": "Northeastern University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "347-357",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/1997/8262/0/82620253",
"title": "Collaborative visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1997/82620253/12OmNs5rkZ3",
"parentPublication": {
"id": "proceedings/ieee-vis/1997/8262/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2009/3789/0/3789a443",
"title": "Synthesis Vis: A Web Site Supporting Collaborative Information Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2009/3789a443/12OmNx5GU5l",
"parentPublication": {
"id": "proceedings/cgiv/2009/3789/0",
"title": "2009 Sixth International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cloudcom/2015/9560/0/9560a186",
"title": "The Ignite Distributed Collaborative Scientific Visualization System",
"doi": null,
"abstractUrl": "/proceedings-article/cloudcom/2015/9560a186/12OmNy2rRSo",
"parentPublication": {
"id": "proceedings/cloudcom/2015/9560/0",
"title": "2015 IEEE 7th International Conference on Cloud Computing Technology and Science (CloudCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2009/05/mcg2009050044",
"title": "CoCoNutTrix: Collaborative Retrofitting for Information Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2009/05/mcg2009050044/13rRUB7a13A",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/1994/07/r7037",
"title": "Distributed and Collaborative Visualization",
"doi": null,
"abstractUrl": "/magazine/co/1994/07/r7037/13rRUwwJWBJ",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1232",
"title": "Interactive Tree Comparison for Co-located Collaborative Information Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1232/13rRUxcKzVg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vissoft/2022/8092/0/809200a075",
"title": "Collaborative Software Visualization for Program Comprehension",
"doi": null,
"abstractUrl": "/proceedings-article/vissoft/2022/809200a075/1JeEzW6wcZG",
"parentPublication": {
"id": "proceedings/vissoft/2022/8092/0",
"title": "2022 Working Conference on Software Visualization (VISSOFT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08816695",
"title": "Data Changes Everything: Challenges and Opportunities in Data Visualization Design Handoff",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08816695/1cPXqoConx6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006500",
"title": "Dynamic Collaborative Visualization Ecosystem to Support the Analysis of Large-Scale Disparate Data",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006500/1hJstVDea2Y",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a146",
"title": "Representing Real-Time Multi-User Collaboration in Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a146/1qRNXFy3oac",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09293003",
"articleId": "1pyonCyir8k",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09216572",
"articleId": "1nJsGl1c7GE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLhGNQgMUg",
"name": "ttg202102-09222110s1-supp2-3030366.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222110s1-supp2-3030366.mp4",
"extension": "mp4",
"size": "81.3 MB",
"__typename": "WebExtraType"
},
{
"id": "1qLhKYqyGyc",
"name": "ttg202102-09222110s1-supp1-3030366.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222110s1-supp1-3030366.pdf",
"extension": "pdf",
"size": "47.8 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBKEyos",
"title": "Fourth Quarter",
"year": "2012",
"issueNum": "04",
"idPrefix": "th",
"pubType": "journal",
"volume": "5",
"label": "Fourth Quarter",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjoNxa",
"doi": "10.1109/TOH.2012.14",
"abstract": "The effect of contact location information on virtual edge perception was investigated in two experiments. In Experiment 1, participants discriminated edge sharpness under force-alone and force-plus-contact-location conditions using a 4.8 mm radius contact roller. Virtual objects were 2D profiles of edges with two adjoining surfaces. For both conditions, the Just Noticeable Difference (JND) in change of edge radius increased from 2.3 to 7.4 mm as edge radii increased from 2.5 to 20.0 mm; there was no significant difference between the two conditions. A follow-up experiment with contact location alone resulted in higher edge sharpness JNDs. In Experiment 2, the same edge sharpness discrimination task was performed using a smaller contact roller (R = 1.5 mm) to investigate the effect of roller size. The JNDs for the smaller roller were not statistically significant from those of the larger roller. Our results suggest that 1) contact location cues alone are capable of conveying edge sharpness information, but that force cues are dominant when both types of cues are available; and 2) the radius of the contact roller does not significantly affect the user's ability to discriminate edge sharpness, indicating that the participants could use the changes in contact location to judge curvature.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The effect of contact location information on virtual edge perception was investigated in two experiments. In Experiment 1, participants discriminated edge sharpness under force-alone and force-plus-contact-location conditions using a 4.8 mm radius contact roller. Virtual objects were 2D profiles of edges with two adjoining surfaces. For both conditions, the Just Noticeable Difference (JND) in change of edge radius increased from 2.3 to 7.4 mm as edge radii increased from 2.5 to 20.0 mm; there was no significant difference between the two conditions. A follow-up experiment with contact location alone resulted in higher edge sharpness JNDs. In Experiment 2, the same edge sharpness discrimination task was performed using a smaller contact roller (R = 1.5 mm) to investigate the effect of roller size. The JNDs for the smaller roller were not statistically significant from those of the larger roller. Our results suggest that 1) contact location cues alone are capable of conveying edge sharpness information, but that force cues are dominant when both types of cues are available; and 2) the radius of the contact roller does not significantly affect the user's ability to discriminate edge sharpness, indicating that the participants could use the changes in contact location to judge curvature.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The effect of contact location information on virtual edge perception was investigated in two experiments. In Experiment 1, participants discriminated edge sharpness under force-alone and force-plus-contact-location conditions using a 4.8 mm radius contact roller. Virtual objects were 2D profiles of edges with two adjoining surfaces. For both conditions, the Just Noticeable Difference (JND) in change of edge radius increased from 2.3 to 7.4 mm as edge radii increased from 2.5 to 20.0 mm; there was no significant difference between the two conditions. A follow-up experiment with contact location alone resulted in higher edge sharpness JNDs. In Experiment 2, the same edge sharpness discrimination task was performed using a smaller contact roller (R = 1.5 mm) to investigate the effect of roller size. The JNDs for the smaller roller were not statistically significant from those of the larger roller. Our results suggest that 1) contact location cues alone are capable of conveying edge sharpness information, but that force cues are dominant when both types of cues are available; and 2) the radius of the contact roller does not significantly affect the user's ability to discriminate edge sharpness, indicating that the participants could use the changes in contact location to judge curvature.",
"title": "Haptic Edge Sharpness Perception with a Contact Location Display",
"normalizedTitle": "Haptic Edge Sharpness Perception with a Contact Location Display",
"fno": "tth2012040323",
"hasPdf": true,
"idPrefix": "th",
"keywords": [
"Thumb",
"Force Feedback",
"Haptic Interfaces",
"Edge Detection",
"Rendering Computer Graphics",
"Effect Of Contact Element Size",
"Contact Location Display",
"Edge Sharpness Perception",
"Curvature Discrimination"
],
"authors": [
{
"givenName": "Jaeyoung",
"surname": "Park",
"fullName": "Jaeyoung Park",
"affiliation": "Purdue University, West Lafayette",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrew J.",
"surname": "Doxon",
"fullName": "Andrew J. Doxon",
"affiliation": "University of Utah, Salt Lake City",
"__typename": "ArticleAuthorType"
},
{
"givenName": "William R.",
"surname": "Provancher",
"fullName": "William R. Provancher",
"affiliation": "University of Utah, Salt Lake City",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David E.",
"surname": "Johnson",
"fullName": "David E. Johnson",
"affiliation": "University of Utah, Salt Lake City",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hong Z.",
"surname": "Tan",
"fullName": "Hong Z. Tan",
"affiliation": "Purdue University, West Lafayette",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2012-10-01 00:00:00",
"pubType": "trans",
"pages": "323-331",
"year": "2012",
"issn": "1939-1412",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdma/2011/4455/0/4455a637",
"title": "Induced Wheel-Based Study on Point Contact Kinematics Modeling for Ultra-Precision Grinding",
"doi": null,
"abstractUrl": "/proceedings-article/icdma/2011/4455a637/12OmNA0dMJ2",
"parentPublication": {
"id": "proceedings/icdma/2011/4455/0",
"title": "2011 Second International Conference on Digital Manufacturing & Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2011/0063/0/06130325",
"title": "Perceptually motivated automatic sharpness enhancement using hierarchy of non-local means",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2011/06130325/12OmNASravB",
"parentPublication": {
"id": "proceedings/iccvw/2011/0063/0",
"title": "2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gcis/2010/4304/2/4304b399",
"title": "Application of Edge Confidence Detection in the Auto-focus under Fundus Camera",
"doi": null,
"abstractUrl": "/proceedings-article/gcis/2010/4304b399/12OmNvAAtqF",
"parentPublication": {
"id": "proceedings/gcis/2010/4304/2",
"title": "2010 Second WRI Global Congress on Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2004/2112/0/21120040",
"title": "Haptic Display of Contact Location",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2004/21120040/12OmNwcCINE",
"parentPublication": {
"id": "proceedings/haptics/2004/2112/0",
"title": "Haptic Interfaces for Virtual Environment and Teleoperator Systems, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2002/1489/0/14890209",
"title": "Six-Degree-of-Freedom Haptic Display Using Localized Contact Computations",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2002/14890209/12OmNx4Q6O8",
"parentPublication": {
"id": "proceedings/haptics/2002/1489/0",
"title": "Haptic Interfaces for Virtual Environment and Teleoperator Systems, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2011/4296/1/4296a770",
"title": "Contact Finite Element Analysis of Anti-backlash Double-roller-Enveloping Hourglass Worm Gearing",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2011/4296a770/12OmNyQpheD",
"parentPublication": {
"id": "proceedings/icmtma/2011/4296/1",
"title": "2011 Third International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460317",
"title": "Image super-resolution based on a novel edge sharpness prior",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460317/12OmNzXnND8",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2017/01/07572949",
"title": "Haptic Perception of Edge Sharpness in Real and Virtual Environments",
"doi": null,
"abstractUrl": "/journal/th/2017/01/07572949/13rRUx0geA4",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/03/ttg2011030380",
"title": "Measurement-Based Modeling of Contact Forces and Textures for Haptic Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2011/03/ttg2011030380/13rRUy3gn7s",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/02/v0219",
"title": "Improving Contact Realism through Event-Based Haptic Feedback",
"doi": null,
"abstractUrl": "/journal/tg/2006/02/v0219/13rRUyYjK5b",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "tth2012040312",
"articleId": "13rRUzphDy6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "tth2012040332",
"articleId": "13rRUy2YLYG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFsK",
"name": "tth2012040323s.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/tth2012040323s.pdf",
"extension": "pdf",
"size": "99.7 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNy3iFo1",
"title": "October-December",
"year": "2009",
"issueNum": "04",
"idPrefix": "th",
"pubType": "journal",
"volume": "2",
"label": "October-December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyuvRoU",
"doi": "10.1109/TOH.2009.22",
"abstract": "Haptic cues may be able to assist an individual who is engaged in a manual control task, freeing visual and auditory attention for other mental tasks. We describe an experiment in which subjects attempted to step at a consistent pace on a stair climber exercise machine which was modified for haptic cuing through the legs. Subjects' visual attention was engaged by a video game. Five different haptic cues for consistent pacing were investigated, two of them more kinesthetic in nature and three that were more tactile. Results showed that haptic cues could indeed improve the manual control task performance without diminishing the visual attention task performance. The tactile cues generally outperformed the kinesthetic ones.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Haptic cues may be able to assist an individual who is engaged in a manual control task, freeing visual and auditory attention for other mental tasks. We describe an experiment in which subjects attempted to step at a consistent pace on a stair climber exercise machine which was modified for haptic cuing through the legs. Subjects' visual attention was engaged by a video game. Five different haptic cues for consistent pacing were investigated, two of them more kinesthetic in nature and three that were more tactile. Results showed that haptic cues could indeed improve the manual control task performance without diminishing the visual attention task performance. The tactile cues generally outperformed the kinesthetic ones.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Haptic cues may be able to assist an individual who is engaged in a manual control task, freeing visual and auditory attention for other mental tasks. We describe an experiment in which subjects attempted to step at a consistent pace on a stair climber exercise machine which was modified for haptic cuing through the legs. Subjects' visual attention was engaged by a video game. Five different haptic cues for consistent pacing were investigated, two of them more kinesthetic in nature and three that were more tactile. Results showed that haptic cues could indeed improve the manual control task performance without diminishing the visual attention task performance. The tactile cues generally outperformed the kinesthetic ones.",
"title": "Using Kinesthetic and Tactile Cues to Maintain Exercise Intensity",
"normalizedTitle": "Using Kinesthetic and Tactile Cues to Maintain Exercise Intensity",
"fno": "tth2009040224",
"hasPdf": true,
"idPrefix": "th",
"keywords": [
"Haptics",
"Haptic Communications",
"User Interfaces",
"Manual Control Tasks",
"Foot Haptics"
],
"authors": [
{
"givenName": "Aaron R.",
"surname": "Ferber",
"fullName": "Aaron R. Ferber",
"affiliation": "IDEO, LLC, Chicago",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Peshkin",
"fullName": "Michael Peshkin",
"affiliation": "Northwestern University, Evanston",
"__typename": "ArticleAuthorType"
},
{
"givenName": "J. Edward",
"surname": "Colgate",
"fullName": "J. Edward Colgate",
"affiliation": "Northwestern University, Evanston",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2009-10-01 00:00:00",
"pubType": "trans",
"pages": "224-235",
"year": "2009",
"issn": "1939-1412",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2014/2871/0/06802106",
"title": "An ungrounded tactile feedback device to portray force and torque-like interactions in virtual environments",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2014/06802106/12OmNAg7jYE",
"parentPublication": {
"id": "proceedings/vr/2014/2871/0",
"title": "2014 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2013/5048/0/5048a215",
"title": "EmotionAir: Perception of Emotions from Air Jet Based Tactile Stimulation",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2013/5048a215/12OmNrMZpEF",
"parentPublication": {
"id": "proceedings/acii/2013/5048/0",
"title": "2013 Humaine Association Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/whc/2007/2738/0/27380409",
"title": "A fingertip haptic display for improving local perception of shape cues",
"doi": null,
"abstractUrl": "/proceedings-article/whc/2007/27380409/12OmNwcl7KO",
"parentPublication": {
"id": "proceedings/whc/2007/2738/0",
"title": "2007 2nd Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environments and Teleoperator Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2010/6821/0/05444646",
"title": "Simplified design of haptic display by extending one-point kinesthetic feedback to multipoint tactile feedback",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2010/05444646/12OmNyvGylZ",
"parentPublication": {
"id": "proceedings/haptics/2010/6821/0",
"title": "2010 IEEE Haptics Symposium (Formerly known as Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/whc/2007/2738/0/27380391",
"title": "Improvement of Shape Distinction by Kinesthetic-Tactile Integration",
"doi": null,
"abstractUrl": "/proceedings-article/whc/2007/27380391/12OmNzTH14A",
"parentPublication": {
"id": "proceedings/whc/2007/2738/0",
"title": "2007 2nd Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environments and Teleoperator Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2016/03/07452650",
"title": "Non-Colocated Kinesthetic Display Limits Compliance Discrimination in the Absence of Terminal Force Cues",
"doi": null,
"abstractUrl": "/journal/th/2016/03/07452650/13rRUwjoNxb",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2010/02/tth2010020109",
"title": "Rendering Softness: Integration of Kinesthetic and Cutaneous Information in a Haptic Device",
"doi": null,
"abstractUrl": "/journal/th/2010/02/tth2010020109/13rRUwwJWFX",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2017/02/07604131",
"title": "Optimization-Based Wearable Tactile Rendering",
"doi": null,
"abstractUrl": "/journal/th/2017/02/07604131/13rRUxcbnCC",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2013/04/tth2013040453",
"title": "Human Detection and Discrimination of Tactile Repeatability, Mechanical Backlash, and Temporal Delay in a Combined Tactile-Kinesthetic Haptic Display System",
"doi": null,
"abstractUrl": "/journal/th/2013/04/tth2013040453/13rRUyeCkau",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08797991",
"title": "Position Paper: Factors of Perceived Tactile Cue Dominance when Interacting with Moving Virtual Objects",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08797991/1cJ1aAfvipO",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "tth2009040212",
"articleId": "13rRUxly8T7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "tth2009040236",
"articleId": "13rRUwjGoGb",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet2z",
"name": "tth2009040224s.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/tth2009040224s.zip",
"extension": "zip",
"size": "678 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBCZnU8",
"title": "January/February",
"year": "2007",
"issueNum": "01",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "9",
"label": "January/February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxk89i4",
"doi": "10.1109/MCSE.2007.22",
"abstract": "In positron emission tomography/computed tomography (PET/CT) volume rendering, volume images are associated with individual lookup tables, which users must manipulate independently of the resultant volumes being fused. An intuitive, efficient dual-lookup table transfer function can improve the visualization of fused PET/CT renderings.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In positron emission tomography/computed tomography (PET/CT) volume rendering, volume images are associated with individual lookup tables, which users must manipulate independently of the resultant volumes being fused. An intuitive, efficient dual-lookup table transfer function can improve the visualization of fused PET/CT renderings.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In positron emission tomography/computed tomography (PET/CT) volume rendering, volume images are associated with individual lookup tables, which users must manipulate independently of the resultant volumes being fused. An intuitive, efficient dual-lookup table transfer function can improve the visualization of fused PET/CT renderings.",
"title": "Visualizing Dual-Modality Rendered Volumes Using a Dual-Lookup Table Transfer Function",
"normalizedTitle": "Visualizing Dual-Modality Rendered Volumes Using a Dual-Lookup Table Transfer Function",
"fno": "c1020",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Visualization",
"Anatomical And Functional Rendering Real Time Volume Rendering Dual Modality PET CT Lookup Table Transfer Function"
],
"authors": [
{
"givenName": "Jinman",
"surname": "Kim",
"fullName": "Jinman Kim",
"affiliation": "University of Sydney",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefan",
"surname": "Eberl",
"fullName": "Stefan Eberl",
"affiliation": "University of Sydney",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dagan",
"surname": "Feng",
"fullName": "Dagan Feng",
"affiliation": "University of Sydney",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2007-01-01 00:00:00",
"pubType": "mags",
"pages": "20-25",
"year": "2007",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdma/2012/4772/0/4772a691",
"title": "Research on Preprocessing Algorithm for PET-CT Image Registration",
"doi": null,
"abstractUrl": "/proceedings-article/icdma/2012/4772a691/12OmNBpEeLm",
"parentPublication": {
"id": "proceedings/icdma/2012/4772/0",
"title": "2012 Third International Conference on Digital Manufacturing & Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2010/9167/0/06042657",
"title": "A content-based image retrieval framework for multi-modality lung images",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2010/06042657/12OmNqAU6tL",
"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/icime/2009/3595/0/3595a008",
"title": "Segmenting Extra Pulmonary Tuberculous Lesions in Computed Tomography Images Using Positron Emission Tomography Intensity Markers",
"doi": null,
"abstractUrl": "/proceedings-article/icime/2009/3595a008/12OmNqEjhZH",
"parentPublication": {
"id": "proceedings/icime/2009/3595/0",
"title": "Information Management and Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dicta/2011/4588/0/4588a274",
"title": "Variational Bayes Inference Based Segmentation of Heterogeneous Lymphoma Volumes in Dual-Modality PET-CT Images",
"doi": null,
"abstractUrl": "/proceedings-article/dicta/2011/4588a274/12OmNrJ11Bx",
"parentPublication": {
"id": "proceedings/dicta/2011/4588/0",
"title": "2011 International Conference on Digital Image Computing: Techniques and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1995/7310/2/73102476",
"title": "A data fusion approach to tumor delineation",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1995/73102476/12OmNvD8RxC",
"parentPublication": {
"id": "proceedings/icip/1995/7310/2",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dicta/2011/4588/0/4588a330",
"title": "Differential Evolution Based Variational Bayes Inference for Brain PET-CT Image Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/dicta/2011/4588a330/12OmNxu6p9X",
"parentPublication": {
"id": "proceedings/dicta/2011/4588/0",
"title": "2011 International Conference on Digital Image Computing: Techniques and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dicta/2010/4271/0/4271a063",
"title": "Automated Detection of the Occurrence and Changes of Hot-Spots in Intro-subject FDG-PET Images from Combined PET-CT Scanners",
"doi": null,
"abstractUrl": "/proceedings-article/dicta/2010/4271a063/12OmNy3Aguq",
"parentPublication": {
"id": "proceedings/dicta/2010/4271/0",
"title": "2010 International Conference on Digital Image Computing: Techniques and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoip/2010/4252/2/4252b266",
"title": "Research on Preprocessing Algorithm for PET-CT Image Registration",
"doi": null,
"abstractUrl": "/proceedings-article/icoip/2010/4252b266/12OmNyYDDwx",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ibica/2011/4606/0/4606a367",
"title": "Image Segmentation Method with Positron Emission Tomography Time Sequence Images",
"doi": null,
"abstractUrl": "/proceedings-article/ibica/2011/4606a367/12OmNzWOBfl",
"parentPublication": {
"id": "proceedings/ibica/2011/4606/0",
"title": "Innovations in Bio-inspired Computing and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300k0610",
"title": "DUAL-GLOW: Conditional Flow-Based Generative Model for Modality Transfer",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300k0610/1hQqkzaPpJe",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "c1013",
"articleId": "13rRUwcAqmF",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "c1026",
"articleId": "13rRUB7a1jC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxwWoNC",
"title": "July-September",
"year": "2005",
"issueNum": "03",
"idPrefix": "tb",
"pubType": "journal",
"volume": "2",
"label": "July-September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5af",
"doi": "10.1109/TCBB.2005.43",
"abstract": "A number of different approaches have been proposed to predict elemental component formulas (or molecular formulas) of molecular ions in low and medium resolution mass spectra. Most of them rely on isotope patterns, enumerate all possible formulas for an ion, and exclude certain formulas violating chemical constraints. However, these methods cannot be well generalized to the component prediction of fragment ions in tandem mass spectra. In this paper, a new method, FFP (fragment ion formula prediction), is presented to predict elemental component formulas of fragment ions. In the FFP method, the prediction of the best formulas is converted into the minimization of the distance between theoretical and observed isotope patterns. And, then, a novel local search model is proposed to generate a set of candidate formulas efficiently. After the search, FFP applies a new multiconstraint filtering to exclude as many invalid and improbable formulas as possible. FFP is experimentally compared with the previous enumeration methods, and shown to outperform them significantly. The results of this paper can help to improve the reliability of de novo in the identification of peptide sequences.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A number of different approaches have been proposed to predict elemental component formulas (or molecular formulas) of molecular ions in low and medium resolution mass spectra. Most of them rely on isotope patterns, enumerate all possible formulas for an ion, and exclude certain formulas violating chemical constraints. However, these methods cannot be well generalized to the component prediction of fragment ions in tandem mass spectra. In this paper, a new method, FFP (fragment ion formula prediction), is presented to predict elemental component formulas of fragment ions. In the FFP method, the prediction of the best formulas is converted into the minimization of the distance between theoretical and observed isotope patterns. And, then, a novel local search model is proposed to generate a set of candidate formulas efficiently. After the search, FFP applies a new multiconstraint filtering to exclude as many invalid and improbable formulas as possible. FFP is experimentally compared with the previous enumeration methods, and shown to outperform them significantly. The results of this paper can help to improve the reliability of de novo in the identification of peptide sequences.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A number of different approaches have been proposed to predict elemental component formulas (or molecular formulas) of molecular ions in low and medium resolution mass spectra. Most of them rely on isotope patterns, enumerate all possible formulas for an ion, and exclude certain formulas violating chemical constraints. However, these methods cannot be well generalized to the component prediction of fragment ions in tandem mass spectra. In this paper, a new method, FFP (fragment ion formula prediction), is presented to predict elemental component formulas of fragment ions. In the FFP method, the prediction of the best formulas is converted into the minimization of the distance between theoretical and observed isotope patterns. And, then, a novel local search model is proposed to generate a set of candidate formulas efficiently. After the search, FFP applies a new multiconstraint filtering to exclude as many invalid and improbable formulas as possible. FFP is experimentally compared with the previous enumeration methods, and shown to outperform them significantly. The results of this paper can help to improve the reliability of de novo in the identification of peptide sequences.",
"title": "Predicting molecular formulas of fragment ions with isotope patterns in tandem mass spectra",
"normalizedTitle": "Predicting molecular formulas of fragment ions with isotope patterns in tandem mass spectra",
"fno": "n0217",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Proteins",
"Molecular Biophysics",
"Mass Spectra",
"Prediction Theory",
"Molecular Configurations",
"Biology Computing",
"Minimisation",
"Molecular Formulas",
"Fragment Ion Formula Prediction",
"Isotope Patterns",
"Tandem Mass Spectra",
"Elemental Component Formulas",
"Molecular Ions",
"Multiconstraint Filtering",
"Peptide Sequences",
"Minimisation",
"Local Search Model",
"Isotopes",
"Chemical Elements",
"Peptides",
"Sequences",
"Filtering",
"Mass Spectroscopy",
"Minimization Methods",
"Proteins",
"Measurement Errors",
"Index Terms Isotope Patterns",
"Peptide Sequencing",
"Tandem Mass Spectra"
],
"authors": [
{
"givenName": null,
"surname": "Jingfen Zhang",
"fullName": "Jingfen Zhang",
"affiliation": "Inst. of Comput. Tech., Chinese Acad. of Sci., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wen",
"surname": "Gao",
"fullName": "Wen Gao",
"affiliation": "Inst. of Comput. Tech., Chinese Acad. of Sci., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Jinjin Cai",
"fullName": "Jinjin Cai",
"affiliation": "Inst. of Comput. Tech., Chinese Acad. of Sci., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Simin He",
"fullName": "Simin He",
"affiliation": "Inst. of Comput. Tech., Chinese Acad. of Sci., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Rong Zeng",
"fullName": "Rong Zeng",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Runsheng Chen",
"fullName": "Runsheng Chen",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2005-07-01 00:00:00",
"pubType": "trans",
"pages": "217-230",
"year": "2005",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccabs/2011/4851/0/208",
"title": "Parallelizing Peptide-Spectrum scoring using modern graphics processing units",
"doi": null,
"abstractUrl": "/proceedings-article/iccabs/2011/208/12OmNAS9zMB",
"parentPublication": {
"id": "proceedings/iccabs/2011/4851/0",
"title": "2011 IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences (ICCABS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2009/3735/5/3735e037",
"title": "Classifying b and y Ions in Peptide Tandem Mass Spectra",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2009/3735e037/12OmNAolGLH",
"parentPublication": {
"id": "proceedings/fskd/2009/3735/5",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eqec/2005/8973/0/01567394",
"title": "Sympathetic cooling of molecular ions: multi-species Coulomb crystals and chemical reactions",
"doi": null,
"abstractUrl": "/proceedings-article/eqec/2005/01567394/12OmNB8TUfW",
"parentPublication": {
"id": "proceedings/eqec/2005/8973/0",
"title": "2005 European Quantum Electronics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/saahpc/2012/4838/0/4838a111",
"title": "FPGA-Accelerated Isotope Pattern Calculator for Use in Simulated Mass Spectrometry Peptide and Protein Chemistry",
"doi": null,
"abstractUrl": "/proceedings-article/saahpc/2012/4838a111/12OmNBTJICz",
"parentPublication": {
"id": "proceedings/saahpc/2012/4838/0",
"title": "Application Accelerators in High-Performance Computing, Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2017/1324/0/132401a367",
"title": "Towards Probabilistic Simulation of Tandem Mass Spectrometry Fragmentation Applied for Peptide Identification",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2017/132401a367/12OmNzBwGAw",
"parentPublication": {
"id": "proceedings/bibe/2017/1324/0",
"title": "2017 IEEE 17th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssst/1994/5320/0/00287887",
"title": "Sequence determination of peptides from CID spectra using artificial neural networks",
"doi": null,
"abstractUrl": "/proceedings-article/ssst/1994/00287887/12OmNzTppGt",
"parentPublication": {
"id": "proceedings/ssst/1994/5320/0",
"title": "Proceedings of 26th Southeastern Symposium on System Theory",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2019/04/08329526",
"title": "Submodular Generalized Matching for Peptide Identification in Tandem Mass Spectrometry",
"doi": null,
"abstractUrl": "/journal/tb/2019/04/08329526/13rRUxBJhEk",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-iucc/2017/3790/0/379001b256",
"title": "Protein Quantitative Based on Simulated Annealing Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-iucc/2017/379001b256/17D45WXIkFH",
"parentPublication": {
"id": "proceedings/ispa-iucc/2017/3790/0",
"title": "2017 IEEE International Symposium on Parallel and Distributed Processing with Applications and 2017 IEEE International Conference on Ubiquitous Computing and Communications (ISPA/IUCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icci*cc/2022/9084/0/10101613",
"title": "De novo sequencing of multiple SILAC-based tandem mass spectra",
"doi": null,
"abstractUrl": "/proceedings-article/icci*cc/2022/10101613/1MwEyNFMeXe",
"parentPublication": {
"id": "proceedings/icci*cc/2022/9084/0",
"title": "2022 IEEE 21st International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "n0203",
"articleId": "13rRUx0geom",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "n0231",
"articleId": "13rRUILLktX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNs5rl3d",
"title": "January-February",
"year": "2011",
"issueNum": "01",
"idPrefix": "tb",
"pubType": "journal",
"volume": "8",
"label": "January-February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5lY",
"doi": "10.1109/TCBB.2008.136",
"abstract": "Constructing accurate computational models that explain how ions permeate through a biological ion channel is an important problem in biophysics and drug design. Brownian dynamics simulations are large-scale interacting particle computer simulations for modeling ion channel permeation but can be computationally prohibitive. In this paper, we show the somewhat surprising result that a small-dimensional semi-Markov model can generate events (such as conduction events and dwell times at binding sites in the protein) that are statistically indistinguishable from Brownian dynamics computer simulation. This approach enables the use of extrapolation techniques to predict channel conduction when performing the actual Brownian dynamics simulation that is computationally intractable. Numerical studies on the simulation of gramicidin A ion channels are presented.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Constructing accurate computational models that explain how ions permeate through a biological ion channel is an important problem in biophysics and drug design. Brownian dynamics simulations are large-scale interacting particle computer simulations for modeling ion channel permeation but can be computationally prohibitive. In this paper, we show the somewhat surprising result that a small-dimensional semi-Markov model can generate events (such as conduction events and dwell times at binding sites in the protein) that are statistically indistinguishable from Brownian dynamics computer simulation. This approach enables the use of extrapolation techniques to predict channel conduction when performing the actual Brownian dynamics simulation that is computationally intractable. Numerical studies on the simulation of gramicidin A ion channels are presented.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Constructing accurate computational models that explain how ions permeate through a biological ion channel is an important problem in biophysics and drug design. Brownian dynamics simulations are large-scale interacting particle computer simulations for modeling ion channel permeation but can be computationally prohibitive. In this paper, we show the somewhat surprising result that a small-dimensional semi-Markov model can generate events (such as conduction events and dwell times at binding sites in the protein) that are statistically indistinguishable from Brownian dynamics computer simulation. This approach enables the use of extrapolation techniques to predict channel conduction when performing the actual Brownian dynamics simulation that is computationally intractable. Numerical studies on the simulation of gramicidin A ion channels are presented.",
"title": "Semi-Markov Models for Brownian Dynamics Permeation in Biological Ion Channels",
"normalizedTitle": "Semi-Markov Models for Brownian Dynamics Permeation in Biological Ion Channels",
"fno": "ttb2011010273",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Ion Channel Permeation",
"Semi Markov Model",
"Brownian Dynamics",
"Binding Sites",
"Gramicidin"
],
"authors": [
{
"givenName": "Vikram",
"surname": "Krishnamurthy",
"fullName": "Vikram Krishnamurthy",
"affiliation": "University of British Columbia, Vancouver",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kai Yiu",
"surname": "Luk",
"fullName": "Kai Yiu Luk",
"affiliation": "University of British Columbia, Vancouver",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2011-01-01 00:00:00",
"pubType": "trans",
"pages": "273-281",
"year": "2011",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icassp/2004/8484/5/01327180",
"title": "Adaptive discrete stochastic optimization algorithm for learning Nernst potential in nerve cell membrane ion channels",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01327180/12OmNAS9zOn",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/5",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2009/3751/0/05160932",
"title": "Stochastic multi-particle Brownian Dynamics simulation of biological ion channels: A Finite Element approach",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2009/05160932/12OmNAolGK1",
"parentPublication": {
"id": "proceedings/ipdps/2009/3751/0",
"title": "2009 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdma/2011/4455/0/4455a132",
"title": "Acceleration of Ion Diffusion Due to the Electromagnetic Effects of Ion Currents in Nanochannels",
"doi": null,
"abstractUrl": "/proceedings-article/icdma/2011/4455a132/12OmNBOCWrf",
"parentPublication": {
"id": "proceedings/icdma/2011/4455/0",
"title": "2011 Second International Conference on Digital Manufacturing & Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmens/2003/1947/0/19470251",
"title": "Multi-Patch : A Chip-Based Ion-Channel Assay System for Drug Screening",
"doi": null,
"abstractUrl": "/proceedings-article/icmens/2003/19470251/12OmNCvLXZi",
"parentPublication": {
"id": "proceedings/icmens/2003/1947/0",
"title": "MEMS, NANO, and Smart Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isms/2012/4668/0/4668a417",
"title": "3D Modeling and Simulation of Electrohydrodynamic Ion-Drag Micropump with Different Configurations of Collector Electrode",
"doi": null,
"abstractUrl": "/proceedings-article/isms/2012/4668a417/12OmNxWuijI",
"parentPublication": {
"id": "proceedings/isms/2012/4668/0",
"title": "Intelligent Systems, Modelling and Simulation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2008/1969/0/04720669",
"title": "Work in progress - Java simulations of DSP algorithms for ion-channel sensors",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2008/04720669/12OmNxZkhst",
"parentPublication": {
"id": "proceedings/fie/2008/1969/0",
"title": "2008 38th Annual Frontiers in Education Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmens/2004/2189/0/21890137",
"title": "On the Design of an Electrohydrodynamic Ion-Drag Micropump",
"doi": null,
"abstractUrl": "/proceedings-article/icmens/2004/21890137/12OmNyRg4zO",
"parentPublication": {
"id": "proceedings/icmens/2004/2189/0",
"title": "International Conference on MEMS, NANO and Smart Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cinc/2009/3645/2/3645b433",
"title": "Optimal Portfolio Selection under the Short-range Fractional Brownian Motion",
"doi": null,
"abstractUrl": "/proceedings-article/cinc/2009/3645b433/12OmNzC5SDc",
"parentPublication": {
"id": "cinc/2009/3645/2",
"title": "Computational Intelligence and Natural Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icec/2009/3655/0/3655a265",
"title": "The Biological Effects of Low Energy C+ Ion Implantation on Peanut",
"doi": null,
"abstractUrl": "/proceedings-article/icec/2009/3655a265/12OmNzn38ZM",
"parentPublication": {
"id": "proceedings/icec/2009/3655/0",
"title": "Engineering Computation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2010/02/mcs2010020043",
"title": "Simulation of Ion Permeation in Biological Membranes",
"doi": null,
"abstractUrl": "/magazine/cs/2010/02/mcs2010020043/13rRUxASulr",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttb2011010266",
"articleId": "13rRUyoPSVx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttb2011010282",
"articleId": "13rRUxDItfL",
"__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": "13rRUxAAT7v",
"doi": "10.1109/TVCG.2006.182",
"abstract": "We present visualization tools for analyzing molecular simulations of liquid crystal (LC) behavior. The simulation data consists of terabytes of data describing the position and orientation of every molecule in the simulated system over time. Condensed matter physicists study the evolution of topological defects in these data, and our visualization tools focus on that goal. We first convert the discrete simulation data to a sampled version of a continuous second-order tensor field and then use combinations of visualization methods to simultaneously display combinations of contractions of the tensor data, providing an interactive environment for exploring these complicated data. The system, built using AVS, employs colored cutting planes, colored isosurfaces, and colored integral curves to display fields of tensor contractions including Westin's scalar cl, cp, and cs metrics and the principal eigenvector. Our approach has been in active use in the physics lab for over a year. It correctly displays structures already known; it displays the data in a spatially and temporally smoother way than earlier approaches, avoiding confusing grid effects and facilitating the study of multiple time steps; it extends the use of tools developed for visualizing diffusion tensor data, re-interpreting them in the context of molecular simulations; and it has answered long-standing questions regarding the orientation of molecules around defects and the conformational changes of the defects",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present visualization tools for analyzing molecular simulations of liquid crystal (LC) behavior. The simulation data consists of terabytes of data describing the position and orientation of every molecule in the simulated system over time. Condensed matter physicists study the evolution of topological defects in these data, and our visualization tools focus on that goal. We first convert the discrete simulation data to a sampled version of a continuous second-order tensor field and then use combinations of visualization methods to simultaneously display combinations of contractions of the tensor data, providing an interactive environment for exploring these complicated data. The system, built using AVS, employs colored cutting planes, colored isosurfaces, and colored integral curves to display fields of tensor contractions including Westin's scalar cl, cp, and cs metrics and the principal eigenvector. Our approach has been in active use in the physics lab for over a year. It correctly displays structures already known; it displays the data in a spatially and temporally smoother way than earlier approaches, avoiding confusing grid effects and facilitating the study of multiple time steps; it extends the use of tools developed for visualizing diffusion tensor data, re-interpreting them in the context of molecular simulations; and it has answered long-standing questions regarding the orientation of molecules around defects and the conformational changes of the defects",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present visualization tools for analyzing molecular simulations of liquid crystal (LC) behavior. The simulation data consists of terabytes of data describing the position and orientation of every molecule in the simulated system over time. Condensed matter physicists study the evolution of topological defects in these data, and our visualization tools focus on that goal. We first convert the discrete simulation data to a sampled version of a continuous second-order tensor field and then use combinations of visualization methods to simultaneously display combinations of contractions of the tensor data, providing an interactive environment for exploring these complicated data. The system, built using AVS, employs colored cutting planes, colored isosurfaces, and colored integral curves to display fields of tensor contractions including Westin's scalar cl, cp, and cs metrics and the principal eigenvector. Our approach has been in active use in the physics lab for over a year. It correctly displays structures already known; it displays the data in a spatially and temporally smoother way than earlier approaches, avoiding confusing grid effects and facilitating the study of multiple time steps; it extends the use of tools developed for visualizing diffusion tensor data, re-interpreting them in the context of molecular simulations; and it has answered long-standing questions regarding the orientation of molecules around defects and the conformational changes of the defects",
"title": "Techniques for the Visualization of Topological Defect Behavior in Nematic Liquid Crystals",
"normalizedTitle": "Techniques for the Visualization of Topological Defect Behavior in Nematic Liquid Crystals",
"fno": "v1323",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Digital Simulation",
"Nematic Liquid Crystals",
"Physics Computing",
"Tensors",
"Visualization Technique",
"Topological Defect Behavior",
"Nematic Liquid Crystals",
"Molecular Simulation Analyzing",
"Continuous Second Order Tensor Field",
"Physics Lab",
"Liquid Crystals",
"Liquid Crystal Displays",
"Data Visualization",
"Tensile Stress",
"Crystallization",
"Liquid Crystal Devices",
"Biological System Modeling",
"Numerical Simulation",
"Shape",
"Computational Modeling",
"Tensor Visualization",
"Case Studies",
"Liquid Crystals",
"Molecular Modeling"
],
"authors": [
{
"givenName": "Vadim",
"surname": "Slavin",
"fullName": "Vadim Slavin",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert",
"surname": "Pelcovits",
"fullName": "Robert Pelcovits",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "George",
"surname": "Loriot",
"fullName": "George Loriot",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrew",
"surname": "Callan-Jones",
"fullName": "Andrew Callan-Jones",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Laidlaw",
"fullName": "David Laidlaw",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "trans",
"pages": "1323-1328",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ipdps/2013/4971/0/4971a813",
"title": "Cyclops Tensor Framework: Reducing Communication and Eliminating Load Imbalance in Massively Parallel Contractions",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2013/4971a813/12OmNCmpcHn",
"parentPublication": {
"id": "proceedings/ipdps/2013/4971/0",
"title": "Parallel and Distributed Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdl/2002/7350/0/01022778",
"title": "Electrical and optical properties of discotic liquid crystals with various core structures",
"doi": null,
"abstractUrl": "/proceedings-article/icdl/2002/01022778/12OmNCmpcT5",
"parentPublication": {
"id": "proceedings/icdl/2002/7350/0",
"title": "Proceedings of 14th International Conference on Dielectric Liquids",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iqec/2005/9240/0/01560974",
"title": "Two beam coupling gain enhancement in porphyrin:Zn-doped nematic liquid crystals with an applied DC field and moving grating technique",
"doi": null,
"abstractUrl": "/proceedings-article/iqec/2005/01560974/12OmNCvLXXE",
"parentPublication": {
"id": "proceedings/iqec/2005/9240/0",
"title": "International Quantum Electronics Conference, 2005.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmpeur/1989/1940/0/00093363",
"title": "Electro-optical effects, liquid crystals and their application in displays",
"doi": null,
"abstractUrl": "/proceedings-article/cmpeur/1989/00093363/12OmNwnYFYu",
"parentPublication": {
"id": "proceedings/cmpeur/1989/1940/0",
"title": "COMPEURO 89 Proceedings VLSI and Computer Peripherals.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdl/2002/7350/0/01022777",
"title": "Optical property of photonic crystals infiltrated with various liquids and liquid crystals",
"doi": null,
"abstractUrl": "/proceedings-article/icdl/2002/01022777/12OmNzlUKrK",
"parentPublication": {
"id": "proceedings/icdl/2002/7350/0",
"title": "Proceedings of 14th International Conference on Dielectric Liquids",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1045",
"title": "Detection and Visualization of Defects in 3D Unstructured Models of Nematic Liquid Crystals",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1045/13rRUEgarnF",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1197",
"title": "Superellipsoid-based, Real Symmetric Traceless Tensor Glyphs Motivated by Nematic Liquid Crystal Alignment Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1197/13rRUNvgyWd",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iceee/2019/3910/0/391000a149",
"title": "60 GHz Beam-Steering Antenna Array Using Liquid Crystal Phase Shifter",
"doi": null,
"abstractUrl": "/proceedings-article/iceee/2019/391000a149/1cpqGObHnFu",
"parentPublication": {
"id": "proceedings/iceee/2019/3910/0",
"title": "2019 6th International Conference on Electrical and Electronics Engineering (ICEEE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1315",
"articleId": "13rRUwInuWq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1329",
"articleId": "13rRUxYrbUu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyQGSaC",
"title": "Jan.-Feb.",
"year": "2012",
"issueNum": "01",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "14",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxk89fi",
"doi": "10.1109/MCSE.2011.94",
"abstract": "Intriguing analogies were found between a model of plastic deformation in crystals and turbulence in fluids. A study of this model provides remarkable explanations of known experiments and predicts fractal dislocation pattern formation. Further, the challenges encountered resemble those in turbulence, which is exemplified in a comparison with the Rayleigh-Taylor instability.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Intriguing analogies were found between a model of plastic deformation in crystals and turbulence in fluids. A study of this model provides remarkable explanations of known experiments and predicts fractal dislocation pattern formation. Further, the challenges encountered resemble those in turbulence, which is exemplified in a comparison with the Rayleigh-Taylor instability.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Intriguing analogies were found between a model of plastic deformation in crystals and turbulence in fluids. A study of this model provides remarkable explanations of known experiments and predicts fractal dislocation pattern formation. Further, the challenges encountered resemble those in turbulence, which is exemplified in a comparison with the Rayleigh-Taylor instability.",
"title": "Is Dislocation Flow Turbulent in Deformed Crystals?",
"normalizedTitle": "Is Dislocation Flow Turbulent in Deformed Crystals?",
"fno": "mcs2012010033",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Dislocation Dynamics",
"Turbulence",
"Numerical Convergence",
"Fractal",
"Shocks"
],
"authors": [
{
"givenName": "Woosong",
"surname": "Choi",
"fullName": "Woosong Choi",
"affiliation": "Cornell University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yong S.",
"surname": "Chen",
"fullName": "Yong S. Chen",
"affiliation": "Cornell University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefanos",
"surname": "Papanikolaou",
"fullName": "Stefanos Papanikolaou",
"affiliation": "Cornell University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "James P.",
"surname": "Sethna",
"fullName": "James P. Sethna",
"affiliation": "Cornell University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2012-01-01 00:00:00",
"pubType": "mags",
"pages": "33-39",
"year": "2012",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cso/2011/4335/0/4335a086",
"title": "Application of K-E Model on the Numerical Simulation of a Semi-confined Slot Turbulent Impinging Jet",
"doi": null,
"abstractUrl": "/proceedings-article/cso/2011/4335a086/12OmNApu5H5",
"parentPublication": {
"id": "proceedings/cso/2011/4335/0",
"title": "2011 Fourth International Joint Conference on Computational Sciences and Optimization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcasia/1997/7901/0/79010093",
"title": "Simulation of aerodynamics problem on a distributed shared-memory machine",
"doi": null,
"abstractUrl": "/proceedings-article/hpcasia/1997/79010093/12OmNBKmXo4",
"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/isise/2008/3494/2/3494b447",
"title": "Numerical Simulation of 3-D Flow in Low Specific Speed Francis Runner with Splitter Blades",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2008/3494b447/12OmNrAMEZB",
"parentPublication": {
"id": "proceedings/isise/2008/3494/2",
"title": "2008 International Symposium on Information Science and Engineering (ISISE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vv/2004/8781/0/01374291",
"title": "Visualization of the energy-containing turbulent scales",
"doi": null,
"abstractUrl": "/proceedings-article/vv/2004/01374291/12OmNrH1PHb",
"parentPublication": {
"id": "proceedings/vv/2004/8781/0",
"title": "Volume Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icic/2011/688/0/05954569",
"title": "A Numerical Investigation of Effects of Different Nozzle Spacing on Turbulent Flow in a Novel Circular Jet Mixer",
"doi": null,
"abstractUrl": "/proceedings-article/icic/2011/05954569/12OmNxXUhO9",
"parentPublication": {
"id": "proceedings/icic/2011/688/0",
"title": "2011 Fourth International Conference on Information and Computing (ICIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2014/7502/0/7502a315",
"title": "Numerical Assessment of Turbulent Flow Downstream of Stenosed Aortic Valve with Flexible Leaflets Using Fluid-Solid Interactions Approach",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2014/7502a315/12OmNyoSbe7",
"parentPublication": {
"id": "proceedings/bibe/2014/7502/0",
"title": "2014 IEEE International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hipc/1996/7557/0/75570010",
"title": "Comparison of parallelization strategies for simulation of aerodynamics problem",
"doi": null,
"abstractUrl": "/proceedings-article/hipc/1996/75570010/12OmNz3bdPb",
"parentPublication": {
"id": "proceedings/hipc/1996/7557/0",
"title": "Proceedings of 3rd International Conference on High Performance Computing (HiPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/uksim/2010/4016/0/4016a216",
"title": "Cellular-Automaton Profiling of Acoustic Data for Feature Extraction of Turbulent Flow in Occluded Carotid Arteries",
"doi": null,
"abstractUrl": "/proceedings-article/uksim/2010/4016a216/12OmNz6iOMx",
"parentPublication": {
"id": "proceedings/uksim/2010/4016/0",
"title": "Computer Modeling and Simulation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2013/01/mcs2013010026",
"title": "Large-Eddy Simulations of Turbulent Incompressible Flows on GPU Clusters",
"doi": null,
"abstractUrl": "/magazine/cs/2013/01/mcs2013010026/13rRUEgs2x4",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/05/v1055",
"title": "Visualization of Vorticity and Vortices in Wall-Bounded Turbulent Flows",
"doi": null,
"abstractUrl": "/journal/tg/2007/05/v1055/13rRUILLkvi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcs2012010022",
"articleId": "13rRUNvya4T",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcs2012010040",
"articleId": "13rRUwInv8q",
"__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": "13rRUwI5TQN",
"doi": "10.1109/TVCG.2006.123",
"abstract": "Exploded views are an illustration technique where an object is partitioned into several segments. These segments are displaced to reveal otherwise hidden detail. In this paper we apply the concept of exploded views to volumetric data in order to solve the general problem of occlusion. In many cases an object of interest is occluded by other structures. While transparency or cutaways can be used to reveal a focus object, these techniques remove parts of the context information. Exploded views, on the other hand, do not suffer from this drawback. Our approach employs a force-based model: the volume is divided into a part configuration controlled by a number of forces and constraints. The focus object exerts an explosion force causing the parts to arrange according to the given constraints. We show that this novel and flexible approach allows for a wide variety of explosion-based visualizations including view-dependent explosions. Furthermore, we present a high-quality GPU-based volume ray casting algorithm for exploded views which allows rendering and interaction at several frames per second.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Exploded views are an illustration technique where an object is partitioned into several segments. These segments are displaced to reveal otherwise hidden detail. In this paper we apply the concept of exploded views to volumetric data in order to solve the general problem of occlusion. In many cases an object of interest is occluded by other structures. While transparency or cutaways can be used to reveal a focus object, these techniques remove parts of the context information. Exploded views, on the other hand, do not suffer from this drawback. Our approach employs a force-based model: the volume is divided into a part configuration controlled by a number of forces and constraints. The focus object exerts an explosion force causing the parts to arrange according to the given constraints. We show that this novel and flexible approach allows for a wide variety of explosion-based visualizations including view-dependent explosions. Furthermore, we present a high-quality GPU-based volume ray casting algorithm for exploded views which allows rendering and interaction at several frames per second.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Exploded views are an illustration technique where an object is partitioned into several segments. These segments are displaced to reveal otherwise hidden detail. In this paper we apply the concept of exploded views to volumetric data in order to solve the general problem of occlusion. In many cases an object of interest is occluded by other structures. While transparency or cutaways can be used to reveal a focus object, these techniques remove parts of the context information. Exploded views, on the other hand, do not suffer from this drawback. Our approach employs a force-based model: the volume is divided into a part configuration controlled by a number of forces and constraints. The focus object exerts an explosion force causing the parts to arrange according to the given constraints. We show that this novel and flexible approach allows for a wide variety of explosion-based visualizations including view-dependent explosions. Furthermore, we present a high-quality GPU-based volume ray casting algorithm for exploded views which allows rendering and interaction at several frames per second.",
"title": "Caricaturistic Visualization",
"normalizedTitle": "Caricaturistic Visualization",
"fno": "v1085",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Focusing",
"Context",
"Evolution Biology",
"Art",
"Humans",
"Face",
"Brain Modeling",
"Computer Graphics",
"Quality Control",
"Illustrative Visualization",
"Exploded Views",
"Volume Rendering"
],
"authors": [
{
"givenName": "Peter",
"surname": "Rautek",
"fullName": "Peter Rautek",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ivan",
"surname": "Viola",
"fullName": "Ivan Viola",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "M. Eduard",
"surname": "Gröller",
"fullName": "M. Eduard Gröller",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "trans",
"pages": "1085-1092",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2017/5738/0/08031604",
"title": "Interactive visualization of assembly instruction for stone tools restoration",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031604/12OmNqI04Ee",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1992/2910/0/00201597",
"title": "Surface modeling from dynamic integration of multiple range views",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1992/00201597/12OmNxEBz1h",
"parentPublication": {
"id": "proceedings/icpr/1992/2910/0",
"title": "1992 11th IAPR International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2015/7962/0/7962a242",
"title": "Exploded View Diagrams of 3D Grids",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2015/7962a242/12OmNy2rRVA",
"parentPublication": {
"id": "proceedings/sibgrapi/2015/7962/0",
"title": "2015 28th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/culture-computing/2013/5047/0/5047a177",
"title": "How is Culture and Cultural Development Possible?",
"doi": null,
"abstractUrl": "/proceedings-article/culture-computing/2013/5047a177/12OmNyugyNg",
"parentPublication": {
"id": "proceedings/culture-computing/2013/5047/0",
"title": "2013 International Conference on Culture and Computing (Culture Computing)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2007/2900/0/29000301",
"title": "Explode to Explain - Illustrative Information Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2007/29000301/12OmNz2TCBd",
"parentPublication": {
"id": "proceedings/iv/2007/2900/0",
"title": "2007 11th International Conference Information Visualization (IV '07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fosm/2008/2654/0/04659257",
"title": "Remixing visualization to support collaboration in software maintenance",
"doi": null,
"abstractUrl": "/proceedings-article/fosm/2008/04659257/12OmNzX6cqO",
"parentPublication": {
"id": "proceedings/fosm/2008/2654/0",
"title": "2008 IEEE International Conference on Software Maintenance",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/1993/3230/1/00270666",
"title": "Stochastic motif extraction using a genetic algorithm with the MDL principle",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1993/00270666/12OmNzhnaaQ",
"parentPublication": {
"id": "proceedings/hicss/1993/3230/1",
"title": "1993 The Twenty-sixth Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2006/04/n0408",
"title": "Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons",
"doi": null,
"abstractUrl": "/journal/tb/2006/04/n0408/13rRUNvya7N",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1077",
"title": "Exploded Views for Volume Data",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1077/13rRUwIF6kZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061311",
"title": "Exploded View Diagrams of Mathematical Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061311/13rRUx0Pqpt",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1077",
"articleId": "13rRUwIF6kZ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1093",
"articleId": "13rRUx0xPTJ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzXFovK",
"title": "October",
"year": "1997",
"issueNum": "10",
"idPrefix": "tp",
"pubType": "journal",
"volume": "19",
"label": "October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygT7yX",
"doi": "10.1109/34.625115",
"abstract": "Abstract—This paper deals with robust registration of object views in the presence of uncertainties and noise in depth data. Errors in registration of multiple views of a 3D object severely affect view integration during automatic construction of object models. We derive a minimum variance estimator (MVE) for computing the view transformation parameters accurately from range data of two views of a 3D object. The results of our experiments show that view transformation estimates obtained using MVE are significantly more accurate than those computed with an unweighted error criterion for registration.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—This paper deals with robust registration of object views in the presence of uncertainties and noise in depth data. Errors in registration of multiple views of a 3D object severely affect view integration during automatic construction of object models. We derive a minimum variance estimator (MVE) for computing the view transformation parameters accurately from range data of two views of a 3D object. The results of our experiments show that view transformation estimates obtained using MVE are significantly more accurate than those computed with an unweighted error criterion for registration.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—This paper deals with robust registration of object views in the presence of uncertainties and noise in depth data. Errors in registration of multiple views of a 3D object severely affect view integration during automatic construction of object models. We derive a minimum variance estimator (MVE) for computing the view transformation parameters accurately from range data of two views of a 3D object. The results of our experiments show that view transformation estimates obtained using MVE are significantly more accurate than those computed with an unweighted error criterion for registration.",
"title": "Optimal Registration of Object Views Using Range Data",
"normalizedTitle": "Optimal Registration of Object Views Using Range Data",
"fno": "i1131",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Image Registration",
"View Transformation Estimation",
"View Integration",
"Automatic Object Modeling",
"3 D Free Form Objects",
"Range Data"
],
"authors": [
{
"givenName": "Chitra",
"surname": "Dorai",
"fullName": "Chitra Dorai",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Weng",
"fullName": "John Weng",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anil K.",
"surname": "Jain",
"fullName": "Anil K. Jain",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "1997-10-01 00:00:00",
"pubType": "trans",
"pages": "1131-1138",
"year": "1997",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i1115",
"articleId": "13rRUwjXZKx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i1139",
"articleId": "13rRUxASuHd",
"__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": "13rRUx0Pqpt",
"doi": "10.1109/TVCG.2010.151",
"abstract": "We present a technique for visualizing complicated mathematical surfaces that is inspired by hand-designed topological illustrations. Our approach generates exploded views that expose the internal structure of such a surface by partitioning it into parallel slices, which are separated from each other along a single linear explosion axis. Our contributions include a set of simple, prescriptive design rules for choosing an explosion axis and placing cutting planes, as well as automatic algorithms for applying these rules. First we analyze the input shape to select the explosion axis based on the detected rotational and reflective symmetries of the input model. We then partition the shape into slices that are designed to help viewers better understand how the shape of the surface and its cross-sections vary along the explosion axis. Our algorithms work directly on triangle meshes, and do not depend on any specific parameterization of the surface. We generate exploded views for a variety of mathematical surfaces using our system.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a technique for visualizing complicated mathematical surfaces that is inspired by hand-designed topological illustrations. Our approach generates exploded views that expose the internal structure of such a surface by partitioning it into parallel slices, which are separated from each other along a single linear explosion axis. Our contributions include a set of simple, prescriptive design rules for choosing an explosion axis and placing cutting planes, as well as automatic algorithms for applying these rules. First we analyze the input shape to select the explosion axis based on the detected rotational and reflective symmetries of the input model. We then partition the shape into slices that are designed to help viewers better understand how the shape of the surface and its cross-sections vary along the explosion axis. Our algorithms work directly on triangle meshes, and do not depend on any specific parameterization of the surface. We generate exploded views for a variety of mathematical surfaces using our system.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a technique for visualizing complicated mathematical surfaces that is inspired by hand-designed topological illustrations. Our approach generates exploded views that expose the internal structure of such a surface by partitioning it into parallel slices, which are separated from each other along a single linear explosion axis. Our contributions include a set of simple, prescriptive design rules for choosing an explosion axis and placing cutting planes, as well as automatic algorithms for applying these rules. First we analyze the input shape to select the explosion axis based on the detected rotational and reflective symmetries of the input model. We then partition the shape into slices that are designed to help viewers better understand how the shape of the surface and its cross-sections vary along the explosion axis. Our algorithms work directly on triangle meshes, and do not depend on any specific parameterization of the surface. We generate exploded views for a variety of mathematical surfaces using our system.",
"title": "Exploded View Diagrams of Mathematical Surfaces",
"normalizedTitle": "Exploded View Diagrams of Mathematical Surfaces",
"fno": "ttg2010061311",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Exploded View Diagrams",
"Mathematical Visualization",
"Symmetry"
],
"authors": [
{
"givenName": "Olga",
"surname": "Karpenko",
"fullName": "Olga Karpenko",
"affiliation": "UC Berkeley",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wilmot",
"surname": "Li",
"fullName": "Wilmot Li",
"affiliation": "Adobe Systems",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Niloy",
"surname": "Mitra",
"fullName": "Niloy Mitra",
"affiliation": "KAUST / IIT Delhi",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Maneesh",
"surname": "Agrawala",
"fullName": "Maneesh Agrawala",
"affiliation": "UC Berkeley",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2010-11-01 00:00:00",
"pubType": "trans",
"pages": "1311-1318",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dpvt/2006/2825/0/04155745",
"title": "Estimating a-priori Unknown 3D Axially Symmetric Surfaces from Noisy Measurements of Their Fragments",
"doi": null,
"abstractUrl": "/proceedings-article/3dpvt/2006/04155745/12OmNB9bvhD",
"parentPublication": {
"id": "proceedings/3dpvt/2006/2825/0",
"title": "Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imsccs/2006/2581/1/25810720",
"title": "Reconstruction of Surfaces of Revolution",
"doi": null,
"abstractUrl": "/proceedings-article/imsccs/2006/25810720/12OmNBpEeVi",
"parentPublication": {
"id": "proceedings/imsccs/2006/2581/1",
"title": "Computer and Computational Sciences, International Multi-Symposiums on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/1997/7825/0/78250230",
"title": "Geodesic Voronoi Diagrams on Parametric Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/1997/78250230/12OmNwDACyS",
"parentPublication": {
"id": "proceedings/cgi/1997/7825/0",
"title": "Computer Graphics International Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscv/1995/7190/0/71900025",
"title": "View organization and matching of free-form objects",
"doi": null,
"abstractUrl": "/proceedings-article/iscv/1995/71900025/12OmNxw5Bkk",
"parentPublication": {
"id": "proceedings/iscv/1995/7190/0",
"title": "Computer Vision, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2015/7962/0/7962a242",
"title": "Exploded View Diagrams of 3D Grids",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2015/7962a242/12OmNy2rRVA",
"parentPublication": {
"id": "proceedings/sibgrapi/2015/7962/0",
"title": "2015 28th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ewdts/2017/3299/0/08110086",
"title": "Modeling of developable surfaces of three-dimensional geometric objects",
"doi": null,
"abstractUrl": "/proceedings-article/ewdts/2017/08110086/12OmNzV70zC",
"parentPublication": {
"id": "proceedings/ewdts/2017/3299/0",
"title": "2017 IEEE East-West Design & Test Symposium (EWDTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/07/ttg2013071172",
"title": "Pairwise Harmonics for Shape Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2013/07/ttg2013071172/13rRUEgarnJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2013/03/ttk2013030494",
"title": "A Bound on Kappa-Error Diagrams for Analysis of Classifier Ensembles",
"doi": null,
"abstractUrl": "/journal/tk/2013/03/ttk2013030494/13rRUILtJmv",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2005/01/i0099",
"title": "Metric 3D Reconstruction and Texture Acquisition of Surfaces of Revolution from a Single Uncalibrated View",
"doi": null,
"abstractUrl": "/journal/tp/2005/01/i0099/13rRUwInvm2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2003/07/i0895",
"title": "On the Intrinsic Reconstruction of Shape from Its Symmetries",
"doi": null,
"abstractUrl": "/journal/tp/2003/07/i0895/13rRUxd2aZO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010061301",
"articleId": "13rRUxly8XC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010061319",
"articleId": "13rRUIJcWlk",
"__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": "13rRUzpzeB3",
"doi": "10.1109/TVCG.2012.222",
"abstract": "We evaluate and compare video visualization techniques based on fast-forward. A controlled laboratory user study (n = 24) was conducted to determine the trade-off between support of object identification and motion perception, two properties that have to be considered when choosing a particular fast-forward visualization. We compare four different visualizations: two representing the state-of-the-art and two new variants of visualization introduced in this paper. The two state-of-the-art methods we consider are frame-skipping and temporal blending of successive frames. Our object trail visualization leverages a combination of frame-skipping and temporal blending, whereas predictive trajectory visualization supports motion perception by augmenting the video frames with an arrow that indicates the future object trajectory. Our hypothesis was that each of the state-of-the-art methods satisfies just one of the goals: support of object identification or motion perception. Thus, they represent both ends of the visualization design. The key findings of the evaluation are that object trail visualization supports object identification, whereas predictive trajectory visualization is most useful for motion perception. However, frame-skipping surprisingly exhibits reasonable performance for both tasks. Furthermore, we evaluate the subjective performance of three different playback speed visualizations for adaptive fast-forward, a subdomain of video fast-forward.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We evaluate and compare video visualization techniques based on fast-forward. A controlled laboratory user study (n = 24) was conducted to determine the trade-off between support of object identification and motion perception, two properties that have to be considered when choosing a particular fast-forward visualization. We compare four different visualizations: two representing the state-of-the-art and two new variants of visualization introduced in this paper. The two state-of-the-art methods we consider are frame-skipping and temporal blending of successive frames. Our object trail visualization leverages a combination of frame-skipping and temporal blending, whereas predictive trajectory visualization supports motion perception by augmenting the video frames with an arrow that indicates the future object trajectory. Our hypothesis was that each of the state-of-the-art methods satisfies just one of the goals: support of object identification or motion perception. Thus, they represent both ends of the visualization design. The key findings of the evaluation are that object trail visualization supports object identification, whereas predictive trajectory visualization is most useful for motion perception. However, frame-skipping surprisingly exhibits reasonable performance for both tasks. Furthermore, we evaluate the subjective performance of three different playback speed visualizations for adaptive fast-forward, a subdomain of video fast-forward.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We evaluate and compare video visualization techniques based on fast-forward. A controlled laboratory user study (n = 24) was conducted to determine the trade-off between support of object identification and motion perception, two properties that have to be considered when choosing a particular fast-forward visualization. We compare four different visualizations: two representing the state-of-the-art and two new variants of visualization introduced in this paper. The two state-of-the-art methods we consider are frame-skipping and temporal blending of successive frames. Our object trail visualization leverages a combination of frame-skipping and temporal blending, whereas predictive trajectory visualization supports motion perception by augmenting the video frames with an arrow that indicates the future object trajectory. Our hypothesis was that each of the state-of-the-art methods satisfies just one of the goals: support of object identification or motion perception. Thus, they represent both ends of the visualization design. The key findings of the evaluation are that object trail visualization supports object identification, whereas predictive trajectory visualization is most useful for motion perception. However, frame-skipping surprisingly exhibits reasonable performance for both tasks. Furthermore, we evaluate the subjective performance of three different playback speed visualizations for adaptive fast-forward, a subdomain of video fast-forward.",
"title": "Evaluation of Fast-Forward Video Visualization",
"normalizedTitle": "Evaluation of Fast-Forward Video Visualization",
"fno": "ttg2012122095",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Video Signal Processing",
"Data Visualisation",
"Image Motion Analysis",
"Adaptive Fast Forward",
"Fast Forward Video Visualization Evaluation",
"Object Identification",
"Motion Perception",
"Frame Skipping",
"Successive Frames Temporal Blending",
"Object Trail Visualization",
"Predictive Trajectory Visualization",
"Video Frames",
"Object Trajectory",
"Playback Speed Visualizations",
"Visualization",
"Image Color Analysis",
"Trajectory",
"Data Visualization",
"Rendering Computer Graphics",
"Acceleration",
"Video Recording",
"Controlled Laboratory User Study",
"Video Visualization",
"Adaptive Fast Forward"
],
"authors": [
{
"givenName": "M.",
"surname": "Hoferlin",
"fullName": "M. Hoferlin",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "K.",
"surname": "Kurzhals",
"fullName": "K. Kurzhals",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "B.",
"surname": "Hoferlin",
"fullName": "B. Hoferlin",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "G.",
"surname": "Heidemann",
"fullName": "G. Heidemann",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "D.",
"surname": "Weiskopf",
"fullName": "D. Weiskopf",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2095-2103",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/jcdl/2003/1939/0/19390221",
"title": "How Fast Is Too Fast? Evaluating Fast Forward Surrogates for Digital Video",
"doi": null,
"abstractUrl": "/proceedings-article/jcdl/2003/19390221/12OmNAhxjEr",
"parentPublication": {
"id": "proceedings/jcdl/2003/1939/0",
"title": "Digital Libraries, Joint Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iih-msp/2010/4222/0/4222a256",
"title": "Adaptive Forward Error Correction Combined with Packet Size Control for Wireless Video",
"doi": null,
"abstractUrl": "/proceedings-article/iih-msp/2010/4222a256/12OmNCdTeNW",
"parentPublication": {
"id": "proceedings/iih-msp/2010/4222/0",
"title": "Intelligent Information Hiding and Multimedia Signal Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300054",
"title": "Video visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300054/12OmNqFrGtk",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmcs/1999/0253/2/02530846",
"title": "Fast Forward and Fast Rewind Play System Based on the MPEG System Stream with New Concept",
"doi": null,
"abstractUrl": "/proceedings-article/icmcs/1999/02530846/12OmNs5rkWL",
"parentPublication": {
"id": "proceedings/icmcs/1999/0253/2",
"title": "Multimedia Computing and Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2008/2570/0/04607650",
"title": "Mobile TV using scalable video coding and layer-aware forward error correction",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2008/04607650/12OmNvUaNoo",
"parentPublication": {
"id": "proceedings/icme/2008/2570/0",
"title": "2008 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/1999/0210/0/02100572",
"title": "Fast 3D Visualization of Road Product Models",
"doi": null,
"abstractUrl": "/proceedings-article/iv/1999/02100572/12OmNvlxJqd",
"parentPublication": {
"id": "proceedings/iv/1999/0210/0",
"title": "1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcv/2001/1110/0/11100021",
"title": "A New Methodology For Implementing Interactive Operations Of Mpeg-2 Compressed Video",
"doi": null,
"abstractUrl": "/proceedings-article/dcv/2001/11100021/12OmNwE9OqI",
"parentPublication": {
"id": "proceedings/dcv/2001/1110/0",
"title": "Digital and Computational Video, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smc-it/2011/4446/0/4446a061",
"title": "A DTN-Based Multiple Access Fast Forward Service for the NASA Space Network",
"doi": null,
"abstractUrl": "/proceedings-article/smc-it/2011/4446a061/12OmNxETanH",
"parentPublication": {
"id": "proceedings/smc-it/2011/4446/0",
"title": "Space Mission Challenges for Information Technology, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/alpit/2007/2930/0/2930a469",
"title": "Based on Forward Reference Object Transaction Identification Algorithm on Web Mining",
"doi": null,
"abstractUrl": "/proceedings-article/alpit/2007/2930a469/12OmNxbEtGr",
"parentPublication": {
"id": "proceedings/alpit/2007/2930/0",
"title": "Advanced Language Processing and Web Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1093",
"title": "Visual Signatures in Video Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1093/13rRUx0xPTJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012122088",
"articleId": "13rRUygT7mW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122104",
"articleId": "13rRUwInvJf",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFwV",
"name": "ttg2012122095s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012122095s1.mp4",
"extension": "mp4",
"size": "42.2 MB",
"__typename": "WebExtraType"
},
{
"id": "17ShDTXnFwU",
"name": "ttg2012122095s1.txt",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012122095s1.txt",
"extension": "txt",
"size": "246 B",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNy5R3uQ",
"title": "May",
"year": "2014",
"issueNum": "05",
"idPrefix": "tk",
"pubType": "journal",
"volume": "26",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxD9gYb",
"doi": "10.1109/TKDE.2013.44",
"abstract": "Result diversification has recently attracted considerable attention as a means of increasing user satisfaction in recommender systems, as well as in web and database search. In this paper, we focus on the problem of selecting the k-most diverse items from a result set. Whereas previous research has mainly considered the static version of the problem, in this paper, we exploit the dynamic case in which the result set changes over time, as for example, in the case of notification services. We define the CONTINUOUS k-DIVERSITY PROBLEM along with appropriate constraints that enforce continuity requirements on the diversified results. Our proposed approach is based on cover trees and supports dynamic item insertion and deletion. The diversification problem is in general NP-hard; we provide theoretical bounds that characterize the quality of our cover tree solution with respect to the optimal one. Since results are often associated with a relevance score, we extend our approach to account for relevance. Finally, we report experimental results concerning the efficiency and effectiveness of our approach on a variety of real and synthetic datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Result diversification has recently attracted considerable attention as a means of increasing user satisfaction in recommender systems, as well as in web and database search. In this paper, we focus on the problem of selecting the k-most diverse items from a result set. Whereas previous research has mainly considered the static version of the problem, in this paper, we exploit the dynamic case in which the result set changes over time, as for example, in the case of notification services. We define the CONTINUOUS k-DIVERSITY PROBLEM along with appropriate constraints that enforce continuity requirements on the diversified results. Our proposed approach is based on cover trees and supports dynamic item insertion and deletion. The diversification problem is in general NP-hard; we provide theoretical bounds that characterize the quality of our cover tree solution with respect to the optimal one. Since results are often associated with a relevance score, we extend our approach to account for relevance. Finally, we report experimental results concerning the efficiency and effectiveness of our approach on a variety of real and synthetic datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Result diversification has recently attracted considerable attention as a means of increasing user satisfaction in recommender systems, as well as in web and database search. In this paper, we focus on the problem of selecting the k-most diverse items from a result set. Whereas previous research has mainly considered the static version of the problem, in this paper, we exploit the dynamic case in which the result set changes over time, as for example, in the case of notification services. We define the CONTINUOUS k-DIVERSITY PROBLEM along with appropriate constraints that enforce continuity requirements on the diversified results. Our proposed approach is based on cover trees and supports dynamic item insertion and deletion. The diversification problem is in general NP-hard; we provide theoretical bounds that characterize the quality of our cover tree solution with respect to the optimal one. Since results are often associated with a relevance score, we extend our approach to account for relevance. Finally, we report experimental results concerning the efficiency and effectiveness of our approach on a variety of real and synthetic datasets.",
"title": "Diverse Set Selection Over Dynamic Data",
"normalizedTitle": "Diverse Set Selection Over Dynamic Data",
"fno": "06477041",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Tree Data Structures",
"Computational Complexity",
"Database Management Systems",
"Human Factors",
"Information Filtering",
"Internet",
"Optimisation",
"Recommender Systems",
"Indexing Methods",
"User Satisfaction",
"Recommender Systems",
"Database Search",
"K Most Diverse Item Selection",
"Continuous K Diversity Problem",
"Continuity Requirements",
"Dynamic Item Insertion",
"Dynamic Item Deletion",
"NP Hard Diversification Problem",
"Cover Tree Solution",
"Synthetic Datasets",
"Real Datasets",
"Information Filtering",
"Heuristic Algorithms",
"Diversity Reception",
"Approximation Algorithms",
"Silicon",
"Complexity Theory",
"Indexes",
"Computational Modeling",
"Selection Process",
"Information Technology And Systems",
"Database Management",
"Physical Design",
"Database Applications",
"Information Storage And Retrieval",
"Information Search And Retrieval",
"Information Filtering",
"Similarity Measures",
"Indexing Methods",
"Selection Process",
"Information Filtering",
"Search Process"
],
"authors": [
{
"givenName": "Marina",
"surname": "Drosou",
"fullName": "Marina Drosou",
"affiliation": "Comput. Sci. Dept., Univ. of Ioannina, Ioannina, Greece",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Evaggelia",
"surname": "Pitoura",
"fullName": "Evaggelia Pitoura",
"affiliation": "Comput. Sci. Dept., Univ. of Ioannina, Ioannina, Greece",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2014-05-01 00:00:00",
"pubType": "trans",
"pages": "1102-1116",
"year": "2014",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pdcat/2017/3151/0/315101a086",
"title": "NMFDIV: A Nonnegative Matrix Factorization Approach for Search Result Diversification on Attributed Networks",
"doi": null,
"abstractUrl": "/proceedings-article/pdcat/2017/315101a086/12OmNANBZvO",
"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/icdar/2007/2822/1/28220422",
"title": "K-Nearest Oracle for Dynamic Ensemble Selection",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2007/28220422/12OmNAqU4T2",
"parentPublication": {
"id": "proceedings/icdar/2007/2822/1",
"title": "Ninth International Conference on Document Analysis and Recognition (ICDAR 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/micai/2015/0322/0/07429427",
"title": "Building a Diverse Ensemble for Classification",
"doi": null,
"abstractUrl": "/proceedings-article/micai/2015/07429427/12OmNrHB1S2",
"parentPublication": {
"id": "proceedings/micai/2015/0322/0",
"title": "2015 Fourteenth Mexican International Conference on Artificial Intelligence (MICAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/grc/2011/0372/0/06122691",
"title": "Gene selection algorithm combining ReliefF and relative neighborhood rough set",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2011/06122691/12OmNvT2oVm",
"parentPublication": {
"id": "proceedings/grc/2011/0372/0",
"title": "2011 IEEE International Conference on Granular Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2006/2701/0/270100834",
"title": "Diverse Topic Phrase Extraction through Latent Semantic Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2006/270100834/12OmNvjgWxO",
"parentPublication": {
"id": "proceedings/icdm/2006/2701/0",
"title": "Sixth International Conference on Data Mining (ICDM'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209d624",
"title": "Identifying Diverse Set of Images in Flickr",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209d624/12OmNxcMSm5",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2018/5520/0/552000a365",
"title": "Task Relevance and Diversity as Worker Motivation in Crowdsourcing",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2018/552000a365/14Fq0W8dzaO",
"parentPublication": {
"id": "proceedings/icde/2018/5520/0",
"title": "2018 IEEE 34th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2018/12/08327532",
"title": "Diverse Relevance Feedback for Time Series with Autoencoder Based Summarizations",
"doi": null,
"abstractUrl": "/journal/tk/2018/12/08327532/17D45Wc1IM3",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2022/0915/0/091500d361",
"title": "Novel Ensemble Diversification Methods for Open-Set Scenarios",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2022/091500d361/1B12HNAlWog",
"parentPublication": {
"id": "proceedings/wacv/2022/0915/0",
"title": "2022 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mdm/2020/4663/0/09162294",
"title": "Semantically Diverse Path Search",
"doi": null,
"abstractUrl": "/proceedings-article/mdm/2020/09162294/1m6hGMWqfgk",
"parentPublication": {
"id": "proceedings/mdm/2020/4663/0",
"title": "2020 21st IEEE International Conference on Mobile Data Management (MDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06552197",
"articleId": "13rRUxBJhvU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06570474",
"articleId": "13rRUxlgxTP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwCsdFw",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tk",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1MhE5xz6Dy8",
"doi": "10.1109/TKDE.2023.3266595",
"abstract": "Multi-view unsupervised feature selection (MUFS) has been demonstrated as an effective technique to reduce the dimensionality of multi-view unlabeled data. The existing methods assume that all of views are complete. However, multi-view data are usually incomplete, i.e., a part of instances are presented on some views but not all views. Besides, learning the complete similarity graph, as an important promising technology in existing MUFS methods, cannot achieve due to the missing views. In this paper, we propose a complementary and consensus learning-based incomplete multi-view unsupervised feature selection method (C <inline-formula><tex-math notation=\"LaTeX\">Z_$^{2}$_Z</tex-math></inline-formula> IMUFS) to address the aforementioned issues. Concretely, C <inline-formula><tex-math notation=\"LaTeX\">Z_$^{2}$_Z</tex-math></inline-formula> IMUFS integrates feature selection into an extended weighted non-negative matrix factorization model equipped with adaptive learning of view-weights and a sparse <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,p}$_Z</tex-math></inline-formula>-norm, which can offer better adaptability and flexibility. By the sparse linear combinations of multiple similarity matrices derived from different views, a complementary learning-guided similarity matrix reconstruction model is presented to obtain the complete similarity graph in each view. Furthermore, C <inline-formula><tex-math notation=\"LaTeX\">Z_$^{2}$_Z</tex-math></inline-formula> IMUFS learns a consensus clustering indicator matrix across different views and embeds it into a spectral graph term to preserve the local geometric structure. Comprehensive experimental results on real-world datasets demonstrate the effectiveness of C <inline-formula><tex-math notation=\"LaTeX\">Z_$^{2}$_Z</tex-math></inline-formula> IMUFS compared with state-of-the-art methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Multi-view unsupervised feature selection (MUFS) has been demonstrated as an effective technique to reduce the dimensionality of multi-view unlabeled data. The existing methods assume that all of views are complete. However, multi-view data are usually incomplete, i.e., a part of instances are presented on some views but not all views. Besides, learning the complete similarity graph, as an important promising technology in existing MUFS methods, cannot achieve due to the missing views. In this paper, we propose a complementary and consensus learning-based incomplete multi-view unsupervised feature selection method (C <inline-formula><tex-math notation=\"LaTeX\">$^{2}$</tex-math></inline-formula> IMUFS) to address the aforementioned issues. Concretely, C <inline-formula><tex-math notation=\"LaTeX\">$^{2}$</tex-math></inline-formula> IMUFS integrates feature selection into an extended weighted non-negative matrix factorization model equipped with adaptive learning of view-weights and a sparse <inline-formula><tex-math notation=\"LaTeX\">$\\ell _{2,p}$</tex-math></inline-formula>-norm, which can offer better adaptability and flexibility. By the sparse linear combinations of multiple similarity matrices derived from different views, a complementary learning-guided similarity matrix reconstruction model is presented to obtain the complete similarity graph in each view. Furthermore, C <inline-formula><tex-math notation=\"LaTeX\">$^{2}$</tex-math></inline-formula> IMUFS learns a consensus clustering indicator matrix across different views and embeds it into a spectral graph term to preserve the local geometric structure. Comprehensive experimental results on real-world datasets demonstrate the effectiveness of C <inline-formula><tex-math notation=\"LaTeX\">$^{2}$</tex-math></inline-formula> IMUFS compared with state-of-the-art methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Multi-view unsupervised feature selection (MUFS) has been demonstrated as an effective technique to reduce the dimensionality of multi-view unlabeled data. The existing methods assume that all of views are complete. However, multi-view data are usually incomplete, i.e., a part of instances are presented on some views but not all views. Besides, learning the complete similarity graph, as an important promising technology in existing MUFS methods, cannot achieve due to the missing views. In this paper, we propose a complementary and consensus learning-based incomplete multi-view unsupervised feature selection method (C - IMUFS) to address the aforementioned issues. Concretely, C - IMUFS integrates feature selection into an extended weighted non-negative matrix factorization model equipped with adaptive learning of view-weights and a sparse --norm, which can offer better adaptability and flexibility. By the sparse linear combinations of multiple similarity matrices derived from different views, a complementary learning-guided similarity matrix reconstruction model is presented to obtain the complete similarity graph in each view. Furthermore, C - IMUFS learns a consensus clustering indicator matrix across different views and embeds it into a spectral graph term to preserve the local geometric structure. Comprehensive experimental results on real-world datasets demonstrate the effectiveness of C - IMUFS compared with state-of-the-art methods.",
"title": "C<sup>2</sup>IMUFS: Complementary and Consensus Learning-based Incomplete Multi-view Unsupervised Feature Selection",
"normalizedTitle": "C2IMUFS: Complementary and Consensus Learning-based Incomplete Multi-view Unsupervised Feature Selection",
"fno": "10100894",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Feature Extraction",
"Sparse Matrices",
"Adaptation Models",
"Task Analysis",
"Diversity Reception",
"Visualization",
"Data Models",
"Complementary And Consensus Information",
"Incomplete Multi View Data",
"Unsupervised Feature Selection",
"Weighted Non Negative Matrix Factorization"
],
"authors": [
{
"givenName": "Yanyong",
"surname": "Huang",
"fullName": "Yanyong Huang",
"affiliation": "School of Statistics, Southwestern University of Finance and Economics, Chengdu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zongxin",
"surname": "Shen",
"fullName": "Zongxin Shen",
"affiliation": "School of Statistics, Southwestern University of Finance and Economics, Chengdu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuxin",
"surname": "Cai",
"fullName": "Yuxin Cai",
"affiliation": "School of Statistics, Southwestern University of Finance and Economics, Chengdu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiuwen",
"surname": "Yi",
"fullName": "Xiuwen Yi",
"affiliation": "JD Intelligent Cities Research and JD Intelligent Cities Business Unit, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dongjie",
"surname": "Wang",
"fullName": "Dongjie Wang",
"affiliation": "College of Engineering and Computer Science, University of Central Florida, Orland, FL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fengmao",
"surname": "Lv",
"fullName": "Fengmao Lv",
"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"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "1-14",
"year": "5555",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tk/2023/06/09759987",
"title": "Sparse and Flexible Projections for Unsupervised Feature Selection",
"doi": null,
"abstractUrl": "/journal/tk/2023/06/09759987/1CHsvtlNSSI",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09795326",
"title": "Least-Mean-Squares Coresets for Infinite Streams",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09795326/1Ecp81i5G00",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09860070",
"title": "Multi-View Subspace Clustering by Joint Measuring of Consistency and Diversity",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09860070/1FUYxtqFZNS",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09893402",
"title": "Structured Sparse Non-negative Matrix Factorization with <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,0}$_Z</tex-math></inline-formula>-Norm",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09893402/1GGLdY0vH0c",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/5555/01/10021823",
"title": "Efficient Fault-Tolerant Consensus for Collaborative Services in Edge Computing",
"doi": null,
"abstractUrl": "/journal/tc/5555/01/10021823/1K3XICRZPoY",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/10091452",
"title": "Sparse Quadratic Approximation for Graph Learning",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/10091452/1M2IHz1BulG",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/05/09241452",
"title": "Enhanced Group Sparse Regularized Nonconvex Regression for Face Recognition",
"doi": null,
"abstractUrl": "/journal/tp/2022/05/09241452/1ogEy0c42R2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/05/09444882",
"title": "Coordinate Descent Method for <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-means",
"doi": null,
"abstractUrl": "/journal/tp/2022/05/09444882/1u51seEJDiM",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/10/09463735",
"title": "Signed Graph Metric Learning via Gershgorin Disc Perfect Alignment",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09463735/1uFxm1okYhO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2021/10/09537904",
"title": "Performance and Accuracy Tradeoffs for Training Graph Neural Networks on ReRAM-Based Architectures",
"doi": null,
"abstractUrl": "/journal/si/2021/10/09537904/1wUXlbCto3e",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10098143",
"articleId": "1Mg6aWW4Ive",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10100867",
"articleId": "1MhE5R03QI0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1MjiZb2lxFS",
"name": "ttk555501-010100894s1-supp1-3266595.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttk555501-010100894s1-supp1-3266595.pdf",
"extension": "pdf",
"size": "517 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrMZpqJ",
"title": "January",
"year": "1996",
"issueNum": "01",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "16",
"label": "January",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy0ZzUT",
"doi": "10.1109/38.481602",
"abstract": "Craniofacial surgery is guided by 3D images reconstructed from CT or MR scans, but the validity of these graphically rendered images has not been tested under controlled circumstances. We simulated craniofacial surgical procedures and tested each step in the process used to create and apply the images against an independent standard for truth. The ability to measure 3D bony objects in these image volumes was tested for accuracy and repeatability. Surgery was simulated and performed on cadavers and the results compared with direct measurements. Surgical correction of craniofacial abnormalities in three pediatric patients was tested for the validity of the simulations. We found that the 3D spatial measurement accuracy of 3D image volumes obtained from CT scans was high, allowing surface landmark identification within 1 voxel, physical change detection within 1 mm and 2 degrees, and matching of surfaces within 1 degree and 1 voxel under ideal conditions. The error increased to 4 mm and 3 degrees on the average in cadaver and patient simulations. 3D CT reconstructions provide acceptable bony structural detail for planning and describing craniofacial surgical interventions, and surgical simulation images accurately depict post-operative outcome.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Craniofacial surgery is guided by 3D images reconstructed from CT or MR scans, but the validity of these graphically rendered images has not been tested under controlled circumstances. We simulated craniofacial surgical procedures and tested each step in the process used to create and apply the images against an independent standard for truth. The ability to measure 3D bony objects in these image volumes was tested for accuracy and repeatability. Surgery was simulated and performed on cadavers and the results compared with direct measurements. Surgical correction of craniofacial abnormalities in three pediatric patients was tested for the validity of the simulations. We found that the 3D spatial measurement accuracy of 3D image volumes obtained from CT scans was high, allowing surface landmark identification within 1 voxel, physical change detection within 1 mm and 2 degrees, and matching of surfaces within 1 degree and 1 voxel under ideal conditions. The error increased to 4 mm and 3 degrees on the average in cadaver and patient simulations. 3D CT reconstructions provide acceptable bony structural detail for planning and describing craniofacial surgical interventions, and surgical simulation images accurately depict post-operative outcome.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Craniofacial surgery is guided by 3D images reconstructed from CT or MR scans, but the validity of these graphically rendered images has not been tested under controlled circumstances. We simulated craniofacial surgical procedures and tested each step in the process used to create and apply the images against an independent standard for truth. The ability to measure 3D bony objects in these image volumes was tested for accuracy and repeatability. Surgery was simulated and performed on cadavers and the results compared with direct measurements. Surgical correction of craniofacial abnormalities in three pediatric patients was tested for the validity of the simulations. We found that the 3D spatial measurement accuracy of 3D image volumes obtained from CT scans was high, allowing surface landmark identification within 1 voxel, physical change detection within 1 mm and 2 degrees, and matching of surfaces within 1 degree and 1 voxel under ideal conditions. The error increased to 4 mm and 3 degrees on the average in cadaver and patient simulations. 3D CT reconstructions provide acceptable bony structural detail for planning and describing craniofacial surgical interventions, and surgical simulation images accurately depict post-operative outcome.",
"title": "Assessing Craniofacial Surgical Simulation",
"normalizedTitle": "Assessing Craniofacial Surgical Simulation",
"fno": "mcg1996010046",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Computer Aided Surgery",
"Surgical Simulation",
"Computer Surgical Simulation",
"Surgical Planning",
"Biomedical Computer Graphics",
"3 D Computed Tomography",
"Craniofacial Surgery"
],
"authors": [
{
"givenName": "Vikas V.",
"surname": "Patel",
"fullName": "Vikas V. Patel",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael W.",
"surname": "Vannier",
"fullName": "Michael W. Vannier",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeffrey L.",
"surname": "Marsh",
"fullName": "Jeffrey L. Marsh",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lun-Jou",
"surname": "Lo",
"fullName": "Lun-Jou Lo",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "1996-01-01 00:00:00",
"pubType": "mags",
"pages": "46-54",
"year": "1996",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "mcg1996010039",
"articleId": "13rRUxZ0o3R",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg1996010055",
"articleId": "13rRUIJuxxN",
"__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": "17D45XfSEST",
"doi": "10.1109/TVCG.2018.2864901",
"abstract": "Ensemble sensitivity analysis (ESA) has been established in the atmospheric sciences as a correlation-based approach to determine the sensitivity of a scalar forecast quantity computed by a numerical weather prediction model to changes in another model variable at a different model state. Its applications include determining the origin of forecast errors and placing targeted observations to improve future forecasts. We - a team of visualization scientists and meteorologists - present a visual analysis framework to improve upon current practice of ESA. We support the user in selecting regions to compute a meaningful target forecast quantity by embedding correlation-based grid-point clustering to obtain statistically coherent regions. The evolution of sensitivity features computed via ESA are then traced through time, by integrating a quantitative measure of feature matching into optical-flow-based feature assignment, and displayed by means of a swipe-path showing the geo-spatial evolution of the sensitivities. Visualization of the internal correlation structure of computed features guides the user towards those features robustly predicting a certain weather event. We demonstrate the use of our method by application to real-world 2D and 3D cases that occurred during the 2016 NAWDEX field campaign, showing the interactive generation of hypothesis chains to explore how atmospheric processes sensitive to each other are interrelated.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Ensemble sensitivity analysis (ESA) has been established in the atmospheric sciences as a correlation-based approach to determine the sensitivity of a scalar forecast quantity computed by a numerical weather prediction model to changes in another model variable at a different model state. Its applications include determining the origin of forecast errors and placing targeted observations to improve future forecasts. We - a team of visualization scientists and meteorologists - present a visual analysis framework to improve upon current practice of ESA. We support the user in selecting regions to compute a meaningful target forecast quantity by embedding correlation-based grid-point clustering to obtain statistically coherent regions. The evolution of sensitivity features computed via ESA are then traced through time, by integrating a quantitative measure of feature matching into optical-flow-based feature assignment, and displayed by means of a swipe-path showing the geo-spatial evolution of the sensitivities. Visualization of the internal correlation structure of computed features guides the user towards those features robustly predicting a certain weather event. We demonstrate the use of our method by application to real-world 2D and 3D cases that occurred during the 2016 NAWDEX field campaign, showing the interactive generation of hypothesis chains to explore how atmospheric processes sensitive to each other are interrelated.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Ensemble sensitivity analysis (ESA) has been established in the atmospheric sciences as a correlation-based approach to determine the sensitivity of a scalar forecast quantity computed by a numerical weather prediction model to changes in another model variable at a different model state. Its applications include determining the origin of forecast errors and placing targeted observations to improve future forecasts. We - a team of visualization scientists and meteorologists - present a visual analysis framework to improve upon current practice of ESA. We support the user in selecting regions to compute a meaningful target forecast quantity by embedding correlation-based grid-point clustering to obtain statistically coherent regions. The evolution of sensitivity features computed via ESA are then traced through time, by integrating a quantitative measure of feature matching into optical-flow-based feature assignment, and displayed by means of a swipe-path showing the geo-spatial evolution of the sensitivities. Visualization of the internal correlation structure of computed features guides the user towards those features robustly predicting a certain weather event. We demonstrate the use of our method by application to real-world 2D and 3D cases that occurred during the 2016 NAWDEX field campaign, showing the interactive generation of hypothesis chains to explore how atmospheric processes sensitive to each other are interrelated.",
"title": "Visual Analysis of the Temporal Evolution of Ensemble Forecast Sensitivities",
"normalizedTitle": "Visual Analysis of the Temporal Evolution of Ensemble Forecast Sensitivities",
"fno": "08440839",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Geophysics Computing",
"Sensitivity Analysis",
"Weather Forecasting",
"ESA",
"Correlation Based Grid Point Clustering",
"Statistically Coherent Regions",
"Sensitivity Features",
"Optical Flow Based Feature Assignment",
"Geo Spatial Evolution",
"Internal Correlation Structure",
"Weather Event",
"Atmospheric Processes",
"Temporal Evolution",
"Ensemble Forecast Sensitivities",
"Ensemble Sensitivity Analysis",
"Atmospheric Sciences",
"Correlation Based Approach",
"Scalar Forecast Quantity",
"Numerical Weather Prediction Model",
"Forecast Errors",
"Visualization Scientists",
"Meteorologists",
"Visual Analysis Framework",
"Correlation",
"Sensitivity",
"Atmospheric Modeling",
"Weather Forecasting",
"Visualization",
"Computational Modeling",
"Correlation",
"Clustering",
"Tracking",
"Ensemble Visualization"
],
"authors": [
{
"givenName": "Alexander",
"surname": "Kumpf",
"fullName": "Alexander Kumpf",
"affiliation": "Computer Graphics & Visualization Group, Technische Universitiit München, Garching, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marc",
"surname": "Rautenhaus",
"fullName": "Marc Rautenhaus",
"affiliation": "Computer Graphics & Visualization Group, Technische Universitiit München, Garching, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Riemer",
"fullName": "Michael Riemer",
"affiliation": "Universität Hamburg, Regional Computing Center, Hamburg, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rüdiger",
"surname": "Westermann",
"fullName": "Rüdiger Westermann",
"affiliation": "Computer Graphics & Visualization Group, Technische Universitiit München, Garching, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "98-108",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hpcmp-ugc/2009/3946/0/3946a285",
"title": "The Joint Ensemble Forecast System (JEFS) Experiment",
"doi": null,
"abstractUrl": "/proceedings-article/hpcmp-ugc/2009/3946a285/12OmNBZHikk",
"parentPublication": {
"id": "proceedings/hpcmp-ugc/2009/3946/0",
"title": "HPCMP Users Group Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/caia/1993/3840/0/00366647",
"title": "FoG: Synthesizing forecast text directly from weather maps",
"doi": null,
"abstractUrl": "/proceedings-article/caia/1993/00366647/12OmNrGsDpa",
"parentPublication": {
"id": "proceedings/caia/1993/3840/0",
"title": "Proceedings of 9th IEEE Conference on Artificial Intelligence for Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcmp-ugc/2009/3946/0/3946a249",
"title": "Climatologies Based on the Weather Research and Forecast (WRF) Model",
"doi": null,
"abstractUrl": "/proceedings-article/hpcmp-ugc/2009/3946a249/12OmNwHyZWS",
"parentPublication": {
"id": "proceedings/hpcmp-ugc/2009/3946/0",
"title": "HPCMP Users Group Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2009/3736/2/3736b240",
"title": "On Modeling of Atmospheric Visibility Classification Forecast with Nonlinear Support Vector Machine",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2009/3736b240/12OmNwHz04r",
"parentPublication": {
"id": "proceedings/icnc/2009/3736/2",
"title": "2009 Fifth International Conference on Natural Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e-science/2008/3380/0/04736790",
"title": "Producing and Sharing Regional Weather Forecast Data for e-Science Applications",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2008/04736790/12OmNzGlRAu",
"parentPublication": {
"id": "proceedings/e-science/2008/3380/0",
"title": "2008 IEEE Fourth International Conference on eScience",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/his/2008/3326/0/04626697",
"title": "Short-Term Wind Speed Prediction by Hybridizing Global and Mesoscale Forecasting Models with Artificial Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/his/2008/04626697/12OmNzWfp5U",
"parentPublication": {
"id": "proceedings/his/2008/3326/0",
"title": "Hybrid Intelligent Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2015/11/mco2015110015",
"title": "Big Ensemble Data Assimilation in Numerical Weather Prediction",
"doi": null,
"abstractUrl": "/magazine/co/2015/11/mco2015110015/13rRUypGGey",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08019883",
"title": "Visualizing Confidence in Cluster-Based Ensemble Weather Forecast Analyses",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08019883/13rRUyv53Fz",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e-science/2018/9156/0/915600a423",
"title": "A Scalable Machine Learning System for Pre-Season Agriculture Yield Forecast",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2018/915600a423/17D45Xbl4Pv",
"parentPublication": {
"id": "proceedings/e-science/2018/9156/0",
"title": "2018 IEEE 14th International Conference on e-Science (e-Science)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/04/09200793",
"title": "A Probability Density-Based Visual Analytics Approach to Forecast Bias Calibration",
"doi": null,
"abstractUrl": "/journal/tg/2022/04/09200793/1ndVrOUHniw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08454276",
"articleId": "17D45WHONig",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440102",
"articleId": "17D45VsBU48",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i3JWLpz8lO",
"name": "ttg201901-08440839s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08440839s1.mp4",
"extension": "mp4",
"size": "46.4 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUIJuxpA",
"doi": "10.1109/TVCG.2013.121",
"abstract": "We present a prop-based, tangible interface for 3D interactive visualization of thin fiber structures. These data are commonly found in current bioimaging datasets, for example second-harmonic generation microscopy of collagen fibers in tissue. Our approach uses commodity visualization technologies such as a depth sensing camera and low-cost 3D display. Unlike most current uses of these emerging technologies in the games and graphics communities, we employ the depth sensing camera to create a fish-tank sterePoscopic virtual reality system at the scientist's desk that supports tracking of small-scale gestures with objects already found in the work space. We apply the new interface to the problem of interactive exploratory visualization of three-dimensional thin fiber data. A critical task for the visual analysis of these data is understanding patterns in fiber orientation throughout a volume.The interface enables a new, fluid style of data exploration and fiber orientation analysis by using props to provide needed passive-haptic feedback, making 3D interactions with these fiber structures more controlled. We also contribute a low-level algorithm for extracting fiber centerlines from volumetric imaging. The system was designed and evaluated with two biophotonic experts who currently use it in their lab. As compared to typical practice within their field, the new visualization system provides a more effective way to examine and understand the 3D bioimaging datasets they collect.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a prop-based, tangible interface for 3D interactive visualization of thin fiber structures. These data are commonly found in current bioimaging datasets, for example second-harmonic generation microscopy of collagen fibers in tissue. Our approach uses commodity visualization technologies such as a depth sensing camera and low-cost 3D display. Unlike most current uses of these emerging technologies in the games and graphics communities, we employ the depth sensing camera to create a fish-tank sterePoscopic virtual reality system at the scientist's desk that supports tracking of small-scale gestures with objects already found in the work space. We apply the new interface to the problem of interactive exploratory visualization of three-dimensional thin fiber data. A critical task for the visual analysis of these data is understanding patterns in fiber orientation throughout a volume.The interface enables a new, fluid style of data exploration and fiber orientation analysis by using props to provide needed passive-haptic feedback, making 3D interactions with these fiber structures more controlled. We also contribute a low-level algorithm for extracting fiber centerlines from volumetric imaging. The system was designed and evaluated with two biophotonic experts who currently use it in their lab. As compared to typical practice within their field, the new visualization system provides a more effective way to examine and understand the 3D bioimaging datasets they collect.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a prop-based, tangible interface for 3D interactive visualization of thin fiber structures. These data are commonly found in current bioimaging datasets, for example second-harmonic generation microscopy of collagen fibers in tissue. Our approach uses commodity visualization technologies such as a depth sensing camera and low-cost 3D display. Unlike most current uses of these emerging technologies in the games and graphics communities, we employ the depth sensing camera to create a fish-tank sterePoscopic virtual reality system at the scientist's desk that supports tracking of small-scale gestures with objects already found in the work space. We apply the new interface to the problem of interactive exploratory visualization of three-dimensional thin fiber data. A critical task for the visual analysis of these data is understanding patterns in fiber orientation throughout a volume.The interface enables a new, fluid style of data exploration and fiber orientation analysis by using props to provide needed passive-haptic feedback, making 3D interactions with these fiber structures more controlled. We also contribute a low-level algorithm for extracting fiber centerlines from volumetric imaging. The system was designed and evaluated with two biophotonic experts who currently use it in their lab. As compared to typical practice within their field, the new visualization system provides a more effective way to examine and understand the 3D bioimaging datasets they collect.",
"title": "A Lightweight Tangible 3D Interface for Interactive Visualization of Thin Fiber Structures",
"normalizedTitle": "A Lightweight Tangible 3D Interface for Interactive Visualization of Thin Fiber Structures",
"fno": "ttg2013122802",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Three Dimensional Displays",
"Data Visualization",
"Microscopy",
"Tangible Interaction",
"Three Dimensional Displays",
"Data Visualization",
"Microscopy",
"Microscopy Visualization",
"Scientific Visualization",
"3 D Interaction"
],
"authors": [
{
"givenName": "Bret",
"surname": "Jackson",
"fullName": "Bret Jackson",
"affiliation": "Univ. of Minnesota, Minneapolis, MN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Tung Yuen Lau",
"fullName": "Tung Yuen Lau",
"affiliation": "Univ. of Illinois Urbana-Champaign, Urbana, IL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Schroeder",
"fullName": "David Schroeder",
"affiliation": "Univ. of Minnesota, Minneapolis, MN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kimani C.",
"surname": "Toussaint",
"fullName": "Kimani C. Toussaint",
"affiliation": "Univ. of Illinois Urbana-Champaign, Urbana, IL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel F.",
"surname": "Keefe",
"fullName": "Daniel F. Keefe",
"affiliation": "Univ. of Minnesota, Minneapolis, MN, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2013-12-01 00:00:00",
"pubType": "trans",
"pages": "2802-2809",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2014/2874/0/2874a350",
"title": "Visualizing Differences of DTI Fiber Models Using 2D Normalized Embeddings",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a350/12OmNAOsMNk",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2015/7568/0/7568a530",
"title": "Augmented Representations of Clustered Fiber Bundles for Interactive Queries",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2015/7568a530/12OmNASILSr",
"parentPublication": {
"id": "proceedings/iv/2015/7568/0",
"title": "2015 19th International Conference on Information Visualisation (iV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457e782",
"title": "Matting and Depth Recovery of Thin Structures Using a Focal Stack",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457e782/12OmNAqU4Wg",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2015/8332/0/8332a037",
"title": "Automatic Recovery of Networks of Thin Structures",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2015/8332a037/12OmNwJgAIr",
"parentPublication": {
"id": "proceedings/3dv/2015/8332/0",
"title": "2015 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a153",
"title": "FiberScout: An Interactive Tool for Exploring and Analyzing Fiber Reinforced Polymers",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a153/12OmNy5R3qT",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvri/2011/0054/0/05759603",
"title": "Super thin 3D form display for multimodal user experiences using vertically deformation of leaf spring and SMA",
"doi": null,
"abstractUrl": "/proceedings-article/isvri/2011/05759603/12OmNzaQomZ",
"parentPublication": {
"id": "proceedings/isvri/2011/0054/0",
"title": "2011 IEEE International Symposium on VR Innovation (ISVRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/08/07493610",
"title": "Interactive Exploration and Visualization Using MetaTracts extracted from Carbon Fiber Reinforced Composites",
"doi": null,
"abstractUrl": "/journal/tg/2017/08/07493610/13rRUwj7cpg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440805",
"title": "Visualization of Neuronal Structures in Wide-Field Microscopy Brain Images",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440805/17D45WnnFUX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000c887",
"title": "Reconstructing Thin Structures of Manifold Surfaces by Integrating Spatial Curves",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000c887/17D45X2fUIe",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08494830",
"title": "Interactive Visualization of RNA and DNA Structures",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08494830/17D45XeKgwi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013122792",
"articleId": "13rRUwdIOUN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013122810",
"articleId": "13rRUxAAT0U",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRLu",
"name": "ttg2013122802s.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013122802s.pdf",
"extension": "pdf",
"size": "309 kB",
"__typename": "WebExtraType"
},
{
"id": "17ShDTXWRLv",
"name": "ttg2013122802s.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013122802s.mov",
"extension": "mov",
"size": "48.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCeK2m4",
"title": "Oct.-Dec.",
"year": "2016",
"issueNum": "04",
"idPrefix": "th",
"pubType": "journal",
"volume": "9",
"label": "Oct.-Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxlgxOt",
"doi": "10.1109/TOH.2016.2574718",
"abstract": "Meissner corpuscles are the fast adapting type I (FA-I) mechanoreceptor that locates at the dermal papillae of skin. The Meissner corpuscle is well known for its complex structure, consisting of spiral axons, lamellar cells, and a collagen capsule. Fluorescent microscopy has become a convenient method for observing the Meissner corpuscle and its inner structure. This method requires preparing samples with fingertip cross-sections and performing antibody staining before observation. Various kinds of microscopy can be used for observation, such as confocal microscopy, transmission electron microscopy (TEM), or scanning electron microscopy (SEM). Although the anatomical shape, distribution, and components of Meissner corpuscle are recognized, they have been mostly determined from observations of fixed tissues. Therefore, knowledge of mechanical transduction is limited by the lack of in vivo experiments and individual differences among samples. In this study, we propose a novel less invasive imaging method that incorporates a staining technique with lipophilic carbocyanine Z_$\\text{DiOC}_{16}(3)$_Z and two-photon microscopy. This combination allows us to repetitively observe the Meissner corpuscle in a living mouse.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Meissner corpuscles are the fast adapting type I (FA-I) mechanoreceptor that locates at the dermal papillae of skin. The Meissner corpuscle is well known for its complex structure, consisting of spiral axons, lamellar cells, and a collagen capsule. Fluorescent microscopy has become a convenient method for observing the Meissner corpuscle and its inner structure. This method requires preparing samples with fingertip cross-sections and performing antibody staining before observation. Various kinds of microscopy can be used for observation, such as confocal microscopy, transmission electron microscopy (TEM), or scanning electron microscopy (SEM). Although the anatomical shape, distribution, and components of Meissner corpuscle are recognized, they have been mostly determined from observations of fixed tissues. Therefore, knowledge of mechanical transduction is limited by the lack of in vivo experiments and individual differences among samples. In this study, we propose a novel less invasive imaging method that incorporates a staining technique with lipophilic carbocyanine $\\text{DiOC}_{16}(3)$ and two-photon microscopy. This combination allows us to repetitively observe the Meissner corpuscle in a living mouse.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Meissner corpuscles are the fast adapting type I (FA-I) mechanoreceptor that locates at the dermal papillae of skin. The Meissner corpuscle is well known for its complex structure, consisting of spiral axons, lamellar cells, and a collagen capsule. Fluorescent microscopy has become a convenient method for observing the Meissner corpuscle and its inner structure. This method requires preparing samples with fingertip cross-sections and performing antibody staining before observation. Various kinds of microscopy can be used for observation, such as confocal microscopy, transmission electron microscopy (TEM), or scanning electron microscopy (SEM). Although the anatomical shape, distribution, and components of Meissner corpuscle are recognized, they have been mostly determined from observations of fixed tissues. Therefore, knowledge of mechanical transduction is limited by the lack of in vivo experiments and individual differences among samples. In this study, we propose a novel less invasive imaging method that incorporates a staining technique with lipophilic carbocyanine - and two-photon microscopy. This combination allows us to repetitively observe the Meissner corpuscle in a living mouse.",
"title": "Two-Photon Imaging of DiO-Labelled Meissner Corpuscle in Living Mouse's Fingertip",
"normalizedTitle": "Two-Photon Imaging of DiO-Labelled Meissner Corpuscle in Living Mouse's Fingertip",
"fno": "07482745",
"hasPdf": true,
"idPrefix": "th",
"keywords": [
"Mice",
"Axons",
"Scanning Electron Microscopy",
"Transmission Electron Microscopy",
"In Vivo",
"In Vivo Imaging",
"Neuroscience",
"Mechanoreceptors",
"Methodologies And Techniques"
],
"authors": [
{
"givenName": "Trung Quang",
"surname": "Pham",
"fullName": "Trung Quang Pham",
"affiliation": "Department of Engineering Physics, Electronics, and Mechanics, Nagoya Institute of Technology, Gokisho-cho, Showa-ku, Nagoya-shi, Aichi-ken, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Takayuki",
"surname": "Hoshi",
"fullName": "Takayuki Hoshi",
"affiliation": "Department of Information Physics and Computing, The University of Tokyo, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yoshihiro",
"surname": "Tanaka",
"fullName": "Yoshihiro Tanaka",
"affiliation": "Department of Engineering Physics, Electronics, and Mechanics, Nagoya Institute of Technology, Gokisho-cho, Showa-ku, Nagoya-shi, Aichi-ken, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Akihito",
"surname": "Sano",
"fullName": "Akihito Sano",
"affiliation": "Department of Engineering Physics, Electronics, and Mechanics, Nagoya Institute of Technology, Gokisho-cho, Showa-ku, Nagoya-shi, Aichi-ken, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Takumi",
"surname": "Kawaue",
"fullName": "Takumi Kawaue",
"affiliation": "Department of Anatomy and Cell Biology, Graduate School of Medicine, Nagoya University, Tsurumai-cho, Showa-ku, Nagoya-shi, Aichi-ken, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Takaki",
"surname": "Miyata",
"fullName": "Takaki Miyata",
"affiliation": "Department of Anatomy and Cell Biology, Graduate School of Medicine, Nagoya University, Tsurumai-cho, Showa-ku, Nagoya-shi, Aichi-ken, Japan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2016-10-01 00:00:00",
"pubType": "trans",
"pages": "483-491",
"year": "2016",
"issn": "1939-1412",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isdea/2014/4261/0/4261a222",
"title": "Application of Atomic Force Microscopy to Assess a Copper Molten Mark Formed by Short Circuit",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2014/4261a222/12OmNs0TKNQ",
"parentPublication": {
"id": "proceedings/isdea/2014/4261/0",
"title": "2014 Fifth International Conference on Intelligent Systems Design and Engineering Applications (ISDEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbec/2016/2132/0/07458998",
"title": "Cellulose Nanofibers as a Nucleating Template for Interfacial Crystallization of Poly (Ethylene)-b-Poly (Ethylene Glycol)",
"doi": null,
"abstractUrl": "/proceedings-article/sbec/2016/07458998/12OmNyq0zKD",
"parentPublication": {
"id": "proceedings/sbec/2016/2132/0",
"title": "2016 32nd Southern Biomedical Engineering Conference (SBEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2015/9721/0/9721a023",
"title": "Wrinkle Image Registration for Serial Microscopy Sections",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2015/9721a023/12OmNzTYCaI",
"parentPublication": {
"id": "proceedings/sitis/2015/9721/0",
"title": "2015 11th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbeb/2012/4706/0/4706a754",
"title": "Automatic Scanning by Scanning Electron Microscopy: The First Step towards Automation of Forensic Diatom Test",
"doi": null,
"abstractUrl": "/proceedings-article/icbeb/2012/4706a754/12OmNzn38UB",
"parentPublication": {
"id": "proceedings/icbeb/2012/4706/0",
"title": "Biomedical Engineering and Biotechnology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isai/2016/1585/0/1585a485",
"title": "Growth of TiO2 Nanotube Arrays (TNAs) by Current Control Anodizing",
"doi": null,
"abstractUrl": "/proceedings-article/isai/2016/1585a485/12OmNzwHvnD",
"parentPublication": {
"id": "proceedings/isai/2016/1585/0",
"title": "2016 International Conference on Information System and Artificial Intelligence (ISAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlhpc/2018/0180/0/08638633",
"title": "Automated Labeling of Electron Microscopy Images Using Deep Learning",
"doi": null,
"abstractUrl": "/proceedings-article/mlhpc/2018/08638633/18jXU8u0DVS",
"parentPublication": {
"id": "proceedings/mlhpc/2018/0180/0",
"title": "2018 IEEE/ACM Machine Learning in HPC Environments (MLHPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200c662",
"title": "A Hybrid Frequency-Spatial Domain Model for Sparse Image Reconstruction in Scanning Transmission Electron Microscopy",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200c662/1BmIoiM5Xag",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e-science/2022/6124/0/612400a267",
"title": "Enabling Autonomous Electron Microscopy for Networked Computation and Steering",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2022/612400a267/1J6horEKDlu",
"parentPublication": {
"id": "proceedings/e-science/2022/6124/0",
"title": "2022 IEEE 18th International Conference on e-Science (e-Science)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2022/9007/0/900700a379",
"title": "Interactive Web-based 3D Viewer for Multidimensional Microscope Imaging Modalities",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2022/900700a379/1KaH0uXY3i8",
"parentPublication": {
"id": "proceedings/iv/2022/9007/0",
"title": "2022 26th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icedme/2020/8145/0/09122233",
"title": "Failure Analysis of Planetary Gear in a Geared Rotary Actuator Used in Aircraft Flight Control System",
"doi": null,
"abstractUrl": "/proceedings-article/icedme/2020/09122233/1kRSDtj3wSQ",
"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": "07534882",
"articleId": "13rRUwbs1SE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07731151",
"articleId": "13rRUxjQyvx",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRTJ",
"name": "tth201604-07482745s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/tth201604-07482745s1.zip",
"extension": "zip",
"size": "5.15 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAle6Qx",
"title": "November/December",
"year": "2007",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxYIN42",
"doi": "10.1109/TVCG.2007.70575",
"abstract": "Acoustic quality in room acoustics is measured by well defined quantities, like definition, which can be derived from simulated impulse response filters or measured values. These take into account the intensity and phase shift of multiple reflections due to a wave front emanating from a sound source. Definition (D50) and clarity (C50) for example correspond to the fraction of the energy received in total to the energy received in the first 50 ms at a certain listener position. Unfortunately, the impulse response measured at a single point does not provide any information about the direction of reflections, and about the reflection surfaces which contribute to this measure. For the visualization of room acoustics, however, this information is very useful since it allows to discover regions with high contribution and provides insight into the influence of all reflecting surfaces to the quality measure. We use the phonon tracing method to calculate the contribution of the reflection surfaces to the impulse response for different listener positions. This data is used to compute importance values for the geometry taking a certain acoustic metric into account. To get a visual insight into the directional aspect, we map the importance to the reflecting surfaces of the geometry. This visualization indicates which parts of the surfaces need to be changed to enhance the chosen acoustic quality measure.We apply our method to the acoustic improvement of a lecture hall by means of enhancing the overall speech comprehensibility (clarity) and evaluate the results using glyphs to visualize the clarity (Z_$C_{50}$_Z) values at listener positions throughout the room.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Acoustic quality in room acoustics is measured by well defined quantities, like definition, which can be derived from simulated impulse response filters or measured values. These take into account the intensity and phase shift of multiple reflections due to a wave front emanating from a sound source. Definition (D50) and clarity (C50) for example correspond to the fraction of the energy received in total to the energy received in the first 50 ms at a certain listener position. Unfortunately, the impulse response measured at a single point does not provide any information about the direction of reflections, and about the reflection surfaces which contribute to this measure. For the visualization of room acoustics, however, this information is very useful since it allows to discover regions with high contribution and provides insight into the influence of all reflecting surfaces to the quality measure. We use the phonon tracing method to calculate the contribution of the reflection surfaces to the impulse response for different listener positions. This data is used to compute importance values for the geometry taking a certain acoustic metric into account. To get a visual insight into the directional aspect, we map the importance to the reflecting surfaces of the geometry. This visualization indicates which parts of the surfaces need to be changed to enhance the chosen acoustic quality measure.We apply our method to the acoustic improvement of a lecture hall by means of enhancing the overall speech comprehensibility (clarity) and evaluate the results using glyphs to visualize the clarity ($C_{50}$) values at listener positions throughout the room.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Acoustic quality in room acoustics is measured by well defined quantities, like definition, which can be derived from simulated impulse response filters or measured values. These take into account the intensity and phase shift of multiple reflections due to a wave front emanating from a sound source. Definition (D50) and clarity (C50) for example correspond to the fraction of the energy received in total to the energy received in the first 50 ms at a certain listener position. Unfortunately, the impulse response measured at a single point does not provide any information about the direction of reflections, and about the reflection surfaces which contribute to this measure. For the visualization of room acoustics, however, this information is very useful since it allows to discover regions with high contribution and provides insight into the influence of all reflecting surfaces to the quality measure. We use the phonon tracing method to calculate the contribution of the reflection surfaces to the impulse response for different listener positions. This data is used to compute importance values for the geometry taking a certain acoustic metric into account. To get a visual insight into the directional aspect, we map the importance to the reflecting surfaces of the geometry. This visualization indicates which parts of the surfaces need to be changed to enhance the chosen acoustic quality measure.We apply our method to the acoustic improvement of a lecture hall by means of enhancing the overall speech comprehensibility (clarity) and evaluate the results using glyphs to visualize the clarity (-) values at listener positions throughout the room.",
"title": "Listener-based Analysis of Surface Importance for Acoustic Metrics",
"normalizedTitle": "Listener-based Analysis of Surface Importance for Acoustic Metrics",
"fno": "v1680",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Architectural Acoustics",
"Data Visualisation",
"Transient Response",
"Listener Based Analysis",
"Acoustic Metrics",
"Room Acoustics Visualization",
"Phonon Tracing",
"Impulse Response",
"Acoustic Quality Measure",
"Speech Comprehensibility",
"Speech Clarity",
"Acoustic Reflection",
"Acoustic Measurements",
"Optical Surface Waves",
"Optical Reflection",
"Phonons",
"Acoustic Applications",
"Geometry",
"Data Visualization",
"Absorption",
"Frequency",
"Sound Analytics",
"Applications Of Visualization",
"Room Acoustics",
"Phonon Tracing",
"Acoustic Metric"
],
"authors": [
{
"givenName": "Frank",
"surname": "Michel",
"fullName": "Frank Michel",
"affiliation": "IRTG Kaiserslautern",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eduard",
"surname": "Deines",
"fullName": "Eduard Deines",
"affiliation": "IRTG Kaiserslautern",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Martin",
"surname": "Hering-Bertram",
"fullName": "Martin Hering-Bertram",
"affiliation": "Fraunhofer ITWM Kaiserslautern",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christoph",
"surname": "Garth",
"fullName": "Christoph Garth",
"affiliation": "University of Kaiserslautern and the Institute for Data Analysis and Visualization at the University of California in Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hans",
"surname": "Hagen",
"fullName": "Hans Hagen",
"affiliation": "University of Kaiserslautern",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2007-11-01 00:00:00",
"pubType": "trans",
"pages": "1680-1687",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cdc/2000/6638/2/00912160",
"title": "Parameter determination for surface acoustic wave filters",
"doi": null,
"abstractUrl": "/proceedings-article/cdc/2000/00912160/12OmNB8kHN3",
"parentPublication": {
"id": "proceedings/cdc/2000/6638/4",
"title": "Proceedings of the 39th IEEE Conference on Decision and Control",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/greencom-ithingscpscom/2013/5046/0/06682317",
"title": "A Novel Surface Acoustic Wave Sensor for Optical Lens Surface Dirt Detection",
"doi": null,
"abstractUrl": "/proceedings-article/greencom-ithingscpscom/2013/06682317/12OmNqGRGkf",
"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/wcsn/2014/7091/0/7091a326",
"title": "A Wireless Torque Sensor Based on Surface Acoustic Wave",
"doi": null,
"abstractUrl": "/proceedings-article/wcsn/2014/7091a326/12OmNwFicWL",
"parentPublication": {
"id": "proceedings/wcsn/2014/7091/0",
"title": "2014 International Conference on Wireless Communication and Sensor Network",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532790",
"title": "Phonon tracing for auralization and visualization of sound",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532790/12OmNxxdZyx",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdl/2002/7350/0/01022720",
"title": "Electrical, laser and acoustic breakdown of a liquid, resemblance and distinctions",
"doi": null,
"abstractUrl": "/proceedings-article/icdl/2002/01022720/12OmNybfqU1",
"parentPublication": {
"id": "proceedings/icdl/2002/7350/0",
"title": "Proceedings of 14th International Conference on Dielectric Liquids",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acssc/1991/2470/0/00186470",
"title": "Desired-speech signal cancellation by microphone arrays in reverberant rooms",
"doi": null,
"abstractUrl": "/proceedings-article/acssc/1991/00186470/12OmNzZWbRP",
"parentPublication": {
"id": "proceedings/acssc/1991/2470/0",
"title": "Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acssc/1995/7370/2/00540859",
"title": "Hull-mounted acoustic vector-sensor processing",
"doi": null,
"abstractUrl": "/proceedings-article/acssc/1995/00540859/12OmNzcxZrv",
"parentPublication": {
"id": "proceedings/acssc/1995/7370/2",
"title": "Conference Record of The Twenty-Ninth Asilomar Conference on Signals, Systems and Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/02/ttg2012020261",
"title": "Direct-to-Indirect Acoustic Radiance Transfer",
"doi": null,
"abstractUrl": "/journal/tg/2012/02/ttg2012020261/13rRUwj7cp8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/qe/2022/01/09880558",
"title": "Quantum Control of Optically Active Artificial Atoms With Surface Acoustic Waves",
"doi": null,
"abstractUrl": "/journal/qe/2022/01/09880558/1Gtu21J4Zck",
"parentPublication": {
"id": "trans/qe",
"title": "IEEE Transactions on Quantum Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiea/2020/8288/0/828800a858",
"title": "An Acoustic Metamaterial with Membranes and Bistable Buckling Beams",
"doi": null,
"abstractUrl": "/proceedings-article/aiea/2020/828800a858/1nTunTdXuQo",
"parentPublication": {
"id": "proceedings/aiea/2020/8288/0",
"title": "2020 International Conference on Artificial Intelligence and Electromechanical Automation (AIEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1672",
"articleId": "13rRUxNEqPJ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1688",
"articleId": "13rRUwcAqq9",
"__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": "13rRUEgarnF",
"doi": "10.1109/TVCG.2006.133",
"abstract": "A method for the semi-automatic detection and visualization of defects in models of nematic liquid crystals (NLCs) is introduced; this method is suitable for unstructured models, a previously unsolved problem. The detected defects---also known as \\emph{disclinations}---are regions were the alignment of the liquid crystal rapidly changes over space; these defects play a large role in the physical behavior of the NLC substrate. Defect detection is based upon a measure of total angular change of crystal orientation (the \\emph{director}) over a node neighborhood via the use of a nearest neighbor path. Visualizations based upon the detection algorithm clearly identifies complete defect regions as opposed to incomplete visual descriptions provided by cutting-plane and isosurface approaches. The introduced techniques are currently in use by scientists studying the dynamics of defect change.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A method for the semi-automatic detection and visualization of defects in models of nematic liquid crystals (NLCs) is introduced; this method is suitable for unstructured models, a previously unsolved problem. The detected defects---also known as \\emph{disclinations}---are regions were the alignment of the liquid crystal rapidly changes over space; these defects play a large role in the physical behavior of the NLC substrate. Defect detection is based upon a measure of total angular change of crystal orientation (the \\emph{director}) over a node neighborhood via the use of a nearest neighbor path. Visualizations based upon the detection algorithm clearly identifies complete defect regions as opposed to incomplete visual descriptions provided by cutting-plane and isosurface approaches. The introduced techniques are currently in use by scientists studying the dynamics of defect change.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A method for the semi-automatic detection and visualization of defects in models of nematic liquid crystals (NLCs) is introduced; this method is suitable for unstructured models, a previously unsolved problem. The detected defects---also known as \\emph{disclinations}---are regions were the alignment of the liquid crystal rapidly changes over space; these defects play a large role in the physical behavior of the NLC substrate. Defect detection is based upon a measure of total angular change of crystal orientation (the \\emph{director}) over a node neighborhood via the use of a nearest neighbor path. Visualizations based upon the detection algorithm clearly identifies complete defect regions as opposed to incomplete visual descriptions provided by cutting-plane and isosurface approaches. The introduced techniques are currently in use by scientists studying the dynamics of defect change.",
"title": "Detection and Visualization of Defects in 3D Unstructured Models of Nematic Liquid Crystals",
"normalizedTitle": "Detection and Visualization of Defects in 3D Unstructured Models of Nematic Liquid Crystals",
"fno": "v1045",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Feature Extraction",
"Mesh Generation",
"Nematic Liquid Crystals",
"Physics Computing",
"Scientific Visualization",
"3 D Unstructured Model",
"Nematic Liquid Crystals",
"Semi Automatic Defect Detection",
"Liquid Crystals",
"Visualization",
"Detection Algorithms",
"Biosensors",
"Nearest Neighbor Searches",
"Isosurfaces",
"Feature Extraction",
"Solids",
"Organic Materials",
"Physics",
"Scientific Visualization",
"Disclination",
"Nematic Liquid Crystal",
"Defects",
"Unstructured Grid",
"Feature Extraction"
],
"authors": [
{
"givenName": "Ketan",
"surname": "Mehta",
"fullName": "Ketan Mehta",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "T.J.",
"surname": "Jankun-Kelly",
"fullName": "T.J. Jankun-Kelly",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "trans",
"pages": "1045-1052",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdl/2002/7350/0/01022775",
"title": "Study of orientation of liquid crystal molecules at interface by shear horizontal wave",
"doi": null,
"abstractUrl": "/proceedings-article/icdl/2002/01022775/12OmNAOKnXo",
"parentPublication": {
"id": "proceedings/icdl/2002/7350/0",
"title": "Proceedings of 14th International Conference on Dielectric Liquids",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdl/2002/7350/0/01022774",
"title": "Electrorheology in liquids and liquid crystals studied by ultrasonic wave",
"doi": null,
"abstractUrl": "/proceedings-article/icdl/2002/01022774/12OmNAZOJZj",
"parentPublication": {
"id": "proceedings/icdl/2002/7350/0",
"title": "Proceedings of 14th International Conference on Dielectric Liquids",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eqec/2005/8973/0/01567285",
"title": "Using noise speckle pattern for the measurements of director reorientational relaxation time and diffusion length of aligned liquid crystals",
"doi": null,
"abstractUrl": "/proceedings-article/eqec/2005/01567285/12OmNAle6zu",
"parentPublication": {
"id": "proceedings/eqec/2005/8973/0",
"title": "2005 European Quantum Electronics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdl/2002/7350/0/01022778",
"title": "Electrical and optical properties of discotic liquid crystals with various core structures",
"doi": null,
"abstractUrl": "/proceedings-article/icdl/2002/01022778/12OmNCmpcT5",
"parentPublication": {
"id": "proceedings/icdl/2002/7350/0",
"title": "Proceedings of 14th International Conference on Dielectric Liquids",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmpeur/1989/1940/0/00093363",
"title": "Electro-optical effects, liquid crystals and their application in displays",
"doi": null,
"abstractUrl": "/proceedings-article/cmpeur/1989/00093363/12OmNwnYFYu",
"parentPublication": {
"id": "proceedings/cmpeur/1989/1940/0",
"title": "COMPEURO 89 Proceedings VLSI and Computer Peripherals.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visapp/2014/8133/1/07294854",
"title": "Liquid crystal image analysis by image descriptors",
"doi": null,
"abstractUrl": "/proceedings-article/visapp/2014/07294854/12OmNwsNRa6",
"parentPublication": {
"id": "proceedings/visapp/2014/8133/1",
"title": "2014 International Conference on Computer Vision Theory and Applications (VISAPP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdl/2002/7350/0/01022777",
"title": "Optical property of photonic crystals infiltrated with various liquids and liquid crystals",
"doi": null,
"abstractUrl": "/proceedings-article/icdl/2002/01022777/12OmNzlUKrK",
"parentPublication": {
"id": "proceedings/icdl/2002/7350/0",
"title": "Proceedings of 14th International Conference on Dielectric Liquids",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1323",
"title": "Techniques for the Visualization of Topological Defect Behavior in Nematic Liquid Crystals",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1323/13rRUxAAT7v",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1037",
"articleId": "13rRUxD9gXx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1053",
"articleId": "13rRUxBa5rN",
"__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": "13rRUxAASSV",
"doi": "10.1109/TVCG.2007.70585",
"abstract": "With the exponential growth in size of geometric data, it is becoming increasingly important to make effective use of multilevel caches, limited disk storage, and bandwidth. As a result, recent work in the visualization community has focused either on designing sequential access compression schemes or on producing cache-coherent layouts of (uncompressed) meshes for random access. Unfortunately combining these two strategies is challenging as they fundamentally assume conflicting modes of data access. In this paper, we propose a novel order-preserving compression method that supports transparent random access to compressed triangle meshes. Our decompression method selectively fetches from disk, decodes, and caches in memory requested parts of a mesh. We also provide a general mesh access API for seamless mesh traversal and incidence queries. While the method imposes no particular mesh layout, it is especially suitable for cache-oblivious layouts, which minimize the number of decompression I/O requests and provide high cache utilization during access to decompressed, in-memory portions of the mesh. Moreover, the transparency of our scheme enables improved performance without the need for application code changes. We achieve compression rates on the order of 20:1 and significantly improved I/O performance due to reduced data transfer. To demonstrate the benefits of our method, we implement two common applications as benchmarks. By using cache-oblivious layouts for the input models, we observe 2?6 times overall speedup compared to using uncompressed meshes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "With the exponential growth in size of geometric data, it is becoming increasingly important to make effective use of multilevel caches, limited disk storage, and bandwidth. As a result, recent work in the visualization community has focused either on designing sequential access compression schemes or on producing cache-coherent layouts of (uncompressed) meshes for random access. Unfortunately combining these two strategies is challenging as they fundamentally assume conflicting modes of data access. In this paper, we propose a novel order-preserving compression method that supports transparent random access to compressed triangle meshes. Our decompression method selectively fetches from disk, decodes, and caches in memory requested parts of a mesh. We also provide a general mesh access API for seamless mesh traversal and incidence queries. While the method imposes no particular mesh layout, it is especially suitable for cache-oblivious layouts, which minimize the number of decompression I/O requests and provide high cache utilization during access to decompressed, in-memory portions of the mesh. Moreover, the transparency of our scheme enables improved performance without the need for application code changes. We achieve compression rates on the order of 20:1 and significantly improved I/O performance due to reduced data transfer. To demonstrate the benefits of our method, we implement two common applications as benchmarks. By using cache-oblivious layouts for the input models, we observe 2?6 times overall speedup compared to using uncompressed meshes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "With the exponential growth in size of geometric data, it is becoming increasingly important to make effective use of multilevel caches, limited disk storage, and bandwidth. As a result, recent work in the visualization community has focused either on designing sequential access compression schemes or on producing cache-coherent layouts of (uncompressed) meshes for random access. Unfortunately combining these two strategies is challenging as they fundamentally assume conflicting modes of data access. In this paper, we propose a novel order-preserving compression method that supports transparent random access to compressed triangle meshes. Our decompression method selectively fetches from disk, decodes, and caches in memory requested parts of a mesh. We also provide a general mesh access API for seamless mesh traversal and incidence queries. While the method imposes no particular mesh layout, it is especially suitable for cache-oblivious layouts, which minimize the number of decompression I/O requests and provide high cache utilization during access to decompressed, in-memory portions of the mesh. Moreover, the transparency of our scheme enables improved performance without the need for application code changes. We achieve compression rates on the order of 20:1 and significantly improved I/O performance due to reduced data transfer. To demonstrate the benefits of our method, we implement two common applications as benchmarks. By using cache-oblivious layouts for the input models, we observe 2?6 times overall speedup compared to using uncompressed meshes.",
"title": "Random-Accessible Compressed Triangle Meshes",
"normalizedTitle": "Random-Accessible Compressed Triangle Meshes",
"fno": "v1536",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Application Program Interfaces",
"Cache Storage",
"Computational Geometry",
"Mesh Generation",
"Cache Oblivious Layout",
"Data Transfer",
"I O Request",
"API",
"Novel Order Preserving Compression Method",
"Cache Coherent Layout",
"Sequential Access Compression Scheme",
"Disk Storage",
"Multilevel Cache",
"Random Accessible Compressed Triangle Mesh",
"Bandwidth",
"Data Visualization",
"Data Structures",
"Memory Management",
"Delay",
"Space Technology",
"Cache Storage",
"Decoding",
"Computer Displays",
"Computational Modeling",
"Mesh Compression",
"Random Access",
"Cache Coherent Layouts",
"Mesh Data Structures",
"External Memory Algorithms"
],
"authors": [
{
"givenName": "Sung-eui",
"surname": "Yoon",
"fullName": "Sung-eui Yoon",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter",
"surname": "Lindstrom",
"fullName": "Peter Lindstrom",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2007-11-01 00:00:00",
"pubType": "trans",
"pages": "1536-1543",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccsa/2014/4264/0/4264a252",
"title": "Slicing Triangle Meshes: An Asymptotically Optimal Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/iccsa/2014/4264a252/12OmNqFrGw0",
"parentPublication": {
"id": "proceedings/iccsa/2014/4264/0",
"title": "2014 14th International Conference on Computational Science and Its Applications (ICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2012/4829/0/4829a110",
"title": "ESQ: Editable SQuad Representation for Triangle Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2012/4829a110/12OmNxR5UPg",
"parentPublication": {
"id": "proceedings/sibgrapi/2012/4829/0",
"title": "2012 25th SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532800",
"title": "Streaming meshes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532800/12OmNxRWIap",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cso/2012/1365/0/06274677",
"title": "Simplification Algorithm for General Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/cso/2012/06274677/12OmNxzMo0O",
"parentPublication": {
"id": "proceedings/cso/2012/1365/0",
"title": "2012 Fifth International Joint Conference on Computational Sciences and Optimization (CSO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1999/01/v0047",
"title": "Edgebreaker: Connectivity Compression for Triangle Meshes",
"doi": null,
"abstractUrl": "/journal/tg/1999/01/v0047/13rRUILLkve",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1213",
"title": "Mesh Layouts for Block-Based Caches",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1213/13rRUILtJlY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2000/01/v0079",
"title": "Compressed Progressive Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2000/01/v0079/13rRUwhpBNZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/05/ttg2010050815",
"title": "Binary Mesh Partitioning for Cache-Efficient Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2010/05/ttg2010050815/13rRUxYIMUU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1998/02/v0145",
"title": "Constructing Hierarchies for Triangle Meshes",
"doi": null,
"abstractUrl": "/journal/tg/1998/02/v0145/13rRUy0qnGc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/01/04015405",
"title": "Streaming Simplification of Tetrahedral Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2007/01/04015405/13rRUyY28Yk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "04376197",
"articleId": "13rRUy0qnGe",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04376198",
"articleId": "13rRUxBa5x8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAolH0O",
"title": "February",
"year": "1999",
"issueNum": "02",
"idPrefix": "tc",
"pubType": "journal",
"volume": "48",
"label": "February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxAAT6v",
"doi": "10.1109/12.752657",
"abstract": "Abstract—Exploiting locality of reference is key to realizing high levels of performance on modern processors. This paper describes a compiler algorithm for optimizing cache locality in scientific codes on uniprocessor and multiprocessor machines. A distinctive characteristic of our algorithm is that it considers loop and data layout transformations in a unified framework. Our approach is very effective at reducing cache misses and can optimize some nests for which optimization techniques based on loop transformations alone are not successful. An important special case is one in which data layouts of some arrays are fixed and cannot be changed. We show how our algorithm can accommodate this case and demonstrate how it can be used to optimize multiple loop nests. Experiments on several benchmarks show that the techniques presented in this paper result in substantial improvement in cache performance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Exploiting locality of reference is key to realizing high levels of performance on modern processors. This paper describes a compiler algorithm for optimizing cache locality in scientific codes on uniprocessor and multiprocessor machines. A distinctive characteristic of our algorithm is that it considers loop and data layout transformations in a unified framework. Our approach is very effective at reducing cache misses and can optimize some nests for which optimization techniques based on loop transformations alone are not successful. An important special case is one in which data layouts of some arrays are fixed and cannot be changed. We show how our algorithm can accommodate this case and demonstrate how it can be used to optimize multiple loop nests. Experiments on several benchmarks show that the techniques presented in this paper result in substantial improvement in cache performance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Exploiting locality of reference is key to realizing high levels of performance on modern processors. This paper describes a compiler algorithm for optimizing cache locality in scientific codes on uniprocessor and multiprocessor machines. A distinctive characteristic of our algorithm is that it considers loop and data layout transformations in a unified framework. Our approach is very effective at reducing cache misses and can optimize some nests for which optimization techniques based on loop transformations alone are not successful. An important special case is one in which data layouts of some arrays are fixed and cannot be changed. We show how our algorithm can accommodate this case and demonstrate how it can be used to optimize multiple loop nests. Experiments on several benchmarks show that the techniques presented in this paper result in substantial improvement in cache performance.",
"title": "Improving Cache Locality by a Combination of Loop and Data Transformations",
"normalizedTitle": "Improving Cache Locality by a Combination of Loop and Data Transformations",
"fno": "t0159",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Caches",
"Data Reuse",
"Locality",
"Loop And Data Transformations",
"Optimizing Compilers"
],
"authors": [
{
"givenName": "Mahmut",
"surname": "Kandemir",
"fullName": "Mahmut Kandemir",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "J.",
"surname": "Ramanujam",
"fullName": "J. Ramanujam",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alok",
"surname": "Choudhary",
"fullName": "Alok Choudhary",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "1999-02-01 00:00:00",
"pubType": "trans",
"pages": "159-167",
"year": "1999",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "t0150",
"articleId": "13rRUwIF6kf",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "t0168",
"articleId": "13rRUygBwdI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqG0SRP",
"title": "July",
"year": "2003",
"issueNum": "07",
"idPrefix": "td",
"pubType": "journal",
"volume": "14",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxcsYLn",
"doi": "10.1109/TPDS.2003.1214317",
"abstract": "Abstract—Recently, several experimental studies have been conducted on block data layout in conjunction with tiling as a data transformation technique to improve cache performance. In this paper, we analyze cache and TLB performance of such alternate layouts (including block data layout and Morton layout) when used in conjunction with tiling. We derive a tight lower bound on TLB performance for standard matrix access patterns, and show that block data layout and Morton layout achieve this bound. To improve cache performance, block data layout is used in concert with tiling. Based on the cache and TLB performance analysis, we propose a data block size selection algorithm that finds a tight range for optimal block size. To validate our analysis, we conducted simulations and experiments using tiled matrix multiplication, LU decomposition, and Cholesky factorization. For matrix multiplication, simulation results using UltraSparc II parameters show that tiling and block data layout with a block size given by our block size selection algorithm, reduces up to 93 percent of TLB misses compared with other techniques (copying, padding, etc.). The total miss cost is reduced considerably. Experiments on several platforms (UltraSparc II and III, Alpha, and Pentium III) show that tiling with block data layout achieves up to 50 percent performance improvement over other techniques that use conventional layouts. Morton layout is also analyzed and compared with block data layout. Experimental results show that matrix multiplication using block data layout is up to 15 percent faster than that using Morton data layout.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Recently, several experimental studies have been conducted on block data layout in conjunction with tiling as a data transformation technique to improve cache performance. In this paper, we analyze cache and TLB performance of such alternate layouts (including block data layout and Morton layout) when used in conjunction with tiling. We derive a tight lower bound on TLB performance for standard matrix access patterns, and show that block data layout and Morton layout achieve this bound. To improve cache performance, block data layout is used in concert with tiling. Based on the cache and TLB performance analysis, we propose a data block size selection algorithm that finds a tight range for optimal block size. To validate our analysis, we conducted simulations and experiments using tiled matrix multiplication, LU decomposition, and Cholesky factorization. For matrix multiplication, simulation results using UltraSparc II parameters show that tiling and block data layout with a block size given by our block size selection algorithm, reduces up to 93 percent of TLB misses compared with other techniques (copying, padding, etc.). The total miss cost is reduced considerably. Experiments on several platforms (UltraSparc II and III, Alpha, and Pentium III) show that tiling with block data layout achieves up to 50 percent performance improvement over other techniques that use conventional layouts. Morton layout is also analyzed and compared with block data layout. Experimental results show that matrix multiplication using block data layout is up to 15 percent faster than that using Morton data layout.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Recently, several experimental studies have been conducted on block data layout in conjunction with tiling as a data transformation technique to improve cache performance. In this paper, we analyze cache and TLB performance of such alternate layouts (including block data layout and Morton layout) when used in conjunction with tiling. We derive a tight lower bound on TLB performance for standard matrix access patterns, and show that block data layout and Morton layout achieve this bound. To improve cache performance, block data layout is used in concert with tiling. Based on the cache and TLB performance analysis, we propose a data block size selection algorithm that finds a tight range for optimal block size. To validate our analysis, we conducted simulations and experiments using tiled matrix multiplication, LU decomposition, and Cholesky factorization. For matrix multiplication, simulation results using UltraSparc II parameters show that tiling and block data layout with a block size given by our block size selection algorithm, reduces up to 93 percent of TLB misses compared with other techniques (copying, padding, etc.). The total miss cost is reduced considerably. Experiments on several platforms (UltraSparc II and III, Alpha, and Pentium III) show that tiling with block data layout achieves up to 50 percent performance improvement over other techniques that use conventional layouts. Morton layout is also analyzed and compared with block data layout. Experimental results show that matrix multiplication using block data layout is up to 15 percent faster than that using Morton data layout.",
"title": "Tiling, Block Data Layout, and Memory Hierarchy Performance",
"normalizedTitle": "Tiling, Block Data Layout, and Memory Hierarchy Performance",
"fno": "l0640",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Block Data Layout",
"Tiling",
"TLB Misses",
"Cache Misses",
"Memory Hierarchy"
],
"authors": [
{
"givenName": "Neungsoo",
"surname": "Park",
"fullName": "Neungsoo Park",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bo",
"surname": "Hong",
"fullName": "Bo Hong",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Viktor K.",
"surname": "Prasanna",
"fullName": "Viktor K. Prasanna",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2003-07-01 00:00:00",
"pubType": "trans",
"pages": "640-654",
"year": "2003",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "l0625",
"articleId": "13rRUxYINeI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "l0671",
"articleId": "13rRUx0gepz",
"__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": "13rRUx0xPID",
"doi": "10.1109/TVCG.2012.194",
"abstract": "In this work, we address the problem of lossless compression of scientific and medical floating-point volume data. We propose two prediction-based compression methods that share a common framework, which consists of a switched prediction scheme wherein the best predictor out of a preset group of linear predictors is selected. Such a scheme is able to adapt to different datasets as well as to varying statistics within the data. The first method, called APE (Adaptive Polynomial Encoder), uses a family of structured interpolating polynomials for prediction, while the second method, which we refer to as ACE (Adaptive Combined Encoder), combines predictors from previous work with the polynomial predictors to yield a more flexible, powerful encoder that is able to effectively decorrelate a wide range of data. In addition, in order to facilitate efficient visualization of compressed data, our scheme provides an option to partition floating-point values in such a way as to provide a progressive representation. We compare our two compressors to existing state-of-the-art lossless floating-point compressors for scientific data, with our data suite including both computer simulations and observational measurements. The results demonstrate that our polynomial predictor, APE, is comparable to previous approaches in terms of speed but achieves better compression rates on average. ACE, our combined predictor, while somewhat slower, is able to achieve the best compression rate on all datasets, with significantly better rates on most of the datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this work, we address the problem of lossless compression of scientific and medical floating-point volume data. We propose two prediction-based compression methods that share a common framework, which consists of a switched prediction scheme wherein the best predictor out of a preset group of linear predictors is selected. Such a scheme is able to adapt to different datasets as well as to varying statistics within the data. The first method, called APE (Adaptive Polynomial Encoder), uses a family of structured interpolating polynomials for prediction, while the second method, which we refer to as ACE (Adaptive Combined Encoder), combines predictors from previous work with the polynomial predictors to yield a more flexible, powerful encoder that is able to effectively decorrelate a wide range of data. In addition, in order to facilitate efficient visualization of compressed data, our scheme provides an option to partition floating-point values in such a way as to provide a progressive representation. We compare our two compressors to existing state-of-the-art lossless floating-point compressors for scientific data, with our data suite including both computer simulations and observational measurements. The results demonstrate that our polynomial predictor, APE, is comparable to previous approaches in terms of speed but achieves better compression rates on average. ACE, our combined predictor, while somewhat slower, is able to achieve the best compression rate on all datasets, with significantly better rates on most of the datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this work, we address the problem of lossless compression of scientific and medical floating-point volume data. We propose two prediction-based compression methods that share a common framework, which consists of a switched prediction scheme wherein the best predictor out of a preset group of linear predictors is selected. Such a scheme is able to adapt to different datasets as well as to varying statistics within the data. The first method, called APE (Adaptive Polynomial Encoder), uses a family of structured interpolating polynomials for prediction, while the second method, which we refer to as ACE (Adaptive Combined Encoder), combines predictors from previous work with the polynomial predictors to yield a more flexible, powerful encoder that is able to effectively decorrelate a wide range of data. In addition, in order to facilitate efficient visualization of compressed data, our scheme provides an option to partition floating-point values in such a way as to provide a progressive representation. We compare our two compressors to existing state-of-the-art lossless floating-point compressors for scientific data, with our data suite including both computer simulations and observational measurements. The results demonstrate that our polynomial predictor, APE, is comparable to previous approaches in terms of speed but achieves better compression rates on average. ACE, our combined predictor, while somewhat slower, is able to achieve the best compression rate on all datasets, with significantly better rates on most of the datasets.",
"title": "An Adaptive Prediction-Based Approach to Lossless Compression of Floating-Point Volume Data",
"normalizedTitle": "An Adaptive Prediction-Based Approach to Lossless Compression of Floating-Point Volume Data",
"fno": "ttg2012122295",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Floating Point Arithmetic",
"Polynomials",
"Entropy Coding",
"Data Visualization",
"Image Coding",
"Data Models",
"Floating Point Compression",
"Volume Compression",
"Lossless Compression"
],
"authors": [
{
"givenName": "Nathaniel",
"surname": "Fout",
"fullName": "Nathaniel Fout",
"affiliation": "University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kwan-Liu",
"surname": "Ma",
"fullName": "Kwan-Liu Ma",
"affiliation": "University of California, Davis",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2295-2304",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dcc/1995/7012/0/70120457",
"title": "Asymmetric lossless image compression",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/1995/70120457/12OmNCgrCW3",
"parentPublication": {
"id": "proceedings/dcc/1995/7012/0",
"title": "Proceedings DCC '95 Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2006/2545/0/25450133",
"title": "Fast Lossless Compression of Scientific Floating-Point Data",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2006/25450133/12OmNqJq4Eq",
"parentPublication": {
"id": "proceedings/dcc/2006/2545/0",
"title": "Proceedings. DCC 2006. Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/1995/7012/0/70120458",
"title": "Optimal linear prediction for the lossless compression of volume data",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/1995/70120458/12OmNqNG3iX",
"parentPublication": {
"id": "proceedings/dcc/1995/7012/0",
"title": "Proceedings DCC '95 Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ifita/2009/3600/1/3600a235",
"title": "Fast Lossless Compression of Seismic Floating-Point Data",
"doi": null,
"abstractUrl": "/proceedings-article/ifita/2009/3600a235/12OmNxRF6WT",
"parentPublication": {
"id": "proceedings/ifita/2009/3600/3",
"title": "Information Technology and Applications, International Forum on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/1995/7012/0/70120452",
"title": "Lossless compression by simulated annealing",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/1995/70120452/12OmNyFCvZ9",
"parentPublication": {
"id": "proceedings/dcc/1995/7012/0",
"title": "Proceedings DCC '95 Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2010/4277/0/4277a112",
"title": "Compressing Floating-Point Number Stream for Numerical Applications",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2010/4277a112/12OmNyqRnox",
"parentPublication": {
"id": "proceedings/icnc/2010/4277/0",
"title": "2010 First International Conference on Networking and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2009/3592/0/3592a043",
"title": "pFPC: A Parallel Compressor for Floating-Point Data",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2009/3592a043/12OmNzhnadk",
"parentPublication": {
"id": "proceedings/dcc/2009/3592/0",
"title": "2009 Data Compression Conference. DCC 2009",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asap/2010/6966/0/05540973",
"title": "FPGA-based lossless compressors of floating-point data streams to enhance memory bandwidth",
"doi": null,
"abstractUrl": "/proceedings-article/asap/2010/05540973/12OmNzxPTF1",
"parentPublication": {
"id": "proceedings/asap/2010/6966/0",
"title": "ASAP 2010 - 21st IEEE International Conference on Application-specific Systems, Architectures and Processors",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06876024",
"title": "Fixed-Rate Compressed Floating-Point Arrays",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06876024/13rRUxcbnHb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2001/02/t0158",
"title": "Lossless Trace Compression",
"doi": null,
"abstractUrl": "/journal/tc/2001/02/t0158/13rRUzp02nu",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012122285",
"articleId": "13rRUEgs2BV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122305",
"articleId": "13rRUwh80H9",
"__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": "1xibYn0KqGY",
"doi": "10.1109/TVCG.2021.3114766",
"abstract": "Which drug is most promising for a cancer patient? A new microscopy-based approach for measuring the mass of individual cancer cells treated with different drugs promises to answer this question in only a few hours. However, the analysis pipeline for extracting data from these images is still far from complete automation: human intervention is necessary for quality control for preprocessing steps such as segmentation, adjusting filters, removing noise, and analyzing the result. To address this workflow, we developed Loon, a visualization tool for analyzing drug screening data based on quantitative phase microscopy imaging. Loon visualizes both derived data such as growth rates and imaging data. Since the images are collected automatically at a large scale, manual inspection of images and segmentations is infeasible. However, reviewing representative samples of cells is essential, both for quality control and for data analysis. We introduce a new approach for choosing and visualizing representative exemplar cells that retain a close connection to the low-level data. By tightly integrating the derived data visualization capabilities with the novel exemplar visualization and providing selection and filtering capabilities, Loon is well suited for making decisions about which drugs are suitable for a specific patient.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Which drug is most promising for a cancer patient? A new microscopy-based approach for measuring the mass of individual cancer cells treated with different drugs promises to answer this question in only a few hours. However, the analysis pipeline for extracting data from these images is still far from complete automation: human intervention is necessary for quality control for preprocessing steps such as segmentation, adjusting filters, removing noise, and analyzing the result. To address this workflow, we developed Loon, a visualization tool for analyzing drug screening data based on quantitative phase microscopy imaging. Loon visualizes both derived data such as growth rates and imaging data. Since the images are collected automatically at a large scale, manual inspection of images and segmentations is infeasible. However, reviewing representative samples of cells is essential, both for quality control and for data analysis. We introduce a new approach for choosing and visualizing representative exemplar cells that retain a close connection to the low-level data. By tightly integrating the derived data visualization capabilities with the novel exemplar visualization and providing selection and filtering capabilities, Loon is well suited for making decisions about which drugs are suitable for a specific patient.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Which drug is most promising for a cancer patient? A new microscopy-based approach for measuring the mass of individual cancer cells treated with different drugs promises to answer this question in only a few hours. However, the analysis pipeline for extracting data from these images is still far from complete automation: human intervention is necessary for quality control for preprocessing steps such as segmentation, adjusting filters, removing noise, and analyzing the result. To address this workflow, we developed Loon, a visualization tool for analyzing drug screening data based on quantitative phase microscopy imaging. Loon visualizes both derived data such as growth rates and imaging data. Since the images are collected automatically at a large scale, manual inspection of images and segmentations is infeasible. However, reviewing representative samples of cells is essential, both for quality control and for data analysis. We introduce a new approach for choosing and visualizing representative exemplar cells that retain a close connection to the low-level data. By tightly integrating the derived data visualization capabilities with the novel exemplar visualization and providing selection and filtering capabilities, Loon is well suited for making decisions about which drugs are suitable for a specific patient.",
"title": "Loon: Using Exemplars to Visualize Large-Scale Microscopy Data",
"normalizedTitle": "Loon: Using Exemplars to Visualize Large-Scale Microscopy Data",
"fno": "09552235",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Biomedical Optical Imaging",
"Cancer",
"Cellular Biophysics",
"Data Analysis",
"Data Visualisation",
"Drugs",
"Image Segmentation",
"Medical Image Processing",
"Optical Microscopy",
"Quality Control",
"Loon",
"Exemplars",
"Large Scale Microscopy Data",
"Drug",
"Cancer Patient",
"Microscopy Based Approach",
"Individual Cancer Cells",
"Different Drugs Promises",
"Analysis Pipeline",
"Complete Automation",
"Human Intervention",
"Quality Control",
"Visualization Tool",
"Quantitative Phase Microscopy Imaging",
"Growth Rates",
"Imaging Data",
"Data Analysis",
"Representative Exemplar Cells",
"Low Level Data",
"Derived Data Visualization Capabilities",
"Novel Exemplar Visualization",
"Providing Selection",
"Specific Patient",
"Data Visualization",
"Image Segmentation",
"Microscopy",
"Imaging",
"Cancer",
"Tools",
"Tumors",
"Microscopy Visualization",
"Cancer Cell Lines",
"Exemplars",
"Design Study"
],
"authors": [
{
"givenName": "Devin",
"surname": "Lange",
"fullName": "Devin Lange",
"affiliation": "University of Utah, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eddie",
"surname": "Polanco",
"fullName": "Eddie Polanco",
"affiliation": "University of Utah, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert",
"surname": "Judson-Torres",
"fullName": "Robert Judson-Torres",
"affiliation": "University of Utah, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Zangle",
"fullName": "Thomas Zangle",
"affiliation": "University of Utah, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alexander",
"surname": "Lex",
"fullName": "Alexander Lex",
"affiliation": "University of Utah, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "248-258",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibm/2017/3050/0/08217827",
"title": "Mitochondria segmentation in electron microscopy volumes using deep convolutional neural network",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2017/08217827/12OmNBTawxv",
"parentPublication": {
"id": "proceedings/bibm/2017/3050/0",
"title": "2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visapp/2014/8133/3/07295067",
"title": "Automated segmentation of cell structure in microscopy images",
"doi": null,
"abstractUrl": "/proceedings-article/visapp/2014/07295067/12OmNCgrD33",
"parentPublication": {
"id": "proceedings/visapp/2014/8133/2",
"title": "2014 International Conference on Computer Vision Theory and Applications (VISAPP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2017/0733/0/0733a851",
"title": "Transferring Microscopy Image Modalities with Conditional Generative Adversarial Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2017/0733a851/12OmNwGIcza",
"parentPublication": {
"id": "proceedings/cvprw/2017/0733/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2017/0733/0/0733a834",
"title": "Nuclei Segmentation of Fluorescence Microscopy Images Using Three Dimensional Convolutional Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2017/0733a834/12OmNwlHSTo",
"parentPublication": {
"id": "proceedings/cvprw/2017/0733/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2011/4296/2/4296c943",
"title": "Raman Microscopy and Imaging in Pharmaceutical Applications",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2011/4296c943/12OmNxiKs4x",
"parentPublication": {
"id": "proceedings/icmtma/2011/4296/2",
"title": "2011 Third International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2011/1799/0/06120462",
"title": "Computer-Based Image Analysis of Liver Steatosis with Large-Scale Microscopy Imagery and Correlation with Magnetic Resonance Imaging Lipid Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2011/06120462/12OmNz4BduY",
"parentPublication": {
"id": "proceedings/bibm/2011/1799/0",
"title": "2011 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2015/03/06963495",
"title": "Extraction of Individual Filaments from 2D Confocal Microscopy Images of Flat Cells",
"doi": null,
"abstractUrl": "/journal/tb/2015/03/06963495/13rRUwIF6jt",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2018/6100/0/610000c371",
"title": "Localization and Tracking in 4D Fluorescence Microscopy Imagery",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2018/610000c371/17D45VsBTWj",
"parentPublication": {
"id": "proceedings/cvprw/2018/6100/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08546040",
"title": "Multi-label Classification of Stem Cell Microscopy Images Using Deep Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08546040/17D45WZZ7GJ",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412641",
"title": "Learning to segment clustered amoeboid cells from brightfield microscopy via multi-task learning with adaptive weight selection",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412641/1tmiarePQAg",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552435",
"articleId": "1xic7UZLov6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09557792",
"articleId": "1xquHxMLASQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zBavFuFKRW",
"name": "ttg202201-09552235s1-supp1-3114766.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09552235s1-supp1-3114766.mp4",
"extension": "mp4",
"size": "122 MB",
"__typename": "WebExtraType"
},
{
"id": "1zBavyKQdoY",
"name": "ttg202201-09552235s1-supp2-3114766.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09552235s1-supp2-3114766.pdf",
"extension": "pdf",
"size": "2.88 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": "1xlvYtlxuKY",
"doi": "10.1109/TVCG.2021.3114841",
"abstract": "Visualization collections, accessed by platforms such as Tableau Online or Power Bl, are used by millions of people to share and access diverse analytical knowledge in the form of interactive visualization bundles. Result snippets, compact previews of these bundles, are presented to users to help them identify relevant content when browsing collections. Our engagement with Tableau product teams and review of existing snippet designs on five platforms showed us that current practices fail to help people judge the relevance of bundles because they include only the title and one image. Users frequently need to undertake the time-consuming endeavour of opening a bundle within its visualization system to examine its many views and dashboards. In response, we contribute the first systematic approach to visualization snippet design. We propose a framework for snippet design that addresses eight key challenges that we identify. We present a computational pipeline to compress the visual and textual content of bundles into representative previews that is adaptive to a provided pixel budget and provides high information density with multiple images and carefully chosen keywords. We also reflect on the method of visual inspection through random sampling to gain confidence in model and parameter choices.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visualization collections, accessed by platforms such as Tableau Online or Power Bl, are used by millions of people to share and access diverse analytical knowledge in the form of interactive visualization bundles. Result snippets, compact previews of these bundles, are presented to users to help them identify relevant content when browsing collections. Our engagement with Tableau product teams and review of existing snippet designs on five platforms showed us that current practices fail to help people judge the relevance of bundles because they include only the title and one image. Users frequently need to undertake the time-consuming endeavour of opening a bundle within its visualization system to examine its many views and dashboards. In response, we contribute the first systematic approach to visualization snippet design. We propose a framework for snippet design that addresses eight key challenges that we identify. We present a computational pipeline to compress the visual and textual content of bundles into representative previews that is adaptive to a provided pixel budget and provides high information density with multiple images and carefully chosen keywords. We also reflect on the method of visual inspection through random sampling to gain confidence in model and parameter choices.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visualization collections, accessed by platforms such as Tableau Online or Power Bl, are used by millions of people to share and access diverse analytical knowledge in the form of interactive visualization bundles. Result snippets, compact previews of these bundles, are presented to users to help them identify relevant content when browsing collections. Our engagement with Tableau product teams and review of existing snippet designs on five platforms showed us that current practices fail to help people judge the relevance of bundles because they include only the title and one image. Users frequently need to undertake the time-consuming endeavour of opening a bundle within its visualization system to examine its many views and dashboards. In response, we contribute the first systematic approach to visualization snippet design. We propose a framework for snippet design that addresses eight key challenges that we identify. We present a computational pipeline to compress the visual and textual content of bundles into representative previews that is adaptive to a provided pixel budget and provides high information density with multiple images and carefully chosen keywords. We also reflect on the method of visual inspection through random sampling to gain confidence in model and parameter choices.",
"title": "VizSnippets: Compressing Visualization Bundles Into Representative Previews for Browsing Visualization Collections",
"normalizedTitle": "VizSnippets: Compressing Visualization Bundles Into Representative Previews for Browsing Visualization Collections",
"fno": "09555620",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Visualization",
"Tools",
"Pipelines",
"Layout",
"Inspection",
"Image Coding",
"Visualization Collections",
"Visualization Bundles",
"Result Snippets",
"Visual Inspection"
],
"authors": [
{
"givenName": "Michael",
"surname": "Oppermann",
"fullName": "Michael Oppermann",
"affiliation": "University of British Columbia, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tamara",
"surname": "Munzner",
"fullName": "Tamara Munzner",
"affiliation": "University of British Columbia, Canada",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "747-757",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2014/4103/0/4103a001",
"title": "Using Visual Cues on DOITree for Visualizing Large Hierarchical Data",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2014/4103a001/12OmNBJNL1S",
"parentPublication": {
"id": "proceedings/iv/2014/4103/0",
"title": "2014 18th International Conference on Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2015/6879/0/07156377",
"title": "MetaTracts - A method for robust extraction and visualization of carbon fiber bundles in fiber reinforced composites",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156377/12OmNrYCXXM",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 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": "trans/tg/2014/03/ttg2014030457",
"title": "Similarity Preserving Snippet-Based Visualization of Web Search Results",
"doi": null,
"abstractUrl": "/journal/tg/2014/03/ttg2014030457/13rRUIIVlcJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/08/06636295",
"title": "Bundled Visualization of DynamicGraph and Trail Data",
"doi": null,
"abstractUrl": "/journal/tg/2014/08/06636295/13rRUwd9CG3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061189",
"title": "Graphical Histories for Visualization: Supporting Analysis, Communication, and Evaluation",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061189/13rRUwwJWFI",
"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"
},
{
"id": "proceedings/iv/2018/7202/0/720200a368",
"title": "Rule-Based Visualization of Tableau Calculus for Propositional Logic",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a368/17D45XDIXPk",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09984953",
"title": "VISAtlas: An Image-based Exploration and Query System for Large Visualization Collections via Neural Image Embedding",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09984953/1J6d2SwfUT6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a181",
"title": "What are Data Insights to Professional Visualization Users?",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a181/1qRO9q8X6dq",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552893",
"articleId": "1xic1S53KPS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09555244",
"articleId": "1xjR1QZtkTS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zBawzPLtxS",
"name": "ttg202201-09555620s1-supp1-3114841.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09555620s1-supp1-3114841.mp4",
"extension": "mp4",
"size": "17.6 MB",
"__typename": "WebExtraType"
},
{
"id": "1zBawt3WKas",
"name": "ttg202201-09555620s1-supp2-3114841.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09555620s1-supp2-3114841.pdf",
"extension": "pdf",
"size": "10.8 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1GZomp3AlGg",
"doi": "10.1109/TVCG.2022.3209439",
"abstract": "Large-scale scientific data, such as weather and climate simulations, often comprise a large number of attributes for each data sample, like temperature, pressure, humidity, and many more. Interactive visualization and analysis require filtering according to any desired combination of attributes, in particular logical <italic>AND</italic> operations, which is challenging for large data and many attributes. Many general data structures for this problem are built for and scale with a fixed number of attributes, and scalability of joint queries with arbitrary attribute subsets remains a significant problem. We propose a flexible probabilistic framework for multivariate range queries that decouples all attribute dimensions via <italic>projection</italic>, allowing any subset of attributes to be queried with full efficiency. Moreover, our approach is <italic>output-sensitive</italic>, mainly scaling with the cardinality of the query result rather than with the input data size. This is particularly important for joint attribute queries, where the query output is usually much smaller than the whole data set. Additionally, our approach can split query evaluation between user interaction and rendering, achieving much better scalability for interactive visualization than the previous state of the art. Furthermore, even when a multi-resolution strategy is used for visualization, queries are jointly evaluated at the finest data granularity, because our framework does not limit query accuracy to a fixed spatial subdivision.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Large-scale scientific data, such as weather and climate simulations, often comprise a large number of attributes for each data sample, like temperature, pressure, humidity, and many more. Interactive visualization and analysis require filtering according to any desired combination of attributes, in particular logical <italic>AND</italic> operations, which is challenging for large data and many attributes. Many general data structures for this problem are built for and scale with a fixed number of attributes, and scalability of joint queries with arbitrary attribute subsets remains a significant problem. We propose a flexible probabilistic framework for multivariate range queries that decouples all attribute dimensions via <italic>projection</italic>, allowing any subset of attributes to be queried with full efficiency. Moreover, our approach is <italic>output-sensitive</italic>, mainly scaling with the cardinality of the query result rather than with the input data size. This is particularly important for joint attribute queries, where the query output is usually much smaller than the whole data set. Additionally, our approach can split query evaluation between user interaction and rendering, achieving much better scalability for interactive visualization than the previous state of the art. Furthermore, even when a multi-resolution strategy is used for visualization, queries are jointly evaluated at the finest data granularity, because our framework does not limit query accuracy to a fixed spatial subdivision.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Large-scale scientific data, such as weather and climate simulations, often comprise a large number of attributes for each data sample, like temperature, pressure, humidity, and many more. Interactive visualization and analysis require filtering according to any desired combination of attributes, in particular logical AND operations, which is challenging for large data and many attributes. Many general data structures for this problem are built for and scale with a fixed number of attributes, and scalability of joint queries with arbitrary attribute subsets remains a significant problem. We propose a flexible probabilistic framework for multivariate range queries that decouples all attribute dimensions via projection, allowing any subset of attributes to be queried with full efficiency. Moreover, our approach is output-sensitive, mainly scaling with the cardinality of the query result rather than with the input data size. This is particularly important for joint attribute queries, where the query output is usually much smaller than the whole data set. Additionally, our approach can split query evaluation between user interaction and rendering, achieving much better scalability for interactive visualization than the previous state of the art. Furthermore, even when a multi-resolution strategy is used for visualization, queries are jointly evaluated at the finest data granularity, because our framework does not limit query accuracy to a fixed spatial subdivision.",
"title": "Multivariate Probabilistic Range Queries for Scalable Interactive 3D Visualization",
"normalizedTitle": "Multivariate Probabilistic Range Queries for Scalable Interactive 3D Visualization",
"fno": "09903339",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Structures",
"Data Visualisation",
"Probability",
"Query Processing",
"Rendering Computer Graphics",
"Arbitrary Attribute Subsets",
"Climate Simulations",
"Data Sample",
"Finest Data Granularity",
"Flexible Probabilistic Framework",
"General Data Structures",
"Input Data Size",
"Interactive Visualization",
"Joint Attribute Queries",
"Joint Queries",
"Large Scale Scientific Data",
"Multivariate Range Queries",
"Probabilistic Range Queries",
"Query Accuracy",
"Query Evaluation",
"Query Output",
"Query Result",
"Rendering",
"Scalable Interactive 3 D",
"User Interaction",
"Weather",
"Data Visualization",
"Histograms",
"Probabilistic Logic",
"Data Structures",
"Rendering Computer Graphics",
"Query Processing",
"Humidity",
"High Dimensional Filtering",
"Multivariate Filtering",
"Output Sensitivity",
"Multivariate Attribute Queries",
"Progressive Culling"
],
"authors": [
{
"givenName": "Amani",
"surname": "Ageeli",
"fullName": "Amani Ageeli",
"affiliation": "King Abdullah University of Science and Technology (KAUST), Visual Computing Center, Thuwal, Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alberto",
"surname": "Jaspe-Villanueva",
"fullName": "Alberto Jaspe-Villanueva",
"affiliation": "King Abdullah University of Science and Technology (KAUST), Visual Computing Center, Thuwal, Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ronell",
"surname": "Sicat",
"fullName": "Ronell Sicat",
"affiliation": "King Abdullah University of Science and Technology (KAUST), Visual Computing Center, Thuwal, Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Florian",
"surname": "Mannuss",
"fullName": "Florian Mannuss",
"affiliation": "Saudi Aramco, Dhahran, 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"
},
{
"givenName": "Markus",
"surname": "Hadwiger",
"fullName": "Markus Hadwiger",
"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": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "646-656",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/nswctc/2009/3610/1/3610a670",
"title": "A Range Query Model Based on DHT in P2P System",
"doi": null,
"abstractUrl": "/proceedings-article/nswctc/2009/3610a670/12OmNARRYri",
"parentPublication": {
"id": "proceedings/nswctc/2009/3610/1",
"title": "Networks Security, Wireless Communications and Trusted Computing, International Conference on",
"__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/tk/2013/04/ttk2013040835",
"title": "Range-Based Skyline Queries in Mobile Environments",
"doi": null,
"abstractUrl": "/journal/tk/2013/04/ttk2013040835/13rRUNvgziV",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2010/04/ttk2010040550",
"title": "Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data",
"doi": null,
"abstractUrl": "/journal/tk/2010/04/ttk2010040550/13rRUxOvea5",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2009/03/ttk2009030351",
"title": "Efficient Processing of Metric Skyline Queries",
"doi": null,
"abstractUrl": "/journal/tk/2009/03/ttk2009030351/13rRUyueghx",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2022/0883/0/088300b423",
"title": "Fairness-Aware Range Queries for Selecting Unbiased Data",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2022/088300b423/1FwFGbGwm5O",
"parentPublication": {
"id": "proceedings/icde/2022/0883/0",
"title": "2022 IEEE 38th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2022/0883/0/088300b927",
"title": "vChain+: Optimizing Verifiable Blockchain Boolean Range Queries",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2022/088300b927/1FwFJY1Oe08",
"parentPublication": {
"id": "proceedings/icde/2022/0883/0",
"title": "2022 IEEE 38th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2019/7474/0/747400b610",
"title": "Continuous Range Queries Over Multi-attribute Trajectories",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2019/747400b610/1aDT3N4CFSo",
"parentPublication": {
"id": "proceedings/icde/2019/7474/0",
"title": "2019 IEEE 35th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/12/09360469",
"title": "Efficient Oblivious Query Processing for Range and kNN Queries",
"doi": null,
"abstractUrl": "/journal/tk/2022/12/09360469/1rqztmHtpjW",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ichi/2021/0132/0/013200a228",
"title": "Interactive Range Queries for Healthcare Data under Differential Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2021/013200a228/1xIOV00mOQg",
"parentPublication": {
"id": "proceedings/ichi/2021/0132/0",
"title": "2021 IEEE 9th International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09904442",
"articleId": "1H1gpt871W8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09925049",
"articleId": "1HBHYSHqD3a",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1J9yQmfUeGI",
"name": "ttg202301-09903339s1-supp1-3209439.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09903339s1-supp1-3209439.pdf",
"extension": "pdf",
"size": "726 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyxXlp2",
"title": "July",
"year": "2014",
"issueNum": "07",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUzp02om",
"doi": "10.1109/TVCG.2014.2317700",
"abstract": "This paper presents a technique for interactively colliding with and deforming mesostructures at a per-texel level. It is compatible with a broad range of existing mesostructure rendering techniques including both safe and unsafe ray-height field intersection algorithms. This technique is able to replace traditional 3D geometrical deformations (vertex-based) with 2D image space operations (pixel-based) that are parallelized on a GPU without CPU-GPU data shuffling and integrates well with existing physics engines. Additionally, surface and material properties may be specified at a per-texel level enabling a mesostructure to possess varying attributes intrinsic to its surface and collision behavior. Furthermore, this approach may replace traditional decals with image-based operations that naturally accumulate deformations without inserting any new geometry. This technique provides a simple and efficient way to make almost every surface in a virtual world responsive to user actions and events. It requires no preprocessing time and storage requirements of one additional texture or less. The algorithm uses existing inverse displacement map algorithms as well as existing physics engines and can be easily incorporated into new or existing game pipelines.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a technique for interactively colliding with and deforming mesostructures at a per-texel level. It is compatible with a broad range of existing mesostructure rendering techniques including both safe and unsafe ray-height field intersection algorithms. This technique is able to replace traditional 3D geometrical deformations (vertex-based) with 2D image space operations (pixel-based) that are parallelized on a GPU without CPU-GPU data shuffling and integrates well with existing physics engines. Additionally, surface and material properties may be specified at a per-texel level enabling a mesostructure to possess varying attributes intrinsic to its surface and collision behavior. Furthermore, this approach may replace traditional decals with image-based operations that naturally accumulate deformations without inserting any new geometry. This technique provides a simple and efficient way to make almost every surface in a virtual world responsive to user actions and events. It requires no preprocessing time and storage requirements of one additional texture or less. The algorithm uses existing inverse displacement map algorithms as well as existing physics engines and can be easily incorporated into new or existing game pipelines.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a technique for interactively colliding with and deforming mesostructures at a per-texel level. It is compatible with a broad range of existing mesostructure rendering techniques including both safe and unsafe ray-height field intersection algorithms. This technique is able to replace traditional 3D geometrical deformations (vertex-based) with 2D image space operations (pixel-based) that are parallelized on a GPU without CPU-GPU data shuffling and integrates well with existing physics engines. Additionally, surface and material properties may be specified at a per-texel level enabling a mesostructure to possess varying attributes intrinsic to its surface and collision behavior. Furthermore, this approach may replace traditional decals with image-based operations that naturally accumulate deformations without inserting any new geometry. This technique provides a simple and efficient way to make almost every surface in a virtual world responsive to user actions and events. It requires no preprocessing time and storage requirements of one additional texture or less. The algorithm uses existing inverse displacement map algorithms as well as existing physics engines and can be easily incorporated into new or existing game pipelines.",
"title": "Interactive Mesostructures with Volumetric Collisions",
"normalizedTitle": "Interactive Mesostructures with Volumetric Collisions",
"fno": "06799298",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Geometry",
"Graphics Processing Units",
"Rendering Computer Graphics",
"Interactive Mesostructures",
"Volumetric Collision",
"Mesostructure Rendering Technique",
"Ray Height Field Intersection Algorithm",
"Inverse Displacement Map Algorithm",
"Quadric Based Mesostructures",
"GPU",
"2 D Image Space Operation",
"Kernel",
"Graphics Processing Units",
"Rendering Computer Graphics",
"Geometry",
"Vectors",
"Physics",
"Surface Texture",
"Interactive Mesostructures",
"Inverse Displacement Mapping",
"Mesostructures",
"Quadric Based Mesostructures",
"Curvedmesostructures",
"Interactive Deformation",
"Real Time Deformable Mesostructures",
"GPU",
"GPGPU",
"CUDA",
"Per Texel Collision Detection",
"Image Based Rendering",
"Surface Details",
"Compute Shaders"
],
"authors": [
{
"givenName": "Scott",
"surname": "Nykl",
"fullName": "Scott Nykl",
"affiliation": "Department of Electrical Engineering and Computer Science, Ohio University, Athens",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chad",
"surname": "Mourning",
"fullName": "Chad Mourning",
"affiliation": "Department of Electrical Engineering and Computer Science, Ohio University, Athens",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "M. Chelberg",
"fullName": "David M. Chelberg",
"affiliation": "Department of Electrical Engineering and Computer Science, Ohio University, Athens",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2014-07-01 00:00:00",
"pubType": "trans",
"pages": "970-982",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/1993/3880/0/00341072",
"title": "Modeling and identifying 3-D color textures",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1993/00341072/12OmNAXxXdQ",
"parentPublication": {
"id": "proceedings/cvpr/1993/3880/0",
"title": "Proceedings of IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vg/2005/26/0/01500532",
"title": "Texturing and hypertexturing of volumetric objects",
"doi": null,
"abstractUrl": "/proceedings-article/vg/2005/01500532/12OmNBpVQ7X",
"parentPublication": {
"id": "proceedings/vg/2005/26/0",
"title": "Volume Graphics 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2017/2089/0/2089a088",
"title": "Interactive Physics-Based Deformation for Virtual Worlds",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2017/2089a088/12OmNBt3qoi",
"parentPublication": {
"id": "proceedings/cw/2017/2089/0",
"title": "2017 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2003/2028/0/20280141",
"title": "A Painting Interface for Interactive Surface Deformations",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2003/20280141/12OmNsbGvEM",
"parentPublication": {
"id": "proceedings/pg/2003/2028/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2015/7962/0/7962a001",
"title": "Meta-Relief Texture Mapping with Dynamic Texture-Space Ambient Occlusion",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2015/7962a001/12OmNyp9MiX",
"parentPublication": {
"id": "proceedings/sibgrapi/2015/7962/0",
"title": "2015 28th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2004/2158/1/01315056",
"title": "Hybrid textons: modeling surfaces with reflectance and geometry",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2004/01315056/12OmNzaQoiU",
"parentPublication": {
"id": "proceedings/cvpr/2004/2158/1",
"title": "Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111811",
"title": "Precomputed Safety Shapes for Efficient and Accurate Height-Field Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111811/13rRUxjQyvh",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000d897",
"title": "RayNet: Learning Volumetric 3D Reconstruction with Ray Potentials",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000d897/17D45VVho4R",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600d938",
"title": "<tex>Z_$\\phi$_Z</tex>-SfT: Shape-from-Template with a Physics-Based Deformation Model",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600d938/1H0L0rADIpq",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800l1094",
"title": "SAPIEN: A SimulAted Part-Based Interactive ENvironment",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800l1094/1m3o2eIldoA",
"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": "06766598",
"articleId": "13rRUyeCkah",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06766599",
"articleId": "13rRUyoPSP6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBl6EJV",
"title": "October-December",
"year": "2000",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "6",
"label": "October-December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgarnA",
"doi": "10.1109/2945.895876",
"abstract": "Abstract—The behavior of light interacting with materials is a crucial factor in achieving a high degree of realism in image synthesis. Local illumination processes, describing the interactions between a point of the surface and a shading ray, are evaluated by Bidirectional Reflectance Distribution Functions (BRDFs). Current theoretical BRDFs use surface models restricted to roughness only, sometimes at different scales. In this paper, we present a more complete surface micro-geometry description, suitable for some common surface defects, including porosity and micro-cracks; both of them are crucial surface features since they strongly influence light reflection properties. These new features are modeled by holes inserted in the surface profile, depending on two parameters: the proportion of surface covered by the defects and the mean geometric characteristic of these defects. In order to preserve the advantages and characteristics of existing BRDFs, a postprocessing method is adopted (we integrate our technique into existing models, instead of defining a completely new one). Beyond providing graphical results closely matching real behaviors, this method moreover opens the way to various important new considerations in computer graphics (for example, changes of appearance due to the degree of humidity).",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—The behavior of light interacting with materials is a crucial factor in achieving a high degree of realism in image synthesis. Local illumination processes, describing the interactions between a point of the surface and a shading ray, are evaluated by Bidirectional Reflectance Distribution Functions (BRDFs). Current theoretical BRDFs use surface models restricted to roughness only, sometimes at different scales. In this paper, we present a more complete surface micro-geometry description, suitable for some common surface defects, including porosity and micro-cracks; both of them are crucial surface features since they strongly influence light reflection properties. These new features are modeled by holes inserted in the surface profile, depending on two parameters: the proportion of surface covered by the defects and the mean geometric characteristic of these defects. In order to preserve the advantages and characteristics of existing BRDFs, a postprocessing method is adopted (we integrate our technique into existing models, instead of defining a completely new one). Beyond providing graphical results closely matching real behaviors, this method moreover opens the way to various important new considerations in computer graphics (for example, changes of appearance due to the degree of humidity).",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—The behavior of light interacting with materials is a crucial factor in achieving a high degree of realism in image synthesis. Local illumination processes, describing the interactions between a point of the surface and a shading ray, are evaluated by Bidirectional Reflectance Distribution Functions (BRDFs). Current theoretical BRDFs use surface models restricted to roughness only, sometimes at different scales. In this paper, we present a more complete surface micro-geometry description, suitable for some common surface defects, including porosity and micro-cracks; both of them are crucial surface features since they strongly influence light reflection properties. These new features are modeled by holes inserted in the surface profile, depending on two parameters: the proportion of surface covered by the defects and the mean geometric characteristic of these defects. In order to preserve the advantages and characteristics of existing BRDFs, a postprocessing method is adopted (we integrate our technique into existing models, instead of defining a completely new one). Beyond providing graphical results closely matching real behaviors, this method moreover opens the way to various important new considerations in computer graphics (for example, changes of appearance due to the degree of humidity).",
"title": "A BRDF Postprocess to Integrate Porosity on Rendered Surfaces",
"normalizedTitle": "A BRDF Postprocess to Integrate Porosity on Rendered Surfaces",
"fno": "v0306",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Realistic Rendering",
"BRDF",
"Physical State Of Surfaces",
"Porosity Measurements"
],
"authors": [
{
"givenName": "Stéphane",
"surname": "Mérillou",
"fullName": "Stéphane Mérillou",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jean-Michel",
"surname": "Dischler",
"fullName": "Jean-Michel Dischler",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Djamchid",
"surname": "Ghazanfarpour",
"fullName": "Djamchid Ghazanfarpour",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2000-10-01 00:00:00",
"pubType": "trans",
"pages": "306-318",
"year": "2000",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0289",
"articleId": "13rRUwbaqUD",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0319",
"articleId": "13rRUyv53Fb",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwCJOFY",
"title": "April",
"year": "2010",
"issueNum": "04",
"idPrefix": "tp",
"pubType": "journal",
"volume": "32",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0xQ0D",
"doi": "10.1109/TPAMI.2009.54",
"abstract": "This paper proposes a new method to synthesize and inpaint geometric textures. The texture model is composed of a geometric layer that drives the computation of a new grouplet transform. The geometry is an orientation flow that follows the patterns of the texture to analyze or synthesize. The grouplet transform extends the original construction of Mallat [1] and is adapted to the modeling of natural textures. Each grouplet atoms is an elongated stroke located along the geometric flow. These atoms exhibit a wide range of lengths and widths, which is important to match the variety of structures present in natural images. Statistical modeling and sparsity optimization over these grouplet coefficients enable the synthesis of texture patterns along the flow. This paper explores texture inpainting and texture synthesis, which both require the joint optimization of the geometric flow and the grouplet coefficients.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper proposes a new method to synthesize and inpaint geometric textures. The texture model is composed of a geometric layer that drives the computation of a new grouplet transform. The geometry is an orientation flow that follows the patterns of the texture to analyze or synthesize. The grouplet transform extends the original construction of Mallat [1] and is adapted to the modeling of natural textures. Each grouplet atoms is an elongated stroke located along the geometric flow. These atoms exhibit a wide range of lengths and widths, which is important to match the variety of structures present in natural images. Statistical modeling and sparsity optimization over these grouplet coefficients enable the synthesis of texture patterns along the flow. This paper explores texture inpainting and texture synthesis, which both require the joint optimization of the geometric flow and the grouplet coefficients.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper proposes a new method to synthesize and inpaint geometric textures. The texture model is composed of a geometric layer that drives the computation of a new grouplet transform. The geometry is an orientation flow that follows the patterns of the texture to analyze or synthesize. The grouplet transform extends the original construction of Mallat [1] and is adapted to the modeling of natural textures. Each grouplet atoms is an elongated stroke located along the geometric flow. These atoms exhibit a wide range of lengths and widths, which is important to match the variety of structures present in natural images. Statistical modeling and sparsity optimization over these grouplet coefficients enable the synthesis of texture patterns along the flow. This paper explores texture inpainting and texture synthesis, which both require the joint optimization of the geometric flow and the grouplet coefficients.",
"title": "Texture Synthesis with Grouplets",
"normalizedTitle": "Texture Synthesis with Grouplets",
"fno": "ttp2010040733",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Texture",
"Grouplets",
"Texture Synthesis",
"Inpainting"
],
"authors": [
{
"givenName": "Gabriel",
"surname": "Peyré",
"fullName": "Gabriel Peyré",
"affiliation": "Université Paris-Dauphine, CEREMADE, Paris",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2010-04-01 00:00:00",
"pubType": "trans",
"pages": "733-746",
"year": "2010",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iscsct/2008/3498/2/3498b230",
"title": "3D Surface Texture Synthesis Based on Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/iscsct/2008/3498b230/12OmNBRsVxV",
"parentPublication": {
"id": "proceedings/iscsct/2008/3498/1",
"title": "2008 International Symposium on Computer Science and Computational Technology (ISCSCT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-cg/2005/2473/0/24730497",
"title": "A Hybrid Scheme of Texture Synthesis for Capturing Macro & Micro Structures",
"doi": null,
"abstractUrl": "/proceedings-article/cad-cg/2005/24730497/12OmNBajTM3",
"parentPublication": {
"id": "proceedings/cad-cg/2005/2473/0",
"title": "Ninth International Conference on Computer Aided Design and Computer Graphics (CAD-CG'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2003/1900/2/190020707",
"title": "Simultaneous Structure and Texture Image Inpainting",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2003/190020707/12OmNBp52wc",
"parentPublication": {
"id": "proceedings/cvpr/2003/1900/2",
"title": "2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ncm/2009/3769/0/3769b240",
"title": "A Fast Texture Matching Algorithm Based on Multi-resolution and Partition",
"doi": null,
"abstractUrl": "/proceedings-article/ncm/2009/3769b240/12OmNBtl1A2",
"parentPublication": {
"id": "proceedings/ncm/2009/3769/0",
"title": "Networked Computing and Advanced Information Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwcse/2009/3881/1/3881a238",
"title": "Organ Texture Synthesis for Virtual Reality-Based Surgical Simulators",
"doi": null,
"abstractUrl": "/proceedings-article/iwcse/2009/3881a238/12OmNrJAdRy",
"parentPublication": {
"id": "proceedings/iwcse/2009/3881/1",
"title": "Computer Science and Engineering, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2009/3789/0/3789a018",
"title": "Skeletal Texture Synthesis",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2009/3789a018/12OmNwIHopo",
"parentPublication": {
"id": "proceedings/cgiv/2009/3789/0",
"title": "2009 Sixth International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mmit/2008/3556/0/3556a272",
"title": "TV-Based Texture Image Inpainting",
"doi": null,
"abstractUrl": "/proceedings-article/mmit/2008/3556a272/12OmNy3RRMP",
"parentPublication": {
"id": "proceedings/mmit/2008/3556/0",
"title": "MultiMedia and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2004/2171/0/21710582",
"title": "Fast and High Quality Overlap Repair for Patch-Based Texture Synthesis",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2004/21710582/12OmNzE54Fm",
"parentPublication": {
"id": "proceedings/cgi/2004/2171/0",
"title": "Proceedings. Computer Graphics International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2001/02/v0120",
"title": "Texture Mixing and Texture Movie Synthesis Using Statistical Learning",
"doi": null,
"abstractUrl": "/journal/tg/2001/02/v0120/13rRUwbaqLn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111836",
"title": "Statistical Invariance for Texture Synthesis",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111836/13rRUygT7ya",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2010040722",
"articleId": "13rRUxcKzWp",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2010040747",
"articleId": "13rRUyeTVjd",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid78",
"title": "October-December",
"year": "2001",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "7",
"label": "October-December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwIF69a",
"doi": "10.1109/2945.965349",
"abstract": "Abstract—In this paper, we present a pipeline and several key techniques necessary for editing a real scene captured with both cameras and laser range scanners. We develop automatic algorithms to segment the geometry from range images into distinct surfaces, register texture from radiance images with the geometry, and synthesize compact high-quality texture maps. The result is an object-level representation of the scene which can be rendered with modifications to structure via traditional rendering methods. The segmentation algorithm for geometry operates directly on the point cloud from multiple registered 3D range images instead of a reconstructed mesh. It is a top-down algorithm which recursively partitions a point set into two subsets using a pairwise similarity measure. The result is a binary tree with individual surfaces as leaves. Our image registration technique performs a very efficient search to automatically find the camera poses for arbitrary position and orientation relative to the geometry. Thus, we can take photographs from any location without precalibration between the scanner and the camera. The algorithms have been applied to large-scale real data. We demonstrate our ability to edit a captured scene by moving, inserting, and deleting objects.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—In this paper, we present a pipeline and several key techniques necessary for editing a real scene captured with both cameras and laser range scanners. We develop automatic algorithms to segment the geometry from range images into distinct surfaces, register texture from radiance images with the geometry, and synthesize compact high-quality texture maps. The result is an object-level representation of the scene which can be rendered with modifications to structure via traditional rendering methods. The segmentation algorithm for geometry operates directly on the point cloud from multiple registered 3D range images instead of a reconstructed mesh. It is a top-down algorithm which recursively partitions a point set into two subsets using a pairwise similarity measure. The result is a binary tree with individual surfaces as leaves. Our image registration technique performs a very efficient search to automatically find the camera poses for arbitrary position and orientation relative to the geometry. Thus, we can take photographs from any location without precalibration between the scanner and the camera. The algorithms have been applied to large-scale real data. We demonstrate our ability to edit a captured scene by moving, inserting, and deleting objects.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—In this paper, we present a pipeline and several key techniques necessary for editing a real scene captured with both cameras and laser range scanners. We develop automatic algorithms to segment the geometry from range images into distinct surfaces, register texture from radiance images with the geometry, and synthesize compact high-quality texture maps. The result is an object-level representation of the scene which can be rendered with modifications to structure via traditional rendering methods. The segmentation algorithm for geometry operates directly on the point cloud from multiple registered 3D range images instead of a reconstructed mesh. It is a top-down algorithm which recursively partitions a point set into two subsets using a pairwise similarity measure. The result is a binary tree with individual surfaces as leaves. Our image registration technique performs a very efficient search to automatically find the camera poses for arbitrary position and orientation relative to the geometry. Thus, we can take photographs from any location without precalibration between the scanner and the camera. The algorithms have been applied to large-scale real data. We demonstrate our ability to edit a captured scene by moving, inserting, and deleting objects.",
"title": "Extracting Objects from Range and Radiance Images",
"normalizedTitle": "Extracting Objects from Range and Radiance Images",
"fno": "v0351",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Scene Editing",
"Object Level Representation",
"Range Image Segmentation",
"Image Registration",
"Texture Mapping",
"Image Based Modeling",
"Image Based Rendering",
"Augmented Reality"
],
"authors": [
{
"givenName": "Yizhou",
"surname": "Yu",
"fullName": "Yizhou Yu",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andras",
"surname": "Ferencz",
"fullName": "Andras Ferencz",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jitendra",
"surname": "Malik",
"fullName": "Jitendra Malik",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2001-10-01 00:00:00",
"pubType": "trans",
"pages": "351-364",
"year": "2001",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0343",
"articleId": "13rRUwI5UfS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0365",
"articleId": "13rRUwgQpDd",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAgY7pg",
"title": "March",
"year": "2001",
"issueNum": "03",
"idPrefix": "tp",
"pubType": "journal",
"volume": "23",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwbs1Tw",
"doi": "10.1109/34.910881",
"abstract": "Abstract—Image editing systems are essentially pixel-based. In this paper, we propose a novel method for image editing in which the primitive working unit is not a pixel but an edge. The feasibility of this proposal is suggested by recent work showing that a gray-scale image can be accurately represented by its edge map if a suitable edge model and scale selection method are employed [1]. In particular, an efficient algorithm has been reported to invert such an edge representation to yield a high-fidelity reconstruction of the original image [2], [3]. We have combined these algorithms together with an efficient method for contour grouping and an intuitive user interface to allow users to perform image editing operations (crop, paste, delete) directly in the contour domain. Experimental results suggest that this novel combination of vision algorithms may increase the efficiency of certain classes of image editing operations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Image editing systems are essentially pixel-based. In this paper, we propose a novel method for image editing in which the primitive working unit is not a pixel but an edge. The feasibility of this proposal is suggested by recent work showing that a gray-scale image can be accurately represented by its edge map if a suitable edge model and scale selection method are employed [1]. In particular, an efficient algorithm has been reported to invert such an edge representation to yield a high-fidelity reconstruction of the original image [2], [3]. We have combined these algorithms together with an efficient method for contour grouping and an intuitive user interface to allow users to perform image editing operations (crop, paste, delete) directly in the contour domain. Experimental results suggest that this novel combination of vision algorithms may increase the efficiency of certain classes of image editing operations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Image editing systems are essentially pixel-based. In this paper, we propose a novel method for image editing in which the primitive working unit is not a pixel but an edge. The feasibility of this proposal is suggested by recent work showing that a gray-scale image can be accurately represented by its edge map if a suitable edge model and scale selection method are employed [1]. In particular, an efficient algorithm has been reported to invert such an edge representation to yield a high-fidelity reconstruction of the original image [2], [3]. We have combined these algorithms together with an efficient method for contour grouping and an intuitive user interface to allow users to perform image editing operations (crop, paste, delete) directly in the contour domain. Experimental results suggest that this novel combination of vision algorithms may increase the efficiency of certain classes of image editing operations.",
"title": "Image Editing in the Contour Domain",
"normalizedTitle": "Image Editing in the Contour Domain",
"fno": "i0291",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Image Editing",
"Edge Detection",
"Reconstruction",
"Contour Grouping",
"Segmentation"
],
"authors": [
{
"givenName": "James H.",
"surname": "Elder",
"fullName": "James H. Elder",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Richard M.",
"surname": "Goldberg",
"fullName": "Richard M. Goldberg",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2001-03-01 00:00:00",
"pubType": "trans",
"pages": "291-296",
"year": "2001",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0279",
"articleId": "13rRUILc8g3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0297",
"articleId": "13rRUwvBy9R",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBCZnU8",
"title": "January/February",
"year": "2007",
"issueNum": "01",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "9",
"label": "January/February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxAStVX",
"doi": "10.1109/MCSE.2007.14",
"abstract": "Monte Carlo methods use sampling to produce approximate solutions to problems for which other methods aren't practical. In this homework assignment, we study three uses of Monte Carlo methods: for function minimization, discrete optimization, and counting.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Monte Carlo methods use sampling to produce approximate solutions to problems for which other methods aren't practical. In this homework assignment, we study three uses of Monte Carlo methods: for function minimization, discrete optimization, and counting.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Monte Carlo methods use sampling to produce approximate solutions to problems for which other methods aren't practical. In this homework assignment, we study three uses of Monte Carlo methods: for function minimization, discrete optimization, and counting.",
"title": "Monte Carlo Minimization and Counting: One, Two, ..., Too Many",
"normalizedTitle": "Monte Carlo Minimization and Counting: One, Two, ..., Too Many",
"fno": "c1072",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Monte Carlo Methods",
"Sampling",
"Minimization",
"Computer Science"
],
"authors": [
{
"givenName": "Isabel",
"surname": "Beichl",
"fullName": "Isabel Beichl",
"affiliation": "NIST",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dianne P.",
"surname": "O'Leary",
"fullName": "Dianne P. O'Leary",
"affiliation": "University of Maryland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Francis",
"surname": "Sullivan",
"fullName": "Francis Sullivan",
"affiliation": "IDA Center for Computing Sciences",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2007-01-01 00:00:00",
"pubType": "mags",
"pages": "72-80",
"year": "2007",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wsc/2006/0500/0/04117682",
"title": "Quas-Monte Carlo Strategies for Stochastic Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/wsc/2006/04117682/12OmNBcAGMS",
"parentPublication": {
"id": "proceedings/wsc/2006/0500/0",
"title": "2006 Winter Simulation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wsc/1993/1381/0/00718418",
"title": "Monte Carlo Estimation of Bayesian Robustness",
"doi": null,
"abstractUrl": "/proceedings-article/wsc/1993/00718418/12OmNC943IG",
"parentPublication": {
"id": "proceedings/wsc/1993/1381/0",
"title": "Proceedings of 1993 Winter Simulation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom-bigdatase-i-spa/2016/3205/0/07847208",
"title": "Parallel Monte Carlo Method with MapReduce for Option Pricing",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom-bigdatase-i-spa/2016/07847208/12OmNxcMSlh",
"parentPublication": {
"id": "proceedings/trustcom-bigdatase-i-spa/2016/3205/0",
"title": "2016 IEEE Trustcom/BigDataSE/ISPA",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2005/9313/0/01577198",
"title": "Adaptive sampling with Renyi entropy in Monte Carlo path tracing",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2005/01577198/12OmNzEVS1q",
"parentPublication": {
"id": "proceedings/isspit/2005/9313/0",
"title": "2005 IEEE International Symposium on Signal Processing and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2010/04/05551182",
"title": "Monte Carlo Tree Search in Hex",
"doi": null,
"abstractUrl": "/journal/ci/2010/04/05551182/13rRUB6SpUL",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2006/02/c2020",
"title": "Fluid Simulation with the Geometric Cluster Monte Carlo Algorithm",
"doi": null,
"abstractUrl": "/magazine/cs/2006/02/c2020/13rRUIJcWs6",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2012/01/06169183",
"title": "Monte Carlo beam search",
"doi": null,
"abstractUrl": "/journal/ci/2012/01/06169183/13rRUwfqpG8",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2006/02/c2007",
"title": "Guest Editors' Introduction: Monte Carlo Methods",
"doi": null,
"abstractUrl": "/magazine/cs/2006/02/c2007/13rRUyg2jLV",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2009/06/mcs2009060103",
"title": "Descriptions and Comparisons of Monte Carlo Algorithms",
"doi": null,
"abstractUrl": "/magazine/cs/2009/06/mcs2009060103/13rRUyuNsAN",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2020/9360/0/09150640",
"title": "Monte Carlo Gradient Quantization",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2020/09150640/1lPHBwfVEyY",
"parentPublication": {
"id": "proceedings/cvprw/2020/9360/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "c1058",
"articleId": "13rRUxNmPJA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "c1082",
"articleId": "13rRUy08Mwj",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzd7bmf",
"title": "March",
"year": "2011",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyoPSP2",
"doi": "10.1109/TVCG.2010.53",
"abstract": "Centroidal Voronoi tessellations (CVT) are widely used in computational science and engineering. The most commonly used method is Lloyd's method, and recently the L-BFGS method is shown to be faster than Lloyd's method for computing the CVT. However, these methods run on the CPU and are still too slow for many practical applications. We present techniques to implement these methods on the GPU for computing the CVT on 2D planes and on surfaces, and demonstrate significant speedup of these GPU-based methods over their CPU counterparts. For CVT computation on a surface, we use a geometry image stored in the GPU to represent the surface for computing the Voronoi diagram on it. In our implementation a new technique is proposed for parallel regional reduction on the GPU for evaluating integrals over Voronoi cells.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Centroidal Voronoi tessellations (CVT) are widely used in computational science and engineering. The most commonly used method is Lloyd's method, and recently the L-BFGS method is shown to be faster than Lloyd's method for computing the CVT. However, these methods run on the CPU and are still too slow for many practical applications. We present techniques to implement these methods on the GPU for computing the CVT on 2D planes and on surfaces, and demonstrate significant speedup of these GPU-based methods over their CPU counterparts. For CVT computation on a surface, we use a geometry image stored in the GPU to represent the surface for computing the Voronoi diagram on it. In our implementation a new technique is proposed for parallel regional reduction on the GPU for evaluating integrals over Voronoi cells.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Centroidal Voronoi tessellations (CVT) are widely used in computational science and engineering. The most commonly used method is Lloyd's method, and recently the L-BFGS method is shown to be faster than Lloyd's method for computing the CVT. However, these methods run on the CPU and are still too slow for many practical applications. We present techniques to implement these methods on the GPU for computing the CVT on 2D planes and on surfaces, and demonstrate significant speedup of these GPU-based methods over their CPU counterparts. For CVT computation on a surface, we use a geometry image stored in the GPU to represent the surface for computing the Voronoi diagram on it. In our implementation a new technique is proposed for parallel regional reduction on the GPU for evaluating integrals over Voronoi cells.",
"title": "GPU-Assisted Computation of Centroidal Voronoi Tessellation",
"normalizedTitle": "GPU-Assisted Computation of Centroidal Voronoi Tessellation",
"fno": "ttg2011030345",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Centroidal Voronoi Tessellation",
"Graphics Hardware",
"Lloyds Algorithm",
"L BFGS Algorithm",
"Remeshing"
],
"authors": [
{
"givenName": "Guodong",
"surname": "Rong",
"fullName": "Guodong Rong",
"affiliation": "University of Texas at Dallas, Richardson",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yang",
"surname": "Liu",
"fullName": "Yang Liu",
"affiliation": "LORIA/INRIA Lorraine, Villers les Nancy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wenping",
"surname": "Wang",
"fullName": "Wenping Wang",
"affiliation": "The University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaotian",
"surname": "Yin",
"fullName": "Xiaotian Yin",
"affiliation": "State University of New York at Stony Brook, Stony Brook",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xianfeng David",
"surname": "Gu",
"fullName": "Xianfeng David Gu",
"affiliation": "State University of New York at Stony Brook, Stony Brook",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaohu",
"surname": "Guo",
"fullName": "Xiaohu Guo",
"affiliation": "University of Texas at Dallas, Richardson",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2011-03-01 00:00:00",
"pubType": "trans",
"pages": "345-356",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/smi/2008/2260/0/04547934",
"title": "Computation and properties of Centroidal Voronoi Tessellation",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2008/04547934/12OmNAKuoTH",
"parentPublication": {
"id": "proceedings/smi/2008/2260/0",
"title": "IEEE International Conference on Shape Modeling and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2011/0394/0/05995590",
"title": "A Multichannel Edge-Weighted Centroidal Voronoi Tessellation algorithm for 3D super-alloy image segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995590/12OmNqFJhDm",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isuma/2003/1997/0/19970174",
"title": "Initial Evaluation of Centroidal Voronoi Tessellation Method for Statistical Sampling and Function Integration",
"doi": null,
"abstractUrl": "/proceedings-article/isuma/2003/19970174/12OmNvDZF3B",
"parentPublication": {
"id": "proceedings/isuma/2003/1997/0",
"title": "Uncertainty Modeling and Analysis, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvd/2013/5037/0/5037a075",
"title": "Centroidal Voronoi Tessellation of Streamlines for Flow Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/isvd/2013/5037a075/12OmNvStcGN",
"parentPublication": {
"id": "proceedings/isvd/2013/5037/0",
"title": "2013 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvd/2011/4483/0/4483a177",
"title": "Computing 2D Periodic Centroidal Voronoi Tessellation",
"doi": null,
"abstractUrl": "/proceedings-article/isvd/2011/4483a177/12OmNwHhoTy",
"parentPublication": {
"id": "proceedings/isvd/2011/4483/0",
"title": "2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880043",
"title": "Centroidal Voronoi Tessellation Based Algorithms for Vector Fields Visualization and Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880043/12OmNzZEAD4",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2013/02/tts2013020163",
"title": "Centroidal Voronoi Tessellations- A New Approach to Random Testing",
"doi": null,
"abstractUrl": "/journal/ts/2013/02/tts2013020163/13rRUwwslul",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111880",
"title": "Global Optimization of Centroidal Voronoi Tessellation with Monte Carlo Approach",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111880/13rRUy3xY87",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/09/07346512",
"title": "Non-Obtuse Remeshing with Centroidal Voronoi Tessellation",
"doi": null,
"abstractUrl": "/journal/tg/2016/09/07346512/13rRUzp02or",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvd/2006/2630/0/04124816",
"title": "A New Initialization Method for Constructing Centroidal Voronoi Tessellations on Surface Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/isvd/2006/04124816/17D45WGGoMj",
"parentPublication": {
"id": "proceedings/isvd/2006/2630/0",
"title": "2006 3rd International Symposium on Voronoi Diagrams in Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011030333",
"articleId": "13rRUxYrbMb",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011030357",
"articleId": "13rRUxlgy3D",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesYp",
"name": "ttg2011030345s.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2011030345s.mov",
"extension": "mov",
"size": "18.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAXPyfp",
"title": "Nov.-Dec.",
"year": "2011",
"issueNum": "06",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "31",
"label": "Nov.-Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyoPSRx",
"doi": "10.1109/MCG.2011.96",
"abstract": "This tutorial provides a starting point for curve-based modeling. It introduces three rough categories of curve-based-modeling methods: extruding 2D shapes, inflating 2D shapes, and drawing 3D curves. This tutorial introduces representative methods that yield positive results while also exposing several issues related to curve-based modeling.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This tutorial provides a starting point for curve-based modeling. It introduces three rough categories of curve-based-modeling methods: extruding 2D shapes, inflating 2D shapes, and drawing 3D curves. This tutorial introduces representative methods that yield positive results while also exposing several issues related to curve-based modeling.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This tutorial provides a starting point for curve-based modeling. It introduces three rough categories of curve-based-modeling methods: extruding 2D shapes, inflating 2D shapes, and drawing 3D curves. This tutorial introduces representative methods that yield positive results while also exposing several issues related to curve-based modeling.",
"title": "Curve-Based Shape Modeling - a Tutorial",
"normalizedTitle": "Curve-Based Shape Modeling - a Tutorial",
"fno": "mcg2011060018",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Tutorials",
"Shape Analysis",
"Three Dimensional Displays",
"Two Dimensional Displays",
"Curve Fitting",
"Approximation Methods",
"Graphics And Multimedia",
"Curve Based Modeling",
"Shape Extrusion",
"2 D Curves",
"3 D Curves",
"Sketch Based Interfaces",
"Sweep Paths",
"Fiber Mesh",
"Teddy",
"I Love Sketch",
"Computer Graphics"
],
"authors": [
{
"givenName": "Pushkar",
"surname": "Joshi",
"fullName": "Pushkar Joshi",
"affiliation": "Motorola Mobility",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2011-11-01 00:00:00",
"pubType": "mags",
"pages": "18-23",
"year": "2011",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icalt/2018/6049/0/604901a128",
"title": "Design and Evaluation of Game-Based Learning Module for 3D Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2018/604901a128/12OmNCwUmtN",
"parentPublication": {
"id": "proceedings/icalt/2018/6049/0",
"title": "2018 IEEE 18th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/1997/8076/0/80760337",
"title": "Feature based 2D shape transformation",
"doi": null,
"abstractUrl": "/proceedings-article/iv/1997/80760337/12OmNqG0T1W",
"parentPublication": {
"id": "proceedings/iv/1997/8076/0",
"title": "Proceedings. 1997 IEEE Conference on Information Visualization (Cat. No.97TB100165)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoip/2010/4252/2/4252b407",
"title": "Stream Curve and Numerical Modeling for High-Speed Train",
"doi": null,
"abstractUrl": "/proceedings-article/icoip/2010/4252b407/12OmNvpew8V",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2001/1263/0/12630276",
"title": "A Bezier Curve-Based Approach to Shape Description for Chinese Calligraphy Characters",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2001/12630276/12OmNxT56zP",
"parentPublication": {
"id": "proceedings/icdar/2001/1263/0",
"title": "Proceedings of Sixth International Conference on Document Analysis and Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icece/2010/4031/0/4031d126",
"title": "Turbulence Route Curve Fitting Method Based on K-E Differential Equation and Energy Optimization Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/icece/2010/4031d126/12OmNyrqzGr",
"parentPublication": {
"id": "proceedings/icece/2010/4031/0",
"title": "Electrical and Control Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-cg/2005/2473/0/24730163",
"title": "The curve-structure invariant moments for shape analysis and recognition",
"doi": null,
"abstractUrl": "/proceedings-article/cad-cg/2005/24730163/12OmNzTH12O",
"parentPublication": {
"id": "proceedings/cad-cg/2005/2473/0",
"title": "Ninth International Conference on Computer Aided Design and Computer Graphics (CAD-CG'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2010/4166/0/4166a068",
"title": "Differential Evolution Optimization for Bezier Curve Fitting",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2010/4166a068/12OmNzYNNjl",
"parentPublication": {
"id": "proceedings/cgiv/2010/4166/0",
"title": "2010 Seventh International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2002/05/i0674",
"title": "A Curve Fitting Problem and Its Application in Modeling Objects in Monocular Image Sequences",
"doi": null,
"abstractUrl": "/journal/tp/2002/05/i0674/13rRUygT7nZ",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2006/03/mcg2006030072",
"title": "Cords: Geometric Curve Primitives for Modeling Contact",
"doi": null,
"abstractUrl": "/magazine/cg/2006/03/mcg2006030072/13rRUynZ5qf",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/secdev/2022/7182/0/718200a005",
"title": "Tutorial: Threat Modeling of Cloud-based Solutions",
"doi": null,
"abstractUrl": "/proceedings-article/secdev/2022/718200a005/1J6hmQLfoDS",
"parentPublication": {
"id": "proceedings/secdev/2022/7182/0",
"title": "2022 IEEE Secure Development Conference (SecDev)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2011060016",
"articleId": "13rRUwjoNCe",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2011060024",
"articleId": "13rRUIJcWfV",
"__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": "13rRUxAASMX",
"doi": "10.1109/MCG.2011.71",
"abstract": "Speech technology and computer graphics remain worlds apart, and the development of visual speech synthesis suffers from lack of a unified conceptual and technological framework. To meet this need, Carnival, an object-oriented environment, integrates speech processing with real-time graphics. It comprises an unlimited number of modules that can be dynamically loaded and assembled into a mutable animation production system. The Web extra is an example of audo-driven animation produced using the Carnival object-oriented environment.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Speech technology and computer graphics remain worlds apart, and the development of visual speech synthesis suffers from lack of a unified conceptual and technological framework. To meet this need, Carnival, an object-oriented environment, integrates speech processing with real-time graphics. It comprises an unlimited number of modules that can be dynamically loaded and assembled into a mutable animation production system. The Web extra is an example of audo-driven animation produced using the Carnival object-oriented environment.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Speech technology and computer graphics remain worlds apart, and the development of visual speech synthesis suffers from lack of a unified conceptual and technological framework. To meet this need, Carnival, an object-oriented environment, integrates speech processing with real-time graphics. It comprises an unlimited number of modules that can be dynamically loaded and assembled into a mutable animation production system. The Web extra is an example of audo-driven animation produced using the Carnival object-oriented environment.",
"title": "Carnival—Combining Speech Technology and Computer Animation",
"normalizedTitle": "Carnival—Combining Speech Technology and Computer Animation",
"fno": "mcg2011050080",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Speech",
"Animation",
"Visualization",
"Synchronization",
"Games",
"Acoustics",
"Face"
],
"authors": [
{
"givenName": "Michael A.",
"surname": "Berger",
"fullName": "Michael A. Berger",
"affiliation": "Speech Graphics Ltd.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gregor",
"surname": "Hofer",
"fullName": "Gregor Hofer",
"affiliation": "Speech Graphics Ltd.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hiroshi",
"surname": "Shimodaira",
"fullName": "Hiroshi Shimodaira",
"affiliation": "University of Edinburgh",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2011-09-01 00:00:00",
"pubType": "mags",
"pages": "80-89",
"year": "2011",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/culture-computing/2011/4546/0/4546a121",
"title": "Thai Speech-Driven Facial Animation",
"doi": null,
"abstractUrl": "/proceedings-article/culture-computing/2011/4546a121/12OmNARiM0A",
"parentPublication": {
"id": "proceedings/culture-computing/2011/4546/0",
"title": "International Conference on Culture and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2002/1784/0/17840077",
"title": "\"May I talk to you? :-)\" — Facial Animation from Text",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2002/17840077/12OmNAkWveH",
"parentPublication": {
"id": "proceedings/pg/2002/1784/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2011/348/0/06011861",
"title": "Animation of generic 3D head models driven by speech",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2011/06011861/12OmNviZlAw",
"parentPublication": {
"id": "proceedings/icme/2011/348/0",
"title": "2011 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iih-msp/2008/3278/0/3278a113",
"title": "An Approach to Speech Driven Animation",
"doi": null,
"abstractUrl": "/proceedings-article/iih-msp/2008/3278a113/12OmNvw2TcQ",
"parentPublication": {
"id": "proceedings/iih-msp/2008/3278/0",
"title": "2008 Fourth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvmp/2010/4268/0/4268a171",
"title": "Prominence Driven Character Animation",
"doi": null,
"abstractUrl": "/proceedings-article/cvmp/2010/4268a171/12OmNxFaLtB",
"parentPublication": {
"id": "proceedings/cvmp/2010/4268/0",
"title": "2010 Conference on Visual Media Production",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/alpit/2008/3273/0/3273a257",
"title": "3D Visible Speech Animation Driven by Chinese Prosody Markup Language",
"doi": null,
"abstractUrl": "/proceedings-article/alpit/2008/3273a257/12OmNxwncJs",
"parentPublication": {
"id": "proceedings/alpit/2008/3273/0",
"title": "Advanced Language Processing and Web Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111915",
"title": "A Statistical Quality Model for Data-Driven Speech Animation",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111915/13rRUIIVlkf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/06/v1523",
"title": "Expressive Facial Animation Synthesis by Learning Speech Coarticulation and Expression Spaces",
"doi": null,
"abstractUrl": "/journal/tg/2006/06/v1523/13rRUxASubv",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/03/v0341",
"title": "Creating Speech-Synchronized Animation",
"doi": null,
"abstractUrl": "/journal/tg/2005/03/v0341/13rRUxE04tq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600u0374",
"title": "Speech Driven Tongue Animation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600u0374/1H1lUSkaTeg",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2011050066",
"articleId": "13rRUyg2jNq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2011050090",
"articleId": "13rRUyXKxU8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesRn",
"name": "mcg2011050080s.flv",
"location": "https://www.computer.org/csdl/api/v1/extra/mcg2011050080s.flv",
"extension": "flv",
"size": "2.88 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxwENDV",
"title": "July-Aug.",
"year": "2013",
"issueNum": "04",
"idPrefix": "it",
"pubType": "magazine",
"volume": "15",
"label": "July-Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUzp02kG",
"doi": "10.1109/MITP.2013.58",
"abstract": "The research team developed a novel method for authenticating computer user identity by deploying covert games disguised as Windows alerts. The method applies game theory principles, allowing users to develop unique strategies for playing the imperceptible games. By examining users' subconscious game playing strategies, the team captured discriminatory information without sophisticated analysis. Results indicated none of the participants detected the game, although many reported strategizing when they chose how they would respond to the game interruptions. Ten attributes characterizing all participants were identified and compared in a similarity matrix and then reduced through MDS techniques. An optimal subspace of the variables was identified and used to construct a ROC curve. The hit rate exceeded 80 percent. The false alarm rate was higher than desired; however, evidence indicates this can be reduced through further research. This article is part of a special issue on security.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The research team developed a novel method for authenticating computer user identity by deploying covert games disguised as Windows alerts. The method applies game theory principles, allowing users to develop unique strategies for playing the imperceptible games. By examining users' subconscious game playing strategies, the team captured discriminatory information without sophisticated analysis. Results indicated none of the participants detected the game, although many reported strategizing when they chose how they would respond to the game interruptions. Ten attributes characterizing all participants were identified and compared in a similarity matrix and then reduced through MDS techniques. An optimal subspace of the variables was identified and used to construct a ROC curve. The hit rate exceeded 80 percent. The false alarm rate was higher than desired; however, evidence indicates this can be reduced through further research. This article is part of a special issue on security.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The research team developed a novel method for authenticating computer user identity by deploying covert games disguised as Windows alerts. The method applies game theory principles, allowing users to develop unique strategies for playing the imperceptible games. By examining users' subconscious game playing strategies, the team captured discriminatory information without sophisticated analysis. Results indicated none of the participants detected the game, although many reported strategizing when they chose how they would respond to the game interruptions. Ten attributes characterizing all participants were identified and compared in a similarity matrix and then reduced through MDS techniques. An optimal subspace of the variables was identified and used to construct a ROC curve. The hit rate exceeded 80 percent. The false alarm rate was higher than desired; however, evidence indicates this can be reduced through further research. This article is part of a special issue on security.",
"title": "Covert Cognitive Games and User Response Patterns",
"normalizedTitle": "Covert Cognitive Games and User Response Patterns",
"fno": "mit2013040016",
"hasPdf": true,
"idPrefix": "it",
"keywords": [
"Games",
"Identity Management",
"Authentication",
"Game Theory",
"Productivity",
"Data Models",
"Fingerprint Recognition",
"Information Technology",
"Cognitive Games",
"Active Authentication",
"Security"
],
"authors": [
{
"givenName": "Jenifer",
"surname": "Wheeler",
"fullName": "Jenifer Wheeler",
"affiliation": "Southwest Research Institute",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Denise",
"surname": "Varner",
"fullName": "Denise Varner",
"affiliation": "Southwest Research Institute",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Carrola",
"fullName": "John Carrola",
"affiliation": "Southwest Research Institute",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christopher",
"surname": "Dahlberg",
"fullName": "Christopher Dahlberg",
"affiliation": "Southwest Research Institute",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Thornton",
"fullName": "Thomas Thornton",
"affiliation": "Sentier Strategic Resources",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Corey",
"surname": "Bohil",
"fullName": "Corey Bohil",
"affiliation": "Sentier Strategic Resources",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kelly",
"surname": "Terry",
"fullName": "Kelly Terry",
"affiliation": "Sentier Strategic Resources",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2013-07-01 00:00:00",
"pubType": "mags",
"pages": "16-19",
"year": "2013",
"issn": "1520-9202",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/digitel/2010/3993/0/3993a191",
"title": "Managing the Development of Digital Educational Games",
"doi": null,
"abstractUrl": "/proceedings-article/digitel/2010/3993a191/12OmNqFJhHV",
"parentPublication": {
"id": "proceedings/digitel/2010/3993/0",
"title": "Digital Game and Intelligent Toy Enhanced Learning, IEEE International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgames/2011/1451/0/06000328",
"title": "Sensing game play. Exploring computer game play in a game café and a mass LAN party",
"doi": null,
"abstractUrl": "/proceedings-article/cgames/2011/06000328/12OmNqGiu6J",
"parentPublication": {
"id": "proceedings/cgames/2011/1451/0",
"title": "2011 16th International Conference on Computer Games (CGAMES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/passat-socialcom/2011/1931/0/06113100",
"title": "The Life Game: Cognitive Strategies for Repeated Stochastic Games",
"doi": null,
"abstractUrl": "/proceedings-article/passat-socialcom/2011/06113100/12OmNqIhFPp",
"parentPublication": {
"id": "proceedings/passat-socialcom/2011/1931/0",
"title": "2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust (PASSAT) / 2011 IEEE Third Int'l Conference on Social Computing (SocialCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/digitel/2012/4663/0/4663a057",
"title": "Applying a Grammatical Structure to Practice Game Design on Non-Computer Games",
"doi": null,
"abstractUrl": "/proceedings-article/digitel/2012/4663a057/12OmNx6Pizm",
"parentPublication": {
"id": "proceedings/digitel/2012/4663/0",
"title": "Digital Game and Intelligent Toy Enhanced Learning, IEEE International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgames/2011/1451/0/06000361",
"title": "A study of how different game play aspects can affect the popularity of role-playing video games",
"doi": null,
"abstractUrl": "/proceedings-article/cgames/2011/06000361/12OmNxFsmm2",
"parentPublication": {
"id": "proceedings/cgames/2011/1451/0",
"title": "2011 16th International Conference on Computer Games (CGAMES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/achi/2008/3086/0/3086a124",
"title": "Enhancing E-Learning Engagement Using Design Patterns from Computer Games",
"doi": null,
"abstractUrl": "/proceedings-article/achi/2008/3086a124/12OmNzFdt44",
"parentPublication": {
"id": "proceedings/achi/2008/3086/0",
"title": "International Conference on Advances in Computer-Human Interaction",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cec/2012/4857/0/4857a107",
"title": "Equilibrium Selection under Limited Control - An Experiment on Network Hawk Dove Games",
"doi": null,
"abstractUrl": "/proceedings-article/cec/2012/4857a107/12OmNznkJXj",
"parentPublication": {
"id": "proceedings/cec/2012/4857/0",
"title": "2012 IEEE 14th International Conference on Commerce and Enterprise Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2017/02/07387711",
"title": "Computational Modeling of Players’ Emotional Response Patterns to the Story Events of Video Games",
"doi": null,
"abstractUrl": "/journal/ta/2017/02/07387711/13rRUwgQppb",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111956",
"title": "Toward Visualization for Games: Theory, Design Space, and Patterns",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111956/13rRUxBJhFu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cds/2021/0428/0/042800a372",
"title": "Analyzing User Behavior Patterns in Casual Games Using Time Series Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/cds/2021/042800a372/1uZxzLaFpIY",
"parentPublication": {
"id": "proceedings/cds/2021/0428/0",
"title": "2021 2nd International Conference on Computing and Data Science (CDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mit2013040012",
"articleId": "13rRUytF45X",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mit2013040020",
"articleId": "13rRUxNEqM4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzXFovR",
"title": "November",
"year": "2011",
"issueNum": "11",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "November",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuMA",
"doi": "10.1109/TVCG.2010.272",
"abstract": "Estimating 3D pose similarity is a fundamental problem on 3D motion data. Most previous work calculates L2-like distance of joint orientations or coordinates, which does not sufficiently reflect the pose similarity of human perception. In this paper, we present a new pose distance metric. First, we propose a new rich pose feature set called Geometric Pose Descriptor (GPD). GPD is more effective in encoding pose similarity by utilizing features on geometric relations among body parts, as well as temporal information such as velocities and accelerations. Based on GPD, we propose a semisupervised distance metric learning algorithm called Regularized Distance Metric Learning with Sparse Representation (RDSR), which integrates information from both unsupervised data relationship and labels. We apply the proposed pose distance metric to applications of motion transition decision and content-based pose retrieval. Quantitative evaluations demonstrate that our method achieves better results with only a small amount of human labels, showing that the proposed pose distance metric is a promising building block for various 3D-motion related applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Estimating 3D pose similarity is a fundamental problem on 3D motion data. Most previous work calculates L2-like distance of joint orientations or coordinates, which does not sufficiently reflect the pose similarity of human perception. In this paper, we present a new pose distance metric. First, we propose a new rich pose feature set called Geometric Pose Descriptor (GPD). GPD is more effective in encoding pose similarity by utilizing features on geometric relations among body parts, as well as temporal information such as velocities and accelerations. Based on GPD, we propose a semisupervised distance metric learning algorithm called Regularized Distance Metric Learning with Sparse Representation (RDSR), which integrates information from both unsupervised data relationship and labels. We apply the proposed pose distance metric to applications of motion transition decision and content-based pose retrieval. Quantitative evaluations demonstrate that our method achieves better results with only a small amount of human labels, showing that the proposed pose distance metric is a promising building block for various 3D-motion related applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Estimating 3D pose similarity is a fundamental problem on 3D motion data. Most previous work calculates L2-like distance of joint orientations or coordinates, which does not sufficiently reflect the pose similarity of human perception. In this paper, we present a new pose distance metric. First, we propose a new rich pose feature set called Geometric Pose Descriptor (GPD). GPD is more effective in encoding pose similarity by utilizing features on geometric relations among body parts, as well as temporal information such as velocities and accelerations. Based on GPD, we propose a semisupervised distance metric learning algorithm called Regularized Distance Metric Learning with Sparse Representation (RDSR), which integrates information from both unsupervised data relationship and labels. We apply the proposed pose distance metric to applications of motion transition decision and content-based pose retrieval. Quantitative evaluations demonstrate that our method achieves better results with only a small amount of human labels, showing that the proposed pose distance metric is a promising building block for various 3D-motion related applications.",
"title": "Learning a 3D Human Pose Distance Metric from Geometric Pose Descriptor",
"normalizedTitle": "Learning a 3D Human Pose Distance Metric from Geometric Pose Descriptor",
"fno": "ttg2011111676",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Human Motion",
"Character Animation",
"Pose Features",
"Distance Metric",
"Semisupervised Learning"
],
"authors": [
{
"givenName": "Cheng",
"surname": "Chen",
"fullName": "Cheng Chen",
"affiliation": "Idiap Research Institute, Martigny",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yueting",
"surname": "Zhuang",
"fullName": "Yueting Zhuang",
"affiliation": "Zhejiang University, Hangzhou",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Feiping",
"surname": "Nie",
"fullName": "Feiping Nie",
"affiliation": "University of Texas at Arlington, Arlington",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yi",
"surname": "Yang",
"fullName": "Yi Yang",
"affiliation": "ITEE, The University of Queensland, Brisbane",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fei",
"surname": "Wu",
"fullName": "Fei Wu",
"affiliation": "Zhejiang University, Hangzhou",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jun",
"surname": "Xiao",
"fullName": "Jun Xiao",
"affiliation": "Zhejiang University, Hangzhou",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2011-11-01 00:00:00",
"pubType": "trans",
"pages": "1676-1689",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2010/4109/0/4109d352",
"title": "Semi-supervised Distance Metric Learning by Quadratic Programming",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109d352/12OmNyVes7R",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wcre/1999/0303/0/03030187",
"title": "MoJo: A Distance Metric for Software Clusterings",
"doi": null,
"abstractUrl": "/proceedings-article/wcre/1999/03030187/12OmNyoAAa6",
"parentPublication": {
"id": "proceedings/wcre/1999/0303/0",
"title": "Sixth Working Conference on Reverse Engineering (Cat. No.PR00303)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2000/0506/0/05060195",
"title": "Distance Exponent: A New Concept for Selectivity Estimation in Metric Trees",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2000/05060195/12OmNzT7OsN",
"parentPublication": {
"id": "proceedings/icde/2000/0506/0",
"title": "Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/1/3336a899",
"title": "Pose Parameter Estimation and Shape Distance",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336a899/12OmNzVoBKZ",
"parentPublication": {
"id": "proceedings/csse/2008/3336/1",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2016/5473/0/07837942",
"title": "Regularized Large Margin Distance Metric Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2016/07837942/12OmNzl3X0u",
"parentPublication": {
"id": "proceedings/icdm/2016/5473/0",
"title": "2016 IEEE 16th International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2007/06/i1091",
"title": "A Normalized Levenshtein Distance Metric",
"doi": null,
"abstractUrl": "/journal/tp/2007/06/i1091/13rRUwhHcRT",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2012/05/ttk2012050868",
"title": "D-Cache: Universal Distance Cache for Metric Access Methods",
"doi": null,
"abstractUrl": "/journal/tk/2012/05/ttk2012050868/13rRUxCityB",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2010/01/ttp2010010030",
"title": "A Boosting Framework for Visuality-Preserving Distance Metric Learning and Its Application to Medical Image Retrieval",
"doi": null,
"abstractUrl": "/journal/tp/2010/01/ttp2010010030/13rRUytF42x",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/02/09749007",
"title": "From Human Pose Similarity Metric to 3D Human Pose Estimator: Temporal Propagating LSTM Networks",
"doi": null,
"abstractUrl": "/journal/tp/2023/02/09749007/1Ciz7ePgNkQ",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600g708",
"title": "ES6D: A Computation Efficient and Symmetry-Aware 6D Pose Regression Framework",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600g708/1H0NoMDrdQs",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011111663",
"articleId": "13rRUy0qnGi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011111690",
"articleId": "13rRUyfKIHG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesWu",
"name": "ttg2011111676s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2011111676s1.zip",
"extension": "zip",
"size": "52.2 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1Fz3ebZZCbS",
"title": "Sept.",
"year": "2022",
"issueNum": "09",
"idPrefix": "tp",
"pubType": "journal",
"volume": "44",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1u3mCrL3XgY",
"doi": "10.1109/TPAMI.2021.3085134",
"abstract": "Taking selfies has become one of the major photographic trends of our time. In this study, we focus on the selfie stick, on which a camera is mounted to take selfies. We observe that a camera on a selfie stick typically travels through a particular type of trajectory around a sphere. Based on this finding, we propose a robust, efficient, and optimal estimation method for relative camera pose between two images captured by a camera mounted on a selfie stick. We exploit the special geometric structure of camera motion constrained by a selfie stick and define this motion as <italic>spherical joint motion</italic>. Utilizing a novel parametrization and calibration scheme, we demonstrate that the pose estimation problem can be reduced to a 3-degrees of freedom (DoF) search problem, instead of a generic 6-DoF problem. This facilitates the derivation of an efficient branch-and-bound optimization method that guarantees a global optimal solution, even in the presence of outliers. Furthermore, as a simplified case of spherical joint motion, we introduce <italic>selfie motion</italic>, which has a fewer number of DoF than spherical joint motion. We validate the performance and guaranteed optimality of our method on both synthetic and real-world data. Additionally, we demonstrate the applicability of the proposed method for two applications: refocusing and stylization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Taking selfies has become one of the major photographic trends of our time. In this study, we focus on the selfie stick, on which a camera is mounted to take selfies. We observe that a camera on a selfie stick typically travels through a particular type of trajectory around a sphere. Based on this finding, we propose a robust, efficient, and optimal estimation method for relative camera pose between two images captured by a camera mounted on a selfie stick. We exploit the special geometric structure of camera motion constrained by a selfie stick and define this motion as <italic>spherical joint motion</italic>. Utilizing a novel parametrization and calibration scheme, we demonstrate that the pose estimation problem can be reduced to a 3-degrees of freedom (DoF) search problem, instead of a generic 6-DoF problem. This facilitates the derivation of an efficient branch-and-bound optimization method that guarantees a global optimal solution, even in the presence of outliers. Furthermore, as a simplified case of spherical joint motion, we introduce <italic>selfie motion</italic>, which has a fewer number of DoF than spherical joint motion. We validate the performance and guaranteed optimality of our method on both synthetic and real-world data. Additionally, we demonstrate the applicability of the proposed method for two applications: refocusing and stylization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Taking selfies has become one of the major photographic trends of our time. In this study, we focus on the selfie stick, on which a camera is mounted to take selfies. We observe that a camera on a selfie stick typically travels through a particular type of trajectory around a sphere. Based on this finding, we propose a robust, efficient, and optimal estimation method for relative camera pose between two images captured by a camera mounted on a selfie stick. We exploit the special geometric structure of camera motion constrained by a selfie stick and define this motion as spherical joint motion. Utilizing a novel parametrization and calibration scheme, we demonstrate that the pose estimation problem can be reduced to a 3-degrees of freedom (DoF) search problem, instead of a generic 6-DoF problem. This facilitates the derivation of an efficient branch-and-bound optimization method that guarantees a global optimal solution, even in the presence of outliers. Furthermore, as a simplified case of spherical joint motion, we introduce selfie motion, which has a fewer number of DoF than spherical joint motion. We validate the performance and guaranteed optimality of our method on both synthetic and real-world data. Additionally, we demonstrate the applicability of the proposed method for two applications: refocusing and stylization.",
"title": "Robust and Efficient Estimation of Relative Pose for Cameras on Selfie Sticks",
"normalizedTitle": "Robust and Efficient Estimation of Relative Pose for Cameras on Selfie Sticks",
"fno": "09444575",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Calibration",
"Cameras",
"Optimisation",
"Pose Estimation",
"Position Control",
"Search Problems",
"Optimal Estimation Method",
"Relative Camera",
"Selfie Stick",
"Camera Motion",
"Spherical Joint Motion",
"Efficient Branch",
"Bound Optimization Method",
"Selfie Motion",
"Taking Selfies",
"Robust Estimation Method",
"Efficient Estimation Method",
"Cameras",
"Calibration",
"Pose Estimation",
"Geometry",
"Position Measurement",
"Motion Measurement",
"Wrist",
"Selfie",
"Selfie Stick",
"Relative Pose Estimation",
"Branch And Bound",
"Global Optimization"
],
"authors": [
{
"givenName": "Kyungdon",
"surname": "Joo",
"fullName": "Kyungdon Joo",
"affiliation": "Department of Computer Science, Artificial Intelligence Graduate School, UNIST, Ulsan, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongdong",
"surname": "Li",
"fullName": "Hongdong Li",
"affiliation": "Computer Vision and Robotics Group, ANU, Canberra, ACT, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tae-Hyun",
"surname": "Oh",
"fullName": "Tae-Hyun Oh",
"affiliation": "Department of Electrical Engineering and Graduate School of AI (GSAI), POSTECH, Pohang, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "In So",
"surname": "Kweon",
"fullName": "In So Kweon",
"affiliation": "School of Electrical Engineering, KAIST, Daejeon, South Korea",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2022-09-01 00:00:00",
"pubType": "trans",
"pages": "5460-5471",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2012/4711/0/4711a314",
"title": "Stable Pose Estimation with a Motion Model in Real-Time Application",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2012/4711a314/12OmNviHKgm",
"parentPublication": {
"id": "proceedings/icme/2012/4711/0",
"title": "2012 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2012/4814/0/4814a256",
"title": "Fusing Real-Time Depth Imaging with High Precision Pose Estimation by a Measurement Arm",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2012/4814a256/12OmNzUPpj8",
"parentPublication": {
"id": "proceedings/cw/2012/4814/0",
"title": "2012 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2000/0750/1/07501384",
"title": "Fuzzy Relative Positions for Qualitative Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2000/07501384/12OmNzV70qb",
"parentPublication": {
"id": "proceedings/icpr/2000/0750/1",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2008/2840/0/04637318",
"title": "Relative pose calibration of a spherical camera and an IMU",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2008/04637318/12OmNzYwbUg",
"parentPublication": {
"id": "proceedings/ismar/2008/2840/0",
"title": "2008 7th IEEE/ACM International Symposium on Mixed and Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2018/6100/0/610000b856",
"title": "Human Pose as Calibration Pattern: 3D Human Pose Estimation with Multiple Unsynchronized and Uncalibrated Cameras",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2018/610000b856/17D45XzbnKx",
"parentPublication": {
"id": "proceedings/cvprw/2018/6100/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/06/09969132",
"title": "Trifocal Relative Pose From Lines at Points",
"doi": null,
"abstractUrl": "/journal/tp/2023/06/09969132/1IMi2ehaHEA",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2019/0990/0/08909859",
"title": "Constraining Relative Camera Pose Estimation with Pedestrian Detector-Based Correspondence Filters",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2019/08909859/1febLNO1bQ4",
"parentPublication": {
"id": "proceedings/avss/2019/0990/0",
"title": "2019 16th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300c671",
"title": "Polarimetric Relative Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300c671/1hVlHKCFUTS",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/01/09127821",
"title": "Homography-Based Minimal-Case Relative Pose Estimation With Known Gravity Direction",
"doi": null,
"abstractUrl": "/journal/tp/2022/01/09127821/1l3uhnxjxaU",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900a394",
"title": "Globally Optimal Relative Pose Estimation with Gravity Prior",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900a394/1yeM3oi7wo8",
"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": "09439151",
"articleId": "1tMLuXqDrr2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09400752",
"articleId": "1sK2fUf92zm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Fz4FaAXNII",
"name": "ttp202209-09444575s1-supp2-3085134.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp202209-09444575s1-supp2-3085134.mp4",
"extension": "mp4",
"size": "27.1 MB",
"__typename": "WebExtraType"
},
{
"id": "1Fz4FjpFeeY",
"name": "ttp202209-09444575s1-supp1-3085134.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp202209-09444575s1-supp1-3085134.pdf",
"extension": "pdf",
"size": "275 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNz6iOyl",
"title": "September/October",
"year": "2007",
"issueNum": "05",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "27",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxZRbrN",
"doi": "10.1109/MCG.2007.131",
"abstract": "GeoTime and nSpace are innovative visual analytic tools that enable investigation and understanding of complex, ambiguous situations. nSpace is a system of systems supporting the whole analytic workflow. GeoTime provides insight into events and behaviors in time and space. Junior analysts used the analytic capabilities these tools supported to investigate the 2006 VAST contest data set and produce an intelligence assessment report. This article describes how these tools created an analytical environment that enabled two novice analysts to examine the scenario, discover patterns, trace connections, assess evidence, visually represent meaningful hypotheses with associated evidence, track progress, collaborate with others, and produce a final report.",
"abstracts": [
{
"abstractType": "Regular",
"content": "GeoTime and nSpace are innovative visual analytic tools that enable investigation and understanding of complex, ambiguous situations. nSpace is a system of systems supporting the whole analytic workflow. GeoTime provides insight into events and behaviors in time and space. Junior analysts used the analytic capabilities these tools supported to investigate the 2006 VAST contest data set and produce an intelligence assessment report. This article describes how these tools created an analytical environment that enabled two novice analysts to examine the scenario, discover patterns, trace connections, assess evidence, visually represent meaningful hypotheses with associated evidence, track progress, collaborate with others, and produce a final report.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "GeoTime and nSpace are innovative visual analytic tools that enable investigation and understanding of complex, ambiguous situations. nSpace is a system of systems supporting the whole analytic workflow. GeoTime provides insight into events and behaviors in time and space. Junior analysts used the analytic capabilities these tools supported to investigate the 2006 VAST contest data set and produce an intelligence assessment report. This article describes how these tools created an analytical environment that enabled two novice analysts to examine the scenario, discover patterns, trace connections, assess evidence, visually represent meaningful hypotheses with associated evidence, track progress, collaborate with others, and produce a final report.",
"title": "nSpace and GeoTime: A VAST 2006 Case Study",
"normalizedTitle": "nSpace and GeoTime: A VAST 2006 Case Study",
"fno": "mcg2007050046",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Visual Analytics",
"Human Information Interaction",
"Sense Making",
"Geospatial Information Systems",
"Temporal Analysis"
],
"authors": [
{
"givenName": "Pascale",
"surname": "Proulx",
"fullName": "Pascale Proulx",
"affiliation": "Oculus Info",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lynn",
"surname": "Chien",
"fullName": "Lynn Chien",
"affiliation": "Oculus Info",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert",
"surname": "Harper",
"fullName": "Robert Harper",
"affiliation": "Oculus Info",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Schroh",
"fullName": "David Schroh",
"affiliation": "Oculus Info",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Kapler",
"fullName": "Thomas Kapler",
"affiliation": "Oculus Info",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Jonker",
"fullName": "David Jonker",
"affiliation": "Oculus Info",
"__typename": "ArticleAuthorType"
},
{
"givenName": "William",
"surname": "Wright",
"fullName": "William Wright",
"affiliation": "Oculus Info",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2007-09-01 00:00:00",
"pubType": "mags",
"pages": "46-56",
"year": "2007",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vast/2012/4752/0/06400525",
"title": "Visual analytics for situation awareness of a large-scale network: VAST 2012 Mini Challenge #1 award: “Effective video presentation”",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2012/06400525/12OmNB6UI9w",
"parentPublication": {
"id": "proceedings/vast/2012/4752/0",
"title": "2012 IEEE Conference on Visual Analytics Science and Technology (VAST 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2007/1659/0/04389018",
"title": "Something's \"Fishy\" at Global Ways and Gill Breeders - Analysis with nSpace and GeoTime",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2007/04389018/12OmNB9t6p7",
"parentPublication": {
"id": "proceedings/vast/2007/1659/0",
"title": "2007 IEEE Symposium on Visual Analytics Science and Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2007/1659/0/04389033",
"title": "VAST 2007 Contest - Analysis with nSpace and GeoTime",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2007/04389033/12OmNC4O4BR",
"parentPublication": {
"id": "proceedings/vast/2007/1659/0",
"title": "2007 IEEE Symposium on Visual Analytics Science and Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2006/0591/0/04035768",
"title": "VAST 2006 Contest ? A Tale of Alderwood",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2006/04035768/12OmNrMZpG6",
"parentPublication": {
"id": "proceedings/vast/2006/0591/0",
"title": "2006 IEEE Symposium On Visual Analytics Science And Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2012/4752/0/06400529",
"title": "VAST Challenge 2012: Visual analytics for big data",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2012/06400529/12OmNwlqhST",
"parentPublication": {
"id": "proceedings/vast/2012/4752/0",
"title": "2012 IEEE Conference on Visual Analytics Science and Technology (VAST 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2006/0591/0/04035744",
"title": "Avian Flu Case Study with nSpace and GeoTime",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2006/04035744/12OmNxGj9Ow",
"parentPublication": {
"id": "proceedings/vast/2006/0591/0",
"title": "2006 IEEE Symposium On Visual Analytics Science And Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2004/8779/0/87790025",
"title": "GeoTime Information Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2004/87790025/12OmNzdoMW9",
"parentPublication": {
"id": "proceedings/ieee-infovis/2004/8779/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2006/03/mcg2006030080",
"title": "Isn't It About Time?",
"doi": null,
"abstractUrl": "/magazine/cg/2006/03/mcg2006030080/13rRUEgarve",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/04/ttg2011040440",
"title": "Forecasting Hotspots—A Predictive Analytics Approach",
"doi": null,
"abstractUrl": "/journal/tg/2011/04/ttg2011040440/13rRUwdrdSv",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2014/05/mcg2014050042",
"title": "From Data to Insight: Work Practices of Analysts in the Enterprise",
"doi": null,
"abstractUrl": "/magazine/cg/2014/05/mcg2014050042/13rRUyXKxU9",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2007050035",
"articleId": "13rRUwbs233",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2007050092",
"articleId": "13rRUNvya3r",
"__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": "1GZombIreEg",
"doi": "10.1109/TVCG.2022.3209498",
"abstract": "Volume data is found in many important scientific and engineering applications. Rendering this data for visualization at high quality and interactive rates for demanding applications such as virtual reality is still not easily achievable even using professional-grade hardware. We introduce FoVolNet—a method to significantly increase the performance of volume data visualization. We develop a cost-effective foveated rendering pipeline that sparsely samples a volume around a focal point and reconstructs the full-frame using a deep neural network. Foveated rendering is a technique that prioritizes rendering computations around the user's focal point. This approach leverages properties of the human visual system, thereby saving computational resources when rendering data in the periphery of the user's field of vision. Our reconstruction network combines direct and kernel prediction methods to produce fast, stable, and perceptually convincing output. With a slim design and the use of quantization, our method outperforms state-of-the-art neural reconstruction techniques in both end-to-end frame times and visual quality. We conduct extensive evaluations of the system's rendering performance, inference speed, and perceptual properties, and we provide comparisons to competing neural image reconstruction techniques. Our test results show that FoVolNet consistently achieves significant time saving over conventional rendering while preserving perceptual quality.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Volume data is found in many important scientific and engineering applications. Rendering this data for visualization at high quality and interactive rates for demanding applications such as virtual reality is still not easily achievable even using professional-grade hardware. We introduce FoVolNet—a method to significantly increase the performance of volume data visualization. We develop a cost-effective foveated rendering pipeline that sparsely samples a volume around a focal point and reconstructs the full-frame using a deep neural network. Foveated rendering is a technique that prioritizes rendering computations around the user's focal point. This approach leverages properties of the human visual system, thereby saving computational resources when rendering data in the periphery of the user's field of vision. Our reconstruction network combines direct and kernel prediction methods to produce fast, stable, and perceptually convincing output. With a slim design and the use of quantization, our method outperforms state-of-the-art neural reconstruction techniques in both end-to-end frame times and visual quality. We conduct extensive evaluations of the system's rendering performance, inference speed, and perceptual properties, and we provide comparisons to competing neural image reconstruction techniques. Our test results show that FoVolNet consistently achieves significant time saving over conventional rendering while preserving perceptual quality.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Volume data is found in many important scientific and engineering applications. Rendering this data for visualization at high quality and interactive rates for demanding applications such as virtual reality is still not easily achievable even using professional-grade hardware. We introduce FoVolNet—a method to significantly increase the performance of volume data visualization. We develop a cost-effective foveated rendering pipeline that sparsely samples a volume around a focal point and reconstructs the full-frame using a deep neural network. Foveated rendering is a technique that prioritizes rendering computations around the user's focal point. This approach leverages properties of the human visual system, thereby saving computational resources when rendering data in the periphery of the user's field of vision. Our reconstruction network combines direct and kernel prediction methods to produce fast, stable, and perceptually convincing output. With a slim design and the use of quantization, our method outperforms state-of-the-art neural reconstruction techniques in both end-to-end frame times and visual quality. We conduct extensive evaluations of the system's rendering performance, inference speed, and perceptual properties, and we provide comparisons to competing neural image reconstruction techniques. Our test results show that FoVolNet consistently achieves significant time saving over conventional rendering while preserving perceptual quality.",
"title": "FoVolNet: Fast Volume Rendering using Foveated Deep Neural Networks",
"normalizedTitle": "FoVolNet: Fast Volume Rendering using Foveated Deep Neural Networks",
"fno": "09903564",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Image Reconstruction",
"Neural Nets",
"Rendering Computer Graphics",
"Virtual Reality",
"Competing Neural Image Reconstruction Techniques",
"Computational Resources",
"Conventional Rendering",
"Cost Effective Foveated Rendering Pipeline",
"Deep Neural Network",
"End To End Frame Times",
"Fast Output",
"Fast Volume",
"Focal Point",
"Foveated Deep Neural Networks",
"Fo Vol Net A",
"Human Visual System",
"Important Scientific Engineering Applications",
"Interactive Rates",
"Kernel Prediction Methods",
"Perceptual Properties",
"Perceptual Quality",
"Perceptually Convincing Output",
"Professional Grade Hardware",
"Reconstruction Network",
"Sparsely Samples",
"Stable Output",
"State Of The Art Neural Reconstruction Techniques",
"User",
"Virtual Reality",
"Visual Quality",
"Volume Data Visualization",
"Rendering Computer Graphics",
"Image Reconstruction",
"Visualization",
"Data Visualization",
"Kernel",
"Image Quality",
"Deep Learning",
"Volume Data",
"Volume Visualization",
"Deep Learning",
"Foveated Rendering",
"Neural Reconstruction"
],
"authors": [
{
"givenName": "David",
"surname": "Bauer",
"fullName": "David Bauer",
"affiliation": "University of California at Davis, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qi",
"surname": "Wu",
"fullName": "Qi Wu",
"affiliation": "University of California at Davis, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kwan-Liu",
"surname": "Ma",
"fullName": "Kwan-Liu Ma",
"affiliation": "University of California at Davis, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "515-525",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visual/1993/3940/0/00398845",
"title": "Fast volume rendering of compressed data",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1993/00398845/12OmNqNXEny",
"parentPublication": {
"id": "proceedings/visual/1993/3940/0",
"title": "Proceedings Visualization '93",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/01250406",
"title": "Monte Carlo volume rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/01250406/12OmNzh5z86",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2022/9617/0/961700a756",
"title": "Rectangular Mapping-based Foveated Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2022/961700a756/1CJcj9wHjH2",
"parentPublication": {
"id": "proceedings/vr/2022/9617/0",
"title": "2022 IEEE on Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2023/4815/0/481500a471",
"title": "Locomotion-aware Foveated Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2023/481500a471/1MNgzzb0RWg",
"parentPublication": {
"id": "proceedings/vr/2023/4815/0",
"title": "2023 IEEE Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/08918030",
"title": "Volumetric Isosurface Rendering with Deep Learning-Based Super-Resolution",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/08918030/1fm1QUuzRAI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/08/09007492",
"title": "3D-Kernel Foveated Rendering for Light Fields",
"doi": null,
"abstractUrl": "/journal/tg/2021/08/09007492/1hJKlSvNgo8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/05/09005240",
"title": "Eye-dominance-guided Foveated Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2020/05/09005240/1hzNcOce8OQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2020/8508/0/850800a001",
"title": "Foveated Instant Radiosity",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2020/850800a001/1pysxhw4Bqw",
"parentPublication": {
"id": "proceedings/ismar/2020/8508/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/11/09523836",
"title": "Foveated Photon Mapping",
"doi": null,
"abstractUrl": "/journal/tg/2021/11/09523836/1wpquR1qr1S",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552224",
"title": "Differentiable Direct Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552224/1xibZvRmYzm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09903288",
"articleId": "1GZoks2MXAY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09903677",
"articleId": "1GZoj8mhSPS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1JevFaph2Pm",
"name": "ttg202301-09903564s1-tvcg-3209498-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09903564s1-tvcg-3209498-mm.zip",
"extension": "zip",
"size": "103 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1HcjwsmMpfq",
"title": "Sept.-Oct.",
"year": "2022",
"issueNum": "05",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "42",
"label": "Sept.-Oct.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1DFdj888zVC",
"doi": "10.1109/MCG.2022.3177890",
"abstract": "We present a GPU-accelerated collision detection method for the navigation of vehicles in enclosed spaces represented using large point clouds. Our approach takes a CAD model of a vehicle, converts it to a volumetric representation or voxels, and computes the collision of the voxels with a point cloud representing the environment to identify a suitable path for navigation. We perform adaptive and efficient collision of voxels with the point cloud without the need for mesh generation. We have developed a GPU-accelerated voxel Minkowski sum algorithm to perform a clearance analysis of the vehicle. Finally, we provide theoretical bounds for the accuracy of the collision and clearance analysis. Our GPU implementation is linked with Unreal Engine to provide flexibility in performing the analysis.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a GPU-accelerated collision detection method for the navigation of vehicles in enclosed spaces represented using large point clouds. Our approach takes a CAD model of a vehicle, converts it to a volumetric representation or voxels, and computes the collision of the voxels with a point cloud representing the environment to identify a suitable path for navigation. We perform adaptive and efficient collision of voxels with the point cloud without the need for mesh generation. We have developed a GPU-accelerated voxel Minkowski sum algorithm to perform a clearance analysis of the vehicle. Finally, we provide theoretical bounds for the accuracy of the collision and clearance analysis. Our GPU implementation is linked with Unreal Engine to provide flexibility in performing the analysis.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a GPU-accelerated collision detection method for the navigation of vehicles in enclosed spaces represented using large point clouds. Our approach takes a CAD model of a vehicle, converts it to a volumetric representation or voxels, and computes the collision of the voxels with a point cloud representing the environment to identify a suitable path for navigation. We perform adaptive and efficient collision of voxels with the point cloud without the need for mesh generation. We have developed a GPU-accelerated voxel Minkowski sum algorithm to perform a clearance analysis of the vehicle. Finally, we provide theoretical bounds for the accuracy of the collision and clearance analysis. Our GPU implementation is linked with Unreal Engine to provide flexibility in performing the analysis.",
"title": "GPU-Accelerated Collision Analysis of Vehicles in a Point Cloud Environment",
"normalizedTitle": "GPU-Accelerated Collision Analysis of Vehicles in a Point Cloud Environment",
"fno": "09782096",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"CAD",
"Computational Geometry",
"Computer Graphic Equipment",
"Computer Graphics",
"Graphics Processing Units",
"Mesh Generation",
"Solid Modelling",
"Adaptive Collision",
"Efficient Collision",
"GPU Accelerated Voxel Minkowski Sum",
"Clearance Analysis",
"GPU Implementation",
"GPU Accelerated Collision Analysis",
"Point Cloud Environment",
"GPU Accelerated Collision Detection Method",
"Navigation",
"Point Cloud Compression",
"Solid Modeling",
"Computational Modeling",
"Collision Avoidance",
"Data Models",
"Navigation",
"Graphics Processing Units",
"Vehicle Routing",
"Vehicle Crash Testing",
"Voxelization",
"Point Cloud",
"Collision Detection",
"Navigation",
"Clearance Analysis",
"Minkowski Sums"
],
"authors": [
{
"givenName": "Harshil",
"surname": "Shah",
"fullName": "Harshil Shah",
"affiliation": "Iowa State University, Ames, IA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sambit",
"surname": "Ghadai",
"fullName": "Sambit Ghadai",
"affiliation": "Iowa State University, Ames, IA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dhruv",
"surname": "Gamdha",
"fullName": "Dhruv Gamdha",
"affiliation": "Iowa State University, Ames, IA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alex",
"surname": "Schuster",
"fullName": "Alex Schuster",
"affiliation": "Design Mill Inc., Dubuque, IA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ivan",
"surname": "Thomas",
"fullName": "Ivan Thomas",
"affiliation": "Tekla Research, Fredericksburg, VA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nathan",
"surname": "Greiner",
"fullName": "Nathan Greiner",
"affiliation": "Design Mill Inc., Dubuque, IA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Adarsh",
"surname": "Krishnamurthy",
"fullName": "Adarsh Krishnamurthy",
"affiliation": "Iowa State University, Ames, IA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2022-09-01 00:00:00",
"pubType": "mags",
"pages": "37-50",
"year": "2022",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iscid/2011/4500/1/4500a270",
"title": "A ZigBee-Based Highway Vehicles Prevent Collision Warning System Research",
"doi": null,
"abstractUrl": "/proceedings-article/iscid/2011/4500a270/12OmNAhxjBT",
"parentPublication": {
"id": "proceedings/iscid/2011/4500/1",
"title": "Computational Intelligence and Design, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2009/3836/2/3836b254",
"title": "GPU Acceleration of High-Speed Collision Molecular Dynamics Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2009/3836b254/12OmNBSBk4o",
"parentPublication": {
"id": "proceedings/cit/2009/3836/2",
"title": "Computer and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbgames/2014/8065/0/8065a080",
"title": "Parallelizing Broad Phase Collision Detection for Animation in Games: A Performance Comparison of CPU and GPU Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/sbgames/2014/8065a080/12OmNvpew9w",
"parentPublication": {
"id": "proceedings/sbgames/2014/8065/0",
"title": "2014 Brazilian Symposium on Computer Games and Digital Entertainment (SBGAMES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icimt/2009/3922/0/3922a388",
"title": "A Review of Collision Avoidance Technique for Crowd Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/icimt/2009/3922a388/12OmNxE2mNV",
"parentPublication": {
"id": "proceedings/icimt/2009/3922/0",
"title": "Information and Multimedia Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdma/2012/4772/0/4772a859",
"title": "Study on the UGV's Active Collision Avoidance Technology Based on Petri Net",
"doi": null,
"abstractUrl": "/proceedings-article/icdma/2012/4772a859/12OmNxRF6V1",
"parentPublication": {
"id": "proceedings/icdma/2012/4772/0",
"title": "2012 Third International Conference on Digital Manufacturing & Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-euc/2013/5088/0/06825557",
"title": "GPU-Accelerated Parallel 3D Image Thinning",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-euc/2013/06825557/12OmNxZkhuK",
"parentPublication": {
"id": "proceedings/hpcc-euc/2013/5088/0",
"title": "2013 IEEE International Conference on High Performance Computing and Communications (HPCC) & 2013 IEEE International Conference on Embedded and Ubiquitous Computing (EUC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2015/1986/0/1986a297",
"title": "Vision-Based Collision Avoidance for Personal Aerial Vehicles Using Dynamic Potential Fields",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2015/1986a297/12OmNzcPAAt",
"parentPublication": {
"id": "proceedings/crv/2015/1986/0",
"title": "2015 12th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/08/08419292",
"title": "Real-Time Collision Detection for Deformable Characters with Radial Fields",
"doi": null,
"abstractUrl": "/journal/tg/2019/08/08419292/13rRUwInvsZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dasc-picom-datacom-cyberscitech/2017/1956/0/08328376",
"title": "Analysis of the Impact of Driver Behavior Models on Performance of Forward Collision Warning Systems",
"doi": null,
"abstractUrl": "/proceedings-article/dasc-picom-datacom-cyberscitech/2017/08328376/17D45WgziRa",
"parentPublication": {
"id": "proceedings/dasc-picom-datacom-cyberscitech/2017/1956/0",
"title": "2017 IEEE 15th Intl Conf on Dependable, Autonomic and Secure Computing, 15th Intl Conf on Pervasive Intelligence and Computing, 3rd Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2020/7303/0/730300a018",
"title": "Socially-Aware Multi-agent Velocity Obstacle Based Navigation for Nonholonomic Vehicles",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2020/730300a018/1nkDmLRKgEg",
"parentPublication": {
"id": "proceedings/compsac/2020/7303/0",
"title": "2020 IEEE 44th Annual Computers, Software, and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09543550",
"articleId": "1x4UOkaZAE8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09817653",
"articleId": "1EOAcNWXW5W",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1Fz3ebZZCbS",
"title": "Sept.",
"year": "2022",
"issueNum": "09",
"idPrefix": "tp",
"pubType": "journal",
"volume": "44",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1taALkdFHPO",
"doi": "10.1109/TPAMI.2021.3075915",
"abstract": "Systems that are based on recursive Bayesian updates for classification limit the cost of evidence collection through certain stopping/termination criteria and accordingly enforce decision making. Conventionally, two termination criteria based on pre-defined thresholds over (i) the maximum of the state posterior distribution; and (ii) the state posterior uncertainty are commonly used. In this paper, we propose a geometric interpretation over the state posterior progression and accordingly we provide a point-by-point analysis over the disadvantages of using such conventional termination criteria. For example, through the proposed geometric interpretation we show that confidence thresholds defined over maximum of the state posteriors suffer from stiffness that results in unnecessary evidence collection whereas uncertainty based thresholding methods are fragile to number of categories and terminate prematurely if some state candidates are already discovered to be unfavorable. Moreover, both types of termination methods neglect the evolution of posterior updates. We then propose a new stopping/termination criterion with a geometrical insight to overcome the limitations of these conventional methods and provide a comparison in terms of decision accuracy and speed. We validate our claims using simulations and using real experimental data obtained through a brain computer interfaced typing system.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Systems that are based on recursive Bayesian updates for classification limit the cost of evidence collection through certain stopping/termination criteria and accordingly enforce decision making. Conventionally, two termination criteria based on pre-defined thresholds over (i) the maximum of the state posterior distribution; and (ii) the state posterior uncertainty are commonly used. In this paper, we propose a geometric interpretation over the state posterior progression and accordingly we provide a point-by-point analysis over the disadvantages of using such conventional termination criteria. For example, through the proposed geometric interpretation we show that confidence thresholds defined over maximum of the state posteriors suffer from stiffness that results in unnecessary evidence collection whereas uncertainty based thresholding methods are fragile to number of categories and terminate prematurely if some state candidates are already discovered to be unfavorable. Moreover, both types of termination methods neglect the evolution of posterior updates. We then propose a new stopping/termination criterion with a geometrical insight to overcome the limitations of these conventional methods and provide a comparison in terms of decision accuracy and speed. We validate our claims using simulations and using real experimental data obtained through a brain computer interfaced typing system.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Systems that are based on recursive Bayesian updates for classification limit the cost of evidence collection through certain stopping/termination criteria and accordingly enforce decision making. Conventionally, two termination criteria based on pre-defined thresholds over (i) the maximum of the state posterior distribution; and (ii) the state posterior uncertainty are commonly used. In this paper, we propose a geometric interpretation over the state posterior progression and accordingly we provide a point-by-point analysis over the disadvantages of using such conventional termination criteria. For example, through the proposed geometric interpretation we show that confidence thresholds defined over maximum of the state posteriors suffer from stiffness that results in unnecessary evidence collection whereas uncertainty based thresholding methods are fragile to number of categories and terminate prematurely if some state candidates are already discovered to be unfavorable. Moreover, both types of termination methods neglect the evolution of posterior updates. We then propose a new stopping/termination criterion with a geometrical insight to overcome the limitations of these conventional methods and provide a comparison in terms of decision accuracy and speed. We validate our claims using simulations and using real experimental data obtained through a brain computer interfaced typing system.",
"title": "Stopping Criterion Design for Recursive Bayesian Classification: Analysis and Decision Geometry",
"normalizedTitle": "Stopping Criterion Design for Recursive Bayesian Classification: Analysis and Decision Geometry",
"fno": "09417010",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Bayes Methods",
"Brain Computer Interfaces",
"Decision Making",
"Geometry",
"Pattern Classification",
"Recursive Bayesian Classification",
"Decision Geometry",
"Recursive Bayesian Updates",
"Classification Limit",
"Decision Making",
"State Posterior Distribution",
"State Posterior Uncertainty",
"Geometric Interpretation",
"State Posterior Progression",
"Point By Point Analysis",
"Termination Criteria",
"Confidence Thresholds",
"State Posteriors",
"Unnecessary Evidence Collection",
"Uncertainty Based Thresholding Methods",
"State Candidates",
"Termination Methods",
"Posterior Updates",
"Geometrical Insight",
"Decision Accuracy",
"Criterion Design",
"Uncertainty",
"Entropy",
"Bayes Methods",
"Geometry",
"Radar Tracking",
"Probability Distribution",
"Brain Modeling",
"Active Learning",
"Sequential Decision Making",
"Recursive Bayesian Classification",
"Optimal Stopping Criterion Design"
],
"authors": [
{
"givenName": "Aziz",
"surname": "Koçanaoğulları",
"fullName": "Aziz Koçanaoğulları",
"affiliation": "Department of Electrical and Computer Engineering, Northeastern University, Boston, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Murat",
"surname": "Akcakaya",
"fullName": "Murat Akcakaya",
"affiliation": "Department of Electrical and Computer Engineering, Pittsburg University, Pittsburgh, PA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Deniz",
"surname": "Erdoğmuş",
"fullName": "Deniz Erdoğmuş",
"affiliation": "Department of Electrical and Computer Engineering, Northeastern University, Boston, MA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2022-09-01 00:00:00",
"pubType": "trans",
"pages": "5590-5601",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2014/4302/0/4302b019",
"title": "Stability-Based Stopping Criterion for Active Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2014/4302b019/12OmNBIWXAk",
"parentPublication": {
"id": "proceedings/icdm/2014/4302/0",
"title": "2014 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2004/2056/9/205690304b",
"title": "A Cost-Benefit Stopping Criterion for Statistical Testing",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2004/205690304b/12OmNBTawwB",
"parentPublication": {
"id": "proceedings/hicss/2004/2056/9",
"title": "37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icwmc/2006/2629/0/26290066",
"title": "A low-complexity stopping criterion for the decoder of parallel concatenated LDPC codes",
"doi": null,
"abstractUrl": "/proceedings-article/icwmc/2006/26290066/12OmNBbsifY",
"parentPublication": {
"id": "proceedings/icwmc/2006/2629/0",
"title": "Wireless and Mobile Communications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/date/2011/4208/0/05763107",
"title": "A low complexity stopping criterion for reducing power consumption in turbo decoders",
"doi": null,
"abstractUrl": "/proceedings-article/date/2011/05763107/12OmNvy257o",
"parentPublication": {
"id": "proceedings/date/2011/4208/0",
"title": "Design, Automation & Test in Europe Conference & Exhibition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ie/2010/4149/0/4149a249",
"title": "Stopping Criterion Impact on Pure Random Search Optimisation for Intelligent Device Distribution",
"doi": null,
"abstractUrl": "/proceedings-article/ie/2010/4149a249/12OmNxX3uQv",
"parentPublication": {
"id": "proceedings/ie/2010/4149/0",
"title": "Intelligent Environments, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsaa/2016/5206/0/07796910",
"title": "Continuous Monitoring of A/B Tests without Pain: Optional Stopping in Bayesian Testing",
"doi": null,
"abstractUrl": "/proceedings-article/dsaa/2016/07796910/12OmNy3AgpP",
"parentPublication": {
"id": "proceedings/dsaa/2016/5206/0",
"title": "2016 IEEE 3rd International Conference on Data Science and Advanced Analytics (DSAA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmc/2010/3989/2/3989b271",
"title": "A New Stopping Criterion for Duo-binary Turbo Codes",
"doi": null,
"abstractUrl": "/proceedings-article/cmc/2010/3989b271/12OmNym2c4y",
"parentPublication": {
"id": "proceedings/cmc/2010/3989/2",
"title": "Communications and Mobile Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicic/2006/2616/1/26160201",
"title": "A Novel Stopping Criterion for Turbo Decoding",
"doi": null,
"abstractUrl": "/proceedings-article/icicic/2006/26160201/12OmNyqRn4a",
"parentPublication": {
"id": "proceedings/icicic/2006/2616/1",
"title": "Innovative Computing ,Information and Control, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccmso/2022/3288/0/328800a235",
"title": "Bayesian Estimators of Dynamic Cumulative Residual Entropy for Pareto Type II Distribution using Asymmetric Loss Function",
"doi": null,
"abstractUrl": "/proceedings-article/iccmso/2022/328800a235/1Mq0Xy9pLJm",
"parentPublication": {
"id": "proceedings/iccmso/2022/3288/0",
"title": "2022 International Conference on Computational Modelling, Simulation and Optimization (ICCMSO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300d305",
"title": "Accelerate CNN via Recursive Bayesian Pruning",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300d305/1hVlBzXGZ9u",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09387144",
"articleId": "1sfXcejtqeI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09393612",
"articleId": "1srMAfD4SQw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Fz4IGBKuEU",
"name": "ttp202209-09417010s1-supp1-3075915.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp202209-09417010s1-supp1-3075915.pdf",
"extension": "pdf",
"size": "20.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgK8",
"title": "Dec.",
"year": "2014",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvsR",
"doi": "10.1109/TVCG.2014.2346403",
"abstract": "Interactions between atoms have a major influence on the chemical properties of molecular systems. While covalent interactions impose the structural integrity of molecules, noncovalent interactions govern more subtle phenomena such as protein folding, bonding or self assembly. The understanding of these types of interactions is necessary for the interpretation of many biological processes and chemical design tasks. While traditionally the electron density is analyzed to interpret the quantum chemistry of a molecular system, noncovalent interactions are characterized by low electron densities and only slight variations of them — challenging their extraction and characterization. Recently, the signed electron density and the reduced gradient, two scalar fields derived from the electron density, have drawn much attention in quantum chemistry since they enable a qualitative visualization of these interactions even in complex molecular systems and experimental measurements. In this work, we present the first combinatorial algorithm for the automated extraction and characterization of covalent and noncovalent interactions in molecular systems. The proposed algorithm is based on a joint topological analysis of the signed electron density and the reduced gradient. Combining the connectivity information of the critical points of these two scalar fields enables to visualize, enumerate, classify and investigate molecular interactions in a robust manner. Experiments on a variety of molecular systems, from simple dimers to proteins or DNA, demonstrate the ability of our technique to robustly extract these interactions and to reveal their structural relations to the atoms and bonds forming the molecules. For simple systems, our analysis corroborates the observations made by the chemists while it provides new visual and quantitative insights on chemical interactions for larger molecular systems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Interactions between atoms have a major influence on the chemical properties of molecular systems. While covalent interactions impose the structural integrity of molecules, noncovalent interactions govern more subtle phenomena such as protein folding, bonding or self assembly. The understanding of these types of interactions is necessary for the interpretation of many biological processes and chemical design tasks. While traditionally the electron density is analyzed to interpret the quantum chemistry of a molecular system, noncovalent interactions are characterized by low electron densities and only slight variations of them — challenging their extraction and characterization. Recently, the signed electron density and the reduced gradient, two scalar fields derived from the electron density, have drawn much attention in quantum chemistry since they enable a qualitative visualization of these interactions even in complex molecular systems and experimental measurements. In this work, we present the first combinatorial algorithm for the automated extraction and characterization of covalent and noncovalent interactions in molecular systems. The proposed algorithm is based on a joint topological analysis of the signed electron density and the reduced gradient. Combining the connectivity information of the critical points of these two scalar fields enables to visualize, enumerate, classify and investigate molecular interactions in a robust manner. Experiments on a variety of molecular systems, from simple dimers to proteins or DNA, demonstrate the ability of our technique to robustly extract these interactions and to reveal their structural relations to the atoms and bonds forming the molecules. For simple systems, our analysis corroborates the observations made by the chemists while it provides new visual and quantitative insights on chemical interactions for larger molecular systems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Interactions between atoms have a major influence on the chemical properties of molecular systems. While covalent interactions impose the structural integrity of molecules, noncovalent interactions govern more subtle phenomena such as protein folding, bonding or self assembly. The understanding of these types of interactions is necessary for the interpretation of many biological processes and chemical design tasks. While traditionally the electron density is analyzed to interpret the quantum chemistry of a molecular system, noncovalent interactions are characterized by low electron densities and only slight variations of them — challenging their extraction and characterization. Recently, the signed electron density and the reduced gradient, two scalar fields derived from the electron density, have drawn much attention in quantum chemistry since they enable a qualitative visualization of these interactions even in complex molecular systems and experimental measurements. In this work, we present the first combinatorial algorithm for the automated extraction and characterization of covalent and noncovalent interactions in molecular systems. The proposed algorithm is based on a joint topological analysis of the signed electron density and the reduced gradient. Combining the connectivity information of the critical points of these two scalar fields enables to visualize, enumerate, classify and investigate molecular interactions in a robust manner. Experiments on a variety of molecular systems, from simple dimers to proteins or DNA, demonstrate the ability of our technique to robustly extract these interactions and to reveal their structural relations to the atoms and bonds forming the molecules. For simple systems, our analysis corroborates the observations made by the chemists while it provides new visual and quantitative insights on chemical interactions for larger molecular systems.",
"title": "Characterizing Molecular Interactions in Chemical Systems",
"normalizedTitle": "Characterizing Molecular Interactions in Chemical Systems",
"fno": "06875922",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Chemicals",
"Bonding",
"Feature Extraction",
"Isosurfaces",
"Data Visualization",
"Join Tree",
"Molecular Chemistry",
"Topological Data Analysis",
"Morse Smale Complex"
],
"authors": [
{
"givenName": "David",
"surname": "Gunther",
"fullName": "David Gunther",
"affiliation": ", Institut-Mines-Télécom, Paris, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Roberto A.",
"surname": "Boto",
"fullName": "Roberto A. Boto",
"affiliation": ", Sorbonne Universités, Paris, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Juila",
"surname": "Contreras-Garcia",
"fullName": "Juila Contreras-Garcia",
"affiliation": ", Sorbonne Universités, Paris, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jean-Philip",
"surname": "Piquemal",
"fullName": "Jean-Philip Piquemal",
"affiliation": ", Sorbonne Universités, Paris, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Julien",
"surname": "Tierny",
"fullName": "Julien Tierny",
"affiliation": ", CNRS LIP6, UPMC, Paris, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "2476-2485",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdar/2017/3586/2/3586c011",
"title": "Extracting Interactions from Molecular Pathways",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2017/3586c011/12OmNB836Gb",
"parentPublication": {
"id": "icdar/2017/3586/2",
"title": "2017 14th IAPR International Conference on Document Analysis and Recognition (ICDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2015/7983/0/07367646",
"title": "Simulation of the UV/Vis spectra of flavonoids",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2015/07367646/12OmNCm7BFP",
"parentPublication": {
"id": "proceedings/bibe/2015/7983/0",
"title": "2015 IEEE 15th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2009/3885/0/3885a074",
"title": "3D Rotation Invariant Features for the Characterization of Molecular Density Maps",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2009/3885a074/12OmNrAdsvJ",
"parentPublication": {
"id": "proceedings/bibm/2009/3885/0",
"title": "2009 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880465",
"title": "Detection and Visualization of Anomalous Structures in Molecular Dynamics Simulation Data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880465/12OmNvT2p6i",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eqec/2005/8973/0/01567333",
"title": "Ultrafast dynamics of nonequilibrium electrons in hybrid metal/chemical nano-systems",
"doi": null,
"abstractUrl": "/proceedings-article/eqec/2005/01567333/12OmNvkplfd",
"parentPublication": {
"id": "proceedings/eqec/2005/8973/0",
"title": "2005 European Quantum Electronics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/varms-ieeevr/2015/6926/0/07151719",
"title": "Visualization of molecular properties at the qantum mechanical level using blender",
"doi": null,
"abstractUrl": "/proceedings-article/varms-ieeevr/2015/07151719/12OmNy3RRLj",
"parentPublication": {
"id": "proceedings/varms-ieeevr/2015/6926/0",
"title": "2015 IEEE 1st International Workshop on Virtual and Augmented Reality for Molecular Science (VARMS@IEEEVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2015/6879/0/07156364",
"title": "ERICAs: Enabling insights into ab initio Molecular Dynamics simulations",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156364/12OmNzSh13Q",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/1993/06/k0985",
"title": "Knowledge Discovery in Molecular Databases",
"doi": null,
"abstractUrl": "/journal/tk/1993/06/k0985/13rRUwInv4H",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__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": "trans/tb/2020/04/08606950",
"title": "nAPOLI: A Graph-Based Strategy to Detect and Visualize Conserved Protein-Ligand Interactions in Large-Scale",
"doi": null,
"abstractUrl": "/journal/tb/2020/04/08606950/17D45W9KVHi",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06875931",
"articleId": "13rRUwbaqLw",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06876051",
"articleId": "13rRUwInvfa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgDX",
"name": "ttg201412-06875922s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201412-06875922s1.zip",
"extension": "zip",
"size": "6.29 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1xlvIBjDUyc",
"title": "Nov.",
"year": "2021",
"issueNum": "11",
"idPrefix": "tp",
"pubType": "journal",
"volume": "43",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1jVM9JkIVj2",
"doi": "10.1109/TPAMI.2020.2994935",
"abstract": "One key challenge in the point cloud segmentation is the detection and split of overlapping regions between different planes. The existing methods depend on the similarity and the dissimilarity in neighbor regions without a global constraint, which brings the ‘over-’ and ‘under-’ segmentation in the results. Hence, this paper presents a pipeline of the accurate plane segmentation for point clouds to address the shortcoming in the local optimization. There are two phases included in the proposed segmentation process. One is a local phase to calculate connectivity scores between different planes based on local variations of surface normals. In this phase, a new optimal-vector-field is formulated to detect the plane intersections. The optimal-vector-field is large in magnitude at plane intersections and vanishing at other regions. The other one is a global phase to smooth local segmentation cues to mimic leading eigenvector computation in the graph-cut. Evaluation of two datasets shows that the achieved precision and recall is 94.50 percent and 90.81 percent on the collected mobile LiDAR data and obtains an average accuracy of 75.4 percent on an open benchmark, which outperforms the state-of-the-art methods in terms of completeness and correctness.",
"abstracts": [
{
"abstractType": "Regular",
"content": "One key challenge in the point cloud segmentation is the detection and split of overlapping regions between different planes. The existing methods depend on the similarity and the dissimilarity in neighbor regions without a global constraint, which brings the ‘over-’ and ‘under-’ segmentation in the results. Hence, this paper presents a pipeline of the accurate plane segmentation for point clouds to address the shortcoming in the local optimization. There are two phases included in the proposed segmentation process. One is a local phase to calculate connectivity scores between different planes based on local variations of surface normals. In this phase, a new optimal-vector-field is formulated to detect the plane intersections. The optimal-vector-field is large in magnitude at plane intersections and vanishing at other regions. The other one is a global phase to smooth local segmentation cues to mimic leading eigenvector computation in the graph-cut. Evaluation of two datasets shows that the achieved precision and recall is 94.50 percent and 90.81 percent on the collected mobile LiDAR data and obtains an average accuracy of 75.4 percent on an open benchmark, which outperforms the state-of-the-art methods in terms of completeness and correctness.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "One key challenge in the point cloud segmentation is the detection and split of overlapping regions between different planes. The existing methods depend on the similarity and the dissimilarity in neighbor regions without a global constraint, which brings the ‘over-’ and ‘under-’ segmentation in the results. Hence, this paper presents a pipeline of the accurate plane segmentation for point clouds to address the shortcoming in the local optimization. There are two phases included in the proposed segmentation process. One is a local phase to calculate connectivity scores between different planes based on local variations of surface normals. In this phase, a new optimal-vector-field is formulated to detect the plane intersections. The optimal-vector-field is large in magnitude at plane intersections and vanishing at other regions. The other one is a global phase to smooth local segmentation cues to mimic leading eigenvector computation in the graph-cut. Evaluation of two datasets shows that the achieved precision and recall is 94.50 percent and 90.81 percent on the collected mobile LiDAR data and obtains an average accuracy of 75.4 percent on an open benchmark, which outperforms the state-of-the-art methods in terms of completeness and correctness.",
"title": "Plane Segmentation Based on the Optimal-Vector-Field in LiDAR Point Clouds",
"normalizedTitle": "Plane Segmentation Based on the Optimal-Vector-Field in LiDAR Point Clouds",
"fno": "09095372",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Eigenvalues And Eigenfunctions",
"Graph Theory",
"Image Segmentation",
"Optical Radar",
"Optimal Vector Field",
"Li DAR Point Clouds",
"Point Cloud Segmentation",
"Neighbor Regions",
"Global Constraint",
"Accurate Plane Segmentation",
"Local Optimization",
"Segmentation Process",
"Local Phase",
"Local Variations",
"Plane Intersections",
"Global Phase",
"Local Segmentation Cues",
"Efficiency 94 5 Percent",
"Efficiency 90 81 Percent",
"Efficiency 75 4 Percent",
"Three Dimensional Displays",
"Image Segmentation",
"Optimization",
"Estimation",
"Laser Radar",
"Pipelines",
"Surface Treatment",
"Plane Segmentation",
"Optimal Vector Field",
"Point Clouds",
"Surface Normals",
"Graph Cut"
],
"authors": [
{
"givenName": "Sheng",
"surname": "Xu",
"fullName": "Sheng Xu",
"affiliation": "College of Information Science and Technology, College of Landscape Architecture, Nanjing Forestry University, Nanjing, Jiangsu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ruisheng",
"surname": "Wang",
"fullName": "Ruisheng Wang",
"affiliation": "School of Geographical Sciences, Guangzhou University, Guangzhou, Guangdong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hao",
"surname": "Wang",
"fullName": "Hao Wang",
"affiliation": "Department of Geomatics Engineering, University of Calgary, Calgary, AB, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ruigang",
"surname": "Yang",
"fullName": "Ruigang Yang",
"affiliation": "College of Landscape Architecture, Nanjing Forestry University, Nanjing, Jiangsu, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2021-11-01 00:00:00",
"pubType": "trans",
"pages": "3991-4007",
"year": "2021",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dv/2015/8332/0/8332a109",
"title": "Segmentation of 3D Lidar Points Using Extruded Surface of Cross Section",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2015/8332a109/12OmNB8TU7S",
"parentPublication": {
"id": "proceedings/3dv/2015/8332/0",
"title": "2015 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2014/4717/0/06890541",
"title": "Automatic segmentation of LiDAR point cloud data at different height levels for 3D building extraction",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2014/06890541/12OmNwswg6Q",
"parentPublication": {
"id": "proceedings/icmew/2014/4717/0",
"title": "2014 IEEE International Conference on Multimedia and Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/git4ndm/2013/2269/0/2269a130",
"title": "Automated Detection of Road Manhole Covers from Mobile LiDAR Point-Clouds Based on a Marked Point Process",
"doi": null,
"abstractUrl": "/proceedings-article/git4ndm/2013/2269a130/12OmNyoiYYE",
"parentPublication": {
"id": "proceedings/git4ndm/2013/2269/0",
"title": "2013 Fifth International Conference on Geo-Information Technologies for Natural Disaster Management (GiT4NDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000e597",
"title": "Reflection Removal for Large-Scale 3D Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000e597/17D45WYQJ60",
"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/icme/2020/1331/0/09102769",
"title": "Lightningnet: Fast and Accurate Semantic Segmentation for Autonomous Driving Based on 3D LIDAR Point Cloud",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2020/09102769/1kwqWPaplrG",
"parentPublication": {
"id": "proceedings/icme/2020/1331/0",
"title": "2020 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ctisc/2020/6501/0/09203932",
"title": "A simple ground segmentation method for LiDAR 3D point clouds",
"doi": null,
"abstractUrl": "/proceedings-article/ctisc/2020/09203932/1nkDbgNFVNS",
"parentPublication": {
"id": "proceedings/ctisc/2020/6501/0",
"title": "2020 2nd International Conference on Advances in Computer Technology, Information Science and Communications (CTISC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412379",
"title": "A Plane-based Approach for Indoor Point Clouds Registration",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412379/1tmiHcZ1kje",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2021/0477/0/047700b799",
"title": "Multi Projection Fusion for Real-time Semantic Segmentation of 3D LiDAR Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2021/047700b799/1uqGEDfIht6",
"parentPublication": {
"id": "proceedings/wacv/2021/0477/0",
"title": "2021 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2021/4899/0/489900e309",
"title": "Semantic labeling of lidar point clouds for UAV applications",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2021/489900e309/1yJYqacU9na",
"parentPublication": {
"id": "proceedings/cvprw/2021/4899/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900p5358",
"title": "Complete & Label: A Domain Adaptation Approach to Semantic Segmentation of LiDAR Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900p5358/1yeKG8howYE",
"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": "09079218",
"articleId": "1joA0zxqB6o",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09099607",
"articleId": "1k7oyQN4cN2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1xlvPWAwXfO",
"name": "ttp202111-09095372s1-supp1-2994935.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp202111-09095372s1-supp1-2994935.pdf",
"extension": "pdf",
"size": "129 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzZEAys",
"title": "Sep./Oct.",
"year": "2018",
"issueNum": "05",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "38",
"label": "Sep./Oct.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13WBGQCAPLm",
"doi": "10.1109/MCG.2018.053491731",
"abstract": "Tailoring visualization and interaction design to the demands of an application is challenging if domain information is unavailable or confidential. This article discusses a process-centric design approach, allowing for inferring design goals indirectly from informal interviews with practitioners and stakeholders. The design benefits from their expertise, while secrets remain secret.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Tailoring visualization and interaction design to the demands of an application is challenging if domain information is unavailable or confidential. This article discusses a process-centric design approach, allowing for inferring design goals indirectly from informal interviews with practitioners and stakeholders. The design benefits from their expertise, while secrets remain secret.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Tailoring visualization and interaction design to the demands of an application is challenging if domain information is unavailable or confidential. This article discusses a process-centric design approach, allowing for inferring design goals indirectly from informal interviews with practitioners and stakeholders. The design benefits from their expertise, while secrets remain secret.",
"title": "Designing Effective Visual Interactive Systems despite Sparse Availability of Domain Information",
"normalizedTitle": "Designing Effective Visual Interactive Systems despite Sparse Availability of Domain Information",
"fno": "mcg2018050054",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Visualisation",
"Interactive Systems",
"Informal Interviews",
"Design Benefits",
"Sparse Availability",
"Domain Information",
"Interaction Design",
"Process Centric Design Approach",
"Design Goals",
"Stakeholders",
"Visual Interactive Systems",
"Visualization",
"Law Enforcement",
"Task Analysis",
"Data Visualization",
"Smart Cities",
"Interactive Systems",
"Optimization",
"Design Study",
"Domain Requirements",
"Applications",
"Design Methodology",
"Computer Graphics"
],
"authors": [
{
"givenName": "Benjamin",
"surname": "Karer",
"fullName": "Benjamin Karer",
"affiliation": "University of Kaiserslautern",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alina",
"surname": "Freund",
"fullName": "Alina Freund",
"affiliation": "University of Kaiserslautern",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Horst",
"fullName": "Michael Horst",
"affiliation": "Westpfalz police headquarters",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Inga",
"surname": "Scheler",
"fullName": "Inga Scheler",
"affiliation": "University of Kaiserslautern",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Kossurok",
"fullName": "Thomas Kossurok",
"affiliation": "Westpfalz police headquarters",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Franz-Josef",
"surname": "Brandt",
"fullName": "Franz-Josef Brandt",
"affiliation": "Westpfalz police headquarters",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2018-09-01 00:00:00",
"pubType": "mags",
"pages": "54-69",
"year": "2018",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/eisic/2016/2857/0/07870192",
"title": "How Analysts Think: Think-steps as a Tool for Structuring Sensemaking in Criminal Intelligence Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/eisic/2016/07870192/12OmNxWLTzQ",
"parentPublication": {
"id": "proceedings/eisic/2016/2857/0",
"title": "2016 European Intelligence and Security Informatics Conference (EISIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a169",
"title": "A Mobile Visual Analytics Approach for Law Enforcement Situation Awareness",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a169/12OmNyO8tTz",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2016/3568/0/3568a305",
"title": "MSKDE - Using Marching Squares to Quickly Make High Quality Crime Hotspot Maps",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2016/3568a305/12OmNyz5JQ2",
"parentPublication": {
"id": "proceedings/sibgrapi/2016/3568/0",
"title": "2016 29th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2014/2504/0/2504b556",
"title": "Detection of Domestic Human Trafficking Indicators and Movement Trends Using Content Available on Open Internet Sources",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2014/2504b556/12OmNzXWZJP",
"parentPublication": {
"id": "proceedings/hicss/2014/2504/0",
"title": "2014 47th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2022/9747/0/974700b044",
"title": "Designing Effective Sparse Expert Models",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2022/974700b044/1Fu9v1EnITm",
"parentPublication": {
"id": "proceedings/ipdpsw/2022/9747/0",
"title": "2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msn/2022/6457/0/645700a526",
"title": "An Opponent-Aware Reinforcement Learning Method for Team-to-Team Multi-Vehicle Pursuit via Maximizing Mutual Information Indicator",
"doi": null,
"abstractUrl": "/proceedings-article/msn/2022/645700a526/1LUtO02PxRu",
"parentPublication": {
"id": "proceedings/msn/2022/6457/0",
"title": "2022 18th International Conference on Mobility, Sensing and Networking (MSN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2019/4765/0/476500a470",
"title": "AR/VR Based Smart Policing For Fast Response to Crimes in Safe City",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2019/476500a470/1gysio1e3wk",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2019/4765/0",
"title": "2019 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/08/09028205",
"title": "Design Exposition Discussion Documents for Rich Design Discourse in Applied Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2021/08/09028205/1i3AQ4Mu0qA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2020/7624/0/762400b193",
"title": "Collaborative Mobile Surveillance System for Smart Cities",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2020/762400b193/1uGYy8bivkc",
"parentPublication": {
"id": "proceedings/csci/2020/7624/0",
"title": "2020 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ichi/2021/0132/0/013200a002",
"title": "Designing Tools to Counter Violence and Structural Oppression",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2021/013200a002/1xIOSTQIu08",
"parentPublication": {
"id": "proceedings/ichi/2021/0132/0",
"title": "2021 IEEE 9th International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2018050038",
"articleId": "13WBGNxhc5X",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2018050070",
"articleId": "13WBGNgfgi0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1MQvcIkoAko",
"title": "June",
"year": "2023",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1B5WCvEX76E",
"doi": "10.1109/TVCG.2022.3152450",
"abstract": "To reduce the number of pending cases and conflicting rulings in the Brazilian Judiciary, the National Congress amended the Constitution, allowing the Brazilian Supreme Court (STF) to create <italic>binding precedents</italic> (BPs), i.e., a set of understandings that both Executive and lower Judiciary branches must follow. The STF’s justices frequently cite the 58 existing BPs in their decisions, and it is of primary relevance that judicial experts could identify and analyze such citations. To assist in this problem, we propose LegalVis, a web-based visual analytics system designed to support the analysis of legal documents that cite or could potentially cite a BP. We model the problem of identifying potential citations (i.e., non-explicit) as a classification problem. However, a simple score is not enough to explain the results; that is why we use an interpretability machine learning method to explain the reason behind each identified citation. For a compelling visual exploration of documents and BPs, LegalVis comprises three interactive visual components: the first presents an overview of the data showing temporal patterns, the second allows filtering and grouping relevant documents by topic, and the last one shows a document’s text aiming to interpret the model’s output by pointing out which paragraphs are likely to mention the BP, even if not explicitly specified. We evaluated our identification model and obtained an accuracy of 96%; we also made a quantitative and qualitative analysis of the results. The usefulness and effectiveness of LegalVis were evaluated through two usage scenarios and feedback from six domain experts.",
"abstracts": [
{
"abstractType": "Regular",
"content": "To reduce the number of pending cases and conflicting rulings in the Brazilian Judiciary, the National Congress amended the Constitution, allowing the Brazilian Supreme Court (STF) to create <italic>binding precedents</italic> (BPs), i.e., a set of understandings that both Executive and lower Judiciary branches must follow. The STF’s justices frequently cite the 58 existing BPs in their decisions, and it is of primary relevance that judicial experts could identify and analyze such citations. To assist in this problem, we propose LegalVis, a web-based visual analytics system designed to support the analysis of legal documents that cite or could potentially cite a BP. We model the problem of identifying potential citations (i.e., non-explicit) as a classification problem. However, a simple score is not enough to explain the results; that is why we use an interpretability machine learning method to explain the reason behind each identified citation. For a compelling visual exploration of documents and BPs, LegalVis comprises three interactive visual components: the first presents an overview of the data showing temporal patterns, the second allows filtering and grouping relevant documents by topic, and the last one shows a document’s text aiming to interpret the model’s output by pointing out which paragraphs are likely to mention the BP, even if not explicitly specified. We evaluated our identification model and obtained an accuracy of 96%; we also made a quantitative and qualitative analysis of the results. The usefulness and effectiveness of LegalVis were evaluated through two usage scenarios and feedback from six domain experts.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "To reduce the number of pending cases and conflicting rulings in the Brazilian Judiciary, the National Congress amended the Constitution, allowing the Brazilian Supreme Court (STF) to create binding precedents (BPs), i.e., a set of understandings that both Executive and lower Judiciary branches must follow. The STF’s justices frequently cite the 58 existing BPs in their decisions, and it is of primary relevance that judicial experts could identify and analyze such citations. To assist in this problem, we propose LegalVis, a web-based visual analytics system designed to support the analysis of legal documents that cite or could potentially cite a BP. We model the problem of identifying potential citations (i.e., non-explicit) as a classification problem. However, a simple score is not enough to explain the results; that is why we use an interpretability machine learning method to explain the reason behind each identified citation. For a compelling visual exploration of documents and BPs, LegalVis comprises three interactive visual components: the first presents an overview of the data showing temporal patterns, the second allows filtering and grouping relevant documents by topic, and the last one shows a document’s text aiming to interpret the model’s output by pointing out which paragraphs are likely to mention the BP, even if not explicitly specified. We evaluated our identification model and obtained an accuracy of 96%; we also made a quantitative and qualitative analysis of the results. The usefulness and effectiveness of LegalVis were evaluated through two usage scenarios and feedback from six domain experts.",
"title": "LegalVis: Exploring and Inferring Precedent Citations in Legal Documents",
"normalizedTitle": "LegalVis: Exploring and Inferring Precedent Citations in Legal Documents",
"fno": "09716779",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Law",
"Data Visualization",
"Visual Analytics",
"Task Analysis",
"Text Analysis",
"Analytical Models",
"Natural Language Processing",
"Legal Documents",
"Visual Analytics",
"Brazilian Legal System",
"Natural Language Processing"
],
"authors": [
{
"givenName": "Lucas E.",
"surname": "Resck",
"fullName": "Lucas E. Resck",
"affiliation": "Fundação Getulio Vargas, Rio de Janeiro, Brazil",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jean R.",
"surname": "Ponciano",
"fullName": "Jean R. Ponciano",
"affiliation": "Fundação Getulio Vargas, Rio de Janeiro, Brazil",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Luis Gustavo",
"surname": "Nonato",
"fullName": "Luis Gustavo Nonato",
"affiliation": "ICMC-USP, São Carlos, Brazil",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jorge",
"surname": "Poco",
"fullName": "Jorge Poco",
"affiliation": "Fundação Getulio Vargas, Rio de Janeiro, Brazil",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2023-06-01 00:00:00",
"pubType": "trans",
"pages": "3105-3120",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/e-science/2015/9325/0/9325a288",
"title": "Interactive Analytic Systems for Understanding the Scholarly Impact of Large-Scale E-science Cyberenvironments",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2015/9325a288/12OmNxiKscb",
"parentPublication": {
"id": "proceedings/e-science/2015/9325/0",
"title": "2015 IEEE 11th International Conference on e-Science (e-Science)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ic3/2017/3077/0/08284324",
"title": "Approaches for information retrieval in legal documents",
"doi": null,
"abstractUrl": "/proceedings-article/ic3/2017/08284324/12OmNzBwGop",
"parentPublication": {
"id": "proceedings/ic3/2017/3077/0",
"title": "2017 Tenth International Conference on Contemporary Computing (IC3)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122002",
"title": "HierarchicalTopics: Visually Exploring Large Text Collections Using Topic Hierarchies",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122002/13rRUxNW1Zo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/01/ttg2012010093",
"title": "EventRiver: Visually Exploring Text Collections with Temporal References",
"doi": null,
"abstractUrl": "/journal/tg/2012/01/ttg2012010093/13rRUxly8SS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2018/7202/0/720200a241",
"title": "Cartographies of the Legal World. Rise and Challenges of Visual Legal Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a241/17D45WrVg8T",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/istm/2022/7116/0/711600a007",
"title": "Interpretable Text Classification in Legal Contract Documents using Tsetlin Machines",
"doi": null,
"abstractUrl": "/proceedings-article/istm/2022/711600a007/1HJzGIZp65G",
"parentPublication": {
"id": "proceedings/istm/2022/7116/0",
"title": "2022 International Symposium on the Tsetlin Machine (ISTM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis4dh/2022/7668/0/766800a037",
"title": "From Historical Documents To Social Network Visualization: Potential Pitfalls and Network Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/vis4dh/2022/766800a037/1J2XGWp7vqw",
"parentPublication": {
"id": "proceedings/vis4dh/2022/7668/0",
"title": "2022 IEEE 7th Workshop on Visualization for the Digital Humanities (VIS4DH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/jcdl/2019/1547/0/154700a120",
"title": "Improving Academic Plagiarism Detection for STEM Documents by Analyzing Mathematical Content and Citations",
"doi": null,
"abstractUrl": "/proceedings-article/jcdl/2019/154700a120/1ckrHKT4bgA",
"parentPublication": {
"id": "proceedings/jcdl/2019/1547/0",
"title": "2019 ACM/IEEE Joint Conference on Digital Libraries (JCDL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2020/6251/0/09377970",
"title": "A bibliometric network analysis of Deep Learning publications applied into legal documents",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09377970/1s64Bs1mh6E",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2020/6251/0/09378182",
"title": "CNN Application in Detection of Privileged Documents in Legal Document Review",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09378182/1s64SyTIVAk",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09714170",
"articleId": "1B0Y0ltSIfK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09699035",
"articleId": "1ADJfMYBSCs",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1MQvg3GWiIw",
"name": "ttg202306-09716779s1-supp2-3152450.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202306-09716779s1-supp2-3152450.mp4",
"extension": "mp4",
"size": "12 MB",
"__typename": "WebExtraType"
},
{
"id": "1MQvg91UAnK",
"name": "ttg202306-09716779s1-supp1-3152450.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202306-09716779s1-supp1-3152450.pdf",
"extension": "pdf",
"size": "1.96 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyQphgC",
"title": "March",
"year": "1996",
"issueNum": "03",
"idPrefix": "tp",
"pubType": "journal",
"volume": "18",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5oh",
"doi": "10.1109/34.485559",
"abstract": "Abstract—Parametric deformable models have been extensively and very successfully used for reconstructing free-form curves and surfaces, and for tracking nonrigid deformations, but they require previous knowledge of the topological type of the data, and good initial curve or surface estimates. With deformable models, it is also computationally expensive to check for and to prevent self-intersections while tracking deformations. The Implicit Simplicial Models that we introduce in this paper are implicit curves and surfaces defined by piece-wise linear functions. This representation allows for local deformations, control of the topological type, and prevention of self-intersections during deformations. As a first application, we also describe in this paper an algorithm for two-dimensional curve reconstruction from unorganized sets of data points. The topology, the number of connected components, and the geometry of the data are all estimated using an adaptive space subdivision approach. The main four components of the algorithm are topology estimation, curve fitting, adaptive space subdivision, and mesh relaxation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Parametric deformable models have been extensively and very successfully used for reconstructing free-form curves and surfaces, and for tracking nonrigid deformations, but they require previous knowledge of the topological type of the data, and good initial curve or surface estimates. With deformable models, it is also computationally expensive to check for and to prevent self-intersections while tracking deformations. The Implicit Simplicial Models that we introduce in this paper are implicit curves and surfaces defined by piece-wise linear functions. This representation allows for local deformations, control of the topological type, and prevention of self-intersections during deformations. As a first application, we also describe in this paper an algorithm for two-dimensional curve reconstruction from unorganized sets of data points. The topology, the number of connected components, and the geometry of the data are all estimated using an adaptive space subdivision approach. The main four components of the algorithm are topology estimation, curve fitting, adaptive space subdivision, and mesh relaxation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Parametric deformable models have been extensively and very successfully used for reconstructing free-form curves and surfaces, and for tracking nonrigid deformations, but they require previous knowledge of the topological type of the data, and good initial curve or surface estimates. With deformable models, it is also computationally expensive to check for and to prevent self-intersections while tracking deformations. The Implicit Simplicial Models that we introduce in this paper are implicit curves and surfaces defined by piece-wise linear functions. This representation allows for local deformations, control of the topological type, and prevention of self-intersections during deformations. As a first application, we also describe in this paper an algorithm for two-dimensional curve reconstruction from unorganized sets of data points. The topology, the number of connected components, and the geometry of the data are all estimated using an adaptive space subdivision approach. The main four components of the algorithm are topology estimation, curve fitting, adaptive space subdivision, and mesh relaxation.",
"title": "Implicit Simplicial Models for Adaptive Curve Reconstruction",
"normalizedTitle": "Implicit Simplicial Models for Adaptive Curve Reconstruction",
"fno": "i0321",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Curve Fitting",
"Topology Estimation",
"Shape Recovery",
"Geometric Modeling"
],
"authors": [
{
"givenName": "Gabriel",
"surname": "Taubin",
"fullName": "Gabriel Taubin",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Remi",
"surname": "Ronfard",
"fullName": "Remi Ronfard",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "1996-03-01 00:00:00",
"pubType": "trans",
"pages": "321-325",
"year": "1996",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0309",
"articleId": "13rRUyeTViX",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0326",
"articleId": "13rRUwIF6m9",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqOOrM5",
"title": "Aug.",
"year": "2015",
"issueNum": "08",
"idPrefix": "tm",
"pubType": "journal",
"volume": "14",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyfKIIy",
"doi": "10.1109/TMC.2014.2360389",
"abstract": "Simplicial homology is a tool that provides a mathematical way to compute the connectivity and the coverage of a cellular network without any node location information. In this paper, we use simplicial homology in order to not only compute the topology of a cellular network, but also to discover the clusters of nodes still with no location information. We propose three algorithms for the management of future cellular networks. The first one is a frequency auto-planning algorithm for the self-configuration of future cellular networks. It aims at minimizing the number of planned frequencies while maximizing the usage of each one. Then, our energy conservation algorithm falls into the self-optimization feature of future cellular networks. It optimizes the energy consumption of the cellular network during off-peak hours while taking into account both coverage and user traffic. Finally, we present and discuss the performance of a disaster recovery algorithm using determinantal point processes to patch coverage holes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Simplicial homology is a tool that provides a mathematical way to compute the connectivity and the coverage of a cellular network without any node location information. In this paper, we use simplicial homology in order to not only compute the topology of a cellular network, but also to discover the clusters of nodes still with no location information. We propose three algorithms for the management of future cellular networks. The first one is a frequency auto-planning algorithm for the self-configuration of future cellular networks. It aims at minimizing the number of planned frequencies while maximizing the usage of each one. Then, our energy conservation algorithm falls into the self-optimization feature of future cellular networks. It optimizes the energy consumption of the cellular network during off-peak hours while taking into account both coverage and user traffic. Finally, we present and discuss the performance of a disaster recovery algorithm using determinantal point processes to patch coverage holes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Simplicial homology is a tool that provides a mathematical way to compute the connectivity and the coverage of a cellular network without any node location information. In this paper, we use simplicial homology in order to not only compute the topology of a cellular network, but also to discover the clusters of nodes still with no location information. We propose three algorithms for the management of future cellular networks. The first one is a frequency auto-planning algorithm for the self-configuration of future cellular networks. It aims at minimizing the number of planned frequencies while maximizing the usage of each one. Then, our energy conservation algorithm falls into the self-optimization feature of future cellular networks. It optimizes the energy consumption of the cellular network during off-peak hours while taking into account both coverage and user traffic. Finally, we present and discuss the performance of a disaster recovery algorithm using determinantal point processes to patch coverage holes.",
"title": "Simplicial Homology for Future Cellular Networks",
"normalizedTitle": "Simplicial Homology for Future Cellular Networks",
"fno": "06910305",
"hasPdf": true,
"idPrefix": "tm",
"keywords": [
"Interference",
"Abstracts",
"Femtocells",
"Planning",
"Topology",
"Relays",
"Simplicial Homology",
"Future Cellular Networks",
"Self Organizing Networks"
],
"authors": [
{
"givenName": "Anais",
"surname": "Vergne",
"fullName": "Anais Vergne",
"affiliation": "Geometrica Team, Inria Saclay - Ile de France, Palaiseau, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Laurent",
"surname": "Decreusefond",
"fullName": "Laurent Decreusefond",
"affiliation": "Network and Computer Science Department, Telecom ParisTech, Paris, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Philippe",
"surname": "Martins",
"fullName": "Philippe Martins",
"affiliation": "Network and Computer Science Department, Telecom ParisTech, Paris, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2015-08-01 00:00:00",
"pubType": "trans",
"pages": "1712-1725",
"year": "2015",
"issn": "1536-1233",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/nana/2017/0604/0/0604a292",
"title": "D2D Communication for Disaster Recovery in Cellular Networks",
"doi": null,
"abstractUrl": "/proceedings-article/nana/2017/0604a292/12OmNAJVcCC",
"parentPublication": {
"id": "proceedings/nana/2017/0604/0",
"title": "2017 International Conference on Networking and Network Applications (NaNA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsa/2013/5045/0/5045a013",
"title": "Distributed Topology-Based Resource Allocation for a Femtocell-Based Cellular Network",
"doi": null,
"abstractUrl": "/proceedings-article/iccsa/2013/5045a013/12OmNBqv27o",
"parentPublication": {
"id": "proceedings/iccsa/2013/5045/0",
"title": "2013 13th International Conference on Computational Science and Its Applications (ICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-icess/2012/4749/0/4749a740",
"title": "Two-tier Cellular Networks with Frequency Selective Surface",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-icess/2012/4749a740/12OmNC3FGdG",
"parentPublication": {
"id": "proceedings/hpcc-icess/2012/4749/0",
"title": "High Performance Computing and Communication & IEEE International Conference on Embedded Software and Systems, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit-iucc-dasc-picom/2015/0154/0/07363050",
"title": "Channel-Aware Scheduling in FFR-Aided OFDMA-Based Heterogeneous Cellular Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cit-iucc-dasc-picom/2015/07363050/12OmNrMZpuD",
"parentPublication": {
"id": "proceedings/cit-iucc-dasc-picom/2015/0154/0",
"title": "2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing (CIT/IUCC/DASC/PICOM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/synasc/2014/8447/0/07034734",
"title": "Efficient Computation of Simplicial Homology through Acyclic Matching",
"doi": null,
"abstractUrl": "/proceedings-article/synasc/2014/07034734/12OmNxFJXQA",
"parentPublication": {
"id": "proceedings/synasc/2014/8447/0",
"title": "2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/chinacom/2012/2698/0/06417539",
"title": "A Pseudo-Random Subchannel Selection scheme for downlink interference mitigation in two-tier cellular networks",
"doi": null,
"abstractUrl": "/proceedings-article/chinacom/2012/06417539/12OmNznkJWu",
"parentPublication": {
"id": "proceedings/chinacom/2012/2698/0",
"title": "7th International Conference on Communications and Networking in China",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2014/04/06582689",
"title": "iDEAL: Incentivized Dynamic Cellular Offloading via Auctions",
"doi": null,
"abstractUrl": "/journal/nt/2014/04/06582689/13rRUwj7csj",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2015/06/06863696",
"title": "Homology-based distributed coverage hole detection in wireless sensor networks",
"doi": null,
"abstractUrl": "/journal/nt/2015/06/06863696/13rRUxlgxQz",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ithings-greencom-cpscom-smartdata/2017/3066/0/08276838",
"title": "An Association Approach that Combines Resource Consumption and Load Balancing in Heterogeneous Cellular Networks",
"doi": null,
"abstractUrl": "/proceedings-article/ithings-greencom-cpscom-smartdata/2017/08276838/17D45WB0qe4",
"parentPublication": {
"id": "proceedings/ithings-greencom-cpscom-smartdata/2017/3066/0",
"title": "2017 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09995365",
"title": "Single-Cell Topological Simplicial Analysis Reveals Higher-Order Cellular Complexity",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995365/1JC30s8gebu",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06909006",
"articleId": "13rRUxDIthW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06923478",
"articleId": "13rRUIM2VCl",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwGqBqs",
"title": "June",
"year": "2017",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyeTVi7",
"doi": "10.1109/TVCG.2017.2674918",
"abstract": "The use of large-scale scientific simulations that can represent physical systems using both particle and volume data simultaneously is gaining popularity as each of these reference frames has an inherent set of advantages when studying different phenomena. Furthermore, being able to study the dynamic evolution of these time varying data types is an integral part of nearly all scientific endeavors. However, the techniques available to scientists generally limit them to studying each reference frame separately making it difficult to draw connections between the two. In this work we present a novel method of feature exploration that can be used to investigate spatio-temporal patterns in both data types simultaneously. More specifically, we focus on how spatio-temporal subsets can be identified from both reference frames, and develop new ways of visually presenting the embedded information to a user in an intuitive manner. We demonstrate the effectiveness of our method using case studies of real world scientific datasets and illustrate the new types of exploration and analyses that can be achieved through this technique.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The use of large-scale scientific simulations that can represent physical systems using both particle and volume data simultaneously is gaining popularity as each of these reference frames has an inherent set of advantages when studying different phenomena. Furthermore, being able to study the dynamic evolution of these time varying data types is an integral part of nearly all scientific endeavors. However, the techniques available to scientists generally limit them to studying each reference frame separately making it difficult to draw connections between the two. In this work we present a novel method of feature exploration that can be used to investigate spatio-temporal patterns in both data types simultaneously. More specifically, we focus on how spatio-temporal subsets can be identified from both reference frames, and develop new ways of visually presenting the embedded information to a user in an intuitive manner. We demonstrate the effectiveness of our method using case studies of real world scientific datasets and illustrate the new types of exploration and analyses that can be achieved through this technique.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The use of large-scale scientific simulations that can represent physical systems using both particle and volume data simultaneously is gaining popularity as each of these reference frames has an inherent set of advantages when studying different phenomena. Furthermore, being able to study the dynamic evolution of these time varying data types is an integral part of nearly all scientific endeavors. However, the techniques available to scientists generally limit them to studying each reference frame separately making it difficult to draw connections between the two. In this work we present a novel method of feature exploration that can be used to investigate spatio-temporal patterns in both data types simultaneously. More specifically, we focus on how spatio-temporal subsets can be identified from both reference frames, and develop new ways of visually presenting the embedded information to a user in an intuitive manner. We demonstrate the effectiveness of our method using case studies of real world scientific datasets and illustrate the new types of exploration and analyses that can be achieved through this technique.",
"title": "Spatio-Temporal Feature Exploration in Combined Particle/Volume Reference Frames",
"normalizedTitle": "Spatio-Temporal Feature Exploration in Combined Particle/Volume Reference Frames",
"fno": "07864476",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Data Models",
"Trajectory",
"Computational Modeling",
"Couplings",
"Visualization",
"Feature Extraction",
"Particle Data",
"Volume Data",
"Feature Exploration",
"Spatio Temporal Analysis"
],
"authors": [
{
"givenName": "Franz",
"surname": "Sauer",
"fullName": "Franz Sauer",
"affiliation": "Department of Computer Science, University of California, Davis, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kwan-Liu",
"surname": "Ma",
"fullName": "Kwan-Liu Ma",
"affiliation": "Department of Computer Science, University of California, Davis, CA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2017-06-01 00:00:00",
"pubType": "trans",
"pages": "1624-1635",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccvw/2013/3022/0/3022a420",
"title": "A Spatio-temporal Feature Based on Triangulation of Dense SURF",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2013/3022a420/12OmNBbJTne",
"parentPublication": {
"id": "proceedings/iccvw/2013/3022/0",
"title": "2013 IEEE International Conference on Computer Vision Workshops (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2010/4256/0/4256b217",
"title": "Spatial and Spatio-temporal Data Mining",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2010/4256b217/12OmNCgrDcQ",
"parentPublication": {
"id": "proceedings/icdm/2010/4256/0",
"title": "2010 IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdcat/2011/4564/0/06118965",
"title": "Reference metadata extraction from scientific papers",
"doi": null,
"abstractUrl": "/proceedings-article/pdcat/2011/06118965/12OmNxTEiTg",
"parentPublication": {
"id": "proceedings/pdcat/2011/4564/0",
"title": "Parallel and Distributed Computing Applications and Technologies, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msr/2015/5594/0/5594a202",
"title": "Ecosystems in GitHub and a Method for Ecosystem Identification Using Reference Coupling",
"doi": null,
"abstractUrl": "/proceedings-article/msr/2015/5594a202/12OmNz61div",
"parentPublication": {
"id": "proceedings/msr/2015/5594/0",
"title": "2015 IEEE/ACM 12th Working Conference on Mining Software Repositories (MSR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/05/07420745",
"title": "Embedding Spatio-Temporal Information into Maps by Route-Zooming",
"doi": null,
"abstractUrl": "/journal/tg/2017/05/07420745/13rRUwd9CLS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/10/07676418",
"title": "A Combined Eulerian-Lagrangian Data Representation for Large-Scale Applications",
"doi": null,
"abstractUrl": "/journal/tg/2017/10/07676418/13rRUxC0SOZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2018/9288/0/928800a572",
"title": "A Comparative Study of Urban Mobility Patterns Using Large-Scale Spatio-Temporal Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2018/928800a572/18jXF1iMjLi",
"parentPublication": {
"id": "proceedings/icdmw/2018/9288/0",
"title": "2018 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2020/11/08704961",
"title": "Reference-Based Framework for Spatio-Temporal Trajectory Compression and Query Processing",
"doi": null,
"abstractUrl": "/journal/tk/2020/11/08704961/19HKOhQ8WE8",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/08/09204396",
"title": "Deep Learning for Spatio-Temporal Data Mining: A Survey",
"doi": null,
"abstractUrl": "/journal/tk/2022/08/09204396/1nkyTK35x1S",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/09/09324971",
"title": "Tracking Internal Frames of Reference for Consistent Molecular Distribution Functions",
"doi": null,
"abstractUrl": "/journal/tg/2022/09/09324971/1qnQDMKryUw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07864470",
"articleId": "13rRUxlgxTq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07429778",
"articleId": "13rRUwjGoG9",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1LUpyYLBfeo",
"title": "May",
"year": "2023",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1LdkjHapKW4",
"doi": "10.1109/TVCG.2023.3247084",
"abstract": "Standalone Virtual Reality (VR) headsets can be used when travelling in cars, trains and planes. However, the constrained spaces around transport seating can leave users with little physical space in which to interact using their hands or controllers, and can increase the risk of invading other passengers' personal space or hitting nearby objects and surfaces. This hinders transport VR users from using most commercial VR applications, which are designed for unobstructed 1-2m 360° home spaces. In this paper, we investigated whether three at-a-distance interaction techniques from the literature could be adapted to support common commercial VR movement inputs and so equalise the interaction capabilities of at-home and on-transport users: Linear Gain, Gaze-Supported Remote Hand, and AlphaCursor. First, we analysed commercial VR experiences to identify the most common movement inputs so that we could create gamified tasks based on them. We then investigated how well each technique could support these inputs from a constrained Z_$50\\mathrm{x}50\\text{cm}$_Z space (representative of an economy plane seat) through a user study Z_$(\\mathrm{N}=16)$_Z, where participants played all three games with each technique. We measured task performance, unsafe movements (play boundary violations, total arm movement) and subjective experience and compared results to a control ‘at-home’ condition (with unconstrained movement) to determine how similar performance and experience were. Results showed that Linear Gain was the best technique, with similar performance and user experience to the ‘at-home’ condition, albeit at the expense of a high number of boundary violations and large arm movements. In contrast, AlphaCursor kept users within bounds and minimised arm movement, but suffered from poorer performance and experience. Based on the results, we provide eight guidelines for the use of, and research into, at-a-distance techniques and constrained spaces.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Standalone Virtual Reality (VR) headsets can be used when travelling in cars, trains and planes. However, the constrained spaces around transport seating can leave users with little physical space in which to interact using their hands or controllers, and can increase the risk of invading other passengers' personal space or hitting nearby objects and surfaces. This hinders transport VR users from using most commercial VR applications, which are designed for unobstructed 1-2m 360° home spaces. In this paper, we investigated whether three at-a-distance interaction techniques from the literature could be adapted to support common commercial VR movement inputs and so equalise the interaction capabilities of at-home and on-transport users: Linear Gain, Gaze-Supported Remote Hand, and AlphaCursor. First, we analysed commercial VR experiences to identify the most common movement inputs so that we could create gamified tasks based on them. We then investigated how well each technique could support these inputs from a constrained $50\\mathrm{x}50\\text{cm}$ space (representative of an economy plane seat) through a user study $(\\mathrm{N}=16)$, where participants played all three games with each technique. We measured task performance, unsafe movements (play boundary violations, total arm movement) and subjective experience and compared results to a control ‘at-home’ condition (with unconstrained movement) to determine how similar performance and experience were. Results showed that Linear Gain was the best technique, with similar performance and user experience to the ‘at-home’ condition, albeit at the expense of a high number of boundary violations and large arm movements. In contrast, AlphaCursor kept users within bounds and minimised arm movement, but suffered from poorer performance and experience. Based on the results, we provide eight guidelines for the use of, and research into, at-a-distance techniques and constrained spaces.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Standalone Virtual Reality (VR) headsets can be used when travelling in cars, trains and planes. However, the constrained spaces around transport seating can leave users with little physical space in which to interact using their hands or controllers, and can increase the risk of invading other passengers' personal space or hitting nearby objects and surfaces. This hinders transport VR users from using most commercial VR applications, which are designed for unobstructed 1-2m 360° home spaces. In this paper, we investigated whether three at-a-distance interaction techniques from the literature could be adapted to support common commercial VR movement inputs and so equalise the interaction capabilities of at-home and on-transport users: Linear Gain, Gaze-Supported Remote Hand, and AlphaCursor. First, we analysed commercial VR experiences to identify the most common movement inputs so that we could create gamified tasks based on them. We then investigated how well each technique could support these inputs from a constrained - space (representative of an economy plane seat) through a user study -, where participants played all three games with each technique. We measured task performance, unsafe movements (play boundary violations, total arm movement) and subjective experience and compared results to a control ‘at-home’ condition (with unconstrained movement) to determine how similar performance and experience were. Results showed that Linear Gain was the best technique, with similar performance and user experience to the ‘at-home’ condition, albeit at the expense of a high number of boundary violations and large arm movements. In contrast, AlphaCursor kept users within bounds and minimised arm movement, but suffered from poorer performance and experience. Based on the results, we provide eight guidelines for the use of, and research into, at-a-distance techniques and constrained spaces.",
"title": "A Lack of Restraint: Comparing Virtual Reality Interaction Techniques for Constrained Transport Seating",
"normalizedTitle": "A Lack of Restraint: Comparing Virtual Reality Interaction Techniques for Constrained Transport Seating",
"fno": "10058530",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Human Factors",
"User Experience",
"Virtual Reality",
"Alpha Cursor",
"At A Distance Interaction Techniques",
"Commercial VR Applications",
"Constrained Spaces",
"Constrained Transport Seating",
"Gaze Supported Remote Hand",
"Linear Gain",
"On Transport Users",
"Physical Space",
"Play Boundary Violations",
"Standalone Virtual Reality Headsets",
"Total Arm Movement",
"Transport VR Users",
"Unconstrained Movement",
"User Experience",
"Virtual Reality Interaction",
"Aerospace Electronics",
"Task Analysis",
"Automobiles",
"Space Exploration",
"Games",
"X Reality",
"Weapons",
"Virtual Reality",
"Interaction",
"Constrained Spaces",
"Transport"
],
"authors": [
{
"givenName": "Graham",
"surname": "Wilson",
"fullName": "Graham Wilson",
"affiliation": "School of Computing Science, University of Glasgow, Glasgow, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mark",
"surname": "McGill",
"fullName": "Mark McGill",
"affiliation": "School of Computing Science, University of Glasgow, Glasgow, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Medeiros",
"fullName": "Daniel Medeiros",
"affiliation": "School of Computing Science, University of Glasgow, Glasgow, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stephen",
"surname": "Brewster",
"fullName": "Stephen Brewster",
"affiliation": "School of Computing Science, University of Glasgow, Glasgow, UK",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2023-05-01 00:00:00",
"pubType": "trans",
"pages": "2390-2400",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2018/3365/0/08446551",
"title": "A Demonstration of ShareVR: Co-Located Experiences for Virtual Reality Between HMD and Non-HMD Users",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446551/13bd1gzWkQD",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbgames/2018/9605/0/960500a067",
"title": "Controlling First-Person Character Movement: A Low-Cost Camera-based Tracking Alternative for Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/sbgames/2018/960500a067/17D45WK5AqA",
"parentPublication": {
"id": "proceedings/sbgames/2018/9605/0",
"title": "2018 17th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cic/2021/1625/0/162500a011",
"title": "A Collaborative and Adaptive Feedback System for Physical Exercises",
"doi": null,
"abstractUrl": "/proceedings-article/cic/2021/162500a011/1AZOK8jGMZq",
"parentPublication": {
"id": "proceedings/cic/2021/1625/0",
"title": "2021 IEEE 7th International Conference on Collaboration and Internet Computing (CIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a238",
"title": "Comparing Teleportation Methods for Travel in Everyday Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a238/1CJdYyJV76E",
"parentPublication": {
"id": "proceedings/vrw/2022/8402/0",
"title": "2022 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a574",
"title": "Enabling Virtual Reality Interactions in Confined Spaces by Re-Associating Finger Motions",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a574/1CJeyGjSZCo",
"parentPublication": {
"id": "proceedings/vrw/2022/8402/0",
"title": "2022 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2022/5325/0/532500a404",
"title": "Comparing the Fidelity of Contemporary Pointing with Controller Interactions on Performance of Personal Space Target Selection",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2022/532500a404/1JrRlimqMKc",
"parentPublication": {
"id": "proceedings/ismar/2022/5325/0",
"title": "2022 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2022/5325/0/532500a758",
"title": "Infinite Virtual Space Exploration Using Space Tiling and Perceivable Reset at Fixed Positions",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2022/532500a758/1JrRneazFCw",
"parentPublication": {
"id": "proceedings/ismar/2022/5325/0",
"title": "2022 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/05/10049631",
"title": "The Design Space of the Auditory Representation of Objects and Their Behaviours in Virtual Reality for Blind People",
"doi": null,
"abstractUrl": "/journal/tg/2023/05/10049631/1KYouFY43ks",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2020/8508/0/850800a608",
"title": "Walking and Teleportation in Wide-area Virtual Reality Experiences",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2020/850800a608/1pysv8bIfrG",
"parentPublication": {
"id": "proceedings/ismar/2020/8508/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icris/2020/1969/0/196900a142",
"title": "VR interactive game design based on unity3d engine",
"doi": null,
"abstractUrl": "/proceedings-article/icris/2020/196900a142/1wG5UNVdvkA",
"parentPublication": {
"id": "proceedings/icris/2020/1969/0",
"title": "2020 International Conference on Robots & Intelligent System (ICRIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10049677",
"articleId": "1KYooKy1LAQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10049655",
"articleId": "1KYouwvCMBa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzSQdiI",
"title": "August",
"year": "1997",
"issueNum": "08",
"idPrefix": "tp",
"pubType": "journal",
"volume": "19",
"label": "August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvgz5q",
"doi": "10.1109/34.608276",
"abstract": "Abstract—In several applications where binary contours are used to represent and classify patterns, smoothing must be performed to attenuate noise and quantization error. This is often implemented with local weighted averaging of contour point coordinates, because of the simplicity, low-cost and effectiveness of such methods. Invoking the \"optimality\" of the Gaussian filter, many authors will use Gaussian-derived weights. But generally these filters are not optimal, and there has been little theoretical investigation of local weighted averaging methods per se. This paper focuses on the direct derivation of optimal local weighted averaging methods tailored towards specific computational goals such as the accurate estimation of contour point positions, tangent slopes, or deviation angles. A new and simple digitization noise model is proposed to derive the best set of weights for different window sizes, for each computational task. Estimates of the fraction of the noise actually removed by these optimum weights are also obtained. Finally, the applicability of these findings for arbitrary curvature is verified, by numerically investigating equivalent problems for digital circles of various radii.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—In several applications where binary contours are used to represent and classify patterns, smoothing must be performed to attenuate noise and quantization error. This is often implemented with local weighted averaging of contour point coordinates, because of the simplicity, low-cost and effectiveness of such methods. Invoking the \"optimality\" of the Gaussian filter, many authors will use Gaussian-derived weights. But generally these filters are not optimal, and there has been little theoretical investigation of local weighted averaging methods per se. This paper focuses on the direct derivation of optimal local weighted averaging methods tailored towards specific computational goals such as the accurate estimation of contour point positions, tangent slopes, or deviation angles. A new and simple digitization noise model is proposed to derive the best set of weights for different window sizes, for each computational task. Estimates of the fraction of the noise actually removed by these optimum weights are also obtained. Finally, the applicability of these findings for arbitrary curvature is verified, by numerically investigating equivalent problems for digital circles of various radii.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—In several applications where binary contours are used to represent and classify patterns, smoothing must be performed to attenuate noise and quantization error. This is often implemented with local weighted averaging of contour point coordinates, because of the simplicity, low-cost and effectiveness of such methods. Invoking the \"optimality\" of the Gaussian filter, many authors will use Gaussian-derived weights. But generally these filters are not optimal, and there has been little theoretical investigation of local weighted averaging methods per se. This paper focuses on the direct derivation of optimal local weighted averaging methods tailored towards specific computational goals such as the accurate estimation of contour point positions, tangent slopes, or deviation angles. A new and simple digitization noise model is proposed to derive the best set of weights for different window sizes, for each computational task. Estimates of the fraction of the noise actually removed by these optimum weights are also obtained. Finally, the applicability of these findings for arbitrary curvature is verified, by numerically investigating equivalent problems for digital circles of various radii.",
"title": "Optimal Local Weighted Averaging Methods in Contour Smoothing",
"normalizedTitle": "Optimal Local Weighted Averaging Methods in Contour Smoothing",
"fno": "i0801",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Contour Smoothing Optimal Local Weighted Averaging Digitization Noise Modeling Gaussian Smoothing"
],
"authors": [
{
"givenName": "Raymond",
"surname": "Legault",
"fullName": "Raymond Legault",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ching Y.",
"surname": "Suen",
"fullName": "Ching Y. Suen",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "1997-08-01 00:00:00",
"pubType": "trans",
"pages": "801-817",
"year": "1997",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "i0818",
"articleId": "13rRUx0geqU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvsDHDY",
"title": "Jan.",
"year": "2020",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1dtMPLotlKg",
"doi": "10.1109/TVCG.2019.2934535",
"abstract": "We propose BarcodeTree (BCT), a novel visualization technique for comparing topological structures and node attribute values of multiple trees. BCT can provide an overview of one hundred shallow and stable trees simultaneously, without aggregating individual nodes. Each BCT is shown within a single row using a style similar to a barcode, allowing trees to be stacked vertically with matching nodes aligned horizontally to ease comparison and maintain space efficiency. We design several visual cues and interactive techniques to help users understand the topological structure and compare trees. In an experiment comparing two variants of BCT with icicle plots, the results suggest that BCTs make it easier to visually compare trees by reducing the vertical distance between different trees. We also present two case studies involving a dataset of hundreds of trees to demonstrate BCT's utility.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose BarcodeTree (BCT), a novel visualization technique for comparing topological structures and node attribute values of multiple trees. BCT can provide an overview of one hundred shallow and stable trees simultaneously, without aggregating individual nodes. Each BCT is shown within a single row using a style similar to a barcode, allowing trees to be stacked vertically with matching nodes aligned horizontally to ease comparison and maintain space efficiency. We design several visual cues and interactive techniques to help users understand the topological structure and compare trees. In an experiment comparing two variants of BCT with icicle plots, the results suggest that BCTs make it easier to visually compare trees by reducing the vertical distance between different trees. We also present two case studies involving a dataset of hundreds of trees to demonstrate BCT's utility.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose BarcodeTree (BCT), a novel visualization technique for comparing topological structures and node attribute values of multiple trees. BCT can provide an overview of one hundred shallow and stable trees simultaneously, without aggregating individual nodes. Each BCT is shown within a single row using a style similar to a barcode, allowing trees to be stacked vertically with matching nodes aligned horizontally to ease comparison and maintain space efficiency. We design several visual cues and interactive techniques to help users understand the topological structure and compare trees. In an experiment comparing two variants of BCT with icicle plots, the results suggest that BCTs make it easier to visually compare trees by reducing the vertical distance between different trees. We also present two case studies involving a dataset of hundreds of trees to demonstrate BCT's utility.",
"title": "BarcodeTree: Scalable Comparison of Multiple Hierarchies",
"normalizedTitle": "BarcodeTree: Scalable Comparison of Multiple Hierarchies",
"fno": "08845772",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Interactive Systems",
"Mathematics Computing",
"Trees Mathematics",
"Visual Cues",
"Interactive Techniques",
"Topological Structure",
"BCT",
"Visualization Technique",
"Barcode Tree",
"Vegetation",
"Visualization",
"Encoding",
"Task Analysis",
"Data Visualization",
"Layout",
"Libraries",
"Tree Visualization",
"Comparison",
"Multiple Trees"
],
"authors": [
{
"givenName": "Guozheng",
"surname": "Li",
"fullName": "Guozheng Li",
"affiliation": "Key Laboratory of Machine Perception (Ministry of Education), National Engineering Laboratory for Big Data Analysis and Application, Peking University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yu",
"surname": "Zhang",
"fullName": "Yu Zhang",
"affiliation": "University of Oxford, Peking University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yu",
"surname": "Dong",
"fullName": "Yu Dong",
"affiliation": "University of Technology, Sydney, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jie",
"surname": "Liang",
"fullName": "Jie Liang",
"affiliation": "University of Technology, Sydney, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jinson",
"surname": "Zhang",
"fullName": "Jinson Zhang",
"affiliation": "University of Technology, Sydney, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jinsong",
"surname": "Wang",
"fullName": "Jinsong Wang",
"affiliation": "Southwest Electric and Telecom Engineering Institute",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael J.",
"surname": "Mcguffin",
"fullName": "Michael J. Mcguffin",
"affiliation": "Ecole de technologie superieure, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaoru",
"surname": "Yuan",
"fullName": "Xiaoru Yuan",
"affiliation": "Key Laboratory of Machine Perception (Ministry of Education), National Engineering Laboratory for Big Data Analysis and Application, Peking University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "1022-1032",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2017/0831/0/0831a045",
"title": "Visualization Techniques for the Comparative Analysis of Weighted Free Trees",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2017/0831a045/12OmNBqMDzM",
"parentPublication": {
"id": "proceedings/iv/2017/0831/0",
"title": "2017 21st International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpc/2016/1428/0/07503712",
"title": "Identifying modularization patterns by visual comparison of multiple hierarchies",
"doi": null,
"abstractUrl": "/proceedings-article/icpc/2016/07503712/12OmNwJybPJ",
"parentPublication": {
"id": "proceedings/icpc/2016/1428/0",
"title": "2016 IEEE 24th International Conference on Program Comprehension (ICPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2001/1342/0/13420131",
"title": "A Comparison of 2-D Visualizations of Hierarchies",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2001/13420131/12OmNxGALae",
"parentPublication": {
"id": "proceedings/ieee-infovis/2001/1342/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vissoft/2018/8292/0/829200a096",
"title": "Quantitative Comparison of Dynamic Treemaps for Software Evolution Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vissoft/2018/829200a096/17D45VsBU7n",
"parentPublication": {
"id": "proceedings/vissoft/2018/8292/0",
"title": "2018 IEEE Working Conference on Software Visualization (VISSOFT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/09/08636969",
"title": "Aggregated Dendrograms for Visual Comparison between Many Phylogenetic Trees",
"doi": null,
"abstractUrl": "/journal/tg/2020/09/08636969/17D45WXIkG8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10122175",
"title": "A Scalable Method for Readable Tree Layouts",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10122175/1N0swtOjW4U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933606",
"title": "Overlap-Free Drawing of Generalized Pythagoras Trees for Hierarchy Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933606/1fTgJHbs9pu",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933545",
"title": "Interactive Visualisation of Hierarchical Quantitative Data: An Evaluation",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933545/1fTgJVRcxig",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08794553",
"title": "A Structural Average of Labeled Merge Trees for Uncertainty Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08794553/1fe7uYD8R68",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/08/08998355",
"title": "SplitStreams: A Visual Metaphor for Evolving Hierarchies",
"doi": null,
"abstractUrl": "/journal/tg/2021/08/08998355/1hpPDOGZKzm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08807320",
"articleId": "1cG6vb0dTG0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08807238",
"articleId": "1cG66qf6MKs",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1rvygosnS8M",
"title": "April",
"year": "2021",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1eBufO7qLle",
"doi": "10.1109/TVCG.2019.2948616",
"abstract": "As data sets grow to exascale, automated data analysis and visualization are increasingly important, to intermediate human understanding and to reduce demands on disk storage via in situ analysis. Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems. One of the principal analytic tools is the contour tree, which analyses relationships between contours to identify features of more than local importance. Unfortunately, the predominant algorithms for computing the contour tree are explicitly serial, and founded on serial metaphors, which has limited the scalability of this form of analysis. While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with fast practical performance. We report the first shared SMP algorithm for fully parallel contour tree computation, with formal guarantees of O(lg V lgt) parallel steps and O(V lg V) work for data with V samples and t contour tree supernodes, and implementations with more than 30× parallel speed up on both CPU using TBB and GPU using Thrust and up 70× speed up compared to the serial sweep and merge algorithm.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As data sets grow to exascale, automated data analysis and visualization are increasingly important, to intermediate human understanding and to reduce demands on disk storage via in situ analysis. Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems. One of the principal analytic tools is the contour tree, which analyses relationships between contours to identify features of more than local importance. Unfortunately, the predominant algorithms for computing the contour tree are explicitly serial, and founded on serial metaphors, which has limited the scalability of this form of analysis. While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with fast practical performance. We report the first shared SMP algorithm for fully parallel contour tree computation, with formal guarantees of O(lg V lgt) parallel steps and O(V lg V) work for data with V samples and t contour tree supernodes, and implementations with more than 30× parallel speed up on both CPU using TBB and GPU using Thrust and up 70× speed up compared to the serial sweep and merge algorithm.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As data sets grow to exascale, automated data analysis and visualization are increasingly important, to intermediate human understanding and to reduce demands on disk storage via in situ analysis. Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems. One of the principal analytic tools is the contour tree, which analyses relationships between contours to identify features of more than local importance. Unfortunately, the predominant algorithms for computing the contour tree are explicitly serial, and founded on serial metaphors, which has limited the scalability of this form of analysis. While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with fast practical performance. We report the first shared SMP algorithm for fully parallel contour tree computation, with formal guarantees of O(lg V lgt) parallel steps and O(V lg V) work for data with V samples and t contour tree supernodes, and implementations with more than 30× parallel speed up on both CPU using TBB and GPU using Thrust and up 70× speed up compared to the serial sweep and merge algorithm.",
"title": "Scalable Contour Tree Computation by Data Parallel Peak Pruning",
"normalizedTitle": "Scalable Contour Tree Computation by Data Parallel Peak Pruning",
"fno": "08889727",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Complexity",
"Coprocessors",
"Data Analysis",
"Data Visualisation",
"Graphics Processing Units",
"Multiprocessing Systems",
"Parallel Processing",
"Trees Mathematics",
"Scalable Contour Tree Computation",
"Data Parallel Peak",
"Data Sets",
"Automated Data Analysis",
"Visualization",
"Intermediate Human Understanding",
"Disk Storage",
"High Performance Computing Systems",
"Analysis Algorithms",
"Massively Multicore",
"Distributed Systems",
"Principal Analytic Tools",
"Local Importance",
"Predominant Algorithms",
"Serial Metaphors",
"Hybrid GPU CPU Computation",
"Strong Formal Guarantees",
"Fast Practical Performance",
"Shared SMP Algorithm",
"Parallel Steps",
"Tree Supernodes",
"30 X 00 D 7 Parallel Speed",
"Vegetation",
"Computational Modeling",
"Data Models",
"Data Analysis",
"Parallel Processing",
"Isosurfaces",
"Topological Analysis",
"Contour Tree",
"Merge Tree",
"Data Parallel Algorithms",
"Computer Graphics",
"Computational Geometry And Object Modeling",
"Curve",
"Surface",
"Solid And Object Representations",
"Simulation And Modeling",
"Simulation Output Analysis"
],
"authors": [
{
"givenName": "Hamish A.",
"surname": "Carr",
"fullName": "Hamish A. Carr",
"affiliation": "University of Leeds, Leeds, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gunther H.",
"surname": "Weber",
"fullName": "Gunther H. Weber",
"affiliation": "Lawrence Berkeley National Laboratory, Computational Research Division, Berkeley, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christopher M.",
"surname": "Sewell",
"fullName": "Christopher M. Sewell",
"affiliation": "Los Alamos National Laboratory, Los Alamos, NM, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Oliver",
"surname": "Rübel",
"fullName": "Oliver Rübel",
"affiliation": "Lawrence Berkeley National Laboratory, Computational Research Division, Berkeley, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Patricia",
"surname": "Fasel",
"fullName": "Patricia Fasel",
"affiliation": "Los Alamos National Laboratory, Los Alamos, NM, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "James P.",
"surname": "Ahrens",
"fullName": "James P. Ahrens",
"affiliation": "Los Alamos National Laboratory, Los Alamos, NM, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2021-04-01 00:00:00",
"pubType": "trans",
"pages": "2437-2454",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icicis/2011/1561/0/06063247",
"title": "Importance Driven Contour Tree Simplification",
"doi": null,
"abstractUrl": "/proceedings-article/icicis/2011/06063247/12OmNB1eJEi",
"parentPublication": {
"id": "proceedings/icicis/2011/1561/0",
"title": "2011 International Conference on Internet Computing and Information Services (ICICIS 2011)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icci/1992/2812/0/00227710",
"title": "Algorithms for a k-tree core of a tree",
"doi": null,
"abstractUrl": "/proceedings-article/icci/1992/00227710/12OmNBtl1Bq",
"parentPublication": {
"id": "proceedings/icci/1992/2812/0",
"title": "1992 Fourth International Conference on Computing and Information",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2015/6879/0/07156387",
"title": "A parallel and memory efficient algorithm for constructing the contour tree",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156387/12OmNCmpcV5",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498pascucci",
"title": "Efficient Computation of the Topology of Level Sets",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498pascucci/12OmNvkpl7Y",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2016/5659/0/07874333",
"title": "Contour forests: Fast multi-threaded augmented contour trees",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2016/07874333/12OmNx9FhTQ",
"parentPublication": {
"id": "proceedings/ldav/2016/5659/0",
"title": "2016 IEEE 6th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2016/5659/0/07874312",
"title": "Parallel peak pruning for scalable SMP contour tree computation",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2016/07874312/12OmNzYwcb1",
"parentPublication": {
"id": "proceedings/ldav/2016/5659/0",
"title": "2016 IEEE 6th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061177",
"title": "Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061177/13rRUyY28Yo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2019/08/08637719",
"title": "Task-Based Augmented Contour Trees with Fibonacci Heaps",
"doi": null,
"abstractUrl": "/journal/td/2019/08/08637719/17D45VsBU7G",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2020/8468/0/846800a012",
"title": "Data Parallel Hypersweeps for in Situ Topological Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2020/846800a012/1pZ0Ty0tRU4",
"parentPublication": {
"id": "proceedings/ldav/2020/8468/0",
"title": "2020 IEEE 10th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/10/09372897",
"title": "Optimization and Augmentation for Data Parallel Contour Trees",
"doi": null,
"abstractUrl": "/journal/tg/2022/10/09372897/1rNP1agwwco",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08877764",
"articleId": "1emy95qb1NS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08901998",
"articleId": "1eYNalb5kQM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvsDHDY",
"title": "Jan.",
"year": "2020",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1eX8ARELiX6",
"doi": "10.1109/TVCG.2019.2934257",
"abstract": "Topological approaches to data analysis can answer complex questions about the number, connectivity, and scale of intrinsic features in scalar data. However, the global nature of many topological structures makes their computation challenging at scale, and thus often limits the size of data that can be processed. One key quality to achieving scalability and performance on modern architectures is data locality, i.e., a process operates on data that resides in a nearby memory system, avoiding frequent jumps in data access patterns. From this perspective, topological computations are particularly challenging because the implied data structures represent features that can span the entire data set, often requiring a global traversal phase that limits their scalability. Traditionally, expensive preprocessing is considered an acceptable trade-off as it accelerates all subsequent queries. Most published use cases, however, explore only a fraction of all possible queries, most often those returning small, local features. In these cases, much of the global information is not utilized, yet computing it dominates the overall response time. We address this challenge for merge trees, one of the most commonly used topological structures. In particular, we propose an alternative representation, the merge forest, a collection of local trees corresponding to regions in a domain decomposition. Local trees are connected by a bridge set that allows us to recover any necessary global information at query time. The resulting system couples (i) a preprocessing that scales linearly in practice with (ii) fast runtime queries that provide the same functionality as traditional queries of a global merge tree. We test the scalability of our approach on a shared-memory parallel computer and demonstrate how data structure locality enables the analysis of large data with an order of magnitude performance improvement over the status quo. Furthermore, a merge forest reduces the memory overhead compared to a global merge tree and enables the processing of data sets that are an order of magnitude larger than possible with previous algorithms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Topological approaches to data analysis can answer complex questions about the number, connectivity, and scale of intrinsic features in scalar data. However, the global nature of many topological structures makes their computation challenging at scale, and thus often limits the size of data that can be processed. One key quality to achieving scalability and performance on modern architectures is data locality, i.e., a process operates on data that resides in a nearby memory system, avoiding frequent jumps in data access patterns. From this perspective, topological computations are particularly challenging because the implied data structures represent features that can span the entire data set, often requiring a global traversal phase that limits their scalability. Traditionally, expensive preprocessing is considered an acceptable trade-off as it accelerates all subsequent queries. Most published use cases, however, explore only a fraction of all possible queries, most often those returning small, local features. In these cases, much of the global information is not utilized, yet computing it dominates the overall response time. We address this challenge for merge trees, one of the most commonly used topological structures. In particular, we propose an alternative representation, the merge forest, a collection of local trees corresponding to regions in a domain decomposition. Local trees are connected by a bridge set that allows us to recover any necessary global information at query time. The resulting system couples (i) a preprocessing that scales linearly in practice with (ii) fast runtime queries that provide the same functionality as traditional queries of a global merge tree. We test the scalability of our approach on a shared-memory parallel computer and demonstrate how data structure locality enables the analysis of large data with an order of magnitude performance improvement over the status quo. Furthermore, a merge forest reduces the memory overhead compared to a global merge tree and enables the processing of data sets that are an order of magnitude larger than possible with previous algorithms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Topological approaches to data analysis can answer complex questions about the number, connectivity, and scale of intrinsic features in scalar data. However, the global nature of many topological structures makes their computation challenging at scale, and thus often limits the size of data that can be processed. One key quality to achieving scalability and performance on modern architectures is data locality, i.e., a process operates on data that resides in a nearby memory system, avoiding frequent jumps in data access patterns. From this perspective, topological computations are particularly challenging because the implied data structures represent features that can span the entire data set, often requiring a global traversal phase that limits their scalability. Traditionally, expensive preprocessing is considered an acceptable trade-off as it accelerates all subsequent queries. Most published use cases, however, explore only a fraction of all possible queries, most often those returning small, local features. In these cases, much of the global information is not utilized, yet computing it dominates the overall response time. We address this challenge for merge trees, one of the most commonly used topological structures. In particular, we propose an alternative representation, the merge forest, a collection of local trees corresponding to regions in a domain decomposition. Local trees are connected by a bridge set that allows us to recover any necessary global information at query time. The resulting system couples (i) a preprocessing that scales linearly in practice with (ii) fast runtime queries that provide the same functionality as traditional queries of a global merge tree. We test the scalability of our approach on a shared-memory parallel computer and demonstrate how data structure locality enables the analysis of large data with an order of magnitude performance improvement over the status quo. Furthermore, a merge forest reduces the memory overhead compared to a global merge tree and enables the processing of data sets that are an order of magnitude larger than possible with previous algorithms.",
"title": "Toward Localized Topological Data Structures: Querying the Forest for the Tree",
"normalizedTitle": "Toward Localized Topological Data Structures: Querying the Forest for the Tree",
"fno": "08794560",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Query Processing",
"Shared Memory Systems",
"Telecommunication Network Topology",
"Tree Data Structures",
"Localized Topological Data Structures",
"Data Sets",
"Data Structure Locality",
"Shared Memory Parallel Computer",
"Query Time",
"Necessary Global Information",
"Local Trees",
"Local Features",
"Possible Queries",
"Global Traversal Phase",
"Implied Data Structures",
"Topological Computations",
"Data Access Patterns",
"Nearby Memory System",
"Data Locality",
"Scalar Data",
"Intrinsic Features",
"Complex Questions",
"Data Analysis",
"Vegetation",
"Forestry",
"Feature Extraction",
"Data Structures",
"Scalability",
"Acceleration",
"Task Analysis",
"Merge Tree",
"Parallel Computation",
"Topology"
],
"authors": [
{
"givenName": "Pavol",
"surname": "Klacansky",
"fullName": "Pavol Klacansky",
"affiliation": "Scientific Computing and Imaging Institute, University of Utah",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Attila",
"surname": "Gyulassy",
"fullName": "Attila Gyulassy",
"affiliation": "Scientific Computing and Imaging Institute, University of Utah",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peer-Timo",
"surname": "Bremer",
"fullName": "Peer-Timo Bremer",
"affiliation": "Lawrence Livermore National Laboratory",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Valerio",
"surname": "Pascucci",
"fullName": "Valerio Pascucci",
"affiliation": "Scientific Computing and Imaging Institute, University of Utah",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "173-183",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sma/1997/7867/0/78670002",
"title": "Topological Modeling of Disordered Cellular Structures",
"doi": null,
"abstractUrl": "/proceedings-article/sma/1997/78670002/12OmNwcCIX1",
"parentPublication": {
"id": "proceedings/sma/1997/7867/0",
"title": "Shape Modeling and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2013/2576/0/06814978",
"title": "Fitting Multiple Curves to Point Clouds with Complicated Topological Structures",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2013/06814978/12OmNxwncAi",
"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/itng/2012/4654/0/4654a548",
"title": "XML Querying Using Data Logic Structures and Primitives",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2012/4654a548/12OmNzuZUDJ",
"parentPublication": {
"id": "proceedings/itng/2012/4654/0",
"title": "Information Technology: New Generations, Third International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/03/ttg2013030514",
"title": "Visualizing nD Point Clouds as Topological Landscape Profiles to Guide Local Data Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2013/03/ttg2013030514/13rRUxNEqPR",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/03/08698354",
"title": "Topological Modeling for Vector Graphics",
"doi": null,
"abstractUrl": "/magazine/cg/2019/03/08698354/19utOYR5h0k",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2022/2335/0/233500a121",
"title": "A Study of the Locality of Persistence-Based Queries and Its Implications for the Efficiency of Localized Data Structures",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2022/233500a121/1E2wgicmZGg",
"parentPublication": {
"id": "proceedings/pacificvis/2022/2335/0",
"title": "2022 IEEE 15th Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/04/08888210",
"title": "Semi-Supervised Topological Analysis for Elucidating Hidden Structures in High-Dimensional Transcriptome Datasets",
"doi": null,
"abstractUrl": "/journal/tb/2021/04/08888210/1ezPhjeK6S4",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08794553",
"title": "A Structural Average of Labeled Merge Trees for Uncertainty Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08794553/1fe7uYD8R68",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222093",
"title": "Localized Topological Simplification of Scalar Data",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222093/1nTrExzmT5e",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/08/09420248",
"title": "Unordered Task-Parallel Augmented Merge Tree Construction",
"doi": null,
"abstractUrl": "/journal/tg/2021/08/09420248/1tdUMuQErm0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08805451",
"articleId": "1cG4q4sh1bq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08807245",
"articleId": "1cG64NEzXUY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i4p7O935yU",
"name": "ttg202001-08794560s1.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202001-08794560s1.pdf",
"extension": "pdf",
"size": "8.2 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBpEeNu",
"title": "July-September",
"year": "2005",
"issueNum": "03",
"idPrefix": "mu",
"pubType": "magazine",
"volume": "12",
"label": "July-September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxCitGf",
"doi": "10.1109/MMUL.2005.54",
"abstract": "The rapid evolution of pervasive computing technologies enables bringing virtual heritage applications to a new level of user participation. A platform for interactive virtual heritage applications integrates a highend virtual reality system with wireless, connected portableand wearable computers, facilitating and enhancing user navigation, visualization control, and peer-to-peer information exchange.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The rapid evolution of pervasive computing technologies enables bringing virtual heritage applications to a new level of user participation. A platform for interactive virtual heritage applications integrates a highend virtual reality system with wireless, connected portableand wearable computers, facilitating and enhancing user navigation, visualization control, and peer-to-peer information exchange.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The rapid evolution of pervasive computing technologies enables bringing virtual heritage applications to a new level of user participation. A platform for interactive virtual heritage applications integrates a highend virtual reality system with wireless, connected portableand wearable computers, facilitating and enhancing user navigation, visualization control, and peer-to-peer information exchange.",
"title": "Pervasive Computing for Interactive Virtual Heritage",
"normalizedTitle": "Pervasive Computing for Interactive Virtual Heritage",
"fno": "u3046",
"hasPdf": true,
"idPrefix": "mu",
"keywords": [
"Immersive Virtual Environment",
"Cultural Heritage",
"Mobile Devices",
"Pervasive Computing",
"Interaction Interfaces"
],
"authors": [
{
"givenName": "Elisabetta",
"surname": "Farella",
"fullName": "Elisabetta Farella",
"affiliation": "University of Bologna",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Davide",
"surname": "Brunelli",
"fullName": "Davide Brunelli",
"affiliation": "University of Bologna",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Luca",
"surname": "Benini",
"fullName": "Luca Benini",
"affiliation": "University of Bologna",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bruno",
"surname": "Riccò",
"fullName": "Bruno Riccò",
"affiliation": "University of Bologna",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Maria Elena",
"surname": "Bonfigli",
"fullName": "Maria Elena Bonfigli",
"affiliation": "CINECA Supercomputing Center",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2005-07-01 00:00:00",
"pubType": "mags",
"pages": "46-58",
"year": "2005",
"issn": "1070-986X",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/apwcs/2010/4003/0/4003a367",
"title": "The Representation of Virtual Cultural Heritage Based on Key Events",
"doi": null,
"abstractUrl": "/proceedings-article/apwcs/2010/4003a367/12OmNBCqbFt",
"parentPublication": {
"id": "proceedings/apwcs/2010/4003/0",
"title": "Wearable Computing Systems, Asia-Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vsmm/2009/3790/0/3790a080",
"title": "Design and Development of a Virtual Reality Application for Edutainment in Cultural Heritage",
"doi": null,
"abstractUrl": "/proceedings-article/vsmm/2009/3790a080/12OmNC3FGlu",
"parentPublication": {
"id": "proceedings/vsmm/2009/3790/0",
"title": "Virtual Systems and MultiMedia, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vs-games/2011/4419/0/4419a092",
"title": "The Use of Live Virtual Guides in Educational Applications",
"doi": null,
"abstractUrl": "/proceedings-article/vs-games/2011/4419a092/12OmNCfSqR8",
"parentPublication": {
"id": "proceedings/vs-games/2011/4419/0",
"title": "Games and Virtual Worlds for Serious Applications, Conference in",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisis/2010/3967/0/3967a729",
"title": "Adaptive Voice Interaction for 3D Representation of Cultural Heritage Site",
"doi": null,
"abstractUrl": "/proceedings-article/cisis/2010/3967a729/12OmNrHB1Sy",
"parentPublication": {
"id": "proceedings/cisis/2010/3967/0",
"title": "2010 International Conference on Complex, Intelligent and Software Intensive Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vsmm/2009/3790/0/3790a211",
"title": "Cultural Heritage, User Interfaces and Serious Games at CTU Prague",
"doi": null,
"abstractUrl": "/proceedings-article/vsmm/2009/3790a211/12OmNwcCIWT",
"parentPublication": {
"id": "proceedings/vsmm/2009/3790/0",
"title": "Virtual Systems and MultiMedia, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2008/3381/0/3381a439",
"title": "Bi-Manual Interactive Tools for Cultural Heritage Researchers",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2008/3381a439/12OmNxwWoTf",
"parentPublication": {
"id": "proceedings/cw/2008/3381/0",
"title": "2008 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2002/1492/0/14920269",
"title": "The Making of Kyongju VR Theatre",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2002/14920269/12OmNyFU6WI",
"parentPublication": {
"id": "proceedings/vr/2002/1492/0",
"title": "Proceedings IEEE Virtual Reality 2002",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percomw/2014/2736/0/06815229",
"title": "Pervasive computing for sustaining cultural heritage",
"doi": null,
"abstractUrl": "/proceedings-article/percomw/2014/06815229/12OmNz5apIY",
"parentPublication": {
"id": "proceedings/percomw/2014/2736/0",
"title": "2014 IEEE International Conference on Pervasive Computing and Communication Workshops (PERCOM WORKSHOPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmcs/1999/0253/2/02530153",
"title": "Experiment of Virtual Space Distance Education System using the Objects of Cultural Heritage",
"doi": null,
"abstractUrl": "/proceedings-article/icmcs/1999/02530153/12OmNzwpUb8",
"parentPublication": {
"id": "proceedings/icmcs/1999/0253/2",
"title": "Multimedia Computing and Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2009/02/mex2009020054",
"title": "Making a Clean Sweep of Cultural Heritage",
"doi": null,
"abstractUrl": "/magazine/ex/2009/02/mex2009020054/13rRUwcAqwi",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "u3036",
"articleId": "13rRUygT7jH",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "u3059",
"articleId": "13rRUygBw4g",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxdm4En",
"title": "March/April",
"year": "2010",
"issueNum": "02",
"idPrefix": "ic",
"pubType": "magazine",
"volume": "14",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyg2jMN",
"doi": "10.1109/MIC.2009.98",
"abstract": "Virtual worlds have become very popular in recent years, with trends toward larger worlds and more user-generated content. The growth of 3D content in virtual worlds will make real-time content streaming (or 3D streaming) increasingly attractive for developers. To meet the demands of a large user base while lowering costs, peer-to-peer (P2P) content delivery holds the promise for a paradigm shift in how future virtual worlds will be deployed and used. The authors define both the problem and solution spaces for P2P 3D streaming — by outlining its requirements and challenges — and categorize existing proposals.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Virtual worlds have become very popular in recent years, with trends toward larger worlds and more user-generated content. The growth of 3D content in virtual worlds will make real-time content streaming (or 3D streaming) increasingly attractive for developers. To meet the demands of a large user base while lowering costs, peer-to-peer (P2P) content delivery holds the promise for a paradigm shift in how future virtual worlds will be deployed and used. The authors define both the problem and solution spaces for P2P 3D streaming — by outlining its requirements and challenges — and categorize existing proposals.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Virtual worlds have become very popular in recent years, with trends toward larger worlds and more user-generated content. The growth of 3D content in virtual worlds will make real-time content streaming (or 3D streaming) increasingly attractive for developers. To meet the demands of a large user base while lowering costs, peer-to-peer (P2P) content delivery holds the promise for a paradigm shift in how future virtual worlds will be deployed and used. The authors define both the problem and solution spaces for P2P 3D streaming — by outlining its requirements and challenges — and categorize existing proposals.",
"title": "Peer-to-Peer 3D Streaming",
"normalizedTitle": "Peer-to-Peer 3D Streaming",
"fno": "mic2010020054",
"hasPdf": true,
"idPrefix": "ic",
"keywords": [
"3 D Streaming",
"Peer To Peer",
"Virtual Environments"
],
"authors": [
{
"givenName": "Shun-Yun",
"surname": "Hu",
"fullName": "Shun-Yun Hu",
"affiliation": "National Central University, Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jehn-Ruey",
"surname": "Jiang",
"fullName": "Jehn-Ruey Jiang",
"affiliation": "National Central University , Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bing-Yu",
"surname": "Chen",
"fullName": "Bing-Yu Chen",
"affiliation": "National Taiwan University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2010-03-01 00:00:00",
"pubType": "mags",
"pages": "54-61",
"year": "2010",
"issn": "1089-7801",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ifip-networking/2013/55/0/06663518",
"title": "Balance visual saliency, reusability and potential relevance for caching P2P 3D streaming contents",
"doi": null,
"abstractUrl": "/proceedings-article/ifip-networking/2013/06663518/12OmNBigFsr",
"parentPublication": {
"id": "proceedings/ifip-networking/2013/55/0",
"title": "2013 IFIP Networking Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/2011/4576/0/4576a753",
"title": "Adaptive and Efficient Peer Selection in Peer-to-Peer Streaming Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2011/4576a753/12OmNC4eSBm",
"parentPublication": {
"id": "proceedings/icpads/2011/4576/0",
"title": "Parallel and Distributed Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ngmast/2008/3333/0/3333a537",
"title": "Continuous Scheduling for Data-Driven Peer-to-Peer Streaming",
"doi": null,
"abstractUrl": "/proceedings-article/ngmast/2008/3333a537/12OmNvnwVoc",
"parentPublication": {
"id": "proceedings/ngmast/2008/3333/0",
"title": "Second International Conference on Next Generation Mobile Applications, Services, and Technologies. NGMAST 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ds-rt/2010/4251/0/4251a061",
"title": "MOSAIC - A Mobile Peer-to-Peer Networks-Based 3D Streaming Supplying Partner Protocol",
"doi": null,
"abstractUrl": "/proceedings-article/ds-rt/2010/4251a061/12OmNx6PivN",
"parentPublication": {
"id": "proceedings/ds-rt/2010/4251/0",
"title": "Distributed Simulation and Real Time Applications, IEEE/ACM International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/2009/3900/0/3900a782",
"title": "A Peer-to-Peer Media Streaming System Based on the iVCE Platform",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2009/3900a782/12OmNxVV60Q",
"parentPublication": {
"id": "proceedings/icpads/2009/3900/0",
"title": "Parallel and Distributed Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sutc/2008/3158/0/3158a379",
"title": "PNECOS: A Peer-to-Peer Network Coding Streaming System",
"doi": null,
"abstractUrl": "/proceedings-article/sutc/2008/3158a379/12OmNyQYt5Z",
"parentPublication": {
"id": "proceedings/sutc/2008/3158/0",
"title": "2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC '08)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/2009/3900/0/3900a685",
"title": "Group-Based Peer-to-Peer 3D Streaming Authentication",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2009/3900a685/12OmNz3bdIg",
"parentPublication": {
"id": "proceedings/icpads/2009/3900/0",
"title": "Parallel and Distributed Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/2008/3172/0/3172a833",
"title": "Crystal: An Emulation Framework for Practical Peer-to-Peer Multimedia Streaming Systems",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2008/3172a833/12OmNzxyiCv",
"parentPublication": {
"id": "proceedings/icdcs/2008/3172/0",
"title": "2008 The 28th International Conference on Distributed Computing Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/2008/3434/0/3434a787",
"title": "Plug: Virtual Worlds for Millions of People",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2008/3434a787/12OmNzzP5F7",
"parentPublication": {
"id": "proceedings/icpads/2008/3434/0",
"title": "2008 14th IEEE International Conference on Parallel and Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2008/01/ttd2008010077",
"title": "rStream: Resilient and Optimal Peer-to-Peer Streaming with Rateless Codes",
"doi": null,
"abstractUrl": "/journal/td/2008/01/ttd2008010077/13rRUwhHcQt",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mic2010020046",
"articleId": "13rRUNvya5E",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mic2010020062",
"articleId": "13rRUILtJvw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvDqsVB",
"title": "May/June",
"year": "2003",
"issueNum": "03",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "23",
"label": "May/June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwwslvK",
"doi": "10.1109/MCG.2003.1198263",
"abstract": "Global lighting effects produced by diffuse interreflections are typically simulated using global illumination methods such as radiosity or ray tracing. Although diffuse interreflections are crucial to produce realistic images, radiosity like methods are rarely used in production rendering because of slow performance, robustness problems, and control difficulty.This article presents a novel technology that produces natural looking lighting effects in a faster way than radiosity and ray tracing. The solution is view independent, and can be used in 3D real-time interactive applications, as well as for high-quality production rendering. Our method simulates a global illumination solution using the ambient light illumination model based on obscurances. The technology outlines surface profiles even without light sources, making it easy to rapidly compute realistic looking images. The simulation of ambient light distribution saves both light sources setting and rendering times.The results of computations are stored in texture maps, which allows storing multiple light samples per polygon without explicit meshing. This is vital in 3D real-time applications, and speeds up rendering in 3D animation packages as well. Once computed, obscurance maps allow for rapid recomputation of the illumination solution for moving light sources and for scenes with animated objects.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Global lighting effects produced by diffuse interreflections are typically simulated using global illumination methods such as radiosity or ray tracing. Although diffuse interreflections are crucial to produce realistic images, radiosity like methods are rarely used in production rendering because of slow performance, robustness problems, and control difficulty.This article presents a novel technology that produces natural looking lighting effects in a faster way than radiosity and ray tracing. The solution is view independent, and can be used in 3D real-time interactive applications, as well as for high-quality production rendering. Our method simulates a global illumination solution using the ambient light illumination model based on obscurances. The technology outlines surface profiles even without light sources, making it easy to rapidly compute realistic looking images. The simulation of ambient light distribution saves both light sources setting and rendering times.The results of computations are stored in texture maps, which allows storing multiple light samples per polygon without explicit meshing. This is vital in 3D real-time applications, and speeds up rendering in 3D animation packages as well. Once computed, obscurance maps allow for rapid recomputation of the illumination solution for moving light sources and for scenes with animated objects.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Global lighting effects produced by diffuse interreflections are typically simulated using global illumination methods such as radiosity or ray tracing. Although diffuse interreflections are crucial to produce realistic images, radiosity like methods are rarely used in production rendering because of slow performance, robustness problems, and control difficulty.This article presents a novel technology that produces natural looking lighting effects in a faster way than radiosity and ray tracing. The solution is view independent, and can be used in 3D real-time interactive applications, as well as for high-quality production rendering. Our method simulates a global illumination solution using the ambient light illumination model based on obscurances. The technology outlines surface profiles even without light sources, making it easy to rapidly compute realistic looking images. The simulation of ambient light distribution saves both light sources setting and rendering times.The results of computations are stored in texture maps, which allows storing multiple light samples per polygon without explicit meshing. This is vital in 3D real-time applications, and speeds up rendering in 3D animation packages as well. Once computed, obscurance maps allow for rapid recomputation of the illumination solution for moving light sources and for scenes with animated objects.",
"title": "Fast, Realistic Lighting for Video Games",
"normalizedTitle": "Fast, Realistic Lighting for Video Games",
"fno": "mcg2003030054",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Rendering",
"Illumination Effects",
"Radiosity",
"Texture Mapping",
"Illumination Model",
"Lightmaps",
"Ambient Light",
"Form Factor",
"Obscurance",
"Production Rendering"
],
"authors": [
{
"givenName": "Andrey",
"surname": "Iones",
"fullName": "Andrey Iones",
"affiliation": "Saber Interactive",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anton",
"surname": "Krupkin",
"fullName": "Anton Krupkin",
"affiliation": "Saber Interactive",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mateu",
"surname": "Sbert",
"fullName": "Mateu Sbert",
"affiliation": "University of Girona, Spain",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sergey",
"surname": "Zhukov",
"fullName": "Sergey Zhukov",
"affiliation": "Creat Studio",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2003-05-01 00:00:00",
"pubType": "mags",
"pages": "54-64",
"year": "2003",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "mcg2003030046",
"articleId": "13rRUxC0Syt",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2003030066",
"articleId": "13rRUxly9g9",
"__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.