data
dict |
|---|
{
"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": "13rRUxBa5rS",
"doi": "10.1109/TVCG.2011.258",
"abstract": "The combination of volume data acquired by multiple modalities has been recognized as an important but challenging task. Modalities often differ in the structures they can delineate and their joint information can be used to extend the classification space. However, they frequently exhibit differing types of artifacts which makes the process of exploiting the additional information non-trivial. In this paper, we present a framework based on an information-theoretic measure of isosurface similarity between different modalities to overcome these problems. The resulting similarity space provides a concise overview of the differences between the two modalities, and also serves as the basis for an improved selection of features. Multimodal classification is expressed in terms of similarities and dissimilarities between the isosurfaces of individual modalities, instead of data value combinations. We demonstrate that our approach can be used to robustly extract features in applications such as dual energy computed tomography of parts in industrial manufacturing.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The combination of volume data acquired by multiple modalities has been recognized as an important but challenging task. Modalities often differ in the structures they can delineate and their joint information can be used to extend the classification space. However, they frequently exhibit differing types of artifacts which makes the process of exploiting the additional information non-trivial. In this paper, we present a framework based on an information-theoretic measure of isosurface similarity between different modalities to overcome these problems. The resulting similarity space provides a concise overview of the differences between the two modalities, and also serves as the basis for an improved selection of features. Multimodal classification is expressed in terms of similarities and dissimilarities between the isosurfaces of individual modalities, instead of data value combinations. We demonstrate that our approach can be used to robustly extract features in applications such as dual energy computed tomography of parts in industrial manufacturing.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The combination of volume data acquired by multiple modalities has been recognized as an important but challenging task. Modalities often differ in the structures they can delineate and their joint information can be used to extend the classification space. However, they frequently exhibit differing types of artifacts which makes the process of exploiting the additional information non-trivial. In this paper, we present a framework based on an information-theoretic measure of isosurface similarity between different modalities to overcome these problems. The resulting similarity space provides a concise overview of the differences between the two modalities, and also serves as the basis for an improved selection of features. Multimodal classification is expressed in terms of similarities and dissimilarities between the isosurfaces of individual modalities, instead of data value combinations. We demonstrate that our approach can be used to robustly extract features in applications such as dual energy computed tomography of parts in industrial manufacturing.",
"title": "Volume Analysis Using Multimodal Surface Similarity",
"normalizedTitle": "Volume Analysis Using Multimodal Surface Similarity",
"fno": "ttg2011121969",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Multimodal Data",
"Volume Visualization",
"Surface Similarity"
],
"authors": [
{
"givenName": "Martin",
"surname": "Haidacher",
"fullName": "Martin Haidacher",
"affiliation": "Institute of Computer Graphics and Algorithms, Vienna University of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefan",
"surname": "Bruckner",
"fullName": "Stefan Bruckner",
"affiliation": "Institute of Computer Graphics and Algorithms, Vienna University of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eduard",
"surname": "Gröller",
"fullName": "Eduard Gröller",
"affiliation": "Institute of Computer Graphics and Algorithms, Vienna University of Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2011-12-01 00:00:00",
"pubType": "trans",
"pages": "1969-1978",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/paccs/2009/3614/0/3614a155",
"title": "Self-similarity Formed of Complex Networks",
"doi": null,
"abstractUrl": "/proceedings-article/paccs/2009/3614a155/12OmNBKmXoi",
"parentPublication": {
"id": "proceedings/paccs/2009/3614/0",
"title": "2009 Pacific-Asia Conference on Circuits, Communications and Systems (PACCS 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisp/2008/3119/2/3119b402",
"title": "Self-Similarity Based Classification of 3D Surface Textures",
"doi": null,
"abstractUrl": "/proceedings-article/cisp/2008/3119b402/12OmNBaT62r",
"parentPublication": {
"id": "proceedings/cisp/2008/3119/3",
"title": "Image and Signal Processing, Congress on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200pekar",
"title": "Fast Detection of Meaningful Isosurfaces for Volume Data Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200pekar/12OmNCbU3bR",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aipr/2011/0215/0/06176359",
"title": "Multimodal image matching using self similarity",
"doi": null,
"abstractUrl": "/proceedings-article/aipr/2011/06176359/12OmNvSKNXw",
"parentPublication": {
"id": "proceedings/aipr/2011/0215/0",
"title": "2011 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccee/2008/3504/0/3504a317",
"title": "Gamma Similarity Discrimination of Road Surface about ABS",
"doi": null,
"abstractUrl": "/proceedings-article/iccee/2008/3504a317/12OmNvk7JJZ",
"parentPublication": {
"id": "proceedings/iccee/2008/3504/0",
"title": "2008 International Conference on Computer and Electrical Engineering (ICCEE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2012/4797/0/4797a143",
"title": "A Similarity Metric for Multimodal Images Based on Modified Hausdorff Distance",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2012/4797a143/12OmNweTvQG",
"parentPublication": {
"id": "proceedings/avss/2012/4797/0",
"title": "2012 IEEE Ninth International Conference on Advanced Video and Signal-Based Surveillance",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isise/2008/3494/1/3494a354",
"title": "Weibull Similarity Discrimination of Road Surface about ABS",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2008/3494a354/12OmNwwuDV2",
"parentPublication": {
"id": "proceedings/isise/2008/3494/1",
"title": "2008 International Symposium on Information Science and Engieering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660038",
"title": "Scale-Invariant Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660038/12OmNxb5hu0",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1696",
"title": "High-Quality Multimodal Volume Rendering for Preoperative Planning of Neurosurgical Interventions",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1696/13rRUNvyakE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2014/04/06654144",
"title": "Multimodal Similarity-Preserving Hashing",
"doi": null,
"abstractUrl": "/journal/tp/2014/04/06654144/13rRUwbaqMK",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011121959",
"articleId": "13rRUEgarBs",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011121979",
"articleId": "13rRUygT7fa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRHQ",
"name": "ttg2011121969s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2011121969s1.zip",
"extension": "zip",
"size": "37.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvSbBJP",
"title": "Jan.-Feb.",
"year": "2014",
"issueNum": "01",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "34",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyp7tZ7",
"doi": "10.1109/MCG.2013.35",
"abstract": "Advances in computational methods and hardware platforms provide efficient processing of medical-imaging datasets for surgical planning. For neurosurgical interventions employing a straight access path, planning entails selecting a path from the scalp to the target area that's of minimal risk to the patient. A proposed GPU-accelerated method enables interactive quantitative estimation of the risk for a particular path. It exploits acceleration spatial data structures and efficient implementation of algorithms on GPUs. In evaluations of its computational efficiency and scalability, it achieved interactive rates even for high-resolution meshes. A user study and feedback from neurosurgeons identified this methods' potential benefits for preoperative planning and intraoperative replanning.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Advances in computational methods and hardware platforms provide efficient processing of medical-imaging datasets for surgical planning. For neurosurgical interventions employing a straight access path, planning entails selecting a path from the scalp to the target area that's of minimal risk to the patient. A proposed GPU-accelerated method enables interactive quantitative estimation of the risk for a particular path. It exploits acceleration spatial data structures and efficient implementation of algorithms on GPUs. In evaluations of its computational efficiency and scalability, it achieved interactive rates even for high-resolution meshes. A user study and feedback from neurosurgeons identified this methods' potential benefits for preoperative planning and intraoperative replanning.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Advances in computational methods and hardware platforms provide efficient processing of medical-imaging datasets for surgical planning. For neurosurgical interventions employing a straight access path, planning entails selecting a path from the scalp to the target area that's of minimal risk to the patient. A proposed GPU-accelerated method enables interactive quantitative estimation of the risk for a particular path. It exploits acceleration spatial data structures and efficient implementation of algorithms on GPUs. In evaluations of its computational efficiency and scalability, it achieved interactive rates even for high-resolution meshes. A user study and feedback from neurosurgeons identified this methods' potential benefits for preoperative planning and intraoperative replanning.",
"title": "GPU-Accelerated Interactive Visualization and Planning of Neurosurgical Interventions",
"normalizedTitle": "GPU-Accelerated Interactive Visualization and Planning of Neurosurgical Interventions",
"fno": "mcg2014010022",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Medical Image Processing",
"Neurosurgery",
"Graphics Processing Units",
"Instruction Sets",
"Data Structures",
"Interactive Visualizations",
"GPU Acceleration",
"Neurosurgical Interventions",
"Risk Maps",
"Straight Access",
"Computer Graphics",
"Visualizations"
],
"authors": [
{
"givenName": "Mario",
"surname": "Rincon-Nigro",
"fullName": "Mario Rincon-Nigro",
"affiliation": "Univ. of Houston, Houston, TX, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nikhil V.",
"surname": "Navkar",
"fullName": "Nikhil V. Navkar",
"affiliation": "Univ. of Houston, Houston, TX, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nikolaos V.",
"surname": "Tsekos",
"fullName": "Nikolaos V. Tsekos",
"affiliation": "Univ. of Houston, Houston, TX, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Zhigang Deng",
"fullName": "Zhigang Deng",
"affiliation": "Univ. of Houston, Houston, TX, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2014-01-01 00:00:00",
"pubType": "mags",
"pages": "22-31",
"year": "2014",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2015/1727/0/07223349",
"title": "Collaborative table-top VR display for neurosurgical planning",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2015/07223349/12OmNs59JLl",
"parentPublication": {
"id": "proceedings/vr/2015/1727/0",
"title": "2015 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/2015/5785/0/5785a576",
"title": "GPU-Accelerated Nick Local Image Thresholding Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2015/5785a576/12OmNxX3usp",
"parentPublication": {
"id": "proceedings/icpads/2015/5785/0",
"title": "2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS)",
"__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/vr/2018/3365/0/08446580",
"title": "An Investigation of Head Motion and Perceptual Motion Cues' Influence on User Depth Perception of Augmented Reality Neurosurgical Simulators",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446580/13bd1eTtWYv",
"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/snpd/2018/5889/0/08441139",
"title": "A GPU Accelerated Parallel Heuristic for Travelling Salesman Problem",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2018/08441139/13bd1tl2omr",
"parentPublication": {
"id": "proceedings/snpd/2018/5889/0",
"title": "2018 19th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2018/09/08307249",
"title": "Error Resilient GPU Accelerated Image Processing for Space Applications",
"doi": null,
"abstractUrl": "/journal/td/2018/09/08307249/13rRUwInvJ3",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061587",
"title": "Novel interaction techniques for neurosurgical planning and stereotactic navigation",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061587/13rRUwh80uv",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/1995/07/r7020",
"title": "Two-Handed Spatial Interface Tools for Neurosurgical Planning",
"doi": null,
"abstractUrl": "/magazine/co/1995/07/r7020/13rRUxC0Szg",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2018/5520/0/552000b037",
"title": "A GPU-Accelerated Framework for Processing Trajectory Queries",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2018/552000b037/14Fq0WSLMvr",
"parentPublication": {
"id": "proceedings/icde/2018/5520/0",
"title": "2018 IEEE 34th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08797710",
"title": "A Research Framework for Virtual-Reality Neurosurgery Based on Open-Source Tools",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08797710/1cJ0FFm37Hi",
"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": "mcg2014010016",
"articleId": "13rRUxEhFv3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2014010032",
"articleId": "13rRUzpzeHK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyp9Mqa",
"title": "June",
"year": "1996",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "2",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvgyW8",
"doi": "10.1109/2945.506228",
"abstract": "We present a simple, robust, and practical method for object simplification for applications where gradual elimination of high frequency details is desired. This is accomplished by converting an object into multi resolution volume rasters using a controlled filtering and sampling technique. A multiresolution triangle mesh hierarchy can then be generated by applying the Marching Cubes algorithm. We further propose an adaptive surface generation algorithm to reduce the number of triangles generated by the standard Marching Cubes. Our method simplifies the topology of objects in a controlled fashion. In addition, at each level of detail, multilayered meshes can be used for an efficient antialiased rendering.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a simple, robust, and practical method for object simplification for applications where gradual elimination of high frequency details is desired. This is accomplished by converting an object into multi resolution volume rasters using a controlled filtering and sampling technique. A multiresolution triangle mesh hierarchy can then be generated by applying the Marching Cubes algorithm. We further propose an adaptive surface generation algorithm to reduce the number of triangles generated by the standard Marching Cubes. Our method simplifies the topology of objects in a controlled fashion. In addition, at each level of detail, multilayered meshes can be used for an efficient antialiased rendering.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a simple, robust, and practical method for object simplification for applications where gradual elimination of high frequency details is desired. This is accomplished by converting an object into multi resolution volume rasters using a controlled filtering and sampling technique. A multiresolution triangle mesh hierarchy can then be generated by applying the Marching Cubes algorithm. We further propose an adaptive surface generation algorithm to reduce the number of triangles generated by the standard Marching Cubes. Our method simplifies the topology of objects in a controlled fashion. In addition, at each level of detail, multilayered meshes can be used for an efficient antialiased rendering.",
"title": "Controlled topology simplification",
"normalizedTitle": "Controlled topology simplification",
"fno": "v0171",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Rendering Computer Graphics",
"Computational Geometry",
"Topology",
"Antialiasing",
"Controlled Topology Simplification",
"Object Simplification",
"High Frequency Details",
"Multi Resolution Volume Rasters",
"Controlled Filtering",
"Sampling Technique",
"Multiresolution Triangle Mesh Hierarchy",
"Marching Cubes Algorithm",
"Adaptive Surface Generation Algorithm",
"Standard Marching Cubes",
"Multilayered Meshes",
"Efficient Antialiased Rendering",
"Topology",
"Rendering Computer Graphics",
"Geometry",
"Frequency",
"Multiresolution Analysis",
"Sampling Methods",
"Virtual Reality",
"Layout",
"Robustness"
],
"authors": [
{
"givenName": null,
"surname": "Taosong He",
"fullName": "Taosong He",
"affiliation": "Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Lichan Hong",
"fullName": "Lichan Hong",
"affiliation": "Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "A.",
"surname": "Varshney",
"fullName": "A. Varshney",
"affiliation": "Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "S.W.",
"surname": "Wang",
"fullName": "S.W. Wang",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "1996-04-01 00:00:00",
"pubType": "trans",
"pages": "171-184",
"year": "1996",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iciap/2007/2877/0/28770781",
"title": "Topology Preserving Marching Cubes-like Algorithms on the Face-Centered Cubic Grid",
"doi": null,
"abstractUrl": "/proceedings-article/iciap/2007/28770781/12OmNARRYq4",
"parentPublication": {
"id": "proceedings/iciap/2007/2877/0",
"title": "2007 14th International Conference on Image Analysis and Processing - ICIAP 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bia/1994/5802/0/00315851",
"title": "The wrapper algorithm: surface extraction and simplification",
"doi": null,
"abstractUrl": "/proceedings-article/bia/1994/00315851/12OmNAlNiPa",
"parentPublication": {
"id": "proceedings/bia/1994/5802/0",
"title": "Proceedings of IEEE Workshop on Biomedical Image Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vbc/1990/2039/0/00109297",
"title": "Surface shading in tomographic volume visualization: a comparative study",
"doi": null,
"abstractUrl": "/proceedings-article/vbc/1990/00109297/12OmNCdBDNO",
"parentPublication": {
"id": "proceedings/vbc/1990/2039/0",
"title": "[1990] Proceedings of the First Conference on Visualization in Biomedical Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498taubin",
"title": "BLIC: Bi-Level Isosurface Compression",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498taubin/12OmNCtMM1P",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2004/2244/0/01410465",
"title": "Marker-controlled perception-based mesh segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2004/01410465/12OmNqIzh5P",
"parentPublication": {
"id": "proceedings/icig/2004/2244/0",
"title": "Proceedings. Third International Conference on Image and Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1995/7187/0/71870296",
"title": "Voxel based object simplification",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1995/71870296/12OmNroijch",
"parentPublication": {
"id": "proceedings/ieee-vis/1995/7187/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1997/8262/0/82620403",
"title": "Controlled simplification of genus for polygonal models",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1997/82620403/12OmNx6xHp7",
"parentPublication": {
"id": "proceedings/ieee-vis/1997/8262/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/1997/8028/0/80280117",
"title": "\"Skeleton climbing\": fast isosurfaces with fewer triangles",
"doi": null,
"abstractUrl": "/proceedings-article/pg/1997/80280117/12OmNxFaLCm",
"parentPublication": {
"id": "proceedings/pg/1997/8028/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fcst/2010/7779/0/05575931",
"title": "User-Controlled Geometric Feature Preserving Simplification",
"doi": null,
"abstractUrl": "/proceedings-article/fcst/2010/05575931/12OmNyNQSQn",
"parentPublication": {
"id": "proceedings/fcst/2010/7779/0",
"title": "2010 Fifth International Conference on Frontier of Computer Science and Technology (FCST 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2001/1007/0/10070306",
"title": "A Marching Voxels Method for Surface Rendering of Volume Data",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2001/10070306/12OmNzdoN6A",
"parentPublication": {
"id": "proceedings/cgi/2001/1007/0",
"title": "Proceedings. Computer Graphics International 2001",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0156",
"articleId": "13rRUxd2aYO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0184",
"articleId": "13rRUxASuSA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBOUxmQ",
"title": "November/December",
"year": "2008",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "14",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInveZ",
"doi": "10.1109/TVCG.2008.154",
"abstract": "Methods that faithfully and robustly capture the geometry of complex material interfaces in labeled volume data are important for generating realistic and accurate visualizations and simulations of real-world objects. The generation of such multimaterial models from measured data poses two unique challenges: first, the surfaces must be well-sampled with regular, efficient tessellations that are consistent across material boundaries; and second, the resulting meshes must respect the nonmanifold geometry of the multimaterial interfaces. This paper proposes a strategy for sampling and meshing multimaterial volumes using dynamic particle systems, including a novel, differentiable representation of the material junctions that allows the particle system to explicitly sample corners, edges, and surfaces of material intersections. The distributions of particles are controlled by fundamental sampling constraints, allowing Delaunay-based meshing algorithms to reliably extract watertight meshes of consistently high-quality.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Methods that faithfully and robustly capture the geometry of complex material interfaces in labeled volume data are important for generating realistic and accurate visualizations and simulations of real-world objects. The generation of such multimaterial models from measured data poses two unique challenges: first, the surfaces must be well-sampled with regular, efficient tessellations that are consistent across material boundaries; and second, the resulting meshes must respect the nonmanifold geometry of the multimaterial interfaces. This paper proposes a strategy for sampling and meshing multimaterial volumes using dynamic particle systems, including a novel, differentiable representation of the material junctions that allows the particle system to explicitly sample corners, edges, and surfaces of material intersections. The distributions of particles are controlled by fundamental sampling constraints, allowing Delaunay-based meshing algorithms to reliably extract watertight meshes of consistently high-quality.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Methods that faithfully and robustly capture the geometry of complex material interfaces in labeled volume data are important for generating realistic and accurate visualizations and simulations of real-world objects. The generation of such multimaterial models from measured data poses two unique challenges: first, the surfaces must be well-sampled with regular, efficient tessellations that are consistent across material boundaries; and second, the resulting meshes must respect the nonmanifold geometry of the multimaterial interfaces. This paper proposes a strategy for sampling and meshing multimaterial volumes using dynamic particle systems, including a novel, differentiable representation of the material junctions that allows the particle system to explicitly sample corners, edges, and surfaces of material intersections. The distributions of particles are controlled by fundamental sampling constraints, allowing Delaunay-based meshing algorithms to reliably extract watertight meshes of consistently high-quality.",
"title": "Particle-based Sampling and Meshing of Surfaces in Multimaterial Volumes",
"normalizedTitle": "Particle-based Sampling and Meshing of Surfaces in Multimaterial Volumes",
"fno": "ttg2008061539",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Sampling",
"Meshing",
"Visualizations"
],
"authors": [
{
"givenName": "Miriah",
"surname": "Meyer",
"fullName": "Miriah Meyer",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ross",
"surname": "Whitaker",
"fullName": "Ross Whitaker",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert M.",
"surname": "Kirby",
"fullName": "Robert M. Kirby",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christian",
"surname": "Ledergerber",
"fullName": "Christian Ledergerber",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanspeter",
"surname": "Pfister",
"fullName": "Hanspeter Pfister",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1539-1546",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2004/8788/0/87880481",
"title": "Guaranteed Quality Triangulation of Molecular Skin Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880481/12OmNBtCCME",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vv/2000/308/0/04384230",
"title": "Reducing Aliasing Artifacts in Iso-Surfaces of Binary Volumes",
"doi": null,
"abstractUrl": "/proceedings-article/vv/2000/04384230/12OmNvIxeUE",
"parentPublication": {
"id": "proceedings/vv/2000/308/0",
"title": "2000 IEEE Symposium on Volume Visualization (VV 2000)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2011/4296/3/4296e807",
"title": "The Factors for Meshing Analysis of Point-Contact Tooth Surfaces Based on Active Design",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2011/4296e807/12OmNwCsdAV",
"parentPublication": {
"id": "proceedings/icmtma/2011/4296/3",
"title": "2011 Third International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccie/2010/4026/2/4026b280",
"title": "Research on the Dual Meshing Silent Chain Drive",
"doi": null,
"abstractUrl": "/proceedings-article/ccie/2010/4026b280/12OmNxETal4",
"parentPublication": {
"id": "proceedings/ccie/2010/4026/2",
"title": "Computing, Control and Industrial Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2005/2379/0/23790094",
"title": "Anisotropic Meshing of Implicit Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2005/23790094/12OmNxbEtKO",
"parentPublication": {
"id": "proceedings/smi/2005/2379/0",
"title": "Proceedings. International Conference on Shape Modeling and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvd/2011/4483/0/4483a013",
"title": "Meshing Surfaces and Volumes with Centroidal Voronoi Tesselations",
"doi": null,
"abstractUrl": "/proceedings-article/isvd/2011/4483a013/12OmNy3iFnv",
"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/cad-cg/2005/2473/0/24730287",
"title": "Meshing Skin Surfaces with Certified Topology",
"doi": null,
"abstractUrl": "/proceedings-article/cad-cg/2005/24730287/12OmNyXMQhf",
"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/crv/2008/3153/0/3153a278",
"title": "Polygonal Meshing for 3D Stereo Video Sensor Data",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2008/3153a278/12OmNynJMEA",
"parentPublication": {
"id": "proceedings/crv/2008/3153/0",
"title": "2008 Canadian Conference on Computer and Robot Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbac-pad/2010/4216/0/4216a151",
"title": "Parallel Linear Octree Meshing with Immersed Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/sbac-pad/2010/4216a151/12OmNzYwchT",
"parentPublication": {
"id": "proceedings/sbac-pad/2010/4216/0",
"title": "Computer Architecture and High Performance Computing, Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/05/v0573",
"title": "A Sampling Framework for Accurate Curvature Estimation in Discrete Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2005/05/v0573/13rRUxC0SOP",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061531",
"articleId": "13rRUwh80uu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061547",
"articleId": "13rRUxC0SvO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgEi",
"name": "ttg2008061539.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2008061539.mov",
"extension": "mov",
"size": "41.9 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzFdtcl",
"title": "March-April",
"year": "2020",
"issueNum": "02",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "40",
"label": "March-April",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1hS2P6PIkIU",
"doi": "10.1109/MCG.2019.2959568",
"abstract": "In this article, we address three different topics in scientific visualization. The first part introduces optimization strategies that determine the visibility of line and surface geometry, such that a balance between occlusion avoidance and preservation of context is found. The second part proposes new methods for the visualization of time-dependent fluid flows, including the accurate depiction of Lagrangian scalar fields, as well as a new category of vortex identification methods. The third part introduces finite-sized particles as new application area for flow visualization, covering geometry-based methods, particle separation, topology, vortex corelines, and the determination of the origin of finite-sized particles.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this article, we address three different topics in scientific visualization. The first part introduces optimization strategies that determine the visibility of line and surface geometry, such that a balance between occlusion avoidance and preservation of context is found. The second part proposes new methods for the visualization of time-dependent fluid flows, including the accurate depiction of Lagrangian scalar fields, as well as a new category of vortex identification methods. The third part introduces finite-sized particles as new application area for flow visualization, covering geometry-based methods, particle separation, topology, vortex corelines, and the determination of the origin of finite-sized particles.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this article, we address three different topics in scientific visualization. The first part introduces optimization strategies that determine the visibility of line and surface geometry, such that a balance between occlusion avoidance and preservation of context is found. The second part proposes new methods for the visualization of time-dependent fluid flows, including the accurate depiction of Lagrangian scalar fields, as well as a new category of vortex identification methods. The third part introduces finite-sized particles as new application area for flow visualization, covering geometry-based methods, particle separation, topology, vortex corelines, and the determination of the origin of finite-sized particles.",
"title": "Visibility, Topology, and Inertia: New Methods in Flow Visualization",
"normalizedTitle": "Visibility, Topology, and Inertia: New Methods in Flow Visualization",
"fno": "09020213",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Computational Fluid Dynamics",
"Data Visualisation",
"Flow Instability",
"Flow Simulation",
"Flow Visualisation",
"Geometry",
"Vortices",
"Optimization Strategies",
"Visibility",
"Surface Geometry",
"Occlusion Avoidance",
"Time Dependent Fluid Flows",
"Accurate Depiction",
"Lagrangian Scalar Fields",
"Vortex Identification Methods",
"Finite Sized Particles",
"Flow Visualization",
"Geometry Based Methods",
"Inertia",
"Scientific Visualization",
"Optimization",
"Geometry",
"Visualization",
"Image Segmentation",
"Rendering Computer Graphics",
"Data Visualization",
"Three Dimensional Displays"
],
"authors": [
{
"givenName": "Tobias",
"surname": "Günther",
"fullName": "Tobias Günther",
"affiliation": "ETH Zürich",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2020-03-01 00:00:00",
"pubType": "mags",
"pages": "103-111",
"year": "2020",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pvgs/2003/8122/0/01249035",
"title": "Visibility-based prefetching for interactive out-of-core rendering",
"doi": null,
"abstractUrl": "/proceedings-article/pvgs/2003/01249035/12OmNAHEpD8",
"parentPublication": {
"id": "proceedings/pvgs/2003/8122/0",
"title": "IEEE Symposium on Parallel and Large-Data Visualization and Graphics 2003",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880187",
"title": "Visualization of Intricate Flow Structures for Vortex Breakdown Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880187/12OmNxvO03b",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2008/1966/0/04475461",
"title": "Importance-Driven Particle Techniques for Flow Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2008/04475461/12OmNyFU6Yx",
"parentPublication": {
"id": "proceedings/pacificvis/2008/1966/0",
"title": "IEEE Pacific Visualization Symposium 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2014/4116/0/4116a966",
"title": "Scalable Fast Multipole Accelerated Vortex Methods",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2014/4116a966/12OmNyTwRcH",
"parentPublication": {
"id": "proceedings/ipdpsw/2014/4116/0",
"title": "2014 IEEE International Parallel & Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/04/v0758",
"title": "A Coherent Grid Traversal Approach to Visualizing Particle-Based Simulation Data",
"doi": null,
"abstractUrl": "/journal/tg/2007/04/v0758/13rRUxOdD8a",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/08/07494624",
"title": "Analysis and Visualization of Discrete Fracture Networks Using a Flow Topology Graph",
"doi": null,
"abstractUrl": "/journal/tg/2017/08/07494624/13rRUxcbnHg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/04/ttg2011040412",
"title": "Visualizing the Evolution and Interaction of Vortices and Shear Layers in Time-Dependent 3D Flow",
"doi": null,
"abstractUrl": "/journal/tg/2011/04/ttg2011040412/13rRUyYSWsO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440096",
"title": "Objective Vortex Corelines of Finite-sized Objects in Fluid Flows",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440096/17D45WXIkH8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pvg/2003/2091/0/01249035",
"title": "Visibility-based prefetching for interactive out-of-core rendering",
"doi": null,
"abstractUrl": "/proceedings-article/pvg/2003/01249035/1h0S13AbcoU",
"parentPublication": {
"id": "proceedings/pvg/2003/2091/0",
"title": "Parallel and Large-Data Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a031",
"title": "Implicit Ray Casting of the Parallel Vectors Operator",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a031/1qROkU5tIc0",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09020216",
"articleId": "1hS2QTShnvG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09020249",
"articleId": "1hS2S5b2V6E",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyUFfMF",
"title": "January-March",
"year": "2003",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "9",
"label": "January-March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvgyWa",
"doi": "10.1109/TVCG.2003.1175094",
"abstract": "Abstract—This paper proposes a modification of the Marching Cubes algorithm for isosurfacing, with the intent of improving the representation of the surface in the interior of each grid cell. Our objective is to create a representation which correctly models the topology of the trilinear interpolant within the cell and which is robust under perturbations of the data and threshold value. To achieve this, we identify a small number of key points in the cell interior that are critical to the surface definition. This allows us to efficiently represent the different topologies that can occur, including the possibility of “tunnels.” The representation is robust in the sense that the surface is visually continuous as the data and threshold change in value. Each interior point lies on the isosurface. Finally, a major feature of our new approach is the systematic method of triangulating the polygon in the cell interior.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—This paper proposes a modification of the Marching Cubes algorithm for isosurfacing, with the intent of improving the representation of the surface in the interior of each grid cell. Our objective is to create a representation which correctly models the topology of the trilinear interpolant within the cell and which is robust under perturbations of the data and threshold value. To achieve this, we identify a small number of key points in the cell interior that are critical to the surface definition. This allows us to efficiently represent the different topologies that can occur, including the possibility of “tunnels.” The representation is robust in the sense that the surface is visually continuous as the data and threshold change in value. Each interior point lies on the isosurface. Finally, a major feature of our new approach is the systematic method of triangulating the polygon in the cell interior.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—This paper proposes a modification of the Marching Cubes algorithm for isosurfacing, with the intent of improving the representation of the surface in the interior of each grid cell. Our objective is to create a representation which correctly models the topology of the trilinear interpolant within the cell and which is robust under perturbations of the data and threshold value. To achieve this, we identify a small number of key points in the cell interior that are critical to the surface definition. This allows us to efficiently represent the different topologies that can occur, including the possibility of “tunnels.” The representation is robust in the sense that the surface is visually continuous as the data and threshold change in value. Each interior point lies on the isosurface. Finally, a major feature of our new approach is the systematic method of triangulating the polygon in the cell interior.",
"title": "Improving the Robustness and Accuracy of the Marching Cubes Algorithm for Isosurfacing",
"normalizedTitle": "Improving the Robustness and Accuracy of the Marching Cubes Algorithm for Isosurfacing",
"fno": "v0016",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Isosurface",
"Marching Cubes",
"Robustness",
"Accuracy",
"Trilinear Interpolation"
],
"authors": [
{
"givenName": "Adriano",
"surname": "Lopes",
"fullName": "Adriano Lopes",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ken",
"surname": "Brodlie",
"fullName": "Ken Brodlie",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2003-01-01 00:00:00",
"pubType": "trans",
"pages": "16-29",
"year": "2003",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0003",
"articleId": "13rRUyfKIHz",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0030",
"articleId": "13rRUILtJqJ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwGqBqg",
"title": "November/December",
"year": "2009",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "15",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxAAT0J",
"doi": "10.1109/TVCG.2009.142",
"abstract": "In this paper we investigate scalability limitations in the visualization of large-scale particle-based cosmological simulations, and we present methods to reduce these limitations on current PC architectures. To minimize the amount of data to be streamed from disk to the graphics subsystem, we propose a visually continuous level-of-detail (LOD) particle representation based on a hierarchical quantization scheme for particle coordinates and rules for generating coarse particle distributions. Given the maximal world space error per level, our LOD selection technique guarantees a sub-pixel screen space error during rendering. A brick-based pagetree allows to further reduce the number of disk seek operations to be performed. Additional particle quantities like density, velocity dispersion, and radius are compressed at no visible loss using vector quantization of logarithmically encoded floating point values. By fine-grain view-frustum culling and presence acceleration in a geometry shader the required geometry throughput on the GPU can be significantly reduced. We validate the quality and scalability of our method by presenting visualizations of a particle-based cosmological dark-matter simulation exceeding 10 billion elements.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper we investigate scalability limitations in the visualization of large-scale particle-based cosmological simulations, and we present methods to reduce these limitations on current PC architectures. To minimize the amount of data to be streamed from disk to the graphics subsystem, we propose a visually continuous level-of-detail (LOD) particle representation based on a hierarchical quantization scheme for particle coordinates and rules for generating coarse particle distributions. Given the maximal world space error per level, our LOD selection technique guarantees a sub-pixel screen space error during rendering. A brick-based pagetree allows to further reduce the number of disk seek operations to be performed. Additional particle quantities like density, velocity dispersion, and radius are compressed at no visible loss using vector quantization of logarithmically encoded floating point values. By fine-grain view-frustum culling and presence acceleration in a geometry shader the required geometry throughput on the GPU can be significantly reduced. We validate the quality and scalability of our method by presenting visualizations of a particle-based cosmological dark-matter simulation exceeding 10 billion elements.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper we investigate scalability limitations in the visualization of large-scale particle-based cosmological simulations, and we present methods to reduce these limitations on current PC architectures. To minimize the amount of data to be streamed from disk to the graphics subsystem, we propose a visually continuous level-of-detail (LOD) particle representation based on a hierarchical quantization scheme for particle coordinates and rules for generating coarse particle distributions. Given the maximal world space error per level, our LOD selection technique guarantees a sub-pixel screen space error during rendering. A brick-based pagetree allows to further reduce the number of disk seek operations to be performed. Additional particle quantities like density, velocity dispersion, and radius are compressed at no visible loss using vector quantization of logarithmically encoded floating point values. By fine-grain view-frustum culling and presence acceleration in a geometry shader the required geometry throughput on the GPU can be significantly reduced. We validate the quality and scalability of our method by presenting visualizations of a particle-based cosmological dark-matter simulation exceeding 10 billion elements.",
"title": "Exploring the Millennium Run - Scalable Rendering of Large-Scale Cosmological Datasets",
"normalizedTitle": "Exploring the Millennium Run - Scalable Rendering of Large-Scale Cosmological Datasets",
"fno": "ttg2009061251",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Particle Visualization",
"Scalability",
"Cosmology"
],
"authors": [
{
"givenName": "Roland",
"surname": "Fraedrich",
"fullName": "Roland Fraedrich",
"affiliation": "Technische Universität München",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jens",
"surname": "Schneider",
"fullName": "Jens Schneider",
"affiliation": "Technische Universität München",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rüdiger",
"surname": "Westermann",
"fullName": "Rüdiger Westermann",
"affiliation": "Technische Universität München",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2009-11-01 00:00:00",
"pubType": "trans",
"pages": "1251-1258",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/supercomputing/1996/854/0/01392900",
"title": "A Parallel Cosmological Hydrodynamics Code",
"doi": null,
"abstractUrl": "/proceedings-article/supercomputing/1996/01392900/12OmNBh8h03",
"parentPublication": {
"id": "proceedings/supercomputing/1996/854/0",
"title": "Proceedings of the 1996 ACM/IEEE Conference on Supercomputing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2008/1966/0/04475478",
"title": "Multiple Uncertainties in Time-Variant Cosmological Particle Data",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2008/04475478/12OmNCzsKFw",
"parentPublication": {
"id": "proceedings/pacificvis/2008/1966/0",
"title": "IEEE Pacific Visualization Symposium 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498varadhan",
"title": "Out-of-Core Rendering of Massive Geometric Datasets",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498varadhan/12OmNwqft3F",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2013/9999/0/06877505",
"title": "2HOT: An improved parallel hashed oct-tree N-Body algorithm for cosmological simulation",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2013/06877505/12OmNz4SOyu",
"parentPublication": {
"id": "proceedings/sc/2013/9999/0",
"title": "2013 SC - International Conference for High Performance Computing, Networking, Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1996/2642/0/26420027",
"title": "A Parallel Cosmological Hydrodynamics Code",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1996/26420027/12OmNzvz6Gf",
"parentPublication": {
"id": "proceedings/sc/1996/2642/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1712",
"title": "Visualization of Cosmological Particle-Based Datasets",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1712/13rRUwInveX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2017/02/mcg2017020080",
"title": "Interactive Exploration of Cosmological Dark-Matter Simulation Data",
"doi": null,
"abstractUrl": "/magazine/cg/2017/02/mcg2017020080/13rRUy3gmXB",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/04376206",
"title": "Visualization of Cosmological Particle-Based Datasets",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/04376206/13rRUyuegh4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2020/5697/0/09086237",
"title": "Distribution-based Particle Data Reduction for In-situ Analysis and Visualization of Large-scale N-body Cosmological Simulations",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2020/09086237/1kuHocdddi8",
"parentPublication": {
"id": "proceedings/pacificvis/2020/5697/0",
"title": "2020 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09240061",
"title": "Polyphorm: Structural Analysis of Cosmological Datasets via Interactive Physarum Polycephalum Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09240061/1oeZSWqO6Wc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009061243",
"articleId": "13rRUxZ0o1s",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2009061259",
"articleId": "13rRUwIF69e",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesRt",
"name": "ttg2009061251s.avi",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2009061251s.avi",
"extension": "avi",
"size": "51.8 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBpEeNH",
"title": "Jan.",
"year": "2015",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "21",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjQyvm",
"doi": "10.1109/TVCG.2014.2325043",
"abstract": "Particle tracing in time-varying flow fields is traditionally performed by numerical integration of the underlying vector field. This procedure can become computationally expensive, especially in scattered, particle-based flow fields, which complicate interpolation due to the lack of an explicit neighborhood structure. If such a particle-based flow field allows for the identification of consecutive particle positions, an alternative approach to particle tracing can be employed: we substitute repeated numerical integration of vector data by geometric interpolation in the highly dynamic particle system as defined by the particle-based simulation. To allow for efficient and accurate location and interpolation of changing particle neighborhoods, we develop a modified k-d tree representation that is capable of creating a dynamic partitioning of even highly compressible data sets with strongly varying particle densities. With this representation we are able to efficiently perform pathline computation by identifying, tracking, and updating an enclosing, dynamic particle neighborhood as particles move overtime. We investigate and evaluate the complexity, accuracy, and robustness of this interpolation-based alternative approach to trajectory generation in compressible and incompressible particle systems generated by simulation techniques such as Smoothed Particle Hydrodynamics (SPH).",
"abstracts": [
{
"abstractType": "Regular",
"content": "Particle tracing in time-varying flow fields is traditionally performed by numerical integration of the underlying vector field. This procedure can become computationally expensive, especially in scattered, particle-based flow fields, which complicate interpolation due to the lack of an explicit neighborhood structure. If such a particle-based flow field allows for the identification of consecutive particle positions, an alternative approach to particle tracing can be employed: we substitute repeated numerical integration of vector data by geometric interpolation in the highly dynamic particle system as defined by the particle-based simulation. To allow for efficient and accurate location and interpolation of changing particle neighborhoods, we develop a modified k-d tree representation that is capable of creating a dynamic partitioning of even highly compressible data sets with strongly varying particle densities. With this representation we are able to efficiently perform pathline computation by identifying, tracking, and updating an enclosing, dynamic particle neighborhood as particles move overtime. We investigate and evaluate the complexity, accuracy, and robustness of this interpolation-based alternative approach to trajectory generation in compressible and incompressible particle systems generated by simulation techniques such as Smoothed Particle Hydrodynamics (SPH).",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Particle tracing in time-varying flow fields is traditionally performed by numerical integration of the underlying vector field. This procedure can become computationally expensive, especially in scattered, particle-based flow fields, which complicate interpolation due to the lack of an explicit neighborhood structure. If such a particle-based flow field allows for the identification of consecutive particle positions, an alternative approach to particle tracing can be employed: we substitute repeated numerical integration of vector data by geometric interpolation in the highly dynamic particle system as defined by the particle-based simulation. To allow for efficient and accurate location and interpolation of changing particle neighborhoods, we develop a modified k-d tree representation that is capable of creating a dynamic partitioning of even highly compressible data sets with strongly varying particle densities. With this representation we are able to efficiently perform pathline computation by identifying, tracking, and updating an enclosing, dynamic particle neighborhood as particles move overtime. We investigate and evaluate the complexity, accuracy, and robustness of this interpolation-based alternative approach to trajectory generation in compressible and incompressible particle systems generated by simulation techniques such as Smoothed Particle Hydrodynamics (SPH).",
"title": "Interpolation-Based Pathline Tracing in Particle-Based Flow Visualization",
"normalizedTitle": "Interpolation-Based Pathline Tracing in Particle-Based Flow Visualization",
"fno": "06817592",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Flow Visualisation",
"Hydrodynamics",
"Integration",
"Interpolation",
"Physics Computing",
"Scattering",
"Trees Mathematics",
"Interpolation Based Pathline Tracing",
"Particle Based Flow Visualization",
"Time Varying Flow Fields",
"Numerical Integration",
"Particle Based Flow Fields",
"Particle Position Identification",
"Geometric Interpolation",
"Highly Dynamic Particle System",
"Particle Based Simulation",
"Dynamic Partitioning",
"Compressible Data Sets",
"Dynamic Particle Neighborhood",
"Interpolation Based Alternative Approach",
"Trajectory Generation",
"Incompressible Particle Systems",
"Smoothed Particle Hydrodynamics",
"SPH",
"Modified K D Tree Representation",
"Interpolation",
"Data Visualization",
"Smoothing Methods",
"Data Models",
"Trajectory",
"Data Structures",
"Computational Modeling",
"Pathlines",
"Particle Tracing",
"SPH",
"Interpolation",
"Flow Visualization",
"Time Varying Flows"
],
"authors": [
{
"givenName": "Jennifer",
"surname": "Chandler",
"fullName": "Jennifer Chandler",
"affiliation": "Institute for Data Analysis and Visualization at the University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Harald",
"surname": "Obermaier",
"fullName": "Harald Obermaier",
"affiliation": "Institute for Data Analysis and Visualization at the University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kenneth I.",
"surname": "Joy",
"fullName": "Kenneth I. Joy",
"affiliation": "Institute for Data Analysis and Visualization at the University of California, Davis",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2015-01-01 00:00:00",
"pubType": "trans",
"pages": "68-80",
"year": "2015",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/1995/7187/0/71870077",
"title": "IFS Fractal Interpolation for 2D and 3D Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1995/71870077/12OmNwtn3x3",
"parentPublication": {
"id": "proceedings/ieee-vis/1995/7187/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciii/2011/4523/3/4523c087",
"title": "Application Research on Cubic Spline Interpolation Based on Particle Swarm Optimization in Mine Pressure Missing Data",
"doi": null,
"abstractUrl": "/proceedings-article/iciii/2011/4523c087/12OmNyFCw1n",
"parentPublication": {
"id": "proceedings/iciii/2011/4523/3",
"title": "International Conference on Information Management, Innovation Management and Industrial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2012/4789/0/4789a655",
"title": "Four-Order Interpolation Algorithms for Charge Conservation in Particle-in-Cell Method",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2012/4789a655/12OmNyL0TP2",
"parentPublication": {
"id": "proceedings/iccis/2012/4789/0",
"title": "2012 Fourth International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2015/6879/0/07156380",
"title": "Uncertainty modeling and error reduction for pathline computation in time-varying flow fields",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156380/12OmNyywxES",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2018/1424/0/142401a076",
"title": "Access Pattern Learning with Long Short-Term Memory for Parallel Particle Tracing",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2018/142401a076/12OmNzwHvbM",
"parentPublication": {
"id": "proceedings/pacificvis/2018/1424/0",
"title": "2018 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1996/02/v0120",
"title": "Interactive time-dependent particle tracing using tetrahedral decomposition",
"doi": null,
"abstractUrl": "/journal/tg/1996/02/v0120/13rRUwI5TXo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/08/07243356",
"title": "Fast Coherent Particle Advection through Time-Varying Unstructured Flow Datasets",
"doi": null,
"abstractUrl": "/journal/tg/2016/08/07243356/13rRUx0xPIN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2022/02/09720179",
"title": "Point Containment Queries on Ray-Tracing Cores for AMR Flow Visualization",
"doi": null,
"abstractUrl": "/magazine/cs/2022/02/09720179/1Befbp1QU2k",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a140",
"title": "Efficient Interpolation-based Pathline Tracing with B-spline Curves in Particle Dataset",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a140/1J6h50tUJeo",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdataservice/2019/0059/0/005900a019",
"title": "A Scientific Data Representation Through Particle Flow Based Linear Interpolation",
"doi": null,
"abstractUrl": "/proceedings-article/bigdataservice/2019/005900a019/1dDLWCwL7Wg",
"parentPublication": {
"id": "proceedings/bigdataservice/2019/0059/0",
"title": "2019 IEEE Fifth International Conference on Big Data Computing Service and Applications (BigDataService)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06824802",
"articleId": "13rRUwInvsT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06832613",
"articleId": "13rRUzp02on",
"__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": "13rRUyuegh4",
"doi": "10.1109/TVCG.2007.70526",
"abstract": "We describe our visualization process for a particle-based simulation of the formation of the first stars and their impact on cosmic history. The dataset consists of several hundred time-steps of point simulation data, with each time-step containing approximately two million point particles. For each time-step, we interpolate the point data onto a regular grid using a method taken from the radiance estimate of photon mapping [21]. We import the resulting regular grid representation into ParaView [24], with which we extract isosurfaces across multiple variables. Our images provide insights into the evolution of the early universe, tracing the cosmic transition from an initially homogeneous state to one of increasing complexity. Specifically, our visualizations capture the build-up of regions of ionized gas around the first stars, their evolution, and their complex interactions with the surrounding matter. These observations will guide the upcoming James Webb Space Telescope, the key astronomy mission of the next decade.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We describe our visualization process for a particle-based simulation of the formation of the first stars and their impact on cosmic history. The dataset consists of several hundred time-steps of point simulation data, with each time-step containing approximately two million point particles. For each time-step, we interpolate the point data onto a regular grid using a method taken from the radiance estimate of photon mapping [21]. We import the resulting regular grid representation into ParaView [24], with which we extract isosurfaces across multiple variables. Our images provide insights into the evolution of the early universe, tracing the cosmic transition from an initially homogeneous state to one of increasing complexity. Specifically, our visualizations capture the build-up of regions of ionized gas around the first stars, their evolution, and their complex interactions with the surrounding matter. These observations will guide the upcoming James Webb Space Telescope, the key astronomy mission of the next decade.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We describe our visualization process for a particle-based simulation of the formation of the first stars and their impact on cosmic history. The dataset consists of several hundred time-steps of point simulation data, with each time-step containing approximately two million point particles. For each time-step, we interpolate the point data onto a regular grid using a method taken from the radiance estimate of photon mapping [21]. We import the resulting regular grid representation into ParaView [24], with which we extract isosurfaces across multiple variables. Our images provide insights into the evolution of the early universe, tracing the cosmic transition from an initially homogeneous state to one of increasing complexity. Specifically, our visualizations capture the build-up of regions of ionized gas around the first stars, their evolution, and their complex interactions with the surrounding matter. These observations will guide the upcoming James Webb Space Telescope, the key astronomy mission of the next decade.",
"title": "Visualization of Cosmological Particle-Based Datasets",
"normalizedTitle": "Visualization of Cosmological Particle-Based Datasets",
"fno": "04376206",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Astronomical Image Processing",
"Cosmology",
"Data Visualisation",
"Star Formation",
"Stellar Evolution",
"Cosmological Particle Based Dataset Visualization",
"Particle Based Simulation",
"First Stars Formation",
"Cosmic History",
"Point Simulation Data Interpolation",
"Photon Mapping",
"Grid Representation",
"Para View",
"Isosurface Extraction",
"Early Universe Evolution",
"Cosmic Transition Tracing",
"Astronomy Mission",
"Isosurfaces",
"Data Mining",
"Astronomy",
"Chemical Elements",
"Hydrogen",
"Data Visualization",
"History",
"Space Missions",
"Telescopes",
"Interpolation",
"Isosurface",
"Astronomy",
"Cosmology"
],
"authors": [
{
"givenName": "Paul",
"surname": "Navratil",
"fullName": "Paul Navratil",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jarrett",
"surname": "Johnson",
"fullName": "Jarrett Johnson",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Volker",
"surname": "Bromm",
"fullName": "Volker Bromm",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2007-11-01 00:00:00",
"pubType": "trans",
"pages": "1712-1718",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ldav/2012/4733/0/06378961",
"title": "Panning and zooming the observable universe with prefix-matching indices and pixel-based overlays",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2012/06378961/12OmNApu5tJ",
"parentPublication": {
"id": "proceedings/ldav/2012/4733/0",
"title": "2012 IEEE Symposium on Large Data Analysis and Visualization (LDAV 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2011/0155/0/06092337",
"title": "Pixel-based overlays for navigating a galaxy of observations",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2011/06092337/12OmNBKEytn",
"parentPublication": {
"id": "proceedings/ldav/2011/0155/0",
"title": "IEEE Symposium on Large Data Analysis and Visualization (LDAV 2011)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ucc/2011/2116/0/06123479",
"title": "An Efficient Cross-Match Implementation Based on Directed Join Algorithm in MapReduce",
"doi": null,
"abstractUrl": "/proceedings-article/ucc/2011/06123479/12OmNBSjJ1X",
"parentPublication": {
"id": "proceedings/ucc/2011/2116/0",
"title": "2011 IEEE 4th International Conference on Utility and Cloud Computing (UCC 2011)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2012/4675/0/4675b105",
"title": "Radio Astronomy Beam Forming on Many-Core Architectures",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2012/4675b105/12OmNx19k4a",
"parentPublication": {
"id": "proceedings/ipdps/2012/4675/0",
"title": "Parallel and Distributed Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660033",
"title": "Reflection Nebula Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660033/12OmNx8wTgX",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1992/2915/0/00201748",
"title": "A feature-based O(N/sup 2/) approach to point pattern matching",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1992/00201748/12OmNxRnvOA",
"parentPublication": {
"id": "proceedings/icpr/1992/2915/0",
"title": "11th IAPR International Conference on Pattern Recognition. Vol.II. Conference B: Pattern Recognition Methodology and Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200wei",
"title": "Case Study: Visualization of Particle Track Data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200wei/12OmNzTYBSw",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2018/03/mcg2018030044",
"title": "OpenSpace: Changing the Narrative of Public Dissemination in Astronomical Visualization from What to How",
"doi": null,
"abstractUrl": "/magazine/cg/2018/03/mcg2018030044/13rRUEgariG",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1712",
"title": "Visualization of Cosmological Particle-Based Datasets",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1712/13rRUwInveX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011121862",
"title": "Visualization of AMR Data With Multi-Level Dual-Mesh Interpolation",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011121862/13rRUxd2aYY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1600",
"articleId": "13rRUyeTVhV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1608",
"articleId": "13rRUILLkDG",
"__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": "17D45Vw15vd",
"doi": "10.1109/TVCG.2018.2864850",
"abstract": "Adaptive mesh refinement (AMR) is a key technology for large-scale simulations that allows for adaptively changing the simulation mesh resolution, resulting in significant computational and storage savings. However, visualizing such AMR data poses a significant challenge due to the difficulties introduced by the hierarchical representation when reconstructing continuous field values. In this paper, we detail a comprehensive solution for interactive isosurface rendering of block-structured AMR data. We contribute a novel reconstruction strategy-the octant method-which is continuous, adaptive and simple to implement. Furthermore, we present a generally applicable hybrid implicit isosurface ray-tracing method, which provides better rendering quality and performance than the built-in sampling-based approach in OSPRay. Finally, we integrate our octant method and hybrid isosurface geometry into OSPRay as a module, providing the ability to create high-quality interactive visualizations combining volume and isosurface representations of BS-AMR data. We evaluate the rendering performance, memory consumption and quality of our method on two gigascale block-structured AMR datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Adaptive mesh refinement (AMR) is a key technology for large-scale simulations that allows for adaptively changing the simulation mesh resolution, resulting in significant computational and storage savings. However, visualizing such AMR data poses a significant challenge due to the difficulties introduced by the hierarchical representation when reconstructing continuous field values. In this paper, we detail a comprehensive solution for interactive isosurface rendering of block-structured AMR data. We contribute a novel reconstruction strategy-the octant method-which is continuous, adaptive and simple to implement. Furthermore, we present a generally applicable hybrid implicit isosurface ray-tracing method, which provides better rendering quality and performance than the built-in sampling-based approach in OSPRay. Finally, we integrate our octant method and hybrid isosurface geometry into OSPRay as a module, providing the ability to create high-quality interactive visualizations combining volume and isosurface representations of BS-AMR data. We evaluate the rendering performance, memory consumption and quality of our method on two gigascale block-structured AMR datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Adaptive mesh refinement (AMR) is a key technology for large-scale simulations that allows for adaptively changing the simulation mesh resolution, resulting in significant computational and storage savings. However, visualizing such AMR data poses a significant challenge due to the difficulties introduced by the hierarchical representation when reconstructing continuous field values. In this paper, we detail a comprehensive solution for interactive isosurface rendering of block-structured AMR data. We contribute a novel reconstruction strategy-the octant method-which is continuous, adaptive and simple to implement. Furthermore, we present a generally applicable hybrid implicit isosurface ray-tracing method, which provides better rendering quality and performance than the built-in sampling-based approach in OSPRay. Finally, we integrate our octant method and hybrid isosurface geometry into OSPRay as a module, providing the ability to create high-quality interactive visualizations combining volume and isosurface representations of BS-AMR data. We evaluate the rendering performance, memory consumption and quality of our method on two gigascale block-structured AMR datasets.",
"title": "CPU Isosurface Ray Tracing of Adaptive Mesh Refinement Data",
"normalizedTitle": "CPU Isosurface Ray Tracing of Adaptive Mesh Refinement Data",
"fno": "08493612",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Geometry",
"Data Visualisation",
"Interactive Systems",
"Mesh Generation",
"Microprocessor Chips",
"Ray Tracing",
"Rendering Computer Graphics",
"CPU Isosurface Ray Tracing",
"Adaptive Mesh Refinement Data",
"Simulation Mesh Resolution",
"Continuous Field Values",
"Interactive Isosurface Rendering",
"OSP Ray",
"Octant Method",
"Hybrid Isosurface Geometry",
"BS AMR Data",
"Gigascale Block Structured AMR Datasets",
"Reconstruction Strategy",
"Computational Storage Savings",
"Interactive Visualizations",
"Isosurfaces",
"Rendering Computer Graphics",
"Ray Tracing",
"Computational Modeling",
"Reconstruction Algorithms",
"AMR",
"Isosurface",
"Ray Tracing",
"Reconstruction Strategy",
"OSP Ray"
],
"authors": [
{
"givenName": "Feng",
"surname": "Wang",
"fullName": "Feng Wang",
"affiliation": "Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, UT",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ingo",
"surname": "Wald",
"fullName": "Ingo Wald",
"affiliation": "Intel Corporation",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qi",
"surname": "Wu",
"fullName": "Qi Wu",
"affiliation": "Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, UT",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Will",
"surname": "Usher",
"fullName": "Will Usher",
"affiliation": "Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, UT",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chris R.",
"surname": "Johnson",
"fullName": "Chris R. Johnson",
"affiliation": "Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, UT",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "1142-1151",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pvg/2003/2091/0/20910012",
"title": "Distributed Interactive Ray Tracing for Large Volume Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pvg/2003/20910012/12OmNBsue7j",
"parentPublication": {
"id": "proceedings/pvg/2003/2091/0",
"title": "Parallel and Large-Data Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rt/2006/0693/0/04061553",
"title": "Interactive Isosurface Ray Tracing of Large Octree Volumes",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2006/04061553/12OmNwlqhK9",
"parentPublication": {
"id": "proceedings/rt/2006/0693/0",
"title": "IEEE Symposium on Interactive Ray Tracing 2006",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pvgs/2003/8122/0/01249046",
"title": "Distributed interactive ray tracing for large volume visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pvgs/2003/01249046/12OmNz2TCDv",
"parentPublication": {
"id": "proceedings/pvgs/2003/8122/0",
"title": "IEEE Symposium on Parallel and Large-Data Visualization and Graphics 2003",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2000/0868/0/08680165",
"title": "Modeling an Isosurface with a Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2000/08680165/12OmNzYeAUP",
"parentPublication": {
"id": "proceedings/pg/2000/0868/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/03/ttg2008030603",
"title": "Interactive High-Resolution Isosurface Ray Casting on Multicore Processors",
"doi": null,
"abstractUrl": "/journal/tg/2008/03/ttg2008030603/13rRUEgs2LW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/01/v0114",
"title": "Ray-Tracing Polymorphic Multidomain Spectral/hp Elements for Isosurface Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2006/01/v0114/13rRUIM2VBx",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/05/v0562",
"title": "Faster Isosurface Ray Tracing Using Implicit KD-Trees",
"doi": null,
"abstractUrl": "/journal/tg/2005/05/v0562/13rRUwkfAZ5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1727",
"title": "Interactive Isosurface Ray Tracing of Time-Varying Tetrahedral Volumes",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1727/13rRUxZRbnV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539599",
"title": "OSPRay - A CPU Ray Tracing Framework for Scientific Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539599/13rRUyfKIHS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222372",
"title": "Ray Tracing Structured AMR Data Using ExaBricks",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222372/1nTqdQ0THGw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08444102",
"articleId": "17D45WrVg7e",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08457259",
"articleId": "17D45We0UET",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzxgHw9",
"title": "September/October",
"year": "2007",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILLkvi",
"doi": "10.1109/TVCG.2007.1062",
"abstract": "This study was initiated by the scientifically interesting prospect of applying advanced visualization techniques to gain further insight into various spatio-temporal characteristics of turbulent flows. The ability to study complex kinematical and dynamical features of turbulence provides means of extracting the underlying physics of turbulent fluid motion. The objective is to analyze the use of a vorticity field line approach to study numerically generated incompressible turbulent flows. In order to study the vorticity field, we present a field line animation technique which uses a specialized particle advection and seeding strategy. Efficient analysis is achieved by decoupling the rendering stage from the preceding stages of the visualization method. This allows interactive exploration of multiple fields simultaneously, which sets the stage for a more complete analysis of the flow field. Multifield visualizations are obtained using a flexible volume rendering framework which is presented in this paper. Vorticity field lines have been employed as indicators to provide a means to identify \"ejection\" and \"sweep\" regions; two particularly important spatio-temporal events in wall-bounded turbulent flows. Their relation to the rate of turbulent kinetic energy production and viscous dissipation, respectively, have been identified.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This study was initiated by the scientifically interesting prospect of applying advanced visualization techniques to gain further insight into various spatio-temporal characteristics of turbulent flows. The ability to study complex kinematical and dynamical features of turbulence provides means of extracting the underlying physics of turbulent fluid motion. The objective is to analyze the use of a vorticity field line approach to study numerically generated incompressible turbulent flows. In order to study the vorticity field, we present a field line animation technique which uses a specialized particle advection and seeding strategy. Efficient analysis is achieved by decoupling the rendering stage from the preceding stages of the visualization method. This allows interactive exploration of multiple fields simultaneously, which sets the stage for a more complete analysis of the flow field. Multifield visualizations are obtained using a flexible volume rendering framework which is presented in this paper. Vorticity field lines have been employed as indicators to provide a means to identify \"ejection\" and \"sweep\" regions; two particularly important spatio-temporal events in wall-bounded turbulent flows. Their relation to the rate of turbulent kinetic energy production and viscous dissipation, respectively, have been identified.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This study was initiated by the scientifically interesting prospect of applying advanced visualization techniques to gain further insight into various spatio-temporal characteristics of turbulent flows. The ability to study complex kinematical and dynamical features of turbulence provides means of extracting the underlying physics of turbulent fluid motion. The objective is to analyze the use of a vorticity field line approach to study numerically generated incompressible turbulent flows. In order to study the vorticity field, we present a field line animation technique which uses a specialized particle advection and seeding strategy. Efficient analysis is achieved by decoupling the rendering stage from the preceding stages of the visualization method. This allows interactive exploration of multiple fields simultaneously, which sets the stage for a more complete analysis of the flow field. Multifield visualizations are obtained using a flexible volume rendering framework which is presented in this paper. Vorticity field lines have been employed as indicators to provide a means to identify \"ejection\" and \"sweep\" regions; two particularly important spatio-temporal events in wall-bounded turbulent flows. Their relation to the rate of turbulent kinetic energy production and viscous dissipation, respectively, have been identified.",
"title": "Visualization of Vorticity and Vortices in Wall-Bounded Turbulent Flows",
"normalizedTitle": "Visualization of Vorticity and Vortices in Wall-Bounded Turbulent Flows",
"fno": "v1055",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"3 D Vector Field Visualization",
"Unsteady Flow Visualization",
"Time Varying Volume Data",
"Features In Volume Data Sets",
"Multifield Visualization",
"Fluid Dynamics",
"Turbulence"
],
"authors": [
{
"givenName": "Anders",
"surname": "Helgeland",
"fullName": "Anders Helgeland",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "B. Anders",
"surname": "Pettersson Reif",
"fullName": "B. Anders Pettersson Reif",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "?yvind",
"surname": "Andreassen",
"fullName": "?yvind Andreassen",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Carl Erik",
"surname": "Wasberg",
"fullName": "Carl Erik Wasberg",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2007-09-01 00:00:00",
"pubType": "trans",
"pages": "1055-1067",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visual/1994/6627/0/00346327",
"title": "Vortex tubes in turbulent flows: identification, representation, reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1994/00346327/12OmNAIvcXE",
"parentPublication": {
"id": "proceedings/visual/1994/6627/0",
"title": "Proceedings Visualization '94",
"__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/hpcmp-ugc/2006/2797/0/27970148",
"title": "Unsteady Naval Hydrodynamic Computations Using Lagrangian Vorticity Methods",
"doi": null,
"abstractUrl": "/proceedings-article/hpcmp-ugc/2006/27970148/12OmNxFsmkT",
"parentPublication": {
"id": "proceedings/hpcmp-ugc/2006/2797/0",
"title": "HPCMP Users Group Conference",
"__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": "trans/tg/2008/03/ttg2008030615",
"title": "Parallel Vectors Criteria for Unsteady Flow Vortices",
"doi": null,
"abstractUrl": "/journal/tg/2008/03/ttg2008030615/13rRUxAASSW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1998/02/i0193",
"title": "Extracting 3D Vortices in Turbulent Fluid Flow",
"doi": null,
"abstractUrl": "/journal/tp/1998/02/i0193/13rRUxASuTT",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/03/07845705",
"title": "Animating Wall-Bounded Turbulent Smoke via Filament-Mesh Particle-Particle Method",
"doi": null,
"abstractUrl": "/journal/tg/2018/03/07845705/13rRUxBJhvD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2022/9156/0/09966403",
"title": "Topological Analysis of Ensembles of Hydrodynamic Turbulent Flows An Experimental Study",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2022/09966403/1IT0Ck3lBg4",
"parentPublication": {
"id": "proceedings/ldav/2022/9156/0",
"title": "2022 IEEE 12th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/11/08727493",
"title": "Detection and Visualization of Splat and Antisplat Events in Turbulent Flows",
"doi": null,
"abstractUrl": "/journal/tg/2020/11/08727493/1atT2xTflII",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798224",
"title": "Viscosity-based Vorticity Correction for Turbulent SPH Fluids",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798224/1cJ1aEpf4wo",
"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": "v1041",
"articleId": "13rRUyYSWkU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1067",
"articleId": "13rRUwhpBO1",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzVoBCx",
"title": "April",
"year": "2011",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyYSWsO",
"doi": "10.1109/TVCG.2010.65",
"abstract": "In this paper, we present a visualization and tracking system for coherent structures. For this purpose, we propose to consider shear stress—the stretching and shear of particles inside a flow—in vortex dynamics. Based on a discussion and comparison of recent methods for computing shear stress, we introduce visualization techniques in order to provide a representation of shear layers according to their physical interpretation. This paper contributes a combination of theory in fluid mechanics and the corresponding visualization: 1) shear layer criteria are assessed according to how well they can be combined with common vortex identification criteria; 2) sheets of maximal shear are introduced as an appropriate visual representation of shear layers; 3) a visualization method is described for simultaneous tracking of vortices and shear layers as well as their interaction; and 4) the relevance of shear layers in vortex dynamics is demonstrated by means of several examples. We have implemented these new techniques in an interactive visualization system for time-dependent 3D flow. The system is used by fluid mechanics experts in their research of shear-vortex interaction.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present a visualization and tracking system for coherent structures. For this purpose, we propose to consider shear stress—the stretching and shear of particles inside a flow—in vortex dynamics. Based on a discussion and comparison of recent methods for computing shear stress, we introduce visualization techniques in order to provide a representation of shear layers according to their physical interpretation. This paper contributes a combination of theory in fluid mechanics and the corresponding visualization: 1) shear layer criteria are assessed according to how well they can be combined with common vortex identification criteria; 2) sheets of maximal shear are introduced as an appropriate visual representation of shear layers; 3) a visualization method is described for simultaneous tracking of vortices and shear layers as well as their interaction; and 4) the relevance of shear layers in vortex dynamics is demonstrated by means of several examples. We have implemented these new techniques in an interactive visualization system for time-dependent 3D flow. The system is used by fluid mechanics experts in their research of shear-vortex interaction.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present a visualization and tracking system for coherent structures. For this purpose, we propose to consider shear stress—the stretching and shear of particles inside a flow—in vortex dynamics. Based on a discussion and comparison of recent methods for computing shear stress, we introduce visualization techniques in order to provide a representation of shear layers according to their physical interpretation. This paper contributes a combination of theory in fluid mechanics and the corresponding visualization: 1) shear layer criteria are assessed according to how well they can be combined with common vortex identification criteria; 2) sheets of maximal shear are introduced as an appropriate visual representation of shear layers; 3) a visualization method is described for simultaneous tracking of vortices and shear layers as well as their interaction; and 4) the relevance of shear layers in vortex dynamics is demonstrated by means of several examples. We have implemented these new techniques in an interactive visualization system for time-dependent 3D flow. The system is used by fluid mechanics experts in their research of shear-vortex interaction.",
"title": "Visualizing the Evolution and Interaction of Vortices and Shear Layers in Time-Dependent 3D Flow",
"normalizedTitle": "Visualizing the Evolution and Interaction of Vortices and Shear Layers in Time-Dependent 3D Flow",
"fno": "ttg2011040412",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Flow Visualization",
"Tracking",
"Coherent Structures",
"Vortex Dynamics",
"Shear Layers"
],
"authors": [
{
"givenName": "Tobias",
"surname": "Schafhitzel",
"fullName": "Tobias Schafhitzel",
"affiliation": "Universität Stuttgart, Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kudret",
"surname": "Baysal",
"fullName": "Kudret Baysal",
"affiliation": "Universität Stuttgart, Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mikael",
"surname": "Vaaraniemi",
"fullName": "Mikael Vaaraniemi",
"affiliation": "Universität Stuttgart, Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ulrich",
"surname": "Rist",
"fullName": "Ulrich Rist",
"affiliation": "Universität Stuttgart, Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Weiskopf",
"fullName": "Daniel Weiskopf",
"affiliation": "Universität Stuttgart, Stuttgart",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2011-04-01 00:00:00",
"pubType": "trans",
"pages": "412-425",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2000/6478/0/64780019",
"title": "Shock and Vortex Visualization Using a Combined Visual/Haptic Interface",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780019/12OmNCmGNWb",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1999/1966/0/19660062",
"title": "Numerical Simulation and Immersive Visualization of Hairpin Vortices",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1999/19660062/12OmNvT2p7j",
"parentPublication": {
"id": "proceedings/sc/1999/1966/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1993/4340/0/01263427",
"title": "Computational fluid mechanics and massively parallel processors",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1993/01263427/12OmNzBwGre",
"parentPublication": {
"id": "proceedings/sc/1993/4340/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iita/2009/3859/1/3859a140",
"title": "Effect of Tension Coiler on Temperature Field among Layers for Hot Strip",
"doi": null,
"abstractUrl": "/proceedings-article/iita/2009/3859a140/12OmNzy7uUW",
"parentPublication": {
"id": "proceedings/iita/2009/3859/1",
"title": "2009 Third International Symposium on Intelligent Information Technology Application",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/05/ttg2009050709",
"title": "Case Study on Visualizing Hurricanes Using Illustration-Inspired Techniques",
"doi": null,
"abstractUrl": "/journal/tg/2009/05/ttg2009050709/13rRUwI5UfZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192679",
"title": "Extracting, Tracking, and Visualizing Magnetic Flux Vortices in 3D Complex-Valued Superconductor Simulation Data",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192679/13rRUwInvJi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/03/ttg2008030615",
"title": "Parallel Vectors Criteria for Unsteady Flow Vortices",
"doi": null,
"abstractUrl": "/journal/tg/2008/03/ttg2008030615/13rRUxAASSW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1993/4340/0/01263427",
"title": "Computational fluid mechanics and massively parallel processors",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1993/01263427/1D85Cvp8XM4",
"parentPublication": {
"id": "proceedings/sc/1993/4340/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1999/1966/0/01592705",
"title": "Numerical Simulation and Immersive Visualization of Hairpin Vortices",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1999/01592705/1D85OmvXRV6",
"parentPublication": {
"id": "proceedings/sc/1999/1966/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/02/09599597",
"title": "Dynamic Mode Decomposition for Large-Scale Coherent Structure Extraction in Shear Flows",
"doi": null,
"abstractUrl": "/journal/tg/2023/02/09599597/1yeCaMmiM3S",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011040393",
"articleId": "13rRUwbs20T",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011040426",
"articleId": "13rRUy2YLYq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNviZlCS",
"title": "Aug.",
"year": "2015",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "21",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwI5U2J",
"doi": "10.1109/TVCG.2014.2369036",
"abstract": "The analysis of 2D flow data is often guided by the search for characteristic structures with semantic meaning. One way to approach this question is to identify structures of interest by a human observer, with the goal of finding similar structures in the same or other datasets. The major challenges related to this task are to specify the notion of similarity and define respective pattern descriptors. While the descriptors should be invariant to certain transformations, such as rotation and scaling, they should provide a similarity measure with respect to other transformations, such as deformations. In this paper, we propose to use moment invariants as pattern descriptors for flow fields. Moment invariants are one of the most popular techniques for the description of objects in the field of image recognition. They have recently also been applied to identify 2D vector patterns limited to the directional properties of flow fields. Moreover, we discuss which transformations should be considered for the application to flow analysis. In contrast to previous work, we follow the intuitive approach of moment normalization, which results in a complete and independent set of translation, rotation, and scaling invariant flow field descriptors. They also allow to distinguish flow features with different velocity profiles. We apply the moment invariants in a pattern recognition algorithm to a real world dataset and show that the theoretical results can be extended to discrete functions in a robust way.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The analysis of 2D flow data is often guided by the search for characteristic structures with semantic meaning. One way to approach this question is to identify structures of interest by a human observer, with the goal of finding similar structures in the same or other datasets. The major challenges related to this task are to specify the notion of similarity and define respective pattern descriptors. While the descriptors should be invariant to certain transformations, such as rotation and scaling, they should provide a similarity measure with respect to other transformations, such as deformations. In this paper, we propose to use moment invariants as pattern descriptors for flow fields. Moment invariants are one of the most popular techniques for the description of objects in the field of image recognition. They have recently also been applied to identify 2D vector patterns limited to the directional properties of flow fields. Moreover, we discuss which transformations should be considered for the application to flow analysis. In contrast to previous work, we follow the intuitive approach of moment normalization, which results in a complete and independent set of translation, rotation, and scaling invariant flow field descriptors. They also allow to distinguish flow features with different velocity profiles. We apply the moment invariants in a pattern recognition algorithm to a real world dataset and show that the theoretical results can be extended to discrete functions in a robust way.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The analysis of 2D flow data is often guided by the search for characteristic structures with semantic meaning. One way to approach this question is to identify structures of interest by a human observer, with the goal of finding similar structures in the same or other datasets. The major challenges related to this task are to specify the notion of similarity and define respective pattern descriptors. While the descriptors should be invariant to certain transformations, such as rotation and scaling, they should provide a similarity measure with respect to other transformations, such as deformations. In this paper, we propose to use moment invariants as pattern descriptors for flow fields. Moment invariants are one of the most popular techniques for the description of objects in the field of image recognition. They have recently also been applied to identify 2D vector patterns limited to the directional properties of flow fields. Moreover, we discuss which transformations should be considered for the application to flow analysis. In contrast to previous work, we follow the intuitive approach of moment normalization, which results in a complete and independent set of translation, rotation, and scaling invariant flow field descriptors. They also allow to distinguish flow features with different velocity profiles. We apply the moment invariants in a pattern recognition algorithm to a real world dataset and show that the theoretical results can be extended to discrete functions in a robust way.",
"title": "Moment Invariants for 2D Flow Fields via Normalization in Detail",
"normalizedTitle": "Moment Invariants for 2D Flow Fields via Normalization in Detail",
"fno": "06951493",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Vectors",
"Standards",
"Pattern Recognition",
"Transforms",
"Shape",
"Electronic Mail",
"Convolution",
"Normalization",
"Moments",
"Moment Invariants",
"Pattern Recognition",
"Flow Visualization"
],
"authors": [
{
"givenName": "Roxana",
"surname": "Bujack",
"fullName": "Roxana Bujack",
"affiliation": "Department of Computer Science, Leipzig University, Leipzig, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ingrid",
"surname": "Hotz",
"fullName": "Ingrid Hotz",
"affiliation": "Department of Simulation and Software Technology, German Aerospace Center, Braunschweig, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gerik",
"surname": "Scheuermann",
"fullName": "Gerik Scheuermann",
"affiliation": "Department of Computer Science, Leipzig University, Leipzig, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eckhard",
"surname": "Hitzer",
"fullName": "Eckhard Hitzer",
"affiliation": "Department of Material Science, International Christian University, Tokyo, Japan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2015-08-01 00:00:00",
"pubType": "trans",
"pages": "916-929",
"year": "2015",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2015/6879/0/07156350",
"title": "Moment invariants for 3D flow fields via normalization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156350/12OmNBpEeTF",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2006/2521/4/252140173",
"title": "3-D Surface Moment Invariants",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2006/252140173/12OmNwF0C2M",
"parentPublication": {
"id": "proceedings/icpr/2006/2521/4",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a041",
"title": "Moment Invariants for 2D Flow Fields Using Normalization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a041/12OmNyRg4tb",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isise/2008/3494/1/3494a249",
"title": "Moment Invariants of Restricted Projective Transformations",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2008/3494a249/12OmNzBwGFy",
"parentPublication": {
"id": "proceedings/isise/2008/3494/1",
"title": "2008 International Symposium on Information Science and Engieering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2009/3583/2/3583b013",
"title": "A Method to Derive Moment Invariants",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2009/3583b013/12OmNzuIjfq",
"parentPublication": {
"id": "proceedings/icmtma/2009/3583/2",
"title": "2009 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1991/08/i0830",
"title": "The revised Fundamental Theorem of Moment Invariants",
"doi": null,
"abstractUrl": "/journal/tp/1991/08/i0830/13rRUEgaroH",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1996/04/i0366",
"title": "The Method of Normalization to Determine Invariants",
"doi": null,
"abstractUrl": "/journal/tp/1996/04/i0366/13rRUxASuiH",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1980/02/04766990",
"title": "Three-Dimensional Moment Invariants",
"doi": null,
"abstractUrl": "/journal/tp/1980/02/04766990/13rRUy3xY3p",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1743",
"title": "Moment Invariants for the Analysis of 2D Flow Fields",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1743/13rRUyoPSP0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06960909",
"articleId": "13rRUxCitJf",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07117431",
"articleId": "13rRUwhHcJl",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCctfeN",
"title": "June",
"year": "1984",
"issueNum": "06",
"idPrefix": "tp",
"pubType": "journal",
"volume": "6",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxD9gYv",
"doi": "10.1109/TPAMI.1984.4767594",
"abstract": "Moment invariants are evaluated as a feature space for pattern recognition in terms of discrimination power and noise tolerance. The notion of complex moments is introduced as a simple and straightforward way to derive moment invariants. Through this relation, properties of complex moments are used to characterize moment invariants. Aspects of information loss, suppression, and redundancy encountered in moment invariants are investigated and significant results are derived. The behavior of moment invariants in the presence of additive noise is also described.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Moment invariants are evaluated as a feature space for pattern recognition in terms of discrimination power and noise tolerance. The notion of complex moments is introduced as a simple and straightforward way to derive moment invariants. Through this relation, properties of complex moments are used to characterize moment invariants. Aspects of information loss, suppression, and redundancy encountered in moment invariants are investigated and significant results are derived. The behavior of moment invariants in the presence of additive noise is also described.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Moment invariants are evaluated as a feature space for pattern recognition in terms of discrimination power and noise tolerance. The notion of complex moments is introduced as a simple and straightforward way to derive moment invariants. Through this relation, properties of complex moments are used to characterize moment invariants. Aspects of information loss, suppression, and redundancy encountered in moment invariants are investigated and significant results are derived. The behavior of moment invariants in the presence of additive noise is also described.",
"title": "Recognitive Aspects of Moment Invariants",
"normalizedTitle": "Recognitive Aspects of Moment Invariants",
"fno": "04767594",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [],
"authors": [
{
"givenName": "Yaser S.",
"surname": "Abu-Mostafa",
"fullName": "Yaser S. Abu-Mostafa",
"affiliation": "Division of Engineering and Applied Science, California Institute of Technology, Pasadena, CA 91125.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Demetri",
"surname": "Psaltis",
"fullName": "Demetri Psaltis",
"affiliation": "Division of Engineering and Applied Science, California Institute of Technology, Pasadena, CA 91125.",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "1984-11-01 00:00:00",
"pubType": "trans",
"pages": "698-706",
"year": "1984",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icassp/2009/2353/0/04959990",
"title": "Degraded image analysis using Zernike moment invariants",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2009/04959990/12OmNA1mbdg",
"parentPublication": {
"id": "proceedings/icassp/2009/2353/0",
"title": "Acoustics, Speech, and Signal Processing, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2015/6879/0/07156350",
"title": "Moment invariants for 3D flow fields via normalization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156350/12OmNBpEeTF",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wcse/2009/3570/3/3570c018",
"title": "Vehicle-logo Recognition Method Based on Tchebichef Moment Invariants and SVM",
"doi": null,
"abstractUrl": "/proceedings-article/wcse/2009/3570c018/12OmNBuL1me",
"parentPublication": {
"id": "proceedings/wcse/2009/3570/2",
"title": "2009 WRI World Congress on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2006/2521/4/252140173",
"title": "3-D Surface Moment Invariants",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2006/252140173/12OmNwF0C2M",
"parentPublication": {
"id": "proceedings/icpr/2006/2521/4",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2009/3583/2/3583b013",
"title": "A Method to Derive Moment Invariants",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2009/3583b013/12OmNzuIjfq",
"parentPublication": {
"id": "proceedings/icmtma/2009/3583/2",
"title": "2009 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1981/02/04767087",
"title": "Radial and Angular Moment Invariants for Image Identification",
"doi": null,
"abstractUrl": "/journal/tp/1981/02/04767087/13rRUwcAqqV",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1980/02/04766990",
"title": "Three-Dimensional Moment Invariants",
"doi": null,
"abstractUrl": "/journal/tp/1980/02/04766990/13rRUy3xY3p",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1743",
"title": "Moment Invariants for the Analysis of 2D Flow Fields",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1743/13rRUyoPSP0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "04767593",
"articleId": "13rRUxAAThl",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04767595",
"articleId": "13rRUynHujW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNB9bvm0",
"title": "February",
"year": "1980",
"issueNum": "02",
"idPrefix": "tp",
"pubType": "journal",
"volume": "2",
"label": "February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy3xY3p",
"doi": "10.1109/TPAMI.1980.4766990",
"abstract": "Recognition of three-dimensional objects independent of size, position, and orientation is an important and difficult problem of scene analysis. The use of three-dimensional moment invariants is proposed as a solution. The generalization of the results of two-dimensional moment invariants which had linked two-dimensional moments to binary quantics is done by linking three-dimensional moments to ternary quantics. The existence and number of nth order moments in two and three dimensions is explored. Algebraic invariants of several ternary forms under different orthogonal transformations are derived by using the invariant property of coefficients of ternary forms. The result is a set of three-dimensional moment invariants which are invariant under size, orientation, and position change. This property is highly significant in compressing the data which are needed in three-dimensional object recognition. Empirical examples are also given.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recognition of three-dimensional objects independent of size, position, and orientation is an important and difficult problem of scene analysis. The use of three-dimensional moment invariants is proposed as a solution. The generalization of the results of two-dimensional moment invariants which had linked two-dimensional moments to binary quantics is done by linking three-dimensional moments to ternary quantics. The existence and number of nth order moments in two and three dimensions is explored. Algebraic invariants of several ternary forms under different orthogonal transformations are derived by using the invariant property of coefficients of ternary forms. The result is a set of three-dimensional moment invariants which are invariant under size, orientation, and position change. This property is highly significant in compressing the data which are needed in three-dimensional object recognition. Empirical examples are also given.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recognition of three-dimensional objects independent of size, position, and orientation is an important and difficult problem of scene analysis. The use of three-dimensional moment invariants is proposed as a solution. The generalization of the results of two-dimensional moment invariants which had linked two-dimensional moments to binary quantics is done by linking three-dimensional moments to ternary quantics. The existence and number of nth order moments in two and three dimensions is explored. Algebraic invariants of several ternary forms under different orthogonal transformations are derived by using the invariant property of coefficients of ternary forms. The result is a set of three-dimensional moment invariants which are invariant under size, orientation, and position change. This property is highly significant in compressing the data which are needed in three-dimensional object recognition. Empirical examples are also given.",
"title": "Three-Dimensional Moment Invariants",
"normalizedTitle": "Three-Dimensional Moment Invariants",
"fno": "04766990",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [],
"authors": [
{
"givenName": "Firooz A.",
"surname": "Sadjadi",
"fullName": "Firooz A. Sadjadi",
"affiliation": "STUDENT MEMBER, IEEE, Department of Electrical Engineering, University of Tennessee, Knoxville, TN 37916.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ernest L.",
"surname": "Hall",
"fullName": "Ernest L. Hall",
"affiliation": "MEMBER, IEEE, Department of Electrical Engineering, University of Tennessee, Knoxville, TN 37916.",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "1980-04-01 00:00:00",
"pubType": "trans",
"pages": "127-136",
"year": "1980",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icassp/2009/2353/0/04959990",
"title": "Degraded image analysis using Zernike moment invariants",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2009/04959990/12OmNA1mbdg",
"parentPublication": {
"id": "proceedings/icassp/2009/2353/0",
"title": "Acoustics, Speech, and Signal Processing, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2015/6879/0/07156350",
"title": "Moment invariants for 3D flow fields via normalization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156350/12OmNBpEeTF",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2006/2521/3/252130141",
"title": "Scale Invariants of Three-Dimensional Legendre Moments",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2006/252130141/12OmNvF83s8",
"parentPublication": {
"id": "proceedings/icpr/2006/2521/3",
"title": "2006 18th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2006/2521/4/252140173",
"title": "3-D Surface Moment Invariants",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2006/252140173/12OmNwF0C2M",
"parentPublication": {
"id": "proceedings/icpr/2006/2521/4",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2009/3583/2/3583b013",
"title": "A Method to Derive Moment Invariants",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2009/3583b013/12OmNzuIjfq",
"parentPublication": {
"id": "proceedings/icmtma/2009/3583/2",
"title": "2009 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1984/06/04767594",
"title": "Recognitive Aspects of Moment Invariants",
"doi": null,
"abstractUrl": "/journal/tp/1984/06/04767594/13rRUxD9gYv",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1988/06/i0937",
"title": "Three-Dimensional Shape Analysis Using Moments and Fourier Descriptors",
"doi": null,
"abstractUrl": "/journal/tp/1988/06/i0937/13rRUygT7yT",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1743",
"title": "Moment Invariants for the Analysis of 2D Flow Fields",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1743/13rRUyoPSP0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "04766989",
"articleId": "13rRUyoPSPS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04766991",
"articleId": "13rRUzphDyH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx8fieO",
"title": "January/February",
"year": "2010",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "16",
"label": "January/February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwgQpDr",
"doi": "10.1109/TVCG.2009.46",
"abstract": "We present a visualization technique for simulated fluid dynamics data that visualizes the gradient of the velocity field in an intuitive way. Our work is inspired by rheoscopic particles, which are small, flat particles that, when suspended in fluid, align themselves with the shear of the flow. We adopt the physical principles of real rheoscopic particles and apply them, in model form, to 3D velocity fields. By simulating the behavior and reflectance of these particles, we are able to render 3D simulations in a way that gives insight into the dynamics of the system. The results can be rendered in real time, allowing the user to inspect the simulation from all perspectives. We achieve this by a combination of precomputations and fast ray tracing on the GPU. We demonstrate our method on several different simulations, showing their complex dynamics in the process.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a visualization technique for simulated fluid dynamics data that visualizes the gradient of the velocity field in an intuitive way. Our work is inspired by rheoscopic particles, which are small, flat particles that, when suspended in fluid, align themselves with the shear of the flow. We adopt the physical principles of real rheoscopic particles and apply them, in model form, to 3D velocity fields. By simulating the behavior and reflectance of these particles, we are able to render 3D simulations in a way that gives insight into the dynamics of the system. The results can be rendered in real time, allowing the user to inspect the simulation from all perspectives. We achieve this by a combination of precomputations and fast ray tracing on the GPU. We demonstrate our method on several different simulations, showing their complex dynamics in the process.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a visualization technique for simulated fluid dynamics data that visualizes the gradient of the velocity field in an intuitive way. Our work is inspired by rheoscopic particles, which are small, flat particles that, when suspended in fluid, align themselves with the shear of the flow. We adopt the physical principles of real rheoscopic particles and apply them, in model form, to 3D velocity fields. By simulating the behavior and reflectance of these particles, we are able to render 3D simulations in a way that gives insight into the dynamics of the system. The results can be rendered in real time, allowing the user to inspect the simulation from all perspectives. We achieve this by a combination of precomputations and fast ray tracing on the GPU. We demonstrate our method on several different simulations, showing their complex dynamics in the process.",
"title": "Virtual Rheoscopic Fluids",
"normalizedTitle": "Virtual Rheoscopic Fluids",
"fno": "ttg2010010147",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Rheoscopic Fluid",
"Flow Visualization",
"Tensor Field Visualization",
"Ellipsoidal Particle Dynamics"
],
"authors": [
{
"givenName": "Florian",
"surname": "Hecht",
"fullName": "Florian Hecht",
"affiliation": "Georgia Institute of Technology, Atlanta",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter J.",
"surname": "Mucha",
"fullName": "Peter J. Mucha",
"affiliation": "University of North Carolina at Chapel Hill, Chapel Hill",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Greg",
"surname": "Turk",
"fullName": "Greg Turk",
"affiliation": "Georgia Institute of Technology, Atlanta",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2010-01-01 00:00:00",
"pubType": "trans",
"pages": "147-160",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2004/8788/0/87880353",
"title": "Interactive Terascale Particle Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880353/12OmNAXPy8c",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcmp-ugc/2009/3946/0/3946a027",
"title": "Comparison of Empirical and Theoretical Computations of Velocity for a Cold Spray Nozzle",
"doi": null,
"abstractUrl": "/proceedings-article/hpcmp-ugc/2009/3946a027/12OmNAle6IW",
"parentPublication": {
"id": "proceedings/hpcmp-ugc/2009/3946/0",
"title": "HPCMP Users Group Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/viz/2009/3734/0/3734a076",
"title": "VOF Method for Fluids and Solids on Octree Structure",
"doi": null,
"abstractUrl": "/proceedings-article/viz/2009/3734a076/12OmNBkxspY",
"parentPublication": {
"id": "proceedings/viz/2009/3734/0",
"title": "Visualisation, International Conference in",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aihas/1994/6440/0/00390502",
"title": "Fluids in a distributed interactive simulation",
"doi": null,
"abstractUrl": "/proceedings-article/aihas/1994/00390502/12OmNC4wtKv",
"parentPublication": {
"id": "proceedings/aihas/1994/6440/0",
"title": "Fifth Annual Conference on AI, and Planning in High Autonomy Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2013/5050/0/5050a694",
"title": "Dynamic Fluids Mixed with Local-Control Effects",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2013/5050a694/12OmNwqft4O",
"parentPublication": {
"id": "proceedings/icig/2013/5050/0",
"title": "2013 Seventh International Conference on Image and Graphics (ICIG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/05/v0939",
"title": "Texturing Fluids",
"doi": null,
"abstractUrl": "/journal/tg/2007/05/v0939/13rRUwbs20O",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/04/v0711",
"title": "Derivative Particles for Simulating Detailed Movements of Fluids",
"doi": null,
"abstractUrl": "/journal/tg/2007/04/v0711/13rRUxYIMUQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1735",
"title": "Generalized Streak Lines: Analysis and Visualization of Boundary Induced Vortices",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1735/13rRUxcbnCm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/01/ttg2014010004",
"title": "Multiphase Flow of Immiscible Fluids on Unstructured Moving Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2014/01/ttg2014010004/13rRUxcbnCr",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1751",
"title": "Virtual Rheoscopic Fluids for Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1751/13rRUxjQyvb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010010133",
"articleId": "13rRUwvT9go",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010010161",
"articleId": "13rRUwbs2aW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFsk",
"name": "ttg2010010147s.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2010010147s.mov",
"extension": "mov",
"size": "163 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyPQ4Dx",
"title": "Dec.",
"year": "2012",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwghd4X",
"doi": "10.1109/TVCG.2012.283",
"abstract": "A fundamental characteristic of fluid flow is that it causes mixing: introduce a dye into a flow, and it will disperse. Mixing can be used as a method to visualize and characterize flow. Because mixing is a process that occurs over time, it is a 4D problem that presents a challenge for computation, visualization, and analysis. Motivated by a mixing problem in geophysics, we introduce a combination of methods to analyze, transform, and finally visualize mixing in simulations of convection in a self-gravitating 3D spherical shell representing convection in the Earth’s mantle. Geophysicists use tools such as the finite element model CitcomS to simulate convection, and introduce massless, passive tracers to model mixing. The output of geophysical flow simulation is hard to analyze for domain experts because of overall data size and complexity. In addition, information overload and occlusion are problems when visualizing a whole-earth model. To address the large size of the data, we rearrange the simulation data using intelligent indexing for fast file access and efficient caching. To address information overload and interpret mixing, we compute tracer concentration statistics, which are used to characterize mixing in mantle convection models. Our visualization uses a specially tailored version of Direct Volume Rendering. The most important adjustment is the use of constant opacity. Because of this special area of application, i. e. the rendering of a spherical shell, many computations for volume rendering can be optimized. These optimizations are essential to a smooth animation of the time-dependent simulation data. Our results show how our system can be used to quickly assess the simulation output and test hypotheses regarding Earth’s mantle convection. The integrated processing pipeline helps geoscientists to focus on their main task of analyzing mantle homogenization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A fundamental characteristic of fluid flow is that it causes mixing: introduce a dye into a flow, and it will disperse. Mixing can be used as a method to visualize and characterize flow. Because mixing is a process that occurs over time, it is a 4D problem that presents a challenge for computation, visualization, and analysis. Motivated by a mixing problem in geophysics, we introduce a combination of methods to analyze, transform, and finally visualize mixing in simulations of convection in a self-gravitating 3D spherical shell representing convection in the Earth’s mantle. Geophysicists use tools such as the finite element model CitcomS to simulate convection, and introduce massless, passive tracers to model mixing. The output of geophysical flow simulation is hard to analyze for domain experts because of overall data size and complexity. In addition, information overload and occlusion are problems when visualizing a whole-earth model. To address the large size of the data, we rearrange the simulation data using intelligent indexing for fast file access and efficient caching. To address information overload and interpret mixing, we compute tracer concentration statistics, which are used to characterize mixing in mantle convection models. Our visualization uses a specially tailored version of Direct Volume Rendering. The most important adjustment is the use of constant opacity. Because of this special area of application, i. e. the rendering of a spherical shell, many computations for volume rendering can be optimized. These optimizations are essential to a smooth animation of the time-dependent simulation data. Our results show how our system can be used to quickly assess the simulation output and test hypotheses regarding Earth’s mantle convection. The integrated processing pipeline helps geoscientists to focus on their main task of analyzing mantle homogenization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A fundamental characteristic of fluid flow is that it causes mixing: introduce a dye into a flow, and it will disperse. Mixing can be used as a method to visualize and characterize flow. Because mixing is a process that occurs over time, it is a 4D problem that presents a challenge for computation, visualization, and analysis. Motivated by a mixing problem in geophysics, we introduce a combination of methods to analyze, transform, and finally visualize mixing in simulations of convection in a self-gravitating 3D spherical shell representing convection in the Earth’s mantle. Geophysicists use tools such as the finite element model CitcomS to simulate convection, and introduce massless, passive tracers to model mixing. The output of geophysical flow simulation is hard to analyze for domain experts because of overall data size and complexity. In addition, information overload and occlusion are problems when visualizing a whole-earth model. To address the large size of the data, we rearrange the simulation data using intelligent indexing for fast file access and efficient caching. To address information overload and interpret mixing, we compute tracer concentration statistics, which are used to characterize mixing in mantle convection models. Our visualization uses a specially tailored version of Direct Volume Rendering. The most important adjustment is the use of constant opacity. Because of this special area of application, i. e. the rendering of a spherical shell, many computations for volume rendering can be optimized. These optimizations are essential to a smooth animation of the time-dependent simulation data. Our results show how our system can be used to quickly assess the simulation output and test hypotheses regarding Earth’s mantle convection. The integrated processing pipeline helps geoscientists to focus on their main task of analyzing mantle homogenization.",
"title": "Visualization of Flow Behavior in Earth Mantle Convection",
"normalizedTitle": "Visualization of Flow Behavior in Earth Mantle Convection",
"fno": "ttg2012122198",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Computational Modeling",
"Data Models",
"Rendering Computer Graphics",
"Geophysical Measurements",
"Flow Control",
"Earth",
"Large Data System",
"Geophysics",
"Flow Visualization",
"Tracer Concentration",
"Earth Mantle",
"Convection"
],
"authors": [
{
"givenName": "Simon",
"surname": "Schroder",
"fullName": "Simon Schroder",
"affiliation": "Fraunhofer ITWM",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John A.",
"surname": "Peterson",
"fullName": "John A. Peterson",
"affiliation": "Department of Geology, University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Harald",
"surname": "Obermaier",
"fullName": "Harald Obermaier",
"affiliation": "Institute for Data Analysis and Visualization, University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Louise H.",
"surname": "Kellogg",
"fullName": "Louise H. Kellogg",
"affiliation": "Department of Geology, University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kenneth I.",
"surname": "Joy",
"fullName": "Kenneth I. Joy",
"affiliation": "Institute for Data Analysis and Visualization, University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hans",
"surname": "Hagen",
"fullName": "Hans Hagen",
"affiliation": "Computer Graphics and HCI Group, University of Kaiserslautern",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2198-2207",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visual/1993/3940/0/00398876",
"title": "Cloud tracing in convection-diffusion systems",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1993/00398876/12OmNBrlPCQ",
"parentPublication": {
"id": "proceedings/visual/1993/3940/0",
"title": "Proceedings Visualization '93",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispdc/2012/2599/0/06341527",
"title": "Hierarchical Hybrid Grids for Mantle Convection: A First Study",
"doi": null,
"abstractUrl": "/proceedings-article/ispdc/2012/06341527/12OmNCmpcU2",
"parentPublication": {
"id": "proceedings/ispdc/2012/2599/0",
"title": "2012 11th International Symposium on Parallel and Distributed Computing (ISPDC 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1992/2630/0/00236673",
"title": "Simulation of particle mixing by turbulent convective flows on the Connection Machine",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1992/00236673/12OmNqI04KO",
"parentPublication": {
"id": "proceedings/sc/1992/2630/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498erlebach",
"title": "Case Study: Visualization and Analysis of High Rayleigh number --- 3D Convection in the Earth's Mantle",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498erlebach/12OmNx6xHnU",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2011/4501/0/4501b185",
"title": "Simulation on Sensitivity of Initial Value in Rayleigh-Benard Convection",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2011/4501b185/12OmNyvoXkI",
"parentPublication": {
"id": "proceedings/iccis/2011/4501/0",
"title": "2011 International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/2016/4457/0/4457a800",
"title": "Accelerating the Simulation of Thermal Convection in the Earth's Outer Core on Tianhe-2",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2016/4457a800/12OmNz5JC5a",
"parentPublication": {
"id": "proceedings/icpads/2016/4457/0",
"title": "2016 IEEE 22nd International Conference on Parallel and Distributed Systems (ICPADS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1996/3673/0/36730409",
"title": "Case Study: Mantle Convection Visualization on the Cray T3D",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1996/36730409/12OmNzcxZgq",
"parentPublication": {
"id": "proceedings/ieee-vis/1996/3673/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2015/3723/0/2807675",
"title": "An extreme-scale implicit solver for complex PDEs: highly heterogeneous flow in earth's mantle",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2015/2807675/12OmNzxgHGS",
"parentPublication": {
"id": "proceedings/sc/2015/3723/0",
"title": "SC15: International Conference for High-Performance Computing, Networking, Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2000/03/c3022",
"title": "Plate Tectonics Convection in the Earth's Mantle: Toward a Numerical Simulation",
"doi": null,
"abstractUrl": "/magazine/cs/2000/03/c3022/13rRUzpzeIQ",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2022/06/09772419",
"title": "Hybrid Rendering for Interactive Visualization of Mantle Convection",
"doi": null,
"abstractUrl": "/magazine/cg/2022/06/09772419/1DgjHnpynw4",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012122188",
"articleId": "13rRUwcS1CT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122208",
"articleId": "13rRUx0gev7",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyv7moB",
"title": "November/December",
"year": "2005",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "11",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuv8",
"doi": "10.1109/TVCG.2005.87",
"abstract": "We present a particle system for interactive visualization of steady 3D flow fields on uniform grids. For the amount of particles we target, particle integration needs to be accelerated and the transfer of these sets for rendering must be avoided. To fulfill these requirements, we exploit features of recent graphics accelerators to advect particles in the graphics processing unit (GPU), saving particle positions in graphics memory, and then sending these positions through the GPU again to obtain images in the frame buffer. This approach allows for interactive streaming and rendering of millions of particles and it enables virtual exploration of high resolution fields in a way similar to real-world experiments. The ability to display the dynamics of large particle sets using visualization options like shaded points or oriented texture splats provides an effective means for visual flow analysis that is far beyond existing solutions. For each particle, flow quantities like vorticity magnitude and \\lambda_2 are computed and displayed. Built upon a previously published GPU implementation of a sorting network, visibility sorting of transparent particles is implemented. To provide additional visual cues, the GPU constructs and displays visualization geometry like particle lines and stream ribbons.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a particle system for interactive visualization of steady 3D flow fields on uniform grids. For the amount of particles we target, particle integration needs to be accelerated and the transfer of these sets for rendering must be avoided. To fulfill these requirements, we exploit features of recent graphics accelerators to advect particles in the graphics processing unit (GPU), saving particle positions in graphics memory, and then sending these positions through the GPU again to obtain images in the frame buffer. This approach allows for interactive streaming and rendering of millions of particles and it enables virtual exploration of high resolution fields in a way similar to real-world experiments. The ability to display the dynamics of large particle sets using visualization options like shaded points or oriented texture splats provides an effective means for visual flow analysis that is far beyond existing solutions. For each particle, flow quantities like vorticity magnitude and \\lambda_2 are computed and displayed. Built upon a previously published GPU implementation of a sorting network, visibility sorting of transparent particles is implemented. To provide additional visual cues, the GPU constructs and displays visualization geometry like particle lines and stream ribbons.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a particle system for interactive visualization of steady 3D flow fields on uniform grids. For the amount of particles we target, particle integration needs to be accelerated and the transfer of these sets for rendering must be avoided. To fulfill these requirements, we exploit features of recent graphics accelerators to advect particles in the graphics processing unit (GPU), saving particle positions in graphics memory, and then sending these positions through the GPU again to obtain images in the frame buffer. This approach allows for interactive streaming and rendering of millions of particles and it enables virtual exploration of high resolution fields in a way similar to real-world experiments. The ability to display the dynamics of large particle sets using visualization options like shaded points or oriented texture splats provides an effective means for visual flow analysis that is far beyond existing solutions. For each particle, flow quantities like vorticity magnitude and \\lambda_2 are computed and displayed. Built upon a previously published GPU implementation of a sorting network, visibility sorting of transparent particles is implemented. To provide additional visual cues, the GPU constructs and displays visualization geometry like particle lines and stream ribbons.",
"title": "A Particle System for Interactive Visualization of 3D Flows",
"normalizedTitle": "A Particle System for Interactive Visualization of 3D Flows",
"fno": "v0744",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Flow Visualization",
"Particle Tracing",
"Programmable Graphics Hardware",
"Visibility Sorting",
"Visualization Geometry"
],
"authors": [
{
"givenName": "Jens",
"surname": "Kr?",
"fullName": "Jens Kr?",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter",
"surname": "Kipfer",
"fullName": "Peter Kipfer",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Polina",
"surname": "Kondratieva",
"fullName": "Polina Kondratieva",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "R?diger",
"surname": "Westermann",
"fullName": "R?diger Westermann",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2005-11-01 00:00:00",
"pubType": "trans",
"pages": "744-756",
"year": "2005",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2004/8788/0/87880353",
"title": "Interactive Terascale Particle Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880353/12OmNAXPy8c",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532780",
"title": "The application of GPU particle tracing to diffusion tensor field visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532780/12OmNBrlPxd",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pvg/2001/7223/0/72230045",
"title": "Real-Time Out-of-Core Visualization of Particle Traces",
"doi": null,
"abstractUrl": "/proceedings-article/pvg/2001/72230045/12OmNC943Ii",
"parentPublication": {
"id": "proceedings/pvg/2001/7223/0",
"title": "Parallel and Large-Data Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660081",
"title": "Particle and Texture Based Spatiotemporal Visualization of Time-Dependent Vector Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660081/12OmNrHjqKB",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780029",
"title": "Interactive Visualization of Particle-In-Cell Simulations",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780029/12OmNxHJ9sZ",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2002/1524/0/15240019",
"title": "Advanced Visualization Technology for Terascale Particle Accelerator Simulations",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2002/15240019/12OmNyKrHjh",
"parentPublication": {
"id": "proceedings/sc/2002/1524/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532852",
"title": "Particle and texture based spatiotemporal visualization of time-dependent vector fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532852/12OmNyO8tNJ",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660010",
"title": "The Application of GPU Particle Tracing to Diffusion Tensor Field Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660010/12OmNzmclCU",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/04/v0758",
"title": "A Coherent Grid Traversal Approach to Visualizing Particle-Based Simulation Data",
"doi": null,
"abstractUrl": "/journal/tg/2007/04/v0758/13rRUxOdD8a",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2019/9226/0/922600a232",
"title": "Interactive Spatiotemporal Visualization of Phase Space Particle Trajectories Using Distance Plots",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2019/922600a232/1cMF7xn5Rbq",
"parentPublication": {
"id": "proceedings/pacificvis/2019/9226/0",
"title": "2019 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0734",
"articleId": "13rRUy0HYRg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0757",
"articleId": "13rRUxAASVO",
"__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": "13rRUyoPSRy",
"doi": "10.1109/MCG.2012.95",
"abstract": "In the 2011 IEEE Visualization Contest, the dataset represented a high-resolution simulation of a centrifugal pump operating below optimal speed. The goal was to find suitable visualization techniques to identify regions of rotating stall that impede the pump's effectiveness. The winning entry split analysis of the pump into three parts based on the pump's functional behavior. It then applied local and integration-based methods to communicate the unsteady flow behavior in different regions of the dataset. This research formed the basis for a comparison of common vortex extractors and more recent methods. In particular, integration-based methods (separation measures, accumulated scalar fields, particle path lines, and advection textures) are well suited to capture the complex time-dependent flow behavior. This video (http://youtu.be/oD7QuabY0oU) shows simulations of unsteady flow in a centrifugal pump.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In the 2011 IEEE Visualization Contest, the dataset represented a high-resolution simulation of a centrifugal pump operating below optimal speed. The goal was to find suitable visualization techniques to identify regions of rotating stall that impede the pump's effectiveness. The winning entry split analysis of the pump into three parts based on the pump's functional behavior. It then applied local and integration-based methods to communicate the unsteady flow behavior in different regions of the dataset. This research formed the basis for a comparison of common vortex extractors and more recent methods. In particular, integration-based methods (separation measures, accumulated scalar fields, particle path lines, and advection textures) are well suited to capture the complex time-dependent flow behavior. This video (http://youtu.be/oD7QuabY0oU) shows simulations of unsteady flow in a centrifugal pump.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In the 2011 IEEE Visualization Contest, the dataset represented a high-resolution simulation of a centrifugal pump operating below optimal speed. The goal was to find suitable visualization techniques to identify regions of rotating stall that impede the pump's effectiveness. The winning entry split analysis of the pump into three parts based on the pump's functional behavior. It then applied local and integration-based methods to communicate the unsteady flow behavior in different regions of the dataset. This research formed the basis for a comparison of common vortex extractors and more recent methods. In particular, integration-based methods (separation measures, accumulated scalar fields, particle path lines, and advection textures) are well suited to capture the complex time-dependent flow behavior. This video (http://youtu.be/oD7QuabY0oU) shows simulations of unsteady flow in a centrifugal pump.",
"title": "2011 IEEE Visualization Contest Winner: Visualizing Unsteady Vortical Behavior of a Centrifugal Pump",
"normalizedTitle": "2011 IEEE Visualization Contest Winner: Visualizing Unsteady Vortical Behavior of a Centrifugal Pump",
"fno": "mcg2012050012",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Pumps",
"Adaptation Models",
"Data Visualization",
"Blades",
"Vectors",
"Visualization",
"Pumps",
"Adaptation Models",
"Data Visualization",
"Blades",
"Vectors",
"Visualization",
"Computer Graphics",
"2011 IEEE Visualization Contest",
"Centrifugal Pump"
],
"authors": [
{
"givenName": "M.",
"surname": "Otto",
"fullName": "M. Otto",
"affiliation": "Univ. of Magdeburg, Magdeburg, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "A.",
"surname": "Kuhn",
"fullName": "A. Kuhn",
"affiliation": "Univ. of Magdeburg, Magdeburg, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "W.",
"surname": "Engelke",
"fullName": "W. Engelke",
"affiliation": "Univ. of Magdeburg, Magdeburg, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "H.",
"surname": "Theisel",
"fullName": "H. Theisel",
"affiliation": "Univ. of Magdeburg, Magdeburg, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2012-09-01 00:00:00",
"pubType": "mags",
"pages": "12-19",
"year": "2012",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icacc/2013/5033/0/06686400",
"title": "Theoretical Computation of Boundary Layer Separation Point over an Impeller Vane Pressure Surface in Centrifugal Pump",
"doi": null,
"abstractUrl": "/proceedings-article/icacc/2013/06686400/12OmNAOKnQX",
"parentPublication": {
"id": "proceedings/icacc/2013/5033/0",
"title": "2013 Third International Conference on Advances in Computing and Communications (ICACC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icccs/2009/3906/0/3906a142",
"title": "The Effect of the Clearance Value of Impeller and Draft-tube for the Performance of Stamping Multistage Centrifugal Pumps",
"doi": null,
"abstractUrl": "/proceedings-article/icccs/2009/3906a142/12OmNBWi6LR",
"parentPublication": {
"id": "proceedings/icccs/2009/3906/0",
"title": "2009 International Conference on Computer and Communications Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icat/2006/2754/0/27540205",
"title": "Virtual Performance Experiment of a Centrifugal Pump",
"doi": null,
"abstractUrl": "/proceedings-article/icat/2006/27540205/12OmNBaBuSK",
"parentPublication": {
"id": "proceedings/icat/2006/2754/0",
"title": "16th International Conference on Artificial Reality and Telexistence--Workshops (ICAT'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2015/9393/0/9393a763",
"title": "Study on the H-Q Characteristic Curves of Centrifugal Pump with Inlet Pre-whirl",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2015/9393a763/12OmNBubOVR",
"parentPublication": {
"id": "proceedings/isdea/2015/9393/0",
"title": "2015 Sixth International Conference on Intelligent Systems Design and Engineering Applications (ISDEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciicii/2016/3575/0/3575a263",
"title": "Control for the Centrifugal Pump in the Simulation Platform of Power Plants",
"doi": null,
"abstractUrl": "/proceedings-article/iciicii/2016/3575a263/12OmNqIzgVz",
"parentPublication": {
"id": "proceedings/iciicii/2016/3575/0",
"title": "2016 International Conference on Industrial Informatics - Computing Technology, Intelligent Technology, Industrial Information Integration (ICIICII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2004/8552/0/01408611",
"title": "PUMPX: an expert system for pump diagnosis",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2004/01408611/12OmNy3149X",
"parentPublication": {
"id": "proceedings/fie/2004/8552/0",
"title": "34th Annual Frontiers in Education, 2004. FIE 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/simultech/2014/060/0/07095003",
"title": "Numerical investigation of liquid flow in two-, three- and four-stage centrifugal pumps",
"doi": null,
"abstractUrl": "/proceedings-article/simultech/2014/07095003/12OmNzgwmRX",
"parentPublication": {
"id": "proceedings/simultech/2014/060/0",
"title": "2014 International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icitbs/2019/1307/0/130700a630",
"title": "Deep-Sea Mining Pump Wear Prediction Using Numerical Two-Phase Flow Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/icitbs/2019/130700a630/18AuYpouyVW",
"parentPublication": {
"id": "proceedings/icitbs/2019/1307/0",
"title": "2019 International Conference on Intelligent Transportation, Big Data & Smart City (ICITBS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismii/2021/1290/0/129000a168",
"title": "Analysis of vibration characteristics of the centrifugal pump base on CFD",
"doi": null,
"abstractUrl": "/proceedings-article/ismii/2021/129000a168/1sZ2N0do2Uo",
"parentPublication": {
"id": "proceedings/ismii/2021/1290/0",
"title": "2021 7th International Symposium on Mechatronics and Industrial Informatics (ISMII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismii/2021/1290/0/129000a074",
"title": "Analysis and optimization of key parameters of centrifugal pump based on 3D dimensional chain",
"doi": null,
"abstractUrl": "/proceedings-article/ismii/2021/129000a074/1sZ2QFtysAU",
"parentPublication": {
"id": "proceedings/ismii/2021/1290/0",
"title": "2021 7th International Symposium on Mechatronics and Industrial Informatics (ISMII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2012050006",
"articleId": "13rRUNvPLcn",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2012050020",
"articleId": "13rRUxly97Y",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCaLEju",
"title": "Jan.",
"year": "2018",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyY28YD",
"doi": "10.1109/TVCG.2017.2744218",
"abstract": "The rapid development of information technology paved the way for the recording of fine-grained data, such as stroke techniques and stroke placements, during a table tennis match. This data recording creates opportunities to analyze and evaluate matches from new perspectives. Nevertheless, the increasingly complex data poses a significant challenge to make sense of and gain insights into. Analysts usually employ tedious and cumbersome methods which are limited to watching videos and reading statistical tables. However, existing sports visualization methods cannot be applied to visualizing table tennis competitions due to different competition rules and particular data attributes. In this work, we collaborate with data analysts to understand and characterize the sophisticated domain problem of analysis of table tennis data. We propose iTTVis, a novel interactive table tennis visualization system, which to our knowledge, is the first visual analysis system for analyzing and exploring table tennis data. iTTVis provides a holistic visualization of an entire match from three main perspectives, namely, time-oriented, statistical, and tactical analyses. The proposed system with several well-coordinated views not only supports correlation identification through statistics and pattern detection of tactics with a score timeline but also allows cross analysis to gain insights. Data analysts have obtained several new insights by using iTTVis. The effectiveness and usability of the proposed system are demonstrated with four case studies.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The rapid development of information technology paved the way for the recording of fine-grained data, such as stroke techniques and stroke placements, during a table tennis match. This data recording creates opportunities to analyze and evaluate matches from new perspectives. Nevertheless, the increasingly complex data poses a significant challenge to make sense of and gain insights into. Analysts usually employ tedious and cumbersome methods which are limited to watching videos and reading statistical tables. However, existing sports visualization methods cannot be applied to visualizing table tennis competitions due to different competition rules and particular data attributes. In this work, we collaborate with data analysts to understand and characterize the sophisticated domain problem of analysis of table tennis data. We propose iTTVis, a novel interactive table tennis visualization system, which to our knowledge, is the first visual analysis system for analyzing and exploring table tennis data. iTTVis provides a holistic visualization of an entire match from three main perspectives, namely, time-oriented, statistical, and tactical analyses. The proposed system with several well-coordinated views not only supports correlation identification through statistics and pattern detection of tactics with a score timeline but also allows cross analysis to gain insights. Data analysts have obtained several new insights by using iTTVis. The effectiveness and usability of the proposed system are demonstrated with four case studies.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The rapid development of information technology paved the way for the recording of fine-grained data, such as stroke techniques and stroke placements, during a table tennis match. This data recording creates opportunities to analyze and evaluate matches from new perspectives. Nevertheless, the increasingly complex data poses a significant challenge to make sense of and gain insights into. Analysts usually employ tedious and cumbersome methods which are limited to watching videos and reading statistical tables. However, existing sports visualization methods cannot be applied to visualizing table tennis competitions due to different competition rules and particular data attributes. In this work, we collaborate with data analysts to understand and characterize the sophisticated domain problem of analysis of table tennis data. We propose iTTVis, a novel interactive table tennis visualization system, which to our knowledge, is the first visual analysis system for analyzing and exploring table tennis data. iTTVis provides a holistic visualization of an entire match from three main perspectives, namely, time-oriented, statistical, and tactical analyses. The proposed system with several well-coordinated views not only supports correlation identification through statistics and pattern detection of tactics with a score timeline but also allows cross analysis to gain insights. Data analysts have obtained several new insights by using iTTVis. The effectiveness and usability of the proposed system are demonstrated with four case studies.",
"title": "iTTVis: Interactive Visualization of Table Tennis Data",
"normalizedTitle": "iTTVis: Interactive Visualization of Table Tennis Data",
"fno": "08017600",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Games",
"Hafnium",
"Visualization",
"Videos",
"Mathematical Model",
"Correlation",
"Sports Visualization",
"Visual Knowledge Discovery",
"Sports Analytics",
"Visual Knowledge Representation"
],
"authors": [
{
"givenName": "Yingcai",
"surname": "Wu",
"fullName": "Yingcai Wu",
"affiliation": "State Key Lab of CAD & CGZhejiang University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ji",
"surname": "Lan",
"fullName": "Ji Lan",
"affiliation": "State Key Lab of CAD & CGZhejiang University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xinhuan",
"surname": "Shu",
"fullName": "Xinhuan Shu",
"affiliation": "State Key Lab of CAD & CGZhejiang University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chenyang",
"surname": "Ji",
"fullName": "Chenyang Ji",
"affiliation": "State Key Lab of CAD & CGZhejiang University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kejian",
"surname": "Zhao",
"fullName": "Kejian Zhao",
"affiliation": "State Key Lab of CAD & CGZhejiang University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiachen",
"surname": "Wang",
"fullName": "Jiachen Wang",
"affiliation": "State Key Lab of CAD & CGZhejiang University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hui",
"surname": "Zhang",
"fullName": "Hui Zhang",
"affiliation": "Department of Physical EducationCollege of EducationZhejiang University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "trans",
"pages": "709-718",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icisce/2015/6850/0/6850a712",
"title": "Discussion on Psychological Perception Representation and Knowledge Acquisition of Table Tennis Players",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2015/6850a712/12OmNyL0Tq5",
"parentPublication": {
"id": "proceedings/icisce/2015/6850/0",
"title": "2015 2nd International Conference on Information Science and Control Engineering (ICISCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06876044",
"title": "TenniVis: Visualization for Tennis Match Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06876044/13rRUwI5Ugd",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2018/8308/0/830800a318",
"title": "Research on Generating Three Stage Data of Both Sides in Table Tennis Competition with Excel",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2018/830800a318/17D45XtvpdB",
"parentPublication": {
"id": "proceedings/icicta/2018/8308/0",
"title": "2018 11th International Conference on Intelligent Computation Technology and Automation (ICICTA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icise-ie/2021/3829/0/382900b210",
"title": "Application of Micro-lecture in Table Tennis Teaching for Children",
"doi": null,
"abstractUrl": "/proceedings-article/icise-ie/2021/382900b210/1C8GamvUKGI",
"parentPublication": {
"id": "proceedings/icise-ie/2021/3829/0",
"title": "2021 2nd International Conference on Information Science and Education (ICISE-IE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807264",
"title": "Tac-Simur: Tactic-based Simulative Visual Analytics of Table Tennis",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807264/1cG6vo24hRC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2019/2607/2/260702a097",
"title": "Micro-Level Analysis and Visualization of Tennis Shot Patterns with Fractal Tables",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2019/260702a097/1cYipyP6afS",
"parentPublication": {
"id": "compsac/2019/2607/2",
"title": "2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/09411869",
"title": "Tac-Miner: Visual Tactic Mining for Multiple Table Tennis Matches",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/09411869/1t2ii7r7RcI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2021/3892/0/389200a632",
"title": "Tactical Decision System of Table Tennis Match based on C4.5 Decision Tree",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2021/389200a632/1t2nmIZ5RBe",
"parentPublication": {
"id": "proceedings/icmtma/2021/3892/0",
"title": "2021 13th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09446582",
"title": "Performance Improvement and Skill Transfer in Table Tennis Through Training in Virtual Reality",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09446582/1u8lz4qWghi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/03/09626557",
"title": "SimuExplorer: Visual Exploration of Game Simulation in Table Tennis",
"doi": null,
"abstractUrl": "/journal/tg/2023/03/09626557/1yNd5vlQLrG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08017638",
"articleId": "13rRUx0xPTV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08017613",
"articleId": "13rRUyuvRoQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesUk",
"name": "ttg201801-08017600s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201801-08017600s1.zip",
"extension": "zip",
"size": "46.4 MB",
"__typename": "WebExtraType"
}
],
"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": "1csHUeq7TB6",
"doi": "10.1109/TVCG.2019.2934243",
"abstract": "Tennis players and coaches of all proficiency levels seek to understand and improve their play. Summary statistics alone are inadequate to provide the insights players need to improve their games. Spatio-temporal data capturing player and ball movements is likely to provide the actionable insights needed to identify player strengths, weaknesses, and strategies. To fully utilize this spatio-temporal data, we need to integrate it with domain-relevant context meta-data. In this paper, we propose CourtTime, a novel approach to perform data-driven visual analysis of individual tennis matches. Our visual approach introduces a novel visual metaphor, namely 1-D Space-Time Charts that enable the analysis of single points at a glance based on small multiples. We also employ user-driven sorting and clustering techniques and a layout technique that aligns the last few shots in a point to facilitate shot pattern discovery. We discuss the usefulness of CourtTime via an extensive case study and report on feedback from an amateur tennis player and three tennis coaches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Tennis players and coaches of all proficiency levels seek to understand and improve their play. Summary statistics alone are inadequate to provide the insights players need to improve their games. Spatio-temporal data capturing player and ball movements is likely to provide the actionable insights needed to identify player strengths, weaknesses, and strategies. To fully utilize this spatio-temporal data, we need to integrate it with domain-relevant context meta-data. In this paper, we propose CourtTime, a novel approach to perform data-driven visual analysis of individual tennis matches. Our visual approach introduces a novel visual metaphor, namely 1-D Space-Time Charts that enable the analysis of single points at a glance based on small multiples. We also employ user-driven sorting and clustering techniques and a layout technique that aligns the last few shots in a point to facilitate shot pattern discovery. We discuss the usefulness of CourtTime via an extensive case study and report on feedback from an amateur tennis player and three tennis coaches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Tennis players and coaches of all proficiency levels seek to understand and improve their play. Summary statistics alone are inadequate to provide the insights players need to improve their games. Spatio-temporal data capturing player and ball movements is likely to provide the actionable insights needed to identify player strengths, weaknesses, and strategies. To fully utilize this spatio-temporal data, we need to integrate it with domain-relevant context meta-data. In this paper, we propose CourtTime, a novel approach to perform data-driven visual analysis of individual tennis matches. Our visual approach introduces a novel visual metaphor, namely 1-D Space-Time Charts that enable the analysis of single points at a glance based on small multiples. We also employ user-driven sorting and clustering techniques and a layout technique that aligns the last few shots in a point to facilitate shot pattern discovery. We discuss the usefulness of CourtTime via an extensive case study and report on feedback from an amateur tennis player and three tennis coaches.",
"title": "CourtTime: Generating Actionable Insights into Tennis Matches Using Visual Analytics",
"normalizedTitle": "CourtTime: Generating Actionable Insights into Tennis Matches Using Visual Analytics",
"fno": "08795584",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Pattern Clustering",
"Sport",
"Statistics",
"Visual Metaphor",
"1 D Space Time Charts",
"Court Time",
"Amateur Tennis Player",
"Tennis Coaches",
"Actionable Insights",
"Visual Analytics",
"Tennis Players",
"Summary Statistics",
"Spatio Temporal Data",
"Data Driven Visual Analysis",
"Tennis Matches",
"Visual Approach",
"User Driven Sorting",
"Clustering Techniques",
"Sports",
"Visual Analytics",
"Spatial Databases",
"Games",
"Data Visualization",
"Tracking",
"Visual Analytics",
"Tennis Analysis",
"Sports Analytics",
"Spatio Temporal Analysis"
],
"authors": [
{
"givenName": "Tom",
"surname": "Polk",
"fullName": "Tom Polk",
"affiliation": "University of Konstanz",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dominik",
"surname": "Jäckle",
"fullName": "Dominik Jäckle",
"affiliation": "University of Konstanz",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Johannes",
"surname": "Häußler",
"fullName": "Johannes Häußler",
"affiliation": "University of Konstanz",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jing",
"surname": "Yang",
"fullName": "Jing Yang",
"affiliation": "University of North Carolina",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "397-406",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2014/12/06876044",
"title": "TenniVis: Visualization for Tennis Match Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06876044/13rRUwI5Ugd",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2018/6100/0/610000b830",
"title": "Soccer: Who Has the Ball? Generating Visual Analytics and Player Statistics",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2018/610000b830/17D45VObpOM",
"parentPublication": {
"id": "proceedings/cvprw/2018/6100/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09894103",
"title": "Team-Builder: Toward More Effective Lineup Selection in Soccer",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09894103/1GIqpPbyH7y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807264",
"title": "Tac-Simur: Tactic-based Simulative Visual Analytics of Table Tennis",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807264/1cG6vo24hRC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2019/2607/2/260702a097",
"title": "Micro-Level Analysis and Visualization of Tennis Shot Patterns with Fractal Tables",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2019/260702a097/1cYipyP6afS",
"parentPublication": {
"id": "compsac/2019/2607/2",
"title": "2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/09411869",
"title": "Tac-Miner: Visual Tactic Mining for Multiple Table Tennis Matches",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/09411869/1t2ii7r7RcI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2021/3892/0/389200a632",
"title": "Tactical Decision System of Table Tennis Match based on C4.5 Decision Tree",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2021/389200a632/1t2nmIZ5RBe",
"parentPublication": {
"id": "proceedings/icmtma/2021/3892/0",
"title": "2021 13th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/tcs/2021/2910/0/291000a533",
"title": "A Study of Liu Shiwen’s Table Tennis Techniques and Tactics Based on Computer-aided Video",
"doi": null,
"abstractUrl": "/proceedings-article/tcs/2021/291000a533/1wRIl8gP8xW",
"parentPublication": {
"id": "proceedings/tcs/2021/2910/0",
"title": "2021 International Conference on Information Technology and Contemporary Sports (TCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2021/3827/0/382700a054",
"title": "VisuaLeague: Visual Analytics of Multiple Games",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2021/382700a054/1y4oI1vKfmg",
"parentPublication": {
"id": "proceedings/iv/2021/3827/0",
"title": "2021 25th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/03/09626557",
"title": "SimuExplorer: Visual Exploration of Game Simulation in Table Tennis",
"doi": null,
"abstractUrl": "/journal/tg/2023/03/09626557/1yNd5vlQLrG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08805431",
"articleId": "1cG4F76usA8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08807264",
"articleId": "1cG6vo24hRC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvDqsVX",
"title": "Sept.",
"year": "2018",
"issueNum": "09",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5xp",
"doi": "10.1109/TVCG.2017.2750681",
"abstract": "We present a semi-automatic approach for stream surface generation. Our approach is based on the conjecture that good seeding curves can be inferred from a set of streamlines. Given a set of densely traced streamlines over the flow field, we design a sketch-based interface that allows users to describe their perceived flow patterns through drawing simple strokes directly on top of the streamline visualization results. Based on the 2D stroke, we identify a 3D seeding curve and generate a stream surface that captures the flow pattern of streamlines at the outermost layer. Then, we remove the streamlines whose patterns are covered by the stream surface. Repeating this process, users can peel the flow by replacing the streamlines with customized surfaces layer by layer. Furthermore, we propose an optimization scheme to identify the optimal seeding curve in the neighborhood of an original seeding curve based on surface quality measures. To support interactive optimization, we design a parallel surface quality estimation strategy that estimates the quality of a seeding curve without generating the surface. Our sketch-based interface leverages an intuitive painting metaphor which most users are familiar with. We present results using multiple data sets to show the effectiveness of our approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a semi-automatic approach for stream surface generation. Our approach is based on the conjecture that good seeding curves can be inferred from a set of streamlines. Given a set of densely traced streamlines over the flow field, we design a sketch-based interface that allows users to describe their perceived flow patterns through drawing simple strokes directly on top of the streamline visualization results. Based on the 2D stroke, we identify a 3D seeding curve and generate a stream surface that captures the flow pattern of streamlines at the outermost layer. Then, we remove the streamlines whose patterns are covered by the stream surface. Repeating this process, users can peel the flow by replacing the streamlines with customized surfaces layer by layer. Furthermore, we propose an optimization scheme to identify the optimal seeding curve in the neighborhood of an original seeding curve based on surface quality measures. To support interactive optimization, we design a parallel surface quality estimation strategy that estimates the quality of a seeding curve without generating the surface. Our sketch-based interface leverages an intuitive painting metaphor which most users are familiar with. We present results using multiple data sets to show the effectiveness of our approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a semi-automatic approach for stream surface generation. Our approach is based on the conjecture that good seeding curves can be inferred from a set of streamlines. Given a set of densely traced streamlines over the flow field, we design a sketch-based interface that allows users to describe their perceived flow patterns through drawing simple strokes directly on top of the streamline visualization results. Based on the 2D stroke, we identify a 3D seeding curve and generate a stream surface that captures the flow pattern of streamlines at the outermost layer. Then, we remove the streamlines whose patterns are covered by the stream surface. Repeating this process, users can peel the flow by replacing the streamlines with customized surfaces layer by layer. Furthermore, we propose an optimization scheme to identify the optimal seeding curve in the neighborhood of an original seeding curve based on surface quality measures. To support interactive optimization, we design a parallel surface quality estimation strategy that estimates the quality of a seeding curve without generating the surface. Our sketch-based interface leverages an intuitive painting metaphor which most users are familiar with. We present results using multiple data sets to show the effectiveness of our approach.",
"title": "Semi-Automatic Generation of Stream Surfaces via Sketching",
"normalizedTitle": "Semi-Automatic Generation of Stream Surfaces via Sketching",
"fno": "08038807",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Geometry",
"Data Visualisation",
"Optimisation",
"Solid Modelling",
"Semiautomatic Generation",
"Stream Surface Generation",
"Good Seeding Curves",
"Densely Traced Streamlines",
"Sketch Based Interface",
"Perceived Flow Patterns",
"Flow Pattern",
"Customized Surfaces Layer",
"Optimal Seeding Curve",
"Parallel Surface Quality Estimation Strategy",
"Surface Treatment",
"Visualization",
"Two Dimensional Displays",
"Streaming Media",
"Three Dimensional Displays",
"Data Visualization",
"Shape",
"Flow Visualization",
"Sketch Based Interface",
"Human Perception",
"Seeding Curves",
"Stream Surfaces"
],
"authors": [
{
"givenName": "Jun",
"surname": "Tao",
"fullName": "Jun Tao",
"affiliation": "Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chaoli",
"surname": "Wang",
"fullName": "Chaoli Wang",
"affiliation": "Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2018-09-01 00:00:00",
"pubType": "trans",
"pages": "2622-2635",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visual/1993/3940/0/00398875",
"title": "Implicit stream surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1993/00398875/12OmNAlvI2V",
"parentPublication": {
"id": "proceedings/visual/1993/3940/0",
"title": "Proceedings Visualization '93",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1997/8262/0/82620075",
"title": "Principal stream surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1997/82620075/12OmNyuy9KX",
"parentPublication": {
"id": "proceedings/ieee-vis/1997/8262/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2014/5500/0/5500b008",
"title": "Scalable Computation of Stream Surfaces on Large Scale Vector Fields",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2014/5500b008/12OmNzXFoId",
"parentPublication": {
"id": "proceedings/sc/2014/5500/0",
"title": "SC14: International Conference for High Performance Computing, Networking, Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/08/ttg2013081342",
"title": "Similarity Measures for Enhancing Interactive Streamline Seeding",
"doi": null,
"abstractUrl": "/journal/tg/2013/08/ttg2013081342/13rRUwInvB3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/03/v0630",
"title": "Image-Based Streamline Generation and Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2007/03/v0630/13rRUwdIOUC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061329",
"title": "Illustrative Stream Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061329/13rRUxcsYLM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"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": "trans/tg/2019/01/08440089",
"title": "Recirculation Surfaces for Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440089/17D45Vw15xs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/04/08532319",
"title": "FlowNet: A Deep Learning Framework for Clustering and Selection of Streamlines and Stream Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2020/04/08532319/17D45XDIXXR",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/09410458",
"title": "SurfRiver: Flattening Stream Surfaces for Comparative Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/09410458/1sYYubtk9va",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08031049",
"articleId": "13rRUwh80uF",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08054703",
"articleId": "13rRUxlgxOq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRHh",
"name": "ttg201809-08038807s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201809-08038807s1.zip",
"extension": "zip",
"size": "43.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwswg8A",
"title": "Jan.-March",
"year": "2019",
"issueNum": "01",
"idPrefix": "ta",
"pubType": "journal",
"volume": "10",
"label": "Jan.-March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvdp",
"doi": "10.1109/TAFFC.2017.2678472",
"abstract": "We proposed a probabilistic approach to joint modeling of participants’ reliability and humans’ regularity in crowdsourced affective studies. Reliability measures how likely a subject will respond to a question seriously; and regularity measures how often a human will agree with other seriously-entered responses coming from a targeted population. Crowdsourcing-based studies or experiments, which rely on human self-reported affect, pose additional challenges as compared with typical crowdsourcing studies that attempt to acquire concrete non-affective labels of objects. The reliability of participants has been massively pursued for typical non-affective crowdsourcing studies, whereas the regularity of humans in an affective experiment in its own right has not been thoroughly considered. It has been often observed that different individuals exhibit different feelings on the same test question, which does not have a sole correct response in the first place. High reliability of responses from one individual thus cannot conclusively result in high consensus across individuals. Instead, globally testing consensus of a population is of interest to investigators. Built upon the agreement multigraph among tasks and workers, our probabilistic model differentiates subject regularity from population reliability. We demonstrate the method’s effectiveness for in-depth robust analysis of large-scale crowdsourced affective data, including emotion and aesthetic assessments collected by presenting visual stimuli to human subjects.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We proposed a probabilistic approach to joint modeling of participants’ reliability and humans’ regularity in crowdsourced affective studies. Reliability measures how likely a subject will respond to a question seriously; and regularity measures how often a human will agree with other seriously-entered responses coming from a targeted population. Crowdsourcing-based studies or experiments, which rely on human self-reported affect, pose additional challenges as compared with typical crowdsourcing studies that attempt to acquire concrete non-affective labels of objects. The reliability of participants has been massively pursued for typical non-affective crowdsourcing studies, whereas the regularity of humans in an affective experiment in its own right has not been thoroughly considered. It has been often observed that different individuals exhibit different feelings on the same test question, which does not have a sole correct response in the first place. High reliability of responses from one individual thus cannot conclusively result in high consensus across individuals. Instead, globally testing consensus of a population is of interest to investigators. Built upon the agreement multigraph among tasks and workers, our probabilistic model differentiates subject regularity from population reliability. We demonstrate the method’s effectiveness for in-depth robust analysis of large-scale crowdsourced affective data, including emotion and aesthetic assessments collected by presenting visual stimuli to human subjects.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We proposed a probabilistic approach to joint modeling of participants’ reliability and humans’ regularity in crowdsourced affective studies. Reliability measures how likely a subject will respond to a question seriously; and regularity measures how often a human will agree with other seriously-entered responses coming from a targeted population. Crowdsourcing-based studies or experiments, which rely on human self-reported affect, pose additional challenges as compared with typical crowdsourcing studies that attempt to acquire concrete non-affective labels of objects. The reliability of participants has been massively pursued for typical non-affective crowdsourcing studies, whereas the regularity of humans in an affective experiment in its own right has not been thoroughly considered. It has been often observed that different individuals exhibit different feelings on the same test question, which does not have a sole correct response in the first place. High reliability of responses from one individual thus cannot conclusively result in high consensus across individuals. Instead, globally testing consensus of a population is of interest to investigators. Built upon the agreement multigraph among tasks and workers, our probabilistic model differentiates subject regularity from population reliability. We demonstrate the method’s effectiveness for in-depth robust analysis of large-scale crowdsourced affective data, including emotion and aesthetic assessments collected by presenting visual stimuli to human subjects.",
"title": "Probabilistic Multigraph Modeling for Improving the Quality of Crowdsourced Affective Data",
"normalizedTitle": "Probabilistic Multigraph Modeling for Improving the Quality of Crowdsourced Affective Data",
"fno": "07872458",
"hasPdf": true,
"idPrefix": "ta",
"keywords": [
"Reliability",
"Data Models",
"Probabilistic Logic",
"Computational Modeling",
"Psychology",
"Crowdsourcing",
"Complexity Theory",
"Emotions",
"Human Subjects",
"Crowdsourcing",
"Probabilistic Graphical Model",
"Visual Stimuli"
],
"authors": [
{
"givenName": "Jianbo",
"surname": "Ye",
"fullName": "Jianbo Ye",
"affiliation": "College of Information Sciences and Technology, The Pennsylvania State University, University Park, PA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jia",
"surname": "Li",
"fullName": "Jia Li",
"affiliation": "Department of Statistics, The Pennsylvania State University, University Park, PA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michelle G.",
"surname": "Newman",
"fullName": "Michelle G. Newman",
"affiliation": "Department of Psychology, The Pennsylvania State University, University Park, PA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Reginald B.",
"surname": "Adams",
"fullName": "Reginald B. Adams",
"affiliation": "Department of Psychology, The Pennsylvania State University, University Park, PA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "James Z.",
"surname": "Wang",
"fullName": "James Z. Wang",
"affiliation": "College of Information Sciences and Technology, The Pennsylvania State University, University Park, PA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "115-128",
"year": "2019",
"issn": "1949-3045",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2015/9504/0/9504a937",
"title": "Quality Control for Crowdsourced Hierarchical Classification",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2015/9504a937/12OmNwAt1CS",
"parentPublication": {
"id": "proceedings/icdm/2015/9504/0",
"title": "2015 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2014/4717/0/06890568",
"title": "From crowdsourced rankings to affective ratings",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2014/06890568/12OmNwkhTiA",
"parentPublication": {
"id": "proceedings/icmew/2014/4717/0",
"title": "2014 IEEE International Conference on Multimedia and Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsec/2017/3681/0/3681a495",
"title": "Failure Prediction in Crowdsourced Software Development",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2017/3681a495/12OmNx19jYi",
"parentPublication": {
"id": "proceedings/apsec/2017/3681/0",
"title": "2017 24th Asia-Pacific Software Engineering Conference (APSEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csi-se/2018/5733/0/573301a028",
"title": "A Hybrid Simulation Model for Crowdsourced Software Development",
"doi": null,
"abstractUrl": "/proceedings-article/csi-se/2018/573301a028/13bd1gzWkQW",
"parentPublication": {
"id": "proceedings/csi-se/2018/5733/0",
"title": "2018 IEEE/ACM 5th International Workshop on Crowd Sourcing in Software Engineering (CSI-SE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2019/07/07572151",
"title": "Distribution-Aware Crowdsourced Entity Collection",
"doi": null,
"abstractUrl": "/journal/tk/2019/07/07572151/13rRUILtJrv",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2016/07/07422085",
"title": "Aggregating Crowdsourced Quantitative Claims: Additive and Multiplicative Models",
"doi": null,
"abstractUrl": "/journal/tk/2016/07/07422085/13rRUx0geAn",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ic/2012/05/mic2012050020",
"title": "Obtaining High-Quality Relevance Judgments Using Crowdsourcing",
"doi": null,
"abstractUrl": "/magazine/ic/2012/05/mic2012050020/13rRUy2YLML",
"parentPublication": {
"id": "mags/ic",
"title": "IEEE Internet Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2017/3163/0/08585484",
"title": "CRICTO: Supporting Sensemaking through Crowdsourced Information Schematization",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2017/08585484/17D45Wc1ILV",
"parentPublication": {
"id": "proceedings/vast/2017/3163/0",
"title": "2017 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/05/08892650",
"title": "Multi-Label Truth Inference for Crowdsourcing Using Mixture Models",
"doi": null,
"abstractUrl": "/journal/tk/2021/05/08892650/1eJQZKNzrJS",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2020/1924/0/192400a187",
"title": "Emergency Incident Detection from Crowdsourced Waze Data using Bayesian Information Fusion",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2020/192400a187/1uHhv4IIlTW",
"parentPublication": {
"id": "proceedings/wi-iat/2020/1924/0",
"title": "2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07878633",
"articleId": "13rRUxN5eBY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07898442",
"articleId": "13rRUwInvwy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrIJqml",
"title": "Oct.-Dec.",
"year": "2015",
"issueNum": "04",
"idPrefix": "ta",
"pubType": "journal",
"volume": "6",
"label": "Oct.-Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0xPSj",
"doi": "10.1109/TAFFC.2015.2432791",
"abstract": "Video affective content analysis has been an active research area in recent decades, since emotion is an important component in the classification and retrieval of videos. Video affective content analysis can be divided into two approaches: direct and implicit. Direct approaches infer the affective content of videos directly from related audiovisual features. Implicit approaches, on the other hand, detect affective content from videos based on an automatic analysis of a user’s spontaneous response while consuming the videos. This paper first proposes a general framework for video affective content analysis, which includes video content, emotional descriptors, and users’ spontaneous nonverbal responses, as well as the relationships between the three. Then, we survey current research in both direct and implicit video affective content analysis, with a focus on direct video affective content analysis. Lastly, we identify several challenges in this field and put forward recommendations for future research.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Video affective content analysis has been an active research area in recent decades, since emotion is an important component in the classification and retrieval of videos. Video affective content analysis can be divided into two approaches: direct and implicit. Direct approaches infer the affective content of videos directly from related audiovisual features. Implicit approaches, on the other hand, detect affective content from videos based on an automatic analysis of a user’s spontaneous response while consuming the videos. This paper first proposes a general framework for video affective content analysis, which includes video content, emotional descriptors, and users’ spontaneous nonverbal responses, as well as the relationships between the three. Then, we survey current research in both direct and implicit video affective content analysis, with a focus on direct video affective content analysis. Lastly, we identify several challenges in this field and put forward recommendations for future research.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Video affective content analysis has been an active research area in recent decades, since emotion is an important component in the classification and retrieval of videos. Video affective content analysis can be divided into two approaches: direct and implicit. Direct approaches infer the affective content of videos directly from related audiovisual features. Implicit approaches, on the other hand, detect affective content from videos based on an automatic analysis of a user’s spontaneous response while consuming the videos. This paper first proposes a general framework for video affective content analysis, which includes video content, emotional descriptors, and users’ spontaneous nonverbal responses, as well as the relationships between the three. Then, we survey current research in both direct and implicit video affective content analysis, with a focus on direct video affective content analysis. Lastly, we identify several challenges in this field and put forward recommendations for future research.",
"title": "Video Affective Content Analysis: A Survey of State-of-the-Art Methods",
"normalizedTitle": "Video Affective Content Analysis: A Survey of State-of-the-Art Methods",
"fno": "07106468",
"hasPdf": true,
"idPrefix": "ta",
"keywords": [
"Speech",
"Feature Extraction",
"Mel Frequency Cepstral Coefficient",
"Visualization",
"Rhythm",
"Image Color Analysis",
"Content Based Video Retrieval",
"Video Affective Content Analysis",
"Emotion Recognition",
"And Content Based Video Retrieval",
"Video Affective Content Analysis",
"Emotion Recognition"
],
"authors": [
{
"givenName": "Shangfei",
"surname": "Wang",
"fullName": "Shangfei Wang",
"affiliation": ", School of Computer Science and Technology, Hefei, Anhui, P.R. China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qiang",
"surname": "Ji",
"fullName": "Qiang Ji",
"affiliation": ", Rensselaer Polytechnic Institute, Troy, NY",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2015-10-01 00:00:00",
"pubType": "trans",
"pages": "410-430",
"year": "2015",
"issn": "1949-3045",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/platcon/2015/1888/0/1888a017",
"title": "Audio-Visual and EEG-Based Attention Modeling for Extraction of Affective Video Content",
"doi": null,
"abstractUrl": "/proceedings-article/platcon/2015/1888a017/12OmNBUS71V",
"parentPublication": {
"id": "proceedings/platcon/2015/1888/0",
"title": "2015 International Conference on Platform Technology and Service (PlatCon)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2013/1604/0/06618331",
"title": "Towards semantic and affective content-based video recommendation",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2013/06618331/12OmNBpmDI8",
"parentPublication": {
"id": "proceedings/icmew/2013/1604/0",
"title": "2013 IEEE International Conference on Multimedia and Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2014/4761/0/06890234",
"title": "Improved audio features for large-scale multimedia event detection",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2014/06890234/12OmNvjgWAz",
"parentPublication": {
"id": "proceedings/icme/2014/4761/0",
"title": "2014 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2005/9331/0/01521695",
"title": "Affective Meeting Video Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2005/01521695/12OmNx38vPH",
"parentPublication": {
"id": "proceedings/icme/2005/9331/0",
"title": "2005 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2015/7082/0/07177525",
"title": "Audio-based affect detection in web videos",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2015/07177525/12OmNyQYtwV",
"parentPublication": {
"id": "proceedings/icme/2015/7082/0",
"title": "2015 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2016/02/07160715",
"title": "The Geneva Minimalistic Acoustic Parameter Set (GeMAPS) for Voice Research and Affective Computing",
"doi": null,
"abstractUrl": "/journal/ta/2016/02/07160715/13rRUypp569",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2018/04/07836331",
"title": "Affective Video Content Analysis: A Multidisciplinary Insight",
"doi": null,
"abstractUrl": "/journal/ta/2018/04/07836331/17D45XuDNIs",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2021/04/08697096",
"title": "Video Affective Content Analysis by Exploring Domain Knowledge",
"doi": null,
"abstractUrl": "/journal/ta/2021/04/08697096/19sOAd2laJq",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2022/04/09898895",
"title": "Modeling Real-World Affective and Communicative Nonverbal Vocalizations From Minimally Speaking Individuals",
"doi": null,
"abstractUrl": "/journal/ta/2022/04/09898895/1GQIAEFCOfS",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2019/5023/0/502300d703",
"title": "FaceSyncNet: A Deep Learning-Based Approach for Non-Linear Synchronization of Facial Performance Videos",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2019/502300d703/1i5mGUAM6vC",
"parentPublication": {
"id": "proceedings/iccvw/2019/5023/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07051238",
"articleId": "13rRUwbs29A",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwCJOG3",
"title": "January-March",
"year": "2014",
"issueNum": "01",
"idPrefix": "ta",
"pubType": "journal",
"volume": "5",
"label": "January-March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuyZ",
"doi": "10.1109/T-AFFC.2013.21",
"abstract": "A process for the design and manufacture of 3D tactile textures with predefined affective properties was developed. Twenty four tactile textures were manufactured. Texture measures from the domain of machine vision were used to characterize the digital representations of the tactile textures. To obtain affective ratings, the textures were touched, unseen, by 107 participants who scored them against natural, warm, elegant, rough, simple, and like, on a semantic differential scale. The texture measures were correlated with the participants' affective ratings using a novel feature subset evaluation method and a partial least squares genetic algorithm. Six measures were identified that are significantly correlated with human responses and are unlikely to have occurred by chance. Regression equations were used to select 48 new tactile textures that had been synthesized using mixing algorithms and which were likely to score highly against the six adjectives when touched by participants. The new textures were manufactured and rated by participants. It was found that the regression equations gave excellent predictive ability. The principal contribution of the work is the demonstration of a process, using machine vision methods and rapid prototyping, which can be used to make new tactile textures with predefined affective properties.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A process for the design and manufacture of 3D tactile textures with predefined affective properties was developed. Twenty four tactile textures were manufactured. Texture measures from the domain of machine vision were used to characterize the digital representations of the tactile textures. To obtain affective ratings, the textures were touched, unseen, by 107 participants who scored them against natural, warm, elegant, rough, simple, and like, on a semantic differential scale. The texture measures were correlated with the participants' affective ratings using a novel feature subset evaluation method and a partial least squares genetic algorithm. Six measures were identified that are significantly correlated with human responses and are unlikely to have occurred by chance. Regression equations were used to select 48 new tactile textures that had been synthesized using mixing algorithms and which were likely to score highly against the six adjectives when touched by participants. The new textures were manufactured and rated by participants. It was found that the regression equations gave excellent predictive ability. The principal contribution of the work is the demonstration of a process, using machine vision methods and rapid prototyping, which can be used to make new tactile textures with predefined affective properties.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A process for the design and manufacture of 3D tactile textures with predefined affective properties was developed. Twenty four tactile textures were manufactured. Texture measures from the domain of machine vision were used to characterize the digital representations of the tactile textures. To obtain affective ratings, the textures were touched, unseen, by 107 participants who scored them against natural, warm, elegant, rough, simple, and like, on a semantic differential scale. The texture measures were correlated with the participants' affective ratings using a novel feature subset evaluation method and a partial least squares genetic algorithm. Six measures were identified that are significantly correlated with human responses and are unlikely to have occurred by chance. Regression equations were used to select 48 new tactile textures that had been synthesized using mixing algorithms and which were likely to score highly against the six adjectives when touched by participants. The new textures were manufactured and rated by participants. It was found that the regression equations gave excellent predictive ability. The principal contribution of the work is the demonstration of a process, using machine vision methods and rapid prototyping, which can be used to make new tactile textures with predefined affective properties.",
"title": "Making Tactile Textures with Predefined Affective Properties",
"normalizedTitle": "Making Tactile Textures with Predefined Affective Properties",
"fno": "06626305",
"hasPdf": true,
"idPrefix": "ta",
"keywords": [
"Feature Extraction",
"Visualization",
"Surface Topography",
"Visual Perception",
"Correlation",
"Three Dimensional Displays",
"Machine Vision",
"Texture",
"Feature Evaluation And Selection",
"Human Factors",
"Rapid Prototyping"
],
"authors": [
{
"givenName": "Galal",
"surname": "Elkharraz",
"fullName": "Galal Elkharraz",
"affiliation": "School of Mechanical Engineering, University of Leeds, Leeds, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefan",
"surname": "Thumfart",
"fullName": "Stefan Thumfart",
"affiliation": "Profactor GmbH, Im Stadtgut A2, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Diyar",
"surname": "Akay",
"fullName": "Diyar Akay",
"affiliation": "Department of Industrial Engineering, Faculty of Engineering, Gazi University, Ankara, Turkey",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christian",
"surname": "Eitzinger",
"fullName": "Christian Eitzinger",
"affiliation": "Profactor GmbH, Im Stadtgut A2, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Brian",
"surname": "Henson",
"fullName": "Brian Henson",
"affiliation": "School of Mechanical Engineering, University of Leeds, Leeds, United Kingdom",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2014-01-01 00:00:00",
"pubType": "trans",
"pages": "57-70",
"year": "2014",
"issn": "1949-3045",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/haptics/2008/2005/0/04479912",
"title": "Discrimination of Virtual Square Gratings by Dynamic Touch on Friction Based Tactile Displays",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2008/04479912/12OmNAQJzTQ",
"parentPublication": {
"id": "proceedings/haptics/2008/2005/0",
"title": "IEEE Haptics Symposium 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2010/6237/0/05444754",
"title": "Design and evaluation of a haptic tactile actuator to simulate rough textures",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2010/05444754/12OmNAS9zy0",
"parentPublication": {
"id": "proceedings/vr/2010/6237/0",
"title": "2010 IEEE Virtual Reality Conference (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2008/2005/0/04479989",
"title": "Tactile Graphics Rendering Using Three Laterotactile Drawing Primitives",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2008/04479989/12OmNAkWvzw",
"parentPublication": {
"id": "proceedings/haptics/2008/2005/0",
"title": "IEEE Haptics Symposium 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aciiw/2017/0680/0/08272601",
"title": "Affective evaluation for material perception of bead-coated resin surfaces using visual and tactile sensations under virtual and real environments",
"doi": null,
"abstractUrl": "/proceedings-article/aciiw/2017/08272601/12OmNCdTeNu",
"parentPublication": {
"id": "proceedings/aciiw/2017/0680/0",
"title": "2017 Seventh International Conference on Affective Computing and Intelligent Interaction Workshops and Demos (ACIIW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2002/1489/0/14890327",
"title": "TextureExplorer: A Tactile and Force Display for Virtual Textures",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2002/14890327/12OmNqBbHwI",
"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/vr/2010/6237/0/05444791",
"title": "Influence of tactile feedback and presence on egocentric distance perception in virtual environments",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2010/05444791/12OmNyoAA64",
"parentPublication": {
"id": "proceedings/vr/2010/6237/0",
"title": "2010 IEEE Virtual Reality Conference (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2010/04/tth2010040245",
"title": "Design of Dynamic Vibrotactile Textures",
"doi": null,
"abstractUrl": "/journal/th/2010/04/tth2010040245/13rRUwgyOjt",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2013/01/tth2013010081",
"title": "Psychophysical Dimensions of Tactile Perception of Textures",
"doi": null,
"abstractUrl": "/journal/th/2013/01/tth2013010081/13rRUx0xPTW",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2017/03/07795197",
"title": "Tactile Perception and Friction-Induced Vibrations: Discrimination of Similarly Patterned Wood-Like Surfaces",
"doi": null,
"abstractUrl": "/journal/th/2017/03/07795197/13rRUxD9h5l",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2017/02/07725536",
"title": "Linkage between Free Exploratory Movements and Subjective Tactile Ratings",
"doi": null,
"abstractUrl": "/journal/th/2017/02/07725536/13rRUxjQypi",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06645369",
"articleId": "13rRUwh80Bf",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06737281",
"articleId": "13rRUyuegny",
"__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": "1cG6bYWFt3W",
"doi": "10.1109/TVCG.2019.2934810",
"abstract": "Designers need to consider not only perceptual effectiveness but also visual styles when creating an infographic. This process can be difficult and time consuming for professional designers, not to mention non-expert users, leading to the demand for automated infographics design. As a first step, we focus on timeline infographics, which have been widely used for centuries. We contribute an end-to-end approach that automatically extracts an extensible timeline template from a bitmap image. Our approach adopts a deconstruction and reconstruction paradigm. At the deconstruction stage, we propose a multi-task deep neural network that simultaneously parses two kinds of information from a bitmap timeline: 1) the global information, i.e., the representation, scale, layout, and orientation of the timeline, and 2) the local information, i.e., the location, category, and pixels of each visual element on the timeline. At the reconstruction stage, we propose a pipeline with three techniques, i.e., Non-Maximum Merging, Redundancy Recover, and DL GrabCut, to extract an extensible template from the infographic, by utilizing the deconstruction results. To evaluate the effectiveness of our approach, we synthesize a timeline dataset (4296 images) and collect a real-world timeline dataset (393 images) from the Internet. We first report quantitative evaluation results of our approach over the two datasets. Then, we present examples of automatically extracted templates and timelines automatically generated based on these templates to qualitatively demonstrate the performance. The results confirm that our approach can effectively extract extensible templates from real-world timeline infographics.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Designers need to consider not only perceptual effectiveness but also visual styles when creating an infographic. This process can be difficult and time consuming for professional designers, not to mention non-expert users, leading to the demand for automated infographics design. As a first step, we focus on timeline infographics, which have been widely used for centuries. We contribute an end-to-end approach that automatically extracts an extensible timeline template from a bitmap image. Our approach adopts a deconstruction and reconstruction paradigm. At the deconstruction stage, we propose a multi-task deep neural network that simultaneously parses two kinds of information from a bitmap timeline: 1) the global information, i.e., the representation, scale, layout, and orientation of the timeline, and 2) the local information, i.e., the location, category, and pixels of each visual element on the timeline. At the reconstruction stage, we propose a pipeline with three techniques, i.e., Non-Maximum Merging, Redundancy Recover, and DL GrabCut, to extract an extensible template from the infographic, by utilizing the deconstruction results. To evaluate the effectiveness of our approach, we synthesize a timeline dataset (4296 images) and collect a real-world timeline dataset (393 images) from the Internet. We first report quantitative evaluation results of our approach over the two datasets. Then, we present examples of automatically extracted templates and timelines automatically generated based on these templates to qualitatively demonstrate the performance. The results confirm that our approach can effectively extract extensible templates from real-world timeline infographics.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Designers need to consider not only perceptual effectiveness but also visual styles when creating an infographic. This process can be difficult and time consuming for professional designers, not to mention non-expert users, leading to the demand for automated infographics design. As a first step, we focus on timeline infographics, which have been widely used for centuries. We contribute an end-to-end approach that automatically extracts an extensible timeline template from a bitmap image. Our approach adopts a deconstruction and reconstruction paradigm. At the deconstruction stage, we propose a multi-task deep neural network that simultaneously parses two kinds of information from a bitmap timeline: 1) the global information, i.e., the representation, scale, layout, and orientation of the timeline, and 2) the local information, i.e., the location, category, and pixels of each visual element on the timeline. At the reconstruction stage, we propose a pipeline with three techniques, i.e., Non-Maximum Merging, Redundancy Recover, and DL GrabCut, to extract an extensible template from the infographic, by utilizing the deconstruction results. To evaluate the effectiveness of our approach, we synthesize a timeline dataset (4296 images) and collect a real-world timeline dataset (393 images) from the Internet. We first report quantitative evaluation results of our approach over the two datasets. Then, we present examples of automatically extracted templates and timelines automatically generated based on these templates to qualitatively demonstrate the performance. The results confirm that our approach can effectively extract extensible templates from real-world timeline infographics.",
"title": "Towards Automated Infographic Design: Deep Learning-based Auto-Extraction of Extensible Timeline",
"normalizedTitle": "Towards Automated Infographic Design: Deep Learning-based Auto-Extraction of Extensible Timeline",
"fno": "08807266",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Graphics",
"Data Visualisation",
"Feature Extraction",
"Image Segmentation",
"Internet",
"Learning Artificial Intelligence",
"Neural Nets",
"Automatically Extracted Templates",
"Extensible Template",
"Real World Timeline Infographics",
"Deep Learning Based Auto Extraction",
"Perceptual Effectiveness",
"Visual Styles",
"Nonexpert Users",
"Automated Infographics Design",
"End To End Approach",
"Extensible Timeline Template",
"Bitmap Image",
"Reconstruction Paradigm",
"Deconstruction Stage",
"Multitask Deep Neural Network",
"Bitmap Timeline",
"Global Information",
"Local Information",
"Visual Element",
"Reconstruction Stage",
"Non Maximum Merging",
"Real World Timeline Dataset",
"Automated Infographic Design",
"Visualization",
"Data Visualization",
"Data Mining",
"Image Reconstruction",
"Pipelines",
"Image Coding",
"Object Detection",
"Automated Infographic Design",
"Deep Learning Based Approach",
"Timeline Infographics",
"Multi Task Model"
],
"authors": [
{
"givenName": "Zhutian",
"surname": "Chen",
"fullName": "Zhutian Chen",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yun",
"surname": "Wang",
"fullName": "Yun Wang",
"affiliation": "Microsoft Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qianwen",
"surname": "Wang",
"fullName": "Qianwen Wang",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yong",
"surname": "Wang",
"fullName": "Yong Wang",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Qu",
"fullName": "Huamin Qu",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "917-926",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icalt/2016/9041/0/9041a366",
"title": "Infographics or Graphics+Text: Which Material is Best for Robust Learning?",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2016/9041a366/12OmNAgGwfh",
"parentPublication": {
"id": "proceedings/icalt/2016/9041/0",
"title": "2016 IEEE 16th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2014/4103/0/4103a225",
"title": "SchemaLine: Timeline Visualization for Sensemaking",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2014/4103a225/12OmNvjQ92N",
"parentPublication": {
"id": "proceedings/iv/2014/4103/0",
"title": "2014 18th International Conference on Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2013/2246/0/2246a206",
"title": "A Study on Enhancing Timeline-Like Visualization with Verbal Text",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2013/2246a206/12OmNzcxZ6N",
"parentPublication": {
"id": "proceedings/cw/2013/2246/0",
"title": "2013 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2022/0915/0/091500c582",
"title": "InfographicVQA",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2022/091500c582/1B13upEQdW0",
"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/vahc/2022/0103/0/10108526",
"title": "Browser-based Infographic Tailoring Self-service Interface (BITSI)",
"doi": null,
"abstractUrl": "/proceedings-article/vahc/2022/10108526/1MIgSVcHS9O",
"parentPublication": {
"id": "proceedings/vahc/2022/0103/0",
"title": "2022 Workshop on Visual Analytics in Healthcare (VAHC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a056",
"title": "Automatic Infogram Generation for Online Journalism",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a056/1cMFaoRMwYE",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08813126",
"title": "Text-to-Viz: Automatic Generation of Infographics from Proportion-Related Natural Language Statements",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08813126/1cOhCUrVI1G",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/09409643",
"title": "Smile or Scowl? Looking at Infographic Design Through the Affective Lens",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/09409643/1sXjFUw1Jra",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09444798",
"title": "InfoColorizer: Interactive Recommendation of Color Palettes for Infographics",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09444798/1u51zekYoA8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09585700",
"title": "A Mixed-Initiative Approach to Reusing Infographic Charts",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09585700/1y11cGSPuPC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08813126",
"articleId": "1cOhCUrVI1G",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08807235",
"articleId": "1cG6m1AVG6c",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1fe9S0YKDS0",
"name": "ttg202001-08807266s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202001-08807266s1.zip",
"extension": "zip",
"size": "16.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1ECXHMu0OWc",
"title": "Aug.",
"year": "2022",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1qdT8m4QLIY",
"doi": "10.1109/TVCG.2021.3050118",
"abstract": "Recent work in data visualization has demonstrated that small, perceptually-distinct color palettes—such as those used in categorical mapping—can connote significant affective qualities. Data that are mapped or otherwise visualized are also often emotive in nature, either inherently (e.g., climate change, disease mortality rates), or by design, such as can be found in visual storytelling. However, little is known about how the affective qualities of color interact with those of data context in visualization design. This article describes the results of a crowdsourced study on the influence of affectively congruent versus incongruent color schemes on categorical map-reading response. We report both objective (pattern detection; area comparison) and subjective (affective quality; appropriateness; preference) measures of map-reader response. Our results suggest that affectively congruent colors amplify perceptions of the affective qualities of maps with emotive topics, affective incongruence may cause confusion, and that affective congruence is particularly influential in maps of positive-leaning data topics. Finally, we offer preliminary design recommendations for balancing color congruence with other design factors, and for synthesizing color and affective context in thematic map design.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recent work in data visualization has demonstrated that small, perceptually-distinct color palettes—such as those used in categorical mapping—can connote significant affective qualities. Data that are mapped or otherwise visualized are also often emotive in nature, either inherently (e.g., climate change, disease mortality rates), or by design, such as can be found in visual storytelling. However, little is known about how the affective qualities of color interact with those of data context in visualization design. This article describes the results of a crowdsourced study on the influence of affectively congruent versus incongruent color schemes on categorical map-reading response. We report both objective (pattern detection; area comparison) and subjective (affective quality; appropriateness; preference) measures of map-reader response. Our results suggest that affectively congruent colors amplify perceptions of the affective qualities of maps with emotive topics, affective incongruence may cause confusion, and that affective congruence is particularly influential in maps of positive-leaning data topics. Finally, we offer preliminary design recommendations for balancing color congruence with other design factors, and for synthesizing color and affective context in thematic map design.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recent work in data visualization has demonstrated that small, perceptually-distinct color palettes—such as those used in categorical mapping—can connote significant affective qualities. Data that are mapped or otherwise visualized are also often emotive in nature, either inherently (e.g., climate change, disease mortality rates), or by design, such as can be found in visual storytelling. However, little is known about how the affective qualities of color interact with those of data context in visualization design. This article describes the results of a crowdsourced study on the influence of affectively congruent versus incongruent color schemes on categorical map-reading response. We report both objective (pattern detection; area comparison) and subjective (affective quality; appropriateness; preference) measures of map-reader response. Our results suggest that affectively congruent colors amplify perceptions of the affective qualities of maps with emotive topics, affective incongruence may cause confusion, and that affective congruence is particularly influential in maps of positive-leaning data topics. Finally, we offer preliminary design recommendations for balancing color congruence with other design factors, and for synthesizing color and affective context in thematic map design.",
"title": "Affective Congruence in Visualization Design: Influences on Reading Categorical Maps",
"normalizedTitle": "Affective Congruence in Visualization Design: Influences on Reading Categorical Maps",
"fno": "09318559",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Behavioural Sciences Computing",
"Cartography",
"Data Visualisation",
"Diseases",
"Image Colour Analysis",
"Multimedia Computing",
"Visual Perception",
"Color Congruence",
"Design Factors",
"Map Design",
"Affective Congruence",
"Visualization Design",
"Data Visualization",
"Color Palettes",
"Climate Change",
"Disease Mortality Rates",
"Visual Storytelling",
"Data Context",
"Categorical Map Reading Response",
"Emotive Topics",
"Affective Incongruence",
"Categorical Mapping",
"Thematic Map Design",
"Image Color Analysis",
"Data Visualization",
"Visualization",
"Cartography",
"Climate Change",
"Color",
"Visualization",
"Emotion",
"Design",
"Cartography"
],
"authors": [
{
"givenName": "Cary L.",
"surname": "Anderson",
"fullName": "Cary L. Anderson",
"affiliation": "Katz Graduate School of Business, Marketing and Business Economics Area, University of Pittsburgh, Pittsburgh, PA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anthony C.",
"surname": "Robinson",
"fullName": "Anthony C. Robinson",
"affiliation": "GeoVISTA Center, Department of Geography, The Pennsylvania State University, University Park, PA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2022-08-01 00:00:00",
"pubType": "trans",
"pages": "2867-2878",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/culture-computing/2013/5047/0/5047a153",
"title": "Affective Music Recommendation System Reflecting the Mood of Input Image",
"doi": null,
"abstractUrl": "/proceedings-article/culture-computing/2013/5047a153/12OmNAQJzMW",
"parentPublication": {
"id": "proceedings/culture-computing/2013/5047/0",
"title": "2013 International Conference on Culture and Computing (Culture Computing)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2013/5048/0/5048a435",
"title": "Non-anthropomorphic Expression of Affective States through Parametrized Abstract Motifs",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2013/5048a435/12OmNxUdvae",
"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/iv-vis/2008/3271/0/3271a018",
"title": "Mixing Emotions, How Physical Discomfort Influences the Affective Appraisal of Virtual Places",
"doi": null,
"abstractUrl": "/proceedings-article/iv-vis/2008/3271a018/12OmNzwpU2I",
"parentPublication": {
"id": "proceedings/iv-vis/2008/3271/0",
"title": "Visualisation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/10/ttg2013101746",
"title": "Perceptually Driven Visibility Optimization for Categorical Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2013/10/ttg2013101746/13rRUwI5Ug7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mu/2016/03/mmu2016030044",
"title": "Computational Modeling of Affective Qualities of Abstract Paintings",
"doi": null,
"abstractUrl": "/magazine/mu/2016/03/mmu2016030044/13rRUwInvv1",
"parentPublication": {
"id": "mags/mu",
"title": "IEEE MultiMedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2022/9007/0/900700a040",
"title": "Affective Color Palette Recommendations with Non-negative Tensor Factorization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2022/900700a040/1KaH7ehIrGU",
"parentPublication": {
"id": "proceedings/iv/2022/9007/0",
"title": "2022 26th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2020/04/09117084",
"title": "Close Reading for Visualization Evaluation",
"doi": null,
"abstractUrl": "/magazine/cg/2020/04/09117084/1kGgoDW7R2E",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/09409643",
"title": "Smile or Scowl? Looking at Infographic Design Through the Affective Lens",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/09409643/1sXjFUw1Jra",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2020/1056/0/09381419",
"title": "Affective Polarization in Online Climate Change Discourse on Twitter",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2020/09381419/1semx89mBhK",
"parentPublication": {
"id": "proceedings/asonam/2020/1056/0",
"title": "2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visap/2021/4021/0/402100a020",
"title": "Affective Palettes for Scientific Visualization: Grounding Environmental Data in the Natural World",
"doi": null,
"abstractUrl": "/proceedings-article/visap/2021/402100a020/1yNiQvZ7TyM",
"parentPublication": {
"id": "proceedings/visap/2021/4021/0",
"title": "2021 IEEE VIS Arts Program (VISAP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09286513",
"articleId": "1porhlu0eEo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09296787",
"articleId": "1pDnA5z2Kdy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1ECXNTA9Puo",
"name": "ttg202208-09318559s1-supp1-3050118.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202208-09318559s1-supp1-3050118.pdf",
"extension": "pdf",
"size": "2.69 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNALlcj1",
"title": "May",
"year": "2018",
"issueNum": "05",
"idPrefix": "tk",
"pubType": "journal",
"volume": "30",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwh80BX",
"doi": "10.1109/TKDE.2017.2781241",
"abstract": "Graph algorithm is pervasive in many applications ranging from targeted advertising to natural language processing. Recently, Asynchronous Graph Processing (AGP) is becoming a promising model to support graph algorithm on large-scale distributed computing platforms because it enables faster convergence speed and lower synchronization cost than the synchronous model for no barrier between iterations. However, existing AGP methods still suffer from poor performance for inefficient vertex state propagation. In this paper, we propose an effective and low-cost forward and backward sweeping execution method to accelerate state propagation for AGP, based on a key observation that states in AGP can be propagated between vertices much faster when the vertices are processed sequentially along the graph path within each round. Through dividing graph into paths and asynchronously processing vertices on each path in an alternative forward and backward way according to their order on this path, vertex states in our approach can be quickly propagated to other vertices and converge in a faster way with only little additional overhead. In order to efficiently support it over distributed platforms, we also propose a scheme to reduce the communication overhead along with a static priority ordering scheme to further improve the convergence speed. Experimental results on a cluster with 1,024 cores show that our approach achieves excellent scalability for large-scale graph algorithms and the overall execution time is reduced by at least 39.8 percent, in comparison with the most cutting-edge methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Graph algorithm is pervasive in many applications ranging from targeted advertising to natural language processing. Recently, Asynchronous Graph Processing (AGP) is becoming a promising model to support graph algorithm on large-scale distributed computing platforms because it enables faster convergence speed and lower synchronization cost than the synchronous model for no barrier between iterations. However, existing AGP methods still suffer from poor performance for inefficient vertex state propagation. In this paper, we propose an effective and low-cost forward and backward sweeping execution method to accelerate state propagation for AGP, based on a key observation that states in AGP can be propagated between vertices much faster when the vertices are processed sequentially along the graph path within each round. Through dividing graph into paths and asynchronously processing vertices on each path in an alternative forward and backward way according to their order on this path, vertex states in our approach can be quickly propagated to other vertices and converge in a faster way with only little additional overhead. In order to efficiently support it over distributed platforms, we also propose a scheme to reduce the communication overhead along with a static priority ordering scheme to further improve the convergence speed. Experimental results on a cluster with 1,024 cores show that our approach achieves excellent scalability for large-scale graph algorithms and the overall execution time is reduced by at least 39.8 percent, in comparison with the most cutting-edge methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Graph algorithm is pervasive in many applications ranging from targeted advertising to natural language processing. Recently, Asynchronous Graph Processing (AGP) is becoming a promising model to support graph algorithm on large-scale distributed computing platforms because it enables faster convergence speed and lower synchronization cost than the synchronous model for no barrier between iterations. However, existing AGP methods still suffer from poor performance for inefficient vertex state propagation. In this paper, we propose an effective and low-cost forward and backward sweeping execution method to accelerate state propagation for AGP, based on a key observation that states in AGP can be propagated between vertices much faster when the vertices are processed sequentially along the graph path within each round. Through dividing graph into paths and asynchronously processing vertices on each path in an alternative forward and backward way according to their order on this path, vertex states in our approach can be quickly propagated to other vertices and converge in a faster way with only little additional overhead. In order to efficiently support it over distributed platforms, we also propose a scheme to reduce the communication overhead along with a static priority ordering scheme to further improve the convergence speed. Experimental results on a cluster with 1,024 cores show that our approach achieves excellent scalability for large-scale graph algorithms and the overall execution time is reduced by at least 39.8 percent, in comparison with the most cutting-edge methods.",
"title": "FBSGraph: Accelerating Asynchronous Graph Processing via Forward and Backward Sweeping",
"normalizedTitle": "FBSGraph: Accelerating Asynchronous Graph Processing via Forward and Backward Sweeping",
"fno": "08170287",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Graph Theory",
"Iterative Methods",
"Natural Language Processing",
"Synchronisation",
"Asynchronous Graph Processing",
"Graph Algorithm",
"Large Scale Distributed Computing Platforms",
"Convergence Speed",
"Lower Synchronization Cost",
"Synchronous Model",
"AGP Methods",
"Inefficient Vertex State Propagation",
"Graph Path",
"Dividing Graph",
"Vertex States",
"Large Scale Graph Algorithms",
"Natural Language Processing",
"Convergence",
"Synchronization",
"Acceleration",
"Clustering Algorithms",
"Data Models",
"Computational Modeling",
"Distributed Computing",
"Graph Algorithm",
"Synchronous Asynchronous",
"Convergence",
"Cascade Effect"
],
"authors": [
{
"givenName": "Yu",
"surname": "Zhang",
"fullName": "Yu Zhang",
"affiliation": "Service Computing Technology and System Lab, Cluster and Grid Computing Lab, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaofei",
"surname": "Liao",
"fullName": "Xiaofei Liao",
"affiliation": "Service Computing Technology and System Lab, Cluster and Grid Computing Lab, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hai",
"surname": "Jin",
"fullName": "Hai Jin",
"affiliation": "Service Computing Technology and System Lab, Cluster and Grid Computing Lab, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lin",
"surname": "Gu",
"fullName": "Lin Gu",
"affiliation": "Service Computing Technology and System Lab, Cluster and Grid Computing Lab, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bing Bing",
"surname": "Zhou",
"fullName": "Bing Bing Zhou",
"affiliation": "School of Information Technologies, The University of Sydney, NSW, Australia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2018-05-01 00:00:00",
"pubType": "trans",
"pages": "895-907",
"year": "2018",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/focs/2013/5135/0/5135a707",
"title": "A Forward-Backward Single-Source Shortest Paths Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/focs/2013/5135a707/12OmNwMXnuk",
"parentPublication": {
"id": "proceedings/focs/2013/5135/0",
"title": "2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2012/4807/0/4807a275",
"title": "Accelerating Expectation-Maximization Algorithms with Frequent Updates",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2012/4807a275/12OmNyRg4zX",
"parentPublication": {
"id": "proceedings/cluster/2012/4807/0",
"title": "2012 IEEE International Conference on Cluster Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2017/05/07731204",
"title": "HotGraph: Efficient Asynchronous Processing for Real-World Graphs",
"doi": null,
"abstractUrl": "/journal/tc/2017/05/07731204/13rRUIIVljz",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2012/03/05887323",
"title": "DCS: Distributed Asynchronous Clock Synchronization in Delay Tolerant Networks",
"doi": null,
"abstractUrl": "/journal/td/2012/03/05887323/13rRUwghd8N",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2014/08/06600686",
"title": "Maiter: An Asynchronous Graph Processing Framework for Delta-Based Accumulative Iterative Computation",
"doi": null,
"abstractUrl": "/journal/td/2014/08/06600686/13rRUwwJWFw",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2022/8106/0/810600a291",
"title": "Asynchronous Distributed-Memory Triangle Counting and LCC with RMA Caching",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2022/810600a291/1F1WbG9gXqU",
"parentPublication": {
"id": "proceedings/ipdps/2022/8106/0",
"title": "2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/12/09887890",
"title": "Accelerating Backward Aggregation in GCN Training With Execution Path Preparing on GPUs",
"doi": null,
"abstractUrl": "/journal/td/2022/12/09887890/1GBRpRHRYkg",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600g396",
"title": "Forward Propagation, Backward Regression, and Pose Association for Hand Tracking in the Wild",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600g396/1H1mHLeoe3e",
"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/hpcc-dss-smartcity-dependsys/2022/1993/0/199300a603",
"title": "Forward and Backward Private Searchable Symmetric Encryption with Efficient Updates",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-dss-smartcity-dependsys/2022/199300a603/1LSPzpQGOli",
"parentPublication": {
"id": "proceedings/hpcc-dss-smartcity-dependsys/2022/1993/0",
"title": "2022 IEEE 24th Int Conf on High Performance Computing & Communications; 8th Int Conf on Data Science & Systems; 20th Int Conf on Smart City; 8th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2022/05/09178464",
"title": "GGraph: An Efficient Structure-Aware Approach for Iterative Graph Processing",
"doi": null,
"abstractUrl": "/journal/bd/2022/05/09178464/1mCjgcR2G4w",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08166795",
"articleId": "13rRUwwslti",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08128496",
"articleId": "13rRUwInv4W",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFsp",
"name": "ttk201805-08170287s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttk201805-08170287s1.zip",
"extension": "zip",
"size": "447 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzVoBCo",
"title": "February",
"year": "2004",
"issueNum": "02",
"idPrefix": "td",
"pubType": "journal",
"volume": "15",
"label": "February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyuvRwY",
"doi": "10.1109/TPDS.2004.1264800",
"abstract": "Abstract—This paper describes the design of a flexible load balancing framework and runtime software system for supporting the development of adaptive applications on distributed-memory parallel computers. The runtime system supports a global namespace, transparent object migration, automatic message forwarding and routing, and automatic load balancing. These features can be used at the discretion of the application developer in order to simplify program development and to eliminate complex bookkeeping associated with mobile data objects. An evaluation of this system in the context of a three-dimensional tetrahedral advancing front parallel mesh generator shows that overall runtime improvements of 15 percent compared to common stop-and-repartition load balancing methods, 30 percent compared to explicit intrusive load balancing methods, and 42 percent compared to no load balancing are possible on large processor configurations. At the same time, the overheads attributable to the runtime system are a fraction of 1 percent of the total runtime. The parallel advancing front method is a coarse-grained and highly adaptive application and therefore exercises all of the features of the runtime system.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—This paper describes the design of a flexible load balancing framework and runtime software system for supporting the development of adaptive applications on distributed-memory parallel computers. The runtime system supports a global namespace, transparent object migration, automatic message forwarding and routing, and automatic load balancing. These features can be used at the discretion of the application developer in order to simplify program development and to eliminate complex bookkeeping associated with mobile data objects. An evaluation of this system in the context of a three-dimensional tetrahedral advancing front parallel mesh generator shows that overall runtime improvements of 15 percent compared to common stop-and-repartition load balancing methods, 30 percent compared to explicit intrusive load balancing methods, and 42 percent compared to no load balancing are possible on large processor configurations. At the same time, the overheads attributable to the runtime system are a fraction of 1 percent of the total runtime. The parallel advancing front method is a coarse-grained and highly adaptive application and therefore exercises all of the features of the runtime system.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—This paper describes the design of a flexible load balancing framework and runtime software system for supporting the development of adaptive applications on distributed-memory parallel computers. The runtime system supports a global namespace, transparent object migration, automatic message forwarding and routing, and automatic load balancing. These features can be used at the discretion of the application developer in order to simplify program development and to eliminate complex bookkeeping associated with mobile data objects. An evaluation of this system in the context of a three-dimensional tetrahedral advancing front parallel mesh generator shows that overall runtime improvements of 15 percent compared to common stop-and-repartition load balancing methods, 30 percent compared to explicit intrusive load balancing methods, and 42 percent compared to no load balancing are possible on large processor configurations. At the same time, the overheads attributable to the runtime system are a fraction of 1 percent of the total runtime. The parallel advancing front method is a coarse-grained and highly adaptive application and therefore exercises all of the features of the runtime system.",
"title": "A Load Balancing Framework for Adaptive and Asynchronous Applications",
"normalizedTitle": "A Load Balancing Framework for Adaptive and Asynchronous Applications",
"fno": "l0183",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Dynamic Load Balancing",
"Adaptive And Irregular Applications",
"Runtime Support Software",
"Multithreading",
"Message Passing",
"Parallel",
"Distributed",
"And Grid Computing",
"Scientific Computing",
"Parallel Mesh Generation"
],
"authors": [
{
"givenName": "Kevin",
"surname": "Barker",
"fullName": "Kevin Barker",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrey",
"surname": "Chernikov",
"fullName": "Andrey Chernikov",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nikos",
"surname": "Chrisochoides",
"fullName": "Nikos Chrisochoides",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Keshav",
"surname": "Pingali",
"fullName": "Keshav Pingali",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2004-02-01 00:00:00",
"pubType": "trans",
"pages": "183-192",
"year": "2004",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "l0167",
"articleId": "13rRUy3gncS",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1HMOit1lSk8",
"title": "Dec.",
"year": "2022",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1vyjtdJRfXO",
"doi": "10.1109/TVCG.2021.3099002",
"abstract": "Visualizations themselves have become a data format. Akin to other data formats such as text and images, visualizations are increasingly created, stored, shared, and (re-)used with artificial intelligence (AI) techniques. In this survey, we probe the underlying vision of formalizing visualizations as an emerging data format and review the recent advance in applying AI techniques to visualization data (AI4VIS). We define visualization data as the digital representations of visualizations in computers and focus on data visualization (e.g., charts and infographics). We build our survey upon a corpus spanning ten different fields in computer science with an eye toward identifying important common interests. Our resulting taxonomy is organized around WHAT is visualization data and its representation, WHY and HOW to apply AI to visualization data. We highlight a set of common tasks that researchers apply to the visualization data and present a detailed discussion of AI approaches developed to accomplish those tasks. Drawing upon our literature review, we discuss several important research questions surrounding the management and exploitation of visualization data, as well as the role of AI in support of those processes. We make the list of surveyed papers and related material available online at.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visualizations themselves have become a data format. Akin to other data formats such as text and images, visualizations are increasingly created, stored, shared, and (re-)used with artificial intelligence (AI) techniques. In this survey, we probe the underlying vision of formalizing visualizations as an emerging data format and review the recent advance in applying AI techniques to visualization data (AI4VIS). We define visualization data as the digital representations of visualizations in computers and focus on data visualization (e.g., charts and infographics). We build our survey upon a corpus spanning ten different fields in computer science with an eye toward identifying important common interests. Our resulting taxonomy is organized around WHAT is visualization data and its representation, WHY and HOW to apply AI to visualization data. We highlight a set of common tasks that researchers apply to the visualization data and present a detailed discussion of AI approaches developed to accomplish those tasks. Drawing upon our literature review, we discuss several important research questions surrounding the management and exploitation of visualization data, as well as the role of AI in support of those processes. We make the list of surveyed papers and related material available online at.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visualizations themselves have become a data format. Akin to other data formats such as text and images, visualizations are increasingly created, stored, shared, and (re-)used with artificial intelligence (AI) techniques. In this survey, we probe the underlying vision of formalizing visualizations as an emerging data format and review the recent advance in applying AI techniques to visualization data (AI4VIS). We define visualization data as the digital representations of visualizations in computers and focus on data visualization (e.g., charts and infographics). We build our survey upon a corpus spanning ten different fields in computer science with an eye toward identifying important common interests. Our resulting taxonomy is organized around WHAT is visualization data and its representation, WHY and HOW to apply AI to visualization data. We highlight a set of common tasks that researchers apply to the visualization data and present a detailed discussion of AI approaches developed to accomplish those tasks. Drawing upon our literature review, we discuss several important research questions surrounding the management and exploitation of visualization data, as well as the role of AI in support of those processes. We make the list of surveyed papers and related material available online at.",
"title": "AI4VIS: Survey on Artificial Intelligence Approaches for Data Visualization",
"normalizedTitle": "AI4VIS: Survey on Artificial Intelligence Approaches for Data Visualization",
"fno": "09495259",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Artificial Intelligence",
"Data Visualisation",
"AI 4 VIS",
"Artificial Intelligence Techniques",
"Data Format",
"Data Visualization",
"Visualization Data",
"Data Visualization",
"Artificial Intelligence",
"Taxonomy",
"Data Mining",
"Machine Learning",
"Vocabulary",
"Survey",
"Data Visualization",
"Artificial Intelligence",
"Data Format",
"Machine Learning"
],
"authors": [
{
"givenName": "Aoyu",
"surname": "Wu",
"fullName": "Aoyu Wu",
"affiliation": "Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yun",
"surname": "Wang",
"fullName": "Yun Wang",
"affiliation": "Microsoft Research Asia, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xinhuan",
"surname": "Shu",
"fullName": "Xinhuan Shu",
"affiliation": "Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dominik",
"surname": "Moritz",
"fullName": "Dominik Moritz",
"affiliation": "Carnegie Mellon University, Pittsburgh, PA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Weiwei",
"surname": "Cui",
"fullName": "Weiwei Cui",
"affiliation": "Microsoft Research Asia, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haidong",
"surname": "Zhang",
"fullName": "Haidong Zhang",
"affiliation": "Microsoft Research Asia, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dongmei",
"surname": "Zhang",
"fullName": "Dongmei Zhang",
"affiliation": "Microsoft Research Asia, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Qu",
"fullName": "Huamin Qu",
"affiliation": "Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "5049-5070",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/tai/1993/4200/0/00633939",
"title": "Principled animation of artificial intelligence algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/tai/1993/00633939/12OmNqJ8twB",
"parentPublication": {
"id": "proceedings/tai/1993/4200/0",
"title": "Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/raise/2018/5723/0/572301a035",
"title": "Ways of Applying Artificial Intelligence in Software Engineering",
"doi": null,
"abstractUrl": "/proceedings-article/raise/2018/572301a035/13l5NX5TCyT",
"parentPublication": {
"id": "proceedings/raise/2018/5723/0",
"title": "2018 IEEE/ACM 6th International Workshop on Realizing Artificial Intelligence Synergies in Software Engineering (RAISE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2013/02/mex2013020096",
"title": "Artificial Intelligence and Big Data",
"doi": null,
"abstractUrl": "/magazine/ex/2013/02/mex2013020096/13rRUyYjK8t",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ica/2018/8180/0/08460059",
"title": "Artificial Intelligence Powered MOOCs: A Brief Survey",
"doi": null,
"abstractUrl": "/proceedings-article/ica/2018/08460059/13xI8A0ZNjl",
"parentPublication": {
"id": "proceedings/ica/2018/8180/0",
"title": "2018 IEEE International Conference on Agents (ICA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10081398",
"title": "How Does Automation Shape the Process of Narrative Visualization: A Survey of Tools",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10081398/1LRbRjcZeLK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cogmi/2022/7406/0/740600a040",
"title": "Human vs. Artificial Intelligence",
"doi": null,
"abstractUrl": "/proceedings-article/cogmi/2022/740600a040/1Lu4hGrrR5u",
"parentPublication": {
"id": "proceedings/cogmi/2022/7406/0",
"title": "2022 IEEE 4th International Conference on Cognitive Machine Intelligence (CogMI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/re/2019/3912/0/391200a109",
"title": "Visualization Requirements for Business Intelligence Analytics: A Goal-Based, Iterative Framework",
"doi": null,
"abstractUrl": "/proceedings-article/re/2019/391200a109/1fHlvWvStdC",
"parentPublication": {
"id": "proceedings/re/2019/3912/0",
"title": "2019 IEEE 27th International Requirements Engineering Conference (RE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi/2004/2100/0/01410775",
"title": "Data Mining: Artificial Intelligence in Data Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/wi/2004/01410775/1htBI5l61Jm",
"parentPublication": {
"id": "proceedings/wi/2004/2100/0",
"title": "Web Intelligence, IEEE / WIC / ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/05/09535176",
"title": "Ten Open Challenges in Medical Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2021/05/09535176/1wMEYhdLLBm",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/06/09646526",
"title": "The Role of Interactive Visualization in Fostering Trust in AI",
"doi": null,
"abstractUrl": "/magazine/cg/2021/06/09646526/1zdLE7WtHwY",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09492011",
"articleId": "1volPuHGMdW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09495125",
"articleId": "1vyju4jl6AE",
"__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": "1cG4GkzNRPG",
"doi": "10.1109/TVCG.2019.2934375",
"abstract": "The topological analysis of unsteady vector fields remains to this day one of the largest challenges in flow visualization. We build up on recent work on vortex extraction to define a time-dependent vector field topology for 2D and 3D flows. In our work, we split the vector field into two components: a vector field in which the flow becomes steady, and the remaining ambient flow that describes the motion of topological elements (such as sinks, sources and saddles) and feature curves (vortex corelines and bifurcation lines). To this end, we expand on recent local optimization approaches by modeling spatially-varying deformations through displacement transformations from continuum mechanics. We compare and discuss the relationships with existing local and integration-based topology extraction methods, showing for instance that separatrices seeded from saddles in the optimal frame align with the integration-based streakline vector field topology. In contrast to the streakline-based approach, our method gives a complete picture of the topology for every time slice, including the steps near the temporal domain boundaries. With our work it now becomes possible to extract topological information even when only few time slices are available. We demonstrate the method in several analytical and numerically-simulated flows and discuss practical aspects, limitations and opportunities for future work.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The topological analysis of unsteady vector fields remains to this day one of the largest challenges in flow visualization. We build up on recent work on vortex extraction to define a time-dependent vector field topology for 2D and 3D flows. In our work, we split the vector field into two components: a vector field in which the flow becomes steady, and the remaining ambient flow that describes the motion of topological elements (such as sinks, sources and saddles) and feature curves (vortex corelines and bifurcation lines). To this end, we expand on recent local optimization approaches by modeling spatially-varying deformations through displacement transformations from continuum mechanics. We compare and discuss the relationships with existing local and integration-based topology extraction methods, showing for instance that separatrices seeded from saddles in the optimal frame align with the integration-based streakline vector field topology. In contrast to the streakline-based approach, our method gives a complete picture of the topology for every time slice, including the steps near the temporal domain boundaries. With our work it now becomes possible to extract topological information even when only few time slices are available. We demonstrate the method in several analytical and numerically-simulated flows and discuss practical aspects, limitations and opportunities for future work.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The topological analysis of unsteady vector fields remains to this day one of the largest challenges in flow visualization. We build up on recent work on vortex extraction to define a time-dependent vector field topology for 2D and 3D flows. In our work, we split the vector field into two components: a vector field in which the flow becomes steady, and the remaining ambient flow that describes the motion of topological elements (such as sinks, sources and saddles) and feature curves (vortex corelines and bifurcation lines). To this end, we expand on recent local optimization approaches by modeling spatially-varying deformations through displacement transformations from continuum mechanics. We compare and discuss the relationships with existing local and integration-based topology extraction methods, showing for instance that separatrices seeded from saddles in the optimal frame align with the integration-based streakline vector field topology. In contrast to the streakline-based approach, our method gives a complete picture of the topology for every time slice, including the steps near the temporal domain boundaries. With our work it now becomes possible to extract topological information even when only few time slices are available. We demonstrate the method in several analytical and numerically-simulated flows and discuss practical aspects, limitations and opportunities for future work.",
"title": "Vector Field Topology of Time-Dependent Flows in a Steady Reference Frame",
"normalizedTitle": "Vector Field Topology of Time-Dependent Flows in a Steady Reference Frame",
"fno": "08805446",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Bifurcation",
"Computational Fluid Dynamics",
"Computational Geometry",
"Data Visualisation",
"Deformation",
"Flow Simulation",
"Flow Visualisation",
"Topology",
"Vectors",
"Vortices",
"Topological Analysis",
"Unsteady Vector Fields",
"Flow Visualization",
"Vortex Extraction",
"Time Dependent Vector Field Topology",
"Topological Elements",
"Vortex Corelines",
"Bifurcation Lines",
"Local Optimization Approaches",
"Local Integration Based Topology Extraction Methods",
"Integration Based Streakline Vector Field Topology",
"Streakline Based Approach",
"Time Slice",
"Topological Information",
"Time Dependent Flows",
"Steady Reference Frame",
"2 D Flows",
"3 D Flows",
"Topology",
"Feature Extraction",
"Optimization",
"Bifurcation",
"Three Dimensional Displays",
"Extraterrestrial Measurements",
"Two Dimensional Displays",
"Scientific Visualization",
"Unsteady Flow",
"Vector Field Topology",
"Reference Frame Optimization"
],
"authors": [
{
"givenName": "Irene Baeza",
"surname": "Rojo",
"fullName": "Irene Baeza Rojo",
"affiliation": "Computer Graphics Laboratory, ETH Zürich",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tobias",
"surname": "Günther",
"fullName": "Tobias Günther",
"affiliation": "Computer Graphics Laboratory, ETH Zürich",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "280-290",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visual/1994/6627/0/00346326",
"title": "The topology of symmetric, second-order tensor fields",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1994/00346326/12OmNvxKu1Q",
"parentPublication": {
"id": "proceedings/visual/1994/6627/0",
"title": "Proceedings Visualization '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2011/935/0/05742374",
"title": "Uncertain topology of 3D vector fields",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742374/12OmNwI8cgb",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2016/1192/0/1192a456",
"title": "Topology Analysis of Vector Fields and Application Prospect",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2016/1192a456/12OmNxGja5R",
"parentPublication": {
"id": "proceedings/dsc/2016/1192/0",
"title": "2016 IEEE First International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2016/5407/0/5407a333",
"title": "Tracking Deformable Surfaces That Undergo Topological Changes Using an RGB-D Camera",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2016/5407a333/12OmNyugyRN",
"parentPublication": {
"id": "proceedings/3dv/2016/5407/0",
"title": "2016 Fourth International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532851",
"title": "Extraction of parallel vector surfaces in 3D time-dependent fields and application to vortex core line tracking",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532851/12OmNzcPAD3",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1997/01/v0001",
"title": "The Topology of Symmetric, Second-Order 3D Tensor Fields",
"doi": null,
"abstractUrl": "/journal/tg/1997/01/v0001/13rRUILc8f6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122763",
"title": "Visualization of Morse Connection Graphs for Topologically Rich 2D Vector Fields",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122763/13rRUxNW1Zp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/03/08454764",
"title": "Hyper-Objective Vortices",
"doi": null,
"abstractUrl": "/journal/tg/2020/03/08454764/13rRUyeTVia",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440096",
"title": "Objective Vortex Corelines of Finite-sized Objects in Fluid Flows",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440096/17D45WXIkH8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09910018",
"title": "Fast Computation of Neck-like Features",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09910018/1HcjhcNOxUI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08805436",
"articleId": "1cG4IGNd2Y8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08820172",
"articleId": "1d6xBCTKIKI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1fe9d0wMYwg",
"name": "ttg202001-08805446s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202001-08805446s1.zip",
"extension": "zip",
"size": "115 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1qV36rtU49i",
"title": "March",
"year": "2021",
"issueNum": "03",
"idPrefix": "tp",
"pubType": "journal",
"volume": "43",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1ddbebZNTC8",
"doi": "10.1109/TPAMI.2019.2940655",
"abstract": "In this paper, we introduce a non-rigid registration pipeline for pairs of unorganized point clouds that may be topologically different. Standard warp field estimation algorithms, even under robust, discontinuity-preserving regularization, tend to produce erratic motion estimates on boundaries associated with `close-to-open' topology changes. We overcome this limitation by exploiting backward motion: in the opposite motion direction, a `close-to-open' event becomes `open-to-close', which is by default handled correctly. At the core of our approach lies a general, topology-agnostic warp field estimation algorithm, similar to those employed in recently introduced dynamic reconstruction systems from RGB-D input. We improve motion estimation on boundaries associated with topology changes in an efficient post-processing phase. Based on both forward and (inverted) backward warp hypotheses, we explicitly detect regions of the deformed geometry that undergo topological changes by means of local deformation criteria and broadly classify them as `contacts' or `separations'. Subsequently, the two motion hypotheses are seamlessly blended on a local basis, according to the type and proximity of detected events. Our method achieves state-of-the-art motion estimation accuracy on the MPI Sintel dataset. Experiments on a custom dataset with topological event annotations demonstrate the effectiveness of our pipeline in estimating motion on event boundaries, as well as promising performance in explicit topological event detection.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we introduce a non-rigid registration pipeline for pairs of unorganized point clouds that may be topologically different. Standard warp field estimation algorithms, even under robust, discontinuity-preserving regularization, tend to produce erratic motion estimates on boundaries associated with `close-to-open' topology changes. We overcome this limitation by exploiting backward motion: in the opposite motion direction, a `close-to-open' event becomes `open-to-close', which is by default handled correctly. At the core of our approach lies a general, topology-agnostic warp field estimation algorithm, similar to those employed in recently introduced dynamic reconstruction systems from RGB-D input. We improve motion estimation on boundaries associated with topology changes in an efficient post-processing phase. Based on both forward and (inverted) backward warp hypotheses, we explicitly detect regions of the deformed geometry that undergo topological changes by means of local deformation criteria and broadly classify them as `contacts' or `separations'. Subsequently, the two motion hypotheses are seamlessly blended on a local basis, according to the type and proximity of detected events. Our method achieves state-of-the-art motion estimation accuracy on the MPI Sintel dataset. Experiments on a custom dataset with topological event annotations demonstrate the effectiveness of our pipeline in estimating motion on event boundaries, as well as promising performance in explicit topological event detection.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we introduce a non-rigid registration pipeline for pairs of unorganized point clouds that may be topologically different. Standard warp field estimation algorithms, even under robust, discontinuity-preserving regularization, tend to produce erratic motion estimates on boundaries associated with `close-to-open' topology changes. We overcome this limitation by exploiting backward motion: in the opposite motion direction, a `close-to-open' event becomes `open-to-close', which is by default handled correctly. At the core of our approach lies a general, topology-agnostic warp field estimation algorithm, similar to those employed in recently introduced dynamic reconstruction systems from RGB-D input. We improve motion estimation on boundaries associated with topology changes in an efficient post-processing phase. Based on both forward and (inverted) backward warp hypotheses, we explicitly detect regions of the deformed geometry that undergo topological changes by means of local deformation criteria and broadly classify them as `contacts' or `separations'. Subsequently, the two motion hypotheses are seamlessly blended on a local basis, according to the type and proximity of detected events. Our method achieves state-of-the-art motion estimation accuracy on the MPI Sintel dataset. Experiments on a custom dataset with topological event annotations demonstrate the effectiveness of our pipeline in estimating motion on event boundaries, as well as promising performance in explicit topological event detection.",
"title": "Topology-Aware Non-Rigid Point Cloud Registration",
"normalizedTitle": "Topology-Aware Non-Rigid Point Cloud Registration",
"fno": "08827963",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Deformation",
"Geometry",
"Image Colour Analysis",
"Image Registration",
"Image Sequences",
"Motion Estimation",
"Topological Changes",
"Local Deformation Criteria",
"Motion Hypotheses",
"Detected Events",
"State Of The Art Motion Estimation Accuracy",
"Topological Event Annotations",
"Event Boundaries",
"Explicit Topological Event Detection",
"Topology Aware Nonrigid Point Cloud Registration",
"Nonrigid Registration Pipeline",
"Unorganized Point Clouds",
"Standard Warp Field Estimation Algorithms",
"Robust Discontinuity Preserving Regularization",
"Erratic Motion Estimates",
"Close To Open Topology Changes",
"Backward Motion",
"Opposite Motion Direction",
"Close To Open Event Becomes",
"General Topology Agnostic",
"Recently Introduced Dynamic Reconstruction Systems",
"Efficient Post Processing Phase",
"Three Dimensional Displays",
"Topology",
"Dynamics",
"Motion Estimation",
"Geometry",
"Estimation",
"Image Reconstruction",
"Non Rigid Registration",
"Warp Field",
"Dense Motion Estimation",
"Surface Deformation",
"Dynamic Topology"
],
"authors": [
{
"givenName": "Konstantinos",
"surname": "Zampogiannis",
"fullName": "Konstantinos Zampogiannis",
"affiliation": "Department of Computer Science, University of Maryland, College Park, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cornelia",
"surname": "Fermüller",
"fullName": "Cornelia Fermüller",
"affiliation": "University of Maryland Institute for Advanced Computer Studies (UMIACS), University of Maryland, College Park, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yiannis",
"surname": "Aloimonos",
"fullName": "Yiannis Aloimonos",
"affiliation": "Department of Computer Science, University of Maryland, College Park, MD, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2021-03-01 00:00:00",
"pubType": "trans",
"pages": "1056-1069",
"year": "2021",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2008/2174/0/04761565",
"title": "Non-rigid image registration based on the globally optimized correspondences",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761565/12OmNAsBFLz",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2015/6683/0/6683a094",
"title": "Non-rigid Articulated Point Set Registration for Human Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2015/6683a094/12OmNC2OSPb",
"parentPublication": {
"id": "proceedings/wacv/2015/6683/0",
"title": "2015 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1991/2148/0/00139710",
"title": "Recovery of non-rigid motion and structure",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1991/00139710/12OmNvHY2Gx",
"parentPublication": {
"id": "proceedings/cvpr/1991/2148/0",
"title": "Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1992/2855/0/00223271",
"title": "Point correspondence recovery in non-rigid motion",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1992/00223271/12OmNvT2oO0",
"parentPublication": {
"id": "proceedings/cvpr/1992/2855/0",
"title": "Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2014/4308/0/4308a245",
"title": "Non-rigid Point Set Registration with Global-Local Topology Preservation",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2014/4308a245/12OmNwdbV9H",
"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/3dv/2014/7000/1/7000a617",
"title": "Non-rigid Registration Meets Surface Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2014/7000a617/12OmNx7G5Xq",
"parentPublication": {
"id": "proceedings/3dv/2014/7000/2",
"title": "2014 2nd International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200m2686",
"title": "4DComplete: Non-Rigid Motion Estimation Beyond the Observable Surface",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200m2686/1BmLpZ0QahW",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssiai/2010/7801/0/05483923",
"title": "A novel non-rigid registration method",
"doi": null,
"abstractUrl": "/proceedings-article/ssiai/2010/05483923/1h0FGpUPGmY",
"parentPublication": {
"id": "proceedings/ssiai/2010/7801/0",
"title": "2010 IEEE Southwest Symposium on Image Analysis & Interpretation (SSIAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2020/6553/0/09093583",
"title": "NRMVS: Non-Rigid Multi-View Stereo",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2020/09093583/1jPbfZI3SVi",
"parentPublication": {
"id": "proceedings/wacv/2020/6553/0",
"title": "2020 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2021/2688/0/268800a825",
"title": "Unsupervised Monocular Depth Reconstruction of Non-Rigid Scenes",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2021/268800a825/1zWEmrlTmsE",
"parentPublication": {
"id": "proceedings/3dv/2021/2688/0",
"title": "2021 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08839600",
"articleId": "1dqsoq3hzt6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08851288",
"articleId": "1dFoya9cl9e",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRo",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1JlF32mS2SQ",
"doi": "10.1109/TVCG.2022.3231680",
"abstract": "Point clouds obtained from 3D scanners are often noisy and cannot be directly used for subsequent high-level tasks. In this paper, we propose a novel point cloud optimization method capable of denoising and homogenizing point clouds. Our idea is based on the assumption that the noise is generally much smaller than the effective signal. We perform noise perturbation on the noisy point cloud to get a new noisy point cloud, called self-variation point cloud. The noisy point cloud and self-variation point cloud have different noise distribution, but the same point cloud distribution. We compute the potential commonality between two noisy point clouds to obtain a clean point cloud. To implement our idea, we propose a <italic>Self-Variation Capture Network</italic> (SVCNet). We perturb the point cloud features in the latent space to obtain self-variation feature vectors, and capture the commonality between two noisy feature vectors through the feature aggregation and averaging. In addition, an edge constraint module is introduced to suppress low-pass effects during denoising. Our denoising method does not take into account the noise characteristics, and can filter the drift noise located on the underlying surface, resulting in a uniform distribution of the generated point cloud. The experimental results show that our algorithm outperforms the current state-of-the-art algorithms, especially in generating more uniform point clouds. In addition, extended experiments demonstrate the potential of our algorithm for point clouds upsampling.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Point clouds obtained from 3D scanners are often noisy and cannot be directly used for subsequent high-level tasks. In this paper, we propose a novel point cloud optimization method capable of denoising and homogenizing point clouds. Our idea is based on the assumption that the noise is generally much smaller than the effective signal. We perform noise perturbation on the noisy point cloud to get a new noisy point cloud, called self-variation point cloud. The noisy point cloud and self-variation point cloud have different noise distribution, but the same point cloud distribution. We compute the potential commonality between two noisy point clouds to obtain a clean point cloud. To implement our idea, we propose a <italic>Self-Variation Capture Network</italic> (SVCNet). We perturb the point cloud features in the latent space to obtain self-variation feature vectors, and capture the commonality between two noisy feature vectors through the feature aggregation and averaging. In addition, an edge constraint module is introduced to suppress low-pass effects during denoising. Our denoising method does not take into account the noise characteristics, and can filter the drift noise located on the underlying surface, resulting in a uniform distribution of the generated point cloud. The experimental results show that our algorithm outperforms the current state-of-the-art algorithms, especially in generating more uniform point clouds. In addition, extended experiments demonstrate the potential of our algorithm for point clouds upsampling.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Point clouds obtained from 3D scanners are often noisy and cannot be directly used for subsequent high-level tasks. In this paper, we propose a novel point cloud optimization method capable of denoising and homogenizing point clouds. Our idea is based on the assumption that the noise is generally much smaller than the effective signal. We perform noise perturbation on the noisy point cloud to get a new noisy point cloud, called self-variation point cloud. The noisy point cloud and self-variation point cloud have different noise distribution, but the same point cloud distribution. We compute the potential commonality between two noisy point clouds to obtain a clean point cloud. To implement our idea, we propose a Self-Variation Capture Network (SVCNet). We perturb the point cloud features in the latent space to obtain self-variation feature vectors, and capture the commonality between two noisy feature vectors through the feature aggregation and averaging. In addition, an edge constraint module is introduced to suppress low-pass effects during denoising. Our denoising method does not take into account the noise characteristics, and can filter the drift noise located on the underlying surface, resulting in a uniform distribution of the generated point cloud. The experimental results show that our algorithm outperforms the current state-of-the-art algorithms, especially in generating more uniform point clouds. In addition, extended experiments demonstrate the potential of our algorithm for point clouds upsampling.",
"title": "From Noise Addition to Denoising: A Self-Variation Capture Network for Point Cloud Optimization",
"normalizedTitle": "From Noise Addition to Denoising: A Self-Variation Capture Network for Point Cloud Optimization",
"fno": "09998112",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Point Cloud Compression",
"Noise Reduction",
"Noise Measurement",
"Manifolds",
"Optimization",
"Three Dimensional Displays",
"Surface Cleaning",
"Point Clouds Denoising",
"Self Variation",
"Noise Perturbation",
"Commonality Capture"
],
"authors": [
{
"givenName": "Tianming",
"surname": "Zhao",
"fullName": "Tianming Zhao",
"affiliation": "School of Artificial the Intelligence and Automation, Huazhong University of Science and Technology, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peng",
"surname": "Gao",
"fullName": "Peng Gao",
"affiliation": "School of Artificial the Intelligence and Automation, Huazhong University of Science and Technology, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tian",
"surname": "Tian",
"fullName": "Tian Tian",
"affiliation": "School of Artificial the Intelligence and Automation, Huazhong University of Science and Technology, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiayi",
"surname": "Ma",
"fullName": "Jiayi Ma",
"affiliation": "Electronic Information School, Wuhan University, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jinwen",
"surname": "Tian",
"fullName": "Jinwen Tian",
"affiliation": "School of Artificial the Intelligence and Automation, Huazhong University of Science and Technology, Wuhan, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "1-14",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icmew/2017/0560/0/08026263",
"title": "Subjective and objective quality evaluation of 3D point cloud denoising algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2017/08026263/12OmNBvkdns",
"parentPublication": {
"id": "proceedings/icmew/2017/0560/0",
"title": "2017 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2013/4893/0/06455215",
"title": "Two-stage Point-sampled Model Denoising by Robust Ellipsoid Criterion and Mean Shift",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2013/06455215/12OmNrkjVhD",
"parentPublication": {
"id": "proceedings/isdea/2013/4893/0",
"title": "2013 Third International Conference on Intelligent System Design and Engineering Applications (ISDEA 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigmm/2018/5321/0/08499090",
"title": "Graph-Based Point Cloud Denoising",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2018/08499090/17D45VTRoAv",
"parentPublication": {
"id": "proceedings/bigmm/2018/5321/0",
"title": "2018 IEEE Fourth International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2018/8425/0/842500a444",
"title": "Structured Low-Rank Matrix Factorization for Point-Cloud Denoising",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2018/842500a444/17D45XacGiJ",
"parentPublication": {
"id": "proceedings/3dv/2018/8425/0",
"title": "2018 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200e563",
"title": "Score-Based Point Cloud Denoising",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200e563/1BmFFYz8vXa",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/03/09775211",
"title": "Deep Point Set Resampling via Gradient Fields",
"doi": null,
"abstractUrl": "/journal/tp/2023/03/09775211/1Dqh2PmIooM",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/11/08730533",
"title": "Multi-Patch Collaborative Point Cloud Denoising via Low-Rank Recovery with Graph Constraint",
"doi": null,
"abstractUrl": "/journal/tg/2020/11/08730533/1aAxaVT7HtS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/08933110",
"title": "Anisotropic Denoising of 3D Point Clouds by Aggregation of Multiple Surface-Adaptive Estimates",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/08933110/1gKvciBzOfu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300a052",
"title": "Total Denoising: Unsupervised Learning of 3D Point Cloud Cleaning",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300a052/1hVlvo8kleE",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccst/2020/8138/0/813800a123",
"title": "Point Cloud Denoising Algorithm Based on Noise Classification",
"doi": null,
"abstractUrl": "/proceedings-article/iccst/2020/813800a123/1p1gtJQEUPC",
"parentPublication": {
"id": "proceedings/iccst/2020/8138/0",
"title": "2020 International Conference on Culture-oriented Science & Technology (ICCST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09993762",
"articleId": "1Jgw2iruIyk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09998319",
"articleId": "1JlF3cSB3wY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1JqCYjFT3Lq",
"name": "ttg555501-09998112s1-supp1-3231680.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09998112s1-supp1-3231680.pdf",
"extension": "pdf",
"size": "2.09 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBqdrij",
"title": "July",
"year": "2019",
"issueNum": "07",
"idPrefix": "tk",
"pubType": "journal",
"volume": "31",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILtJrv",
"doi": "10.1109/TKDE.2016.2611509",
"abstract": "The problem of crowdsourced entity collection solicits people (a.k.a. workers) to complete missing data in a database and has witnessed many applications in knowledge base completion and enterprise data collection. Although previous studies have attempted to address the “open world” challenge of crowdsourced entity collection, they do not pay much attention to the “distribution” of the collected entities. Evidently, in many real applications, users may have distribution requirements on the collected entities, e.g., even spatial distribution when collecting points-of-interest. In this paper, we study a new research problem, distribution-aware crowdsourced entity collection (CrowdDEC): Given an expected distribution w.r.t. an attribute (e.g., region or year), it aims to collect a set of entities via crowdsourcing and minimize the difference of the entity distribution from the expected distribution. Due to the openness of crowdsourcing, the CrowdDEC problem calls for effective crowdsourcing quality control. We propose an adaptive worker selection approach to address this problem. The approach estimates underlying entity distribution of workers on-the-fly based on the collected entities. Then, it adaptively selects the best set of workers that minimizes the difference from the expected distribution. Once workers submit their answers, it adjusts the estimation of workers' underlying distributions for subsequent adaptive worker selections. We prove the hardness of the problem, and develop effective estimation techniques as well as efficient worker selection algorithms to support this approach. We deployed the proposed approach on Amazon Mechanical Turk and the experimental results on two real datasets show that the approach achieves superiority on both effectiveness and efficiency.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The problem of crowdsourced entity collection solicits people (a.k.a. workers) to complete missing data in a database and has witnessed many applications in knowledge base completion and enterprise data collection. Although previous studies have attempted to address the “open world” challenge of crowdsourced entity collection, they do not pay much attention to the “distribution” of the collected entities. Evidently, in many real applications, users may have distribution requirements on the collected entities, e.g., even spatial distribution when collecting points-of-interest. In this paper, we study a new research problem, distribution-aware crowdsourced entity collection (CrowdDEC): Given an expected distribution w.r.t. an attribute (e.g., region or year), it aims to collect a set of entities via crowdsourcing and minimize the difference of the entity distribution from the expected distribution. Due to the openness of crowdsourcing, the CrowdDEC problem calls for effective crowdsourcing quality control. We propose an adaptive worker selection approach to address this problem. The approach estimates underlying entity distribution of workers on-the-fly based on the collected entities. Then, it adaptively selects the best set of workers that minimizes the difference from the expected distribution. Once workers submit their answers, it adjusts the estimation of workers' underlying distributions for subsequent adaptive worker selections. We prove the hardness of the problem, and develop effective estimation techniques as well as efficient worker selection algorithms to support this approach. We deployed the proposed approach on Amazon Mechanical Turk and the experimental results on two real datasets show that the approach achieves superiority on both effectiveness and efficiency.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The problem of crowdsourced entity collection solicits people (a.k.a. workers) to complete missing data in a database and has witnessed many applications in knowledge base completion and enterprise data collection. Although previous studies have attempted to address the “open world” challenge of crowdsourced entity collection, they do not pay much attention to the “distribution” of the collected entities. Evidently, in many real applications, users may have distribution requirements on the collected entities, e.g., even spatial distribution when collecting points-of-interest. In this paper, we study a new research problem, distribution-aware crowdsourced entity collection (CrowdDEC): Given an expected distribution w.r.t. an attribute (e.g., region or year), it aims to collect a set of entities via crowdsourcing and minimize the difference of the entity distribution from the expected distribution. Due to the openness of crowdsourcing, the CrowdDEC problem calls for effective crowdsourcing quality control. We propose an adaptive worker selection approach to address this problem. The approach estimates underlying entity distribution of workers on-the-fly based on the collected entities. Then, it adaptively selects the best set of workers that minimizes the difference from the expected distribution. Once workers submit their answers, it adjusts the estimation of workers' underlying distributions for subsequent adaptive worker selections. We prove the hardness of the problem, and develop effective estimation techniques as well as efficient worker selection algorithms to support this approach. We deployed the proposed approach on Amazon Mechanical Turk and the experimental results on two real datasets show that the approach achieves superiority on both effectiveness and efficiency.",
"title": "Distribution-Aware Crowdsourced Entity Collection",
"normalizedTitle": "Distribution-Aware Crowdsourced Entity Collection",
"fno": "07572151",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Crowdsourcing",
"Data Handling",
"Knowledge Based Systems",
"Personnel",
"Quality Control",
"Adaptive Worker Selection Approach",
"Distribution Aware Crowdsourced Entity Collection",
"Knowledge Base Completion",
"Enterprise Data Collection",
"Distribution Requirements",
"Spatial Distribution",
"Crowdsourcing Quality Control",
"Entity Distribution",
"Amazon Mechanical Turk",
"Crowdsourcing",
"Data Collection",
"Databases",
"Estimation",
"Search Problems",
"Fans",
"Knowledge Based Systems",
"Crowdsourcing",
"Entity Collection",
"Sampling",
"Distribution Aware"
],
"authors": [
{
"givenName": "Ju",
"surname": "Fan",
"fullName": "Ju Fan",
"affiliation": "Renmin University of China, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhewei",
"surname": "Wei",
"fullName": "Zhewei Wei",
"affiliation": "Beijing Key Laboratory of Big Data Management and Analysis Methods, Renmin University of China, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dongxiang",
"surname": "Zhang",
"fullName": "Dongxiang Zhang",
"affiliation": "University of Electronic Science and Technology of China, Sichuan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jingru",
"surname": "Yang",
"fullName": "Jingru Yang",
"affiliation": "Renmin University of China, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaoyong",
"surname": "Du",
"fullName": "Xiaoyong Du",
"affiliation": "Renmin University of China, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2019-07-01 00:00:00",
"pubType": "trans",
"pages": "1312-1326",
"year": "2019",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2017/6543/0/6543a039",
"title": "Crowdsourced Data Management: A Survey",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2017/6543a039/12OmNAq3hM0",
"parentPublication": {
"id": "proceedings/icde/2017/6543/0",
"title": "2017 IEEE 33rd International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issre/2017/0941/0/0941a316",
"title": "COCOON: Crowdsourced Testing Quality Maximization Under Context Coverage Constraint",
"doi": null,
"abstractUrl": "/proceedings-article/issre/2017/0941a316/12OmNvA1hfd",
"parentPublication": {
"id": "proceedings/issre/2017/0941/0",
"title": "2017 IEEE 28th International Symposium on Software Reliability Engineering (ISSRE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsec/2017/3681/0/3681a495",
"title": "Failure Prediction in Crowdsourced Software Development",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2017/3681a495/12OmNx19jYi",
"parentPublication": {
"id": "proceedings/apsec/2017/3681/0",
"title": "2017 24th Asia-Pacific Software Engineering Conference (APSEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2016/09/07420720",
"title": "Crowdsourced Data Management: A Survey",
"doi": null,
"abstractUrl": "/journal/tk/2016/09/07420720/13rRUxjQyhO",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2021/04/08410038",
"title": "Fair Task Allocation in Crowdsourced Delivery",
"doi": null,
"abstractUrl": "/journal/sc/2021/04/08410038/13rRUy3gnaJ",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2018/5520/0/552000a341",
"title": "Incentive-Based Entity Collection Using Crowdsourcing",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2018/552000a341/14Fq0XuePFW",
"parentPublication": {
"id": "proceedings/icde/2018/5520/0",
"title": "2018 IEEE 34th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2019/2508/0/250800b277",
"title": "Crowdsourced Report Generation via Bug Screenshot Understanding",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2019/250800b277/1gysZPvM76w",
"parentPublication": {
"id": "proceedings/ase/2019/2508/0",
"title": "2019 34th IEEE/ACM International Conference on Automated Software Engineering (ASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/11/08989823",
"title": "CrowdChart: Crowdsourced Data Extraction From Visualization Charts",
"doi": null,
"abstractUrl": "/journal/tk/2021/11/08989823/1hlpoAzss9i",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/su/2022/03/08939442",
"title": "Inference of Distribution Grids Based on Crowdsourced Grid Data and Drone Imagery",
"doi": null,
"abstractUrl": "/journal/su/2022/03/08939442/1j4FF2l3qww",
"parentPublication": {
"id": "trans/su",
"title": "IEEE Transactions on Sustainable Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101689",
"title": "Crowdsourced Collective Entity Resolution with Relational Match Propagation",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101689/1kaMLAylAUE",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08334417",
"articleId": "13rRUNvgyWY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08410031",
"articleId": "13rRUwjGoGw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyoiZ14",
"title": "April",
"year": "2016",
"issueNum": "04",
"idPrefix": "tk",
"pubType": "journal",
"volume": "28",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuvJ",
"doi": "10.1109/TKDE.2016.2518669",
"abstract": "Crowdsourcing refers to solving large problems by involving human workers that solve component sub-problems or tasks. In data crowdsourcing, the problem involves data acquisition, management, and analysis. In this paper, we provide an overview of data crowdsourcing, giving examples of problems that the authors have tackled, and presenting the key design steps involved in implementing a crowdsourced solution. We also discuss some of the open challenges that remain to be solved.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Crowdsourcing refers to solving large problems by involving human workers that solve component sub-problems or tasks. In data crowdsourcing, the problem involves data acquisition, management, and analysis. In this paper, we provide an overview of data crowdsourcing, giving examples of problems that the authors have tackled, and presenting the key design steps involved in implementing a crowdsourced solution. We also discuss some of the open challenges that remain to be solved.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Crowdsourcing refers to solving large problems by involving human workers that solve component sub-problems or tasks. In data crowdsourcing, the problem involves data acquisition, management, and analysis. In this paper, we provide an overview of data crowdsourcing, giving examples of problems that the authors have tackled, and presenting the key design steps involved in implementing a crowdsourced solution. We also discuss some of the open challenges that remain to be solved.",
"title": "Challenges in Data Crowdsourcing",
"normalizedTitle": "Challenges in Data Crowdsourcing",
"fno": "07384520",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Crowdsourcing",
"Computers",
"Clothing",
"Training",
"Tagging",
"Electronic Mail",
"Companies",
"Worker Management",
"Data Crowdsourcing",
"Data Augmenting",
"Data Curation",
"Data Processing",
"Crowdsourcing Space",
"Crowdsourcing Design",
"Crowdsourcing Workflow",
"Worker Management",
"Data Crowdsourcing",
"Data Augmenting",
"Data Curation",
"Data Processing",
"Crowdsourcing Space",
"Crowdsourcing Design",
"Crowdsourcing Workflow"
],
"authors": [
{
"givenName": "Hector",
"surname": "Garcia-Molina",
"fullName": "Hector Garcia-Molina",
"affiliation": "Department of Computer Science, Stanford University, Stanford, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Manas",
"surname": "Joglekar",
"fullName": "Manas Joglekar",
"affiliation": "Department of Computer Science, Stanford University, Stanford, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Adam",
"surname": "Marcus",
"fullName": "Adam Marcus",
"affiliation": "Unlimited Labs, San Francisco, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Aditya",
"surname": "Parameswaran",
"fullName": "Aditya Parameswaran",
"affiliation": "Department of Computer Science, University of Illinois (UIUC), Champaign, IL",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vasilis",
"surname": "Verroios",
"fullName": "Vasilis Verroios",
"affiliation": "Department of Computer Science, Stanford University, Stanford, CA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2016-04-01 00:00:00",
"pubType": "trans",
"pages": "901-911",
"year": "2016",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icse-seip/2017/2717/0/2717a103",
"title": "Leveraging crowdsourcing for team elasticity: an empirical evaluation at TopCoder",
"doi": null,
"abstractUrl": "/proceedings-article/icse-seip/2017/2717a103/12OmNx2QUIm",
"parentPublication": {
"id": "proceedings/icse-seip/2017/2717/0",
"title": "2017 IEEE/ACM 39th International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2015/04/mex2015040081",
"title": "Human Beyond the Machine: Challenges and Opportunities of Microtask Crowdsourcing",
"doi": null,
"abstractUrl": "/magazine/ex/2015/04/mex2015040081/13rRUNvyapq",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ic/2012/05/mic2012050020",
"title": "Obtaining High-Quality Relevance Judgments Using Crowdsourcing",
"doi": null,
"abstractUrl": "/magazine/ic/2012/05/mic2012050020/13rRUy2YLML",
"parentPublication": {
"id": "mags/ic",
"title": "IEEE Internet Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ic/2013/04/mic2013040032",
"title": "Examining the Limits of Crowdsourcing for Relevance Assessment",
"doi": null,
"abstractUrl": "/magazine/ic/2013/04/mic2013040032/13rRUy3gmWR",
"parentPublication": {
"id": "mags/ic",
"title": "IEEE Internet Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2017/2715/0/08258467",
"title": "Improving classification accuracy in crowdsourcing through hierarchical reorganization",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08258467/17D45X2fUEh",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2019/7474/0/747400c052",
"title": "Crowdsourcing Database Systems: Overview and Challenges",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2019/747400c052/1aDSTgm14wo",
"parentPublication": {
"id": "proceedings/icde/2019/7474/0",
"title": "2019 IEEE 35th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse-euc/2019/1664/0/166400a489",
"title": "A Stable Task Assignment Scheme in Crowdsourcing",
"doi": null,
"abstractUrl": "/proceedings-article/cse-euc/2019/166400a489/1fHkzHWuJC8",
"parentPublication": {
"id": "proceedings/cse-euc/2019/1664/0",
"title": "2019 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cyberc/2020/8448/0/844800a023",
"title": "Towards Decentralized Trust Management Using Blockchain in Crowdsourcing Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cyberc/2020/844800a023/1qJuftKLLUI",
"parentPublication": {
"id": "proceedings/cyberc/2020/8448/0",
"title": "2020 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nana/2020/8954/0/895400a335",
"title": "Crowdsourcing Answer Integration Algorithm For Big Data Environment",
"doi": null,
"abstractUrl": "/proceedings-article/nana/2020/895400a335/1rlFdJz6XVC",
"parentPublication": {
"id": "proceedings/nana/2020/8954/0",
"title": "2020 International Conference on Networking and Network Applications (NaNA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2022/05/09416787",
"title": "Incentive Mechanism Design for Truth Discovery in Crowdsourcing With Copiers",
"doi": null,
"abstractUrl": "/journal/sc/2022/05/09416787/1t8VMSKaC8E",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07335650",
"articleId": "13rRUwbaqVk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07335622",
"articleId": "13rRUxBa5nK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwCJOG2",
"title": "July-Aug.",
"year": "2013",
"issueNum": "04",
"idPrefix": "ic",
"pubType": "magazine",
"volume": "17",
"label": "July-Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy3gmWR",
"doi": "10.1109/MIC.2012.95",
"abstract": "Evaluation is instrumental to developing and managing effective information retrieval systems. For this process, enlisting crowdsourcing has proven viable. However, less understood are crowdsourcing's limits for evaluation, particularly for domain-specific search. The authors compare relevance assessments gathered using crowdsourcing with those from a domain expert to evaluate different search engines in a large government archive. Although crowdsourced judgments rank the tested search engines in the same order as expert judgments, crowdsourced workers appear unable to distinguish different levels of highly accurate search results the way expert assessors can.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Evaluation is instrumental to developing and managing effective information retrieval systems. For this process, enlisting crowdsourcing has proven viable. However, less understood are crowdsourcing's limits for evaluation, particularly for domain-specific search. The authors compare relevance assessments gathered using crowdsourcing with those from a domain expert to evaluate different search engines in a large government archive. Although crowdsourced judgments rank the tested search engines in the same order as expert judgments, crowdsourced workers appear unable to distinguish different levels of highly accurate search results the way expert assessors can.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Evaluation is instrumental to developing and managing effective information retrieval systems. For this process, enlisting crowdsourcing has proven viable. However, less understood are crowdsourcing's limits for evaluation, particularly for domain-specific search. The authors compare relevance assessments gathered using crowdsourcing with those from a domain expert to evaluate different search engines in a large government archive. Although crowdsourced judgments rank the tested search engines in the same order as expert judgments, crowdsourced workers appear unable to distinguish different levels of highly accurate search results the way expert assessors can.",
"title": "Examining the Limits of Crowdsourcing for Relevance Assessment",
"normalizedTitle": "Examining the Limits of Crowdsourcing for Relevance Assessment",
"fno": "mic2013040032",
"hasPdf": true,
"idPrefix": "ic",
"keywords": [
"Performance Evaluation",
"Navigation",
"Search Engines",
"System Analysis And Design",
"Internet",
"Crowdsourcing",
"Search Methods",
"Information Retrieval",
"Crowdsourcing",
"Information Search And Retrieval",
"Performance Of Systems"
],
"authors": [
{
"givenName": "Paul",
"surname": "Clough",
"fullName": "Paul Clough",
"affiliation": "University of Sheffield",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mark",
"surname": "Sanderson",
"fullName": "Mark Sanderson",
"affiliation": "RMIT University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiayu",
"surname": "Tang",
"fullName": "Jiayu Tang",
"affiliation": "Alibaba.com",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tim",
"surname": "Gollins",
"fullName": "Tim Gollins",
"affiliation": "The National Archives, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Amy",
"surname": "Warner",
"fullName": "Amy Warner",
"affiliation": "Royal Holloway, University of London",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2013-07-01 00:00:00",
"pubType": "mags",
"pages": "32-38",
"year": "2013",
"issn": "1089-7801",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2015/7964/0/07113418",
"title": "Data-driven crowdsourcing: Management, mining, and applications",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2015/07113418/12OmNAkWvkP",
"parentPublication": {
"id": "proceedings/icde/2015/7964/0",
"title": "2015 IEEE 31st International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2016/2846/0/07752235",
"title": "Detecting malicious campaigns in crowdsourcing platforms",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2016/07752235/12OmNqJZgzs",
"parentPublication": {
"id": "proceedings/asonam/2016/2846/0",
"title": "2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2015/04/mex2015040081",
"title": "Human Beyond the Machine: Challenges and Opportunities of Microtask Crowdsourcing",
"doi": null,
"abstractUrl": "/magazine/ex/2015/04/mex2015040081/13rRUNvyapq",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2016/04/07384520",
"title": "Challenges in Data Crowdsourcing",
"doi": null,
"abstractUrl": "/journal/tk/2016/04/07384520/13rRUxASuvJ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ic/2012/05/mic2012050020",
"title": "Obtaining High-Quality Relevance Judgments Using Crowdsourcing",
"doi": null,
"abstractUrl": "/magazine/ic/2012/05/mic2012050020/13rRUy2YLML",
"parentPublication": {
"id": "mags/ic",
"title": "IEEE Internet Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2021/2398/0/239800b373",
"title": "Detecting adversaries in Crowdsourcing",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2021/239800b373/1Aqxg3GT2sE",
"parentPublication": {
"id": "proceedings/icdm/2021/2398/0",
"title": "2021 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2019/7474/0/747400c052",
"title": "Crowdsourcing Database Systems: Overview and Challenges",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2019/747400c052/1aDSTgm14wo",
"parentPublication": {
"id": "proceedings/icde/2019/7474/0",
"title": "2019 IEEE 35th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/11/09003210",
"title": "Towards De-Anonymization of Google Play Search Rank Fraud",
"doi": null,
"abstractUrl": "/journal/tk/2021/11/09003210/1hy7UNhfA64",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cyberc/2020/8448/0/844800a023",
"title": "Towards Decentralized Trust Management Using Blockchain in Crowdsourcing Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cyberc/2020/844800a023/1qJuftKLLUI",
"parentPublication": {
"id": "proceedings/cyberc/2020/8448/0",
"title": "2020 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nana/2020/8954/0/895400a335",
"title": "Crowdsourcing Answer Integration Algorithm For Big Data Environment",
"doi": null,
"abstractUrl": "/proceedings-article/nana/2020/895400a335/1rlFdJz6XVC",
"parentPublication": {
"id": "proceedings/nana/2020/8954/0",
"title": "2020 International Conference on Networking and Network Applications (NaNA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mic2013040026",
"articleId": "13rRUxYIN8R",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mic2013040040",
"articleId": "13rRUIJcWt1",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwdL7lQ",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tm",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1MDGk5EVH0Y",
"doi": "10.1109/TMC.2023.3269807",
"abstract": "Over the last decade, the mobile crowdsourcing has become a paradigm to conduct the manual annotation and further analytics by recruited workers, with their rewards depending on the result quality. Existing dispatchers cannot precisely capture the resource-quality trade-off for video analytics, because the configurations supported by recruited workers are limited, and workers' availability changes over time. To determine the most suitable configurations as well as workers for video analytics, we formulate a non-linear mixed program in long term, maximizing the crowdsourcing profit. Based on previous results under various configurations and workers, we design an algorithm via a series of subproblems to decide the configurations adaptively upon the prediction of workers' feedbacks. Such prediction is based on volatile multi-armed bandit to capture workers' availability and stochastic changes on resource uses. Furthermore, we extend the proposed algorithms to the multi-worker selection scenario where the platform needs to determine a candidate worker set instead of a single worker for video analytics. Via rigorous proof, the regret is ensured upon the Lyapunov optimization and the bandit, measuring the gap between the online decisions and the offline optimum. Extensive trace-driven experiments show that our proposed algorithm improves the profit by 37% compared with other algorithms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Over the last decade, the mobile crowdsourcing has become a paradigm to conduct the manual annotation and further analytics by recruited workers, with their rewards depending on the result quality. Existing dispatchers cannot precisely capture the resource-quality trade-off for video analytics, because the configurations supported by recruited workers are limited, and workers' availability changes over time. To determine the most suitable configurations as well as workers for video analytics, we formulate a non-linear mixed program in long term, maximizing the crowdsourcing profit. Based on previous results under various configurations and workers, we design an algorithm via a series of subproblems to decide the configurations adaptively upon the prediction of workers' feedbacks. Such prediction is based on volatile multi-armed bandit to capture workers' availability and stochastic changes on resource uses. Furthermore, we extend the proposed algorithms to the multi-worker selection scenario where the platform needs to determine a candidate worker set instead of a single worker for video analytics. Via rigorous proof, the regret is ensured upon the Lyapunov optimization and the bandit, measuring the gap between the online decisions and the offline optimum. Extensive trace-driven experiments show that our proposed algorithm improves the profit by 37% compared with other algorithms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Over the last decade, the mobile crowdsourcing has become a paradigm to conduct the manual annotation and further analytics by recruited workers, with their rewards depending on the result quality. Existing dispatchers cannot precisely capture the resource-quality trade-off for video analytics, because the configurations supported by recruited workers are limited, and workers' availability changes over time. To determine the most suitable configurations as well as workers for video analytics, we formulate a non-linear mixed program in long term, maximizing the crowdsourcing profit. Based on previous results under various configurations and workers, we design an algorithm via a series of subproblems to decide the configurations adaptively upon the prediction of workers' feedbacks. Such prediction is based on volatile multi-armed bandit to capture workers' availability and stochastic changes on resource uses. Furthermore, we extend the proposed algorithms to the multi-worker selection scenario where the platform needs to determine a candidate worker set instead of a single worker for video analytics. Via rigorous proof, the regret is ensured upon the Lyapunov optimization and the bandit, measuring the gap between the online decisions and the offline optimum. Extensive trace-driven experiments show that our proposed algorithm improves the profit by 37% compared with other algorithms.",
"title": "Crowdsourcing Upon Learning: Energy-Aware Dispatch With Guarantee for Video Analytics",
"normalizedTitle": "Crowdsourcing Upon Learning: Energy-Aware Dispatch With Guarantee for Video Analytics",
"fno": "10107793",
"hasPdf": true,
"idPrefix": "tm",
"keywords": [
"Visual Analytics",
"Crowdsourcing",
"Task Analysis",
"Mobile Computing",
"Manuals",
"Heuristic Algorithms",
"Analytical Models",
"Crowdsourcing",
"Lyapunov Optimization",
"Multi Armed Bandit",
"Video Analytics",
"Worker Selection"
],
"authors": [
{
"givenName": "Yu",
"surname": "Chen",
"fullName": "Yu Chen",
"affiliation": "State Key Laboratory for Novel Software Technology, Nanjing University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sheng",
"surname": "Zhang",
"fullName": "Sheng Zhang",
"affiliation": "State Key Laboratory for Novel Software Technology, Nanjing University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yibo",
"surname": "Jin",
"fullName": "Yibo Jin",
"affiliation": "State Key Laboratory for Novel Software Technology, Nanjing University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhuzhong",
"surname": "Qian",
"fullName": "Zhuzhong Qian",
"affiliation": "State Key Laboratory for Novel Software Technology, Nanjing University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mingjun",
"surname": "Xiao",
"fullName": "Mingjun Xiao",
"affiliation": "School of Computer Science and Technology / Suzhou Institute for Advanced Study, University of Science and Technology of China, Hefei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wenzhong",
"surname": "Li",
"fullName": "Wenzhong Li",
"affiliation": "State Key Laboratory for Novel Software Technology, Nanjing University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yu",
"surname": "Liang",
"fullName": "Yu Liang",
"affiliation": "School of Computer and Electronic Information/School of Artificial Intelligence, Nanjing Normal University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sanglu",
"surname": "Lu",
"fullName": "Sanglu Lu",
"affiliation": "State Key Laboratory for Novel Software Technology, Nanjing University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "1-18",
"year": "5555",
"issn": "1536-1233",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ithingscpscom/2011/4580/0/4580a409",
"title": "Task Matching in Crowdsourcing",
"doi": null,
"abstractUrl": "/proceedings-article/ithingscpscom/2011/4580a409/12OmNCvumTq",
"parentPublication": {
"id": "proceedings/ithingscpscom/2011/4580/0",
"title": "International Conference on Internet of Things and International Conference on Cyber, Physical and Social Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmla/2016/6167/0/07838231",
"title": "Bee Colony Based Worker Reliability Estimation Algorithm in Microtask Crowdsourcing",
"doi": null,
"abstractUrl": "/proceedings-article/icmla/2016/07838231/12OmNzVXNWo",
"parentPublication": {
"id": "proceedings/icmla/2016/6167/0",
"title": "2016 15th IEEE International Conference on Machine Learning and Applications (ICMLA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2021/01/08253516",
"title": "Privacy-Preserving Task Recommendation Services for Crowdsourcing",
"doi": null,
"abstractUrl": "/journal/sc/2021/01/08253516/13rRUwInvpv",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2018/5520/0/552000a317",
"title": "Latency-Oriented Task Completion via Spatial Crowdsourcing",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2018/552000a317/14Fq0WE0DK0",
"parentPublication": {
"id": "proceedings/icde/2018/5520/0",
"title": "2018 IEEE 34th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2021/2398/0/239800a280",
"title": "Crowdsourcing with Self-paced Workers",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2021/239800a280/1AqxdMZeTVS",
"parentPublication": {
"id": "proceedings/icdm/2021/2398/0",
"title": "2021 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2022/0883/0/088300c141",
"title": "Influence-aware Task Assignment in Spatial Crowdsourcing",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2022/088300c141/1FwFdDAwq1W",
"parentPublication": {
"id": "proceedings/icde/2022/0883/0",
"title": "2022 IEEE 38th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msn/2022/6457/0/645700a518",
"title": "Dynamic Unknown Worker Recruitment for Heterogeneous Contextual Labeling Tasks Using Adversarial Multi-Armed Bandit",
"doi": null,
"abstractUrl": "/proceedings-article/msn/2022/645700a518/1LUtWqvPeE0",
"parentPublication": {
"id": "proceedings/msn/2022/6457/0",
"title": "2022 18th International Conference on Mobility, Sensing and Networking (MSN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/08907502",
"title": "CMed: Crowd Analytics for Medical Imaging Data",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/08907502/1f75Tv9969i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2021/9184/0/918400a265",
"title": "Fairness-aware Task Assignment in Spatial Crowdsourcing: Game-Theoretic Approaches",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2021/918400a265/1uGXRsfYJck",
"parentPublication": {
"id": "proceedings/icde/2021/9184/0",
"title": "2021 IEEE 37th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icws/2021/1681/0/168100a161",
"title": "WorP: A Novel Worker Performance Prediction Model for General Tasks on Crowdsourcing Platforms",
"doi": null,
"abstractUrl": "/proceedings-article/icws/2021/168100a161/1yrHEooPzRS",
"parentPublication": {
"id": "proceedings/icws/2021/1681/0",
"title": "2021 IEEE International Conference on Web Services (ICWS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10108041",
"articleId": "1MDGjYupRjW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10107794",
"articleId": "1MDGkCss0Ra",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzgNXTz",
"title": "June",
"year": "2020",
"issueNum": "06",
"idPrefix": "tp",
"pubType": "journal",
"volume": "42",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45Xcttk2",
"doi": "10.1109/TPAMI.2019.2896296",
"abstract": "Recently, Convolutional Neural Networks have shown promising results for 3D geometry prediction. They can make predictions from very little input data such as a single color image. A major limitation of such approaches is that they only predict a coarse resolution voxel grid, which does not capture the surface of the objects well. We propose a general framework, called hierarchical surface prediction (HSP), which facilitates prediction of high resolution voxel grids. The main insight is that it is sufficient to predict high resolution voxels around the predicted surfaces. The exterior and interior of the objects can be represented with coarse resolution voxels. This allows us to predict significantly higher resolution voxel grids around the surface, from which triangle meshes can be extracted. Additionally it allows us to predict properties such as surface color which are only defined on the surface. Our approach is not dependent on a specific input type. We show results for geometry prediction from color images and depth images. Our analysis shows that our high resolution predictions are more accurate than low resolution predictions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recently, Convolutional Neural Networks have shown promising results for 3D geometry prediction. They can make predictions from very little input data such as a single color image. A major limitation of such approaches is that they only predict a coarse resolution voxel grid, which does not capture the surface of the objects well. We propose a general framework, called hierarchical surface prediction (HSP), which facilitates prediction of high resolution voxel grids. The main insight is that it is sufficient to predict high resolution voxels around the predicted surfaces. The exterior and interior of the objects can be represented with coarse resolution voxels. This allows us to predict significantly higher resolution voxel grids around the surface, from which triangle meshes can be extracted. Additionally it allows us to predict properties such as surface color which are only defined on the surface. Our approach is not dependent on a specific input type. We show results for geometry prediction from color images and depth images. Our analysis shows that our high resolution predictions are more accurate than low resolution predictions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recently, Convolutional Neural Networks have shown promising results for 3D geometry prediction. They can make predictions from very little input data such as a single color image. A major limitation of such approaches is that they only predict a coarse resolution voxel grid, which does not capture the surface of the objects well. We propose a general framework, called hierarchical surface prediction (HSP), which facilitates prediction of high resolution voxel grids. The main insight is that it is sufficient to predict high resolution voxels around the predicted surfaces. The exterior and interior of the objects can be represented with coarse resolution voxels. This allows us to predict significantly higher resolution voxel grids around the surface, from which triangle meshes can be extracted. Additionally it allows us to predict properties such as surface color which are only defined on the surface. Our approach is not dependent on a specific input type. We show results for geometry prediction from color images and depth images. Our analysis shows that our high resolution predictions are more accurate than low resolution predictions.",
"title": "Hierarchical Surface Prediction",
"normalizedTitle": "Hierarchical Surface Prediction",
"fno": "08630046",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Computational Geometry",
"Convolutional Neural Nets",
"Image Colour Analysis",
"Image Resolution",
"Mesh Generation",
"Solid Modelling",
"Convolutional Neural Networks",
"Geometry Prediction",
"Single Color Image",
"Coarse Resolution Voxel Grid",
"Hierarchical Surface Prediction",
"High Resolution Voxel Grids",
"High Resolution Voxels",
"Surface Color",
"Color Images",
"Depth Images",
"High Resolution Predictions",
"Low Resolution Predictions",
"Three Dimensional Displays",
"Geometry",
"Image Color Analysis",
"Shape",
"Octrees",
"Color",
"Surface Reconstruction",
"Single View Reconstruction",
"High Resolution",
"Voxel Grid",
"Geometry Prediction"
],
"authors": [
{
"givenName": "Christian",
"surname": "Häne",
"fullName": "Christian Häne",
"affiliation": "Department of Electrical Engineering and Computer Sciences, University of California, Berkleley, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sohubham",
"surname": "Tulsiani",
"fullName": "Sohubham Tulsiani",
"affiliation": "Facebook",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jitendra",
"surname": "Malik",
"fullName": "Jitendra Malik",
"affiliation": "Facebook",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2020-06-01 00:00:00",
"pubType": "trans",
"pages": "1348-1361",
"year": "2020",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dicta/2005/2467/0/24670076",
"title": "Computing Surface-Based Photo-Consistency on Graphics Hardware",
"doi": null,
"abstractUrl": "/proceedings-article/dicta/2005/24670076/12OmNBV9Iai",
"parentPublication": {
"id": "proceedings/dicta/2005/2467/0",
"title": "Digital Image Computing: Techniques and Applications (DICTA'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2015/9711/0/5720a157",
"title": "Incremental Division of Very Large Point Clouds for Scalable 3D Surface Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2015/5720a157/12OmNvT2p0I",
"parentPublication": {
"id": "proceedings/iccvw/2015/9711/0",
"title": "2015 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2015/9711/0/5720a175",
"title": "Surface Recovery: Fusion of Image and Point Cloud",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2015/5720a175/12OmNxE2mUe",
"parentPublication": {
"id": "proceedings/iccvw/2015/9711/0",
"title": "2015 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2017/2610/0/261001a412",
"title": "Hierarchical Surface Prediction for 3D Object Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2017/261001a412/12OmNy4r3YL",
"parentPublication": {
"id": "proceedings/3dv/2017/2610/0",
"title": "2017 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/02/08013133",
"title": "Compressing Color Data for Voxelized Surface Geometry",
"doi": null,
"abstractUrl": "/journal/tg/2019/02/08013133/17D45WHONmC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09969571",
"title": "Vox-Surf: Voxel-Based Implicit Surface Representation",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09969571/1IMidH7hZhC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800a967",
"title": "SSRNet: Scalable 3D Surface Reconstruction Network",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800a967/1m3nKc80MlG",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/09339892",
"title": "Digital Surface Regularization With Guarantees",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/09339892/1qLhYrSA4ve",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2021/0477/0/047700a806",
"title": "DeepCSR: A 3D Deep Learning Approach for Cortical Surface Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2021/047700a806/1uqGLE24LXW",
"parentPublication": {
"id": "proceedings/wacv/2021/0477/0",
"title": "2021 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/11/09555381",
"title": "SurRF: Unsupervised Multi-View Stereopsis by Learning Surface Radiance Field",
"doi": null,
"abstractUrl": "/journal/tp/2022/11/09555381/1xjQQdQGABG",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08644023",
"articleId": "17PYEmCU58s",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08637773",
"articleId": "17D45XeKgxN",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRo",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1IMidH7hZhC",
"doi": "10.1109/TVCG.2022.3225844",
"abstract": "Virtual content creation and interaction play an important role in modern 3D applications. Recovering detailed 3D models from real scenes can significantly expand the scope of its applications and has been studied for decades in the computer vision and computer graphics community. In this work, we propose Vox-Surf, a voxel-based implicit surface representation. Our Vox-Surf divides the space into finite sparse voxels, where each voxel is a basic geometry unit that stores geometry and appearance information on its corner vertices. Due to the sparsity inherited from the voxel representation, Vox-Surf is suitable for almost any scene and can be easily trained end-to-end from multiple view images. We utilize a progressive training process to gradually cull out empty voxels and keep only valid voxels for further optimization, which greatly reduces the number of sample points and improves inference speed. Experiments show that our Vox-Surf representation can learn fine surface details and accurate colors with less memory and faster rendering than previous methods. The resulting fine voxels can also be considered as the bounding volumes for collision detection, which is useful in 3D interactions. We also show the potential application of Vox-Surf in scene editing and augmented reality. The source code is publicly available at <uri>https://github.com/zju3dv/Vox-Surf</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Virtual content creation and interaction play an important role in modern 3D applications. Recovering detailed 3D models from real scenes can significantly expand the scope of its applications and has been studied for decades in the computer vision and computer graphics community. In this work, we propose Vox-Surf, a voxel-based implicit surface representation. Our Vox-Surf divides the space into finite sparse voxels, where each voxel is a basic geometry unit that stores geometry and appearance information on its corner vertices. Due to the sparsity inherited from the voxel representation, Vox-Surf is suitable for almost any scene and can be easily trained end-to-end from multiple view images. We utilize a progressive training process to gradually cull out empty voxels and keep only valid voxels for further optimization, which greatly reduces the number of sample points and improves inference speed. Experiments show that our Vox-Surf representation can learn fine surface details and accurate colors with less memory and faster rendering than previous methods. The resulting fine voxels can also be considered as the bounding volumes for collision detection, which is useful in 3D interactions. We also show the potential application of Vox-Surf in scene editing and augmented reality. The source code is publicly available at <uri>https://github.com/zju3dv/Vox-Surf</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Virtual content creation and interaction play an important role in modern 3D applications. Recovering detailed 3D models from real scenes can significantly expand the scope of its applications and has been studied for decades in the computer vision and computer graphics community. In this work, we propose Vox-Surf, a voxel-based implicit surface representation. Our Vox-Surf divides the space into finite sparse voxels, where each voxel is a basic geometry unit that stores geometry and appearance information on its corner vertices. Due to the sparsity inherited from the voxel representation, Vox-Surf is suitable for almost any scene and can be easily trained end-to-end from multiple view images. We utilize a progressive training process to gradually cull out empty voxels and keep only valid voxels for further optimization, which greatly reduces the number of sample points and improves inference speed. Experiments show that our Vox-Surf representation can learn fine surface details and accurate colors with less memory and faster rendering than previous methods. The resulting fine voxels can also be considered as the bounding volumes for collision detection, which is useful in 3D interactions. We also show the potential application of Vox-Surf in scene editing and augmented reality. The source code is publicly available at https://github.com/zju3dv/Vox-Surf.",
"title": "Vox-Surf: Voxel-Based Implicit Surface Representation",
"normalizedTitle": "Vox-Surf: Voxel-Based Implicit Surface Representation",
"fno": "09969571",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Surface Reconstruction",
"Image Reconstruction",
"Geometry",
"Rendering Computer Graphics",
"Three Dimensional Displays",
"Feature Extraction",
"Surface Treatment",
"Surface Reconstruction",
"Implicit Representation",
"Scene Editing"
],
"authors": [
{
"givenName": "Hai",
"surname": "Li",
"fullName": "Hai Li",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xingrui",
"surname": "Yang",
"fullName": "Xingrui Yang",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongjia",
"surname": "Zhai",
"fullName": "Hongjia Zhai",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuqian",
"surname": "Liu",
"fullName": "Yuqian Liu",
"affiliation": "Visual Information Laboratory, University of Bristol, Bristol, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hujun",
"surname": "Bao",
"fullName": "Hujun Bao",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guofeng",
"surname": "Zhang",
"fullName": "Guofeng Zhang",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "1-12",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/candar/2014/4152/0/4152a367",
"title": "A Memory Efficient Parallel Method for Voxel-Based Multiview Stereo",
"doi": null,
"abstractUrl": "/proceedings-article/candar/2014/4152a367/12OmNAJDBw6",
"parentPublication": {
"id": "proceedings/candar/2014/4152/0",
"title": "2014 Second International Symposium on Computing and Networking (CANDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2017/2610/0/261001a412",
"title": "Hierarchical Surface Prediction for 3D Object Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2017/261001a412/12OmNy4r3YL",
"parentPublication": {
"id": "proceedings/3dv/2017/2610/0",
"title": "2017 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2020/06/08630046",
"title": "Hierarchical Surface Prediction",
"doi": null,
"abstractUrl": "/journal/tp/2020/06/08630046/17D45Xcttk2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200d144",
"title": "Voxel Transformer for 3D Object Detection",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200d144/1BmHhfdx7dm",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/09844250",
"title": "Voxel-Mesh Network for Geodesic-Aware 3D Semantic Segmentation of Indoor Scenes",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/09844250/1FnqTVYetzy",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600g270",
"title": "Gradient-SDF: A Semi-Implicit Surface Representation for 3D Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600g270/1H0MXW1GTN6",
"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/3dv/2022/5670/0/567000a433",
"title": "GO-Surf: Neural Feature Grid Optimization for Fast, High-Fidelity RGB-D Surface Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2022/567000a433/1KYso11QHx6",
"parentPublication": {
"id": "proceedings/3dv/2022/5670/0",
"title": "2022 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300e742",
"title": "Implicit Surface Representations As Layers in Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300e742/1hVlBZYxMe4",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800b290",
"title": "Deep Implicit Volume Compression",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800b290/1m3oiGZMFwc",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/09339892",
"title": "Digital Surface Regularization With Guarantees",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/09339892/1qLhYrSA4ve",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09969167",
"articleId": "1IMicNIXex2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09973820",
"articleId": "1IUAPHcYiD6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1KsRzJZl0ly",
"title": "March",
"year": "2023",
"issueNum": "03",
"idPrefix": "tk",
"pubType": "journal",
"volume": "35",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1x4UGJ56Qpy",
"doi": "10.1109/TKDE.2021.3114204",
"abstract": "The majority of the classical dimensionality reduction methods can be unified into a graph-embedding-based framework. A fixed graph constructed in a high-dimensional space has been extensively employed in the graph-embedding-based dimensionality reduction methods. However, a fixed graph often cannot characterize the structure of high-dimensional data owing to the curse of dimensionality. To solve this problem, we combine graph construction and dimensionality reduction into a coherent framework. Thus, the constructed graph can be updated dynamically in dimensionality reduction. In the existing methods based on the coherent framework, graphs are usually constructed by a type of neighborhood relationship and single clustering result. This study proposes an unsupervised dimensionality reduction method guided by fusing multiple clustering results. In the proposed method, multiple clustering results are first obtained by the k-means algorithm, and then a graph is constructed using a weighted co-association matrix of fusing the clustering results to capture data distribution information. Based on the graph, we present an objective function of combining graph construction and dimensionality reduction to implement mutual guidance between them. Numerical experiments on real data sets illustrate that the proposed method achieves significant improvement over some representative and state-of-the-art unsupervised dimensionality reduction methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The majority of the classical dimensionality reduction methods can be unified into a graph-embedding-based framework. A fixed graph constructed in a high-dimensional space has been extensively employed in the graph-embedding-based dimensionality reduction methods. However, a fixed graph often cannot characterize the structure of high-dimensional data owing to the curse of dimensionality. To solve this problem, we combine graph construction and dimensionality reduction into a coherent framework. Thus, the constructed graph can be updated dynamically in dimensionality reduction. In the existing methods based on the coherent framework, graphs are usually constructed by a type of neighborhood relationship and single clustering result. This study proposes an unsupervised dimensionality reduction method guided by fusing multiple clustering results. In the proposed method, multiple clustering results are first obtained by the k-means algorithm, and then a graph is constructed using a weighted co-association matrix of fusing the clustering results to capture data distribution information. Based on the graph, we present an objective function of combining graph construction and dimensionality reduction to implement mutual guidance between them. Numerical experiments on real data sets illustrate that the proposed method achieves significant improvement over some representative and state-of-the-art unsupervised dimensionality reduction methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The majority of the classical dimensionality reduction methods can be unified into a graph-embedding-based framework. A fixed graph constructed in a high-dimensional space has been extensively employed in the graph-embedding-based dimensionality reduction methods. However, a fixed graph often cannot characterize the structure of high-dimensional data owing to the curse of dimensionality. To solve this problem, we combine graph construction and dimensionality reduction into a coherent framework. Thus, the constructed graph can be updated dynamically in dimensionality reduction. In the existing methods based on the coherent framework, graphs are usually constructed by a type of neighborhood relationship and single clustering result. This study proposes an unsupervised dimensionality reduction method guided by fusing multiple clustering results. In the proposed method, multiple clustering results are first obtained by the k-means algorithm, and then a graph is constructed using a weighted co-association matrix of fusing the clustering results to capture data distribution information. Based on the graph, we present an objective function of combining graph construction and dimensionality reduction to implement mutual guidance between them. Numerical experiments on real data sets illustrate that the proposed method achieves significant improvement over some representative and state-of-the-art unsupervised dimensionality reduction methods.",
"title": "Unsupervised Dimensionality Reduction Based on Fusing Multiple Clustering Results",
"normalizedTitle": "Unsupervised Dimensionality Reduction Based on Fusing Multiple Clustering Results",
"fno": "09543512",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Data Fusion",
"Data Preparation",
"Graph Theory",
"Matrix Algebra",
"Pattern Clustering",
"Unsupervised Learning",
"Clustering Result Fusion",
"Curse Of Dimensionality",
"Data Distribution Information",
"Fixed Graph",
"Graph Construction",
"Graph Embedding Based Dimensionality Reduction",
"High Dimensional Data",
"High Dimensional Space",
"K Means Algorithm",
"Neighborhood Relationship",
"Objective Function",
"Unsupervised Dimensionality Reduction",
"Weighted Co Association Matrix",
"Dimensionality Reduction",
"Manifolds",
"Principal Component Analysis",
"Optimization",
"Learning Systems",
"Kernel",
"Task Analysis",
"Dimensionality Reduction",
"Graph Embedding",
"Clustering",
"Co Association Matrix"
],
"authors": [
{
"givenName": "Wei",
"surname": "Wei",
"fullName": "Wei Wei",
"affiliation": "Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education, School of Computer and Information Technology, Shanxi University, Taiyuan, Shanxi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qin",
"surname": "Yue",
"fullName": "Qin Yue",
"affiliation": "Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education, School of Computer and Information Technology, Shanxi University, Taiyuan, Shanxi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kai",
"surname": "Feng",
"fullName": "Kai Feng",
"affiliation": "Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education, School of Computer and Information Technology, Shanxi University, Taiyuan, Shanxi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Junbiao",
"surname": "Cui",
"fullName": "Junbiao Cui",
"affiliation": "Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education, School of Computer and Information Technology, Shanxi University, Taiyuan, Shanxi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiye",
"surname": "Liang",
"fullName": "Jiye Liang",
"affiliation": "Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education, School of Computer and Information Technology, Shanxi University, Taiyuan, Shanxi, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2023-03-01 00:00:00",
"pubType": "trans",
"pages": "3211-3223",
"year": "2023",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/fskd/2008/3305/2/3305b048",
"title": "Unsupervised Sequential Forward Dimensionality Reduction Based on Fractal",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2008/3305b048/12OmNxymo5k",
"parentPublication": {
"id": "fskd/2008/3305/2",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbk/2018/9125/0/912500a448",
"title": "Nonlinear Dimensionality Reduction with Judicial Document Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icbk/2018/912500a448/17D45VTRoDG",
"parentPublication": {
"id": "proceedings/icbk/2018/9125/0",
"title": "2018 IEEE International Conference on Big Knowledge (ICBK)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08546198",
"title": "Maximum Gradient Dimensionality Reduction",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08546198/17D45XzbnLm",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10103196",
"title": "Unsupervised Adaptive Bipartite Graph Embedding",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10103196/1MpWKBrUc48",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805461",
"title": "Supporting Analysis of Dimensionality Reduction Results with Contrastive Learning",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805461/1cG4ulCK5S8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnisc/2017/1618/0/161800a126",
"title": "Local Linear Dimensionality Reduction Algorithm Based on Nonlinear Manifolds Decomposition",
"doi": null,
"abstractUrl": "/proceedings-article/icnisc/2017/161800a126/1dUn9oRfDAk",
"parentPublication": {
"id": "proceedings/icnisc/2017/1618/0",
"title": "2017 International Conference on Network and Information Systems for Computers (ICNISC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlbdbi/2019/5094/0/509400a151",
"title": "Dimensionality Reduction via Locality Constrained Competitive Sparse Representation by L2-Norm Regularization",
"doi": null,
"abstractUrl": "/proceedings-article/mlbdbi/2019/509400a151/1gjRIaU3pVC",
"parentPublication": {
"id": "proceedings/mlbdbi/2019/5094/0",
"title": "2019 International Conference on Machine Learning, Big Data and Business Intelligence (MLBDBI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2019/5686/0/568600a577",
"title": "Autoencoder Based Dimensionality Reduction of Feature Vectors for Object Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2019/568600a577/1j9xB188lAk",
"parentPublication": {
"id": "proceedings/sitis/2019/5686/0",
"title": "2019 15th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09282195",
"title": "DRGraph: An Efficient Graph Layout Algorithm for Large-scale Graphs by Dimensionality Reduction",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09282195/1phNGqqKjYY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2022/06/09428524",
"title": "EvoSets: Tracking the Sensitivity of Dimensionality Reduction Results Across Subspaces",
"doi": null,
"abstractUrl": "/journal/bd/2022/06/09428524/1twasK9vXtS",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09535257",
"articleId": "1wMELvY3Tna",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09551789",
"articleId": "1xgx0lSOQz6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwHhp0D",
"title": "Nov.-Dec.",
"year": "2019",
"issueNum": "06",
"idPrefix": "tb",
"pubType": "journal",
"volume": "16",
"label": "Nov.-Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxlgyai",
"doi": "10.1109/TCBB.2018.2843364",
"abstract": "With the advances in the next generation sequencing technology, huge amounts of data have been and get generated in biology. A bottleneck in dealing with such datasets lies in developing effective algorithms for extracting useful information from them. Algorithms for finding patterns in biological data pave the way for extracting crucial information from the voluminous datasets. In this paper, we focus on a fundamental pattern, namely, the closest <inline-formula><tex-math notation=\"LaTeX\">Z_$l$_Z</tex-math></inline-formula>-mers. Given a set of <inline-formula><tex-math notation=\"LaTeX\">Z_$m$_Z</tex-math></inline-formula> biological strings <inline-formula><tex-math notation=\"LaTeX\">Z_$S_1,S_2,\\ldots, S_m$_Z</tex-math></inline-formula> and an integer <inline-formula><tex-math notation=\"LaTeX\">Z_$l$_Z</tex-math></inline-formula>, the problem of interest is that of finding an <inline-formula><tex-math notation=\"LaTeX\">Z_$l$_Z</tex-math></inline-formula>-mer from each string such that the distance among them is the least. For example we want to find <inline-formula><tex-math notation=\"LaTeX\">Z_$m$_Z</tex-math></inline-formula> <inline-formula><tex-math notation=\"LaTeX\">Z_$l$_Z</tex-math></inline-formula>-mers <inline-formula><tex-math notation=\"LaTeX\">Z_$X_1,X_2,\\ldots, X_m$_Z</tex-math></inline-formula> such that <inline-formula><tex-math notation=\"LaTeX\">Z_$X_i$_Z</tex-math></inline-formula> is an <inline-formula><tex-math notation=\"LaTeX\">Z_$l$_Z</tex-math></inline-formula>-mer in <inline-formula><tex-math notation=\"LaTeX\">Z_$S_i$_Z</tex-math></inline-formula> (for <inline-formula><tex-math notation=\"LaTeX\">Z_$1\\leq i\\leq m$_Z</tex-math></inline-formula>) and the Hamming distance among these <inline-formula><tex-math notation=\"LaTeX\">Z_$m$_Z</tex-math></inline-formula> <inline-formula><tex-math notation=\"LaTeX\">Z_$l$_Z</tex-math></inline-formula>-mers is the least (from among all such possible <inline-formula><tex-math notation=\"LaTeX\">Z_$l$_Z</tex-math></inline-formula>-mers). This problem has many applications. An application of great importance is motif search. Algorithms for finding the closest <inline-formula><tex-math notation=\"LaTeX\">Z_$l$_Z</tex-math></inline-formula>-mers have been used in solving the <inline-formula><tex-math notation=\"LaTeX\">Z_$(l,d)$_Z</tex-math></inline-formula>-motif search problem (see e.g., <xref ref-type=\"bibr\" rid=\"ref1\">[1]</xref> , <xref ref-type=\"bibr\" rid=\"ref2\">[2]</xref> ). In this paper novel exact and approximate algorithms are proposed for this problem for the case of <inline-formula><tex-math notation=\"LaTeX\">Z_$m>2$_Z</tex-math></inline-formula>. In particular, a comprehensive experimental evaluation is performed for <inline-formula><tex-math notation=\"LaTeX\">Z_$m=3$_Z</tex-math></inline-formula>, along with a further empirical study of <inline-formula><tex-math notation=\"LaTeX\">Z_$m=4$_Z</tex-math></inline-formula> and 5. We also extend our solution to euclidean distance measurement metric if the sequences contain real numbers.",
"abstracts": [
{
"abstractType": "Regular",
"content": "With the advances in the next generation sequencing technology, huge amounts of data have been and get generated in biology. A bottleneck in dealing with such datasets lies in developing effective algorithms for extracting useful information from them. Algorithms for finding patterns in biological data pave the way for extracting crucial information from the voluminous datasets. In this paper, we focus on a fundamental pattern, namely, the closest <inline-formula><tex-math notation=\"LaTeX\">$l$</tex-math><alternatives><mml:math><mml:mi>l</mml:mi></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq2-2843364.gif\"/></alternatives></inline-formula>-mers. Given a set of <inline-formula><tex-math notation=\"LaTeX\">$m$</tex-math><alternatives><mml:math><mml:mi>m</mml:mi></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq3-2843364.gif\"/></alternatives></inline-formula> biological strings <inline-formula><tex-math notation=\"LaTeX\">$S_1,S_2,\\ldots, S_m$</tex-math><alternatives><mml:math><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>...</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq4-2843364.gif\"/></alternatives></inline-formula> and an integer <inline-formula><tex-math notation=\"LaTeX\">$l$</tex-math><alternatives><mml:math><mml:mi>l</mml:mi></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq5-2843364.gif\"/></alternatives></inline-formula>, the problem of interest is that of finding an <inline-formula><tex-math notation=\"LaTeX\">$l$</tex-math><alternatives><mml:math><mml:mi>l</mml:mi></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq6-2843364.gif\"/></alternatives></inline-formula>-mer from each string such that the distance among them is the least. For example we want to find <inline-formula><tex-math notation=\"LaTeX\">$m$</tex-math><alternatives><mml:math><mml:mi>m</mml:mi></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq7-2843364.gif\"/></alternatives></inline-formula> <inline-formula><tex-math notation=\"LaTeX\">$l$</tex-math><alternatives><mml:math><mml:mi>l</mml:mi></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq8-2843364.gif\"/></alternatives></inline-formula>-mers <inline-formula><tex-math notation=\"LaTeX\">$X_1,X_2,\\ldots, X_m$</tex-math><alternatives><mml:math><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>...</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq9-2843364.gif\"/></alternatives></inline-formula> such that <inline-formula><tex-math notation=\"LaTeX\">$X_i$</tex-math><alternatives><mml:math><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq10-2843364.gif\"/></alternatives></inline-formula> is an <inline-formula><tex-math notation=\"LaTeX\">$l$</tex-math><alternatives><mml:math><mml:mi>l</mml:mi></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq11-2843364.gif\"/></alternatives></inline-formula>-mer in <inline-formula><tex-math notation=\"LaTeX\">$S_i$</tex-math><alternatives><mml:math><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq12-2843364.gif\"/></alternatives></inline-formula> (for <inline-formula><tex-math notation=\"LaTeX\">$1\\leq i\\leq m$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>1</mml:mn><mml:mo>≤</mml:mo><mml:mi>i</mml:mi><mml:mo>≤</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq13-2843364.gif\"/></alternatives></inline-formula>) and the Hamming distance among these <inline-formula><tex-math notation=\"LaTeX\">$m$</tex-math><alternatives><mml:math><mml:mi>m</mml:mi></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq14-2843364.gif\"/></alternatives></inline-formula> <inline-formula><tex-math notation=\"LaTeX\">$l$</tex-math><alternatives><mml:math><mml:mi>l</mml:mi></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq15-2843364.gif\"/></alternatives></inline-formula>-mers is the least (from among all such possible <inline-formula><tex-math notation=\"LaTeX\">$l$</tex-math><alternatives><mml:math><mml:mi>l</mml:mi></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq16-2843364.gif\"/></alternatives></inline-formula>-mers). This problem has many applications. An application of great importance is motif search. Algorithms for finding the closest <inline-formula><tex-math notation=\"LaTeX\">$l$</tex-math><alternatives><mml:math><mml:mi>l</mml:mi></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq17-2843364.gif\"/></alternatives></inline-formula>-mers have been used in solving the <inline-formula><tex-math notation=\"LaTeX\">$(l,d)$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>(</mml:mo><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq18-2843364.gif\"/></alternatives></inline-formula>-motif search problem (see e.g., <xref ref-type=\"bibr\" rid=\"ref1\">[1]</xref> , <xref ref-type=\"bibr\" rid=\"ref2\">[2]</xref> ). In this paper novel exact and approximate algorithms are proposed for this problem for the case of <inline-formula><tex-math notation=\"LaTeX\">$m>2$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>m</mml:mi><mml:mo>></mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq19-2843364.gif\"/></alternatives></inline-formula>. In particular, a comprehensive experimental evaluation is performed for <inline-formula><tex-math notation=\"LaTeX\">$m=3$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq20-2843364.gif\"/></alternatives></inline-formula>, along with a further empirical study of <inline-formula><tex-math notation=\"LaTeX\">$m=4$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>4</mml:mn></mml:mrow></mml:math><inline-graphic xlink:href=\"rajasekaran-ieq21-2843364.gif\"/></alternatives></inline-formula> and 5. We also extend our solution to euclidean distance measurement metric if the sequences contain real numbers.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "With the advances in the next generation sequencing technology, huge amounts of data have been and get generated in biology. A bottleneck in dealing with such datasets lies in developing effective algorithms for extracting useful information from them. Algorithms for finding patterns in biological data pave the way for extracting crucial information from the voluminous datasets. In this paper, we focus on a fundamental pattern, namely, the closest --mers. Given a set of - biological strings - and an integer -, the problem of interest is that of finding an --mer from each string such that the distance among them is the least. For example we want to find - --mers - such that - is an --mer in - (for -) and the Hamming distance among these - --mers is the least (from among all such possible --mers). This problem has many applications. An application of great importance is motif search. Algorithms for finding the closest --mers have been used in solving the --motif search problem (see e.g., [1] , [2] ). In this paper novel exact and approximate algorithms are proposed for this problem for the case of -. In particular, a comprehensive experimental evaluation is performed for -, along with a further empirical study of - and 5. We also extend our solution to euclidean distance measurement metric if the sequences contain real numbers.",
"title": "Efficient Algorithms for Finding the Closest <inline-formula><tex-math notation=\"LaTeX\">Z_$l$_Z</tex-math></inline-formula>-Mers in Biological Data",
"normalizedTitle": "Efficient Algorithms for Finding the Closest --Mers in Biological Data",
"fno": "08371302",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Biology Computing",
"Computational Complexity",
"Data Analysis",
"Search Problems",
"Closest L Mers",
"Biological Data",
"Generation Sequencing Technology",
"Biology",
"Voluminous Datasets",
"Fundamental Pattern",
"Biological Strings",
"Approximate Algorithms",
"Approximation Algorithms",
"Hamming Distance",
"Biology",
"Time Series Analysis",
"Search Problems",
"Euclidean Distance",
"FREE COVID 19",
"Closest <inline-formula xmlns:ali=\"http://www.niso.org/schemas/ali/1.0/\" xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"> <tex-math notation=\"LaTeX\">Z_$l$_Z</tex-math> </inline-formula>-mers",
"Closest Triplet",
"Efficient Algorithms",
"Randomized Algorithms",
"Time Series Motifs",
"<inline-formula xmlns:ali=\"http://www.niso.org/schemas/ali/1.0/\" xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"> <tex-math notation=\"LaTeX\">Z_$(l,d)$_Z</tex-math> </inline-formula>-motifs"
],
"authors": [
{
"givenName": "Xingyu",
"surname": "Cai",
"fullName": "Xingyu Cai",
"affiliation": "Department of Computer Science and Engineering, University of Connecticut, Storrs, CT",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Abdullah-Al",
"surname": "Mamun",
"fullName": "Abdullah-Al Mamun",
"affiliation": "Department of Computer Science and Engineering, University of Connecticut, Storrs, CT",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sanguthevar",
"surname": "Rajasekaran",
"fullName": "Sanguthevar Rajasekaran",
"affiliation": "Department of Computer Science and Engineering, University of Connecticut, Storrs, CT",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "06",
"pubDate": "2019-11-01 00:00:00",
"pubType": "trans",
"pages": "1912-1921",
"year": "2019",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/bd/2021/05/07979612",
"title": "Leakage Resilient Leveled <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathsf {FHE}$_Z</tex-math></inline-formula> on Multiple Bits Message",
"doi": null,
"abstractUrl": "/journal/bd/2021/05/07979612/13rRUxC0SJC",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/10/09690512",
"title": "Communication-Efficient <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-Means for Edge-Based Machine Learning",
"doi": null,
"abstractUrl": "/journal/td/2022/10/09690512/1Aqs1yORIZi",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/06/09756312",
"title": "Continuous <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-Regret Minimization Queries: A Dynamic Coreset Approach",
"doi": null,
"abstractUrl": "/journal/tk/2023/06/09756312/1CvQcl7WKu4",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/12/09858633",
"title": "Robustness of Subsystem Reliability of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-Ary <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula>-Cube Networks Under Probabilistic Fault Model",
"doi": null,
"abstractUrl": "/journal/td/2022/12/09858633/1FUYE7DVEaI",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/01/09139397",
"title": "Ball <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-Means: Fast Adaptive Clustering With No Bounds",
"doi": null,
"abstractUrl": "/journal/tp/2022/01/09139397/1ls8X1ZoJj2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/07/09186333",
"title": "<italic>LShape</italic> Partitioning: Parallel Skyline Query Processing Using <inline-formula><tex-math notation=\"LaTeX\">Z_$MapReduce$_Z</tex-math></inline-formula>",
"doi": null,
"abstractUrl": "/journal/tk/2022/07/09186333/1mP21G1r2QE",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__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/tk/2023/02/09492838",
"title": "Maximum Signed <inline-formula><tex-math notation=\"LaTeX\">Z_$\\theta$_Z</tex-math></inline-formula>-Clique Identification in Large Signed Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2023/02/09492838/1vq0EU6lrAA",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2023/01/09616383",
"title": "<inline-formula><tex-math notation=\"LaTeX\">Z_$xAFCL$_Z</tex-math></inline-formula>: Run Scalable Function Choreographies Across Multiple FaaS Systems",
"doi": null,
"abstractUrl": "/journal/sc/2023/01/09616383/1yA74qnPV4c",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/07/09609537",
"title": "Hamiltonian Paths of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-ary <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula>-cubes Avoiding Faulty Links and Passing Through Prescribed Linear Forests",
"doi": null,
"abstractUrl": "/journal/td/2022/07/09609537/1yoxLa2YFO0",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08338404",
"articleId": "13rRUIJuxoa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08372460",
"articleId": "13rRUwbs2f9",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx7ouKv",
"title": "March-April",
"year": "2020",
"issueNum": "02",
"idPrefix": "tb",
"pubType": "journal",
"volume": "17",
"label": "March-April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45Xh13sh",
"doi": "10.1109/TCBB.2019.2894699",
"abstract": "The choice of the state space representation of a system can turn into a prominent advantage or burden in any endeavour to mathematically model dynamical systems since it entails the analytical tractability of the related modelling formalism and the efficiency of the numerical computation. The Reaction-Based Model (RBM) of the state space, which is presented in this article, is a novel formalization of the kinetics of a system of interacting molecules. According to our representation, the state <inline-formula><tex-math notation=\"LaTeX\">Z_$S_\\mu$_Z</tex-math></inline-formula> of a system of <inline-formula><tex-math notation=\"LaTeX\">Z_$M$_Z</tex-math></inline-formula> reactions and <inline-formula><tex-math notation=\"LaTeX\">Z_$N$_Z</tex-math></inline-formula> molecular species, is identified with the occurrence of the reaction <inline-formula><tex-math notation=\"LaTeX\">Z_$R_\\mu$_Z</tex-math></inline-formula> (<inline-formula><tex-math notation=\"LaTeX\">Z_$\\mu = 1, \\dots, M$_Z</tex-math></inline-formula>). The transition between any two states <inline-formula><tex-math notation=\"LaTeX\">Z_$S_\\mu$_Z</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">Z_$S_\\nu$_Z</tex-math></inline-formula> is modelled as a first-order reaction <inline-formula><tex-math notation=\"LaTeX\">Z_$S_\\mu \\rightarrow S_\\nu$_Z</tex-math></inline-formula> and described by mass action-like equation for the partial time derivative of the variables <inline-formula><tex-math notation=\"LaTeX\">Z_$P(S_\\mu, t)$_Z</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">Z_$P(S_\\nu, t)$_Z</tex-math></inline-formula>, which denote the probabilities that the system lies in the two states, respectively. The rate equations for the state probabilities are coupled with those for the abundance of molecular species. Altogether, the rate equations along with the specification of the initial conditions define the Cauchy problem whose solution describes the time-evolution of the system. The RBM has been applied to a typical severely stiff biological case study. The numerical solutions of the system's dynamics turned out to be computationally more efficient and in agreement with the results of the stochastic and hybrid stochastic/deterministic simulation algorithms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The choice of the state space representation of a system can turn into a prominent advantage or burden in any endeavour to mathematically model dynamical systems since it entails the analytical tractability of the related modelling formalism and the efficiency of the numerical computation. The Reaction-Based Model (RBM) of the state space, which is presented in this article, is a novel formalization of the kinetics of a system of interacting molecules. According to our representation, the state <inline-formula><tex-math notation=\"LaTeX\">$S_\\mu$</tex-math><alternatives><mml:math><mml:msub><mml:mi>S</mml:mi><mml:mi>μ</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"lecca-ieq1-2894699.gif\"/></alternatives></inline-formula> of a system of <inline-formula><tex-math notation=\"LaTeX\">$M$</tex-math><alternatives><mml:math><mml:mi>M</mml:mi></mml:math><inline-graphic xlink:href=\"lecca-ieq2-2894699.gif\"/></alternatives></inline-formula> reactions and <inline-formula><tex-math notation=\"LaTeX\">$N$</tex-math><alternatives><mml:math><mml:mi>N</mml:mi></mml:math><inline-graphic xlink:href=\"lecca-ieq3-2894699.gif\"/></alternatives></inline-formula> molecular species, is identified with the occurrence of the reaction <inline-formula><tex-math notation=\"LaTeX\">$R_\\mu$</tex-math><alternatives><mml:math><mml:msub><mml:mi>R</mml:mi><mml:mi>μ</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"lecca-ieq4-2894699.gif\"/></alternatives></inline-formula> (<inline-formula><tex-math notation=\"LaTeX\">$\\mu = 1, \\dots, M$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>μ</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>⋯</mml:mo><mml:mo>,</mml:mo><mml:mi>M</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href=\"lecca-ieq5-2894699.gif\"/></alternatives></inline-formula>). The transition between any two states <inline-formula><tex-math notation=\"LaTeX\">$S_\\mu$</tex-math><alternatives><mml:math><mml:msub><mml:mi>S</mml:mi><mml:mi>μ</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"lecca-ieq6-2894699.gif\"/></alternatives></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">$S_\\nu$</tex-math><alternatives><mml:math><mml:msub><mml:mi>S</mml:mi><mml:mi>ν</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"lecca-ieq7-2894699.gif\"/></alternatives></inline-formula> is modelled as a first-order reaction <inline-formula><tex-math notation=\"LaTeX\">$S_\\mu \\rightarrow S_\\nu$</tex-math><alternatives><mml:math><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>μ</mml:mi></mml:msub><mml:mo>→</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mi>ν</mml:mi></mml:msub></mml:mrow></mml:math><inline-graphic xlink:href=\"lecca-ieq8-2894699.gif\"/></alternatives></inline-formula> and described by mass action-like equation for the partial time derivative of the variables <inline-formula><tex-math notation=\"LaTeX\">$P(S_\\mu, t)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mi>μ</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"lecca-ieq9-2894699.gif\"/></alternatives></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">$P(S_\\nu, t)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mi>ν</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"lecca-ieq10-2894699.gif\"/></alternatives></inline-formula>, which denote the probabilities that the system lies in the two states, respectively. The rate equations for the state probabilities are coupled with those for the abundance of molecular species. Altogether, the rate equations along with the specification of the initial conditions define the Cauchy problem whose solution describes the time-evolution of the system. The RBM has been applied to a typical severely stiff biological case study. The numerical solutions of the system's dynamics turned out to be computationally more efficient and in agreement with the results of the stochastic and hybrid stochastic/deterministic simulation algorithms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The choice of the state space representation of a system can turn into a prominent advantage or burden in any endeavour to mathematically model dynamical systems since it entails the analytical tractability of the related modelling formalism and the efficiency of the numerical computation. The Reaction-Based Model (RBM) of the state space, which is presented in this article, is a novel formalization of the kinetics of a system of interacting molecules. According to our representation, the state - of a system of - reactions and - molecular species, is identified with the occurrence of the reaction - (-). The transition between any two states - and - is modelled as a first-order reaction - and described by mass action-like equation for the partial time derivative of the variables - and -, which denote the probabilities that the system lies in the two states, respectively. The rate equations for the state probabilities are coupled with those for the abundance of molecular species. Altogether, the rate equations along with the specification of the initial conditions define the Cauchy problem whose solution describes the time-evolution of the system. The RBM has been applied to a typical severely stiff biological case study. The numerical solutions of the system's dynamics turned out to be computationally more efficient and in agreement with the results of the stochastic and hybrid stochastic/deterministic simulation algorithms.",
"title": "A Reaction-Based Model of the State Space of Chemical Reaction Systems Enables Efficient Simulations",
"normalizedTitle": "A Reaction-Based Model of the State Space of Chemical Reaction Systems Enables Efficient Simulations",
"fno": "08624452",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Mathematical Model",
"Computational Modeling",
"Chemicals",
"Numerical Models",
"Stochastic Processes",
"Biological System Modeling",
"Heuristic Algorithms",
"Chemical Kinetics",
"Biochemical Networks",
"Stiff Dynamics",
"Deterministic Models",
"Stochastic Simulation Algorithms"
],
"authors": [
{
"givenName": "Paola",
"surname": "Lecca",
"fullName": "Paola Lecca",
"affiliation": "Faculty of Computer Science, Free University of Bozen-Bolzano, Bolzano, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Angela",
"surname": "Re",
"fullName": "Angela Re",
"affiliation": "Systems and Synthetic Biology Laboratory, Centre for Sustainable Future Technologies, Fondazione Istituto Italiano di Tecnologia, Torino, Italy",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2020-03-01 00:00:00",
"pubType": "trans",
"pages": "469-482",
"year": "2020",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tc/2019/04/08494787",
"title": "Better Circuits for Binary Polynomial Multiplication",
"doi": null,
"abstractUrl": "/journal/tc/2019/04/08494787/14s8M4Sn2IE",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/01/09681162",
"title": "Point Cloud Sampling via Graph Balancing and Gershgorin Disc Alignment",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09681162/1A8c6sY0Afe",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2022/02/09690063",
"title": "Algebraic Attacks on Block Ciphers Using Quantum Annealing",
"doi": null,
"abstractUrl": "/journal/ec/2022/02/09690063/1AlCiyYAakw",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/12/09729476",
"title": "Solving Consensus in True Partial Synchrony",
"doi": null,
"abstractUrl": "/journal/td/2022/12/09729476/1Byafq1ui4w",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2023/01/09930647",
"title": "The High Faulty Tolerant Capability of the Alternating Group Graphs",
"doi": null,
"abstractUrl": "/journal/td/2023/01/09930647/1HMP3UkhGus",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/08933488",
"title": "Dynamic Voronoi Diagram for Moving Disks",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/08933488/1fOf96QTKQE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/01/09037115",
"title": "Aligning Points to Lines: Provable Approximations",
"doi": null,
"abstractUrl": "/journal/tk/2022/01/09037115/1igMO6tI3Is",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2021/11/09099372",
"title": "On Heterogeneous Sensing Capability for Distributed Rendezvous in Cognitive Radio Networks",
"doi": null,
"abstractUrl": "/journal/tm/2021/11/09099372/1k7oCRHzGAE",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/09/09266749",
"title": "Easy-But-Effective Domain Sub-Similarity Learning for Transfer Regression",
"doi": null,
"abstractUrl": "/journal/tk/2022/09/09266749/1oZxqu9nYcg",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/10/09664360",
"title": "Hybrid Annealing Method Based on subQUBO Model Extraction With Multiple Solution Instances",
"doi": null,
"abstractUrl": "/journal/tc/2022/10/09664360/1zHDJ2qBROo",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08462790",
"articleId": "13w3lphXmIE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07264987",
"articleId": "13rRUytnsVs",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyuya0W",
"title": "April",
"year": "2019",
"issueNum": "04",
"idPrefix": "td",
"pubType": "journal",
"volume": "30",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "18l6N8lHxpS",
"doi": "10.1109/TPDS.2018.2871135",
"abstract": "In a large-scale computing cluster, the job completions can be substantially delayed due to two sources of variability, namely, variability in the job size and that in the machine service capacity. To tackle this issue, existing works have proposed various scheduling algorithms which exploit redundancy wherein a job runs on multiple servers until the first completes. In this paper, we explore the impact of variability in the machine service capacity and adopt a rigorous analytical approach to design scheduling algorithms using redundancy and checkpointing. We design several online algorithms which can dynamically vary the number of redundant copies for jobs. We also provide new theoretical performance bounds for these algorithms in terms of the overall job flowtime by introducing the notion of a speedup function, based on which a novel potential function can be defined to enable the corresponding competitive ratio analysis. In particular, by adopting the online primal-dual fitting approach, we prove that our SRPT+R Algorithm in a non-multitasking cluster is <inline-formula><tex-math notation=\"LaTeX\">Z_$(1+\\epsilon)$_Z</tex-math></inline-formula>-speed, <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ O(\\frac{1}{\\epsilon })$_Z</tex-math></inline-formula>-competitive. We also show that our proposed Fair+R and LAPS+R(<inline-formula><tex-math notation=\"LaTeX\">Z_$\\beta$_Z</tex-math></inline-formula>) Algorithms for a multitasking cluster are <inline-formula><tex-math notation=\"LaTeX\">Z_$(4+\\epsilon)$_Z</tex-math></inline-formula>-speed, <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ O(\\frac{1}{\\epsilon })$_Z</tex-math></inline-formula>-competitive and (<inline-formula><tex-math notation=\"LaTeX\">Z_$2 + 2\\beta + 2\\epsilon)$_Z</tex-math></inline-formula>-speed <inline-formula><tex-math notation=\"LaTeX\">Z_$O(\\frac{1}{\\beta \\epsilon })$_Z</tex-math></inline-formula>-competitive respectively. We demonstrate via extensive simulations that our proposed algorithms can significantly reduce job flowtime under both the non-multitasking and multitasking modes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In a large-scale computing cluster, the job completions can be substantially delayed due to two sources of variability, namely, variability in the job size and that in the machine service capacity. To tackle this issue, existing works have proposed various scheduling algorithms which exploit redundancy wherein a job runs on multiple servers until the first completes. In this paper, we explore the impact of variability in the machine service capacity and adopt a rigorous analytical approach to design scheduling algorithms using redundancy and checkpointing. We design several online algorithms which can dynamically vary the number of redundant copies for jobs. We also provide new theoretical performance bounds for these algorithms in terms of the overall job flowtime by introducing the notion of a speedup function, based on which a novel potential function can be defined to enable the corresponding competitive ratio analysis. In particular, by adopting the online primal-dual fitting approach, we prove that our SRPT+R Algorithm in a non-multitasking cluster is <inline-formula><tex-math notation=\"LaTeX\">$(1+\\epsilon)$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>ε</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"xu-ieq1-2871135.gif\"/></alternatives><alternatives><mml:math><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>ε</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"xu-ieq1-2871135.gif\"/></alternatives></inline-formula>-speed, <inline-formula><tex-math notation=\"LaTeX\">$\\ O(\\frac{1}{\\epsilon })$</tex-math><alternatives><mml:math><mml:mrow><mml:mspace width=\"4pt\"/><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>ε</mml:mi></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"xu-ieq2-2871135.gif\"/></alternatives><alternatives><mml:math><mml:mrow><mml:mspace width=\"4pt\"/><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>ε</mml:mi></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"xu-ieq2-2871135.gif\"/></alternatives></inline-formula>-competitive. We also show that our proposed Fair+R and LAPS+R(<inline-formula><tex-math notation=\"LaTeX\">$\\beta$</tex-math><alternatives><mml:math><mml:mi>β</mml:mi></mml:math><inline-graphic xlink:href=\"xu-ieq3-2871135.gif\"/></alternatives><alternatives><mml:math><mml:mi>β</mml:mi></mml:math><inline-graphic xlink:href=\"xu-ieq3-2871135.gif\"/></alternatives></inline-formula>) Algorithms for a multitasking cluster are <inline-formula><tex-math notation=\"LaTeX\">$(4+\\epsilon)$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mo>+</mml:mo><mml:mi>ε</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"xu-ieq4-2871135.gif\"/></alternatives><alternatives><mml:math><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mo>+</mml:mo><mml:mi>ε</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"xu-ieq4-2871135.gif\"/></alternatives></inline-formula>-speed, <inline-formula><tex-math notation=\"LaTeX\">$\\ O(\\frac{1}{\\epsilon })$</tex-math><alternatives><mml:math><mml:mrow><mml:mspace width=\"4pt\"/><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>ε</mml:mi></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"xu-ieq5-2871135.gif\"/></alternatives><alternatives><mml:math><mml:mrow><mml:mspace width=\"4pt\"/><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>ε</mml:mi></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"xu-ieq5-2871135.gif\"/></alternatives></inline-formula>-competitive and (<inline-formula><tex-math notation=\"LaTeX\">$2 + 2\\beta + 2\\epsilon)$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>2</mml:mn><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:mi>β</mml:mi><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:mi>ε</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"xu-ieq6-2871135.gif\"/></alternatives><alternatives><mml:math><mml:mrow><mml:mn>2</mml:mn><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:mi>β</mml:mi><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:mi>ε</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"xu-ieq6-2871135.gif\"/></alternatives></inline-formula>-speed <inline-formula><tex-math notation=\"LaTeX\">$O(\\frac{1}{\\beta \\epsilon })$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>β</mml:mi><mml:mi>ε</mml:mi></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"xu-ieq7-2871135.gif\"/></alternatives><alternatives><mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>β</mml:mi><mml:mi>ε</mml:mi></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"xu-ieq7-2871135.gif\"/></alternatives></inline-formula>-competitive respectively. We demonstrate via extensive simulations that our proposed algorithms can significantly reduce job flowtime under both the non-multitasking and multitasking modes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In a large-scale computing cluster, the job completions can be substantially delayed due to two sources of variability, namely, variability in the job size and that in the machine service capacity. To tackle this issue, existing works have proposed various scheduling algorithms which exploit redundancy wherein a job runs on multiple servers until the first completes. In this paper, we explore the impact of variability in the machine service capacity and adopt a rigorous analytical approach to design scheduling algorithms using redundancy and checkpointing. We design several online algorithms which can dynamically vary the number of redundant copies for jobs. We also provide new theoretical performance bounds for these algorithms in terms of the overall job flowtime by introducing the notion of a speedup function, based on which a novel potential function can be defined to enable the corresponding competitive ratio analysis. In particular, by adopting the online primal-dual fitting approach, we prove that our SRPT+R Algorithm in a non-multitasking cluster is --speed, --competitive. We also show that our proposed Fair+R and LAPS+R(-) Algorithms for a multitasking cluster are --speed, --competitive and (--speed --competitive respectively. We demonstrate via extensive simulations that our proposed algorithms can significantly reduce job flowtime under both the non-multitasking and multitasking modes.",
"title": "Online Job Scheduling with Redundancy and Opportunistic Checkpointing: A Speedup-Function-Based Analysis",
"normalizedTitle": "Online Job Scheduling with Redundancy and Opportunistic Checkpointing: A Speedup-Function-Based Analysis",
"fno": "08468118",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Redundancy",
"Multitasking",
"Checkpointing",
"Clustering Algorithms",
"Task Analysis",
"Scheduling Algorithms",
"Servers",
"Online Scheduling",
"Redundancy",
"Optimization",
"Competitive Analysis",
"Dual Fitting",
"Potential Function"
],
"authors": [
{
"givenName": "Huanle",
"surname": "Xu",
"fullName": "Huanle Xu",
"affiliation": "School of Computer Science and Network Security, Dongguan University of Technology, Dongguan, Guangdong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gustavo",
"surname": "De Veciana",
"fullName": "Gustavo De Veciana",
"affiliation": "Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, TX, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wing Cheong",
"surname": "Lau",
"fullName": "Wing Cheong Lau",
"affiliation": "Department of Information Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kunxiao",
"surname": "Zhou",
"fullName": "Kunxiao Zhou",
"affiliation": "School of Computer Science and Network Security, Dongguan University of Technology, Dongguan, Guangdong, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2019-04-01 00:00:00",
"pubType": "trans",
"pages": "897-909",
"year": "2019",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tk/2023/05/09712197",
"title": "Fast LDP-MST: An Efficient Density-Peak-Based Clustering Method for Large-Size Datasets",
"doi": null,
"abstractUrl": "/journal/tk/2023/05/09712197/1AUkecqbRok",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2022/02/09690063",
"title": "Algebraic Attacks on Block Ciphers Using Quantum Annealing",
"doi": null,
"abstractUrl": "/journal/ec/2022/02/09690063/1AlCiyYAakw",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/12/09732663",
"title": "Optimal Convex Hull Formation on a Grid by Asynchronous Robots With Lights",
"doi": null,
"abstractUrl": "/journal/td/2022/12/09732663/1BD8Qcr91gQ",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2020/06/08976264",
"title": "Algorithms for Inversion Mod <inline-formula><tex-math notation="LaTeX">Z_$p^k$_Z</tex-math></inline-formula>",
"doi": null,
"abstractUrl": "/journal/tc/2020/06/08976264/1h0W7qmGRHO",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/01/09037115",
"title": "Aligning Points to Lines: Provable Approximations",
"doi": null,
"abstractUrl": "/journal/tk/2022/01/09037115/1igMO6tI3Is",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2022/08/09314216",
"title": "On the Computation of Virtual Backbones With Fault Tolerance in Heterogeneous Wireless Sensor Networks",
"doi": null,
"abstractUrl": "/journal/tm/2022/08/09314216/1q8U7q756O4",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/10/09448388",
"title": "A Hybrid Stochastic-Deterministic Minibatch Proximal Gradient Method for Efficient Optimization and Generalization",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09448388/1ugE3BTixLq",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/01/09456991",
"title": "A Clinical Dataset and Various Baselines for Chromosome Instance Segmentation",
"doi": null,
"abstractUrl": "/journal/tb/2022/01/09456991/1utV0kh5nA4",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/08/09535309",
"title": "A Fluid Scheduling Algorithm for DAG Tasks With Constrained or Arbitrary Deadlines",
"doi": null,
"abstractUrl": "/journal/tc/2022/08/09535309/1wMERb5iAV2",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/04/09650532",
"title": "A Variational Framework for Curve Shortening in Various Geometric Domains",
"doi": null,
"abstractUrl": "/journal/tg/2023/04/09650532/1zkoVsoJeow",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08466019",
"articleId": "13zn9dhR25W",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08466657",
"articleId": "18l6Oxr9hF6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1M2Ido7rZde",
"title": "May",
"year": "2023",
"issueNum": "05",
"idPrefix": "tk",
"pubType": "journal",
"volume": "35",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1AUkecqbRok",
"doi": "10.1109/TKDE.2022.3150403",
"abstract": "Recently, a new density-peak-based clustering method, called clustering with local density peaks-based minimum spanning tree (LDP-MST), was proposed, which has several attractive merits, e.g., being able to detect arbitrarily shaped clusters and not very sensitive to noise and parameters. Nevertheless, we also found the limitation of LDP-MST in efficiency. Specifically, LDP-MST has <inline-formula><tex-math notation=\"LaTeX\">Z_$O(N\\log N+M^{2})$_Z</tex-math></inline-formula> time, where <inline-formula><tex-math notation=\"LaTeX\">Z_$N$_Z</tex-math></inline-formula> denotes the dataset size and <inline-formula><tex-math notation=\"LaTeX\">Z_$M$_Z</tex-math></inline-formula> is an intermediate variable denoting the number of local density peaks. As our experimental results reveal, when processing large-size datasets, the value of <inline-formula><tex-math notation=\"LaTeX\">Z_$M$_Z</tex-math></inline-formula> could be very large and consequently those steps of LDP-MST involving <inline-formula><tex-math notation=\"LaTeX\">Z_$O(M^{2})$_Z</tex-math></inline-formula> time term would be time-consuming. And in the worst case, the value of <inline-formula><tex-math notation=\"LaTeX\">Z_$M$_Z</tex-math></inline-formula> could be very close to that of <inline-formula><tex-math notation=\"LaTeX\">Z_$N$_Z</tex-math></inline-formula>, which means that the time complexity of LDP-MST could be <inline-formula><tex-math notation=\"LaTeX\">Z_$O(N^{2})$_Z</tex-math></inline-formula> in the worst case of <inline-formula><tex-math notation=\"LaTeX\">Z_$M$_Z</tex-math></inline-formula>. In this study, we use more efficient algorithms to implement those steps of LDP-MST that involve the <inline-formula><tex-math notation=\"LaTeX\">Z_$O(M^{2})$_Z</tex-math></inline-formula> time term such that the proposed method, Fast LDP-MST, has <inline-formula><tex-math notation=\"LaTeX\">Z_$O(N\\log N)$_Z</tex-math></inline-formula> time complexity even if <inline-formula><tex-math notation=\"LaTeX\">Z_$M\\approx N$_Z</tex-math></inline-formula>. Our experiments demonstrate that Fast LDP-MST is overall more efficient than LDP-MST on large-size datasets, without sacrificing the merits of LDP-MST in effectiveness, robustness, and user-friendliness.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recently, a new density-peak-based clustering method, called clustering with local density peaks-based minimum spanning tree (LDP-MST), was proposed, which has several attractive merits, e.g., being able to detect arbitrarily shaped clusters and not very sensitive to noise and parameters. Nevertheless, we also found the limitation of LDP-MST in efficiency. Specifically, LDP-MST has <inline-formula><tex-math notation=\"LaTeX\">$O(N\\log N+M^{2})$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:mi>N</mml:mi><mml:mo form=\"prefix\">log</mml:mo><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:msup><mml:mi>M</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"qiu-ieq1-3150403.gif\"/></alternatives></inline-formula> time, where <inline-formula><tex-math notation=\"LaTeX\">$N$</tex-math><alternatives><mml:math><mml:mi>N</mml:mi></mml:math><inline-graphic xlink:href=\"qiu-ieq2-3150403.gif\"/></alternatives></inline-formula> denotes the dataset size and <inline-formula><tex-math notation=\"LaTeX\">$M$</tex-math><alternatives><mml:math><mml:mi>M</mml:mi></mml:math><inline-graphic xlink:href=\"qiu-ieq3-3150403.gif\"/></alternatives></inline-formula> is an intermediate variable denoting the number of local density peaks. As our experimental results reveal, when processing large-size datasets, the value of <inline-formula><tex-math notation=\"LaTeX\">$M$</tex-math><alternatives><mml:math><mml:mi>M</mml:mi></mml:math><inline-graphic xlink:href=\"qiu-ieq4-3150403.gif\"/></alternatives></inline-formula> could be very large and consequently those steps of LDP-MST involving <inline-formula><tex-math notation=\"LaTeX\">$O(M^{2})$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:msup><mml:mi>M</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"qiu-ieq5-3150403.gif\"/></alternatives></inline-formula> time term would be time-consuming. And in the worst case, the value of <inline-formula><tex-math notation=\"LaTeX\">$M$</tex-math><alternatives><mml:math><mml:mi>M</mml:mi></mml:math><inline-graphic xlink:href=\"qiu-ieq6-3150403.gif\"/></alternatives></inline-formula> could be very close to that of <inline-formula><tex-math notation=\"LaTeX\">$N$</tex-math><alternatives><mml:math><mml:mi>N</mml:mi></mml:math><inline-graphic xlink:href=\"qiu-ieq7-3150403.gif\"/></alternatives></inline-formula>, which means that the time complexity of LDP-MST could be <inline-formula><tex-math notation=\"LaTeX\">$O(N^{2})$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:msup><mml:mi>N</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"qiu-ieq8-3150403.gif\"/></alternatives></inline-formula> in the worst case of <inline-formula><tex-math notation=\"LaTeX\">$M$</tex-math><alternatives><mml:math><mml:mi>M</mml:mi></mml:math><inline-graphic xlink:href=\"qiu-ieq9-3150403.gif\"/></alternatives></inline-formula>. In this study, we use more efficient algorithms to implement those steps of LDP-MST that involve the <inline-formula><tex-math notation=\"LaTeX\">$O(M^{2})$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:msup><mml:mi>M</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"qiu-ieq10-3150403.gif\"/></alternatives></inline-formula> time term such that the proposed method, Fast LDP-MST, has <inline-formula><tex-math notation=\"LaTeX\">$O(N\\log N)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:mi>N</mml:mi><mml:mo form=\"prefix\">log</mml:mo><mml:mi>N</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"qiu-ieq11-3150403.gif\"/></alternatives></inline-formula> time complexity even if <inline-formula><tex-math notation=\"LaTeX\">$M\\approx N$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>M</mml:mi><mml:mo>≈</mml:mo><mml:mi>N</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href=\"qiu-ieq12-3150403.gif\"/></alternatives></inline-formula>. Our experiments demonstrate that Fast LDP-MST is overall more efficient than LDP-MST on large-size datasets, without sacrificing the merits of LDP-MST in effectiveness, robustness, and user-friendliness.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recently, a new density-peak-based clustering method, called clustering with local density peaks-based minimum spanning tree (LDP-MST), was proposed, which has several attractive merits, e.g., being able to detect arbitrarily shaped clusters and not very sensitive to noise and parameters. Nevertheless, we also found the limitation of LDP-MST in efficiency. Specifically, LDP-MST has - time, where - denotes the dataset size and - is an intermediate variable denoting the number of local density peaks. As our experimental results reveal, when processing large-size datasets, the value of - could be very large and consequently those steps of LDP-MST involving - time term would be time-consuming. And in the worst case, the value of - could be very close to that of -, which means that the time complexity of LDP-MST could be - in the worst case of -. In this study, we use more efficient algorithms to implement those steps of LDP-MST that involve the - time term such that the proposed method, Fast LDP-MST, has - time complexity even if -. Our experiments demonstrate that Fast LDP-MST is overall more efficient than LDP-MST on large-size datasets, without sacrificing the merits of LDP-MST in effectiveness, robustness, and user-friendliness.",
"title": "Fast LDP-MST: An Efficient Density-Peak-Based Clustering Method for Large-Size Datasets",
"normalizedTitle": "Fast LDP-MST: An Efficient Density-Peak-Based Clustering Method for Large-Size Datasets",
"fno": "09712197",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Computational Complexity",
"Pattern Clustering",
"Trees Mathematics",
"Arbitrarily Shaped Cluster Detection",
"Density Peak Based Clustering",
"Large Size Datasets",
"LDP MST",
"Local Density Peaks Based Minimum Spanning Tree",
"Time Complexity",
"Clustering Methods",
"Time Complexity",
"Robustness",
"Visualization",
"Sensitivity",
"Directed Acyclic Graph",
"Clustering Algorithms",
"Density Peak Based Clustering",
"In Tree",
"Minimal Spanning Tree",
"Large Size Datasets"
],
"authors": [
{
"givenName": "Teng",
"surname": "Qiu",
"fullName": "Teng Qiu",
"affiliation": "Key Laboratory for Neuroinformation of Ministry of Education, Center for Information in BioMedicine, University of Electronic Science and Technology of China, Chengdu, Sichuan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yong-Jie",
"surname": "Li",
"fullName": "Yong-Jie Li",
"affiliation": "Key Laboratory for Neuroinformation of Ministry of Education, Center for Information in BioMedicine, University of Electronic Science and Technology of China, Chengdu, Sichuan, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2023-05-01 00:00:00",
"pubType": "trans",
"pages": "4767-4780",
"year": "2023",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/td/2019/04/08468118",
"title": "Online Job Scheduling with Redundancy and Opportunistic Checkpointing: A Speedup-Function-Based Analysis",
"doi": null,
"abstractUrl": "/journal/td/2019/04/08468118/18l6N8lHxpS",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/06/09723546",
"title": "Multicriteria Scalable Graph Drawing via Stochastic Gradient Descent, <inline-formula><tex-math notation=\"LaTeX\">Z_$(SGD)^{2}$_Z</tex-math></inline-formula>",
"doi": null,
"abstractUrl": "/journal/tg/2022/06/09723546/1BocJwdaFYk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2022/03/09827923",
"title": "PMNS for Efficient Arithmetic and Small Memory Cost",
"doi": null,
"abstractUrl": "/journal/ec/2022/03/09827923/1EWSBFUfd6M",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/08964488",
"title": "Efficient Compression and Indexing for Highly Repetitive DNA Sequence Collections",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/08964488/1gLZGsjhZkc",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2021/10/09194366",
"title": "A Novel Measurement for Network Reliability",
"doi": null,
"abstractUrl": "/journal/tc/2021/10/09194366/1n0EqDZV3X2",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/08/09244575",
"title": "Distributed Density Peaks Clustering Revisited",
"doi": null,
"abstractUrl": "/journal/tk/2022/08/09244575/1ojYk1yEY1i",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/05/09423579",
"title": "Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks",
"doi": null,
"abstractUrl": "/journal/tc/2022/05/09423579/1tkyeT8TOwg",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/07/09585362",
"title": "A Fast <inline-formula><tex-math notation=\"LaTeX\">Z_$f(r,k+1)/k$_Z</tex-math></inline-formula>-Diagnosis for Interconnection Networks Under MM* Model",
"doi": null,
"abstractUrl": "/journal/td/2022/07/09585362/1y11LlQdiGk",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/07/09609537",
"title": "Hamiltonian Paths of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-ary <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula>-cubes Avoiding Faulty Links and Passing Through Prescribed Linear Forests",
"doi": null,
"abstractUrl": "/journal/td/2022/07/09609537/1yoxLa2YFO0",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/10/09665221",
"title": "An Efficient Index-Based Approach to Distributed Set Reachability on Small-World Graphs",
"doi": null,
"abstractUrl": "/journal/td/2022/10/09665221/1zJiQNKABEs",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09681361",
"articleId": "1A8c6cHLoe4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09695194",
"articleId": "1AvqHcyRqbS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1M2IohaphVS",
"name": "ttk202305-09712197s1-supp1-3150403.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttk202305-09712197s1-supp1-3150403.pdf",
"extension": "pdf",
"size": "1.93 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyUFfN4",
"title": "June",
"year": "2020",
"issueNum": "06",
"idPrefix": "tc",
"pubType": "journal",
"volume": "69",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1h0W7qmGRHO",
"doi": "10.1109/TC.2020.2970411",
"abstract": "This article describes and analyzes all existing algorithms for computing <inline-formula><tex-math notation=\"LaTeX\">Z_$x=a^{-1}\\pmod {p^k}$_Z</tex-math></inline-formula> for a prime <inline-formula><tex-math notation=\"LaTeX\">Z_$p$_Z</tex-math></inline-formula>, and also introduces a new algorithm based on the exact solution of linear equations using <inline-formula><tex-math notation=\"LaTeX\">Z_$p$_Z</tex-math></inline-formula>-adic expansions. The algorithm starts with the initial value <inline-formula><tex-math notation=\"LaTeX\">Z_$c=a^{-1}\\pmod {p}$_Z</tex-math></inline-formula> and iteratively computes the digits of the inverse <inline-formula><tex-math notation=\"LaTeX\">Z_$x=a^{-1}\\pmod {p^k}$_Z</tex-math></inline-formula> in base <inline-formula><tex-math notation=\"LaTeX\">Z_$p$_Z</tex-math></inline-formula>. The mod 2 version of the algorithm is more efficient than all existing algorithms for small values of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>. Moreover, it stands out as being the only one that works for any <inline-formula><tex-math notation=\"LaTeX\">Z_$p$_Z</tex-math></inline-formula>, any <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>, and digit-by-digit. While the new algorithm is asymptotically worse off, it requires the minimal number of arithmetic operations (just a single addition) per step, as compared to all existing algorithms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This article describes and analyzes all existing algorithms for computing <inline-formula><tex-math notation=\"LaTeX\">$x=a^{-1}\\pmod {p^k}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>x</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mi>a</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mspace width=\"4.44443pt\"/><mml:mrow><mml:mo>(</mml:mo><mml:mo form=\"prefix\">mod</mml:mo><mml:mspace width=\"0.277778em\"/><mml:msup><mml:mi>p</mml:mi><mml:mi>k</mml:mi></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xlink:href=\"koc-ieq2-2970411.gif\"/></alternatives></inline-formula> for a prime <inline-formula><tex-math notation=\"LaTeX\">$p$</tex-math><alternatives><mml:math><mml:mi>p</mml:mi></mml:math><inline-graphic xlink:href=\"koc-ieq3-2970411.gif\"/></alternatives></inline-formula>, and also introduces a new algorithm based on the exact solution of linear equations using <inline-formula><tex-math notation=\"LaTeX\">$p$</tex-math><alternatives><mml:math><mml:mi>p</mml:mi></mml:math><inline-graphic xlink:href=\"koc-ieq4-2970411.gif\"/></alternatives></inline-formula>-adic expansions. The algorithm starts with the initial value <inline-formula><tex-math notation=\"LaTeX\">$c=a^{-1}\\pmod {p}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>c</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mi>a</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mspace width=\"4.44443pt\"/><mml:mrow><mml:mo>(</mml:mo><mml:mo form=\"prefix\">mod</mml:mo><mml:mspace width=\"0.277778em\"/><mml:mi>p</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xlink:href=\"koc-ieq5-2970411.gif\"/></alternatives></inline-formula> and iteratively computes the digits of the inverse <inline-formula><tex-math notation=\"LaTeX\">$x=a^{-1}\\pmod {p^k}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>x</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mi>a</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mspace width=\"4.44443pt\"/><mml:mrow><mml:mo>(</mml:mo><mml:mo form=\"prefix\">mod</mml:mo><mml:mspace width=\"0.277778em\"/><mml:msup><mml:mi>p</mml:mi><mml:mi>k</mml:mi></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xlink:href=\"koc-ieq6-2970411.gif\"/></alternatives></inline-formula> in base <inline-formula><tex-math notation=\"LaTeX\">$p$</tex-math><alternatives><mml:math><mml:mi>p</mml:mi></mml:math><inline-graphic xlink:href=\"koc-ieq7-2970411.gif\"/></alternatives></inline-formula>. The mod 2 version of the algorithm is more efficient than all existing algorithms for small values of <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"koc-ieq8-2970411.gif\"/></alternatives></inline-formula>. Moreover, it stands out as being the only one that works for any <inline-formula><tex-math notation=\"LaTeX\">$p$</tex-math><alternatives><mml:math><mml:mi>p</mml:mi></mml:math><inline-graphic xlink:href=\"koc-ieq9-2970411.gif\"/></alternatives></inline-formula>, any <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"koc-ieq10-2970411.gif\"/></alternatives></inline-formula>, and digit-by-digit. While the new algorithm is asymptotically worse off, it requires the minimal number of arithmetic operations (just a single addition) per step, as compared to all existing algorithms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This article describes and analyzes all existing algorithms for computing - for a prime -, and also introduces a new algorithm based on the exact solution of linear equations using --adic expansions. The algorithm starts with the initial value - and iteratively computes the digits of the inverse - in base -. The mod 2 version of the algorithm is more efficient than all existing algorithms for small values of -. Moreover, it stands out as being the only one that works for any -, any -, and digit-by-digit. While the new algorithm is asymptotically worse off, it requires the minimal number of arithmetic operations (just a single addition) per step, as compared to all existing algorithms.",
"title": "Algorithms for Inversion Mod <inline-formula><tex-math notation="LaTeX">Z_$p^k$_Z</tex-math></inline-formula>",
"normalizedTitle": "Algorithms for Inversion Mod -",
"fno": "08976264",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Boolean Algebra",
"Computational Complexity",
"Linear Equations",
"Inversion Mod P Sup K Sup",
"P Adic Expansions",
"Arithmetic Operations",
"Software Algorithms",
"Iterative Algorithms",
"Indexes",
"Digital Arithmetic",
"Hardware",
"Software",
"Public Key Cryptography",
"Number Theoretic Algorithms",
"Computer Arithmetic",
"Multiplicative Inverse"
],
"authors": [
{
"givenName": "Cetin Kaya",
"surname": "Koc",
"fullName": "Cetin Kaya Koc",
"affiliation": "İstinye University, İstanbul, Turkey",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2020-06-01 00:00:00",
"pubType": "trans",
"pages": "907-913",
"year": "2020",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tb/2019/06/08371302",
"title": "Efficient Algorithms for Finding the Closest <inline-formula><tex-math notation=\"LaTeX\">Z_$l$_Z</tex-math></inline-formula>-Mers in Biological Data",
"doi": null,
"abstractUrl": "/journal/tb/2019/06/08371302/13rRUxlgyai",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/04/09869301",
"title": "Fast Quaternion Product Units for Learning Disentangled Representations in <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathbb {SO}(3)$_Z</tex-math></inline-formula>",
"doi": null,
"abstractUrl": "/journal/tp/2023/04/09869301/1GeV0aWtLOM",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/07/09189818",
"title": "Fully Dynamic <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-Center Clustering With Improved Memory Efficiency",
"doi": null,
"abstractUrl": "/journal/tk/2022/07/09189818/1mYZ9fnEFq0",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/06/09445629",
"title": "Up to <inline-formula><tex-math notation=\"LaTeX\">Z_$8k$_Z</tex-math></inline-formula>-bit Modular Montgomery Multiplication in Residue Number Systems With Fast 16-bit Residue Channels",
"doi": null,
"abstractUrl": "/journal/tc/2022/06/09445629/1uaauvs6N0c",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/02/09492838",
"title": "Maximum Signed <inline-formula><tex-math notation=\"LaTeX\">Z_$\\theta$_Z</tex-math></inline-formula>-Clique Identification in Large Signed Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2023/02/09492838/1vq0EU6lrAA",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09525250",
"title": "Fast Reachability Queries Answering Based on <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathsf{RCN}$_Z</tex-math></inline-formula> Reduction",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09525250/1wuoOp439OU",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/07/09585362",
"title": "A Fast <inline-formula><tex-math notation=\"LaTeX\">Z_$f(r,k+1)/k$_Z</tex-math></inline-formula>-Diagnosis for Interconnection Networks Under MM* Model",
"doi": null,
"abstractUrl": "/journal/td/2022/07/09585362/1y11LlQdiGk",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2023/01/09616383",
"title": "<inline-formula><tex-math notation=\"LaTeX\">Z_$xAFCL$_Z</tex-math></inline-formula>: Run Scalable Function Choreographies Across Multiple FaaS Systems",
"doi": null,
"abstractUrl": "/journal/sc/2023/01/09616383/1yA74qnPV4c",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/07/09609537",
"title": "Hamiltonian Paths of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-ary <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula>-cubes Avoiding Faulty Links and Passing Through Prescribed Linear Forests",
"doi": null,
"abstractUrl": "/journal/td/2022/07/09609537/1yoxLa2YFO0",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/11/09650723",
"title": "<inline-formula><tex-math notation=\"LaTeX\">Z_$TC-Stream$_Z</tex-math></inline-formula>: Large-Scale Graph Triangle Counting on a Single Machine Using GPUs",
"doi": null,
"abstractUrl": "/journal/td/2022/11/09650723/1zkp1OCIUHS",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08972610",
"articleId": "1gXC1rZUG9W",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08976261",
"articleId": "1h0W7enz1aU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1z985rMTIxG",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tk",
"pubType": "journal",
"volume": "34",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1igMO6tI3Is",
"doi": "10.1109/TKDE.2020.2980836",
"abstract": "We suggest a new optimization technique for minimizing the sum <inline-formula><tex-math notation=\"LaTeX\">Z_$\\sum _{i=1}^n g_i(x)$_Z</tex-math></inline-formula> of <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula> non-convex real functions that satisfy a property that we call piecewise log-Lipschitz. This is by forging links between techniques in computational geometry, combinatorics and convex optimization. As an example application, we provide the first constant-factor approximation algorithms whose running-times are polynomial in <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula> for the fundamental problem of <italic>Points-to-Lines alignment</italic>: Given <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula> points <inline-formula><tex-math notation=\"LaTeX\">Z_$p_1,\\ldots,p_n$_Z</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula> lines <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _1,\\ldots,\\ell _n$_Z</tex-math></inline-formula> on the plane and <inline-formula><tex-math notation=\"LaTeX\">Z_$z>0$_Z</tex-math></inline-formula>, compute the matching <inline-formula><tex-math notation=\"LaTeX\">Z_$\\pi :[n]\\to [n]$_Z</tex-math></inline-formula> and alignment (rotation matrix <inline-formula><tex-math notation=\"LaTeX\">Z_$R$_Z</tex-math></inline-formula> and translation vector <inline-formula><tex-math notation=\"LaTeX\">Z_$t$_Z</tex-math></inline-formula>) that minimize the sum of euclidean distances <inline-formula><tex-math notation=\"LaTeX\">Z_$\\sum _{i=1}^n \\mathrm{dist}(Rp_i-t,\\ell _{\\pi (i)})^z$_Z</tex-math></inline-formula> between each point to its corresponding line. This problem is non-trivial even if <inline-formula><tex-math notation=\"LaTeX\">Z_$z=1$_Z</tex-math></inline-formula> and the matching <inline-formula><tex-math notation=\"LaTeX\">Z_$\\pi$_Z</tex-math></inline-formula> is given. If <inline-formula><tex-math notation=\"LaTeX\">Z_$\\pi$_Z</tex-math></inline-formula> is given, our algorithms run in <inline-formula><tex-math notation=\"LaTeX\">Z_$O(n^3)$_Z</tex-math></inline-formula> time, and even near-linear in <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula> using core-sets that support: streaming, dynamic, and distributed parallel computations in poly-logarithmic update time. Generalizations for handling e.g., outliers or pseudo-distances such as <inline-formula><tex-math notation=\"LaTeX\">Z_$M$_Z</tex-math></inline-formula>-estimators for the problem are also provided. Experimental results and open source code show that our algorithms improve existing heuristics also in practice. A companion demonstration video in the context of Augmented Reality shows how such algorithms may be used in real-time systems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We suggest a new optimization technique for minimizing the sum <inline-formula><tex-math notation=\"LaTeX\">$\\sum _{i=1}^n g_i(x)$</tex-math><alternatives><mml:math><mml:mrow><mml:msubsup><mml:mo>∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:msub><mml:mi>g</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xlink:href=\"jubran-ieq1-2980836.gif\"/></alternatives></inline-formula> of <inline-formula><tex-math notation=\"LaTeX\">$n$</tex-math><alternatives><mml:math><mml:mi>n</mml:mi></mml:math><inline-graphic xlink:href=\"jubran-ieq2-2980836.gif\"/></alternatives></inline-formula> non-convex real functions that satisfy a property that we call piecewise log-Lipschitz. This is by forging links between techniques in computational geometry, combinatorics and convex optimization. As an example application, we provide the first constant-factor approximation algorithms whose running-times are polynomial in <inline-formula><tex-math notation=\"LaTeX\">$n$</tex-math><alternatives><mml:math><mml:mi>n</mml:mi></mml:math><inline-graphic xlink:href=\"jubran-ieq3-2980836.gif\"/></alternatives></inline-formula> for the fundamental problem of <italic>Points-to-Lines alignment</italic>: Given <inline-formula><tex-math notation=\"LaTeX\">$n$</tex-math><alternatives><mml:math><mml:mi>n</mml:mi></mml:math><inline-graphic xlink:href=\"jubran-ieq4-2980836.gif\"/></alternatives></inline-formula> points <inline-formula><tex-math notation=\"LaTeX\">$p_1,\\ldots,p_n$</tex-math><alternatives><mml:math><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>...</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math><inline-graphic xlink:href=\"jubran-ieq5-2980836.gif\"/></alternatives></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">$n$</tex-math><alternatives><mml:math><mml:mi>n</mml:mi></mml:math><inline-graphic xlink:href=\"jubran-ieq6-2980836.gif\"/></alternatives></inline-formula> lines <inline-formula><tex-math notation=\"LaTeX\">$\\ell _1,\\ldots,\\ell _n$</tex-math><alternatives><mml:math><mml:mrow><mml:msub><mml:mi>ℓ</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>...</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>ℓ</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math><inline-graphic xlink:href=\"jubran-ieq7-2980836.gif\"/></alternatives></inline-formula> on the plane and <inline-formula><tex-math notation=\"LaTeX\">$z>0$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>z</mml:mi><mml:mo>></mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math><inline-graphic xlink:href=\"jubran-ieq8-2980836.gif\"/></alternatives></inline-formula>, compute the matching <inline-formula><tex-math notation=\"LaTeX\">$\\pi :[n]\\to [n]$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>π</mml:mi><mml:mo>:</mml:mo><mml:mo>[</mml:mo><mml:mi>n</mml:mi><mml:mo>]</mml:mo><mml:mo>→</mml:mo><mml:mo>[</mml:mo><mml:mi>n</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"jubran-ieq9-2980836.gif\"/></alternatives></inline-formula> and alignment (rotation matrix <inline-formula><tex-math notation=\"LaTeX\">$R$</tex-math><alternatives><mml:math><mml:mi>R</mml:mi></mml:math><inline-graphic xlink:href=\"jubran-ieq10-2980836.gif\"/></alternatives></inline-formula> and translation vector <inline-formula><tex-math notation=\"LaTeX\">$t$</tex-math><alternatives><mml:math><mml:mi>t</mml:mi></mml:math><inline-graphic xlink:href=\"jubran-ieq11-2980836.gif\"/></alternatives></inline-formula>) that minimize the sum of euclidean distances <inline-formula><tex-math notation=\"LaTeX\">$\\sum _{i=1}^n \\mathrm{dist}(Rp_i-t,\\ell _{\\pi (i)})^z$</tex-math><alternatives><mml:math><mml:mrow><mml:msubsup><mml:mo>∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:mi> dist </mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>R</mml:mi><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>ℓ</mml:mi><mml:mrow><mml:mi>π</mml:mi><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mi>z</mml:mi></mml:msup></mml:mrow></mml:math><inline-graphic xlink:href=\"jubran-ieq12-2980836.gif\"/></alternatives></inline-formula> between each point to its corresponding line. This problem is non-trivial even if <inline-formula><tex-math notation=\"LaTeX\">$z=1$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>z</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math><inline-graphic xlink:href=\"jubran-ieq13-2980836.gif\"/></alternatives></inline-formula> and the matching <inline-formula><tex-math notation=\"LaTeX\">$\\pi$</tex-math><alternatives><mml:math><mml:mi>π</mml:mi></mml:math><inline-graphic xlink:href=\"jubran-ieq14-2980836.gif\"/></alternatives></inline-formula> is given. If <inline-formula><tex-math notation=\"LaTeX\">$\\pi$</tex-math><alternatives><mml:math><mml:mi>π</mml:mi></mml:math><inline-graphic xlink:href=\"jubran-ieq15-2980836.gif\"/></alternatives></inline-formula> is given, our algorithms run in <inline-formula><tex-math notation=\"LaTeX\">$O(n^3)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:msup><mml:mi>n</mml:mi><mml:mn>3</mml:mn></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"jubran-ieq16-2980836.gif\"/></alternatives></inline-formula> time, and even near-linear in <inline-formula><tex-math notation=\"LaTeX\">$n$</tex-math><alternatives><mml:math><mml:mi>n</mml:mi></mml:math><inline-graphic xlink:href=\"jubran-ieq17-2980836.gif\"/></alternatives></inline-formula> using core-sets that support: streaming, dynamic, and distributed parallel computations in poly-logarithmic update time. Generalizations for handling e.g., outliers or pseudo-distances such as <inline-formula><tex-math notation=\"LaTeX\">$M$</tex-math><alternatives><mml:math><mml:mi>M</mml:mi></mml:math><inline-graphic xlink:href=\"jubran-ieq18-2980836.gif\"/></alternatives></inline-formula>-estimators for the problem are also provided. Experimental results and open source code show that our algorithms improve existing heuristics also in practice. A companion demonstration video in the context of Augmented Reality shows how such algorithms may be used in real-time systems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We suggest a new optimization technique for minimizing the sum - of - non-convex real functions that satisfy a property that we call piecewise log-Lipschitz. This is by forging links between techniques in computational geometry, combinatorics and convex optimization. As an example application, we provide the first constant-factor approximation algorithms whose running-times are polynomial in - for the fundamental problem of Points-to-Lines alignment: Given - points - and - lines - on the plane and -, compute the matching - and alignment (rotation matrix - and translation vector -) that minimize the sum of euclidean distances - between each point to its corresponding line. This problem is non-trivial even if - and the matching - is given. If - is given, our algorithms run in - time, and even near-linear in - using core-sets that support: streaming, dynamic, and distributed parallel computations in poly-logarithmic update time. Generalizations for handling e.g., outliers or pseudo-distances such as --estimators for the problem are also provided. Experimental results and open source code show that our algorithms improve existing heuristics also in practice. A companion demonstration video in the context of Augmented Reality shows how such algorithms may be used in real-time systems.",
"title": "Aligning Points to Lines: Provable Approximations",
"normalizedTitle": "Aligning Points to Lines: Provable Approximations",
"fno": "09037115",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Approximation Theory",
"Big Data",
"Computational Complexity",
"Computational Geometry",
"Concave Programming",
"Convex Programming",
"Matrix Algebra",
"Minimisation",
"Parallel Processing",
"Vectors",
"Optimization Technique",
"Computational Geometry",
"Convex Optimization",
"Constant Factor Approximation",
"Points To Lines Alignment",
"Translation Vector",
"Euclidean Distances",
"Parallel Computations",
"Poly Logarithmic Update Time",
"Pseudodistances",
"Non Convex Real Functions",
"Piecewise Log Lipschitz",
"Rotation Matrix",
"Big Data",
"Heuristic Algorithms",
"Cost Function",
"Big Data",
"Two Dimensional Displays",
"Three Dimensional Displays",
"Computational Modeling",
"Approximation Algorithms",
"Non Convex Optimization",
"Visual Tracking",
"Points To Lines Alignment",
"Coresets"
],
"authors": [
{
"givenName": "Ibrahim",
"surname": "Jubran",
"fullName": "Ibrahim Jubran",
"affiliation": "Computer Science Department, Robotics & Big Data Lab, University of Haifa, Haifa, Israel",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dan",
"surname": "Feldman",
"fullName": "Dan Feldman",
"affiliation": "Computer Science Department, Robotics & Big Data Lab, University of Haifa, Haifa, Israel",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "138-149",
"year": "2022",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tp/2023/01/09681162",
"title": "Point Cloud Sampling via Graph Balancing and Gershgorin Disc Alignment",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09681162/1A8c6sY0Afe",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/05/09925098",
"title": "The Proxy Step-Size Technique for Regularized Optimization on the Sphere Manifold",
"doi": null,
"abstractUrl": "/journal/tp/2023/05/09925098/1HBHVijhpLi",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/05/09925111",
"title": "Analytical Tensor Voting in ND Space and its Properties",
"doi": null,
"abstractUrl": "/journal/tp/2023/05/09925111/1HBHWeQCASc",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/01/09040652",
"title": "Fastest Path Query Answering using Time-Dependent Hop-Labeling in Road Network",
"doi": null,
"abstractUrl": "/journal/tk/2022/01/09040652/1iiwVUuWSVa",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/06/09294112",
"title": "Geometry-Aware Generation of Adversarial Point Clouds",
"doi": null,
"abstractUrl": "/journal/tp/2022/06/09294112/1pA8gc6H8dO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/08/09373914",
"title": "A Practical <inline-formula><tex-math notation=\"LaTeX\">Z_$O(N^2)$_Z</tex-math></inline-formula> Outlier Removal Method for Correspondence-Based Point Cloud Registration",
"doi": null,
"abstractUrl": "/journal/tp/2022/08/09373914/1rPt9ICFlCw",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/12/09573484",
"title": "Adaptive Temporal Difference Learning With Linear Function Approximation",
"doi": null,
"abstractUrl": "/journal/tp/2022/12/09573484/1xH5DVmWYP6",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/07/09585362",
"title": "A Fast <inline-formula><tex-math notation=\"LaTeX\">Z_$f(r,k+1)/k$_Z</tex-math></inline-formula>-Diagnosis for Interconnection Networks Under MM* Model",
"doi": null,
"abstractUrl": "/journal/td/2022/07/09585362/1y11LlQdiGk",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/07/09609537",
"title": "Hamiltonian Paths of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-ary <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula>-cubes Avoiding Faulty Links and Passing Through Prescribed Linear Forests",
"doi": null,
"abstractUrl": "/journal/td/2022/07/09609537/1yoxLa2YFO0",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/04/09650532",
"title": "A Variational Framework for Curve Shortening in Various Geometric Domains",
"doi": null,
"abstractUrl": "/journal/tg/2023/04/09650532/1zkoVsoJeow",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09035469",
"articleId": "1iaesdIjCVi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09034023",
"articleId": "1i8zwuwFSrC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1z988giNwEU",
"name": "ttk202201-09037115s1-supp1-2980836.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttk202201-09037115s1-supp1-2980836.pdf",
"extension": "pdf",
"size": "931 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1BzPxbqLS6I",
"title": "April",
"year": "2022",
"issueNum": "04",
"idPrefix": "tk",
"pubType": "journal",
"volume": "34",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1kMT4CxqinC",
"doi": "10.1109/TKDE.2020.3003701",
"abstract": "The maximum clique problem (<italic>MCP</italic>) has various applications to reveal the structure and function of graphs. Graphs are constantly updated in the real life. However, no algorithm is specifically designed for dynamic graph. Although <italic>MCP</italic> in dynamic graphs can be solved by simply invoking a state-of-the-art static approach, such as <italic>PMC</italic>, when the graph is updated, such an approach of simply re-calculating from scratch is inefficient. The key issue with <italic>MCP</italic> algorithm is to find a large clique, namely a <italic>seed</italic>, as fast as possible. Thus, search space can be pruned based on the seed. Size of the seed greedily found by <italic>PMC</italic> cannot be guaranteed, as it fluctuates considerably. Moreover, the time required to find a seed under <italic>PMC</italic> is up to <inline-formula><tex-math notation=\"LaTeX\">Z_$O(| E| \\cdot \\Delta (G))$_Z</tex-math></inline-formula>, where <inline-formula><tex-math notation=\"LaTeX\">Z_$\\Delta (G)$_Z</tex-math></inline-formula> is the highest degree in <italic>G</italic>. In this article, we intend to find a sizable seed by updating the previous maximum clique with the incident vertices of the inserted/deleted edge. Size of the seed now is guaranteed to be no less than <inline-formula><tex-math notation=\"LaTeX\">Z_$\\omega (G^{\\prime})\\; - \\;1$_Z</tex-math></inline-formula>, where <inline-formula><tex-math notation=\"LaTeX\">Z_$\\omega (G^{\\prime})$_Z</tex-math></inline-formula> is the size of the maximum clique on the updated graph. Moreover, the seed can be found in a time complexity of <inline-formula><tex-math notation=\"LaTeX\">Z_$O(\\Delta (G)^{2})$_Z</tex-math></inline-formula>. Two other crucial issues related to the <italic>MCP</italic> in dynamic graphs are refreshing rate and refreshing overhead. After a tight upper bound is imposed on <inline-formula><tex-math notation=\"LaTeX\">Z_$\\omega (G^{\\prime})$_Z</tex-math></inline-formula>, the necessity of refreshing is evaluated by comparing the seed with its largest challenger, then unnecessary refreshing is wiped out effectively. The size of the largest challenger is judiciously estimated using a lazy growth strategy. Subsequently, the search space in refreshing is confined on a much smaller subgraph using a local refreshing strategy. Extensive experiments indicate that the proposed approach outperforms the baseline algorithm by approximately one order of magnitude.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The maximum clique problem (<italic>MCP</italic>) has various applications to reveal the structure and function of graphs. Graphs are constantly updated in the real life. However, no algorithm is specifically designed for dynamic graph. Although <italic>MCP</italic> in dynamic graphs can be solved by simply invoking a state-of-the-art static approach, such as <italic>PMC</italic>, when the graph is updated, such an approach of simply re-calculating from scratch is inefficient. The key issue with <italic>MCP</italic> algorithm is to find a large clique, namely a <italic>seed</italic>, as fast as possible. Thus, search space can be pruned based on the seed. Size of the seed greedily found by <italic>PMC</italic> cannot be guaranteed, as it fluctuates considerably. Moreover, the time required to find a seed under <italic>PMC</italic> is up to <inline-formula><tex-math notation=\"LaTeX\">$O(| E| \\cdot \\Delta (G))$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:mo>|</mml:mo><mml:mi>E</mml:mi><mml:mo>|</mml:mo><mml:mo>·</mml:mo><mml:mi>Δ</mml:mi><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"sun-ieq1-3003701.gif\"/></alternatives></inline-formula>, where <inline-formula><tex-math notation=\"LaTeX\">$\\Delta (G)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>Δ</mml:mi><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"sun-ieq2-3003701.gif\"/></alternatives></inline-formula> is the highest degree in <italic>G</italic>. In this article, we intend to find a sizable seed by updating the previous maximum clique with the incident vertices of the inserted/deleted edge. Size of the seed now is guaranteed to be no less than <inline-formula><tex-math notation=\"LaTeX\">$\\omega (G^{\\prime})\\; - \\;1$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>ω</mml:mi><mml:mo>(</mml:mo><mml:msup><mml:mi>G</mml:mi><mml:mo>'</mml:mo></mml:msup><mml:mo>)</mml:mo><mml:mspace width=\"0.166667em\"/><mml:mo>-</mml:mo><mml:mspace width=\"0.166667em\"/><mml:mn>1</mml:mn></mml:mrow></mml:math><inline-graphic xlink:href=\"sun-ieq3-3003701.gif\"/></alternatives></inline-formula>, where <inline-formula><tex-math notation=\"LaTeX\">$\\omega (G^{\\prime})$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>ω</mml:mi><mml:mo>(</mml:mo><mml:msup><mml:mi>G</mml:mi><mml:mo>'</mml:mo></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"sun-ieq4-3003701.gif\"/></alternatives></inline-formula> is the size of the maximum clique on the updated graph. Moreover, the seed can be found in a time complexity of <inline-formula><tex-math notation=\"LaTeX\">$O(\\Delta (G)^{2})$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:mi>Δ</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"sun-ieq5-3003701.gif\"/></alternatives></inline-formula>. Two other crucial issues related to the <italic>MCP</italic> in dynamic graphs are refreshing rate and refreshing overhead. After a tight upper bound is imposed on <inline-formula><tex-math notation=\"LaTeX\">$\\omega (G^{\\prime})$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>ω</mml:mi><mml:mo>(</mml:mo><mml:msup><mml:mi>G</mml:mi><mml:mo>'</mml:mo></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"sun-ieq6-3003701.gif\"/></alternatives></inline-formula>, the necessity of refreshing is evaluated by comparing the seed with its largest challenger, then unnecessary refreshing is wiped out effectively. The size of the largest challenger is judiciously estimated using a lazy growth strategy. Subsequently, the search space in refreshing is confined on a much smaller subgraph using a local refreshing strategy. Extensive experiments indicate that the proposed approach outperforms the baseline algorithm by approximately one order of magnitude.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The maximum clique problem (MCP) has various applications to reveal the structure and function of graphs. Graphs are constantly updated in the real life. However, no algorithm is specifically designed for dynamic graph. Although MCP in dynamic graphs can be solved by simply invoking a state-of-the-art static approach, such as PMC, when the graph is updated, such an approach of simply re-calculating from scratch is inefficient. The key issue with MCP algorithm is to find a large clique, namely a seed, as fast as possible. Thus, search space can be pruned based on the seed. Size of the seed greedily found by PMC cannot be guaranteed, as it fluctuates considerably. Moreover, the time required to find a seed under PMC is up to -, where - is the highest degree in G. In this article, we intend to find a sizable seed by updating the previous maximum clique with the incident vertices of the inserted/deleted edge. Size of the seed now is guaranteed to be no less than -, where - is the size of the maximum clique on the updated graph. Moreover, the seed can be found in a time complexity of -. Two other crucial issues related to the MCP in dynamic graphs are refreshing rate and refreshing overhead. After a tight upper bound is imposed on -, the necessity of refreshing is evaluated by comparing the seed with its largest challenger, then unnecessary refreshing is wiped out effectively. The size of the largest challenger is judiciously estimated using a lazy growth strategy. Subsequently, the search space in refreshing is confined on a much smaller subgraph using a local refreshing strategy. Extensive experiments indicate that the proposed approach outperforms the baseline algorithm by approximately one order of magnitude.",
"title": "Continuous Monitoring of Maximum Clique Over Dynamic Graphs",
"normalizedTitle": "Continuous Monitoring of Maximum Clique Over Dynamic Graphs",
"fno": "09121771",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Computational Complexity",
"Graph Theory",
"Dynamic Graph",
"Maximum Clique Problem",
"State Of The Art Static Approach",
"PMC",
"MCP Algorithm",
"Sizable Seed",
"Previous Maximum Clique",
"Updated Graph",
"Continuous Monitoring",
"Maximum Clique Over Dynamic Graphs",
"Search Space",
"Incident Vertices",
"Deleted Edge",
"Inserted Edge",
"Time Complexity",
"Lazy Growth Strategy",
"Baseline Algorithm",
"Heuristic Algorithms",
"Approximation Algorithms",
"Partitioning Algorithms",
"Sun",
"Time Complexity",
"Size Measurement",
"Classification Algorithms",
"Maximum Clique Problem",
"Dynamic Graphs",
"Seed Acquisition",
"Refreshing Rate",
"Refreshing Overhead"
],
"authors": [
{
"givenName": "Shengli",
"surname": "Sun",
"fullName": "Shengli Sun",
"affiliation": "School of Software and Microelectronics, Peking University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Weiping",
"surname": "Li",
"fullName": "Weiping Li",
"affiliation": "School of Software and Microelectronics, Peking University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yimo",
"surname": "Wang",
"fullName": "Yimo Wang",
"affiliation": "School of Software and Microelectronics, Peking University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Weilong",
"surname": "Liao",
"fullName": "Weilong Liao",
"affiliation": "School of Software and Microelectronics, Peking University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Philip S.",
"surname": "Yu",
"fullName": "Philip S. Yu",
"affiliation": "Department of Computer Science, University of Illinois at Chicago, Chicago, IL, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2022-04-01 00:00:00",
"pubType": "trans",
"pages": "1667-1683",
"year": "2022",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tp/2022/12/09677460",
"title": "Fast and Accurate Least-Mean-Squares Solvers for High Dimensional Data",
"doi": null,
"abstractUrl": "/journal/tp/2022/12/09677460/1A4So1C0azu",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/12/09007415",
"title": "Flexible Aggregate Nearest Neighbor Queries and its Keyword-Aware Variant on Road Networks",
"doi": null,
"abstractUrl": "/journal/tk/2021/12/09007415/1hJKhc0u1So",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/03/09099413",
"title": "GBNRS: A Novel Rough Set Algorithm for Fast Adaptive Attribute Reduction in Classification",
"doi": null,
"abstractUrl": "/journal/tk/2022/03/09099413/1k7otCmGVzi",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/09/09250607",
"title": "Enumerating Maximum Cliques in Massive Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2022/09/09250607/1oxjS6MBaA8",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2022/06/09351686",
"title": "Mining Diversified Top-<inline-formula><tex-math notation=\"LaTeX\">Z_$r$_Z</tex-math></inline-formula> Lasting Cohesive Subgraphs on Temporal Networks",
"doi": null,
"abstractUrl": "/journal/bd/2022/06/09351686/1r4ZEAVxQQg",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/01/09442937",
"title": "Efficient Approximate Range Aggregation Over Large-Scale Spatial Data Federation",
"doi": null,
"abstractUrl": "/journal/tk/2023/01/09442937/1tWJ3Oxhv8c",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/01/09456991",
"title": "A Clinical Dataset and Various Baselines for Chromosome Instance Segmentation",
"doi": null,
"abstractUrl": "/journal/tb/2022/01/09456991/1utV0kh5nA4",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/06/09511805",
"title": "Distributed Graph Realizations",
"doi": null,
"abstractUrl": "/journal/td/2022/06/09511805/1vYRJ00nBTi",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/02/09492838",
"title": "Maximum Signed <inline-formula><tex-math notation=\"LaTeX\">Z_$\\theta$_Z</tex-math></inline-formula>-Clique Identification in Large Signed Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2023/02/09492838/1vq0EU6lrAA",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/04/09650532",
"title": "A Variational Framework for Curve Shortening in Various Geometric Domains",
"doi": null,
"abstractUrl": "/journal/tg/2023/04/09650532/1zkoVsoJeow",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09109662",
"articleId": "1kpEsLSEthK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09110764",
"articleId": "1kuDg24PMm4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1D81g68Z5ra",
"title": "June",
"year": "2022",
"issueNum": "06",
"idPrefix": "tm",
"pubType": "journal",
"volume": "21",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1oijtIm7Ecg",
"doi": "10.1109/TMC.2020.3034479",
"abstract": "Wireless powered mobile edge computing (WP-MEC) has been widely studied as a promising technology to liberate wireless terminals from the computation-intensive and energy-consuming tasks. This article considers a WP-MEC system consisting of multiple base stations (BSs) and mobile devices (MDs), where the MDs offload tasks to the BSs for computational resources and the BSs charge the MDs using wireless power transfer (WPT). In practice, each BS and MD are equipped with a task buffer with limited size and a battery with limited capacity. First, we develop a time slotted WP-MEC system with task and energy queuing dynamics to study long-term system performance under time-varying fading channels and stochastic task and energy arrivals. Second, we propose a dynamic throughput maximum (DTM) algorithm based on perturbed Lyapunov optimization to maximize the system throughput under task and energy queue stability constraints, by optimizing the allocation of communication, computation, and energy resources. For the DTM algorithm, we characterize a throughput-backlog trade-off of [<inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {O}(1/V)$_Z</tex-math></inline-formula>, <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {O}(V)$_Z</tex-math></inline-formula>] to indicate that the system throughput goes up as the queue backlog increases, where <inline-formula><tex-math notation=\"LaTeX\">Z_$V$_Z</tex-math></inline-formula> is a control parameter between the system throughput and the queue backlog. However, we find that, as <inline-formula><tex-math notation=\"LaTeX\">Z_$V$_Z</tex-math></inline-formula> goes large, the system throughput can be pushed arbitrarily close to the optimum at the cost of linearly increasing queue backlog (i.e., <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {O}(V)$_Z</tex-math></inline-formula>). To reduce the cost, we further develop an improved dynamic throughput maximum (IDTM) algorithm, and verify that the IDTM algorithm can achieve a trade-off of [<inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {O}(1/V)$_Z</tex-math></inline-formula>, <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {O}((\\log (V))^2)$_Z</tex-math></inline-formula>] between the system throughput and the queue backlog. The simulation results demonstrate that IDTM retains close system throughput to DTM with only <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {O}((\\log (V))^2)$_Z</tex-math></inline-formula> queue backlog.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Wireless powered mobile edge computing (WP-MEC) has been widely studied as a promising technology to liberate wireless terminals from the computation-intensive and energy-consuming tasks. This article considers a WP-MEC system consisting of multiple base stations (BSs) and mobile devices (MDs), where the MDs offload tasks to the BSs for computational resources and the BSs charge the MDs using wireless power transfer (WPT). In practice, each BS and MD are equipped with a task buffer with limited size and a battery with limited capacity. First, we develop a time slotted WP-MEC system with task and energy queuing dynamics to study long-term system performance under time-varying fading channels and stochastic task and energy arrivals. Second, we propose a dynamic throughput maximum (DTM) algorithm based on perturbed Lyapunov optimization to maximize the system throughput under task and energy queue stability constraints, by optimizing the allocation of communication, computation, and energy resources. For the DTM algorithm, we characterize a throughput-backlog trade-off of [<inline-formula><tex-math notation=\"LaTeX\">$\\mathcal {O}(1/V)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi mathvariant=\"script\">O</mml:mi><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mi>V</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"shi-ieq1-3034479.gif\"/></alternatives></inline-formula>, <inline-formula><tex-math notation=\"LaTeX\">$\\mathcal {O}(V)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi mathvariant=\"script\">O</mml:mi><mml:mo>(</mml:mo><mml:mi>V</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"shi-ieq2-3034479.gif\"/></alternatives></inline-formula>] to indicate that the system throughput goes up as the queue backlog increases, where <inline-formula><tex-math notation=\"LaTeX\">$V$</tex-math><alternatives><mml:math><mml:mi>V</mml:mi></mml:math><inline-graphic xlink:href=\"shi-ieq3-3034479.gif\"/></alternatives></inline-formula> is a control parameter between the system throughput and the queue backlog. However, we find that, as <inline-formula><tex-math notation=\"LaTeX\">$V$</tex-math><alternatives><mml:math><mml:mi>V</mml:mi></mml:math><inline-graphic xlink:href=\"shi-ieq4-3034479.gif\"/></alternatives></inline-formula> goes large, the system throughput can be pushed arbitrarily close to the optimum at the cost of linearly increasing queue backlog (i.e., <inline-formula><tex-math notation=\"LaTeX\">$\\mathcal {O}(V)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi mathvariant=\"script\">O</mml:mi><mml:mo>(</mml:mo><mml:mi>V</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"shi-ieq5-3034479.gif\"/></alternatives></inline-formula>). To reduce the cost, we further develop an improved dynamic throughput maximum (IDTM) algorithm, and verify that the IDTM algorithm can achieve a trade-off of [<inline-formula><tex-math notation=\"LaTeX\">$\\mathcal {O}(1/V)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi mathvariant=\"script\">O</mml:mi><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mi>V</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"shi-ieq6-3034479.gif\"/></alternatives></inline-formula>, <inline-formula><tex-math notation=\"LaTeX\">$\\mathcal {O}((\\log (V))^2)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi mathvariant=\"script\">O</mml:mi><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mo form=\"prefix\">log</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>V</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"shi-ieq7-3034479.gif\"/></alternatives></inline-formula>] between the system throughput and the queue backlog. The simulation results demonstrate that IDTM retains close system throughput to DTM with only <inline-formula><tex-math notation=\"LaTeX\">$\\mathcal {O}((\\log (V))^2)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi mathvariant=\"script\">O</mml:mi><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mo form=\"prefix\">log</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>V</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"shi-ieq8-3034479.gif\"/></alternatives></inline-formula> queue backlog.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Wireless powered mobile edge computing (WP-MEC) has been widely studied as a promising technology to liberate wireless terminals from the computation-intensive and energy-consuming tasks. This article considers a WP-MEC system consisting of multiple base stations (BSs) and mobile devices (MDs), where the MDs offload tasks to the BSs for computational resources and the BSs charge the MDs using wireless power transfer (WPT). In practice, each BS and MD are equipped with a task buffer with limited size and a battery with limited capacity. First, we develop a time slotted WP-MEC system with task and energy queuing dynamics to study long-term system performance under time-varying fading channels and stochastic task and energy arrivals. Second, we propose a dynamic throughput maximum (DTM) algorithm based on perturbed Lyapunov optimization to maximize the system throughput under task and energy queue stability constraints, by optimizing the allocation of communication, computation, and energy resources. For the DTM algorithm, we characterize a throughput-backlog trade-off of [-, -] to indicate that the system throughput goes up as the queue backlog increases, where - is a control parameter between the system throughput and the queue backlog. However, we find that, as - goes large, the system throughput can be pushed arbitrarily close to the optimum at the cost of linearly increasing queue backlog (i.e., -). To reduce the cost, we further develop an improved dynamic throughput maximum (IDTM) algorithm, and verify that the IDTM algorithm can achieve a trade-off of [-, -] between the system throughput and the queue backlog. The simulation results demonstrate that IDTM retains close system throughput to DTM with only - queue backlog.",
"title": "Wireless Powered Mobile Edge Computing: Dynamic Resource Allocation and Throughput Maximization",
"normalizedTitle": "Wireless Powered Mobile Edge Computing: Dynamic Resource Allocation and Throughput Maximization",
"fno": "09242286",
"hasPdf": true,
"idPrefix": "tm",
"keywords": [
"Fading Channels",
"Mobile Computing",
"Optimisation",
"Queueing Theory",
"Radio Networks",
"Radiofrequency Power Transmission",
"Resource Allocation",
"Time Varying Channels",
"Wireless Powered Mobile Edge Computing",
"Dynamic Resource Allocation",
"Throughput Maximization",
"Wireless Terminals",
"Energy Consuming Tasks",
"WP MEC System",
"B Ss",
"Mobile Devices",
"M Ds Offload Tasks",
"Computational Resources",
"Wireless Power Transfer",
"Task Buffer",
"Long Term System Performance",
"Stochastic Task",
"System Throughput",
"Energy Queue Stability Constraints",
"Energy Resources",
"Throughput Backlog Trade Off",
"Queue Backlog",
"Improved Dynamic Throughput Maximum Algorithm",
"Task Analysis",
"Throughput",
"Heuristic Algorithms",
"Resource Management",
"Optimization",
"Servers",
"Wireless Communication",
"Mobile Edge Computing",
"Wireless Power Transfer",
"Lyapunov Optimization",
"Dynamic Throughput Maximum DTM"
],
"authors": [
{
"givenName": "Xiumei",
"surname": "Deng",
"fullName": "Xiumei Deng",
"affiliation": "School of Electronic and Optical Engineering, Nanjing University of Science and Technology, Nanjing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jun",
"surname": "Li",
"fullName": "Jun Li",
"affiliation": "School of Electronic and Optical Engineering, Nanjing University of Science and Technology, Nanjing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Long",
"surname": "Shi",
"fullName": "Long Shi",
"affiliation": "School of Electronic and Optical Engineering, Nanjing University of Science and Technology, Nanjing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhiqiang",
"surname": "Wei",
"fullName": "Zhiqiang Wei",
"affiliation": "School of Electrical Engineering and Telecommunications, University of New South Wales, Sydney, NSW, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaobo",
"surname": "Zhou",
"fullName": "Xiaobo Zhou",
"affiliation": "School of Physics and Electronic Engineering, Fuyang Normal University, Fuyang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jinhong",
"surname": "Yuan",
"fullName": "Jinhong Yuan",
"affiliation": "School of Electrical Engineering and Telecommunications, University of New South Wales, Sydney, NSW, Australia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2022-06-01 00:00:00",
"pubType": "trans",
"pages": "2271-2288",
"year": "2022",
"issn": "1536-1233",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/td/2019/04/08468118",
"title": "Online Job Scheduling with Redundancy and Opportunistic Checkpointing: A Speedup-Function-Based Analysis",
"doi": null,
"abstractUrl": "/journal/td/2019/04/08468118/18l6N8lHxpS",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2023/01/09930647",
"title": "The High Faulty Tolerant Capability of the Alternating Group Graphs",
"doi": null,
"abstractUrl": "/journal/td/2023/01/09930647/1HMP3UkhGus",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/08933488",
"title": "Dynamic Voronoi Diagram for Moving Disks",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/08933488/1fOf96QTKQE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2021/06/09007371",
"title": "On the Capacity of Fractal D2D Social Networks with Hierarchical Communications",
"doi": null,
"abstractUrl": "/journal/tm/2021/06/09007371/1hJKjvhn8nm",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/01/09037115",
"title": "Aligning Points to Lines: Provable Approximations",
"doi": null,
"abstractUrl": "/journal/tk/2022/01/09037115/1igMO6tI3Is",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2021/11/09099372",
"title": "On Heterogeneous Sensing Capability for Distributed Rendezvous in Cognitive Radio Networks",
"doi": null,
"abstractUrl": "/journal/tm/2021/11/09099372/1k7oCRHzGAE",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2022/02/09187550",
"title": "Towards More Secure Constructions of Adjustable Join Schemes",
"doi": null,
"abstractUrl": "/journal/tq/2022/02/09187550/1mVFLWkSEQU",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2022/08/09314216",
"title": "On the Computation of Virtual Backbones With Fault Tolerance in Heterogeneous Wireless Sensor Networks",
"doi": null,
"abstractUrl": "/journal/tm/2022/08/09314216/1q8U7q756O4",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2023/01/09387140",
"title": "Jamming in Eavesdropping on Throughput Maximization in Green Cognitive Radio Networks",
"doi": null,
"abstractUrl": "/journal/tm/2023/01/09387140/1sfXeUUjbkk",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2023/03/09525245",
"title": "Cost-Driven Data Caching in Edge-Based Content Delivery Networks",
"doi": null,
"abstractUrl": "/journal/tm/2023/03/09525245/1wuoYaX7TEY",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09244604",
"articleId": "1ojYDMmneKY",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1D81kGUCVY4",
"name": "ttm202206-09242286s1-supp1-3034479.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttm202206-09242286s1-supp1-3034479.pdf",
"extension": "pdf",
"size": "273 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1FAIkmT8BsQ",
"title": "Sept.",
"year": "2022",
"issueNum": "09",
"idPrefix": "tk",
"pubType": "journal",
"volume": "34",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1oxjS6MBaA8",
"doi": "10.1109/TKDE.2020.3036013",
"abstract": "Cliques refer to subgraphs in an undirected graph such that vertices in each subgraph are pairwise adjacent. The maximum clique problem, to find the clique with most vertices in a given graph, has been extensively studied. Besides its theoretical value as an NP-hard problem, the maximum clique problem is known to have direct applications in various fields, such as community search in social networks and social media, team formation in expert networks, gene expression and motif discovery in bioinformatics and anomaly detection in complex networks, revealing the structure and function of networks. However, algorithms designed for the maximum clique problem are expensive to deal with real-world networks. In this paper, we first devise a randomized algorithm for the maximum clique problem. Different from previous algorithms that search from each vertex one after another, our approach <italic>RMC</italic>, for the randomized maximum clique problem, employs a binary search while maintaining a lower bound <inline-formula><tex-math notation=\"LaTeX\">Z_$\\underline{\\omega _c}$_Z</tex-math></inline-formula> and an upper bound <inline-formula><tex-math notation=\"LaTeX\">Z_$\\overline{\\omega _c}$_Z</tex-math></inline-formula> of <inline-formula><tex-math notation=\"LaTeX\">Z_$\\omega (G)$_Z</tex-math></inline-formula>. In each iteration, <italic>RMC</italic> attempts to find a <inline-formula><tex-math notation=\"LaTeX\">Z_$\\omega _t$_Z</tex-math></inline-formula>-clique where <inline-formula><tex-math notation=\"LaTeX\">Z_$\\omega _t=\\lfloor (\\underline{\\omega _c}+\\overline{\\omega _c})/2\\rfloor$_Z</tex-math></inline-formula>. As finding <inline-formula><tex-math notation=\"LaTeX\">Z_$\\omega _t$_Z</tex-math></inline-formula> in each iteration is NP-complete, we extract a seed set <inline-formula><tex-math notation=\"LaTeX\">Z_$S$_Z</tex-math></inline-formula> such that the problem of finding a <inline-formula><tex-math notation=\"LaTeX\">Z_$\\omega _t$_Z</tex-math></inline-formula>-clique in <inline-formula><tex-math notation=\"LaTeX\">Z_$G$_Z</tex-math></inline-formula> is equivalent to finding a <inline-formula><tex-math notation=\"LaTeX\">Z_$\\omega _t$_Z</tex-math></inline-formula>-clique in <inline-formula><tex-math notation=\"LaTeX\">Z_$S$_Z</tex-math></inline-formula> with probability guarantees (<inline-formula><tex-math notation=\"LaTeX\">Z_$\\geq$_Z</tex-math></inline-formula><inline-formula><tex-math notation=\"LaTeX\">Z_$ 1-n^{-c}$_Z</tex-math></inline-formula>). We propose a novel iterative algorithm to determine the maximum clique by searching a <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-clique in <inline-formula><tex-math notation=\"LaTeX\">Z_$S$_Z</tex-math></inline-formula> starting from <inline-formula><tex-math notation=\"LaTeX\">Z_$k=\\underline{\\omega _c}+1$_Z</tex-math></inline-formula> until <inline-formula><tex-math notation=\"LaTeX\">Z_$S$_Z</tex-math></inline-formula> becomes <inline-formula><tex-math notation=\"LaTeX\">Z_$\\lbrace \\rbrace$_Z</tex-math></inline-formula>, when more iterations benefit marginally. Due to the potential inconsistency of maximum clique algorithms, we study the problem of maximum clique enumeration and propose an efficient algorithm <italic>RMCE</italic> to enumerate all maximum cliques in a given graph. As confirmed by the experiments, both <italic>RMC</italic> and <italic>RMCE</italic> are much more efficient and robust than previous solutions, <italic>RMC</italic> can always find the exact maximum clique, and <italic>RMCE</italic> can always enumerate all maximum cliques in a given graph.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Cliques refer to subgraphs in an undirected graph such that vertices in each subgraph are pairwise adjacent. The maximum clique problem, to find the clique with most vertices in a given graph, has been extensively studied. Besides its theoretical value as an NP-hard problem, the maximum clique problem is known to have direct applications in various fields, such as community search in social networks and social media, team formation in expert networks, gene expression and motif discovery in bioinformatics and anomaly detection in complex networks, revealing the structure and function of networks. However, algorithms designed for the maximum clique problem are expensive to deal with real-world networks. In this paper, we first devise a randomized algorithm for the maximum clique problem. Different from previous algorithms that search from each vertex one after another, our approach <italic>RMC</italic>, for the randomized maximum clique problem, employs a binary search while maintaining a lower bound <inline-formula><tex-math notation=\"LaTeX\">$\\underline{\\omega _c}$</tex-math><alternatives><mml:math><mml:munder><mml:msub><mml:mi>ω</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>̲</mml:mo></mml:munder></mml:math><inline-graphic xlink:href=\"lu-ieq1-3036013.gif\"/></alternatives></inline-formula> and an upper bound <inline-formula><tex-math notation=\"LaTeX\">$\\overline{\\omega _c}$</tex-math><alternatives><mml:math><mml:mover><mml:msub><mml:mi>ω</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>¯</mml:mo></mml:mover></mml:math><inline-graphic xlink:href=\"lu-ieq2-3036013.gif\"/></alternatives></inline-formula> of <inline-formula><tex-math notation=\"LaTeX\">$\\omega (G)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>ω</mml:mi><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"lu-ieq3-3036013.gif\"/></alternatives></inline-formula>. In each iteration, <italic>RMC</italic> attempts to find a <inline-formula><tex-math notation=\"LaTeX\">$\\omega _t$</tex-math><alternatives><mml:math><mml:msub><mml:mi>ω</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"lu-ieq4-3036013.gif\"/></alternatives></inline-formula>-clique where <inline-formula><tex-math notation=\"LaTeX\">$\\omega _t=\\lfloor (\\underline{\\omega _c}+\\overline{\\omega _c})/2\\rfloor$</tex-math><alternatives><mml:math><mml:mrow><mml:msub><mml:mi>ω</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>⌊</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:munder><mml:msub><mml:mi>ω</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>̲</mml:mo></mml:munder><mml:mo>+</mml:mo><mml:mover><mml:msub><mml:mi>ω</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>¯</mml:mo></mml:mover><mml:mo>)</mml:mo></mml:mrow><mml:mo>/</mml:mo><mml:mn>2</mml:mn><mml:mo>⌋</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xlink:href=\"lu-ieq5-3036013.gif\"/></alternatives></inline-formula>. As finding <inline-formula><tex-math notation=\"LaTeX\">$\\omega _t$</tex-math><alternatives><mml:math><mml:msub><mml:mi>ω</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"lu-ieq6-3036013.gif\"/></alternatives></inline-formula> in each iteration is NP-complete, we extract a seed set <inline-formula><tex-math notation=\"LaTeX\">$S$</tex-math><alternatives><mml:math><mml:mi>S</mml:mi></mml:math><inline-graphic xlink:href=\"lu-ieq7-3036013.gif\"/></alternatives></inline-formula> such that the problem of finding a <inline-formula><tex-math notation=\"LaTeX\">$\\omega _t$</tex-math><alternatives><mml:math><mml:msub><mml:mi>ω</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"lu-ieq8-3036013.gif\"/></alternatives></inline-formula>-clique in <inline-formula><tex-math notation=\"LaTeX\">$G$</tex-math><alternatives><mml:math><mml:mi>G</mml:mi></mml:math><inline-graphic xlink:href=\"lu-ieq9-3036013.gif\"/></alternatives></inline-formula> is equivalent to finding a <inline-formula><tex-math notation=\"LaTeX\">$\\omega _t$</tex-math><alternatives><mml:math><mml:msub><mml:mi>ω</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"lu-ieq10-3036013.gif\"/></alternatives></inline-formula>-clique in <inline-formula><tex-math notation=\"LaTeX\">$S$</tex-math><alternatives><mml:math><mml:mi>S</mml:mi></mml:math><inline-graphic xlink:href=\"lu-ieq11-3036013.gif\"/></alternatives></inline-formula> with probability guarantees (<inline-formula><tex-math notation=\"LaTeX\">$\\geq$</tex-math><alternatives><mml:math><mml:mo>≥</mml:mo></mml:math><inline-graphic xlink:href=\"lu-ieq12-3036013.gif\"/></alternatives></inline-formula><inline-formula><tex-math notation=\"LaTeX\">$ 1-n^{-c}$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:msup><mml:mi>n</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mi>c</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math><inline-graphic xlink:href=\"lu-ieq13-3036013.gif\"/></alternatives></inline-formula>). We propose a novel iterative algorithm to determine the maximum clique by searching a <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"lu-ieq14-3036013.gif\"/></alternatives></inline-formula>-clique in <inline-formula><tex-math notation=\"LaTeX\">$S$</tex-math><alternatives><mml:math><mml:mi>S</mml:mi></mml:math><inline-graphic xlink:href=\"lu-ieq15-3036013.gif\"/></alternatives></inline-formula> starting from <inline-formula><tex-math notation=\"LaTeX\">$k=\\underline{\\omega _c}+1$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:munder><mml:msub><mml:mi>ω</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>̲</mml:mo></mml:munder><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math><inline-graphic xlink:href=\"lu-ieq16-3036013.gif\"/></alternatives></inline-formula> until <inline-formula><tex-math notation=\"LaTeX\">$S$</tex-math><alternatives><mml:math><mml:mi>S</mml:mi></mml:math><inline-graphic xlink:href=\"lu-ieq17-3036013.gif\"/></alternatives></inline-formula> becomes <inline-formula><tex-math notation=\"LaTeX\">$\\lbrace \\rbrace$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>{</mml:mo><mml:mo>}</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"lu-ieq18-3036013.gif\"/></alternatives></inline-formula>, when more iterations benefit marginally. Due to the potential inconsistency of maximum clique algorithms, we study the problem of maximum clique enumeration and propose an efficient algorithm <italic>RMCE</italic> to enumerate all maximum cliques in a given graph. As confirmed by the experiments, both <italic>RMC</italic> and <italic>RMCE</italic> are much more efficient and robust than previous solutions, <italic>RMC</italic> can always find the exact maximum clique, and <italic>RMCE</italic> can always enumerate all maximum cliques in a given graph.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Cliques refer to subgraphs in an undirected graph such that vertices in each subgraph are pairwise adjacent. The maximum clique problem, to find the clique with most vertices in a given graph, has been extensively studied. Besides its theoretical value as an NP-hard problem, the maximum clique problem is known to have direct applications in various fields, such as community search in social networks and social media, team formation in expert networks, gene expression and motif discovery in bioinformatics and anomaly detection in complex networks, revealing the structure and function of networks. However, algorithms designed for the maximum clique problem are expensive to deal with real-world networks. In this paper, we first devise a randomized algorithm for the maximum clique problem. Different from previous algorithms that search from each vertex one after another, our approach RMC, for the randomized maximum clique problem, employs a binary search while maintaining a lower bound - and an upper bound - of -. In each iteration, RMC attempts to find a --clique where -. As finding - in each iteration is NP-complete, we extract a seed set - such that the problem of finding a --clique in - is equivalent to finding a --clique in - with probability guarantees (--). We propose a novel iterative algorithm to determine the maximum clique by searching a --clique in - starting from - until - becomes -, when more iterations benefit marginally. Due to the potential inconsistency of maximum clique algorithms, we study the problem of maximum clique enumeration and propose an efficient algorithm RMCE to enumerate all maximum cliques in a given graph. As confirmed by the experiments, both RMC and RMCE are much more efficient and robust than previous solutions, RMC can always find the exact maximum clique, and RMCE can always enumerate all maximum cliques in a given graph.",
"title": "Enumerating Maximum Cliques in Massive Graphs",
"normalizedTitle": "Enumerating Maximum Cliques in Massive Graphs",
"fno": "09250607",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Computational Complexity",
"Graph Theory",
"Iterative Methods",
"Probability",
"Subgraph",
"Undirected Graph",
"NP Hard",
"Social Networks",
"Motif Discovery",
"Gene Expression",
"Bioinformatics",
"Anomaly Detection",
"Real World Networks",
"Binary Search",
"Randomized Algorithm",
"NP Complete",
"Iterative Algorithm",
"Probability",
"K Clique",
"RMCE",
"Maximum Clique Enumeration",
"Maximum Clique Algorithms",
"Randomized Maximum Clique Problem",
"Social Networking Online",
"Upper Bound",
"Approximation Algorithms",
"Search Problems",
"Color",
"Complex Networks",
"Gene Expression",
"Maximum Clique",
"Community Search",
"Social Networks"
],
"authors": [
{
"givenName": "Can",
"surname": "Lu",
"fullName": "Can Lu",
"affiliation": "Chinese University of Hong Kong, Hong Kong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeffrey Xu",
"surname": "Yu",
"fullName": "Jeffrey Xu Yu",
"affiliation": "Chinese University of Hong Kong, Hong Kong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hao",
"surname": "Wei",
"fullName": "Hao Wei",
"affiliation": "Chinese University of Hong Kong, Hong Kong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yikai",
"surname": "Zhang",
"fullName": "Yikai Zhang",
"affiliation": "Chinese University of Hong Kong, Hong Kong, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2022-09-01 00:00:00",
"pubType": "trans",
"pages": "4215-4230",
"year": "2022",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tc/2019/04/08494787",
"title": "Better Circuits for Binary Polynomial Multiplication",
"doi": null,
"abstractUrl": "/journal/tc/2019/04/08494787/14s8M4Sn2IE",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/12/09729476",
"title": "Solving Consensus in True Partial Synchrony",
"doi": null,
"abstractUrl": "/journal/td/2022/12/09729476/1Byafq1ui4w",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2023/01/09930647",
"title": "The High Faulty Tolerant Capability of the Alternating Group Graphs",
"doi": null,
"abstractUrl": "/journal/td/2023/01/09930647/1HMP3UkhGus",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/04/09121771",
"title": "Continuous Monitoring of Maximum Clique Over Dynamic Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2022/04/09121771/1kMT4CxqinC",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2022/08/09314216",
"title": "On the Computation of Virtual Backbones With Fault Tolerance in Heterogeneous Wireless Sensor Networks",
"doi": null,
"abstractUrl": "/journal/tm/2022/08/09314216/1q8U7q756O4",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/02/09328560",
"title": "High-Radix Design of a Scalable Montgomery Modular Multiplier With Low Latency",
"doi": null,
"abstractUrl": "/journal/tc/2022/02/09328560/1qw8PWGHmEM",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2023/01/09468318",
"title": "Maximal Quasi-Cliques Mining in Uncertain Graphs",
"doi": null,
"abstractUrl": "/journal/bd/2023/01/09468318/1uPuJPQdHeU",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/06/09511805",
"title": "Distributed Graph Realizations",
"doi": null,
"abstractUrl": "/journal/td/2022/06/09511805/1vYRJ00nBTi",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/02/09492838",
"title": "Maximum Signed <inline-formula><tex-math notation=\"LaTeX\">Z_$\\theta$_Z</tex-math></inline-formula>-Clique Identification in Large Signed Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2023/02/09492838/1vq0EU6lrAA",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/07/09609537",
"title": "Hamiltonian Paths of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-ary <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula>-cubes Avoiding Faulty Links and Passing Through Prescribed Linear Forests",
"doi": null,
"abstractUrl": "/journal/td/2022/07/09609537/1yoxLa2YFO0",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09262038",
"articleId": "1oPzMJfp9o4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09247538",
"articleId": "1oslc0yti48",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1IUAvQtX5zW",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tk",
"pubType": "journal",
"volume": "35",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1ulCu0Hdqs8",
"doi": "10.1109/TKDE.2021.3088504",
"abstract": "Core decomposition on uncertain graphs is a fundamental problem in graph analysis. Given an uncertain graph <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {G}$_Z</tex-math></inline-formula>, the core decomposition problem is to determine all <inline-formula><tex-math notation=\"LaTeX\">Z_$(k,\\eta)\\text{-cores}$_Z</tex-math></inline-formula> in <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {G}$_Z</tex-math></inline-formula>, where a <inline-formula><tex-math notation=\"LaTeX\">Z_$(k,\\eta)\\text{-core}$_Z</tex-math></inline-formula> is a maximal subgraph of <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {G}$_Z</tex-math></inline-formula> such that each node has an <inline-formula><tex-math notation=\"LaTeX\">Z_$\\eta \\text{-}$_Z</tex-math></inline-formula><inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathsf {degree}}$_Z</tex-math></inline-formula> no less than <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula> within the subgraph. The <inline-formula><tex-math notation=\"LaTeX\">Z_$\\eta \\text{-}$_Z</tex-math></inline-formula><inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathsf {degree}}$_Z</tex-math></inline-formula> of a node <inline-formula><tex-math notation=\"LaTeX\">Z_$v$_Z</tex-math></inline-formula> is defined as the maximum integer <inline-formula><tex-math notation=\"LaTeX\">Z_$r$_Z</tex-math></inline-formula> such that the probability that <inline-formula><tex-math notation=\"LaTeX\">Z_$v$_Z</tex-math></inline-formula> has a degree no less than <inline-formula><tex-math notation=\"LaTeX\">Z_$r$_Z</tex-math></inline-formula> is larger than or equal to the threshold <inline-formula><tex-math notation=\"LaTeX\">Z_$\\eta \\in [0,1]$_Z</tex-math></inline-formula>. The state-of-the-art algorithm for solving this problem is based on a peeling technique which iteratively removes the nodes with the smallest <inline-formula><tex-math notation=\"LaTeX\">Z_$\\eta \\text{-}$_Z</tex-math></inline-formula><inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathsf {degrees}}$_Z</tex-math></inline-formula> and also dynamically updates their neighbors’ <inline-formula><tex-math notation=\"LaTeX\">Z_$\\eta \\text{-}$_Z</tex-math></inline-formula><inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathsf {degrees}}$_Z</tex-math></inline-formula>. Unfortunately, we find that such a peeling algorithm with the dynamical <inline-formula><tex-math notation=\"LaTeX\">Z_$\\eta \\text{-}$_Z</tex-math></inline-formula><inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathsf {degree}}$_Z</tex-math></inline-formula> updating technique is incorrect due to the inaccuracy of the recursive floating-point number division operations involved in the dynamical updating procedure. To correctly compute the <inline-formula><tex-math notation=\"LaTeX\">Z_$(k,\\eta)\\text{-cores}$_Z</tex-math></inline-formula>, we first propose a bottom-up algorithm based on an on-demand <inline-formula><tex-math notation=\"LaTeX\">Z_$\\eta \\text{-}$_Z</tex-math></inline-formula><inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathsf {degree}}$_Z</tex-math></inline-formula> computational strategy. To further improve the efficiency, we also develop a more efficient top-down algorithm with several nontrivial optimization techniques. Both of our algorithms do not involve any floating-point number division operations, thus the correctness can be guaranteed. In addition, we also develop the parallel variants of all the proposed algorithms. Finally, we conduct extensive experiments to evaluate the proposed algorithms using five large real-life datasets. The results show that our algorithms are at least three orders of magnitude faster than the existing exact algorithms on large uncertain graphs. The results also demonstrate the high scalability and parallel performance of the proposed algorithms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Core decomposition on uncertain graphs is a fundamental problem in graph analysis. Given an uncertain graph <inline-formula><tex-math notation=\"LaTeX\">$\\mathcal {G}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"script\">G</mml:mi></mml:math><inline-graphic xlink:href=\"li-ieq1-3088504.gif\"/></alternatives></inline-formula>, the core decomposition problem is to determine all <inline-formula><tex-math notation=\"LaTeX\">$(k,\\eta)\\text{-cores}$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>η</mml:mi><mml:mo>)</mml:mo><mml:mtext>-cores</mml:mtext></mml:mrow></mml:math><inline-graphic xlink:href=\"li-ieq2-3088504.gif\"/></alternatives></inline-formula> in <inline-formula><tex-math notation=\"LaTeX\">$\\mathcal {G}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"script\">G</mml:mi></mml:math><inline-graphic xlink:href=\"li-ieq3-3088504.gif\"/></alternatives></inline-formula>, where a <inline-formula><tex-math notation=\"LaTeX\">$(k,\\eta)\\text{-core}$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>η</mml:mi><mml:mo>)</mml:mo><mml:mtext>-core</mml:mtext></mml:mrow></mml:math><inline-graphic xlink:href=\"li-ieq4-3088504.gif\"/></alternatives></inline-formula> is a maximal subgraph of <inline-formula><tex-math notation=\"LaTeX\">$\\mathcal {G}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"script\">G</mml:mi></mml:math><inline-graphic xlink:href=\"li-ieq5-3088504.gif\"/></alternatives></inline-formula> such that each node has an <inline-formula><tex-math notation=\"LaTeX\">$\\eta \\text{-}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>η</mml:mi><mml:mtext>-</mml:mtext></mml:mrow></mml:math><inline-graphic xlink:href=\"li-ieq6-3088504.gif\"/></alternatives></inline-formula><inline-formula><tex-math notation=\"LaTeX\">${\\mathsf {degree}}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"sans-serif\">degree</mml:mi></mml:math><inline-graphic xlink:href=\"li-ieq7-3088504.gif\"/></alternatives></inline-formula> no less than <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"li-ieq8-3088504.gif\"/></alternatives></inline-formula> within the subgraph. The <inline-formula><tex-math notation=\"LaTeX\">$\\eta \\text{-}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>η</mml:mi><mml:mtext>-</mml:mtext></mml:mrow></mml:math><inline-graphic xlink:href=\"li-ieq9-3088504.gif\"/></alternatives></inline-formula><inline-formula><tex-math notation=\"LaTeX\">${\\mathsf {degree}}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"sans-serif\">degree</mml:mi></mml:math><inline-graphic xlink:href=\"li-ieq10-3088504.gif\"/></alternatives></inline-formula> of a node <inline-formula><tex-math notation=\"LaTeX\">$v$</tex-math><alternatives><mml:math><mml:mi>v</mml:mi></mml:math><inline-graphic xlink:href=\"li-ieq11-3088504.gif\"/></alternatives></inline-formula> is defined as the maximum integer <inline-formula><tex-math notation=\"LaTeX\">$r$</tex-math><alternatives><mml:math><mml:mi>r</mml:mi></mml:math><inline-graphic xlink:href=\"li-ieq12-3088504.gif\"/></alternatives></inline-formula> such that the probability that <inline-formula><tex-math notation=\"LaTeX\">$v$</tex-math><alternatives><mml:math><mml:mi>v</mml:mi></mml:math><inline-graphic xlink:href=\"li-ieq13-3088504.gif\"/></alternatives></inline-formula> has a degree no less than <inline-formula><tex-math notation=\"LaTeX\">$r$</tex-math><alternatives><mml:math><mml:mi>r</mml:mi></mml:math><inline-graphic xlink:href=\"li-ieq14-3088504.gif\"/></alternatives></inline-formula> is larger than or equal to the threshold <inline-formula><tex-math notation=\"LaTeX\">$\\eta \\in [0,1]$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>η</mml:mi><mml:mo>∈</mml:mo><mml:mo>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>]</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"li-ieq15-3088504.gif\"/></alternatives></inline-formula>. The state-of-the-art algorithm for solving this problem is based on a peeling technique which iteratively removes the nodes with the smallest <inline-formula><tex-math notation=\"LaTeX\">$\\eta \\text{-}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>η</mml:mi><mml:mtext>-</mml:mtext></mml:mrow></mml:math><inline-graphic xlink:href=\"li-ieq16-3088504.gif\"/></alternatives></inline-formula><inline-formula><tex-math notation=\"LaTeX\">${\\mathsf {degrees}}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"sans-serif\">degrees</mml:mi></mml:math><inline-graphic xlink:href=\"li-ieq17-3088504.gif\"/></alternatives></inline-formula> and also dynamically updates their neighbors’ <inline-formula><tex-math notation=\"LaTeX\">$\\eta \\text{-}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>η</mml:mi><mml:mtext>-</mml:mtext></mml:mrow></mml:math><inline-graphic xlink:href=\"li-ieq18-3088504.gif\"/></alternatives></inline-formula><inline-formula><tex-math notation=\"LaTeX\">${\\mathsf {degrees}}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"sans-serif\">degrees</mml:mi></mml:math><inline-graphic xlink:href=\"li-ieq19-3088504.gif\"/></alternatives></inline-formula>. Unfortunately, we find that such a peeling algorithm with the dynamical <inline-formula><tex-math notation=\"LaTeX\">$\\eta \\text{-}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>η</mml:mi><mml:mtext>-</mml:mtext></mml:mrow></mml:math><inline-graphic xlink:href=\"li-ieq20-3088504.gif\"/></alternatives></inline-formula><inline-formula><tex-math notation=\"LaTeX\">${\\mathsf {degree}}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"sans-serif\">degree</mml:mi></mml:math><inline-graphic xlink:href=\"li-ieq21-3088504.gif\"/></alternatives></inline-formula> updating technique is incorrect due to the inaccuracy of the recursive floating-point number division operations involved in the dynamical updating procedure. To correctly compute the <inline-formula><tex-math notation=\"LaTeX\">$(k,\\eta)\\text{-cores}$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>η</mml:mi><mml:mo>)</mml:mo><mml:mtext>-cores</mml:mtext></mml:mrow></mml:math><inline-graphic xlink:href=\"li-ieq22-3088504.gif\"/></alternatives></inline-formula>, we first propose a bottom-up algorithm based on an on-demand <inline-formula><tex-math notation=\"LaTeX\">$\\eta \\text{-}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>η</mml:mi><mml:mtext>-</mml:mtext></mml:mrow></mml:math><inline-graphic xlink:href=\"li-ieq23-3088504.gif\"/></alternatives></inline-formula><inline-formula><tex-math notation=\"LaTeX\">${\\mathsf {degree}}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"sans-serif\">degree</mml:mi></mml:math><inline-graphic xlink:href=\"li-ieq24-3088504.gif\"/></alternatives></inline-formula> computational strategy. To further improve the efficiency, we also develop a more efficient top-down algorithm with several nontrivial optimization techniques. Both of our algorithms do not involve any floating-point number division operations, thus the correctness can be guaranteed. In addition, we also develop the parallel variants of all the proposed algorithms. Finally, we conduct extensive experiments to evaluate the proposed algorithms using five large real-life datasets. The results show that our algorithms are at least three orders of magnitude faster than the existing exact algorithms on large uncertain graphs. The results also demonstrate the high scalability and parallel performance of the proposed algorithms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Core decomposition on uncertain graphs is a fundamental problem in graph analysis. Given an uncertain graph -, the core decomposition problem is to determine all - in -, where a - is a maximal subgraph of - such that each node has an -- no less than - within the subgraph. The -- of a node - is defined as the maximum integer - such that the probability that - has a degree no less than - is larger than or equal to the threshold -. The state-of-the-art algorithm for solving this problem is based on a peeling technique which iteratively removes the nodes with the smallest -- and also dynamically updates their neighbors’ --. Unfortunately, we find that such a peeling algorithm with the dynamical -- updating technique is incorrect due to the inaccuracy of the recursive floating-point number division operations involved in the dynamical updating procedure. To correctly compute the -, we first propose a bottom-up algorithm based on an on-demand -- computational strategy. To further improve the efficiency, we also develop a more efficient top-down algorithm with several nontrivial optimization techniques. Both of our algorithms do not involve any floating-point number division operations, thus the correctness can be guaranteed. In addition, we also develop the parallel variants of all the proposed algorithms. Finally, we conduct extensive experiments to evaluate the proposed algorithms using five large real-life datasets. The results show that our algorithms are at least three orders of magnitude faster than the existing exact algorithms on large uncertain graphs. The results also demonstrate the high scalability and parallel performance of the proposed algorithms.",
"title": "Core Decomposition on Uncertain Graphs Revisited",
"normalizedTitle": "Core Decomposition on Uncertain Graphs Revisited",
"fno": "09452800",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Algorithm Theory",
"Graph Theory",
"Iterative Methods",
"Optimisation",
"Core Decomposition Problem",
"Degree Computational Strategy",
"Degree Updating Technique",
"Dynamical Updating Procedure",
"Exact Algorithms",
"Graph Analysis",
"Maximal Subgraph",
"Nontrivial Optimization Techniques",
"Peeling Algorithm",
"Peeling Technique",
"Recursive Floating Point Number Division Operations",
"Uncertain Graph",
"Heuristic Algorithms",
"Computational Modeling",
"Scalability",
"Knowledge Engineering",
"Semantics",
"Indexes",
"Data Mining",
"Uncertain Graphs",
"Cohesive Subgraph Mining",
"Uncertain Core Decomposition"
],
"authors": [
{
"givenName": "Qiangqiang",
"surname": "Dai",
"fullName": "Qiangqiang Dai",
"affiliation": "Beijing Institute of Technology, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rong-Hua",
"surname": "Li",
"fullName": "Rong-Hua Li",
"affiliation": "Beijing Institute of Technology, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guoren",
"surname": "Wang",
"fullName": "Guoren Wang",
"affiliation": "Beijing Institute of Technology, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rui",
"surname": "Mao",
"fullName": "Rui Mao",
"affiliation": "Shenzhen University, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhiwei",
"surname": "Zhang",
"fullName": "Zhiwei Zhang",
"affiliation": "Beijing Institute of Technology, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ye",
"surname": "Yuan",
"fullName": "Ye Yuan",
"affiliation": "Beijing Institute of Technology, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "196-210",
"year": "2023",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tk/2022/07/09199134",
"title": "Computing K-Cores in Large Uncertain Graphs: An Index-Based Optimal Approach",
"doi": null,
"abstractUrl": "/journal/tk/2022/07/09199134/1naBq7vTUIw",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/08/09210126",
"title": "Truss-Based Structural Diversity Search in Large Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2022/08/09210126/1nxQ8gROGQ0",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/08/09244575",
"title": "Distributed Density Peaks Clustering Revisited",
"doi": null,
"abstractUrl": "/journal/tk/2022/08/09244575/1ojYk1yEY1i",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/09/09272333",
"title": "Index-Based Intimate-Core Community Search in Large Weighted Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2022/09/09272333/1p4vZDGlyeY",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2023/01/09468318",
"title": "Maximal Quasi-Cliques Mining in Uncertain Graphs",
"doi": null,
"abstractUrl": "/journal/bd/2023/01/09468318/1uPuJPQdHeU",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09531369",
"title": "Deletion Propagation Revisited for Multiple Key Preserving Views",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09531369/1wJkZcWVIE8",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09534476",
"title": "Discovering Significant Communities on Bipartite Graphs: An Index-Based Approach",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09534476/1wLbitNpdle",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09546728",
"title": "Skyline Group Queries in Large Road-Social Networks Revisited",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09546728/1x6zArmoz72",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/04/09629291",
"title": "Efficient Influential Community Search in Large Uncertain Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2023/04/09629291/1yXvGVkW7ra",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/04/09662190",
"title": "Higher-Order Truss Decomposition in Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2023/04/09662190/1zzl2ZAAVvq",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09439972",
"articleId": "1tRKpZEPcu4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09431704",
"articleId": "1tB9b1r0Y12",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1As7ypQiOI0",
"title": "Jan.-Feb.",
"year": "2022",
"issueNum": "01",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "42",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1As7DDTGAow",
"doi": "10.1109/MCG.2021.3132004",
"abstract": "The ability to recognize misleading data visualizations is a key aspect of visualization literacy. In this article, we argue that learning to successfully identify a deceptive graphic requires strategies that deliberately force learners to take an active role in the visualization process. We describe a series of experiments where three groups of learners were shown various deceptive graphics and asked to answer a series of questions. Three different interventions were analyzed to compare the educational effectiveness of the strategies used to engage learners into the process of identifying deceptive visualizations. Our results suggest that the ability to identify deceptive visualizations must be explicitly taught as a core element of visualization literacy. Although both traditional and self-learning approaches are beneficial, the more active the intervention, the higher its educational effectiveness.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The ability to recognize misleading data visualizations is a key aspect of visualization literacy. In this article, we argue that learning to successfully identify a deceptive graphic requires strategies that deliberately force learners to take an active role in the visualization process. We describe a series of experiments where three groups of learners were shown various deceptive graphics and asked to answer a series of questions. Three different interventions were analyzed to compare the educational effectiveness of the strategies used to engage learners into the process of identifying deceptive visualizations. Our results suggest that the ability to identify deceptive visualizations must be explicitly taught as a core element of visualization literacy. Although both traditional and self-learning approaches are beneficial, the more active the intervention, the higher its educational effectiveness.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The ability to recognize misleading data visualizations is a key aspect of visualization literacy. In this article, we argue that learning to successfully identify a deceptive graphic requires strategies that deliberately force learners to take an active role in the visualization process. We describe a series of experiments where three groups of learners were shown various deceptive graphics and asked to answer a series of questions. Three different interventions were analyzed to compare the educational effectiveness of the strategies used to engage learners into the process of identifying deceptive visualizations. Our results suggest that the ability to identify deceptive visualizations must be explicitly taught as a core element of visualization literacy. Although both traditional and self-learning approaches are beneficial, the more active the intervention, the higher its educational effectiveness.",
"title": "Identifying Deception as a Critical Component of Visualization Literacy",
"normalizedTitle": "Identifying Deception as a Critical Component of Visualization Literacy",
"fno": "09693369",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Computer Literacy",
"Data Visualisation",
"Misleading Data Visualizations",
"Visualization Literacy",
"Deception Identification",
"Graphics",
"Semantics",
"Data Visualization",
"Labeling",
"Usability"
],
"authors": [
{
"givenName": "Jorge D.",
"surname": "Camba",
"fullName": "Jorge D. Camba",
"affiliation": "Purdue University, West Lafayette, IN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pedro",
"surname": "Company",
"fullName": "Pedro Company",
"affiliation": "Universitat Jaume I, Castelló de la Plana, Spain",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vetria",
"surname": "Byrd",
"fullName": "Vetria Byrd",
"affiliation": "Purdue University, West Lafayette, IN, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "mags",
"pages": "116-122",
"year": "2022",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/eitt/2017/0629/0/0629a182",
"title": "Design and Implementation of the Information Literacy Evaluation System for High School Students",
"doi": null,
"abstractUrl": "/proceedings-article/eitt/2017/0629a182/12OmNwDACti",
"parentPublication": {
"id": "proceedings/eitt/2017/0629/0",
"title": "2017 International Conference of Educational Innovation through Technology (EITT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2006/2602/0/26020232",
"title": "Identifying the Competencies of 'Visual Literacy' - a Prerequisite for Knowledge Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2006/26020232/12OmNzVoBv7",
"parentPublication": {
"id": "proceedings/iv/2006/2602/0",
"title": "Tenth International Conference on Information Visualisation (IV'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2018/03/mcg2018030021",
"title": "Observations and Reflections on Visualization Literacy in Elementary School",
"doi": null,
"abstractUrl": "/magazine/cg/2018/03/mcg2018030021/13rRUwwJWBp",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539634",
"title": "VLAT: Development of a Visualization Literacy Assessment Test",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539634/13rRUxASuhE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875906",
"title": "A Principled Way of Assessing Visualization Literacy",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875906/13rRUyYjK5i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2022/03/09790006",
"title": "VisLitE: Visualization Literacy and Evaluation",
"doi": null,
"abstractUrl": "/magazine/cg/2022/03/09790006/1E0NfTJ2oak",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903547",
"title": "Cultivating Visualization Literacy for Children Through Curiosity and Play",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903547/1GZookEFGzC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/08930077",
"title": "Gaze-Driven Adaptive Interventions for Magazine-Style Narrative Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/08930077/1fCCO10cYW4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222251",
"title": "Designing Narrative-Focused Role-Playing Games for Visualization Literacy in Young Children",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222251/1nTr15tWhvq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vahc/2020/2644/0/264400a017",
"title": "Visualization Co-Design with Prostate Cancer Survivors who have Limited Graph Literacy",
"doi": null,
"abstractUrl": "/proceedings-article/vahc/2020/264400a017/1yhFE7okzgk",
"parentPublication": {
"id": "proceedings/vahc/2020/2644/0",
"title": "2020 Workshop on Visual Analytics in Healthcare (VAHC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09647999",
"articleId": "1ziKqSrgpYA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09693359",
"articleId": "1As7zEHCGn6",
"__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": "1GZookEFGzC",
"doi": "10.1109/TVCG.2022.3209442",
"abstract": "Fostering data visualization literacy (DVL) as part of childhood education could lead to a more data literate society. However, most work in DVL for children relies on a more formal educational context (i.e., a teacher-led approach) that limits children's engagement with data to classroom-based environments and, consequently, children's ability to ask questions about and explore data on topics they find personally meaningful. We explore how a curiosity-driven, child-led approach can provide more agency to children when they are authoring data visualizations. This paper explores how informal learning with crafting physicalizations through play and curiosity may foster increased literacy and engagement with data. Employing a constructionist approach, we designed a do-it-yourself toolkit made out of everyday materials (e.g., paper, cardboard, mirrors) that enables children to create, customize, and personalize three different interactive visualizations (bar, line, pie). We used the toolkit as a design probe in a series of in-person workshops with 5 children (6 to 11-year-olds) and interviews with 5 educators. Our observations reveal that the toolkit helped children creatively engage and interact with visualizations. Children with prior knowledge of data visualization reported the toolkit serving as more of an authoring tool that they envision using in their daily lives, while children with little to no experience found the toolkit as an engaging introduction to data visualization. Our study demonstrates the potential of using the constructionist approach to cultivate children's DVL through curiosity and play.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Fostering data visualization literacy (DVL) as part of childhood education could lead to a more data literate society. However, most work in DVL for children relies on a more formal educational context (i.e., a teacher-led approach) that limits children's engagement with data to classroom-based environments and, consequently, children's ability to ask questions about and explore data on topics they find personally meaningful. We explore how a curiosity-driven, child-led approach can provide more agency to children when they are authoring data visualizations. This paper explores how informal learning with crafting physicalizations through play and curiosity may foster increased literacy and engagement with data. Employing a constructionist approach, we designed a do-it-yourself toolkit made out of everyday materials (e.g., paper, cardboard, mirrors) that enables children to create, customize, and personalize three different interactive visualizations (bar, line, pie). We used the toolkit as a design probe in a series of in-person workshops with 5 children (6 to 11-year-olds) and interviews with 5 educators. Our observations reveal that the toolkit helped children creatively engage and interact with visualizations. Children with prior knowledge of data visualization reported the toolkit serving as more of an authoring tool that they envision using in their daily lives, while children with little to no experience found the toolkit as an engaging introduction to data visualization. Our study demonstrates the potential of using the constructionist approach to cultivate children's DVL through curiosity and play.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Fostering data visualization literacy (DVL) as part of childhood education could lead to a more data literate society. However, most work in DVL for children relies on a more formal educational context (i.e., a teacher-led approach) that limits children's engagement with data to classroom-based environments and, consequently, children's ability to ask questions about and explore data on topics they find personally meaningful. We explore how a curiosity-driven, child-led approach can provide more agency to children when they are authoring data visualizations. This paper explores how informal learning with crafting physicalizations through play and curiosity may foster increased literacy and engagement with data. Employing a constructionist approach, we designed a do-it-yourself toolkit made out of everyday materials (e.g., paper, cardboard, mirrors) that enables children to create, customize, and personalize three different interactive visualizations (bar, line, pie). We used the toolkit as a design probe in a series of in-person workshops with 5 children (6 to 11-year-olds) and interviews with 5 educators. Our observations reveal that the toolkit helped children creatively engage and interact with visualizations. Children with prior knowledge of data visualization reported the toolkit serving as more of an authoring tool that they envision using in their daily lives, while children with little to no experience found the toolkit as an engaging introduction to data visualization. Our study demonstrates the potential of using the constructionist approach to cultivate children's DVL through curiosity and play.",
"title": "Cultivating Visualization Literacy for Children Through Curiosity and Play",
"normalizedTitle": "Cultivating Visualization Literacy for Children Through Curiosity and Play",
"fno": "09903547",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Aided Instruction",
"Data Visualisation",
"Graphical User Interfaces",
"Human Computer Interaction",
"Child Led Approach",
"Childhood Education",
"Constructionist Approach",
"Curiosity",
"Data Literate Society",
"Data Visualization Literacy",
"Increased Literacy Engagement",
"Informal Learning",
"Interactive Visualizations",
"Play",
"Teacher Led Approach",
"Toolkit",
"Visualization Literacy Cultivation",
"Data Visualization",
"Education",
"Bars",
"Prototypes",
"Cognition",
"Visualization",
"Pediatrics",
"Data Visualization Literacy",
"Children",
"Constructionism",
"Informal Learning"
],
"authors": [
{
"givenName": "S. Sandra",
"surname": "Bae",
"fullName": "S. Sandra Bae",
"affiliation": "CU Boulder, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rishi",
"surname": "Vanukuru",
"fullName": "Rishi Vanukuru",
"affiliation": "CU Boulder, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ruhan",
"surname": "Yang",
"fullName": "Ruhan Yang",
"affiliation": "CU Boulder, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter",
"surname": "Gyory",
"fullName": "Peter Gyory",
"affiliation": "CU Boulder, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ran",
"surname": "Zhou",
"fullName": "Ran Zhou",
"affiliation": "CU Boulder, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ellen Yi-Luen",
"surname": "Do",
"fullName": "Ellen Yi-Luen Do",
"affiliation": "CU Boulder, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Danielle Albers",
"surname": "Szafir",
"fullName": "Danielle Albers Szafir",
"affiliation": "UNC-Chapel Hill, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "257-267",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/intetain/2015/0061/0/07325502",
"title": "Playable one-switch video games for children with severe motor disabilities based on GNomon",
"doi": null,
"abstractUrl": "/proceedings-article/intetain/2015/07325502/12OmNAm4TGI",
"parentPublication": {
"id": "proceedings/intetain/2015/0061/0",
"title": "2015 7th International Conference on Intelligent Technologies for Interactive Entertainment (INTETAIN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/segah/2014/4823/0/07067090",
"title": "Positive relationship between duration of action video game play and visuospatial executive function in children",
"doi": null,
"abstractUrl": "/proceedings-article/segah/2014/07067090/12OmNB7tUoJ",
"parentPublication": {
"id": "proceedings/segah/2014/4823/0",
"title": "2014 IEEE 3rd International Conference on Serious Games and Applications for Health (SeGAH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vs-games/2017/5812/0/08056597",
"title": "Serious games adapted to children with profound intellectual and multiple disabilities",
"doi": null,
"abstractUrl": "/proceedings-article/vs-games/2017/08056597/12OmNrAMF40",
"parentPublication": {
"id": "proceedings/vs-games/2017/5812/0",
"title": "2017 9th International Conference on Virtual Worlds and Games for Serious Applications (VS-Games)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2013/2869/0/06671763",
"title": "Through the looking glass: Pretend play for children with autism",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2013/06671763/12OmNzdoMjI",
"parentPublication": {
"id": "proceedings/ismar/2013/2869/0",
"title": "2013 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/pc/2016/03/mpc2016030048",
"title": "Pervasive Displays in Classrooms of Children with Severe Autism",
"doi": null,
"abstractUrl": "/magazine/pc/2016/03/mpc2016030048/13rRUy3xY5u",
"parentPublication": {
"id": "mags/pc",
"title": "IEEE Pervasive Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/chase/2022/9476/0/947600a154",
"title": "Poster: Design of AI-Powered Augmented Reality Games for Autistic Children",
"doi": null,
"abstractUrl": "/proceedings-article/chase/2022/947600a154/1JjykxsvM2s",
"parentPublication": {
"id": "proceedings/chase/2022/9476/0",
"title": "2022 IEEE/ACM Conference on Connected Health: Applications, Systems and Engineering Technologies (CHASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icekim/2022/1666/0/166600a323",
"title": "Research on Parental Coping with Children’s Negative Emotions, Children’s Temperament and Emotion Regulation Ability Based on SPSS25.0 and GraphPad Prism9 software",
"doi": null,
"abstractUrl": "/proceedings-article/icekim/2022/166600a323/1KpBZnJKREY",
"parentPublication": {
"id": "proceedings/icekim/2022/1666/0",
"title": "2022 3rd International Conference on Education, Knowledge and Information Management (ICEKIM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/laclo/2018/0382/0/038200a181",
"title": "Alternative Method for Literacy of Autistic Spectrum Disorder's (ASD) Children",
"doi": null,
"abstractUrl": "/proceedings-article/laclo/2018/038200a181/1cdOk05lZ1C",
"parentPublication": {
"id": "proceedings/laclo/2018/0382/0",
"title": "2018 XIII Latin American Conference on Learning Technologies (LACLO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/clei/2018/0437/0/043700a309",
"title": "An APP Designed for the Literacy of Children with Autistic Spectrum Disorder",
"doi": null,
"abstractUrl": "/proceedings-article/clei/2018/043700a309/1cdP30M663u",
"parentPublication": {
"id": "proceedings/clei/2018/0437/0",
"title": "2018 XLIV Latin American Computer Conference (CLEI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ichi/2020/5382/0/09374304",
"title": "Measuring children’s eating behavior with a wearable device",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2020/09374304/1rUIW730CeQ",
"parentPublication": {
"id": "proceedings/ichi/2020/5382/0",
"title": "2020 IEEE International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09904484",
"articleId": "1H1ggMqzJUQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09905748",
"articleId": "1H3ZTYuap1e",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx4yvu1",
"title": "March",
"year": "1996",
"issueNum": "02",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "16",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyuvRra",
"doi": "10.1109/38.486679",
"abstract": "A method of producing gaits is presented that uses control mechanisms analogous to windup toys. The synthesis technique is based on optimization. One primary characteristics of the \"virtual windup toys\" is that they are oblivious to their environment. This means that the simulated creatures have no active control over balance. Nevertheless, \"blind\" control mechanisms work well for many common periodic gaits as well as aperiodic motions such as turns and leaps. The possibilities and limitations of the technique are presented in the context of example creatures having one, two, four, and six legs. An important attribute of the proposed synthesis method is that the motions produced can be parameterized. Instead of producing a fixed instance of a motion, a family of motions can be synthesized. Examples presented are a hopping gait parameterized with respect to speed, a turning walk parameterized with respect to the turning rate, and a leaping gait parameterized with respect to the size of the leap. The animator can thus interactively specify the hopping speed, turning rate, and leap size, respectively, for these physics-based motions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A method of producing gaits is presented that uses control mechanisms analogous to windup toys. The synthesis technique is based on optimization. One primary characteristics of the \"virtual windup toys\" is that they are oblivious to their environment. This means that the simulated creatures have no active control over balance. Nevertheless, \"blind\" control mechanisms work well for many common periodic gaits as well as aperiodic motions such as turns and leaps. The possibilities and limitations of the technique are presented in the context of example creatures having one, two, four, and six legs. An important attribute of the proposed synthesis method is that the motions produced can be parameterized. Instead of producing a fixed instance of a motion, a family of motions can be synthesized. Examples presented are a hopping gait parameterized with respect to speed, a turning walk parameterized with respect to the turning rate, and a leaping gait parameterized with respect to the size of the leap. The animator can thus interactively specify the hopping speed, turning rate, and leap size, respectively, for these physics-based motions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A method of producing gaits is presented that uses control mechanisms analogous to windup toys. The synthesis technique is based on optimization. One primary characteristics of the \"virtual windup toys\" is that they are oblivious to their environment. This means that the simulated creatures have no active control over balance. Nevertheless, \"blind\" control mechanisms work well for many common periodic gaits as well as aperiodic motions such as turns and leaps. The possibilities and limitations of the technique are presented in the context of example creatures having one, two, four, and six legs. An important attribute of the proposed synthesis method is that the motions produced can be parameterized. Instead of producing a fixed instance of a motion, a family of motions can be synthesized. Examples presented are a hopping gait parameterized with respect to speed, a turning walk parameterized with respect to the turning rate, and a leaping gait parameterized with respect to the size of the leap. The animator can thus interactively specify the hopping speed, turning rate, and leap size, respectively, for these physics-based motions.",
"title": "Parameterized Gait Synthesis",
"normalizedTitle": "Parameterized Gait Synthesis",
"fno": "mcg1996020040",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Animation",
"Simulation Of Legged Locomotion"
],
"authors": [
{
"givenName": "Michiel",
"surname": "van de Panne",
"fullName": "Michiel van de Panne",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "1996-03-01 00:00:00",
"pubType": "mags",
"pages": "40-49",
"year": "1996",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "mcg1996020031",
"articleId": "13rRUx0xPpl",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg1996020050",
"articleId": "13rRUxASujP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04Q",
"title": "Jan.",
"year": "2017",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIJuxvn",
"doi": "10.1109/TVCG.2016.2599030",
"abstract": "We present Vega-Lite, a high-level grammar that enables rapid specification of interactive data visualizations. Vega-Lite combines a traditional grammar of graphics, providing visual encoding rules and a composition algebra for layered and multi-view displays, with a novel grammar of interaction. Users specify interactive semantics by composing selections. In Vega-Lite, a selection is an abstraction that defines input event processing, points of interest, and a predicate function for inclusion testing. Selections parameterize visual encodings by serving as input data, defining scale extents, or by driving conditional logic. The Vega-Lite compiler automatically synthesizes requisite data flow and event handling logic, which users can override for further customization. In contrast to existing reactive specifications, Vega-Lite selections decompose an interaction design into concise, enumerable semantic units. We evaluate Vega-Lite through a range of examples, demonstrating succinct specification of both customized interaction methods and common techniques such as panning, zooming, and linked selection.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present Vega-Lite, a high-level grammar that enables rapid specification of interactive data visualizations. Vega-Lite combines a traditional grammar of graphics, providing visual encoding rules and a composition algebra for layered and multi-view displays, with a novel grammar of interaction. Users specify interactive semantics by composing selections. In Vega-Lite, a selection is an abstraction that defines input event processing, points of interest, and a predicate function for inclusion testing. Selections parameterize visual encodings by serving as input data, defining scale extents, or by driving conditional logic. The Vega-Lite compiler automatically synthesizes requisite data flow and event handling logic, which users can override for further customization. In contrast to existing reactive specifications, Vega-Lite selections decompose an interaction design into concise, enumerable semantic units. We evaluate Vega-Lite through a range of examples, demonstrating succinct specification of both customized interaction methods and common techniques such as panning, zooming, and linked selection.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present Vega-Lite, a high-level grammar that enables rapid specification of interactive data visualizations. Vega-Lite combines a traditional grammar of graphics, providing visual encoding rules and a composition algebra for layered and multi-view displays, with a novel grammar of interaction. Users specify interactive semantics by composing selections. In Vega-Lite, a selection is an abstraction that defines input event processing, points of interest, and a predicate function for inclusion testing. Selections parameterize visual encodings by serving as input data, defining scale extents, or by driving conditional logic. The Vega-Lite compiler automatically synthesizes requisite data flow and event handling logic, which users can override for further customization. In contrast to existing reactive specifications, Vega-Lite selections decompose an interaction design into concise, enumerable semantic units. We evaluate Vega-Lite through a range of examples, demonstrating succinct specification of both customized interaction methods and common techniques such as panning, zooming, and linked selection.",
"title": "Vega-Lite: A Grammar of Interactive Graphics",
"normalizedTitle": "Vega-Lite: A Grammar of Interactive Graphics",
"fno": "07539624",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Grammar",
"Visualization",
"Encoding",
"Transforms",
"Brushes",
"Declarative Specification",
"Information Visualization",
"Interaction",
"Systems",
"Toolkits"
],
"authors": [
{
"givenName": "Arvind",
"surname": "Satyanarayan",
"fullName": "Arvind Satyanarayan",
"affiliation": "Stanford University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dominik",
"surname": "Moritz",
"fullName": "Dominik Moritz",
"affiliation": "University of Washington",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kanit",
"surname": "Wongsuphasawat",
"fullName": "Kanit Wongsuphasawat",
"affiliation": "University of Washington",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeffrey",
"surname": "Heer",
"fullName": "Jeffrey Heer",
"affiliation": "University of Washington",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2017-01-01 00:00:00",
"pubType": "trans",
"pages": "341-350",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2016/01/07192704",
"title": "Reactive Vega: A Streaming Dataflow Architecture for Declarative Interactive Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192704/13rRUx0gev9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09914804",
"title": "Animated Vega-Lite: Unifying Animation with a Grammar of Interactive Graphics",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09914804/1Hmgc5h7Clq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a006",
"title": "Facilitating Conversational Interaction in Natural Language Interfaces for Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a006/1J6hcTVtKNy",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a011",
"title": "VegaFusion: Automatic Server-Side Scaling for Interactive Vega Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a011/1J6hcsbkAyA",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/05/08744242",
"title": "Data2Vis: Automatic Generation of Data Visualizations Using Sequence-to-Sequence Recurrent Neural Networks",
"doi": null,
"abstractUrl": "/magazine/cg/2019/05/08744242/1cFV5domibu",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222342",
"title": "NL4DV: A Toolkit for Generating Analytic Specifications for Data Visualization from Natural Language Queries",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222342/1nTqOo5NR3G",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09234027",
"title": "Gemini: A Grammar and Recommender System for Animated Transitions in Statistical Graphics",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09234027/1o531wbxsSk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a131",
"title": "Encodable: Configurable Grammar for Visualization Components",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a131/1qRNXTuFymI",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/09350177",
"title": "Net2Vis – A Visual Grammar for Automatically Generating Publication-Tailored CNN Architecture Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/09350177/1r3l972fCk8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09417674",
"title": "Nebula: A Coordinating Grammar of Graphics",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09417674/1taANyFFcmQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07539327",
"articleId": "13rRUytWF9q",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07539616",
"articleId": "13rRUyeTVi6",
"__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": "17D45XacGi1",
"doi": "10.1109/TVCG.2018.2864841",
"abstract": "This paper presents a declarative grammar for conveniently and effectively specifying advanced volume visualizations. Existing methods for creating volume visualizations either lack the flexibility to specify sophisticated visualizations or are difficult to use for those unfamiliar with volume rendering implementation and parameterization. Our design provides the ability to quickly create expressive visualizations without knowledge of the volume rendering implementation. It attempts to capture aspects of those difficult but powerful methods while remaining flexible and easy to use. As a proof of concept, our current implementation of the grammar allows users to combine multiple data variables in various ways and define transfer functions for diverse input data. The grammar also has the ability to describe advanced shading effects and create animations. We demonstrate the power and flexibility of our approach using multiple practical volume visualizations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a declarative grammar for conveniently and effectively specifying advanced volume visualizations. Existing methods for creating volume visualizations either lack the flexibility to specify sophisticated visualizations or are difficult to use for those unfamiliar with volume rendering implementation and parameterization. Our design provides the ability to quickly create expressive visualizations without knowledge of the volume rendering implementation. It attempts to capture aspects of those difficult but powerful methods while remaining flexible and easy to use. As a proof of concept, our current implementation of the grammar allows users to combine multiple data variables in various ways and define transfer functions for diverse input data. The grammar also has the ability to describe advanced shading effects and create animations. We demonstrate the power and flexibility of our approach using multiple practical volume visualizations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a declarative grammar for conveniently and effectively specifying advanced volume visualizations. Existing methods for creating volume visualizations either lack the flexibility to specify sophisticated visualizations or are difficult to use for those unfamiliar with volume rendering implementation and parameterization. Our design provides the ability to quickly create expressive visualizations without knowledge of the volume rendering implementation. It attempts to capture aspects of those difficult but powerful methods while remaining flexible and easy to use. As a proof of concept, our current implementation of the grammar allows users to combine multiple data variables in various ways and define transfer functions for diverse input data. The grammar also has the ability to describe advanced shading effects and create animations. We demonstrate the power and flexibility of our approach using multiple practical volume visualizations.",
"title": "A Declarative Grammar of Flexible Volume Visualization Pipelines",
"normalizedTitle": "A Declarative Grammar of Flexible Volume Visualization Pipelines",
"fno": "08440063",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Animation",
"Data Visualisation",
"Grammars",
"Rendering Computer Graphics",
"Transfer Functions",
"Declarative Grammar",
"Flexible Volume Visualization Pipelines",
"Volume Rendering Implementation",
"Transfer Functions",
"Shading Effects",
"Animation Creation",
"Data Visualization",
"Rendering Computer Graphics",
"Pipelines",
"Grammar",
"Visualization",
"DSL",
"Image Color Analysis",
"Volume Visualization",
"Direct Volume Rendering",
"Declarative Specification",
"Multivariate Multimodal Volume Data",
"Animation"
],
"authors": [
{
"givenName": "Min",
"surname": "Shih",
"fullName": "Min Shih",
"affiliation": "University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Charles",
"surname": "Rozhon",
"fullName": "Charles Rozhon",
"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": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "1050-1059",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cgi/2003/1946/0/19460002",
"title": "Hardware Assisted Multichannel Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2003/19460002/12OmNCdk2xM",
"parentPublication": {
"id": "proceedings/cgi/2003/1946/0",
"title": "Computer Graphics International Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498lu",
"title": "Non-Photorealistic Volume Rendering Using Stippling Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498lu/12OmNy9Prft",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/03/08468065",
"title": "P4: Portable Parallel Processing Pipelines for Interactive Information Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2020/03/08468065/13HFz2XZAUp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1584",
"title": "A Flexible Multi-Volume Shader Framework for Arbitrarily Intersecting Multi-Resolution Datasets",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1584/13rRUxcbnH4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/12/08233127",
"title": "Atom: A Grammar for Unit Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2018/12/08233127/14H4WLzSYsE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08809730",
"title": "P5: Portable Progressive Parallel Processing Pipelines for Interactive Data Analysis and Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08809730/1cHE2tYwF7a",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a131",
"title": "Encodable: Configurable Grammar for Visualization Components",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a131/1qRNXTuFymI",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/09350177",
"title": "Net2Vis – A Visual Grammar for Automatically Generating Publication-Tailored CNN Architecture Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/09350177/1r3l972fCk8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09417674",
"title": "Nebula: A Coordinating Grammar of Graphics",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09417674/1taANyFFcmQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09557192",
"title": "Gosling: A Grammar-based Toolkit for Scalable and Interactive Genomics Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09557192/1xlw1UFWxDa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440038",
"articleId": "17D45WrVgbN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08445644",
"articleId": "17D45Wuc36G",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i3wvTdtOa4",
"name": "ttg201901-08440063s1.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08440063s1.pdf",
"extension": "pdf",
"size": "70.4 kB",
"__typename": "WebExtraType"
},
{
"id": "1i3wsRPnYhq",
"name": "ttg201901-08440063s2.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08440063s2.mp4",
"extension": "mp4",
"size": "69.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrIaecv",
"title": "Sept.-Oct.",
"year": "2019",
"issueNum": "05",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "39",
"label": "Sept.-Oct.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1cFV5domibu",
"doi": "10.1109/MCG.2019.2924636",
"abstract": "Rapidly creating effective visualizations using expressive grammars is challenging for users who have limited time and limited skills in statistics and data visualization. Even high-level, dedicated visualization tools often require users to manually select among data attributes, decide which transformations to apply, and specify mappings between visual encoding variables and raw or transformed attributes. In this paper we introduce Data2Vis, an end-to-end trainable neural translation model for automatically generating visualizations from given datasets. We formulate visualization generation as a language translation problem, where data specifications are mapped to visualization specifications in a declarative language (Vega-Lite). To this end, we train a multilayered attention-based encoder–decoder network with long short-term memory (LSTM) units on a corpus of visualization specifications. Qualitative results show that our model learns the vocabulary and syntax for a valid visualization specification, appropriate transformations (count, bins, mean), and how to use common data selection patterns that occur within data visualizations. We introduce two metrics for evaluating the task of automated visualization generation (language syntax validity, visualization grammar syntax validity) and demonstrate the efficacy of bidirectional models with attention mechanisms for this task. Data2Vis generates visualizations that are comparable to manually created visualizations in a fraction of the time, with potential to learn more complex visualization strategies at scale.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Rapidly creating effective visualizations using expressive grammars is challenging for users who have limited time and limited skills in statistics and data visualization. Even high-level, dedicated visualization tools often require users to manually select among data attributes, decide which transformations to apply, and specify mappings between visual encoding variables and raw or transformed attributes. In this paper we introduce Data2Vis, an end-to-end trainable neural translation model for automatically generating visualizations from given datasets. We formulate visualization generation as a language translation problem, where data specifications are mapped to visualization specifications in a declarative language (Vega-Lite). To this end, we train a multilayered attention-based encoder–decoder network with long short-term memory (LSTM) units on a corpus of visualization specifications. Qualitative results show that our model learns the vocabulary and syntax for a valid visualization specification, appropriate transformations (count, bins, mean), and how to use common data selection patterns that occur within data visualizations. We introduce two metrics for evaluating the task of automated visualization generation (language syntax validity, visualization grammar syntax validity) and demonstrate the efficacy of bidirectional models with attention mechanisms for this task. Data2Vis generates visualizations that are comparable to manually created visualizations in a fraction of the time, with potential to learn more complex visualization strategies at scale.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Rapidly creating effective visualizations using expressive grammars is challenging for users who have limited time and limited skills in statistics and data visualization. Even high-level, dedicated visualization tools often require users to manually select among data attributes, decide which transformations to apply, and specify mappings between visual encoding variables and raw or transformed attributes. In this paper we introduce Data2Vis, an end-to-end trainable neural translation model for automatically generating visualizations from given datasets. We formulate visualization generation as a language translation problem, where data specifications are mapped to visualization specifications in a declarative language (Vega-Lite). To this end, we train a multilayered attention-based encoder–decoder network with long short-term memory (LSTM) units on a corpus of visualization specifications. Qualitative results show that our model learns the vocabulary and syntax for a valid visualization specification, appropriate transformations (count, bins, mean), and how to use common data selection patterns that occur within data visualizations. We introduce two metrics for evaluating the task of automated visualization generation (language syntax validity, visualization grammar syntax validity) and demonstrate the efficacy of bidirectional models with attention mechanisms for this task. Data2Vis generates visualizations that are comparable to manually created visualizations in a fraction of the time, with potential to learn more complex visualization strategies at scale.",
"title": "Data2Vis: Automatic Generation of Data Visualizations Using Sequence-to-Sequence Recurrent Neural Networks",
"normalizedTitle": "Data2Vis: Automatic Generation of Data Visualizations Using Sequence-to-Sequence Recurrent Neural Networks",
"fno": "08744242",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Visualisation",
"Formal Specification",
"Language Translation",
"Learning Artificial Intelligence",
"Recurrent Neural Nets",
"Visualization Specifications",
"Automated Visualization Generation",
"Sequence To Sequence Recurrent Neural Networks",
"Data Visualization",
"Dedicated Visualization Tools",
"Visual Encoding Variables",
"End To End Trainable Neural Translation Model",
"Language Translation Problem",
"Data Specifications",
"Multilayered Attention Based Encoder Decoder Network",
"Data Selection Patterns",
"Long Short Term Memory",
"Declarative Language",
"Data 2 Vis",
"Data Visualization",
"Visualization",
"Grammar",
"Data Models",
"Tools",
"Encoding",
"Syntactics",
"Automated Visualization",
"Data Visualization",
"Deep Learning",
"Machine Learning"
],
"authors": [
{
"givenName": "Victor",
"surname": "Dibia",
"fullName": "Victor Dibia",
"affiliation": "Cloudera Fast Forward Labs",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Çağatay",
"surname": "Demiralp",
"fullName": "Çağatay Demiralp",
"affiliation": "Megagon Labs",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2019-09-01 00:00:00",
"pubType": "mags",
"pages": "33-46",
"year": "2019",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/es/2016/3790/0/07880487",
"title": "Recommendations for Data Visualizations Based on Gestalt Patterns",
"doi": null,
"abstractUrl": "/proceedings-article/es/2016/07880487/12OmNCb3ftz",
"parentPublication": {
"id": "proceedings/es/2016/3790/0",
"title": "2016 4th International Conference on Enterprise Systems (ES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/models/2015/6908/0/07338266",
"title": "Systematic generation of standard compliant tool support of diagrammatic modeling languages",
"doi": null,
"abstractUrl": "/proceedings-article/models/2015/07338266/12OmNwdtw8j",
"parentPublication": {
"id": "proceedings/models/2015/6908/0",
"title": "2015 ACM/IEEE 18th International Conference on Model Driven Engineering Languages and Systems (MODELS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/siie/2012/7/0/06403203",
"title": "Visualization of the syntax error recovery within the compilation process",
"doi": null,
"abstractUrl": "/proceedings-article/siie/2012/06403203/12OmNybfqWd",
"parentPublication": {
"id": "proceedings/siie/2012/7/0",
"title": "2012 International Symposium on Computers in Education (SIIE 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010060943",
"title": "How Information Visualization Novices Construct Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010060943/13rRUwInvAZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/12/08233127",
"title": "Atom: A Grammar for Unit Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2018/12/08233127/14H4WLzSYsE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904438",
"title": "No Grammar to Rule Them All: A Survey of JSON-style DSLs for Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904438/1H1goFeoVgY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09916137",
"title": "Revisiting the Design Patterns of Composite Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09916137/1HojAjSAGNq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222342",
"title": "NL4DV: A Toolkit for Generating Analytic Specifications for Data Visualization from Natural Language Queries",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222342/1nTqOo5NR3G",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/09350177",
"title": "Net2Vis – A Visual Grammar for Automatically Generating Publication-Tailored CNN Architecture Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/09350177/1r3l972fCk8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2021/3335/0/333500a171",
"title": "Atlas: Grammar-based Procedural Generation of Data Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2021/333500a171/1yXulf0d488",
"parentPublication": {
"id": "proceedings/vis/2021/3335/0",
"title": "2021 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08735919",
"articleId": "1aNOrENWwXS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08723177",
"articleId": "1cFV5zOFzhu",
"__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": "1nTq1lYLbEY",
"doi": "10.1109/TVCG.2020.3030372",
"abstract": "Static scatterplots often suffer from the overdraw problem on big datasets where object overlap causes undesirable visual clutter. The use of zooming in scatterplots can help alleviate this problem. With multiple zoom levels, more screen real estate is available, allowing objects to be placed in a less crowded way. We call this type of visualization scalable scatterplot visualizations, or SSV for short. Despite the potential of SSVs, existing systems and toolkits fall short in supporting the authoring of SSVs due to three limitations. First, many systems have limited scalability, assuming that data fits in the memory of one computer. Second, too much developer work, e.g., using custom code to generate mark layouts or render objects, is required. Third, many systems focus on only a small subset of the SSV design space (e.g. supporting a specific type of visual marks). To address these limitations, we have developed Kyrix-S, a system for easy authoring of SSVs at scale. Kyrix-S derives a declarative grammar that enables specification of a variety of SSVs in a few tens of lines of code, based on an existing survey of scatterplot tasks and designs. The declarative grammar is supported by a distributed layout algorithm which automatically places visual marks onto zoom levels. We store data in a multi-node database and use multi-node spatial indexes to achieve interactive browsing of large SSVs. Extensive experiments show that 1) Kyrix-S enables interactive browsing of SSVs of billions of objects, with response times under 500ms and 2) Kyrix-S achieves 4X-9X reduction in specification compared to a state-of-the-art authoring system.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Static scatterplots often suffer from the overdraw problem on big datasets where object overlap causes undesirable visual clutter. The use of zooming in scatterplots can help alleviate this problem. With multiple zoom levels, more screen real estate is available, allowing objects to be placed in a less crowded way. We call this type of visualization scalable scatterplot visualizations, or SSV for short. Despite the potential of SSVs, existing systems and toolkits fall short in supporting the authoring of SSVs due to three limitations. First, many systems have limited scalability, assuming that data fits in the memory of one computer. Second, too much developer work, e.g., using custom code to generate mark layouts or render objects, is required. Third, many systems focus on only a small subset of the SSV design space (e.g. supporting a specific type of visual marks). To address these limitations, we have developed Kyrix-S, a system for easy authoring of SSVs at scale. Kyrix-S derives a declarative grammar that enables specification of a variety of SSVs in a few tens of lines of code, based on an existing survey of scatterplot tasks and designs. The declarative grammar is supported by a distributed layout algorithm which automatically places visual marks onto zoom levels. We store data in a multi-node database and use multi-node spatial indexes to achieve interactive browsing of large SSVs. Extensive experiments show that 1) Kyrix-S enables interactive browsing of SSVs of billions of objects, with response times under 500ms and 2) Kyrix-S achieves 4X-9X reduction in specification compared to a state-of-the-art authoring system.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Static scatterplots often suffer from the overdraw problem on big datasets where object overlap causes undesirable visual clutter. The use of zooming in scatterplots can help alleviate this problem. With multiple zoom levels, more screen real estate is available, allowing objects to be placed in a less crowded way. We call this type of visualization scalable scatterplot visualizations, or SSV for short. Despite the potential of SSVs, existing systems and toolkits fall short in supporting the authoring of SSVs due to three limitations. First, many systems have limited scalability, assuming that data fits in the memory of one computer. Second, too much developer work, e.g., using custom code to generate mark layouts or render objects, is required. Third, many systems focus on only a small subset of the SSV design space (e.g. supporting a specific type of visual marks). To address these limitations, we have developed Kyrix-S, a system for easy authoring of SSVs at scale. Kyrix-S derives a declarative grammar that enables specification of a variety of SSVs in a few tens of lines of code, based on an existing survey of scatterplot tasks and designs. The declarative grammar is supported by a distributed layout algorithm which automatically places visual marks onto zoom levels. We store data in a multi-node database and use multi-node spatial indexes to achieve interactive browsing of large SSVs. Extensive experiments show that 1) Kyrix-S enables interactive browsing of SSVs of billions of objects, with response times under 500ms and 2) Kyrix-S achieves 4X-9X reduction in specification compared to a state-of-the-art authoring system.",
"title": "Kyrix-S: Authoring Scalable Scatterplot Visualizations of Big Data",
"normalizedTitle": "Kyrix-S: Authoring Scalable Scatterplot Visualizations of Big Data",
"fno": "09222038",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Authoring Systems",
"Big Data",
"Data Visualisation",
"Grammars",
"Real Time Systems",
"Rendering Computer Graphics",
"Kyrix S",
"Authoring Scalable Scatterplot Visualizations",
"Static Scatterplots",
"Overdraw Problem",
"Big Datasets",
"Object Overlap Causes Undesirable Visual Clutter",
"Multiple Zoom Levels",
"Screen Real Estate",
"Visualization Scalable Scatterplot Visualizations",
"Developer Work",
"Custom Code",
"Mark Layouts",
"Render Objects",
"Systems Focus",
"SSV Design Space",
"Visual Marks",
"Easy Authoring",
"Declarative Grammar",
"Scatterplot Tasks",
"State Of The Art Authoring System",
"SSV",
"Visualization",
"Data Visualization",
"Layout",
"Grammar",
"Scalability",
"Semantics",
"Heating Systems",
"Pan Zoom Visualization",
"Declarative Grammar",
"Scalability",
"Performance Optimization"
],
"authors": [
{
"givenName": "Wenbo",
"surname": "Tao",
"fullName": "Wenbo Tao",
"affiliation": "Massachusetts Institute of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xinli",
"surname": "Hou",
"fullName": "Xinli Hou",
"affiliation": "Zhejiang University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Adam",
"surname": "Sah",
"fullName": "Adam Sah",
"affiliation": "Zhejiang University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Leilani",
"surname": "Battle",
"fullName": "Leilani Battle",
"affiliation": "University of Maryland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Remco",
"surname": "Chang",
"fullName": "Remco Chang",
"affiliation": "Tufts University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Stonebraker",
"fullName": "Michael Stonebraker",
"affiliation": "Massachusetts Institute of Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "401-411",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vast/2014/6227/0/07042500",
"title": "A multidimensional brush for scatterplot data analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042500/12OmNxR5UJf",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111969",
"title": "3D Scatterplot Navigation",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111969/13rRUB6Sq0y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122634",
"title": "Empirical Guidance on Scatterplot and Dimension Reduction Technique Choices",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122634/13rRUEgs2BW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/10/ttg2013101768",
"title": "The Generalized Sensitivity Scatterplot",
"doi": null,
"abstractUrl": "/journal/tg/2013/10/ttg2013101768/13rRUwbs2gs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2010/06/mcg2010060003",
"title": "Improved Scatterplot Design",
"doi": null,
"abstractUrl": "/magazine/cg/2010/06/mcg2010060003/13rRUwjoNCc",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061100",
"title": "The FlowVizMenu and Parallel Scatterplot Matrix: Hybrid Multidimensional Visualizations for Network Exploration",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061100/13rRUxD9gXB",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/09/07332976",
"title": "The Connected Scatterplot for Presenting Paired Time Series",
"doi": null,
"abstractUrl": "/journal/tg/2016/09/07332976/13rRUyY294F",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09826389",
"title": "Automatic Scatterplot Design Optimization for Clustering Identification",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09826389/1EVdDTX0i2I",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2019/9226/0/922600a082",
"title": "Scatterplot Summarization by Constructing Fast and Robust Principal Graphs from Skeletons",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2019/922600a082/1cMF8150We4",
"parentPublication": {
"id": "proceedings/pacificvis/2019/9226/0",
"title": "2019 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/04/08889698",
"title": "Expressive Authoring of Node-Link Diagrams With Graphies",
"doi": null,
"abstractUrl": "/journal/tg/2021/04/08889698/1eBufwF6gne",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09222086",
"articleId": "1nTrpup4LZe",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09224186",
"articleId": "1nV8hTleAOk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04X",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1JqCybj0DBu",
"doi": "10.1109/TPAMI.2022.3232211",
"abstract": "A polarization camera has great potential for 3D reconstruction since the angle of polarization (AoP) and the degree of polarization (DoP) of reflected light are related to an object's surface normal. In this paper, we propose a novel 3D reconstruction method called Polarimetric Multi-View Inverse Rendering (Polarimetric MVIR) that effectively exploits geometric, photometric, and polarimetric cues extracted from input multi-view color-polarization images. We first estimate camera poses and an initial 3D model by geometric reconstruction with a standard structure-from-motion and multi-view stereo pipeline. We then refine the initial model by optimizing photometric rendering errors and polarimetric errors using multi-view RGB, AoP, and DoP images, where we propose a novel polarimetric cost function that enables an effective constraint on the estimated surface normal of each vertex, while considering four possible ambiguous azimuth angles revealed from the AoP measurement. The weight for the polarimetric cost is effectively determined based on the DoP measurement, which is regarded as the reliability of polarimetric information. Experimental results using both synthetic and real data demonstrate that our Polarimetric MVIR can reconstruct a detailed 3D shape without assuming a specific surface material and lighting condition.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A polarization camera has great potential for 3D reconstruction since the angle of polarization (AoP) and the degree of polarization (DoP) of reflected light are related to an object's surface normal. In this paper, we propose a novel 3D reconstruction method called Polarimetric Multi-View Inverse Rendering (Polarimetric MVIR) that effectively exploits geometric, photometric, and polarimetric cues extracted from input multi-view color-polarization images. We first estimate camera poses and an initial 3D model by geometric reconstruction with a standard structure-from-motion and multi-view stereo pipeline. We then refine the initial model by optimizing photometric rendering errors and polarimetric errors using multi-view RGB, AoP, and DoP images, where we propose a novel polarimetric cost function that enables an effective constraint on the estimated surface normal of each vertex, while considering four possible ambiguous azimuth angles revealed from the AoP measurement. The weight for the polarimetric cost is effectively determined based on the DoP measurement, which is regarded as the reliability of polarimetric information. Experimental results using both synthetic and real data demonstrate that our Polarimetric MVIR can reconstruct a detailed 3D shape without assuming a specific surface material and lighting condition.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A polarization camera has great potential for 3D reconstruction since the angle of polarization (AoP) and the degree of polarization (DoP) of reflected light are related to an object's surface normal. In this paper, we propose a novel 3D reconstruction method called Polarimetric Multi-View Inverse Rendering (Polarimetric MVIR) that effectively exploits geometric, photometric, and polarimetric cues extracted from input multi-view color-polarization images. We first estimate camera poses and an initial 3D model by geometric reconstruction with a standard structure-from-motion and multi-view stereo pipeline. We then refine the initial model by optimizing photometric rendering errors and polarimetric errors using multi-view RGB, AoP, and DoP images, where we propose a novel polarimetric cost function that enables an effective constraint on the estimated surface normal of each vertex, while considering four possible ambiguous azimuth angles revealed from the AoP measurement. The weight for the polarimetric cost is effectively determined based on the DoP measurement, which is regarded as the reliability of polarimetric information. Experimental results using both synthetic and real data demonstrate that our Polarimetric MVIR can reconstruct a detailed 3D shape without assuming a specific surface material and lighting condition.",
"title": "Polarimetric Multi-View Inverse Rendering",
"normalizedTitle": "Polarimetric Multi-View Inverse Rendering",
"fno": "09999345",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Surface Reconstruction",
"Three Dimensional Displays",
"Image Reconstruction",
"Cameras",
"Shape",
"Lighting",
"Rendering Computer Graphics",
"Multi View Reconstruction",
"Inverse Rendering",
"Polarization"
],
"authors": [
{
"givenName": "Jinyu",
"surname": "Zhao",
"fullName": "Jinyu Zhao",
"affiliation": "Department of System and Control Engineering, Tokyo Institute of Technology, Tokyo, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yusuke",
"surname": "Monno",
"fullName": "Yusuke Monno",
"affiliation": "Department of System and Control Engineering, Tokyo Institute of Technology, Tokyo, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Masatoshi",
"surname": "Okutomi",
"fullName": "Masatoshi Okutomi",
"affiliation": "Department of System and Control Engineering, Tokyo Institute of Technology, Tokyo, Japan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "1-16",
"year": "5555",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ssp/2007/1197/0/04301219",
"title": "Estimating the Polarization Degree of Polarimetric Images using Maximum Likelihood Methods",
"doi": null,
"abstractUrl": "/proceedings-article/ssp/2007/04301219/12OmNvnfkh4",
"parentPublication": {
"id": "proceedings/ssp/2007/1197/0",
"title": "Statistical Signal Processing, IEEE/SP Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2016/1437/0/1437a187",
"title": "A Polarimetric Thermal Database for Face Recognition Research",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2016/1437a187/12OmNyQpgKI",
"parentPublication": {
"id": "proceedings/cvprw/2016/1437/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457a369",
"title": "Polarimetric Multi-view Stereo",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457a369/12OmNyfdOLS",
"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/2018/6420/0/642000d857",
"title": "Polarimetric Dense Monocular SLAM",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000d857/17D45VObpOW",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200f017",
"title": "Polarimetric Helmholtz Stereopsis",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200f017/1BmGZZxT1RK",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600d105",
"title": "High-Quality RGB-D Reconstruction via Multi-View Uncalibrated Photometric Stereo and Gradient-SDF",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600d105/1KxVaVLkeLS",
"parentPublication": {
"id": "proceedings/wacv/2023/9346/0",
"title": "2023 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800b679",
"title": "Multi-View Neural Human Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800b679/1m3nrZeJhvy",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800c133",
"title": "Polarized Non-Line-of-Sight Imaging",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800c133/1m3oizGbFF6",
"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/iccp/2021/1952/0/09466274",
"title": "View-dependent Scene Appearance Synthesis using Inverse Rendering from Light Fields",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2021/09466274/1uSSV7tRhSw",
"parentPublication": {
"id": "proceedings/iccp/2021/1952/0",
"title": "2021 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900a682",
"title": "Polarimetric Normal Stereo",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900a682/1yeKWAAPb0I",
"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": "09998118",
"articleId": "1JlF1sgL0Os",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09999032",
"articleId": "1JqCyogB2Q8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1JDoVMiPLz2",
"name": "ttp555501-09999345s1-supp1-3232211.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp555501-09999345s1-supp1-3232211.pdf",
"extension": "pdf",
"size": "6.55 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04X",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1KJs5SH0na8",
"doi": "10.1109/TPAMI.2023.3244658",
"abstract": "Recently, many advances in inverse rendering are achieved by high-dimensional lighting representations and differentiable rendering. However, multi-bounce lighting effects can hardly be handled correctly in scene editing using high-dimensional lighting representations, and light source model deviation and ambiguities exist in differentiable rendering methods. These problems limit the applications of inverse rendering. In this paper, we present a multi-bounce inverse rendering method based on Monte Carlo path tracing, to enable correct complex multi-bounce lighting effects rendering in scene editing. We propose a novel light source model that is more suitable for light source editing in indoor scenes, and design a specific neural network with corresponding disambiguation constraints to alleviate ambiguities during the inverse rendering. We evaluate our method on both synthetic and real indoor scenes through virtual object insertion, material editing, relighting tasks, and so on. The results demonstrate that our method achieves better photo-realistic quality.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recently, many advances in inverse rendering are achieved by high-dimensional lighting representations and differentiable rendering. However, multi-bounce lighting effects can hardly be handled correctly in scene editing using high-dimensional lighting representations, and light source model deviation and ambiguities exist in differentiable rendering methods. These problems limit the applications of inverse rendering. In this paper, we present a multi-bounce inverse rendering method based on Monte Carlo path tracing, to enable correct complex multi-bounce lighting effects rendering in scene editing. We propose a novel light source model that is more suitable for light source editing in indoor scenes, and design a specific neural network with corresponding disambiguation constraints to alleviate ambiguities during the inverse rendering. We evaluate our method on both synthetic and real indoor scenes through virtual object insertion, material editing, relighting tasks, and so on. The results demonstrate that our method achieves better photo-realistic quality.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recently, many advances in inverse rendering are achieved by high-dimensional lighting representations and differentiable rendering. However, multi-bounce lighting effects can hardly be handled correctly in scene editing using high-dimensional lighting representations, and light source model deviation and ambiguities exist in differentiable rendering methods. These problems limit the applications of inverse rendering. In this paper, we present a multi-bounce inverse rendering method based on Monte Carlo path tracing, to enable correct complex multi-bounce lighting effects rendering in scene editing. We propose a novel light source model that is more suitable for light source editing in indoor scenes, and design a specific neural network with corresponding disambiguation constraints to alleviate ambiguities during the inverse rendering. We evaluate our method on both synthetic and real indoor scenes through virtual object insertion, material editing, relighting tasks, and so on. The results demonstrate that our method achieves better photo-realistic quality.",
"title": "MILO: Multi-bounce Inverse Rendering for Indoor Scene with Light-emitting Objects",
"normalizedTitle": "MILO: Multi-bounce Inverse Rendering for Indoor Scene with Light-emitting Objects",
"fno": "10043749",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Rendering Computer Graphics",
"Lighting",
"Light Sources",
"Geometry",
"Task Analysis",
"Image Decomposition",
"Estimation",
"Inverse Rendering",
"Intrinsic Image Decomposition",
"Multi Bounce"
],
"authors": [
{
"givenName": "Bohan",
"surname": "Yu",
"fullName": "Bohan Yu",
"affiliation": "National Engineering Research Center of Visual Technology, School of Computer Science, Peking University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Siqi",
"surname": "Yang",
"fullName": "Siqi Yang",
"affiliation": "Institute for Artificial Intelligence, Peking University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xuanning",
"surname": "Cui",
"fullName": "Xuanning Cui",
"affiliation": "AI Innovation Center, School of Computer Science, Peking University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Siyan",
"surname": "Dong",
"fullName": "Siyan Dong",
"affiliation": "Interdisciplinary Research Center, Shandong University, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Baoquan",
"surname": "Chen",
"fullName": "Baoquan Chen",
"affiliation": "School of Intelligence Science and Technology, Peking University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Boxin",
"surname": "Shi",
"fullName": "Boxin Shi",
"affiliation": "National Engineering Research Center of Visual Technology, School of Computer Science, Peking University, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-02-01 00:00:00",
"pubType": "trans",
"pages": "1-14",
"year": "5555",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/fg/2015/6026/1/07163128",
"title": "Realistic inverse lighting from a single 2D image of a face, taken under unknown and complex lighting",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2015/07163128/12OmNwbLVkr",
"parentPublication": {
"id": "proceedings/fg/2015/6026/5",
"title": "2015 11th IEEE International Conference and Workshops on Automatic Face and Gesture Recognition (FG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200m2518",
"title": "Learning Indoor Inverse Rendering with 3D Spatially-Varying Lighting",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200m2518/1BmI8MZrhYY",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09887904",
"title": "Fast and Accurate Illumination Estimation Using LDR Panoramic Images for Realistic Rendering",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09887904/1GBRnHyZ1bW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09904431",
"title": "Neural Global Illumination: Interactive Indirect Illumination Prediction under Dynamic Area Lights",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09904431/1H0GdxnVnws",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600c812",
"title": "IRISformer: Dense Vision Transformers for Single-Image Inverse Rendering in Indoor Scenes",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600c812/1H0OiAWLYsw",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600m2703",
"title": "PhyIR: Physics-based Inverse Rendering for Panoramic Indoor Images",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600m2703/1H1l4vBZwac",
"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/3dv/2022/5670/0/567000a711",
"title": "GAN2X: Non-Lambertian Inverse Rendering of Image GANs",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2022/567000a711/1KYsuznLNpm",
"parentPublication": {
"id": "proceedings/3dv/2022/5670/0",
"title": "2022 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300i597",
"title": "Neural Inverse Rendering of an Indoor Scene From a Single Image",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300i597/1hVlOrVOpck",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800c472",
"title": "Inverse Rendering for Complex Indoor Scenes: Shape, Spatially-Varying Lighting and SVBRDF From a Single Image",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800c472/1m3o03C864M",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/07/09351628",
"title": "Outdoor Inverse Rendering From a Single Image Using Multiview Self-Supervision",
"doi": null,
"abstractUrl": "/journal/tp/2022/07/09351628/1r50mR8TOve",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10042051",
"articleId": "1KEtg6pZUMo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10044259",
"articleId": "1KL6SJ4jOzS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1KL6SW5SBDq",
"name": "ttp555501-010043749s1-supp1-3244658.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp555501-010043749s1-supp1-3244658.mp4",
"extension": "mp4",
"size": "7.43 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1HMOit1lSk8",
"title": "Dec.",
"year": "2022",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1vyjumhb4ZO",
"doi": "10.1109/TVCG.2021.3099480",
"abstract": "Real-time dense SLAM techniques aim to reconstruct the dense three-dimensional geometry of a scene in real time with an RGB or RGB-D sensor. An indoor scene is an important type of working environment for these techniques. The planar prior can be used in this scenario to improve the reconstruction quality, especially for large low-texture regions that commonly occur in an indoor scene. This article fully explores the planar prior in a dense SLAM pipeline. First, we propose a novel plane detection and segmentation method that runs at 200 Hz on a modern graphics processing unit. Our algorithm for constructing global plane constraints is very efficient; hence, we use it in the process of each input frame for the camera pose estimation while maintaining the real-time performance. Second, we propose herein a plane-based map representation that greatly reduces the memory footprint of plane regions while keeping the geometric details on planes. The experiments reveal that our system yields superior reconstruction results with planar information running at more than 30 fps. Aside from speed and storage improvements, our technique also handles the low-texture problem in plane regions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Real-time dense SLAM techniques aim to reconstruct the dense three-dimensional geometry of a scene in real time with an RGB or RGB-D sensor. An indoor scene is an important type of working environment for these techniques. The planar prior can be used in this scenario to improve the reconstruction quality, especially for large low-texture regions that commonly occur in an indoor scene. This article fully explores the planar prior in a dense SLAM pipeline. First, we propose a novel plane detection and segmentation method that runs at 200 Hz on a modern graphics processing unit. Our algorithm for constructing global plane constraints is very efficient; hence, we use it in the process of each input frame for the camera pose estimation while maintaining the real-time performance. Second, we propose herein a plane-based map representation that greatly reduces the memory footprint of plane regions while keeping the geometric details on planes. The experiments reveal that our system yields superior reconstruction results with planar information running at more than 30 fps. Aside from speed and storage improvements, our technique also handles the low-texture problem in plane regions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Real-time dense SLAM techniques aim to reconstruct the dense three-dimensional geometry of a scene in real time with an RGB or RGB-D sensor. An indoor scene is an important type of working environment for these techniques. The planar prior can be used in this scenario to improve the reconstruction quality, especially for large low-texture regions that commonly occur in an indoor scene. This article fully explores the planar prior in a dense SLAM pipeline. First, we propose a novel plane detection and segmentation method that runs at 200 Hz on a modern graphics processing unit. Our algorithm for constructing global plane constraints is very efficient; hence, we use it in the process of each input frame for the camera pose estimation while maintaining the real-time performance. Second, we propose herein a plane-based map representation that greatly reduces the memory footprint of plane regions while keeping the geometric details on planes. The experiments reveal that our system yields superior reconstruction results with planar information running at more than 30 fps. Aside from speed and storage improvements, our technique also handles the low-texture problem in plane regions.",
"title": "PlaneFusion: Real-Time Indoor Scene Reconstruction With Planar Prior",
"normalizedTitle": "PlaneFusion: Real-Time Indoor Scene Reconstruction With Planar Prior",
"fno": "09496211",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Cameras",
"Geometry",
"Graphics Processing Units",
"Image Colour Analysis",
"Image Reconstruction",
"Image Segmentation",
"Image Sensors",
"Image Texture",
"Mobile Robots",
"Pose Estimation",
"Robot Vision",
"SLAM Robots",
"Dense SLAM Pipeline",
"Frequency 200 0 Hz",
"Global Plane Constraints",
"Important Type",
"Low Texture Problem",
"Low Texture Regions",
"Modern Graphics Processing Unit",
"Planar Information",
"Plane Detection",
"Plane Regions",
"Plane Based Map Representation",
"Real Time Dense SLAM Techniques",
"Real Time Indoor Scene Reconstruction",
"Real Time Performance",
"Reconstruction Quality",
"Segmentation Method",
"System Yields Superior Reconstruction Results",
"Three Dimensional Geometry",
"Working Environment",
"Cameras",
"Three Dimensional Displays",
"Real Time Systems",
"Optimization",
"Simultaneous Localization And Mapping",
"Geometry",
"Image Reconstruction",
"3 D Reconstruction",
"SLAM",
"Plane Detection",
"Real Time"
],
"authors": [
{
"givenName": "Bingjian",
"surname": "Gong",
"fullName": "Bingjian Gong",
"affiliation": "Department of Automation, Hangzhou Dianzi University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zunjie",
"surname": "Zhu",
"fullName": "Zunjie Zhu",
"affiliation": "Department of Automation, Hangzhou Dianzi University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chenggang",
"surname": "Yan",
"fullName": "Chenggang Yan",
"affiliation": "Department of Automation, Hangzhou Dianzi University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhiguo",
"surname": "Shi",
"fullName": "Zhiguo Shi",
"affiliation": "College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Feng",
"surname": "Xu",
"fullName": "Feng Xu",
"affiliation": "BNRIST and School of Software, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "4671-4684",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ismar/2014/6184/0/06948422",
"title": "Dense planar SLAM",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2014/06948422/12OmNx7G661",
"parentPublication": {
"id": "proceedings/ismar/2014/6184/0",
"title": "2014 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dimpvt/2012/4873/0/4873a230",
"title": "Semi-dense Piecewise Planar Stereo Reconstruction Using SymStereo and PEARL",
"doi": null,
"abstractUrl": "/proceedings-article/3dimpvt/2012/4873a230/12OmNy50g5x",
"parentPublication": {
"id": "proceedings/3dimpvt/2012/4873/0",
"title": "2012 Second International Conference on 3D Imaging, Modeling, Processing, Visualization & Transmission",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2014/2871/0/06802045",
"title": "Transitional Augmented Reality navigation for live captured scenes",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2014/06802045/12OmNyRPgKH",
"parentPublication": {
"id": "proceedings/vr/2014/2871/0",
"title": "2014 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2017/2610/0/261001a185",
"title": "Relative Camera Refinement for Accurate Dense Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2017/261001a185/12OmNzmtWvT",
"parentPublication": {
"id": "proceedings/3dv/2017/2610/0",
"title": "2017 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000c560",
"title": "CodeSLAM - Learning a Compact, Optimisable Representation for Dense Visual SLAM",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000c560/17D45VUZMVf",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2018/8425/0/842500a616",
"title": "Multi-planar Monocular Reconstruction of Manhattan Indoor Scenes",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2018/842500a616/17D45XvMcbo",
"parentPublication": {
"id": "proceedings/3dv/2018/8425/0",
"title": "2018 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600m2776",
"title": "NICE-SLAM: Neural Implicit Scalable Encoding for SLAM",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600m2776/1H1jhZSaE0M",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2020/10/08868189",
"title": "SurfelMeshing: Online Surfel-Based Mesh Reconstruction",
"doi": null,
"abstractUrl": "/journal/tp/2020/10/08868189/1e7BX0ZwdrO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2019/3131/0/313100a574",
"title": "Mobile Photometric Stereo with Keypoint-Based SLAM for Dense 3D Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2019/313100a574/1ezREwjZfFe",
"parentPublication": {
"id": "proceedings/3dv/2019/3131/0",
"title": "2019 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2020/0497/0/049700a287",
"title": "A novel SLAM method for laparoscopic scene reconstruction with feature patch tracking",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2020/049700a287/1vg7UqDNZIY",
"parentPublication": {
"id": "proceedings/icvrv/2020/0497/0",
"title": "2020 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09495106",
"articleId": "1vyjtwGIZkQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09495135",
"articleId": "1vyjtJyV16g",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1HMORyelC0M",
"name": "ttg202212-09496211s1-supp1-3099480.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202212-09496211s1-supp1-3099480.pdf",
"extension": "pdf",
"size": "586 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAPBbfM",
"title": "Oct.",
"year": "2019",
"issueNum": "10",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgs2Mb",
"doi": "10.1109/TVCG.2018.2860016",
"abstract": "We present a novel 3D model-guided interface for in-situ sketching on 3D planes. Our work is motivated by evolutionary design, where existing 3D objects form the basis for conceptual re-design or further design exploration. We contribute a novel workflow that exploits the geometry of an underlying 3D model to infer 3D planes on which 2D strokes drawn that are on and around the 3D model should be meaningfully projected. This provides users with the nearly modeless fluidity of a sketching interface, and is particularly useful for 3D sketching over planes that are not easily accessible or do not preexist. We also provide an additional set of tools, including sketching with explicit plane selection and model-aware canvas manipulation. Our system is evaluated with a user study, showing that our technique is easy to learn and effective for rapid sketching of product design variations around existing 3D models.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a novel 3D model-guided interface for in-situ sketching on 3D planes. Our work is motivated by evolutionary design, where existing 3D objects form the basis for conceptual re-design or further design exploration. We contribute a novel workflow that exploits the geometry of an underlying 3D model to infer 3D planes on which 2D strokes drawn that are on and around the 3D model should be meaningfully projected. This provides users with the nearly modeless fluidity of a sketching interface, and is particularly useful for 3D sketching over planes that are not easily accessible or do not preexist. We also provide an additional set of tools, including sketching with explicit plane selection and model-aware canvas manipulation. Our system is evaluated with a user study, showing that our technique is easy to learn and effective for rapid sketching of product design variations around existing 3D models.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a novel 3D model-guided interface for in-situ sketching on 3D planes. Our work is motivated by evolutionary design, where existing 3D objects form the basis for conceptual re-design or further design exploration. We contribute a novel workflow that exploits the geometry of an underlying 3D model to infer 3D planes on which 2D strokes drawn that are on and around the 3D model should be meaningfully projected. This provides users with the nearly modeless fluidity of a sketching interface, and is particularly useful for 3D sketching over planes that are not easily accessible or do not preexist. We also provide an additional set of tools, including sketching with explicit plane selection and model-aware canvas manipulation. Our system is evaluated with a user study, showing that our technique is easy to learn and effective for rapid sketching of product design variations around existing 3D models.",
"title": "Model-Guided 3D Sketching",
"normalizedTitle": "Model-Guided 3D Sketching",
"fno": "08421591",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Geometry",
"Product Design",
"Solid Modelling",
"User Interfaces",
"Model Aware Canvas Manipulation",
"Product Design Variations",
"Model Guided 3 D Sketching",
"In Situ Sketching",
"Evolutionary Design",
"Design Exploration",
"Infer 3 D",
"Sketching Interface",
"3 D Objects",
"Conceptual Redesign",
"Plane Selection",
"3 D Model Guided Interface",
"Three Dimensional Displays",
"Solid Modeling",
"Geometry",
"User Interfaces",
"Product Design",
"3 D Sketching",
"Conceptual Design",
"Interface",
"Canvas"
],
"authors": [
{
"givenName": "Pengfei",
"surname": "Xu",
"fullName": "Pengfei Xu",
"affiliation": "College of Computer Science & Software Engineering, Shenzhen University, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongbo",
"surname": "Fu",
"fullName": "Hongbo Fu",
"affiliation": "School of Creative Media, the City University of Hong Kong, Kowloon Tong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Youyi",
"surname": "Zheng",
"fullName": "Youyi Zheng",
"affiliation": "College of Computer Science, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Karan",
"surname": "Singh",
"fullName": "Karan Singh",
"affiliation": "Department of Computer Science, the University of Toronto, Toronto, Ontario, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hui",
"surname": "Huang",
"fullName": "Hui Huang",
"affiliation": "College of Computer Science & Software Engineering, Shenzhen University, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chiew-Lan",
"surname": "Tai",
"fullName": "Chiew-Lan Tai",
"affiliation": "Department of Computer Science & Engineering, the Hong Kong University of Science & Technology, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2019-10-01 00:00:00",
"pubType": "trans",
"pages": "2927-2939",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dui/2013/6097/0/06550222",
"title": "Poster: 3D sketching and flexible input for surface design: A case study",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2013/06550222/12OmNBBzoe4",
"parentPublication": {
"id": "proceedings/3dui/2013/6097/0",
"title": "2013 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2013/2576/0/06815042",
"title": "InSide: Interactive Sketching for Image Database Exploration",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2013/06815042/12OmNCmpcGZ",
"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/csse/2008/3336/2/3336d049",
"title": "An Interactive Sketching Modeling System: Sketch3D",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336d049/12OmNroij4Y",
"parentPublication": {
"id": "proceedings/csse/2008/3336/6",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/coginf/2010/8042/0/05599690",
"title": "Cognitive garment design interface using user behavior tree model",
"doi": null,
"abstractUrl": "/proceedings-article/coginf/2010/05599690/12OmNvDZEYX",
"parentPublication": {
"id": "proceedings/coginf/2010/8042/0",
"title": "2010 9th IEEE International Conference on Cognitive Informatics (ICCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2016/0842/0/07460073",
"title": "3D sketching on interactively unfolded vascular structures for treatment planning",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2016/07460073/12OmNx7G663",
"parentPublication": {
"id": "proceedings/3dui/2016/0842/0",
"title": "2016 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2010/6237/0/05444806",
"title": "In-Place Sketching for content authoring in Augmented Reality games",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2010/05444806/12OmNxveNJV",
"parentPublication": {
"id": "proceedings/vr/2010/6237/0",
"title": "2010 IEEE Virtual Reality Conference (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2010/4215/0/4215a105",
"title": "Reference Plane Assisted Sketching Interface for 3D Freeform Shape Design",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2010/4215a105/12OmNz2C1zv",
"parentPublication": {
"id": "proceedings/cw/2010/4215/0",
"title": "2010 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/07/08580421",
"title": "CaricatureShop: Personalized and Photorealistic Caricature Sketching",
"doi": null,
"abstractUrl": "/journal/tg/2020/07/08580421/17D45XfSEU4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2023/4815/0/481500a367",
"title": "WARPY: Sketching Environment-Aware 3D Curves in Mobile Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2023/481500a367/1MNgJRvtdtu",
"parentPublication": {
"id": "proceedings/vr/2023/4815/0",
"title": "2023 IEEE Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2021/1838/0/255600a826",
"title": "Mid-Air Finger Sketching for Tree Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2021/255600a826/1tuBbGEUWm4",
"parentPublication": {
"id": "proceedings/vr/2021/1838/0",
"title": "2021 IEEE Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08434353",
"articleId": "13rRUy2YLYE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08438968",
"articleId": "13rRUwjoNx8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"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": "1fTdX59qZUs",
"doi": "10.1109/TVCG.2019.2960776",
"abstract": "Scanning and acquiring a 3D indoor environment suffers from complex occlusions and misalignment errors. The reconstruction obtained from an RGB-D scanner contains holes in geometry and ghosting in texture. These are easily noticeable and cannot be considered as visually compelling VR content without further processing. On the other hand, the well-known Manhattan World priors successfully recreate relatively simple structures. In this article, we would like to push the limit of planar representation in indoor environments. Given an initial 3D reconstruction captured by an RGB-D sensor, we use planes not only to represent the environment geometrically but also to solve an inverse rendering problem considering texture and light. The complex process of shape inference and intrinsic imaging is greatly simplified with the help of detected planes and yet produces a realistic 3D indoor environment. The generated content can adequately represent the spatial arrangements for various AR/VR applications and can be readily composited with virtual objects possessing plausible lighting and texture.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Scanning and acquiring a 3D indoor environment suffers from complex occlusions and misalignment errors. The reconstruction obtained from an RGB-D scanner contains holes in geometry and ghosting in texture. These are easily noticeable and cannot be considered as visually compelling VR content without further processing. On the other hand, the well-known Manhattan World priors successfully recreate relatively simple structures. In this article, we would like to push the limit of planar representation in indoor environments. Given an initial 3D reconstruction captured by an RGB-D sensor, we use planes not only to represent the environment geometrically but also to solve an inverse rendering problem considering texture and light. The complex process of shape inference and intrinsic imaging is greatly simplified with the help of detected planes and yet produces a realistic 3D indoor environment. The generated content can adequately represent the spatial arrangements for various AR/VR applications and can be readily composited with virtual objects possessing plausible lighting and texture.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Scanning and acquiring a 3D indoor environment suffers from complex occlusions and misalignment errors. The reconstruction obtained from an RGB-D scanner contains holes in geometry and ghosting in texture. These are easily noticeable and cannot be considered as visually compelling VR content without further processing. On the other hand, the well-known Manhattan World priors successfully recreate relatively simple structures. In this article, we would like to push the limit of planar representation in indoor environments. Given an initial 3D reconstruction captured by an RGB-D sensor, we use planes not only to represent the environment geometrically but also to solve an inverse rendering problem considering texture and light. The complex process of shape inference and intrinsic imaging is greatly simplified with the help of detected planes and yet produces a realistic 3D indoor environment. The generated content can adequately represent the spatial arrangements for various AR/VR applications and can be readily composited with virtual objects possessing plausible lighting and texture.",
"title": "Planar Abstraction and Inverse Rendering of 3D Indoor Environments",
"normalizedTitle": "Planar Abstraction and Inverse Rendering of 3D Indoor Environments",
"fno": "08936883",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Geometry",
"Image Colour Analysis",
"Image Reconstruction",
"Lighting",
"Rendering Computer Graphics",
"Virtual Reality",
"Misalignment Errors",
"RGB D Scanner",
"Geometry",
"Ghosting",
"Visually Compelling VR Content",
"Manhattan World",
"Planar Representation",
"Indoor Environments",
"RGB D Sensor",
"Inverse Rendering Problem",
"Complex Process",
"Realistic 3 D Indoor Environment",
"Planar Abstraction",
"Complex Occlusions",
"AR VR Applications",
"3 D Reconstruction",
"Geometry",
"Rendering Computer Graphics",
"Indoor Environment",
"Three Dimensional Displays",
"Lighting",
"Image Reconstruction",
"Semantics",
"3 D Content Creation",
"Indoor Modeling",
"Texture Generation",
"Inverse Rendering"
],
"authors": [
{
"givenName": "Young Min",
"surname": "Kim",
"fullName": "Young Min Kim",
"affiliation": "Seoul National University, Seoul, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sangwoo",
"surname": "Ryu",
"fullName": "Sangwoo Ryu",
"affiliation": "Pohang University of Science and Technology (POSTECH), Pohang-si, Gyeongsangbuk-do, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ig-Jae",
"surname": "Kim",
"fullName": "Ig-Jae Kim",
"affiliation": "Korea Institute of Science and Technology (KIST), Seoul, Republic of Korea",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "06",
"pubDate": "2021-06-01 00:00:00",
"pubType": "trans",
"pages": "2992-3006",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/mmit/2008/3556/0/3556a646",
"title": "Automatic Depth Map Estimation of Monocular Indoor Environments",
"doi": null,
"abstractUrl": "/proceedings-article/mmit/2008/3556a646/12OmNzlUKkv",
"parentPublication": {
"id": "proceedings/mmit/2008/3556/0",
"title": "MultiMedia and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2018/8425/0/842500a533",
"title": "Plane-Based Optimization of Geometry and Texture for RGB-D Reconstruction of Indoor Scenes",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2018/842500a533/17D45Wda7eK",
"parentPublication": {
"id": "proceedings/3dv/2018/8425/0",
"title": "2018 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200m2518",
"title": "Learning Indoor Inverse Rendering with 3D Spatially-Varying Lighting",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200m2518/1BmI8MZrhYY",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600m2703",
"title": "PhyIR: Physics-based Inverse Rendering for Panoramic Indoor Images",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600m2703/1H1l4vBZwac",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600s8541",
"title": "PhotoScene: Photorealistic Material and Lighting Transfer for Indoor Scenes",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600s8541/1H1nmFHmaoE",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/09999345",
"title": "Polarimetric Multi-View Inverse Rendering",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/09999345/1JqCybj0DBu",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/10043749",
"title": "MILO: Multi-bounce Inverse Rendering for Indoor Scene with Light-emitting Objects",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/10043749/1KJs5SH0na8",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300i597",
"title": "Neural Inverse Rendering of an Indoor Scene From a Single Image",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300i597/1hVlOrVOpck",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800c472",
"title": "Inverse Rendering for Complex Indoor Scenes: Shape, Spatially-Varying Lighting and SVBRDF From a Single Image",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800c472/1m3o03C864M",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09496211",
"title": "PlaneFusion: Real-Time Indoor Scene Reconstruction With Planar Prior",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09496211/1vyjumhb4ZO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09350177",
"articleId": "1r3l972fCk8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09127500",
"articleId": "1l3usFNJqkU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1txPJn8RhRK",
"name": "ttg202106-08936883s1-supp1-2960776.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202106-08936883s1-supp1-2960776.mp4",
"extension": "mp4",
"size": "80.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBCZnUr",
"title": "July",
"year": "2019",
"issueNum": "07",
"idPrefix": "tp",
"pubType": "journal",
"volume": "41",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIIVllP",
"doi": "10.1109/TPAMI.2018.2845393",
"abstract": "In this paper, a novel convolutional neural network (CNN)-based framework is developed for light field reconstruction from a sparse set of views. We indicate that the reconstruction can be efficiently modeled as angular restoration on an epipolar plane image (EPI). The main problem in direct reconstruction on the EPI involves an information asymmetry between the spatial and angular dimensions, where the detailed portion in the angular dimensions is damaged by undersampling. Directly upsampling or super-resolving the light field in the angular dimensions causes ghosting effects. To suppress these ghosting effects, we contribute a novel “blur-restoration-deblur” framework. First, the “blur” step is applied to extract the low-frequency components of the light field in the spatial dimensions by convolving each EPI slice with a selected blur kernel. Then, the “restoration” step is implemented by a CNN, which is trained to restore the angular details of the EPI. Finally, we use a non-blind “deblur” operation to recover the spatial high frequencies suppressed by the EPI blur. We evaluate our approach on several datasets, including synthetic scenes, real-world scenes and challenging microscope light field data. We demonstrate the high performance and robustness of the proposed framework compared with state-of-the-art algorithms. We further show extended applications, including depth enhancement and interpolation for unstructured input. More importantly, a novel rendering approach is presented by combining the proposed framework and depth information to handle large disparities.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, a novel convolutional neural network (CNN)-based framework is developed for light field reconstruction from a sparse set of views. We indicate that the reconstruction can be efficiently modeled as angular restoration on an epipolar plane image (EPI). The main problem in direct reconstruction on the EPI involves an information asymmetry between the spatial and angular dimensions, where the detailed portion in the angular dimensions is damaged by undersampling. Directly upsampling or super-resolving the light field in the angular dimensions causes ghosting effects. To suppress these ghosting effects, we contribute a novel “blur-restoration-deblur” framework. First, the “blur” step is applied to extract the low-frequency components of the light field in the spatial dimensions by convolving each EPI slice with a selected blur kernel. Then, the “restoration” step is implemented by a CNN, which is trained to restore the angular details of the EPI. Finally, we use a non-blind “deblur” operation to recover the spatial high frequencies suppressed by the EPI blur. We evaluate our approach on several datasets, including synthetic scenes, real-world scenes and challenging microscope light field data. We demonstrate the high performance and robustness of the proposed framework compared with state-of-the-art algorithms. We further show extended applications, including depth enhancement and interpolation for unstructured input. More importantly, a novel rendering approach is presented by combining the proposed framework and depth information to handle large disparities.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, a novel convolutional neural network (CNN)-based framework is developed for light field reconstruction from a sparse set of views. We indicate that the reconstruction can be efficiently modeled as angular restoration on an epipolar plane image (EPI). The main problem in direct reconstruction on the EPI involves an information asymmetry between the spatial and angular dimensions, where the detailed portion in the angular dimensions is damaged by undersampling. Directly upsampling or super-resolving the light field in the angular dimensions causes ghosting effects. To suppress these ghosting effects, we contribute a novel “blur-restoration-deblur” framework. First, the “blur” step is applied to extract the low-frequency components of the light field in the spatial dimensions by convolving each EPI slice with a selected blur kernel. Then, the “restoration” step is implemented by a CNN, which is trained to restore the angular details of the EPI. Finally, we use a non-blind “deblur” operation to recover the spatial high frequencies suppressed by the EPI blur. We evaluate our approach on several datasets, including synthetic scenes, real-world scenes and challenging microscope light field data. We demonstrate the high performance and robustness of the proposed framework compared with state-of-the-art algorithms. We further show extended applications, including depth enhancement and interpolation for unstructured input. More importantly, a novel rendering approach is presented by combining the proposed framework and depth information to handle large disparities.",
"title": "Light Field Reconstruction Using Convolutional Network on EPI and Extended Applications",
"normalizedTitle": "Light Field Reconstruction Using Convolutional Network on EPI and Extended Applications",
"fno": "08375807",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Convolutional Neural Nets",
"Image Motion Analysis",
"Image Reconstruction",
"Image Resolution",
"Image Restoration",
"Image Sampling",
"Image Segmentation",
"Image Sequences",
"Interpolation",
"Rendering Computer Graphics",
"Light Field Reconstruction",
"CNN",
"Angular Restoration",
"Epipolar Plane Image",
"Direct Reconstruction",
"Spatial Dimensions",
"Angular Dimensions",
"Ghosting Effects",
"Blur Step",
"EPI Slice",
"Selected Blur Kernel",
"Restoration Step",
"Angular Details",
"Spatial High Frequencies",
"EPI Blur",
"Interpolation",
"Depth Enhancement",
"Blur Restoration Deblur Framework",
"Microscope Light Field Data",
"Convolutional Neural Network Based Framework",
"Image Reconstruction",
"Spatial Resolution",
"Image Restoration",
"Microscopy",
"Interpolation",
"Rendering Computer Graphics",
"Light Field Reconstruction",
"Convolutional Neural Network",
"Epipolar Plane Image",
"Depth Assisted Rendering"
],
"authors": [
{
"givenName": "Gaochang",
"surname": "Wu",
"fullName": "Gaochang Wu",
"affiliation": "State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, P. R. China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yebin",
"surname": "Liu",
"fullName": "Yebin Liu",
"affiliation": "Department of Automation, Broadband Network & Digital Media Lab, Tsinghua University, Beijing, P. R. China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lu",
"surname": "Fang",
"fullName": "Lu Fang",
"affiliation": "Tsinghua-Berkeley Shenzhen Institute, Shenzhen, P. R. China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qionghai",
"surname": "Dai",
"fullName": "Qionghai Dai",
"affiliation": "Department of Automation, Broadband Network & Digital Media Lab, Tsinghua University, Beijing, P. R. China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tianyou",
"surname": "Chai",
"fullName": "Tianyou Chai",
"affiliation": "State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, P. R. China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2019-07-01 00:00:00",
"pubType": "trans",
"pages": "1681-1694",
"year": "2019",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icmew/2015/7079/0/07169836",
"title": "Light field depth estimation exploiting linear structure in EPI",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2015/07169836/12OmNC4eSyV",
"parentPublication": {
"id": "proceedings/icmew/2015/7079/0",
"title": "2015 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457b638",
"title": "Light Field Reconstruction Using Deep Convolutional Network on EPI",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457b638/12OmNyL0TKK",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2015/9711/0/5720a057",
"title": "Learning a Deep Convolutional Network for Light-Field Image Super-Resolution",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2015/5720a057/12OmNyL0TyY",
"parentPublication": {
"id": "proceedings/iccvw/2015/9711/0",
"title": "2015 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2018/01/07817742",
"title": "Light Field Reconstruction Using Shearlet Transform",
"doi": null,
"abstractUrl": "/journal/tp/2018/01/07817742/13rRUILtJsh",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08545490",
"title": "Scale and Orientation Aware EPI-Patch Learning for Light Field Depth Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08545490/17D45VWpMzh",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccbd/2022/5716/0/10079964",
"title": "Multiple Magnification Spatial Super-Resolution Network for Light Field Images Based on EPI Solid",
"doi": null,
"abstractUrl": "/proceedings-article/iccbd/2022/10079964/1LSP47RLwFq",
"parentPublication": {
"id": "proceedings/iccbd/2022/5716/0",
"title": "2022 5th International Conference on Computing and Big Data (ICCBD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2021/03/08854138",
"title": "High-Dimensional Dense Residual Convolutional Neural Network for Light Field Reconstruction",
"doi": null,
"abstractUrl": "/journal/tp/2021/03/08854138/1dM2dOAAMh2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/08924770",
"title": "Revisiting Spatio-Angular Trade-off in Light Field Cameras and Extended Applications in Super-Resolution",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/08924770/1fvZlX1pNU4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300h810",
"title": "View-Consistent 4D Light Field Superpixel Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300h810/1hVlRcBha3m",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2020/6532/0/09090524",
"title": "Light Field Editing Propagation using 4D Convolutional Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090524/1jIxjGuj4zK",
"parentPublication": {
"id": "proceedings/vrw/2020/6532/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08364622",
"articleId": "13rRUEgs2Ni",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08378001",
"articleId": "13rRUIJcWmA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1aAFNbLm1Xi",
"name": "ttp201907-08375807s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp201907-08375807s1.zip",
"extension": "zip",
"size": "38.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrFBPWq",
"title": "September-October",
"year": "2006",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "12",
"label": "September-October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxly8SO",
"doi": "10.1109/TVCG.2006.138",
"abstract": "We have previously shown that random sampling is an effective clutter reduction technique and that a sampling lens can facilitate focus+context viewing of particular regions. This demands an efficient method of estimating the overlap or occlusion of large numbers of intersecting lines in order to automatically adjust the sampling rate within the lens. This paper proposes several ways for measuring occlusion in parallel coordinate plots. An empirical study into the accuracy and efficiency of the occlusion measures show that a probabilistic approach combined with a ÔbinningÕ technique is very fast and yet approaches the accuracy of the more expensive ÔtrueÕ complete measurement.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We have previously shown that random sampling is an effective clutter reduction technique and that a sampling lens can facilitate focus+context viewing of particular regions. This demands an efficient method of estimating the overlap or occlusion of large numbers of intersecting lines in order to automatically adjust the sampling rate within the lens. This paper proposes several ways for measuring occlusion in parallel coordinate plots. An empirical study into the accuracy and efficiency of the occlusion measures show that a probabilistic approach combined with a ÔbinningÕ technique is very fast and yet approaches the accuracy of the more expensive ÔtrueÕ complete measurement.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We have previously shown that random sampling is an effective clutter reduction technique and that a sampling lens can facilitate focus+context viewing of particular regions. This demands an efficient method of estimating the overlap or occlusion of large numbers of intersecting lines in order to automatically adjust the sampling rate within the lens. This paper proposes several ways for measuring occlusion in parallel coordinate plots. An empirical study into the accuracy and efficiency of the occlusion measures show that a probabilistic approach combined with a ÔbinningÕ technique is very fast and yet approaches the accuracy of the more expensive ÔtrueÕ complete measurement.",
"title": "Enabling Automatic Clutter Reduction in Parallel Coordinate Plots",
"normalizedTitle": "Enabling Automatic Clutter Reduction in Parallel Coordinate Plots",
"fno": "v0717",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Hidden Feature Removal",
"Probability",
"Sampling Methods",
"Automatic Clutter Reduction",
"Parallel Coordinate Plots",
"Random Sampling",
"Occlusion",
"Probabilistic Approach",
"Binning Technique",
"Sampling Methods",
"Lenses",
"Displays",
"Data Visualization",
"Coordinate Measuring Machines",
"Filtering",
"Motion Measurement",
"Sampling",
"Random Sampling",
"Lens",
"Clutter",
"Occlusion",
"Density Reduction",
"Overplotting",
"Information Visualisation",
"Parallel Coordinates"
],
"authors": [
{
"givenName": "Geoffrey",
"surname": "Ellis",
"fullName": "Geoffrey Ellis",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alan",
"surname": "Dix",
"fullName": "Alan Dix",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "trans",
"pages": "717-724",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/csse/2008/3336/1/3336a949",
"title": "Study on Feature Extraction Method Based on Parallel Coordinate Plots",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336a949/12OmNwErpsP",
"parentPublication": {
"id": "proceedings/csse/2008/3336/1",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1993/3870/0/00378183",
"title": "A complete two-plane camera calibration method and experimental comparisons",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1993/00378183/12OmNxGSmae",
"parentPublication": {
"id": "proceedings/iccv/1993/3870/0",
"title": "1993 (4th) International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2010/4108/0/4108b582",
"title": "Modifed Re-sampling Based Particle Filter for Visual Tracking with MPH",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2010/4108b582/12OmNzTH0Sq",
"parentPublication": {
"id": "proceedings/cit/2010/4108/0",
"title": "Computer and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icws/2012/4752/0/4752a090",
"title": "WSP: A Network Coordinate Based Web Service Positioning Framework for Response Time Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/icws/2012/4752a090/12OmNzahc4E",
"parentPublication": {
"id": "proceedings/icws/2012/4752/0",
"title": "2012 IEEE 19th International Conference on Web Services",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122600",
"title": "MoleView: An Attribute and Structure-Based Semantic Lens for Large Element-Based Plots",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122600/13rRUwfI0Q9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v0709",
"title": "Measuring Data Abstraction Quality in Multiresolution Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v0709/13rRUyY28Yj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2020/8508/0/850800a109",
"title": "Color Moiré Reduction and Resolution Improvement for Integral 3D Displays Using Multiple Wobbling Optics",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2020/850800a109/1pysuUuZCwM",
"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/06/09328215",
"title": "Shape-Driven Coordinate Ordering for Star Glyph Sets via Reinforcement Learning",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/09328215/1quudoPtP6U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0709",
"articleId": "13rRUyY28Yj",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0725",
"articleId": "13rRUyuvRxh",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCaLEju",
"title": "Jan.",
"year": "2018",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvgz9W",
"doi": "10.1109/TVCG.2017.2743978",
"abstract": "A myriad of design rules for what constitutes a “good” colormap can be found in the literature. Some common rules include order, uniformity, and high discriminative power. However, the meaning of many of these terms is often ambiguous or open to interpretation. At times, different authors may use the same term to describe different concepts or the same rule is described by varying nomenclature. These ambiguities stand in the way of collaborative work, the design of experiments to assess the characteristics of colormaps, and automated colormap generation. In this paper, we review current and historical guidelines for colormap design. We propose a specified taxonomy and provide unambiguous mathematical definitions for the most common design rules.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A myriad of design rules for what constitutes a “good” colormap can be found in the literature. Some common rules include order, uniformity, and high discriminative power. However, the meaning of many of these terms is often ambiguous or open to interpretation. At times, different authors may use the same term to describe different concepts or the same rule is described by varying nomenclature. These ambiguities stand in the way of collaborative work, the design of experiments to assess the characteristics of colormaps, and automated colormap generation. In this paper, we review current and historical guidelines for colormap design. We propose a specified taxonomy and provide unambiguous mathematical definitions for the most common design rules.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A myriad of design rules for what constitutes a “good” colormap can be found in the literature. Some common rules include order, uniformity, and high discriminative power. However, the meaning of many of these terms is often ambiguous or open to interpretation. At times, different authors may use the same term to describe different concepts or the same rule is described by varying nomenclature. These ambiguities stand in the way of collaborative work, the design of experiments to assess the characteristics of colormaps, and automated colormap generation. In this paper, we review current and historical guidelines for colormap design. We propose a specified taxonomy and provide unambiguous mathematical definitions for the most common design rules.",
"title": "The Good, the Bad, and the Ugly: A Theoretical Framework for the Assessment of Continuous Colormaps",
"normalizedTitle": "The Good, the Bad, and the Ugly: A Theoretical Framework for the Assessment of Continuous Colormaps",
"fno": "08017653",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Image Color Analysis",
"Linearity",
"Color",
"Taxonomy",
"Sensitivity",
"Brightness",
"Colormap",
"Survey",
"Taxonomy",
"Order",
"Uniformity",
"Discriminative Power",
"Smoothness",
"Monotonicity",
"Linearity",
"Speed"
],
"authors": [
{
"givenName": "Roxana",
"surname": "Bujack",
"fullName": "Roxana Bujack",
"affiliation": "Los Alamos National Laboratory",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Terece L.",
"surname": "Turton",
"fullName": "Terece L. Turton",
"affiliation": "University of Texas, Austin",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Francesca",
"surname": "Samsel",
"fullName": "Francesca Samsel",
"affiliation": "University of Texas, Austin",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Colin",
"surname": "Ware",
"fullName": "Colin Ware",
"affiliation": "University of New Hampshire",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David H.",
"surname": "Rogers",
"fullName": "David H. Rogers",
"affiliation": "Los Alamos National Laboratory",
"__typename": "ArticleAuthorType"
},
{
"givenName": "James",
"surname": "Ahrens",
"fullName": "James Ahrens",
"affiliation": "Los Alamos National Laboratory",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "trans",
"pages": "923-933",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2002/7498/0/7498kindlman",
"title": "Face-based Luminance Matching for Perceptual Colormap Generation",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498kindlman/12OmNBcAGMn",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2013/1659/0/06675161",
"title": "A provably-robust sampling method for generating colormaps of large data",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2013/06675161/12OmNynJMYV",
"parentPublication": {
"id": "proceedings/ldav/2013/1659/0",
"title": "2013 IEEE Symposium on Large-Scale Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/08/07305807",
"title": "A Survey of Colormaps in Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2016/08/07305807/13rRUwInvBb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/09/08413174",
"title": "Measuring and Modeling the Feature Detection Threshold Functions of Colormaps",
"doi": null,
"abstractUrl": "/journal/tg/2019/09/08413174/13rRUygBw7i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/09/08637778",
"title": "Measuring the Effects of Scalar and Spherical Colormaps on Ensembles of DMRI Tubes",
"doi": null,
"abstractUrl": "/journal/tg/2020/09/08637778/17D45WrVgbO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09919390",
"title": "Rainbow Colormaps: What are they <italic>good</italic> and <italic>bad</italic> for?",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09919390/1HsTAyyKsne",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933760",
"title": "Evaluating Gradient Perception in Color-Coded Scalar Fields",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933760/1fTgHHw1pSM",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/08939459",
"title": "The Making of Continuous Colormaps",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/08939459/1fZRynxLXGM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2020/05/09167329",
"title": "The Importance of Colormaps",
"doi": null,
"abstractUrl": "/magazine/cs/2020/05/09167329/1mhPJUptqpy",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09216559",
"title": "A Testing Environment for Continuous Colormaps",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09216559/1nJsOQFe8A8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08017610",
"articleId": "13rRUwhHcQX",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08017601",
"articleId": "13rRUyogGAg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWREY",
"name": "ttg201801-08017653s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201801-08017653s1.zip",
"extension": "zip",
"size": "19.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyv7moW",
"title": "Sept.",
"year": "2019",
"issueNum": "09",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygBw7i",
"doi": "10.1109/TVCG.2018.2855742",
"abstract": "Pseudocoloring is one of the most common techniques used in scientific visualization. To apply pseudocoloring to a scalar field, the field value at each point is represented using one of a sequence of colors (called a colormap). One of the principles applied in generating colormaps is uniformity and previously the main method for determining uniformity has been the application of uniform color spaces. In this paper we present a new method for evaluating the feature detection threshold function across a colormap. The method is used in crowdsourced studies for the direct evaluation of nine colormaps for three feature sizes. The results are used to test the hypothesis that a uniform color space (CIELAB) will accurately model colormapped feature detection thresholds compared to a model where the chromaticity components have reduced weights. The hypothesis that feature detection can be predicted solely on the basis of luminance is also tested. The results reject both hypotheses and we demonstrate how reduced weights on the green-red and blue-yellow terms of the CIELAB color space creates a more accurate model when the task is the detection of smaller features in colormapped data. Both the method itself and modified CIELAB can be used in colormap design and evaluation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Pseudocoloring is one of the most common techniques used in scientific visualization. To apply pseudocoloring to a scalar field, the field value at each point is represented using one of a sequence of colors (called a colormap). One of the principles applied in generating colormaps is uniformity and previously the main method for determining uniformity has been the application of uniform color spaces. In this paper we present a new method for evaluating the feature detection threshold function across a colormap. The method is used in crowdsourced studies for the direct evaluation of nine colormaps for three feature sizes. The results are used to test the hypothesis that a uniform color space (CIELAB) will accurately model colormapped feature detection thresholds compared to a model where the chromaticity components have reduced weights. The hypothesis that feature detection can be predicted solely on the basis of luminance is also tested. The results reject both hypotheses and we demonstrate how reduced weights on the green-red and blue-yellow terms of the CIELAB color space creates a more accurate model when the task is the detection of smaller features in colormapped data. Both the method itself and modified CIELAB can be used in colormap design and evaluation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Pseudocoloring is one of the most common techniques used in scientific visualization. To apply pseudocoloring to a scalar field, the field value at each point is represented using one of a sequence of colors (called a colormap). One of the principles applied in generating colormaps is uniformity and previously the main method for determining uniformity has been the application of uniform color spaces. In this paper we present a new method for evaluating the feature detection threshold function across a colormap. The method is used in crowdsourced studies for the direct evaluation of nine colormaps for three feature sizes. The results are used to test the hypothesis that a uniform color space (CIELAB) will accurately model colormapped feature detection thresholds compared to a model where the chromaticity components have reduced weights. The hypothesis that feature detection can be predicted solely on the basis of luminance is also tested. The results reject both hypotheses and we demonstrate how reduced weights on the green-red and blue-yellow terms of the CIELAB color space creates a more accurate model when the task is the detection of smaller features in colormapped data. Both the method itself and modified CIELAB can be used in colormap design and evaluation.",
"title": "Measuring and Modeling the Feature Detection Threshold Functions of Colormaps",
"normalizedTitle": "Measuring and Modeling the Feature Detection Threshold Functions of Colormaps",
"fno": "08413174",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Brightness",
"Data Visualisation",
"Feature Extraction",
"Image Colour Analysis",
"Feature Detection Threshold Function",
"Pseudocoloring",
"Scalar Field",
"Field Value",
"Uniform Color Space",
"Feature Sizes",
"CIELAB Color Space",
"Colormapped Data",
"Colormap Design",
"Scientific Visualization",
"Hypothesis Testing",
"Chromaticity Components",
"Luminance",
"Image Color Analysis",
"Task Analysis",
"Feature Extraction",
"Sensitivity",
"Sea Measurements",
"Frequency Measurement",
"Spatial Resolution",
"Colormapping",
"Color Perception"
],
"authors": [
{
"givenName": "Colin",
"surname": "Ware",
"fullName": "Colin Ware",
"affiliation": "University of New Hampshire, Durham, NH, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Terece L.",
"surname": "Turton",
"fullName": "Terece L. Turton",
"affiliation": "Los Alamos National Laboratory, Los Alamos, NM, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Roxana",
"surname": "Bujack",
"fullName": "Roxana Bujack",
"affiliation": "Los Alamos National Laboratory, Los Alamos, NM, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Francesca",
"surname": "Samsel",
"fullName": "Francesca Samsel",
"affiliation": "Center for Agile Technology, University of Texas at Austin, Austin, TX, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Piyush",
"surname": "Shrivastava",
"fullName": "Piyush Shrivastava",
"affiliation": "University of New Hampshire, Durham, NH, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David H.",
"surname": "Rogers",
"fullName": "David H. Rogers",
"affiliation": "Los Alamos National Laboratory, Los Alamos, NM, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "09",
"pubDate": "2019-09-01 00:00:00",
"pubType": "trans",
"pages": "2777-2790",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ssst/1993/3560/0/00522832",
"title": "A comparison of methods for the optimization of VGA colormaps",
"doi": null,
"abstractUrl": "/proceedings-article/ssst/1993/00522832/12OmNvmowMV",
"parentPublication": {
"id": "proceedings/ssst/1993/3560/0",
"title": "1993 (25th) Southeastern Symposium on System Theory",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017653",
"title": "The Good, the Bad, and the Ugly: A Theoretical Framework for the Assessment of Continuous Colormaps",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017653/13rRUNvgz9W",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/08/07305807",
"title": "A Survey of Colormaps in Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2016/08/07305807/13rRUwInvBb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1995/03/v0274",
"title": "Dynamic Color Quantization of Video Sequences",
"doi": null,
"abstractUrl": "/journal/tg/1995/03/v0274/13rRUxASuSz",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/09/08637778",
"title": "Measuring the Effects of Scalar and Spherical Colormaps on Ensembles of DMRI Tubes",
"doi": null,
"abstractUrl": "/journal/tg/2020/09/08637778/17D45WrVgbO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09919390",
"title": "Rainbow Colormaps: What are they <italic>good</italic> and <italic>bad</italic> for?",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09919390/1HsTAyyKsne",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933760",
"title": "Evaluating Gradient Perception in Color-Coded Scalar Fields",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933760/1fTgHHw1pSM",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/08939459",
"title": "The Making of Continuous Colormaps",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/08939459/1fZRynxLXGM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2020/05/09167329",
"title": "The Importance of Colormaps",
"doi": null,
"abstractUrl": "/magazine/cs/2020/05/09167329/1mhPJUptqpy",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09395231",
"title": "Deep Colormap Extraction From Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09395231/1syq9xMMQY8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08419282",
"articleId": "13rRUxcKzVn",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08418388",
"articleId": "13rRUNvgz4p",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1c5C9tIllcc",
"name": "ttg201909-08413174s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201909-08413174s1.zip",
"extension": "zip",
"size": "149 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqzu6X7",
"title": "Sept.",
"year": "2020",
"issueNum": "09",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45WrVgbO",
"doi": "10.1109/TVCG.2019.2898438",
"abstract": "We report empirical study results on the color encoding of ensemble scalar and orientation to visualize diffusion magnetic resonance imaging (DMRI) tubes. The experiment tested six scalar colormaps for average fractional anisotropy (FA) tasks (grayscale, blackbody, diverging, isoluminant-rainbow, extended-blackbody, and coolwarm) and four three-dimensional (3D) spherical colormaps for tract tracing tasks (uniform gray, absolute, eigenmaps, and Boy's surface embedding). We found that extended-blackbody, coolwarm, and blackbody remain the best three approaches for identifying ensemble average in 3D. Isoluminant-rainbow colormap led to the same ensemble mean accuracy as other colormaps. However, more than 50 percent of the answers consistently had higher estimates of the ensemble average, independent of the mean values. The number of hues, not luminance, influences ensemble estimates of mean values. For ensemble orientation-tracing tasks, we found that both Boy's surface embedding (greatest spatial resolution and contrast) and absolute colormaps (lowest spatial resolution and contrast) led to more accurate answers than the eigenmaps scheme (medium resolution and contrast), acting as the uncanny-valley phenomenon of visualization design in terms of accuracy. Absolute colormap broadly used in brain science is a good default spherical colormap. We could conclude from our study that human visual processing of a chunk of colors differs from that of single colors.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We report empirical study results on the color encoding of ensemble scalar and orientation to visualize diffusion magnetic resonance imaging (DMRI) tubes. The experiment tested six scalar colormaps for average fractional anisotropy (FA) tasks (grayscale, blackbody, diverging, isoluminant-rainbow, extended-blackbody, and coolwarm) and four three-dimensional (3D) spherical colormaps for tract tracing tasks (uniform gray, absolute, eigenmaps, and Boy's surface embedding). We found that extended-blackbody, coolwarm, and blackbody remain the best three approaches for identifying ensemble average in 3D. Isoluminant-rainbow colormap led to the same ensemble mean accuracy as other colormaps. However, more than 50 percent of the answers consistently had higher estimates of the ensemble average, independent of the mean values. The number of hues, not luminance, influences ensemble estimates of mean values. For ensemble orientation-tracing tasks, we found that both Boy's surface embedding (greatest spatial resolution and contrast) and absolute colormaps (lowest spatial resolution and contrast) led to more accurate answers than the eigenmaps scheme (medium resolution and contrast), acting as the uncanny-valley phenomenon of visualization design in terms of accuracy. Absolute colormap broadly used in brain science is a good default spherical colormap. We could conclude from our study that human visual processing of a chunk of colors differs from that of single colors.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We report empirical study results on the color encoding of ensemble scalar and orientation to visualize diffusion magnetic resonance imaging (DMRI) tubes. The experiment tested six scalar colormaps for average fractional anisotropy (FA) tasks (grayscale, blackbody, diverging, isoluminant-rainbow, extended-blackbody, and coolwarm) and four three-dimensional (3D) spherical colormaps for tract tracing tasks (uniform gray, absolute, eigenmaps, and Boy's surface embedding). We found that extended-blackbody, coolwarm, and blackbody remain the best three approaches for identifying ensemble average in 3D. Isoluminant-rainbow colormap led to the same ensemble mean accuracy as other colormaps. However, more than 50 percent of the answers consistently had higher estimates of the ensemble average, independent of the mean values. The number of hues, not luminance, influences ensemble estimates of mean values. For ensemble orientation-tracing tasks, we found that both Boy's surface embedding (greatest spatial resolution and contrast) and absolute colormaps (lowest spatial resolution and contrast) led to more accurate answers than the eigenmaps scheme (medium resolution and contrast), acting as the uncanny-valley phenomenon of visualization design in terms of accuracy. Absolute colormap broadly used in brain science is a good default spherical colormap. We could conclude from our study that human visual processing of a chunk of colors differs from that of single colors.",
"title": "Measuring the Effects of Scalar and Spherical Colormaps on Ensembles of DMRI Tubes",
"normalizedTitle": "Measuring the Effects of Scalar and Spherical Colormaps on Ensembles of DMRI Tubes",
"fno": "08637778",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Biodiffusion",
"Biomedical MRI",
"Image Colour Analysis",
"Medical Image Processing",
"Neurophysiology",
"Boy Surface Embedding",
"3 D Isoluminant Rainbow Colormap",
"Spherical Colormap",
"Color Encoding",
"DMRI Tubes",
"Spatial Resolution",
"Absolute Colormap",
"Ensemble Orientation Tracing Tasks",
"Ensemble Average",
"Eigenmaps",
"Three Dimensional Spherical Colormaps",
"Average Fractional Anisotropy Tasks",
"Scalar Colormaps",
"Diffusion Magnetic Resonance Imaging Tubes",
"Ensemble Scalar",
"Image Color Analysis",
"Task Analysis",
"Visualization",
"Three Dimensional Displays",
"Color",
"Spatial Resolution",
"Ensemble Visualization",
"Diffusion Magnetic Resonance Imaging",
"Quantitative Validation",
"Colormap"
],
"authors": [
{
"givenName": "Jian",
"surname": "Chen",
"fullName": "Jian Chen",
"affiliation": "Computer Science and Engineering Department, The Ohio State University, OH, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guohao",
"surname": "Zhang",
"fullName": "Guohao Zhang",
"affiliation": "Department of Computer Science and Electrical Engineering, University of Maryland, Baltimore County, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wesley",
"surname": "Chiou",
"fullName": "Wesley Chiou",
"affiliation": "Department of Computer Science and Electrical Engineering, University of Maryland, Baltimore County, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David H.",
"surname": "Laidlaw",
"fullName": "David H. Laidlaw",
"affiliation": "Computer Science Department, Brown University, Providence, RI, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alexander P.",
"surname": "Auchus",
"fullName": "Alexander P. Auchus",
"affiliation": "Neurology Department, University of Mississippi Medical Center, Jackson, MS, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2020-09-01 00:00:00",
"pubType": "trans",
"pages": "2818-2833",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ssst/1993/3560/0/00522832",
"title": "A comparison of methods for the optimization of VGA colormaps",
"doi": null,
"abstractUrl": "/proceedings-article/ssst/1993/00522832/12OmNvmowMV",
"parentPublication": {
"id": "proceedings/ssst/1993/3560/0",
"title": "1993 (25th) Southeastern Symposium on System Theory",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017653",
"title": "The Good, the Bad, and the Ugly: A Theoretical Framework for the Assessment of Continuous Colormaps",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017653/13rRUNvgz9W",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/08/07305807",
"title": "A Survey of Colormaps in Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2016/08/07305807/13rRUwInvBb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/09/08413174",
"title": "Measuring and Modeling the Feature Detection Threshold Functions of Colormaps",
"doi": null,
"abstractUrl": "/journal/tg/2019/09/08413174/13rRUygBw7i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09919390",
"title": "Rainbow Colormaps: What are they <italic>good</italic> and <italic>bad</italic> for?",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09919390/1HsTAyyKsne",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933760",
"title": "Evaluating Gradient Perception in Color-Coded Scalar Fields",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933760/1fTgHHw1pSM",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933764",
"title": "Data-Driven Colormap Optimization for 2D Scalar Field Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933764/1fTgICKKw3m",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/08939459",
"title": "The Making of Continuous Colormaps",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/08939459/1fZRynxLXGM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2020/05/09167329",
"title": "The Importance of Colormaps",
"doi": null,
"abstractUrl": "/magazine/cs/2020/05/09167329/1mhPJUptqpy",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09395231",
"title": "Deep Colormap Extraction From Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09395231/1syq9xMMQY8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08664178",
"articleId": "1lRhomN6HMk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08632711",
"articleId": "17D45WB0qbr",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRo",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1HsTAyyKsne",
"doi": "10.1109/TVCG.2022.3214771",
"abstract": "Guidelines for color use in quantitative visualizations have strongly discouraged the use of rainbow colormaps, arguing instead for smooth designs that do not induce visual discontinuities or implicit color categories. However, the empirical evidence behind this argument has been mixed and, at times, even contradictory. In practice, rainbow colormaps are widely used, raising questions about the true utility or dangers of such designs. We study how color categorization impacts the interpretation of scalar fields. We first introduce an approach to detect latent categories in colormaps. We hypothesize that the appearance of color categories in scalar visualizations can be beneficial in that they enhance the perception of certain features, although at the cost of rendering other features less noticeable. In three crowdsourced experiments, we show that observers are more likely to discriminate global, distributional features when viewing colorful scales that induce categorization (e.g., rainbow or diverging schemes). Conversely, when seeing the same data through a less colorful representation, observers are more likely to report localized features defined by small variations in the data. Participants showed awareness of these different affordances, and exhibited bias for exploiting the more discriminating colormap, given a particular feature type. Our results demonstrate costs and benefits for rainbows (and similarly colorful schemes), suggesting that their complementary utility for analyzing scalar data should not be dismissed. In addition to explaining potentially valid uses of rainbow, our study provides actionable guidelines, including on when such designs can be more harmful than useful. Data and materials are available at <uri>https://osf.io/xjhtf</uri>",
"abstracts": [
{
"abstractType": "Regular",
"content": "Guidelines for color use in quantitative visualizations have strongly discouraged the use of rainbow colormaps, arguing instead for smooth designs that do not induce visual discontinuities or implicit color categories. However, the empirical evidence behind this argument has been mixed and, at times, even contradictory. In practice, rainbow colormaps are widely used, raising questions about the true utility or dangers of such designs. We study how color categorization impacts the interpretation of scalar fields. We first introduce an approach to detect latent categories in colormaps. We hypothesize that the appearance of color categories in scalar visualizations can be beneficial in that they enhance the perception of certain features, although at the cost of rendering other features less noticeable. In three crowdsourced experiments, we show that observers are more likely to discriminate global, distributional features when viewing colorful scales that induce categorization (e.g., rainbow or diverging schemes). Conversely, when seeing the same data through a less colorful representation, observers are more likely to report localized features defined by small variations in the data. Participants showed awareness of these different affordances, and exhibited bias for exploiting the more discriminating colormap, given a particular feature type. Our results demonstrate costs and benefits for rainbows (and similarly colorful schemes), suggesting that their complementary utility for analyzing scalar data should not be dismissed. In addition to explaining potentially valid uses of rainbow, our study provides actionable guidelines, including on when such designs can be more harmful than useful. Data and materials are available at <uri>https://osf.io/xjhtf</uri>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Guidelines for color use in quantitative visualizations have strongly discouraged the use of rainbow colormaps, arguing instead for smooth designs that do not induce visual discontinuities or implicit color categories. However, the empirical evidence behind this argument has been mixed and, at times, even contradictory. In practice, rainbow colormaps are widely used, raising questions about the true utility or dangers of such designs. We study how color categorization impacts the interpretation of scalar fields. We first introduce an approach to detect latent categories in colormaps. We hypothesize that the appearance of color categories in scalar visualizations can be beneficial in that they enhance the perception of certain features, although at the cost of rendering other features less noticeable. In three crowdsourced experiments, we show that observers are more likely to discriminate global, distributional features when viewing colorful scales that induce categorization (e.g., rainbow or diverging schemes). Conversely, when seeing the same data through a less colorful representation, observers are more likely to report localized features defined by small variations in the data. Participants showed awareness of these different affordances, and exhibited bias for exploiting the more discriminating colormap, given a particular feature type. Our results demonstrate costs and benefits for rainbows (and similarly colorful schemes), suggesting that their complementary utility for analyzing scalar data should not be dismissed. In addition to explaining potentially valid uses of rainbow, our study provides actionable guidelines, including on when such designs can be more harmful than useful. Data and materials are available at https://osf.io/xjhtf",
"title": "Rainbow Colormaps: What are they <italic>good</italic> and <italic>bad</italic> for?",
"normalizedTitle": "Rainbow Colormaps: What are they good and bad for?",
"fno": "09919390",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Image Color Analysis",
"Task Analysis",
"Encoding",
"Costs",
"Observers",
"Standards",
"Sensitivity",
"Quantitative Color Encoding",
"Rainbow Colormaps",
"Scalar Fields",
"Perception"
],
"authors": [
{
"givenName": "Khairi",
"surname": "Reda",
"fullName": "Khairi Reda",
"affiliation": "Indiana University–Purdue University Indianapolis, Indianapolis, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-10-01 00:00:00",
"pubType": "trans",
"pages": "1-15",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2018/01/08017653",
"title": "The Good, the Bad, and the Ugly: A Theoretical Framework for the Assessment of Continuous Colormaps",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017653/13rRUNvgz9W",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2007/02/mcg2007020014",
"title": "Rainbow Color Map (Still) Considered Harmful",
"doi": null,
"abstractUrl": "/magazine/cg/2007/02/mcg2007020014/13rRUxYrbOE",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/09/08413174",
"title": "Measuring and Modeling the Feature Detection Threshold Functions of Colormaps",
"doi": null,
"abstractUrl": "/journal/tg/2019/09/08413174/13rRUygBw7i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/09/08637778",
"title": "Measuring the Effects of Scalar and Spherical Colormaps on Ensembles of DMRI Tubes",
"doi": null,
"abstractUrl": "/journal/tg/2020/09/08637778/17D45WrVgbO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933760",
"title": "Evaluating Gradient Perception in Color-Coded Scalar Fields",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933760/1fTgHHw1pSM",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/08939459",
"title": "The Making of Continuous Colormaps",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/08939459/1fZRynxLXGM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2020/05/09167329",
"title": "The Importance of Colormaps",
"doi": null,
"abstractUrl": "/magazine/cs/2020/05/09167329/1mhPJUptqpy",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222327",
"title": "Rainbows Revisited: Modeling Effective Colormap Design for Graphical Inference",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222327/1nTqMLwYD0A",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2007/02/04118486",
"title": "Rainbow Color Map (Still) Considered Harmful",
"doi": null,
"abstractUrl": "/magazine/cg/2007/02/04118486/1oCjGn4Rpss",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/07/09249052",
"title": "Rainbow Dash: Intuitiveness, Interpretability and Memorability of the Rainbow Color Scheme in Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/07/09249052/1ovEVPWDI4g",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09916137",
"articleId": "1HojAjSAGNq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09920175",
"articleId": "1HxSlQBsfYc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1HBHYun2dQk",
"name": "ttg555501-09919390s1-tvcg-3214771-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09919390s1-tvcg-3214771-mm.zip",
"extension": "zip",
"size": "4.18 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1qL5hsvvVkc",
"title": "Feb.",
"year": "2021",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1nJsOQFe8A8",
"doi": "10.1109/TVCG.2020.3028955",
"abstract": "Many computer science disciplines (e.g., combinatorial optimization, natural language processing, and information retrieval) use standard or established test suites for evaluating algorithms. In visualization, similar approaches have been adopted in some areas (e.g., volume visualization), while user testimonies and empirical studies have been the dominant means of evaluation in most other areas, such as designing colormaps. In this paper, we propose to establish a test suite for evaluating the design of colormaps. With such a suite, the users can observe the effects when different continuous colormaps are applied to planar scalar fields that may exhibit various characteristic features, such as jumps, local extrema, ridge or valley lines, different distributions of scalar values, different gradients, different signal frequencies, different levels of noise, and so on. The suite also includes an expansible collection of real-world data sets including the most popular data for colormap testing in the visualization literature. The test suite has been integrated into a web-based application for creating continuous colormaps (https://ccctool.com/), facilitating close inter-operation between design and evaluation processes. This new facility complements traditional evaluation methods such as user testimonies and empirical studies.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Many computer science disciplines (e.g., combinatorial optimization, natural language processing, and information retrieval) use standard or established test suites for evaluating algorithms. In visualization, similar approaches have been adopted in some areas (e.g., volume visualization), while user testimonies and empirical studies have been the dominant means of evaluation in most other areas, such as designing colormaps. In this paper, we propose to establish a test suite for evaluating the design of colormaps. With such a suite, the users can observe the effects when different continuous colormaps are applied to planar scalar fields that may exhibit various characteristic features, such as jumps, local extrema, ridge or valley lines, different distributions of scalar values, different gradients, different signal frequencies, different levels of noise, and so on. The suite also includes an expansible collection of real-world data sets including the most popular data for colormap testing in the visualization literature. The test suite has been integrated into a web-based application for creating continuous colormaps (https://ccctool.com/), facilitating close inter-operation between design and evaluation processes. This new facility complements traditional evaluation methods such as user testimonies and empirical studies.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Many computer science disciplines (e.g., combinatorial optimization, natural language processing, and information retrieval) use standard or established test suites for evaluating algorithms. In visualization, similar approaches have been adopted in some areas (e.g., volume visualization), while user testimonies and empirical studies have been the dominant means of evaluation in most other areas, such as designing colormaps. In this paper, we propose to establish a test suite for evaluating the design of colormaps. With such a suite, the users can observe the effects when different continuous colormaps are applied to planar scalar fields that may exhibit various characteristic features, such as jumps, local extrema, ridge or valley lines, different distributions of scalar values, different gradients, different signal frequencies, different levels of noise, and so on. The suite also includes an expansible collection of real-world data sets including the most popular data for colormap testing in the visualization literature. The test suite has been integrated into a web-based application for creating continuous colormaps (https://ccctool.com/), facilitating close inter-operation between design and evaluation processes. This new facility complements traditional evaluation methods such as user testimonies and empirical studies.",
"title": "A Testing Environment for Continuous Colormaps",
"normalizedTitle": "A Testing Environment for Continuous Colormaps",
"fno": "09216559",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Internet",
"Web Based Application",
"Planar Scalar Field",
"Testing Environment",
"Visualization Literature",
"Colormap Testing",
"Data Sets",
"Continuous Colormaps",
"Test Suite",
"Image Color Analysis",
"Data Visualization",
"Task Analysis",
"Optimization",
"Computer Science",
"Natural Language Processing",
"Visualization",
"Testing Environment",
"Color Perception",
"Scalar Analysis"
],
"authors": [
{
"givenName": "P.",
"surname": "Nardini",
"fullName": "P. Nardini",
"affiliation": "University of Leipzig, Institute of Computer Science, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "M.",
"surname": "Chen",
"fullName": "M. Chen",
"affiliation": "Department of Engineering Science, University of Oxford, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "R.",
"surname": "Bujack",
"fullName": "R. Bujack",
"affiliation": "Data Science at Scale Team, Los Alamos National Laboratorv, Los Alamos, NM, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "M.",
"surname": "Bottinger",
"fullName": "M. Bottinger",
"affiliation": "German Climate Computing Center(DKRZ), Hamburg, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "G.",
"surname": "Scheuermann",
"fullName": "G. Scheuermann",
"affiliation": "University of Leipzig, Institute of Computer Science, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "1043-1053",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2018/01/08017653",
"title": "The Good, the Bad, and the Ugly: A Theoretical Framework for the Assessment of Continuous Colormaps",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017653/13rRUNvgz9W",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539556",
"title": "Categorical Colormap Optimization with Visualization Case Studies",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539556/13rRUNvyaf5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/08/07305807",
"title": "A Survey of Colormaps in Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2016/08/07305807/13rRUwInvBb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/09/08413174",
"title": "Measuring and Modeling the Feature Detection Threshold Functions of Colormaps",
"doi": null,
"abstractUrl": "/journal/tg/2019/09/08413174/13rRUygBw7i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/09/08637778",
"title": "Measuring the Effects of Scalar and Spherical Colormaps on Ensembles of DMRI Tubes",
"doi": null,
"abstractUrl": "/journal/tg/2020/09/08637778/17D45WrVgbO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09919390",
"title": "Rainbow Colormaps: What are they <italic>good</italic> and <italic>bad</italic> for?",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09919390/1HsTAyyKsne",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933760",
"title": "Evaluating Gradient Perception in Color-Coded Scalar Fields",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933760/1fTgHHw1pSM",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/08939459",
"title": "The Making of Continuous Colormaps",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/08939459/1fZRynxLXGM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2020/05/09167329",
"title": "The Importance of Colormaps",
"doi": null,
"abstractUrl": "/magazine/cs/2020/05/09167329/1mhPJUptqpy",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222327",
"title": "Rainbows Revisited: Modeling Effective Colormap Design for Graphical Inference",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222327/1nTqMLwYD0A",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09222327",
"articleId": "1nTqMLwYD0A",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09222047",
"articleId": "1nTqj3fbFXq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRo",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1HxSntuIBnW",
"doi": "10.1109/TVCG.2022.3214420",
"abstract": "We present a novel technique for hierarchical super resolution (SR) with neural networks (NNs), which upscales volumetric data represented with an octree data structure to a high-resolution uniform grid with minimal seam artifacts on octree node boundaries. Our method uses existing state-of-the-art SR models and adds flexibility to upscale input data with varying levels of detail across the domain, instead of only uniform grid data that are supported in previous approaches. The key is to use a hierarchy of SR NNs, each trained to perform <inline-formula><tex-math notation=\"LaTeX\">Z_$2\\times$_Z</tex-math></inline-formula> SR between two levels of detail, with a hierarchical SR algorithm that minimizes seam artifacts by starting from the coarsest level of detail and working up. We show that our hierarchical approach outperforms baseline interpolation and hierarchical upscaling methods, and demonstrate the usefulness of our proposed approach across three use cases including data reduction using hierarchical downsampling+SR instead of uniform downsampling+SR, computation savings for hierarchical finite-time Lyapunov exponent field calculation, and super-resolving low-resolution simulation results for a high-resolution approximation visualization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a novel technique for hierarchical super resolution (SR) with neural networks (NNs), which upscales volumetric data represented with an octree data structure to a high-resolution uniform grid with minimal seam artifacts on octree node boundaries. Our method uses existing state-of-the-art SR models and adds flexibility to upscale input data with varying levels of detail across the domain, instead of only uniform grid data that are supported in previous approaches. The key is to use a hierarchy of SR NNs, each trained to perform <inline-formula><tex-math notation=\"LaTeX\">$2\\times$</tex-math></inline-formula> SR between two levels of detail, with a hierarchical SR algorithm that minimizes seam artifacts by starting from the coarsest level of detail and working up. We show that our hierarchical approach outperforms baseline interpolation and hierarchical upscaling methods, and demonstrate the usefulness of our proposed approach across three use cases including data reduction using hierarchical downsampling+SR instead of uniform downsampling+SR, computation savings for hierarchical finite-time Lyapunov exponent field calculation, and super-resolving low-resolution simulation results for a high-resolution approximation visualization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a novel technique for hierarchical super resolution (SR) with neural networks (NNs), which upscales volumetric data represented with an octree data structure to a high-resolution uniform grid with minimal seam artifacts on octree node boundaries. Our method uses existing state-of-the-art SR models and adds flexibility to upscale input data with varying levels of detail across the domain, instead of only uniform grid data that are supported in previous approaches. The key is to use a hierarchy of SR NNs, each trained to perform - SR between two levels of detail, with a hierarchical SR algorithm that minimizes seam artifacts by starting from the coarsest level of detail and working up. We show that our hierarchical approach outperforms baseline interpolation and hierarchical upscaling methods, and demonstrate the usefulness of our proposed approach across three use cases including data reduction using hierarchical downsampling+SR instead of uniform downsampling+SR, computation savings for hierarchical finite-time Lyapunov exponent field calculation, and super-resolving low-resolution simulation results for a high-resolution approximation visualization.",
"title": "Deep Hierarchical Super Resolution for Scientific Data",
"normalizedTitle": "Deep Hierarchical Super Resolution for Scientific Data",
"fno": "09920542",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Spatial Resolution",
"Rendering Computer Graphics",
"Octrees",
"Data Models",
"Computational Modeling",
"Interpolation",
"Isosurfaces"
],
"authors": [
{
"givenName": "Skylar W.",
"surname": "Wurster",
"fullName": "Skylar W. Wurster",
"affiliation": "Department of Computer Science and Engineering, The Ohio State University, Columbus, OH, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanqi",
"surname": "Guo",
"fullName": "Hanqi Guo",
"affiliation": "Department of Computer Science and Engineering, The Ohio State University, Columbus, OH, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Han-Wei",
"surname": "Shen",
"fullName": "Han-Wei Shen",
"affiliation": "Department of Computer Science and Engineering, The Ohio State University, Columbus, OH, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tom",
"surname": "Peterka",
"fullName": "Tom Peterka",
"affiliation": "Mathematics and Computer Science Division, Argonne National Laboratory, Lemont, IL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiayi",
"surname": "Xu",
"fullName": "Jiayi Xu",
"affiliation": "Department of Computer Science and Engineering, The Ohio State University, Columbus, OH, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-10-01 00:00:00",
"pubType": "trans",
"pages": "1-14",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2017/0733/0/0733b100",
"title": "Deep Wavelet Prediction for Image Super-Resolution",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2017/0733b100/12OmNwF0C7i",
"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/cvpr/2018/6420/0/642000b664",
"title": "Deep Back-Projection Networks for Super-Resolution",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000b664/17D45WKWnHX",
"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/bdcat/2022/6090/0/609000a048",
"title": "Enhanced Deep Learning Super-Resolution for Bathymetry Data",
"doi": null,
"abstractUrl": "/proceedings-article/bdcat/2022/609000a048/1Lu4d5cQVi0",
"parentPublication": {
"id": "proceedings/bdcat/2022/6090/0",
"title": "2022 IEEE/ACM International Conference on Big Data Computing, Applications and Technologies (BDCAT)",
"__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": "proceedings/cvpr/2019/3293/0/329300b652",
"title": "Camera Lens Super-Resolution",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300b652/1gyrgQ8SE2k",
"parentPublication": {
"id": "proceedings/cvpr/2019/3293/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2019/2506/0/250600a505",
"title": "RUNet: A Robust UNet Architecture for Image Super-Resolution",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2019/250600a505/1iTvgueXtQI",
"parentPublication": {
"id": "proceedings/cvprw/2019/2506/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2019/2506/0/250600b804",
"title": "Light Field Super-Resolution: A Benchmark",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2019/250600b804/1iTvo7kjJFm",
"parentPublication": {
"id": "proceedings/cvprw/2019/2506/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigmm/2020/9325/0/09232612",
"title": "Fusion of Deep and Non-Deep Methods for Fast Super-Resolution of Satellite Images",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2020/09232612/1o56CWDsUCs",
"parentPublication": {
"id": "proceedings/bigmm/2020/9325/0",
"title": "2020 IEEE Sixth International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/11/09521710",
"title": "Toward Real-World Super-Resolution via Adaptive Downsampling Models",
"doi": null,
"abstractUrl": "/journal/tp/2022/11/09521710/1wkrnHyoWAw",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2021/4899/0/489900a453",
"title": "KernelNet: A Blind Super-Resolution Kernel Estimation Network",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2021/489900a453/1yVzRwbSFYk",
"parentPublication": {
"id": "proceedings/cvprw/2021/4899/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09920664",
"articleId": "1HxSn2tq3Ha",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09925645",
"articleId": "1HCQTWI9XgY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1sP18ke9Y64",
"title": "May",
"year": "2021",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1saZq7bIPUQ",
"doi": "10.1109/TVCG.2021.3067783",
"abstract": "Current avatar representations used in immersive VR applications lack features that may be important for supporting natural behaviors and effective communication among individuals. This study investigates the impact of the visual and nonverbal cues afforded by three different types of avatar representations in the context of several cooperative tasks. The avatar types we compared are No_Avatar (HMD and controllers only), Scanned_Avatar (wearing an HMD), and Heal_Avatar (video-see-through). The subjective and objective measures we used to assess the quality of interpersonal communication include surveys of social presence, interpersonal trust, communication satisfaction, and attention to behavioral cues, plus two behavioral measures: duration of mutual gaze and number of unique words spoken. We found that participants reported higher levels of trustworthiness in the Real_Avatar condition compared to the Scanned_Avatar and No_Avatar conditions. They also reported a greater level of attentional focus on facial expressions compared to the No_Avatar condition and spent more extended time, for some tasks, attempting to engage in mutual gaze behavior compared to the Scanned_Avatar and No_Avatar conditions. In both the Heal_Avatar and Scanned_Avatar conditions, participants reported higher levels of co-presence compared with the No_Avatar condition. In the Scanned_Avatar condition, compared with the Heal_Avatar and No_Avatar conditions, participants reported higher levels of attention to body posture. Overall, our exit survey revealed that a majority of participants (66.67%) reported a preference for the Real_Avatar, compared with 25.00% for the Scanned_Avatar and 8.33% for the No_Avatar, These findings provide novel insight into how a user's experience in a social VR scenario is affected by the type of avatar representation provided.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Current avatar representations used in immersive VR applications lack features that may be important for supporting natural behaviors and effective communication among individuals. This study investigates the impact of the visual and nonverbal cues afforded by three different types of avatar representations in the context of several cooperative tasks. The avatar types we compared are No_Avatar (HMD and controllers only), Scanned_Avatar (wearing an HMD), and Heal_Avatar (video-see-through). The subjective and objective measures we used to assess the quality of interpersonal communication include surveys of social presence, interpersonal trust, communication satisfaction, and attention to behavioral cues, plus two behavioral measures: duration of mutual gaze and number of unique words spoken. We found that participants reported higher levels of trustworthiness in the Real_Avatar condition compared to the Scanned_Avatar and No_Avatar conditions. They also reported a greater level of attentional focus on facial expressions compared to the No_Avatar condition and spent more extended time, for some tasks, attempting to engage in mutual gaze behavior compared to the Scanned_Avatar and No_Avatar conditions. In both the Heal_Avatar and Scanned_Avatar conditions, participants reported higher levels of co-presence compared with the No_Avatar condition. In the Scanned_Avatar condition, compared with the Heal_Avatar and No_Avatar conditions, participants reported higher levels of attention to body posture. Overall, our exit survey revealed that a majority of participants (66.67%) reported a preference for the Real_Avatar, compared with 25.00% for the Scanned_Avatar and 8.33% for the No_Avatar, These findings provide novel insight into how a user's experience in a social VR scenario is affected by the type of avatar representation provided.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Current avatar representations used in immersive VR applications lack features that may be important for supporting natural behaviors and effective communication among individuals. This study investigates the impact of the visual and nonverbal cues afforded by three different types of avatar representations in the context of several cooperative tasks. The avatar types we compared are No_Avatar (HMD and controllers only), Scanned_Avatar (wearing an HMD), and Heal_Avatar (video-see-through). The subjective and objective measures we used to assess the quality of interpersonal communication include surveys of social presence, interpersonal trust, communication satisfaction, and attention to behavioral cues, plus two behavioral measures: duration of mutual gaze and number of unique words spoken. We found that participants reported higher levels of trustworthiness in the Real_Avatar condition compared to the Scanned_Avatar and No_Avatar conditions. They also reported a greater level of attentional focus on facial expressions compared to the No_Avatar condition and spent more extended time, for some tasks, attempting to engage in mutual gaze behavior compared to the Scanned_Avatar and No_Avatar conditions. In both the Heal_Avatar and Scanned_Avatar conditions, participants reported higher levels of co-presence compared with the No_Avatar condition. In the Scanned_Avatar condition, compared with the Heal_Avatar and No_Avatar conditions, participants reported higher levels of attention to body posture. Overall, our exit survey revealed that a majority of participants (66.67%) reported a preference for the Real_Avatar, compared with 25.00% for the Scanned_Avatar and 8.33% for the No_Avatar, These findings provide novel insight into how a user's experience in a social VR scenario is affected by the type of avatar representation provided.",
"title": "The Influence of Avatar Representation on Interpersonal Communication in Virtual Social Environments",
"normalizedTitle": "The Influence of Avatar Representation on Interpersonal Communication in Virtual Social Environments",
"fno": "09382845",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Avatars",
"Helmet Mounted Displays",
"Human Factors",
"Virtual Reality",
"Avatar Representation",
"Interpersonal Communication",
"Avatar Types",
"Scanned Avatar Condition",
"No Avatar Condition",
"Real Avatar Condition",
"Heal Avatar",
"Immersive VR Applications",
"HMD",
"Social VR Scenario",
"Avatars",
"Task Analysis",
"Resists",
"Particle Measurements",
"Atmospheric Measurements",
"Virtual Environments",
"Three Dimensional Displays",
"Interpersonal Communication",
"Trust",
"Communication Satisfaction",
"Social Presence",
"Behavioral Cues",
"Virtual Environment"
],
"authors": [
{
"givenName": "Sahar",
"surname": "Aseeri",
"fullName": "Sahar Aseeri",
"affiliation": "University of Minnesota",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Victoria",
"surname": "Interrante",
"fullName": "Victoria Interrante",
"affiliation": "University of Minnesota",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2021-05-01 00:00:00",
"pubType": "trans",
"pages": "2608-2617",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2015/1727/0/07223378",
"title": "Influence of avatar realism on stressful situation in VR",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2015/07223378/12OmNBdruc4",
"parentPublication": {
"id": "proceedings/vr/2015/1727/0",
"title": "2015 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2017/0563/0/08273657",
"title": "Avatar and participant gender differences in the perception of uncanniness of virtual humans",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2017/08273657/12OmNzZmZBE",
"parentPublication": {
"id": "proceedings/acii/2017/0563/0",
"title": "2017 Seventh International Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2016/0836/0/07504761",
"title": "Avatar realism and social interaction quality in virtual reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2016/07504761/12OmNzdoMvk",
"parentPublication": {
"id": "proceedings/vr/2016/0836/0",
"title": "2016 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446261",
"title": "The Influence of Avatar Representation and Behavior on Communication in Social Immersive Virtual Environments",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446261/13bd1gCd7T2",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2022/9617/0/961700a057",
"title": "Visual Fidelity Effects on Expressive Self-avatar in Virtual Reality: First Impressions Matter",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2022/961700a057/1CJc41zMnFC",
"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/vrw/2022/8402/0/840200a774",
"title": "Interpersonal Distance to a Speaking Avatar: Loudness Matters Irrespective of Contents",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a774/1CJcDgr8xyg",
"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/840200a001",
"title": "A Cardboard-Based Virtual Reality Study on Self-Avatar Appearance and Breathing",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a001/1CJdXjsLKBG",
"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-adjunct/2022/5365/0/536500a772",
"title": "Embodiment of an Avatar with Unnatural Arm Movements",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2022/536500a772/1J7W9fEjd6g",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2022/5365/0",
"title": "2022 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2020/6532/0/09090427",
"title": "Eating together while being apart: A pilot study on the effects of mixed-reality conversations and virtual environments on older eaters’ solitary meal experience and food intake",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090427/1jIxAbDrq7K",
"parentPublication": {
"id": "proceedings/vrw/2020/6532/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2020/6532/0/09090457",
"title": "Affective Embodiment: The effect of avatar appearance and posture representation on emotions in VR",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090457/1jIxjXwO4HS",
"parentPublication": {
"id": "proceedings/vrw/2020/6532/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09382882",
"articleId": "1saZp4i6P8k",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09382928",
"articleId": "1saZuaAmvlu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1HMOit1lSk8",
"title": "Dec.",
"year": "2022",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1vyjtwGIZkQ",
"doi": "10.1109/TVCG.2021.3099115",
"abstract": "This research investigates how experiencing virtual embodiment in a wheelchair affects implicit bias towards people who use wheelchairs. We also investigate how receiving information from a virtual instructor who uses a wheelchair affects implicit bias towards people who use wheelchairs. Implicit biases are actions or judgments of people towards various concepts or stereotypes (e.g., races). We hypothesized that experiencing a Disability Simulation (DS) through an avatar in a wheelchair and receiving information from an instructor with a disability will have a significant effect on participants’ ability to recall disability-related information and will reduce implicit biases towards people who use wheelchairs. To investigate this hypothesis, a 2x2 between-subjects user study was conducted where participants experienced an immersive VR DS that presents information about Multiple Sclerosis (MS) with factors of instructor (i.e., instructor with a disability versus instructor without a disability) and locomotion interface (i.e., without a disability – locomotion through in-place-walking, with a disability – locomotion in a wheelchair). Participants took a disability-focused Implicit Association Test two times, once before and once after experiencing the DS. They also took a test of knowledge retention about MS. The primary result is: experiencing the DS through locomotion in a wheelchair was better for both the disability-related information recall task and reducing implicit bias towards people who use wheelchairs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This research investigates how experiencing virtual embodiment in a wheelchair affects implicit bias towards people who use wheelchairs. We also investigate how receiving information from a virtual instructor who uses a wheelchair affects implicit bias towards people who use wheelchairs. Implicit biases are actions or judgments of people towards various concepts or stereotypes (e.g., races). We hypothesized that experiencing a Disability Simulation (DS) through an avatar in a wheelchair and receiving information from an instructor with a disability will have a significant effect on participants’ ability to recall disability-related information and will reduce implicit biases towards people who use wheelchairs. To investigate this hypothesis, a 2x2 between-subjects user study was conducted where participants experienced an immersive VR DS that presents information about Multiple Sclerosis (MS) with factors of instructor (i.e., instructor with a disability versus instructor without a disability) and locomotion interface (i.e., without a disability – locomotion through in-place-walking, with a disability – locomotion in a wheelchair). Participants took a disability-focused Implicit Association Test two times, once before and once after experiencing the DS. They also took a test of knowledge retention about MS. The primary result is: experiencing the DS through locomotion in a wheelchair was better for both the disability-related information recall task and reducing implicit bias towards people who use wheelchairs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This research investigates how experiencing virtual embodiment in a wheelchair affects implicit bias towards people who use wheelchairs. We also investigate how receiving information from a virtual instructor who uses a wheelchair affects implicit bias towards people who use wheelchairs. Implicit biases are actions or judgments of people towards various concepts or stereotypes (e.g., races). We hypothesized that experiencing a Disability Simulation (DS) through an avatar in a wheelchair and receiving information from an instructor with a disability will have a significant effect on participants’ ability to recall disability-related information and will reduce implicit biases towards people who use wheelchairs. To investigate this hypothesis, a 2x2 between-subjects user study was conducted where participants experienced an immersive VR DS that presents information about Multiple Sclerosis (MS) with factors of instructor (i.e., instructor with a disability versus instructor without a disability) and locomotion interface (i.e., without a disability – locomotion through in-place-walking, with a disability – locomotion in a wheelchair). Participants took a disability-focused Implicit Association Test two times, once before and once after experiencing the DS. They also took a test of knowledge retention about MS. The primary result is: experiencing the DS through locomotion in a wheelchair was better for both the disability-related information recall task and reducing implicit bias towards people who use wheelchairs.",
"title": "A Wheelchair Locomotion Interface in a VR Disability Simulation Reduces Implicit Bias",
"normalizedTitle": "A Wheelchair Locomotion Interface in a VR Disability Simulation Reduces Implicit Bias",
"fno": "09495106",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Avatars",
"Human Computer Interaction",
"Medical Computing",
"Prejudicial Factors",
"User Interfaces",
"Wheelchairs",
"Avatar",
"Disability Related Information Recall Task",
"DS",
"Implicit Association Test",
"Implicit Bias",
"MS",
"Multiple Sclerosis",
"Virtual Embodiment",
"Virtual Instructor",
"VR Disability Simulation",
"Wheelchair Locomotion Interface",
"Head Mounted Displays",
"Avatars",
"Virtual Reality",
"Particle Measurements",
"Atmospheric Measurements",
"Tracking",
"Navigation",
"Virtual Reality",
"Disability Simulation",
"Implicit Association Test",
"IAT",
"Bias",
"Immersion",
"Presence",
"Learning",
"Information Recall",
"Head Mounted Display",
"HMD"
],
"authors": [
{
"givenName": "Tanvir Irfan",
"surname": "Chowdhury",
"fullName": "Tanvir Irfan Chowdhury",
"affiliation": "Department of Computer Science, Marshall University, Huntington, WV, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Quarles",
"fullName": "John Quarles",
"affiliation": "Department of Computer Science, University of Texas at San Antonio, San Antonio, TX, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "4658-4670",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/percomw/2016/1941/0/07457151",
"title": "SpinSafe: An unsupervised smartphone-based wheelchair path monitoring system",
"doi": null,
"abstractUrl": "/proceedings-article/percomw/2016/07457151/12OmNBkP3EM",
"parentPublication": {
"id": "proceedings/percomw/2016/1941/0",
"title": "2016 IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssiai/2014/4053/0/06806027",
"title": "Head operated electric wheelchair",
"doi": null,
"abstractUrl": "/proceedings-article/ssiai/2014/06806027/12OmNwcUk1b",
"parentPublication": {
"id": "proceedings/ssiai/2014/4053/0",
"title": "2014 IEEE Southwest Symposium on Image Analysis and Interpretation (SSIAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2015/6886/0/07131756",
"title": "Distance perception during cooperative virtual locomotion",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2015/07131756/12OmNy49sEA",
"parentPublication": {
"id": "proceedings/3dui/2015/6886/0",
"title": "2015 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2015/0478/0/07507101",
"title": "An extended Eye Movement Tracker system for an electric wheelchair movement control",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2015/07507101/12OmNyLiuFb",
"parentPublication": {
"id": "proceedings/aiccsa/2015/0478/0",
"title": "2015 IEEE/ACS 12th International Conference of Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446345",
"title": "Investigating a Sparse Peripheral Display in a Head-Mounted Display for VR Locomotion",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446345/13bd1fZBGbI",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798122",
"title": "An Initial Investigation into Stereotypical Influences on Implicit Racial Bias and Embodied Avatars",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798122/1cJ0MR4xjWg",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/08928535",
"title": "VR Disability Simulation Reduces Implicit Bias Towards Persons With Disabilities",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/08928535/1fEi0BsQqBy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2020/6532/0/09090416",
"title": "Shooter Bias in Virtual Reality: The Effect of Avatar Race and Socioeconomic Status on Shooting Decisions",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090416/1jIxANOupNK",
"parentPublication": {
"id": "proceedings/vrw/2020/6532/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2021/1838/0/255600a345",
"title": "Spherical World in Miniature: Exploring the Tiny Planets Metaphor for Discrete Locomotion in Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2021/255600a345/1tuAuPBgHTi",
"parentPublication": {
"id": "proceedings/vr/2021/1838/0",
"title": "2021 IEEE Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdi3c/2021/2569/0/256900a041",
"title": "Development of Head Motion Controlled Wheelchair",
"doi": null,
"abstractUrl": "/proceedings-article/icdi3c/2021/256900a041/1xeWFm36bXa",
"parentPublication": {
"id": "proceedings/icdi3c/2021/2569/0",
"title": "2021 International Conference on Design Innovations for 3Cs Compute Communicate Control (ICDI3C)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09492002",
"articleId": "1volPFh6zyU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09496211",
"articleId": "1vyjumhb4ZO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1HMOit1lSk8",
"title": "Dec.",
"year": "2022",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1vmGThNh9jq",
"doi": "10.1109/TVCG.2021.3097978",
"abstract": "Virtual objects in augmented reality (AR) often appear to float atop real world surfaces, which makes it difficult to determine where they are positioned in space. This is problematic as many applications for AR require accurate spatial perception. In the current study, we examine how the way we render cast shadows–which act as an important monocular depth cue for creating a sense of contact between an object and the surface beneath it–impacts spatial perception. Over two experiments, we evaluate people's sense of surface contact given both traditional and non-traditional shadow shading methods in optical see-through augmented reality (OST AR), video see-through augmented reality (VST AR), and virtual reality (VR) head-mounted displays. Our results provide evidence that nontraditional shading techniques for rendering shadows in AR displays may enhance the accuracy of one's perception of surface contact. This finding implies a possible tradeoff between photorealism and accuracy of depth perception, especially in OST AR displays. However, it also supports the use of more stylized graphics like non-traditional cast shadows to improve perception and interaction in AR applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Virtual objects in augmented reality (AR) often appear to float atop real world surfaces, which makes it difficult to determine where they are positioned in space. This is problematic as many applications for AR require accurate spatial perception. In the current study, we examine how the way we render cast shadows–which act as an important monocular depth cue for creating a sense of contact between an object and the surface beneath it–impacts spatial perception. Over two experiments, we evaluate people's sense of surface contact given both traditional and non-traditional shadow shading methods in optical see-through augmented reality (OST AR), video see-through augmented reality (VST AR), and virtual reality (VR) head-mounted displays. Our results provide evidence that nontraditional shading techniques for rendering shadows in AR displays may enhance the accuracy of one's perception of surface contact. This finding implies a possible tradeoff between photorealism and accuracy of depth perception, especially in OST AR displays. However, it also supports the use of more stylized graphics like non-traditional cast shadows to improve perception and interaction in AR applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Virtual objects in augmented reality (AR) often appear to float atop real world surfaces, which makes it difficult to determine where they are positioned in space. This is problematic as many applications for AR require accurate spatial perception. In the current study, we examine how the way we render cast shadows–which act as an important monocular depth cue for creating a sense of contact between an object and the surface beneath it–impacts spatial perception. Over two experiments, we evaluate people's sense of surface contact given both traditional and non-traditional shadow shading methods in optical see-through augmented reality (OST AR), video see-through augmented reality (VST AR), and virtual reality (VR) head-mounted displays. Our results provide evidence that nontraditional shading techniques for rendering shadows in AR displays may enhance the accuracy of one's perception of surface contact. This finding implies a possible tradeoff between photorealism and accuracy of depth perception, especially in OST AR displays. However, it also supports the use of more stylized graphics like non-traditional cast shadows to improve perception and interaction in AR applications.",
"title": "Shedding Light on Cast Shadows: An Investigation of Perceived Ground Contact in AR and VR",
"normalizedTitle": "Shedding Light on Cast Shadows: An Investigation of Perceived Ground Contact in AR and VR",
"fno": "09490310",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Augmented Reality",
"Helmet Mounted Displays",
"Rendering Computer Graphics",
"Virtual Reality",
"Visual Perception",
"Accurate Spatial Perception",
"Augmented Reality",
"Depth Perception",
"Important Monocular Depth Cue",
"Nontraditional Cast Shadows",
"Nontraditional Shading Techniques",
"Nontraditional Shadow",
"OST AR Displays",
"People",
"Perceived Ground Contact",
"Shadows Which Act",
"Shedding Light",
"Surface Contact",
"Virtual Objects",
"Virtual Reality Head Mounted Displays",
"VR",
"World Surfaces",
"Visualization",
"Rendering Computer Graphics",
"Optical Imaging",
"Optical Sensors",
"Lighting",
"Augmented Reality",
"Image Color Analysis",
"Augmented Reality",
"OST AR",
"VST AR",
"VR",
"Perception",
"Ground Contact",
"Shadows",
"Contrast"
],
"authors": [
{
"givenName": "Haley",
"surname": "Adams",
"fullName": "Haley Adams",
"affiliation": "Department of Electrical and Computer Engineering, Vanderbilt University, Nashville, TN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeanine",
"surname": "Stefanucci",
"fullName": "Jeanine Stefanucci",
"affiliation": "Department of Psychology, University of Utah, Salt Lake City, UT, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sarah",
"surname": "Creem-Regehr",
"fullName": "Sarah Creem-Regehr",
"affiliation": "Department of Psychology, University of Utah, Salt Lake City, UT, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Grant",
"surname": "Pointon",
"fullName": "Grant Pointon",
"affiliation": "Department of Psychology, University of Utah, Salt Lake City, UT, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "William",
"surname": "Thompson",
"fullName": "William Thompson",
"affiliation": "Department of Computer Science, University of Utah, Salt Lake City, UT, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bobby",
"surname": "Bodenheimer",
"fullName": "Bobby Bodenheimer",
"affiliation": "Department of Electrical and Computer Engineering, Vanderbilt University, Nashville, TN, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "4624-4639",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ismar-adjunct/2017/6327/0/6327a202",
"title": "[POSTER] BrightView: Increasing Perceived Brightness in Optical See-Through Head-Mounted Displays",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2017/6327a202/12OmNqI04YU",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2017/6327/0",
"title": "2017 IEEE International Symposium on Mixed and Augmented Reality (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2017/6327/0/6327a192",
"title": "[POSTER] Illumination Estimation Using Cast Shadows for Realistic Augmented Reality Applications",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2017/6327a192/12OmNxX3uLh",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2017/6327/0",
"title": "2017 IEEE International Symposium on Mixed and Augmented Reality (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/03/07867820",
"title": "A Context-Aware Method for Authentically Simulating Outdoors Shadows for Mobile Augmented Reality",
"doi": null,
"abstractUrl": "/journal/tg/2018/03/07867820/13rRUy2YLT6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2018/7592/0/08699263",
"title": "Design and Calibration of an Augmented Reality Haploscope",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2018/08699263/19F1OYkEmWs",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2018/7592/0",
"title": "2018 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a796",
"title": "A Replication Study to Measure the Perceived Three-Dimensional Location of Virtual Objects in Optical See Through Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a796/1CJfrSkdYUE",
"parentPublication": {
"id": "proceedings/vrw/2022/8402/0",
"title": "2022 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/05/08998139",
"title": "Factored Occlusion: Single Spatial Light Modulator Occlusion-capable Optical See-through Augmented Reality Display",
"doi": null,
"abstractUrl": "/journal/tg/2020/05/08998139/1hrXe0Hbv0I",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2020/6532/0/09090547",
"title": "[DC] Resolving Cue Conflicts in Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090547/1jIxw8zwtbO",
"parentPublication": {
"id": "proceedings/vrw/2020/6532/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2020/04/09084269",
"title": "Evaluation of Drop Shadows for Virtual Object Grasping in Augmented Reality",
"doi": null,
"abstractUrl": "/magazine/cg/2020/04/09084269/1jtyNfWJwoo",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2020/8508/0/850800a080",
"title": "Can Retinal Projection Displays Improve Spatial Perception in Augmented Reality?",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2020/850800a080/1pysvYTZF6w",
"parentPublication": {
"id": "proceedings/ismar/2020/8508/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2021/0158/0/015800a422",
"title": "Blending Shadows: Casting Shadows in Virtual and Real using Occlusion-Capable Augmented Reality Near-Eye Displays",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2021/015800a422/1yeD2Kh0vxS",
"parentPublication": {
"id": "proceedings/ismar/2021/0158/0",
"title": "2021 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09488285",
"articleId": "1vhIcg5WCZy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09492002",
"articleId": "1volPFh6zyU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAle6QG",
"title": "March",
"year": "2014",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgs2M3",
"doi": "10.1109/TVCG.2013.109",
"abstract": "Large dynamic networks are targets of analysis in many fields. Tracking temporal changes at scale in these networks is challenging due in part to the fact that small changes can be missed or drowned-out by the rest of the network. For static networks, current approaches allow the identification of specific network elements within their context. However, in the case of dynamic networks, the user is left alone with finding salient local network elements and tracking them over time. In this work, we introduce a modular DoI specification to flexibly define what salient changes are and to assign them a measure of their importance in a time-varying setting. The specification takes into account neighborhood structure information, numerical attributes of nodes/edges, and their temporal evolution. A tailored visualization of the DoI specification complements our approach. Alongside a traditional node-link view of the dynamic network, it serves as an interface for the interactive definition of a DoI function. By using it to successively refine and investigate the captured details, it supports the analysis of dynamic networks from an initial view until pinpointing a user's analysis goal. We report on applying our approach to scientific coauthorship networks and give concrete results for the DBLP data set.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Large dynamic networks are targets of analysis in many fields. Tracking temporal changes at scale in these networks is challenging due in part to the fact that small changes can be missed or drowned-out by the rest of the network. For static networks, current approaches allow the identification of specific network elements within their context. However, in the case of dynamic networks, the user is left alone with finding salient local network elements and tracking them over time. In this work, we introduce a modular DoI specification to flexibly define what salient changes are and to assign them a measure of their importance in a time-varying setting. The specification takes into account neighborhood structure information, numerical attributes of nodes/edges, and their temporal evolution. A tailored visualization of the DoI specification complements our approach. Alongside a traditional node-link view of the dynamic network, it serves as an interface for the interactive definition of a DoI function. By using it to successively refine and investigate the captured details, it supports the analysis of dynamic networks from an initial view until pinpointing a user's analysis goal. We report on applying our approach to scientific coauthorship networks and give concrete results for the DBLP data set.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Large dynamic networks are targets of analysis in many fields. Tracking temporal changes at scale in these networks is challenging due in part to the fact that small changes can be missed or drowned-out by the rest of the network. For static networks, current approaches allow the identification of specific network elements within their context. However, in the case of dynamic networks, the user is left alone with finding salient local network elements and tracking them over time. In this work, we introduce a modular DoI specification to flexibly define what salient changes are and to assign them a measure of their importance in a time-varying setting. The specification takes into account neighborhood structure information, numerical attributes of nodes/edges, and their temporal evolution. A tailored visualization of the DoI specification complements our approach. Alongside a traditional node-link view of the dynamic network, it serves as an interface for the interactive definition of a DoI function. By using it to successively refine and investigate the captured details, it supports the analysis of dynamic networks from an initial view until pinpointing a user's analysis goal. We report on applying our approach to scientific coauthorship networks and give concrete results for the DBLP data set.",
"title": "A Modular Degree-of-Interest Specification for the Visual Analysis of Large Dynamic Networks",
"normalizedTitle": "A Modular Degree-of-Interest Specification for the Visual Analysis of Large Dynamic Networks",
"fno": "ttg2014030337",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Context",
"Data Visualization",
"Radiation Detectors",
"Educational Institutions",
"Electronic Mail",
"Navigation",
"Degree Of Interest",
"Time Varying Graphs",
"Dynamic Graph Visualization"
],
"authors": [
{
"givenName": "James",
"surname": "Abello",
"fullName": "James Abello",
"affiliation": "Rutgers Univ., Piscataway, NJ, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Steffen",
"surname": "Hadlak",
"fullName": "Steffen Hadlak",
"affiliation": "Univ. of Rostock, Rostock, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Heidrun",
"surname": "Schumann",
"fullName": "Heidrun Schumann",
"affiliation": "Univ. of Rostock, Rostock, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hans-Jorg",
"surname": "Schulz",
"fullName": "Hans-Jorg Schulz",
"affiliation": "Univ. of Rostock, Rostock, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2014-03-01 00:00:00",
"pubType": "trans",
"pages": "337-350",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ichi/2017/4881/0/4881a026",
"title": "Visual FHIR: An Interactive Browser to Navigate HL7 FHIR Specification",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2017/4881a026/12OmNB9KHsi",
"parentPublication": {
"id": "proceedings/ichi/2017/4881/0",
"title": "2017 IEEE International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"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/sbcars/2016/5086/0/5086a031",
"title": "Modular Specification of Architectural Constraints",
"doi": null,
"abstractUrl": "/proceedings-article/sbcars/2016/5086a031/12OmNBubOQK",
"parentPublication": {
"id": "proceedings/sbcars/2016/5086/0",
"title": "2016 X Brazilian Symposium on Software Components, Architectures and Reuse (SBCARS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl/1993/3970/0/00269559",
"title": "Visual specification of virtual worlds",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1993/00269559/12OmNBv2CdS",
"parentPublication": {
"id": "proceedings/vl/1993/3970/0",
"title": "Proceedings 1993 IEEE Symposium on Visual Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2012/4752/0/06400534",
"title": "Visual exploration of local interest points in sets of time series",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2012/06400534/12OmNvC0sXn",
"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/icme/2008/2570/0/04607627",
"title": "Dynamic visual saliency modeling based on spatiotemporal analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2008/04607627/12OmNwp74M8",
"parentPublication": {
"id": "proceedings/icme/2008/2570/0",
"title": "2008 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl/1995/7045/0/70450140",
"title": "A framework of a visual language with dynamic specification",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1995/70450140/12OmNy6HQWz",
"parentPublication": {
"id": "proceedings/vl/1995/7045/0",
"title": "Visual Languages, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/models/2017/3492/0/3492a074",
"title": "Reusable Specification Templates for Defining Dynamic Semantics of DSLs",
"doi": null,
"abstractUrl": "/proceedings-article/models/2017/3492a074/12OmNyRg48M",
"parentPublication": {
"id": "proceedings/models/2017/3492/0",
"title": "2017 ACM/IEEE 20th International Conference on Model Driven Engineering Languages and Systems (MODELS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/08/06674295",
"title": "Dynamic Network Visualization withExtended Massive Sequence Views",
"doi": null,
"abstractUrl": "/journal/tg/2014/08/06674295/13rRUx0xPZz",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/12/07369992",
"title": "ThermalPlot: Visualizing Multi-Attribute Time-Series Data Using a Thermal Metaphor",
"doi": null,
"abstractUrl": "/journal/tg/2016/12/07369992/13rRUygT7yg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "ttg2014030351",
"articleId": "13rRUxAAT0V",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgJ8",
"name": "ttg2014030337s1.avi",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2014030337s1.avi",
"extension": "avi",
"size": "41.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNy7Qfqh",
"title": "May",
"year": "2017",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwbaqUR",
"doi": "10.1109/TVCG.2016.2535340",
"abstract": "Eye-tracking data is currently analyzed in the image space that gaze-coordinates were recorded in, generally with the help of overlays such as heatmaps or scanpaths, or with the help of manually defined areas of interest (AOI). Such analyses, which focus predominantly on where on the screen users are looking, require significant manual input and are not feasible for studies involving many subjects, long sessions, and heavily interactive visual stimuli. Alternatively, we show that it is feasible to collect and analyze eye-tracking information in data space. Specifically, the visual layout of visualizations with open source code that can be instrumented is known at rendering time, and thus can be used to relate gaze-coordinates to visualization and data objects that users view, in real time. We demonstrate the effectiveness of this approach by showing that data collected using this methodology from nine users working with an interactive visualization, was well aligned with the tasks that those users were asked to solve, and similar to annotation data produced by five human coders. Moreover, we introduce an algorithm that, given our instrumented visualization, could translate gaze-coordinates into viewed objects with greater accuracy than simply binning gazes into dynamically defined AOIs. Finally, we discuss the challenges, opportunities, and benefits of analyzing eye-tracking in visualization and data space.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Eye-tracking data is currently analyzed in the image space that gaze-coordinates were recorded in, generally with the help of overlays such as heatmaps or scanpaths, or with the help of manually defined areas of interest (AOI). Such analyses, which focus predominantly on where on the screen users are looking, require significant manual input and are not feasible for studies involving many subjects, long sessions, and heavily interactive visual stimuli. Alternatively, we show that it is feasible to collect and analyze eye-tracking information in data space. Specifically, the visual layout of visualizations with open source code that can be instrumented is known at rendering time, and thus can be used to relate gaze-coordinates to visualization and data objects that users view, in real time. We demonstrate the effectiveness of this approach by showing that data collected using this methodology from nine users working with an interactive visualization, was well aligned with the tasks that those users were asked to solve, and similar to annotation data produced by five human coders. Moreover, we introduce an algorithm that, given our instrumented visualization, could translate gaze-coordinates into viewed objects with greater accuracy than simply binning gazes into dynamically defined AOIs. Finally, we discuss the challenges, opportunities, and benefits of analyzing eye-tracking in visualization and data space.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Eye-tracking data is currently analyzed in the image space that gaze-coordinates were recorded in, generally with the help of overlays such as heatmaps or scanpaths, or with the help of manually defined areas of interest (AOI). Such analyses, which focus predominantly on where on the screen users are looking, require significant manual input and are not feasible for studies involving many subjects, long sessions, and heavily interactive visual stimuli. Alternatively, we show that it is feasible to collect and analyze eye-tracking information in data space. Specifically, the visual layout of visualizations with open source code that can be instrumented is known at rendering time, and thus can be used to relate gaze-coordinates to visualization and data objects that users view, in real time. We demonstrate the effectiveness of this approach by showing that data collected using this methodology from nine users working with an interactive visualization, was well aligned with the tasks that those users were asked to solve, and similar to annotation data produced by five human coders. Moreover, we introduce an algorithm that, given our instrumented visualization, could translate gaze-coordinates into viewed objects with greater accuracy than simply binning gazes into dynamically defined AOIs. Finally, we discuss the challenges, opportunities, and benefits of analyzing eye-tracking in visualization and data space.",
"title": "Analyzing Eye-Tracking Information in Visualization and Data Space: From Where on the Screen to What on the Screen",
"normalizedTitle": "Analyzing Eye-Tracking Information in Visualization and Data Space: From Where on the Screen to What on the Screen",
"fno": "07420740",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Gaze Tracking",
"Interactive Systems",
"Eye Tracking Information Analysis",
"Data Space Visualization",
"Eye Tracking Data",
"Image Space",
"Screen Users",
"Interactive Visual Stimuli",
"Data Space",
"Visual Layout",
"Rendering Time",
"Interactive Visualization",
"Annotation Data",
"Human Coders",
"Instrumented Visualization",
"Translate Gaze Coordinates",
"Data Visualization",
"Visualization",
"Instruments",
"Layout",
"Rendering Computer Graphics",
"Real Time Systems",
"Computers",
"Eye Tracking",
"Area Of Interest Analysis",
"Usability Analysis",
"Evaluation"
],
"authors": [
{
"givenName": "Sayeed Safayet",
"surname": "Alam",
"fullName": "Sayeed Safayet Alam",
"affiliation": "School of Computing and Information Sciences, Florida International University, Miami, FL",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Radu",
"surname": "Jianu",
"fullName": "Radu Jianu",
"affiliation": "School of Computing and Information Sciences, Florida International University, Miami, FL",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2017-05-01 00:00:00",
"pubType": "trans",
"pages": "1492-1505",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/etvis/2016/4731/0/07851165",
"title": "Visualizing eye tracking data with gaze-guided slit-scans",
"doi": null,
"abstractUrl": "/proceedings-article/etvis/2016/07851165/12OmNB8kHPk",
"parentPublication": {
"id": "proceedings/etvis/2016/4731/0",
"title": "2016 IEEE Second Workshop on Eye Tracking and Visualization (ETVIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2015/7568/0/7568a107",
"title": "Visual Analysis of Eye Movements by Hierarchical Filter Wheels",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2015/7568a107/12OmNC2xhyv",
"parentPublication": {
"id": "proceedings/iv/2015/7568/0",
"title": "2015 19th International Conference on Information Visualisation (iV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/tefse/2013/0495/0/06620154",
"title": "Towards an eye-tracking enabled IDE for software traceability tasks",
"doi": null,
"abstractUrl": "/proceedings-article/tefse/2013/06620154/12OmNCf1DoK",
"parentPublication": {
"id": "proceedings/tefse/2013/0495/0",
"title": "2013 International Workshop on Traceability in Emerging Forms of Software Engineering (TEFSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2017/1710/0/1710a787",
"title": "Analyzing the Impact of Cognitive Load in Evaluating Gaze-Based Typing",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2017/1710a787/12OmNx1IwaL",
"parentPublication": {
"id": "proceedings/cbms/2017/1710/0",
"title": "2017 IEEE 30th International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vissoft/2017/1003/0/1003a022",
"title": "iTraceVis: Visualizing Eye Movement Data Within Eclipse",
"doi": null,
"abstractUrl": "/proceedings-article/vissoft/2017/1003a022/12OmNxWcHcx",
"parentPublication": {
"id": "proceedings/vissoft/2017/1003/0",
"title": "2017 IEEE Working Conference on Software Visualization (VISSOFT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etvis/2016/4731/0/07851164",
"title": "Color bands: visualizing dynamic eye movement patterns",
"doi": null,
"abstractUrl": "/proceedings-article/etvis/2016/07851164/12OmNyUnEDW",
"parentPublication": {
"id": "proceedings/etvis/2016/4731/0",
"title": "2016 IEEE Second Workshop on Eye Tracking and Visualization (ETVIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/02/07414495",
"title": "Fauxvea: Crowdsourcing Gaze Location Estimates for Visualization Analysis Tasks",
"doi": null,
"abstractUrl": "/journal/tg/2017/02/07414495/13rRUwInvyE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/05/08643434",
"title": "SGaze: A Data-Driven Eye-Head Coordination Model for Realtime Gaze Prediction",
"doi": null,
"abstractUrl": "/journal/tg/2019/05/08643434/18K0lRIKi7m",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iisa/2020/2346/0/09284374",
"title": "Eye Gaze Analysis of Students in Educational Systems",
"doi": null,
"abstractUrl": "/proceedings-article/iisa/2020/09284374/1pttO1dX1xC",
"parentPublication": {
"id": "proceedings/iisa/2020/2346/0",
"title": "2020 11th International Conference on Information, Intelligence, Systems and Applications (IISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a729",
"title": "Eye-To-Eye: Towards Visualizing Eye Gaze Data",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a729/1rSRdeRt8ek",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07414526",
"articleId": "13rRUwdIOUS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07420745",
"articleId": "13rRUwd9CLS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCy2L3z",
"title": "Oct.",
"year": "2012",
"issueNum": "10",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUynHuj7",
"doi": "10.1109/TVCG.2012.23",
"abstract": "This paper describes a new method to explore and discover within a large data set. We apply techniques from preference elicitation to automatically identify data elements that are of potential interest to the viewer. These \"elements of interest (EOI)” are bundled into spatially local clusters, and connected together to form a graph. The graph is used to build camera paths that allow viewers to \"tour” areas of interest (AOI) within their data. It is also visualized to provide wayfinding cues. Our preference model uses Bayesian classification to tag elements in a data set as interesting or not interesting to the viewer. The model responds in real time, updating the elements of interest based on a viewer's actions. This allows us to track a viewer's interests as they change during exploration and analysis. Viewers can also interact directly with interest rules the preference model defines. We demonstrate our theoretical results by visualizing historical climatology data collected at locations throughout the world.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper describes a new method to explore and discover within a large data set. We apply techniques from preference elicitation to automatically identify data elements that are of potential interest to the viewer. These \"elements of interest (EOI)” are bundled into spatially local clusters, and connected together to form a graph. The graph is used to build camera paths that allow viewers to \"tour” areas of interest (AOI) within their data. It is also visualized to provide wayfinding cues. Our preference model uses Bayesian classification to tag elements in a data set as interesting or not interesting to the viewer. The model responds in real time, updating the elements of interest based on a viewer's actions. This allows us to track a viewer's interests as they change during exploration and analysis. Viewers can also interact directly with interest rules the preference model defines. We demonstrate our theoretical results by visualizing historical climatology data collected at locations throughout the world.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper describes a new method to explore and discover within a large data set. We apply techniques from preference elicitation to automatically identify data elements that are of potential interest to the viewer. These \"elements of interest (EOI)” are bundled into spatially local clusters, and connected together to form a graph. The graph is used to build camera paths that allow viewers to \"tour” areas of interest (AOI) within their data. It is also visualized to provide wayfinding cues. Our preference model uses Bayesian classification to tag elements in a data set as interesting or not interesting to the viewer. The model responds in real time, updating the elements of interest based on a viewer's actions. This allows us to track a viewer's interests as they change during exploration and analysis. Viewers can also interact directly with interest rules the preference model defines. We demonstrate our theoretical results by visualizing historical climatology data collected at locations throughout the world.",
"title": "Interest Driven Navigation in Visualization",
"normalizedTitle": "Interest Driven Navigation in Visualization",
"fno": "ttg2012101744",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Bayesian Methods",
"Navigation",
"Data Models",
"Cameras",
"Context Awareness",
"Visualization",
"Bayesian Network",
"Classification",
"Navigation",
"Preferences"
],
"authors": [
{
"givenName": "Christopher G.",
"surname": "Healey",
"fullName": "Christopher G. Healey",
"affiliation": "North Carolina State University, Raleigh",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Brent M.",
"surname": "Dennis",
"fullName": "Brent M. Dennis",
"affiliation": "Massachusetts Institute of Technology, Lexington",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2012-10-01 00:00:00",
"pubType": "trans",
"pages": "1744-1756",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icitcs/2013/2845/0/06717898",
"title": "Visualization for Interest in Music Based on Plurk Social Network",
"doi": null,
"abstractUrl": "/proceedings-article/icitcs/2013/06717898/12OmNApu5EW",
"parentPublication": {
"id": "proceedings/icitcs/2013/2845/0",
"title": "2013 International Conference on IT Convergence and Security (ICITCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percomw/2007/2788/0/04144873",
"title": "The XVC Framework for In-Vehicle User Interfaces",
"doi": null,
"abstractUrl": "/proceedings-article/percomw/2007/04144873/12OmNvDqsHX",
"parentPublication": {
"id": "proceedings/percomw/2007/2788/0",
"title": "Pervasive Computing and Communications Workshops, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2008/1969/0/04720434",
"title": "Forming communities in Web-based Educational Systems through users' preferences and interest measuring",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2008/04720434/12OmNwoPtyh",
"parentPublication": {
"id": "proceedings/fie/2008/1969/0",
"title": "2008 38th Annual Frontiers in Education Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498dennis",
"title": "Assisted Navigation of Complex Information Spaces",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498dennis/12OmNx5pj4i",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/uic-atc-scalcom/2015/7211/0/07518294",
"title": "The Research on Broadcast Television User Interest Model Based on Principal Component Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/uic-atc-scalcom/2015/07518294/12OmNybx21E",
"parentPublication": {
"id": "proceedings/uic-atc-scalcom/2015/7211/0",
"title": "2015 IEEE 12th Intl Conf on Ubiquitous Intelligence and Computing and 2015 IEEE 12th Intl Conf on Autonomic and Trusted Computing and 2015 IEEE 15th Intl Conf on Scalable Computing and Communications and Its Associated Workshops (UIC-ATC-ScalCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017597",
"title": "Data Visualization Saliency Model: A Tool for Evaluating Abstract Data Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017597/13rRUNvyaf6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2000/01/v0024",
"title": "Graph Visualization and Navigation in Information Visualization: A Survey",
"doi": null,
"abstractUrl": "/journal/tg/2000/01/v0024/13rRUxNW1TM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom-bigdatase/2018/4388/0/438801a639",
"title": "A Full-Scale Security Visualization Effectiveness Measurement and Presentation Approach",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom-bigdatase/2018/438801a639/17D45X2fUHr",
"parentPublication": {
"id": "proceedings/trustcom-bigdatase/2018/4388/0",
"title": "2018 17th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/ 12th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2020/8508/0/850800a600",
"title": "Automatic Generation of Diegetic Guidance in Cinematic Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2020/850800a600/1pysw9jL61i",
"parentPublication": {
"id": "proceedings/ismar/2020/8508/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a141",
"title": "Improving Engagement of Animated Visualization with Visual Foreshadowing",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a141/1qRNNrMSIrm",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012101731",
"articleId": "13rRUIIVlke",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012101757",
"articleId": "13rRUxASuSL",
"__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": "17D45WHONig",
"doi": "10.1109/TVCG.2018.2865042",
"abstract": "Eye-tracking has become an invaluable tool for the analysis of working practices in many technological fields of activity. Typically studies focus on short tasks and use static expected areas of interest (AoI) in the display to explore subjects' behaviour, making the analyst's task quite straightforward. In long-duration studies, where the observations may last several hours over a complete work session, the AoIs may change over time in response to altering workload, emergencies or other variables making the analysis more difficult. This work puts forward a novel method to automatically identify spatial AoIs changing over time through a combination of clustering and cluster merging in the temporal domain. A visual analysis system based on the proposed methods is also presented. Finally, we illustrate our approach within the domain of air traffic control, a complex task sensitive to prevailing conditions over long durations, though it is applicable to other domains such as monitoring of complex systems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Eye-tracking has become an invaluable tool for the analysis of working practices in many technological fields of activity. Typically studies focus on short tasks and use static expected areas of interest (AoI) in the display to explore subjects' behaviour, making the analyst's task quite straightforward. In long-duration studies, where the observations may last several hours over a complete work session, the AoIs may change over time in response to altering workload, emergencies or other variables making the analysis more difficult. This work puts forward a novel method to automatically identify spatial AoIs changing over time through a combination of clustering and cluster merging in the temporal domain. A visual analysis system based on the proposed methods is also presented. Finally, we illustrate our approach within the domain of air traffic control, a complex task sensitive to prevailing conditions over long durations, though it is applicable to other domains such as monitoring of complex systems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Eye-tracking has become an invaluable tool for the analysis of working practices in many technological fields of activity. Typically studies focus on short tasks and use static expected areas of interest (AoI) in the display to explore subjects' behaviour, making the analyst's task quite straightforward. In long-duration studies, where the observations may last several hours over a complete work session, the AoIs may change over time in response to altering workload, emergencies or other variables making the analysis more difficult. This work puts forward a novel method to automatically identify spatial AoIs changing over time through a combination of clustering and cluster merging in the temporal domain. A visual analysis system based on the proposed methods is also presented. Finally, we illustrate our approach within the domain of air traffic control, a complex task sensitive to prevailing conditions over long durations, though it is applicable to other domains such as monitoring of complex systems.",
"title": "Identification of Temporally Varying Areas of Interest in Long-Duration Eye-Tracking Data Sets",
"normalizedTitle": "Identification of Temporally Varying Areas of Interest in Long-Duration Eye-Tracking Data Sets",
"fno": "08454276",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Gaze Tracking",
"Inertial Systems",
"Pattern Clustering",
"Clustering",
"Temporal Domain",
"Visual Analysis System",
"Long Duration Eye Tracking Data",
"Static Expected Areas",
"Long Duration Studies",
"Spatial Ao Is",
"Visualization",
"Task Analysis",
"Monitoring",
"Labeling",
"Microsoft Windows",
"Merging",
"Vehicles",
"Eye Tracking Data",
"Areas Of Interest",
"Clustering",
"Minimum Spanning Tree",
"Temporal Data",
"Spatio Temporal Data"
],
"authors": [
{
"givenName": "Prithiviraj K.",
"surname": "Muthumanickam",
"fullName": "Prithiviraj K. Muthumanickam",
"affiliation": "Linköping University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Katerina",
"surname": "Vrotsou",
"fullName": "Katerina Vrotsou",
"affiliation": "Linköping University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Aida",
"surname": "Nordman",
"fullName": "Aida Nordman",
"affiliation": "Linköping University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jimmy",
"surname": "Johansson",
"fullName": "Jimmy Johansson",
"affiliation": "Linköping University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matthew",
"surname": "Cooper",
"fullName": "Matthew Cooper",
"affiliation": "Linköping University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "87-97",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdar/2017/3586/1/3586b361",
"title": "ICDAR2017 Competition on Layout Analysis for Challenging Medieval Manuscripts",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2017/3586b361/12OmNscOUg6",
"parentPublication": {
"id": "proceedings/icdar/2017/3586/1",
"title": "2017 14th IAPR International Conference on Document Analysis and Recognition (ICDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigcomp/2018/3649/0/364901a689",
"title": "Anomaly Pattern Detection on Data Streams",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2018/364901a689/12OmNx5piWa",
"parentPublication": {
"id": "proceedings/bigcomp/2018/3649/0",
"title": "2018 IEEE International Conference on Big Data and Smart Computing (BigComp)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icfhr/2018/5875/0/587500a374",
"title": "Text Line Segmentation for Challenging Handwritten Document Images using Fully Convolutional Network",
"doi": null,
"abstractUrl": "/proceedings-article/icfhr/2018/587500a374/17D45VTRoEh",
"parentPublication": {
"id": "proceedings/icfhr/2018/5875/0",
"title": "2018 16th International Conference on Frontiers in Handwriting Recognition (ICFHR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2019/6868/0/09073171",
"title": "Neural Embedding Features for Point-of-Interest Recommendation",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2019/09073171/1jjAdkolBjW",
"parentPublication": {
"id": "proceedings/asonam/2019/6868/0",
"title": "2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101574",
"title": "Approximate Quantiles for Datacenter Telemetry Monitoring",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101574/1kaMFHn79MA",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iri/2020/1054/0/09191571",
"title": "Automated Filtering of Eye Gaze Metrics from Dynamic Areas of Interest",
"doi": null,
"abstractUrl": "/proceedings-article/iri/2020/09191571/1n0IyGDlxPq",
"parentPublication": {
"id": "proceedings/iri/2020/1054/0",
"title": "2020 IEEE 21st International Conference on Information Reuse and Integration for Data Science (IRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msn/2020/9916/0/991600a502",
"title": "Analyzing Eye-movements of Drivers with Different Experiences When Making a Turn",
"doi": null,
"abstractUrl": "/proceedings-article/msn/2020/991600a502/1sBOacKf6TK",
"parentPublication": {
"id": "proceedings/msn/2020/9916/0",
"title": "2020 16th International Conference on Mobility, Sensing and Networking (MSN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440823",
"articleId": "17D45W2WyxW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440839",
"articleId": "17D45XfSEST",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i4QAryt8gE",
"name": "ttg201901-08454276s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08454276s1.mp4",
"extension": "mp4",
"size": "138 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyq0zFI",
"title": "May",
"year": "2020",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1hpPBqG2djy",
"doi": "10.1109/TVCG.2020.2973058",
"abstract": "We present a new method to capture the acoustic characteristics of real-world rooms using commodity devices, and use the captured characteristics to generate similar sounding sources with virtual models. Given the captured audio and an approximate geometric model of a real-world room, we present a novel learning-based method to estimate its acoustic material properties. Our approach is based on deep neural networks that estimate the reverberation time and equalization of the room from recorded audio. These estimates are used to compute material properties related to room reverberation using a novel material optimization objective. We use the estimated acoustic material characteristics for audio rendering using interactive geometric sound propagation and highlight the performance on many real-world scenarios. We also perform a user study to evaluate the perceptual similarity between the recorded sounds and our rendered audio.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a new method to capture the acoustic characteristics of real-world rooms using commodity devices, and use the captured characteristics to generate similar sounding sources with virtual models. Given the captured audio and an approximate geometric model of a real-world room, we present a novel learning-based method to estimate its acoustic material properties. Our approach is based on deep neural networks that estimate the reverberation time and equalization of the room from recorded audio. These estimates are used to compute material properties related to room reverberation using a novel material optimization objective. We use the estimated acoustic material characteristics for audio rendering using interactive geometric sound propagation and highlight the performance on many real-world scenarios. We also perform a user study to evaluate the perceptual similarity between the recorded sounds and our rendered audio.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a new method to capture the acoustic characteristics of real-world rooms using commodity devices, and use the captured characteristics to generate similar sounding sources with virtual models. Given the captured audio and an approximate geometric model of a real-world room, we present a novel learning-based method to estimate its acoustic material properties. Our approach is based on deep neural networks that estimate the reverberation time and equalization of the room from recorded audio. These estimates are used to compute material properties related to room reverberation using a novel material optimization objective. We use the estimated acoustic material characteristics for audio rendering using interactive geometric sound propagation and highlight the performance on many real-world scenarios. We also perform a user study to evaluate the perceptual similarity between the recorded sounds and our rendered audio.",
"title": "Scene-Aware Audio Rendering via Deep Acoustic Analysis",
"normalizedTitle": "Scene-Aware Audio Rendering via Deep Acoustic Analysis",
"fno": "08998301",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Acoustic Signal Processing",
"Audio Signal Processing",
"Learning Artificial Intelligence",
"Neural Nets",
"Optimisation",
"Reverberation",
"Acoustic Material Characteristics",
"Sounding Sources",
"Deep Acoustic Analysis",
"Rendered Audio",
"Interactive Geometric Sound Propagation",
"Room Reverberation",
"Equalization",
"Reverberation Time",
"Deep Neural Networks",
"Learning Based Method",
"Approximate Geometric Model",
"Captured Audio",
"Virtual Models",
"Commodity Devices",
"Real World Room",
"Scene Aware Audio Rendering",
"Acoustics",
"Optimization",
"Rendering Computer Graphics",
"Visualization",
"Acoustic Materials",
"Frequency Estimation",
"Estimation",
"Audio Rendering",
"Audio Learning",
"Material Optimization"
],
"authors": [
{
"givenName": "Zhenyu",
"surname": "Tang",
"fullName": "Zhenyu Tang",
"affiliation": "University of Maryland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nicholas J.",
"surname": "Bryan",
"fullName": "Nicholas J. Bryan",
"affiliation": "Adobe Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dingzeyu",
"surname": "Li",
"fullName": "Dingzeyu Li",
"affiliation": "Adobe Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Timothy R.",
"surname": "Langlois",
"fullName": "Timothy R. Langlois",
"affiliation": "Adobe Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dinesh",
"surname": "Manocha",
"fullName": "Dinesh Manocha",
"affiliation": "University of Maryland",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2020-05-01 00:00:00",
"pubType": "trans",
"pages": "1991-2001",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2017/6067/0/08019294",
"title": "Improving acoustic modeling using audio-visual speech",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2017/08019294/12OmNCbU2UT",
"parentPublication": {
"id": "proceedings/icme/2017/6067/0",
"title": "2017 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2017/2610/0/261001a621",
"title": "3D Room Geometry Reconstruction Using Audio-Visual Sensors",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2017/261001a621/12OmNqNosaP",
"parentPublication": {
"id": "proceedings/3dv/2017/2610/0",
"title": "2017 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2006/9753/0/04042282",
"title": "Spatial Sound Rendering Using Measured Room Impulse Responses",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2006/04042282/12OmNy3iFfx",
"parentPublication": {
"id": "proceedings/isspit/2006/9753/0",
"title": "2006 IEEE International Symposium on Signal Processing and Information Technology",
"__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": "trans/tg/2018/03/07849179",
"title": "Acoustic Classification and Optimization for Multi-Modal Rendering of Real-World Scenes",
"doi": null,
"abstractUrl": "/journal/tg/2018/03/07849179/13rRUNvgz9Y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600s8836",
"title": "Visual Acoustic Matching",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600s8836/1H0LBaUp66Y",
"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/vr/2019/1377/0/08798247",
"title": "Immersive Spatial Audio Reproduction for VR/AR Using Room Acoustic Modelling from 360° Images",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798247/1cJ1gHhXwha",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2020/6532/0/09090553",
"title": "Scene-aware Sound Rendering in Virtual and Real Worlds",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090553/1jIxzQzr0EU",
"parentPublication": {
"id": "proceedings/vrw/2020/6532/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2020/6553/0/09093307",
"title": "Audio-Visual Model Distillation Using Acoustic Images",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2020/09093307/1jPbtIN9OWA",
"parentPublication": {
"id": "proceedings/wacv/2020/6553/0",
"title": "2020 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2021/1298/0/129800a487",
"title": "Vision-based Acoustic Information Retrieval for Interactive Sound Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2021/129800a487/1yfxLit9Jw4",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2021/1298/0",
"title": "2021 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08998293",
"articleId": "1hrXiCmKkak",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08998303",
"articleId": "1hrXfo1lGb6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1iEgrrdfQXK",
"name": "ttg202005-08998301s1-supp1-2973058.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202005-08998301s1-supp1-2973058.mp4",
"extension": "mp4",
"size": "4.92 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1Ciz7jJQnU4",
"title": "May",
"year": "2022",
"issueNum": "05",
"idPrefix": "tm",
"pubType": "journal",
"volume": "21",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1o3njwLFEqI",
"doi": "10.1109/TMC.2020.3032278",
"abstract": "With the flourish of the smart devices and their applications, controlling devices using gestures has attracted increasing attention for ubiquitous sensing and interaction. Recent works use acoustic signals to track hand movement and recognize gestures. However, they suffer from low robustness due to frequency selective fading, interference and insufficient training data. In this work, we propose RobuCIR, a robust contact-free gesture recognition system that can work under different practical impact factors with high accuracy and robustness. RobuCIR adopts frequency-hopping mechanism to mitigate frequency selective fading and avoid signal interference. To further increase system robustness, we investigate a series of data augmentation techniques based on a small volume of collected data to emulate different practical impact factors. The augmented data is used to effectively train neural network models and cope with various influential factors (e.g., gesture speed, distance to transceiver, <italic>etc</italic>.). Our experiment results show that RobuCIR can recognize 15 gestures and outperform state-of-the-art works in terms of accuracy and robustness.",
"abstracts": [
{
"abstractType": "Regular",
"content": "With the flourish of the smart devices and their applications, controlling devices using gestures has attracted increasing attention for ubiquitous sensing and interaction. Recent works use acoustic signals to track hand movement and recognize gestures. However, they suffer from low robustness due to frequency selective fading, interference and insufficient training data. In this work, we propose RobuCIR, a robust contact-free gesture recognition system that can work under different practical impact factors with high accuracy and robustness. RobuCIR adopts frequency-hopping mechanism to mitigate frequency selective fading and avoid signal interference. To further increase system robustness, we investigate a series of data augmentation techniques based on a small volume of collected data to emulate different practical impact factors. The augmented data is used to effectively train neural network models and cope with various influential factors (e.g., gesture speed, distance to transceiver, <italic>etc</italic>.). Our experiment results show that RobuCIR can recognize 15 gestures and outperform state-of-the-art works in terms of accuracy and robustness.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "With the flourish of the smart devices and their applications, controlling devices using gestures has attracted increasing attention for ubiquitous sensing and interaction. Recent works use acoustic signals to track hand movement and recognize gestures. However, they suffer from low robustness due to frequency selective fading, interference and insufficient training data. In this work, we propose RobuCIR, a robust contact-free gesture recognition system that can work under different practical impact factors with high accuracy and robustness. RobuCIR adopts frequency-hopping mechanism to mitigate frequency selective fading and avoid signal interference. To further increase system robustness, we investigate a series of data augmentation techniques based on a small volume of collected data to emulate different practical impact factors. The augmented data is used to effectively train neural network models and cope with various influential factors (e.g., gesture speed, distance to transceiver, etc.). Our experiment results show that RobuCIR can recognize 15 gestures and outperform state-of-the-art works in terms of accuracy and robustness.",
"title": "Push the Limit of Acoustic Gesture Recognition",
"normalizedTitle": "Push the Limit of Acoustic Gesture Recognition",
"fno": "09229520",
"hasPdf": true,
"idPrefix": "tm",
"keywords": [
"Acoustic Signal Processing",
"Data Analysis",
"Gesture Recognition",
"Image Motion Analysis",
"Neural Nets",
"Object Tracking",
"Ubiquitous Computing",
"Acoustic Gesture Recognition",
"Smart Devices",
"Ubiquitous Sensing",
"Acoustic Signals",
"Hand Movement Tracking",
"Robu CIR",
"Frequency Hopping Mechanism",
"Frequency Selective Fading",
"Signal Interference",
"Data Augmentation",
"Robust Contact Free Gesture Recognition",
"Neural Network Training",
"Ubiquitous Interaction",
"Acoustics",
"Gesture Recognition",
"Bibliometrics",
"Channel Estimation",
"Acoustic Measurements",
"Robustness",
"Fading Channels",
"Acoustic Sensing",
"Smart Devices",
"Gesture Recognition",
"Contact Free",
"Data Augmentation"
],
"authors": [
{
"givenName": "Yanwen",
"surname": "Wang",
"fullName": "Yanwen Wang",
"affiliation": "Department of Computing, The Hong Kong Polytechnic University, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiaxing",
"surname": "Shen",
"fullName": "Jiaxing Shen",
"affiliation": "Department of Computing, The Hong Kong Polytechnic University, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuanqing",
"surname": "Zheng",
"fullName": "Yuanqing Zheng",
"affiliation": "Department of Computing, The Hong Kong Polytechnic University, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2022-05-01 00:00:00",
"pubType": "trans",
"pages": "1798-1811",
"year": "2022",
"issn": "1536-1233",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/fg/2000/0580/0/05800422",
"title": "Exploiting Speech/Gesture Co-occurrence for Improving Continuous Gesture Recognition in Weather Narration",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2000/05800422/12OmNCwUmBP",
"parentPublication": {
"id": "proceedings/fg/2000/0580/0",
"title": "Proceedings Fourth IEEE International Conference on Automatic Face and Gesture Recognition (Cat. No. PR00580)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgames/2012/1120/0/S5001",
"title": "Multi-scenario gesture recognition using Kinect",
"doi": null,
"abstractUrl": "/proceedings-article/cgames/2012/S5001/12OmNwFzO24",
"parentPublication": {
"id": "proceedings/cgames/2012/1120/0",
"title": "2012 17th International Conference on Computer Games (CGAMES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acct/2012/4640/0/4640a314",
"title": "Image Localization in Gesture Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/acct/2012/4640a314/12OmNx1qUZv",
"parentPublication": {
"id": "proceedings/acct/2012/4640/0",
"title": "Advanced Computing & Communication Technologies, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2000/0580/0/05800416",
"title": "Towards Model-Based Gesture Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2000/05800416/12OmNyUFg1e",
"parentPublication": {
"id": "proceedings/fg/2000/0580/0",
"title": "Proceedings Fourth IEEE International Conference on Automatic Face and Gesture Recognition (Cat. No. PR00580)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse/2014/7981/0/7981b461",
"title": "Dolphin: Ultrasonic-Based Gesture Recognition on Smartphone Platform",
"doi": null,
"abstractUrl": "/proceedings-article/cse/2014/7981b461/12OmNyUWRbm",
"parentPublication": {
"id": "proceedings/cse/2014/7981/0",
"title": "2014 IEEE 17th International Conference on Computational Science and Engineering (CSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2009/3725/0/3725a872",
"title": "Pen Acoustic Emissions for Text and Gesture Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2009/3725a872/12OmNzZmZrl",
"parentPublication": {
"id": "proceedings/icdar/2009/3725/0",
"title": "2009 10th International Conference on Document Analysis and Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icfhr/2010/4221/0/4221a142",
"title": "Gesture Recognition Techniques in Handwriting Recognition Application",
"doi": null,
"abstractUrl": "/proceedings-article/icfhr/2010/4221a142/12OmNzb7Zl7",
"parentPublication": {
"id": "proceedings/icfhr/2010/4221/0",
"title": "Frontiers in Handwriting Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipccc/2018/6808/0/08710858",
"title": "iPand: Accurate Gesture Input with Ambient Acoustic Sensing on Hand",
"doi": null,
"abstractUrl": "/proceedings-article/ipccc/2018/08710858/1axfEr9uTyE",
"parentPublication": {
"id": "proceedings/ipccc/2018/6808/0",
"title": "2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2019/0089/0/08756548",
"title": "Database of Gesture Attributes: Zero Shot Learning for Gesture Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2019/08756548/1bzYubZfg9q",
"parentPublication": {
"id": "proceedings/fg/2019/0089/0",
"title": "2019 14th IEEE International Conference on Automatic Face & Gesture Recognition (FG 2019)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigcom/2021/4252/0/425200a098",
"title": "SignID: Acoustic-based Identification with Single Sign Gesture",
"doi": null,
"abstractUrl": "/proceedings-article/bigcom/2021/425200a098/1xlA0Ne4aGc",
"parentPublication": {
"id": "proceedings/bigcom/2021/4252/0",
"title": "2021 7th International Conference on Big Data Computing and Communications (BigCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09210581",
"articleId": "1nzv5c4N0kM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09219250",
"articleId": "1nMMk91bkl2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAgY7py",
"title": "Nov.-Dec.",
"year": "2015",
"issueNum": "06",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "35",
"label": "Nov.-Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuk3",
"doi": "10.1109/MCG.2015.5",
"abstract": "Vortex modeling can produce attractive visual effects of dynamic fluids, which are widely applicable for dynamic media, computer games, special effects, and virtual reality systems. However, it is challenging to effectively simulate intensive and fine detailed fluids such as smoke with fast increasing vortex filaments and smoke particles. The authors propose a novel vortex filaments in grids scheme in which the uniform grids dynamically bridge the vortex filaments and smoke particles for scalable, fine smoke simulation with macroscopic vortex structures. Using the vortex model, their approach supports the trade-off between simulation speed and scale of details. After computing the whole velocity, external control can be easily exerted on the embedded grid to guide the vortex-based smoke motion. The experimental results demonstrate the efficiency of using the proposed scheme for a visually plausible smoke simulation with macroscopic vortex structures.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Vortex modeling can produce attractive visual effects of dynamic fluids, which are widely applicable for dynamic media, computer games, special effects, and virtual reality systems. However, it is challenging to effectively simulate intensive and fine detailed fluids such as smoke with fast increasing vortex filaments and smoke particles. The authors propose a novel vortex filaments in grids scheme in which the uniform grids dynamically bridge the vortex filaments and smoke particles for scalable, fine smoke simulation with macroscopic vortex structures. Using the vortex model, their approach supports the trade-off between simulation speed and scale of details. After computing the whole velocity, external control can be easily exerted on the embedded grid to guide the vortex-based smoke motion. The experimental results demonstrate the efficiency of using the proposed scheme for a visually plausible smoke simulation with macroscopic vortex structures.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Vortex modeling can produce attractive visual effects of dynamic fluids, which are widely applicable for dynamic media, computer games, special effects, and virtual reality systems. However, it is challenging to effectively simulate intensive and fine detailed fluids such as smoke with fast increasing vortex filaments and smoke particles. The authors propose a novel vortex filaments in grids scheme in which the uniform grids dynamically bridge the vortex filaments and smoke particles for scalable, fine smoke simulation with macroscopic vortex structures. Using the vortex model, their approach supports the trade-off between simulation speed and scale of details. After computing the whole velocity, external control can be easily exerted on the embedded grid to guide the vortex-based smoke motion. The experimental results demonstrate the efficiency of using the proposed scheme for a visually plausible smoke simulation with macroscopic vortex structures.",
"title": "Vortex Filaments in Grids for Scalable, Fine Smoke Simulation",
"normalizedTitle": "Vortex Filaments in Grids for Scalable, Fine Smoke Simulation",
"fno": "mcg2015060060",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Computational Modeling",
"Electron Tubes",
"Mathematical Model",
"Graphics Processing Units",
"Solid Modeling",
"Adaptation Models",
"Complexity Theory",
"Motion Carrier",
"Computer Graphics",
"Smoke Simulation",
"Vortex Filaments",
"Uniform Grids"
],
"authors": [
{
"givenName": "Zhang",
"surname": "Meng",
"fullName": "Zhang Meng",
"affiliation": "The Chinese University of Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Si",
"surname": "Weixin",
"fullName": "Si Weixin",
"affiliation": "The Chinese University of Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qian",
"surname": "Yinling",
"fullName": "Qian Yinling",
"affiliation": "The Chinese University of Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sun",
"surname": "Hanqiu",
"fullName": "Sun Hanqiu",
"affiliation": "The Chinese University of Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qin",
"surname": "Jing",
"fullName": "Qin Jing",
"affiliation": "The Chinese University of Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pheng-Ann",
"surname": "Heng",
"fullName": "Pheng-Ann Heng",
"affiliation": "The Chinese University of Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2015-11-01 00:00:00",
"pubType": "mags",
"pages": "60-68",
"year": "2015",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isvri/2011/0054/0/05759668",
"title": "Real-time, directable smoke simulation",
"doi": null,
"abstractUrl": "/proceedings-article/isvri/2011/05759668/12OmNAY79cY",
"parentPublication": {
"id": "proceedings/isvri/2011/0054/0",
"title": "2011 IEEE International Symposium on VR Innovation (ISVRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2015/7644/0/7644a588",
"title": "Numerical Investigation on Supersonic Flow Separation Control Using Micro-ramp",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2015/7644a588/12OmNC4wtxW",
"parentPublication": {
"id": "proceedings/icicta/2015/7644/0",
"title": "2015 8th International Conference on Intelligent Computation Technology and Automation (ICICTA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a317",
"title": "An Efficient Adaptive Vortex Particle Method for Real-Time Smoke Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a317/12OmNCbU3cQ",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciicii/2015/8312/0/8312a285",
"title": "Simulation of the Explosion and the Interaction Effect between Smoke and Military Targets in the Battlefield",
"doi": null,
"abstractUrl": "/proceedings-article/iciicii/2015/8312a285/12OmNCcKQdZ",
"parentPublication": {
"id": "proceedings/iciicii/2015/8312/0",
"title": "2015 International Conference on Industrial Informatics - Computing Technology, Intelligent Technology, Industrial Information Integration (ICIICII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2015/7673/0/7673a197",
"title": "Fast, Realistic and Controllable Smoke Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2015/7673a197/12OmNwe2Io8",
"parentPublication": {
"id": "proceedings/icvrv/2015/7673/0",
"title": "2015 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/case/2012/0430/0/06386450",
"title": "A new swappable fluidic module for applications of capillary convective polymerase chain reaction",
"doi": null,
"abstractUrl": "/proceedings-article/case/2012/06386450/12OmNzcxZqU",
"parentPublication": {
"id": "proceedings/case/2012/0430/0",
"title": "2012 IEEE International Conference on Automation Science and Engineering (CASE 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/02/v0342",
"title": "Light Scattering from Filaments",
"doi": null,
"abstractUrl": "/journal/tg/2007/02/v0342/13rRUwI5TXt",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/02/ttg2014020303",
"title": "Vortical Inviscid Flows with Two-Way Solid-Fluid Coupling",
"doi": null,
"abstractUrl": "/journal/tg/2014/02/ttg2014020303/13rRUxAATgx",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/03/07845705",
"title": "Animating Wall-Bounded Turbulent Smoke via Filament-Mesh Particle-Particle Method",
"doi": null,
"abstractUrl": "/journal/tg/2018/03/07845705/13rRUxBJhvD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wcmeim/2019/5045/0/504500a027",
"title": "Numerical Analysis of Energy Separation in Vortex Tube with Various Nozzles",
"doi": null,
"abstractUrl": "/proceedings-article/wcmeim/2019/504500a027/1hHLoRNlHxe",
"parentPublication": {
"id": "proceedings/wcmeim/2019/5045/0",
"title": "2019 2nd World Conference on Mechanical Engineering and Intelligent Manufacturing (WCMEIM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2015060051",
"articleId": "13rRUxBa5pf",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2015060069",
"articleId": "13rRUwInvMP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvAiSlQ",
"title": "July-Aug.",
"year": "2019",
"issueNum": "04",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "39",
"label": "July-Aug.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1aXM8vCbh2o",
"doi": "10.1109/MCG.2019.2915717",
"abstract": "With the development of motion capture and graphics technology, visual feedback becomes increasingly important for tasks such as motion training. In order to engage users with immersive visual feedback, we introduce smoke simulation to enhance the motion display. Boundary conditions in the smoke simulation are designed to produce smoke which follows and implies the corresponding complex human motion. We also synthesize multilayer smoke, which is shown to be useful for emphasizing the motion of specified limbs. We implement our technique in an HMD-based virtual reality (VR) system for Tai-Chi training. User study results show that synthesized smoke is useful for enhancing the motion display, and that the training process is generally preferred in terms of engagement.",
"abstracts": [
{
"abstractType": "Regular",
"content": "With the development of motion capture and graphics technology, visual feedback becomes increasingly important for tasks such as motion training. In order to engage users with immersive visual feedback, we introduce smoke simulation to enhance the motion display. Boundary conditions in the smoke simulation are designed to produce smoke which follows and implies the corresponding complex human motion. We also synthesize multilayer smoke, which is shown to be useful for emphasizing the motion of specified limbs. We implement our technique in an HMD-based virtual reality (VR) system for Tai-Chi training. User study results show that synthesized smoke is useful for enhancing the motion display, and that the training process is generally preferred in terms of engagement.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "With the development of motion capture and graphics technology, visual feedback becomes increasingly important for tasks such as motion training. In order to engage users with immersive visual feedback, we introduce smoke simulation to enhance the motion display. Boundary conditions in the smoke simulation are designed to produce smoke which follows and implies the corresponding complex human motion. We also synthesize multilayer smoke, which is shown to be useful for emphasizing the motion of specified limbs. We implement our technique in an HMD-based virtual reality (VR) system for Tai-Chi training. User study results show that synthesized smoke is useful for enhancing the motion display, and that the training process is generally preferred in terms of engagement.",
"title": "Follow the Smoke: Immersive Display of Motion Data With Synthesized Smoke",
"normalizedTitle": "Follow the Smoke: Immersive Display of Motion Data With Synthesized Smoke",
"fno": "08739139",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Visualisation",
"Helmet Mounted Displays",
"Image Motion Analysis",
"Smoke",
"Virtual Reality",
"Synthesized Smoke",
"Motion Capture",
"Graphics Technology",
"Motion Training",
"Immersive Visual Feedback",
"Smoke Simulation",
"Motion Display",
"Boundary Conditions",
"Corresponding Complex Human Motion",
"Multilayer Smoke",
"HMD Based Virtual Reality System",
"Tai Chi Training",
"User Study Results",
"Immersive Display",
"Motion Data",
"Animation",
"Training Data",
"Mathematical Model",
"Computational Modeling",
"Boundary Conditions"
],
"authors": [
{
"givenName": "Lifeng",
"surname": "Zhu",
"fullName": "Lifeng Zhu",
"affiliation": "Southeast University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zian",
"surname": "Wang",
"fullName": "Zian Wang",
"affiliation": "Southeast University University of Alberta",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yunhai",
"surname": "Wang",
"fullName": "Yunhai Wang",
"affiliation": "Shandong University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Aiguo",
"surname": "Song",
"fullName": "Aiguo Song",
"affiliation": "Southeast University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2019-07-01 00:00:00",
"pubType": "mags",
"pages": "86-94",
"year": "2019",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isvri/2011/0054/0/05759668",
"title": "Real-time, directable smoke simulation",
"doi": null,
"abstractUrl": "/proceedings-article/isvri/2011/05759668/12OmNAY79cY",
"parentPublication": {
"id": "proceedings/isvri/2011/0054/0",
"title": "2011 IEEE International Symposium on VR Innovation (ISVRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmip/2017/5954/0/5954a325",
"title": "Dissipation Function and ViBe Based Smoke Detection in Video",
"doi": null,
"abstractUrl": "/proceedings-article/icmip/2017/5954a325/12OmNrJAdQY",
"parentPublication": {
"id": "proceedings/icmip/2017/5954/0",
"title": "2017 2nd International Conference on Multimedia and Image Processing (ICMIP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2015/7673/0/7673a205",
"title": "Chinese Character Deformation Based on Smoke Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2015/7673a205/12OmNwcl7A4",
"parentPublication": {
"id": "proceedings/icvrv/2015/7673/0",
"title": "2015 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2015/7673/0/7673a197",
"title": "Fast, Realistic and Controllable Smoke Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2015/7673a197/12OmNwe2Io8",
"parentPublication": {
"id": "proceedings/icvrv/2015/7673/0",
"title": "2015 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2014/6636/0/6636a705",
"title": "Study on Numerical Simulation of Smoke Control Mode in Smoke-Proof Staircase of High-Rise Buildings",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2014/6636a705/12OmNwoPtle",
"parentPublication": {
"id": "proceedings/icicta/2014/6636/0",
"title": "2014 7th International Conference on Intelligent Computation Technology and Automation (ICICTA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2014/6636/0/6636a674",
"title": "Study on an Intelligent Smoke Control System in a Modern Building",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2014/6636a674/12OmNx4gUyk",
"parentPublication": {
"id": "proceedings/icicta/2014/6636/0",
"title": "2014 7th International Conference on Intelligent Computation Technology and Automation (ICICTA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2011/4484/0/4484a141",
"title": "Forest Smoke Detection Using CCD Camera and Spatial-temporal Variation of Smoke Visual Patterns",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2011/4484a141/12OmNxuXcAJ",
"parentPublication": {
"id": "proceedings/cgiv/2011/4484/0",
"title": "2011 Eighth International Conference Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2014/6636/0/6636a522",
"title": "Research on Fire Luminaire's Smoke Penetrability Test Device and Method",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2014/6636a522/12OmNzZWbLd",
"parentPublication": {
"id": "proceedings/icicta/2014/6636/0",
"title": "2014 7th International Conference on Intelligent Computation Technology and Automation (ICICTA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2015/06/mcg2015060060",
"title": "Vortex Filaments in Grids for Scalable, Fine Smoke Simulation",
"doi": null,
"abstractUrl": "/magazine/cg/2015/06/mcg2015060060/13rRUxASuk3",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/03/07845705",
"title": "Animating Wall-Bounded Turbulent Smoke via Filament-Mesh Particle-Particle Method",
"doi": null,
"abstractUrl": "/journal/tg/2018/03/07845705/13rRUxBJhvD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08739142",
"articleId": "1aXM8SeYTRe",
"__typename": "AdjacentArticleType"
},
"next": null,
"__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": "1cHEgg8WeNW",
"doi": "10.1109/TVCG.2019.2934431",
"abstract": "We present a search engine for D3 visualizations that allows queries based on their visual style and underlying structure. To build the engine we crawl a collection of 7860 D3 visualizations from the Web and deconstruct each one to recover its data, its data-encoding marks and the encodings describing how the data is mapped to visual attributes of the marks. We also extract axes and other non-data-encoding attributes of marks (e.g., typeface, background color). Our search engine indexes this style and structure information as well as metadata about the webpage containing the chart. We show how visualization developers can search the collection to find visualizations that exhibit specific design characteristics and thereby explore the space of possible designs. We also demonstrate how researchers can use the search engine to identify commonly used visual design patterns and we perform such a demographic design analysis across our collection of D3 charts. A user study reveals that visualization developers found our style and structure based search engine to be significantly more useful and satisfying for finding different designs of D3 charts, than a baseline search engine that only allows keyword search over the webpage containing a chart.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a search engine for D3 visualizations that allows queries based on their visual style and underlying structure. To build the engine we crawl a collection of 7860 D3 visualizations from the Web and deconstruct each one to recover its data, its data-encoding marks and the encodings describing how the data is mapped to visual attributes of the marks. We also extract axes and other non-data-encoding attributes of marks (e.g., typeface, background color). Our search engine indexes this style and structure information as well as metadata about the webpage containing the chart. We show how visualization developers can search the collection to find visualizations that exhibit specific design characteristics and thereby explore the space of possible designs. We also demonstrate how researchers can use the search engine to identify commonly used visual design patterns and we perform such a demographic design analysis across our collection of D3 charts. A user study reveals that visualization developers found our style and structure based search engine to be significantly more useful and satisfying for finding different designs of D3 charts, than a baseline search engine that only allows keyword search over the webpage containing a chart.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a search engine for D3 visualizations that allows queries based on their visual style and underlying structure. To build the engine we crawl a collection of 7860 D3 visualizations from the Web and deconstruct each one to recover its data, its data-encoding marks and the encodings describing how the data is mapped to visual attributes of the marks. We also extract axes and other non-data-encoding attributes of marks (e.g., typeface, background color). Our search engine indexes this style and structure information as well as metadata about the webpage containing the chart. We show how visualization developers can search the collection to find visualizations that exhibit specific design characteristics and thereby explore the space of possible designs. We also demonstrate how researchers can use the search engine to identify commonly used visual design patterns and we perform such a demographic design analysis across our collection of D3 charts. A user study reveals that visualization developers found our style and structure based search engine to be significantly more useful and satisfying for finding different designs of D3 charts, than a baseline search engine that only allows keyword search over the webpage containing a chart.",
"title": "Searching the Visual Style and Structure of D3 Visualizations",
"normalizedTitle": "Searching the Visual Style and Structure of D3 Visualizations",
"fno": "08809832",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Charts",
"Data Visualisation",
"Internet",
"Meta Data",
"Query Processing",
"Search Engines",
"Visual Style",
"Data Encoding Marks",
"Visual Attributes",
"Search Engine",
"Visualization Developers",
"Design Characteristics",
"D 3 Visualizations",
"Visual Design Patterns",
"D 3 Charts",
"Metadata",
"Web Page",
"Data Visualization",
"Visualization",
"Encoding",
"Search Engines",
"Data Mining",
"Indexes",
"Image Color Analysis",
"Visualization Search Engine",
"Visualization Design",
"Search User Interfaces"
],
"authors": [
{
"givenName": "Enamul",
"surname": "Hoque",
"fullName": "Enamul Hoque",
"affiliation": "York University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Maneesh",
"surname": "Agrawala",
"fullName": "Maneesh Agrawala",
"affiliation": "Stanford University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "1236-1245",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icmtma/2015/7143/0/7143b168",
"title": "The Design and Implementation of Computer Vertical Search Engine",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2015/7143b168/12OmNqC2uXb",
"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/iv/2016/8942/0/8942a324",
"title": "Visual Corpus Interface -- Putting Text Visualizations at Use",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2016/8942a324/12OmNwkzuvE",
"parentPublication": {
"id": "proceedings/iv/2016/8942/0",
"title": "2016 20th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsgea/2016/3578/0/07733815",
"title": "Network Information Searching Technology Research Based on Cloud Computing",
"doi": null,
"abstractUrl": "/proceedings-article/icsgea/2016/07733815/12OmNzX6cus",
"parentPublication": {
"id": "proceedings/icsgea/2016/3578/0",
"title": "2016 International Conference on Smart Grid and Electrical Automation (ICSGEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07536142",
"title": "Exploring the Possibilities of Embedding Heterogeneous Data Attributes in Familiar Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07536142/13rRUEgarjx",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/03/07845717",
"title": "Converting Basic D3 Charts into Reusable Style Templates",
"doi": null,
"abstractUrl": "/journal/tg/2018/03/07845717/13rRUxYINfm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017606",
"title": "Active Reading of Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017606/13rRUyYSWl5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539580",
"title": "Iterating between Tools to Create and Edit Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539580/13rRUyft7D6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2018/7202/0/720200a078",
"title": "QueryCrumbs for Experts: A Compact Visual Query Support System to Facilitate Insights into Search Engine Internals",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a078/17D45Vw15wB",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a001",
"title": "Exploring D3 Implementation Challenges on Stack Overflow",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a001/1J6h6awUbbG",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a016",
"title": "Streamlining Visualization Authoring in D3 Through User-Driven Templates",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a016/1J6heEO48bS",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08809846",
"articleId": "1cHEoEeTId2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08809742",
"articleId": "1cHE6tCGR0Y",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1D34Iu3iR1e",
"title": "June",
"year": "2022",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1sA4WPUOESY",
"doi": "10.1109/TVCG.2021.3071387",
"abstract": "Many spatiotemporal events can be viewed as contagions. These events implicitly propagate across space and time by following cascading patterns, expanding their influence, and generating event cascades that involve multiple locations. Analyzing such cascading processes presents valuable implications in various urban applications, such as traffic planning and pollution diagnostics. Motivated by the limited capability of the existing approaches in mining and interpreting cascading patterns, we propose a visual analytics system called VisCas. VisCas combines an inference model with interactive visualizations and empowers analysts to infer and interpret the latent cascading patterns in the spatiotemporal context. To develop VisCas, we address three major challenges 1) generalized pattern inference; 2) implicit influence visualization; and 3) multifaceted cascade analysis. For the first challenge, we adapt the state-of-the-art cascading network inference technique to general urban scenarios, where cascading patterns can be reliably inferred from large-scale spatiotemporal data. For the second and third challenges, we assemble a set of effective visualizations to support location navigation, influence inspection, and cascading exploration, and facilitate the in-depth cascade analysis. We design a novel influence view based on a three-fold optimization strategy for analyzing the implicit influences of the inferred patterns. We demonstrate the capability and effectiveness of VisCas with two case studies conducted on real-world traffic congestion and air pollution datasets with domain experts.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Many spatiotemporal events can be viewed as contagions. These events implicitly propagate across space and time by following cascading patterns, expanding their influence, and generating event cascades that involve multiple locations. Analyzing such cascading processes presents valuable implications in various urban applications, such as traffic planning and pollution diagnostics. Motivated by the limited capability of the existing approaches in mining and interpreting cascading patterns, we propose a visual analytics system called VisCas. VisCas combines an inference model with interactive visualizations and empowers analysts to infer and interpret the latent cascading patterns in the spatiotemporal context. To develop VisCas, we address three major challenges 1) generalized pattern inference; 2) implicit influence visualization; and 3) multifaceted cascade analysis. For the first challenge, we adapt the state-of-the-art cascading network inference technique to general urban scenarios, where cascading patterns can be reliably inferred from large-scale spatiotemporal data. For the second and third challenges, we assemble a set of effective visualizations to support location navigation, influence inspection, and cascading exploration, and facilitate the in-depth cascade analysis. We design a novel influence view based on a three-fold optimization strategy for analyzing the implicit influences of the inferred patterns. We demonstrate the capability and effectiveness of VisCas with two case studies conducted on real-world traffic congestion and air pollution datasets with domain experts.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Many spatiotemporal events can be viewed as contagions. These events implicitly propagate across space and time by following cascading patterns, expanding their influence, and generating event cascades that involve multiple locations. Analyzing such cascading processes presents valuable implications in various urban applications, such as traffic planning and pollution diagnostics. Motivated by the limited capability of the existing approaches in mining and interpreting cascading patterns, we propose a visual analytics system called VisCas. VisCas combines an inference model with interactive visualizations and empowers analysts to infer and interpret the latent cascading patterns in the spatiotemporal context. To develop VisCas, we address three major challenges 1) generalized pattern inference; 2) implicit influence visualization; and 3) multifaceted cascade analysis. For the first challenge, we adapt the state-of-the-art cascading network inference technique to general urban scenarios, where cascading patterns can be reliably inferred from large-scale spatiotemporal data. For the second and third challenges, we assemble a set of effective visualizations to support location navigation, influence inspection, and cascading exploration, and facilitate the in-depth cascade analysis. We design a novel influence view based on a three-fold optimization strategy for analyzing the implicit influences of the inferred patterns. We demonstrate the capability and effectiveness of VisCas with two case studies conducted on real-world traffic congestion and air pollution datasets with domain experts.",
"title": "Visual Cascade Analytics of Large-Scale Spatiotemporal Data",
"normalizedTitle": "Visual Cascade Analytics of Large-Scale Spatiotemporal Data",
"fno": "09397369",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Air Pollution",
"Data Analysis",
"Data Mining",
"Data Visualisation",
"Inference Mechanisms",
"Optimisation",
"Road Traffic",
"Traffic Engineering Computing",
"Pattern Mining",
"Traffic Congestion",
"Air Pollution",
"Optimization Strategy",
"Influence View",
"Vis Cas",
"Cascading Network Inference Technique",
"Urban Applications",
"Spatiotemporal Events",
"Visual Cascade Analytics",
"Inferred Patterns",
"Cascade Analysis",
"Large Scale Spatiotemporal Data",
"Urban Scenarios",
"Latent Cascading Patterns",
"Interactive Visualizations",
"Inference Model",
"Pollution Diagnostics",
"Traffic Planning",
"Spatiotemporal Phenomena",
"Air Pollution",
"Probabilistic Logic",
"Adaptation Models",
"Visual Analytics",
"Time Series Analysis",
"Sensors",
"Spatial Cascade",
"Pattern Mining",
"Spatiotemporal Data"
],
"authors": [
{
"givenName": "Zikun",
"surname": "Deng",
"fullName": "Zikun Deng",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Di",
"surname": "Weng",
"fullName": "Di Weng",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuxuan",
"surname": "Liang",
"fullName": "Yuxuan Liang",
"affiliation": "School of Computing, National University of Singapore, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jie",
"surname": "Bao",
"fullName": "Jie Bao",
"affiliation": "JD Intelligent Cities Research, JD Technology, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yu",
"surname": "Zheng",
"fullName": "Yu Zheng",
"affiliation": "JD Intelligent Cities Research, JD Technology, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tobias",
"surname": "Schreck",
"fullName": "Tobias Schreck",
"affiliation": "Graz University of Technology, Graz, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mingliang",
"surname": "Xu",
"fullName": "Mingliang Xu",
"affiliation": "School of Information Engineering and Henan Institute of Advanced Technology, Zhengzhou University, Zhengzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yingcai",
"surname": "Wu",
"fullName": "Yingcai Wu",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": {
"isEnabled": true,
"codeDownloadUrl": "https://github.com/zkrain/viscas-tvcg-release.git",
"codeRepositoryUrl": "https://github.com/zkrain/viscas-tvcg-release",
"__typename": "ArticleReplicabilityType"
},
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2022-06-01 00:00:00",
"pubType": "trans",
"pages": "2486-2499",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vast/2012/4752/0/06400491",
"title": "A correlative analysis process in a visual analytics environment",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2012/06400491/12OmNAkEU1K",
"parentPublication": {
"id": "proceedings/vast/2012/4752/0",
"title": "2012 IEEE Conference on Visual Analytics Science and Technology (VAST 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsia/2017/2198/0/08339088",
"title": "A client-based visual analytics framework for large spatiotemporal data under architectural constraints",
"doi": null,
"abstractUrl": "/proceedings-article/dsia/2017/08339088/12OmNrJAdU1",
"parentPublication": {
"id": "proceedings/dsia/2017/2198/0",
"title": "2017 IEEE Workshop on Data Systems for Interactive Analysis (DSIA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2014/6227/0/07042482",
"title": "An insight- and task-based methodology for evaluating spatiotemporal visual analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042482/12OmNwp74wP",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2013/3142/0/3143b061",
"title": "New Spatiotemporal Clustering Algorithms and their Applications to Ozone Pollution",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2013/3143b061/12OmNx9FhPI",
"parentPublication": {
"id": "proceedings/icdmw/2013/3142/0",
"title": "2013 IEEE 13th International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2017/3163/0/08585564",
"title": "Interactive Visual Analytics Application for Spatiotemporal Movement Data VAST Challenge 2017 Mini-Challenge 1: Award for Actionable and Detailed Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2017/08585564/17D45VsBU7R",
"parentPublication": {
"id": "proceedings/vast/2017/3163/0",
"title": "2017 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440040",
"title": "A Visual Analytics Framework for Spatiotemporal Trade Network Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440040/17D45WHONjL",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807233",
"title": "AirVis: Visual Analytics of Air Pollution Propagation",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807233/1cG6vBDoxji",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2019/4896/0/489600a987",
"title": "Discovering Spatial Weighted Frequent Itemsets in Spatiotemporal Databases",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2019/489600a987/1gAwXHWaoAU",
"parentPublication": {
"id": "proceedings/icdmw/2019/4896/0",
"title": "2019 International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09005693",
"title": "Discovering Partial Periodic Spatial Patterns in Spatiotemporal Databases",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09005693/1hJs20pHQyY",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2020/8316/0/831600a352",
"title": "Building Autocorrelation-Aware Representations for Fine-Scale Spatiotemporal Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2020/831600a352/1r54HNujhQY",
"parentPublication": {
"id": "proceedings/icdm/2020/8316/0",
"title": "2020 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09716867",
"articleId": "1B5WC9AuX1C",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09705082",
"articleId": "1AIIcR14E4o",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1D34VrGy4XS",
"name": "ttg202206-09397369s1-tvcg-3071387-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202206-09397369s1-tvcg-3071387-mm.zip",
"extension": "zip",
"size": "36.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrMZpr3",
"title": "Sept.",
"year": "2013",
"issueNum": "09",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxC0SEh",
"doi": "10.1109/TVCG.2013.65",
"abstract": "We introduce Splatterplots, a novel presentation of scattered data that enables visualizations that scale beyond standard scatter plots. Traditional scatter plots suffer from overdraw (overlapping glyphs) as the number of points per unit area increases. Overdraw obscures outliers, hides data distributions, and makes the relationship among subgroups of the data difficult to discern. To address these issues, Splatterplots abstract away information such that the density of data shown in any unit of screen space is bounded, while allowing continuous zoom to reveal abstracted details. Abstraction automatically groups dense data points into contours and samples remaining points. We combine techniques for abstraction with perceptually based color blending to reveal the relationship between data subgroups. The resulting visualizations represent the dense regions of each subgroup of the data set as smooth closed shapes and show representative outliers explicitly. We present techniques that leverage the GPU for Splatterplot computation and rendering, enabling interaction with massive data sets. We show how Splatterplots can be an effective alternative to traditional methods of displaying scatter data communicating data trends, outliers, and data set relationships much like traditional scatter plots, but scaling to data sets of higher density and up to millions of points on the screen.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We introduce Splatterplots, a novel presentation of scattered data that enables visualizations that scale beyond standard scatter plots. Traditional scatter plots suffer from overdraw (overlapping glyphs) as the number of points per unit area increases. Overdraw obscures outliers, hides data distributions, and makes the relationship among subgroups of the data difficult to discern. To address these issues, Splatterplots abstract away information such that the density of data shown in any unit of screen space is bounded, while allowing continuous zoom to reveal abstracted details. Abstraction automatically groups dense data points into contours and samples remaining points. We combine techniques for abstraction with perceptually based color blending to reveal the relationship between data subgroups. The resulting visualizations represent the dense regions of each subgroup of the data set as smooth closed shapes and show representative outliers explicitly. We present techniques that leverage the GPU for Splatterplot computation and rendering, enabling interaction with massive data sets. We show how Splatterplots can be an effective alternative to traditional methods of displaying scatter data communicating data trends, outliers, and data set relationships much like traditional scatter plots, but scaling to data sets of higher density and up to millions of points on the screen.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We introduce Splatterplots, a novel presentation of scattered data that enables visualizations that scale beyond standard scatter plots. Traditional scatter plots suffer from overdraw (overlapping glyphs) as the number of points per unit area increases. Overdraw obscures outliers, hides data distributions, and makes the relationship among subgroups of the data difficult to discern. To address these issues, Splatterplots abstract away information such that the density of data shown in any unit of screen space is bounded, while allowing continuous zoom to reveal abstracted details. Abstraction automatically groups dense data points into contours and samples remaining points. We combine techniques for abstraction with perceptually based color blending to reveal the relationship between data subgroups. The resulting visualizations represent the dense regions of each subgroup of the data set as smooth closed shapes and show representative outliers explicitly. We present techniques that leverage the GPU for Splatterplot computation and rendering, enabling interaction with massive data sets. We show how Splatterplots can be an effective alternative to traditional methods of displaying scatter data communicating data trends, outliers, and data set relationships much like traditional scatter plots, but scaling to data sets of higher density and up to millions of points on the screen.",
"title": "Splatterplots: Overcoming Overdraw in Scatter Plots",
"normalizedTitle": "Splatterplots: Overcoming Overdraw in Scatter Plots",
"fno": "ttg2013091526",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Image Color Analysis",
"Data Visualization",
"Encoding",
"Shape",
"Clutter",
"Statistical Graphics",
"Scalability Issues",
"Visual Design",
"Perception Theory"
],
"authors": [
{
"givenName": "A.",
"surname": "Mayorga",
"fullName": "A. Mayorga",
"affiliation": "Dept. of Comput. Sci., Univ. of Wisconsin, Madison, WI, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "M.",
"surname": "Gleicher",
"fullName": "M. Gleicher",
"affiliation": "Dept. of Comput. Sci., Univ. of Wisconsin, Madison, WI, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2013-09-01 00:00:00",
"pubType": "trans",
"pages": "1526-1538",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bdva/2015/7343/0/07314294",
"title": "Guiding the Exploration of Scatter Plot Data Using Motif-Based Interest Measures",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2015/07314294/12OmNwHz03z",
"parentPublication": {
"id": "proceedings/bdva/2015/7343/0",
"title": "2015 Big Data Visual Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2013/4892/0/4892b522",
"title": "Enhancing Scatter Plots Using Ellipsoid Pixel Placement and Shading",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2013/4892b522/12OmNzwpUnq",
"parentPublication": {
"id": "proceedings/hicss/2013/4892/0",
"title": "2013 46th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192696",
"title": "Orientation-Enhanced Parallel Coordinate Plots",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192696/13rRUwkxc5q",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010060980",
"title": "Matching Visual Saliency to Confidence in Plots of Uncertain Data",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010060980/13rRUxZRbnY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/03/07836349",
"title": "DSPCP: A Data Scalable Approach for Identifying Relationships in Parallel Coordinates",
"doi": null,
"abstractUrl": "/journal/tg/2018/03/07836349/13rRUxZzAhK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875982",
"title": "Visual Abstraction and Exploration of Multi-class Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875982/13rRUygT7ye",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/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": "trans/tg/2020/01/08809844",
"title": "A Recursive Subdivision Technique for Sampling Multi-class Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08809844/1cHEfHRrSOQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2020/8316/0/831600a372",
"title": "LP-Explain: Local Pictorial Explanation for Outliers",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2020/831600a372/1r54AqoaifC",
"parentPublication": {
"id": "proceedings/icdm/2020/8316/0",
"title": "2020 IEEE International Conference on Data Mining (ICDM)",
"__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": "ttg2013091513",
"articleId": "13rRUxD9gXH",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013091539",
"articleId": "13rRUEgarsH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesQU",
"name": "ttg2013091526s.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013091526s.mp4",
"extension": "mp4",
"size": "14.9 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xjQVmm2wE0",
"doi": "10.1109/TVCG.2021.3114801",
"abstract": "Multiple-view visualization (MV) has been heavily used in visual analysis tools for sensemaking of data in various domains (e.g., bioinformatics, cybersecurity and text analytics). One common task of visual analysis with multiple views is to relate data across different views. For example, to identify threats, an intelligence analyst needs to link people from a social network graph with locations on a crime-map, and then search for and read relevant documents. Currently, exploring cross-view data relationships heavily relies on view-coordination techniques (e.g., brushing and linking), which may require significant user effort on many trial-and-error attempts, such as repetitiously selecting elements in one view, and then observing and following elements highlighted in other views. To address this, we present SightBi, a visual analytics approach for supporting cross-view data relationship explorations. We discuss the design rationale of SightBi in detail, with identified user tasks regarding the use of cross-view data relationships. SightBi formalizes cross-view data relationships as biclusters, computes them from a dataset, and uses a bi-context design that highlights creating stand-alone relationship-views. This helps preserve existing views and offers an overview of cross-view data relationships to guide user exploration. Moreover, SightBi allows users to interactively manage the layout of multiple views by using newly created relationship-views. With a usage scenario, we demonstrate the usefulness of SightBi for sensemaking of cross-view data relationships.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Multiple-view visualization (MV) has been heavily used in visual analysis tools for sensemaking of data in various domains (e.g., bioinformatics, cybersecurity and text analytics). One common task of visual analysis with multiple views is to relate data across different views. For example, to identify threats, an intelligence analyst needs to link people from a social network graph with locations on a crime-map, and then search for and read relevant documents. Currently, exploring cross-view data relationships heavily relies on view-coordination techniques (e.g., brushing and linking), which may require significant user effort on many trial-and-error attempts, such as repetitiously selecting elements in one view, and then observing and following elements highlighted in other views. To address this, we present SightBi, a visual analytics approach for supporting cross-view data relationship explorations. We discuss the design rationale of SightBi in detail, with identified user tasks regarding the use of cross-view data relationships. SightBi formalizes cross-view data relationships as biclusters, computes them from a dataset, and uses a bi-context design that highlights creating stand-alone relationship-views. This helps preserve existing views and offers an overview of cross-view data relationships to guide user exploration. Moreover, SightBi allows users to interactively manage the layout of multiple views by using newly created relationship-views. With a usage scenario, we demonstrate the usefulness of SightBi for sensemaking of cross-view data relationships.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Multiple-view visualization (MV) has been heavily used in visual analysis tools for sensemaking of data in various domains (e.g., bioinformatics, cybersecurity and text analytics). One common task of visual analysis with multiple views is to relate data across different views. For example, to identify threats, an intelligence analyst needs to link people from a social network graph with locations on a crime-map, and then search for and read relevant documents. Currently, exploring cross-view data relationships heavily relies on view-coordination techniques (e.g., brushing and linking), which may require significant user effort on many trial-and-error attempts, such as repetitiously selecting elements in one view, and then observing and following elements highlighted in other views. To address this, we present SightBi, a visual analytics approach for supporting cross-view data relationship explorations. We discuss the design rationale of SightBi in detail, with identified user tasks regarding the use of cross-view data relationships. SightBi formalizes cross-view data relationships as biclusters, computes them from a dataset, and uses a bi-context design that highlights creating stand-alone relationship-views. This helps preserve existing views and offers an overview of cross-view data relationships to guide user exploration. Moreover, SightBi allows users to interactively manage the layout of multiple views by using newly created relationship-views. With a usage scenario, we demonstrate the usefulness of SightBi for sensemaking of cross-view data relationships.",
"title": "SightBi: Exploring Cross-View Data Relationships with Biclusters",
"normalizedTitle": "SightBi: Exploring Cross-View Data Relationships with Biclusters",
"fno": "09555226",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Data Visualization",
"Tools",
"Task Analysis",
"Layout",
"Sun",
"Bioinformatics",
"Cross View Data Relationship",
"Multi View Visualization",
"Bicluster",
"Visual Analytics"
],
"authors": [
{
"givenName": "Maoyuan",
"surname": "Sun",
"fullName": "Maoyuan Sun",
"affiliation": "Northern Illinois University, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Abdul Rahman",
"surname": "Shaikh",
"fullName": "Abdul Rahman Shaikh",
"affiliation": "Northern Illinois University, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hamed",
"surname": "Alhoori",
"fullName": "Hamed Alhoori",
"affiliation": "Northern Illinois University, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jian",
"surname": "Zhao",
"fullName": "Jian Zhao",
"affiliation": "University of Waterloo, Canada",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "54-64",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2016/8851/0/8851e847",
"title": "Multi-view Deep Network for Cross-View Classification",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851e847/12OmNBpmDC1",
"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/2016/01/07192715",
"title": "BiSet: Semantic Edge Bundling with Biclusters for Sensemaking",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192715/13rRUNvgz9T",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2022/8563/0/09859981",
"title": "Decomposing Identity and View for Cross-View Gait Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2022/09859981/1G9EzfoOOe4",
"parentPublication": {
"id": "proceedings/icme/2022/8563/0",
"title": "2022 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a105",
"title": "Toward Systematic Design Considerations of Organizing Multiple Views",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a105/1J6hb8c5Zde",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933655",
"title": "Towards Quantifying Multiple View Layouts in Visualisation as Seen from Research Publications",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933655/1fTgHP2omAM",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300h504",
"title": "Learning Relationships for Multi-View 3D Object Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300h504/1hVldkkuBAA",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300i099",
"title": "Cross-View Policy Learning for Street Navigation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300i099/1hVlzyJbr8I",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2021/3864/0/09428184",
"title": "Cross-View Equivariant Auto-Encoder",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2021/09428184/1uilQ2tED6w",
"parentPublication": {
"id": "proceedings/icme/2021/3864/0",
"title": "2021 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09508898",
"title": "Towards Systematic Design Considerations for Visualizing Cross-View Data Relationships",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09508898/1vQzkzRdSWk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900a557",
"title": "Cross-View Cross-Scene Multi-View Crowd Counting",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900a557/1yeKfeZSsXC",
"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": "09555491",
"articleId": "1xjQX1LHQJi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09552892",
"articleId": "1xibYYzLaWk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zBazFNIbv2",
"name": "ttg202201-09555226s1-supp1-3114801.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09555226s1-supp1-3114801.mp4",
"extension": "mp4",
"size": "8.17 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45VtKix5",
"doi": "10.1109/TVCG.2018.2865240",
"abstract": "There exists a gap between visualization design guidelines and their application in visualization tools. While empirical studies can provide design guidance, we lack a formal framework for representing design knowledge, integrating results across studies, and applying this knowledge in automated design tools that promote effective encodings and facilitate visual exploration. We propose modeling visualization design knowledge as a collection of constraints, in conjunction with a method to learn weights for soft constraints from experimental data. Using constraints, we can take theoretical design knowledge and express it in a concrete, extensible, and testable form: the resulting models can recommend visualization designs and can easily be augmented with additional constraints or updated weights. We implement our approach in Draco, a constraint-based system based on Answer Set Programming (ASP). We demonstrate how to construct increasingly sophisticated automated visualization design systems, including systems based on weights learned directly from the results of graphical perception experiments.",
"abstracts": [
{
"abstractType": "Regular",
"content": "There exists a gap between visualization design guidelines and their application in visualization tools. While empirical studies can provide design guidance, we lack a formal framework for representing design knowledge, integrating results across studies, and applying this knowledge in automated design tools that promote effective encodings and facilitate visual exploration. We propose modeling visualization design knowledge as a collection of constraints, in conjunction with a method to learn weights for soft constraints from experimental data. Using constraints, we can take theoretical design knowledge and express it in a concrete, extensible, and testable form: the resulting models can recommend visualization designs and can easily be augmented with additional constraints or updated weights. We implement our approach in Draco, a constraint-based system based on Answer Set Programming (ASP). We demonstrate how to construct increasingly sophisticated automated visualization design systems, including systems based on weights learned directly from the results of graphical perception experiments.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "There exists a gap between visualization design guidelines and their application in visualization tools. While empirical studies can provide design guidance, we lack a formal framework for representing design knowledge, integrating results across studies, and applying this knowledge in automated design tools that promote effective encodings and facilitate visual exploration. We propose modeling visualization design knowledge as a collection of constraints, in conjunction with a method to learn weights for soft constraints from experimental data. Using constraints, we can take theoretical design knowledge and express it in a concrete, extensible, and testable form: the resulting models can recommend visualization designs and can easily be augmented with additional constraints or updated weights. We implement our approach in Draco, a constraint-based system based on Answer Set Programming (ASP). We demonstrate how to construct increasingly sophisticated automated visualization design systems, including systems based on weights learned directly from the results of graphical perception experiments.",
"title": "Formalizing Visualization Design Knowledge as Constraints: Actionable and Extensible Models in Draco",
"normalizedTitle": "Formalizing Visualization Design Knowledge as Constraints: Actionable and Extensible Models in Draco",
"fno": "08440847",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Constraint Handling",
"Data Visualisation",
"Logic Programming",
"Visualization Design Knowledge",
"Visualization Design Guidelines",
"Automated Design Tools",
"Visual Exploration",
"Soft Constraints",
"Constraint Based System",
"Automated Visualization Design Systems",
"Draco",
"Answer Set Programming",
"ASP",
"Data Visualization",
"Encoding",
"Task Analysis",
"Tools",
"Visualization",
"Programming",
"Computational Modeling",
"Automated Visualization Design",
"Perceptual Effectiveness",
"Constraints",
"Knowledge Bases",
"Answer Set Programming"
],
"authors": [
{
"givenName": "Dominik",
"surname": "Moritz",
"fullName": "Dominik Moritz",
"affiliation": "University of Washington",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chenglong",
"surname": "Wang",
"fullName": "Chenglong Wang",
"affiliation": "University of Washington",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Greg L.",
"surname": "Nelson",
"fullName": "Greg L. Nelson",
"affiliation": "University of Washington",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Halden",
"surname": "Lin",
"fullName": "Halden Lin",
"affiliation": "University of Washington",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Adam M.",
"surname": "Smith",
"fullName": "Adam M. Smith",
"affiliation": "University of California Santa Cruz",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bill",
"surname": "Howe",
"fullName": "Bill Howe",
"affiliation": "University of Washington",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeffrey",
"surname": "Heer",
"fullName": "Jeffrey Heer",
"affiliation": "University of Washington",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "438-448",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vissoft/2016/3850/0/3850a151",
"title": "MetaVis: Exploring Actionable Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vissoft/2016/3850a151/12OmNAYXWLn",
"parentPublication": {
"id": "proceedings/vissoft/2016/3850/0",
"title": "2016 IEEE Working Conference on Software Visualization (VISSOFT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2015/9926/0/07364039",
"title": "Shaping data: Visualization under construction",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2015/07364039/12OmNqJZgym",
"parentPublication": {
"id": "proceedings/big-data/2015/9926/0",
"title": "2015 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122406",
"title": "A Deeper Understanding of Sequence in Narrative Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122406/13rRUwIF6l7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440080",
"title": "Design Exposition with Literate Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440080/17D45XoXP4o",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ai/2022/06/09878189",
"title": "Integrating Constraints Into Dimensionality Reduction for Visualization: A Survey",
"doi": null,
"abstractUrl": "/journal/ai/2022/06/09878189/1GrP8bfHhFm",
"parentPublication": {
"id": "trans/ai",
"title": "IEEE Transactions on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09905748",
"title": "Roboviz: A Game-Centered Project for Information Visualization Education",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09905748/1H3ZTYuap1e",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09969167",
"title": "Image-Driven Harmonious Color Palette Generation for Diverse Information Visualization",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09969167/1IMicNIXex2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933751",
"title": "Learning Vis Tools: Teaching Data Visualization Tutorials",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933751/1fTgJc2YdMI",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222091",
"title": "StructGraphics: Flexible Visualization Design through Data-Agnostic and Reusable Graphical Structures",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222091/1nTroDgoFeo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552878",
"title": "VizLinter: A Linter and Fixer Framework for Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552878/1xic0oVyd5m",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440115",
"articleId": "17D45VTRozK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440845",
"articleId": "17D45WYQJ9Z",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFtJ",
"name": "ttg201901-08440847s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08440847s1.zip",
"extension": "zip",
"size": "408 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45We0UEy",
"doi": "10.1109/TVCG.2018.2865138",
"abstract": "Convolutional neural networks can successfully perform many computer vision tasks on images. For visualization, how do CNNs perform when applied to graphical perception tasks? We investigate this question by reproducing Cleveland and McGill's seminal 1984 experiments, which measured human perception efficiency of different visual encodings and defined elementary perceptual tasks for visualization. We measure the graphical perceptual capabilities of four network architectures on five different visualization tasks and compare to existing and new human performance baselines. While under limited circumstances CNNs are able to meet or outperform human task performance, we find that CNNs are not currently a good model for human graphical perception. We present the results of these experiments to foster the understanding of how CNNs succeed and fail when applied to data visualizations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Convolutional neural networks can successfully perform many computer vision tasks on images. For visualization, how do CNNs perform when applied to graphical perception tasks? We investigate this question by reproducing Cleveland and McGill's seminal 1984 experiments, which measured human perception efficiency of different visual encodings and defined elementary perceptual tasks for visualization. We measure the graphical perceptual capabilities of four network architectures on five different visualization tasks and compare to existing and new human performance baselines. While under limited circumstances CNNs are able to meet or outperform human task performance, we find that CNNs are not currently a good model for human graphical perception. We present the results of these experiments to foster the understanding of how CNNs succeed and fail when applied to data visualizations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Convolutional neural networks can successfully perform many computer vision tasks on images. For visualization, how do CNNs perform when applied to graphical perception tasks? We investigate this question by reproducing Cleveland and McGill's seminal 1984 experiments, which measured human perception efficiency of different visual encodings and defined elementary perceptual tasks for visualization. We measure the graphical perceptual capabilities of four network architectures on five different visualization tasks and compare to existing and new human performance baselines. While under limited circumstances CNNs are able to meet or outperform human task performance, we find that CNNs are not currently a good model for human graphical perception. We present the results of these experiments to foster the understanding of how CNNs succeed and fail when applied to data visualizations.",
"title": "Evaluating ‘Graphical Perception’ with CNNs",
"normalizedTitle": "Evaluating ‘Graphical Perception’ with CNNs",
"fno": "08440806",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Vision",
"Convolution",
"Data Visualisation",
"Feedforward Neural Nets",
"Human Factors",
"Visual Perception",
"Human Graphical Perception",
"Data Visualizations",
"Convolutional Neural Networks",
"Computer Vision Tasks",
"Elementary Perceptual Tasks",
"Network Architectures",
"Human Task Performance",
"CN Ns",
"Visual Encodings",
"Visualization",
"Task Analysis",
"Bars",
"Data Visualization",
"Convolutional Neural Networks",
"Multilayer Perceptrons",
"Computational Modeling",
"Machine Perception",
"Graphical Perception",
"Deep Learning",
"Convolutional Neural Networks"
],
"authors": [
{
"givenName": "Daniel",
"surname": "Haehn",
"fullName": "Daniel Haehn",
"affiliation": "Harvard University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "James",
"surname": "Tompkin",
"fullName": "James Tompkin",
"affiliation": "Brown University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanspeter",
"surname": "Pfister",
"fullName": "Hanspeter Pfister",
"affiliation": "Harvard University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "641-650",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2017/0457/0/0457a732",
"title": "Teaching Compositionality to CNNs",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457a732/12OmNBZYTpD",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2009/4800/0/05349497",
"title": "A multiple perception model on emotional speech",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2009/05349497/12OmNC3FGjO",
"parentPublication": {
"id": "proceedings/acii/2009/4800/0",
"title": "2009 3rd International Conference on Affective Computing and Intelligent Interaction and Workshops (ACII 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/03/07875127",
"title": "Evaluating Interactive Graphical Encodings for Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2018/03/07875127/13rRUxly9e0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122631",
"title": "Graphical Overlays: Using Layered Elements to Aid Chart Reading",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122631/13rRUyfKIHJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09839572",
"title": "Evaluating Graphical Perception of Visual Motion for Quantitative Data Encoding",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09839572/1FisKWeqz8Q",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cost/2022/6248/0/624800a292",
"title": "Transformer-based Multimodal Contextual Co-encoding for Humour Detection",
"doi": null,
"abstractUrl": "/proceedings-article/cost/2022/624800a292/1H2pnWQtNRe",
"parentPublication": {
"id": "proceedings/cost/2022/6248/0",
"title": "2022 International Conference on Culture-Oriented Science and Technology (CoST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09978718",
"title": "The Risks of Ranking: Revisiting Graphical Perception to Model Individual Differences in Visualization Performance",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09978718/1IXUnbRdUEE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a095",
"title": "VisQuiz: Exploring Feedback Mechanisms to Improve Graphical Perception",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a095/1J6hc7TzZcI",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aipr/2020/8243/0/09425299",
"title": "An Interactive Graphical Visualization Approach to CNNs and RNNs",
"doi": null,
"abstractUrl": "/proceedings-article/aipr/2020/09425299/1tuA18nCi9a",
"parentPublication": {
"id": "proceedings/aipr/2020/8243/0",
"title": "2020 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2021/0019/0/09597423",
"title": "Dimensional perception of a ‘smiling McGurk effect’",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2021/09597423/1yyldMmsUVi",
"parentPublication": {
"id": "proceedings/acii/2021/0019/0",
"title": "2021 9th International Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08443125",
"articleId": "17D45XDIXRv",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08454904",
"articleId": "17D45Xh13vE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgJd",
"name": "ttg201901-08440806s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08440806s1.zip",
"extension": "zip",
"size": "12 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1CxvgvLBWI8",
"title": "March-April",
"year": "2022",
"issueNum": "02",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "42",
"label": "March-April",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1CxvjdlL3TG",
"doi": "10.1109/MCG.2021.3138608",
"abstract": "Encoding data visually is at the heart of visualization. We usually assume that encodings are read as specified (i.e., if a bar chart is drawn by the length of the bars based on the data, that is also how we read them). In this paper, we question this assumption and demonstrate that observed encodings often differ from the ones used to specify the visualization. The value of a chart also often comes from higher level derived encodings, and which encodings end up getting used also depends on the user’s task.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Encoding data visually is at the heart of visualization. We usually assume that encodings are read as specified (i.e., if a bar chart is drawn by the length of the bars based on the data, that is also how we read them). In this paper, we question this assumption and demonstrate that observed encodings often differ from the ones used to specify the visualization. The value of a chart also often comes from higher level derived encodings, and which encodings end up getting used also depends on the user’s task.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Encoding data visually is at the heart of visualization. We usually assume that encodings are read as specified (i.e., if a bar chart is drawn by the length of the bars based on the data, that is also how we read them). In this paper, we question this assumption and demonstrate that observed encodings often differ from the ones used to specify the visualization. The value of a chart also often comes from higher level derived encodings, and which encodings end up getting used also depends on the user’s task.",
"title": "More Than Meets the Eye: A Closer Look at Encodings in Visualization",
"normalizedTitle": "More Than Meets the Eye: A Closer Look at Encodings in Visualization",
"fno": "09756627",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Visualisation",
"Encoding",
"Data Encoding",
"Bar Chart",
"Observed Encodings",
"Higher Level Derived Encodings",
"Visualization",
"Users Task",
"Heart",
"Data Visualization",
"Encoding",
"Task Analysis",
"Bars"
],
"authors": [
{
"givenName": "Robert",
"surname": "Kosara",
"fullName": "Robert Kosara",
"affiliation": "Tableau Research, Seattle, WA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2022-03-01 00:00:00",
"pubType": "mags",
"pages": "110-114",
"year": "2022",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2016/01/07192667",
"title": "Visual Encodings of Temporal Uncertainty: A Comparative User Study",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192667/13rRUwjGoLH",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/03/07875127",
"title": "Evaluating Interactive Graphical Encodings for Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2018/03/07875127/13rRUxly9e0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122631",
"title": "Graphical Overlays: Using Layered Elements to Aid Chart Reading",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122631/13rRUyfKIHJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904487",
"title": "Studying Early Decision Making with Progressive Bar Charts",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904487/1H1geE4olvG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2022/9007/0/900700a067",
"title": "An Overview of the Design and Development for Dynamic and Physical Bar Charts",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2022/900700a067/1KaH61BvDWw",
"parentPublication": {
"id": "proceedings/iv/2022/9007/0",
"title": "2022 26th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805427",
"title": "Biased Average Position Estimates in Line and Bar Graphs: Underestimation, Overestimation, and Perceptual Pull",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805427/1cG4xtnomys",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08809678",
"title": "Investigating Direct Manipulation of Graphical Encodings as a Method for User Interaction",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08809678/1cHEi01VEYg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a151",
"title": "The Cost of Pie Charts",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a151/1cMFcqwGM5q",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222047",
"title": "Truth or Square: Aspect Ratio Biases Recall of Position Encodings",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222047/1nTqj3fbFXq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552881",
"title": "Modeling Just Noticeable Differences in Charts",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552881/1xibXzMLm9i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09756619",
"articleId": "1CxvlNWsHsI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09756618",
"articleId": "1CxvicOkt6o",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRo",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1IXUnbRdUEE",
"doi": "10.1109/TVCG.2022.3226463",
"abstract": "Graphical perception studies typically measure visualization encoding effectiveness using the error of an “average observer”, leading to canonical rankings of encodings for numerical attributes: <italic>e.g.</italic>, position <inline-formula><tex-math notation=\"LaTeX\">Z_$>$_Z</tex-math></inline-formula> area <inline-formula><tex-math notation=\"LaTeX\">Z_$>$_Z</tex-math></inline-formula> angle <inline-formula><tex-math notation=\"LaTeX\">Z_$>$_Z</tex-math></inline-formula> volume. Yet different people may vary in their ability to read different visualization types, leading to variance in this ranking across individuals not captured by population-level metrics using “average observer” models. One way we can bridge this gap is by recasting classic visual perception tasks as tools for assessing individual performance, in addition to overall visualization performance. In this paper we replicate and extend Cleveland and McGill's graphical comparison experiment using Bayesian multilevel regression, using these models to explore individual differences in visualization skill from multiple perspectives. The results from experiments and modeling indicate that some people show patterns of accuracy that credibly deviate from the canonical rankings of visualization effectiveness. We discuss implications of these findings, such as a need for new ways to communicate visualization effectiveness to designers, how patterns in individuals' responses may show systematic biases and strategies in visualization judgment, and how recasting classic visual perception tasks as tools for assessing individual performance may offer new ways to quantify aspects of visualization literacy. Experiment data, source code, and analysis scripts are available at the following repository: <uri>https://osf.io/8ub7t/?view_only=9be4798797404a4397be3c6fc2a68cc0</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Graphical perception studies typically measure visualization encoding effectiveness using the error of an “average observer”, leading to canonical rankings of encodings for numerical attributes: <italic>e.g.</italic>, position <inline-formula><tex-math notation=\"LaTeX\">$>$</tex-math></inline-formula> area <inline-formula><tex-math notation=\"LaTeX\">$>$</tex-math></inline-formula> angle <inline-formula><tex-math notation=\"LaTeX\">$>$</tex-math></inline-formula> volume. Yet different people may vary in their ability to read different visualization types, leading to variance in this ranking across individuals not captured by population-level metrics using “average observer” models. One way we can bridge this gap is by recasting classic visual perception tasks as tools for assessing individual performance, in addition to overall visualization performance. In this paper we replicate and extend Cleveland and McGill's graphical comparison experiment using Bayesian multilevel regression, using these models to explore individual differences in visualization skill from multiple perspectives. The results from experiments and modeling indicate that some people show patterns of accuracy that credibly deviate from the canonical rankings of visualization effectiveness. We discuss implications of these findings, such as a need for new ways to communicate visualization effectiveness to designers, how patterns in individuals' responses may show systematic biases and strategies in visualization judgment, and how recasting classic visual perception tasks as tools for assessing individual performance may offer new ways to quantify aspects of visualization literacy. Experiment data, source code, and analysis scripts are available at the following repository: <uri>https://osf.io/8ub7t/?view_only=9be4798797404a4397be3c6fc2a68cc0</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Graphical perception studies typically measure visualization encoding effectiveness using the error of an “average observer”, leading to canonical rankings of encodings for numerical attributes: e.g., position - area - angle - volume. Yet different people may vary in their ability to read different visualization types, leading to variance in this ranking across individuals not captured by population-level metrics using “average observer” models. One way we can bridge this gap is by recasting classic visual perception tasks as tools for assessing individual performance, in addition to overall visualization performance. In this paper we replicate and extend Cleveland and McGill's graphical comparison experiment using Bayesian multilevel regression, using these models to explore individual differences in visualization skill from multiple perspectives. The results from experiments and modeling indicate that some people show patterns of accuracy that credibly deviate from the canonical rankings of visualization effectiveness. We discuss implications of these findings, such as a need for new ways to communicate visualization effectiveness to designers, how patterns in individuals' responses may show systematic biases and strategies in visualization judgment, and how recasting classic visual perception tasks as tools for assessing individual performance may offer new ways to quantify aspects of visualization literacy. Experiment data, source code, and analysis scripts are available at the following repository: https://osf.io/8ub7t/?view_only=9be4798797404a4397be3c6fc2a68cc0.",
"title": "The Risks of Ranking: Revisiting Graphical Perception to Model Individual Differences in Visualization Performance",
"normalizedTitle": "The Risks of Ranking: Revisiting Graphical Perception to Model Individual Differences in Visualization Performance",
"fno": "09978718",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Task Analysis",
"Visualization",
"Correlation",
"Observers",
"Bars",
"Sociology",
"Visualization",
"Graphical Perception",
"Individual Differences"
],
"authors": [
{
"givenName": "Russell",
"surname": "Davis",
"fullName": "Russell Davis",
"affiliation": "Worcester Polytechnic Institute, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaoying",
"surname": "Pu",
"fullName": "Xiaoying Pu",
"affiliation": "University of California, Merced, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yiren",
"surname": "Ding",
"fullName": "Yiren Ding",
"affiliation": "Worcester Polytechnic Institute, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Brian D.",
"surname": "Hall",
"fullName": "Brian D. Hall",
"affiliation": "University of Michigan, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Karen",
"surname": "Bonilla",
"fullName": "Karen Bonilla",
"affiliation": "Worcester Polytechnic Institute, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mi",
"surname": "Feng",
"fullName": "Mi Feng",
"affiliation": "Worcester Polytechnic Institute, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matthew",
"surname": "Kay",
"fullName": "Matthew Kay",
"affiliation": "Northwestern University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lane",
"surname": "Harrison",
"fullName": "Lane Harrison",
"affiliation": "Worcester Polytechnic Institute, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "1-16",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tp/2019/05/08344546",
"title": "What Makes Objects Similar: A Unified Multi-Metric Learning Approach",
"doi": null,
"abstractUrl": "/journal/tp/2019/05/08344546/13rRUNvgyXK",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ai/2023/02/09760177",
"title": "Imperceptible and Sparse Adversarial Attacks via a Dual-Population-Based Constrained Evolutionary Algorithm",
"doi": null,
"abstractUrl": "/journal/ai/2023/02/09760177/1CHsEUX81mU",
"parentPublication": {
"id": "trans/ai",
"title": "IEEE Transactions on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2022/06/09751236",
"title": "Memristors Enabled Computing Correlation Parameter In-Memory System: A Potential Alternative to Von Neumann Architecture",
"doi": null,
"abstractUrl": "/journal/si/2022/06/09751236/1CnxPa7I1gc",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09963545",
"title": "Parallel Core Maintenance of Dynamic Graphs",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09963545/1Iz0MCWUJhe",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10021892",
"title": "Discrete Morse Sandwich: Fast Computation of Persistence Diagrams for Scalar Data – An Algorithm and A Benchmark",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10021892/1K3XDAtRZ8Q",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/10038534",
"title": "Properties of Standard and Sketched Kernel Fisher Discriminant",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/10038534/1KxPVQu6GXu",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10078319",
"title": "Top-<inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula> Community Similarity Search Over Large-Scale Road Networks",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10078319/1LIN5YpM6HK",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2022/03/09311251",
"title": "Exploring Individual Differences of Public Speaking Anxiety in Real-Life and Virtual Presentations",
"doi": null,
"abstractUrl": "/journal/ta/2022/03/09311251/1pYWAX0Po6A",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/02/09451590",
"title": "Conceptual Metaphor and Graphical Convention Influence the Interpretation of Line Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2022/02/09451590/1ujXLK9Vgac",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/04/09662190",
"title": "Higher-Order Truss Decomposition in Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2023/04/09662190/1zzl2ZAAVvq",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09973820",
"articleId": "1IUAPHcYiD6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09978713",
"articleId": "1IXUnnVaWoE",
"__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": "1cHEi01VEYg",
"doi": "10.1109/TVCG.2019.2934534",
"abstract": "We investigate direct manipulation of graphical encodings as a method for interacting with visualizations. There is an increasing interest in developing visualization tools that enable users to perform operations by directly manipulating graphical encodings rather than external widgets such as checkboxes and sliders. Designers of such tools must decide which direct manipulation operations should be supported, and identify how each operation can be invoked. However, we lack empirical guidelines for how people convey their intended operations using direct manipulation of graphical encodings. We address this issue by conducting a qualitative study that examines how participants perform 15 operations using direct manipulation of standard graphical encodings. From this study, we 1) identify a list of strategies people employ to perform each operation, 2) observe commonalities in strategies across operations, and 3) derive implications to help designers leverage direct manipulation of graphical encoding as a method for user interaction.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We investigate direct manipulation of graphical encodings as a method for interacting with visualizations. There is an increasing interest in developing visualization tools that enable users to perform operations by directly manipulating graphical encodings rather than external widgets such as checkboxes and sliders. Designers of such tools must decide which direct manipulation operations should be supported, and identify how each operation can be invoked. However, we lack empirical guidelines for how people convey their intended operations using direct manipulation of graphical encodings. We address this issue by conducting a qualitative study that examines how participants perform 15 operations using direct manipulation of standard graphical encodings. From this study, we 1) identify a list of strategies people employ to perform each operation, 2) observe commonalities in strategies across operations, and 3) derive implications to help designers leverage direct manipulation of graphical encoding as a method for user interaction.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We investigate direct manipulation of graphical encodings as a method for interacting with visualizations. There is an increasing interest in developing visualization tools that enable users to perform operations by directly manipulating graphical encodings rather than external widgets such as checkboxes and sliders. Designers of such tools must decide which direct manipulation operations should be supported, and identify how each operation can be invoked. However, we lack empirical guidelines for how people convey their intended operations using direct manipulation of graphical encodings. We address this issue by conducting a qualitative study that examines how participants perform 15 operations using direct manipulation of standard graphical encodings. From this study, we 1) identify a list of strategies people employ to perform each operation, 2) observe commonalities in strategies across operations, and 3) derive implications to help designers leverage direct manipulation of graphical encoding as a method for user interaction.",
"title": "Investigating Direct Manipulation of Graphical Encodings as a Method for User Interaction",
"normalizedTitle": "Investigating Direct Manipulation of Graphical Encodings as a Method for User Interaction",
"fno": "08809678",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Graph Theory",
"Human Computer Interaction",
"User Interfaces",
"User Interaction",
"Direct Manipulation Operations",
"Graphical Encodings",
"Visualization Tools",
"Bars",
"Data Visualization",
"Encoding",
"Visualization",
"Image Color Analysis",
"Tools",
"Instruments",
"Direct Manipulation",
"Data Visualization"
],
"authors": [
{
"givenName": "Bahador",
"surname": "Saket",
"fullName": "Bahador Saket",
"affiliation": "Georgia Tech",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Samuel",
"surname": "Huron",
"fullName": "Samuel Huron",
"affiliation": "University Paris Saclay",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Charles",
"surname": "Perin",
"fullName": "Charles Perin",
"affiliation": "University of Victoria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alex",
"surname": "Endert",
"fullName": "Alex Endert",
"affiliation": "Georgia Tech",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "482-491",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vl/1997/8144/0/81440246",
"title": "Graphical definitions: making spreadsheets visual through direct manipulation and gestures",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1997/81440246/12OmNwwd2Na",
"parentPublication": {
"id": "proceedings/vl/1997/8144/0",
"title": "Proceedings. 1997 IEEE Symposium on Visual Languages (Cat. No.97TB100180)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wvl/1992/3090/0/00275778",
"title": "Creating visual objects by direct manipulation",
"doi": null,
"abstractUrl": "/proceedings-article/wvl/1992/00275778/12OmNxWLTkf",
"parentPublication": {
"id": "proceedings/wvl/1992/3090/0",
"title": "Proceedings IEEE Workshop on Visual Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wvl/1990/2090/0/00128404",
"title": "Creating graphical interfaces through graphical interaction",
"doi": null,
"abstractUrl": "/proceedings-article/wvl/1990/00128404/12OmNyKrH4Z",
"parentPublication": {
"id": "proceedings/wvl/1990/2090/0",
"title": "Proceedings of the 1990 IEEE Workshop on Visual Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192667",
"title": "Visual Encodings of Temporal Uncertainty: A Comparative User Study",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192667/13rRUwjGoLH",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/03/07875127",
"title": "Evaluating Interactive Graphical Encodings for Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2018/03/07875127/13rRUxly9e0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122631",
"title": "Graphical Overlays: Using Layered Elements to Aid Chart Reading",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122631/13rRUyfKIHJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2018/9264/0/926400a142",
"title": "Extracting Visual Encodings from Map Chart Images with Color-Encoded Scalar Values",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2018/926400a142/17D45WaTkiB",
"parentPublication": {
"id": "proceedings/sibgrapi/2018/9264/0",
"title": "2018 31st SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440806",
"title": "Evaluating ‘Graphical Perception’ with CNNs",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440806/17D45We0UEy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2022/02/09756627",
"title": "More Than Meets the Eye: A Closer Look at Encodings in Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2022/02/09756627/1CxvjdlL3TG",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09839572",
"title": "Evaluating Graphical Perception of Visual Motion for Quantitative Data Encoding",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09839572/1FisKWeqz8Q",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08805458",
"articleId": "1cG4DDXy75K",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08794607",
"articleId": "1cumYxIQ9Ve",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1fe9SCTkU0g",
"name": "ttg202001-08809678s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202001-08809678s1.zip",
"extension": "zip",
"size": "2.82 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzcxZdC",
"title": "October",
"year": "2011",
"issueNum": "10",
"idPrefix": "tp",
"pubType": "journal",
"volume": "33",
"label": "October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwIF6ax",
"doi": "10.1109/TPAMI.2011.20",
"abstract": "We consider the active learning problem, which aims to select the most representative points. Out of many existing active learning techniques, optimum experimental design (OED) has received considerable attention recently. The typical OED criteria minimize the variance of the parameter estimates or predicted value. However, these methods see only global euclidean structure, while the local manifold structure is ignored. For example, I-optimal design selects those data points such that other data points can be best approximated by linear combinations of all the selected points. In this paper, we propose a novel active learning algorithm which takes into account the local structure of the data space. That is, each data point should be approximated by the linear combination of only its neighbors. Given the local reconstruction coefficients for every data point and the coordinates of the selected points, a transductive learning algorithm called Locally Linear Reconstruction (LLR) is proposed to reconstruct every other point. The most representative points are thus defined as those whose coordinates can be used to best reconstruct the whole data set. The sequential and convex optimization schemes are also introduced to solve the optimization problem. The experimental results have demonstrated the effectiveness of our proposed method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We consider the active learning problem, which aims to select the most representative points. Out of many existing active learning techniques, optimum experimental design (OED) has received considerable attention recently. The typical OED criteria minimize the variance of the parameter estimates or predicted value. However, these methods see only global euclidean structure, while the local manifold structure is ignored. For example, I-optimal design selects those data points such that other data points can be best approximated by linear combinations of all the selected points. In this paper, we propose a novel active learning algorithm which takes into account the local structure of the data space. That is, each data point should be approximated by the linear combination of only its neighbors. Given the local reconstruction coefficients for every data point and the coordinates of the selected points, a transductive learning algorithm called Locally Linear Reconstruction (LLR) is proposed to reconstruct every other point. The most representative points are thus defined as those whose coordinates can be used to best reconstruct the whole data set. The sequential and convex optimization schemes are also introduced to solve the optimization problem. The experimental results have demonstrated the effectiveness of our proposed method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We consider the active learning problem, which aims to select the most representative points. Out of many existing active learning techniques, optimum experimental design (OED) has received considerable attention recently. The typical OED criteria minimize the variance of the parameter estimates or predicted value. However, these methods see only global euclidean structure, while the local manifold structure is ignored. For example, I-optimal design selects those data points such that other data points can be best approximated by linear combinations of all the selected points. In this paper, we propose a novel active learning algorithm which takes into account the local structure of the data space. That is, each data point should be approximated by the linear combination of only its neighbors. Given the local reconstruction coefficients for every data point and the coordinates of the selected points, a transductive learning algorithm called Locally Linear Reconstruction (LLR) is proposed to reconstruct every other point. The most representative points are thus defined as those whose coordinates can be used to best reconstruct the whole data set. The sequential and convex optimization schemes are also introduced to solve the optimization problem. The experimental results have demonstrated the effectiveness of our proposed method.",
"title": "Active Learning Based on Locally Linear Reconstruction",
"normalizedTitle": "Active Learning Based on Locally Linear Reconstruction",
"fno": "ttp2011102026",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Convex Programming",
"Data Structures",
"Learning Artificial Intelligence",
"Locally Linear Reconstruction",
"Representative Point Selection",
"Optimum Experimental Design",
"Parameter Estimate",
"Global Euclidean Structure",
"Local Manifold Structure",
"I Optimal Design",
"Data Points",
"Active Learning Algorithm",
"Data Space Local Structure",
"Local Reconstruction Coefficient",
"Transductive Learning Algorithm",
"Sequential Optimization",
"Convex Optimization",
"Optimization Problem",
"Optimization",
"Manifolds",
"Algorithm Design And Analysis",
"Pattern Analysis",
"Nearest Neighbor Searches",
"Convex Functions",
"Active Learning",
"Experimental Design",
"Local Structure",
"Reconstruction"
],
"authors": [
{
"givenName": "Lijun",
"surname": "Zhang",
"fullName": "Lijun Zhang",
"affiliation": "Zhejiang University, 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"
},
{
"givenName": "Deng",
"surname": "Cai",
"fullName": "Deng Cai",
"affiliation": "Zhejiang University, Hangzhou",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaofei",
"surname": "He",
"fullName": "Xiaofei He",
"affiliation": "Zhejiang University, Hangzhou",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas S.",
"surname": "Huang",
"fullName": "Thomas S. Huang",
"affiliation": "University of Illinois at Urbana Champaign, Urbana",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2011-10-01 00:00:00",
"pubType": "trans",
"pages": "2026-2038",
"year": "2011",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2008/2174/0/04761777",
"title": "Fast and regularized local metric for query-based operations",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761777/12OmNAkWvKt",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1992/2915/0/00201812",
"title": "Neural networks for active sonar classification",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1992/00201812/12OmNAnMuKK",
"parentPublication": {
"id": "proceedings/icpr/1992/2915/0",
"title": "11th IAPR International Conference on Pattern Recognition. Vol.II. Conference B: Pattern Recognition Methodology and Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2004/2158/2/01315199",
"title": "Local smoothing for manifold learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2004/01315199/12OmNBlofSJ",
"parentPublication": {
"id": "proceedings/cvpr/2004/2158/2",
"title": "Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2010/8817/1/05670014",
"title": "Active Learning for Semi-Supervised K-Means Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2010/05670014/12OmNvrdI2t",
"parentPublication": {
"id": "proceedings/ictai/2010/8817/1",
"title": "2010 22nd IEEE International Conference on Tools with Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/kam/2009/3888/2/3888b219",
"title": "Active Neighborhood Selection for Locally Linear Embedding",
"doi": null,
"abstractUrl": "/proceedings-article/kam/2009/3888b219/12OmNwLOYU8",
"parentPublication": {
"id": "proceedings/kam/2009/3888/2",
"title": "Knowledge Acquisition and Modeling, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmla/2010/4300/0/4300a003",
"title": "Improved Fine-Grained Component-Conditional Class Labeling with Active Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icmla/2010/4300a003/12OmNzA6GO7",
"parentPublication": {
"id": "proceedings/icmla/2010/4300/0",
"title": "Machine Learning and Applications, Fourth International Conference on",
"__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": "proceedings/icpr/2008/2174/0/04761293",
"title": "Clustering-based locally linear embedding",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761293/12OmNzcPAdv",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__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/tp/2018/04/07915742",
"title": "A Survey on Learning to Hash",
"doi": null,
"abstractUrl": "/journal/tp/2018/04/07915742/13rRUILLkwD",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2011102013",
"articleId": "13rRUxjQyiu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2011102039",
"articleId": "13rRUy3xY3J",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgBJ",
"name": "ttp2011102026s.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp2011102026s.pdf",
"extension": "pdf",
"size": "48 kB",
"__typename": "WebExtraType"
},
{
"id": "1Hmg3fzflte",
"name": "ttp201110-05708150s1-ttp2011102026.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp201110-05708150s1-ttp2011102026.zip",
"extension": "zip",
"size": "37.4 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyaoDzf",
"title": "March/April",
"year": "2010",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "16",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwbs20S",
"doi": "10.1109/TVCG.2009.71",
"abstract": "We present a novel compressed bounding volume hierarchy (BVH) representation, random-accessible compressed bounding volume hierarchies (RACBVHs), for various applications requiring random access on BVHs of massive models. Our RACBVH representation is compact and transparently supports random access on the compressed BVHs without decompressing the whole BVH. To support random access on our compressed BVHs, we decompose a BVH into a set of clusters. Each cluster contains consecutive bounding volume (BV) nodes in the original layout of the BVH. Also, each cluster is compressed separately from other clusters and serves as an access point to the RACBVH representation. We provide the general BVH access API to transparently access our RACBVH representation. At runtime, our decompression framework is guaranteed to provide correct BV nodes without decompressing the whole BVH. Also, our method is extended to support parallel random access that can utilize the multicore CPU architecture. Our method can achieve up to a 12:1 compression ratio, and more importantly, can decompress 4.2 M BV nodes ({=}135 {\\rm MB}) per second by using a single CPU-core. To highlight the benefits of our approach, we apply our method to two different applications: ray tracing and collision detection. We can improve the runtime performance by more than a factor of 4 as compared to using the uncompressed original data. This improvement is a result of the fast decompression performance and reduced data access time by selectively fetching and decompressing small regions of the compressed BVHs requested by applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a novel compressed bounding volume hierarchy (BVH) representation, random-accessible compressed bounding volume hierarchies (RACBVHs), for various applications requiring random access on BVHs of massive models. Our RACBVH representation is compact and transparently supports random access on the compressed BVHs without decompressing the whole BVH. To support random access on our compressed BVHs, we decompose a BVH into a set of clusters. Each cluster contains consecutive bounding volume (BV) nodes in the original layout of the BVH. Also, each cluster is compressed separately from other clusters and serves as an access point to the RACBVH representation. We provide the general BVH access API to transparently access our RACBVH representation. At runtime, our decompression framework is guaranteed to provide correct BV nodes without decompressing the whole BVH. Also, our method is extended to support parallel random access that can utilize the multicore CPU architecture. Our method can achieve up to a 12:1 compression ratio, and more importantly, can decompress 4.2 M BV nodes ({=}135 {\\rm MB}) per second by using a single CPU-core. To highlight the benefits of our approach, we apply our method to two different applications: ray tracing and collision detection. We can improve the runtime performance by more than a factor of 4 as compared to using the uncompressed original data. This improvement is a result of the fast decompression performance and reduced data access time by selectively fetching and decompressing small regions of the compressed BVHs requested by applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a novel compressed bounding volume hierarchy (BVH) representation, random-accessible compressed bounding volume hierarchies (RACBVHs), for various applications requiring random access on BVHs of massive models. Our RACBVH representation is compact and transparently supports random access on the compressed BVHs without decompressing the whole BVH. To support random access on our compressed BVHs, we decompose a BVH into a set of clusters. Each cluster contains consecutive bounding volume (BV) nodes in the original layout of the BVH. Also, each cluster is compressed separately from other clusters and serves as an access point to the RACBVH representation. We provide the general BVH access API to transparently access our RACBVH representation. At runtime, our decompression framework is guaranteed to provide correct BV nodes without decompressing the whole BVH. Also, our method is extended to support parallel random access that can utilize the multicore CPU architecture. Our method can achieve up to a 12:1 compression ratio, and more importantly, can decompress 4.2 M BV nodes ({=}135 {\\rm MB}) per second by using a single CPU-core. To highlight the benefits of our approach, we apply our method to two different applications: ray tracing and collision detection. We can improve the runtime performance by more than a factor of 4 as compared to using the uncompressed original data. This improvement is a result of the fast decompression performance and reduced data access time by selectively fetching and decompressing small regions of the compressed BVHs requested by applications.",
"title": "RACBVHs: Random-Accessible Compressed Bounding Volume Hierarchies",
"normalizedTitle": "RACBVHs: Random-Accessible Compressed Bounding Volume Hierarchies",
"fno": "ttg2010020273",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Hierarchy And BVH Compression",
"Random Access",
"Cache Coherent Layouts",
"Ray Tracing",
"Collision Detection"
],
"authors": [
{
"givenName": "Tae-Joon",
"surname": "Kim",
"fullName": "Tae-Joon Kim",
"affiliation": "Korea Advanced Institute of Science and Technology, Daejeon",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bochang",
"surname": "Moon",
"fullName": "Bochang Moon",
"affiliation": "Korea Advanced Institute of Science and Technology, Daejeon",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Duksu",
"surname": "Kim",
"fullName": "Duksu Kim",
"affiliation": "Korea Advanced Institute of Science and Technology, Daejeon",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sung-Eui",
"surname": "Yoon",
"fullName": "Sung-Eui Yoon",
"affiliation": "Korea Advanced Institute of Science and Technology, Daejeon",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2010-03-01 00:00:00",
"pubType": "trans",
"pages": "273-286",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icecs/2009/3937/0/3937a436",
"title": "Bounding-Volume Hierarchies Technique for Detecting Object Interference in Urban Environment Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/icecs/2009/3937a436/12OmNAndiev",
"parentPublication": {
"id": "proceedings/icecs/2009/3937/0",
"title": "Environmental and Computer Science, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/achi/2009/3529/0/3529a136",
"title": "A Hybrid Bounding Volume Algorithm to Detect Collisions between Deformable Objects",
"doi": null,
"abstractUrl": "/proceedings-article/achi/2009/3529a136/12OmNC3FG9c",
"parentPublication": {
"id": "proceedings/achi/2009/3529/0",
"title": "International Conference on Advances in Computer-Human Interaction",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rt/2007/1629/0/04342593",
"title": "Early Split Clipping for Bounding Volume Hierarchies",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2007/04342593/12OmNvxKu0c",
"parentPublication": {
"id": "proceedings/rt/2007/1629/0",
"title": "IEEE/ EG Symposium on Interactive Ray Tracing 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rt/2008/2741/0/04634624",
"title": "Tree rotations for improving bounding volume hierarchies",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2008/04634624/12OmNwEJ11o",
"parentPublication": {
"id": "proceedings/rt/2008/2741/0",
"title": "Symposium on Interactive Ray Tracing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rt/2008/2741/0/04634618",
"title": "Multi bounding volume hierarchies",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2008/04634618/12OmNweBUCF",
"parentPublication": {
"id": "proceedings/rt/2008/2741/0",
"title": "Symposium on Interactive Ray Tracing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rt/2007/1629/0/04342588",
"title": "On fast Construction of SAH-based Bounding Volume Hierarchies",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2007/04342588/12OmNxveNI1",
"parentPublication": {
"id": "proceedings/rt/2007/1629/0",
"title": "IEEE/ EG Symposium on Interactive Ray Tracing 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/achi/2010/3957/0/3957a107",
"title": "Detecting Self-Collisions Using a Hybrid Bounding Volume Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/achi/2010/3957a107/12OmNzyGH6A",
"parentPublication": {
"id": "proceedings/achi/2010/3957/0",
"title": "International Conference on Advances in Computer-Human Interaction",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1998/01/v0021",
"title": "Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs",
"doi": null,
"abstractUrl": "/journal/tg/1998/01/v0021/13rRUNvgyW9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/03/07857089",
"title": "Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction",
"doi": null,
"abstractUrl": "/journal/tg/2018/03/07857089/13rRUx0gevb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/12/08219711",
"title": "Chunked Bounding Volume Hierarchies for Fast Digital Prototyping Using Volumetric Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2018/12/08219711/14H4WN3R0By",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010020261",
"articleId": "13rRUwI5TQT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010020287",
"articleId": "13rRUygT7f8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFp0",
"name": "ttg2010020273s.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2010020273s.zip",
"extension": "zip",
"size": "52.4 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNB8Cj4p",
"title": "June",
"year": "1986",
"issueNum": "06",
"idPrefix": "tp",
"pubType": "journal",
"volume": "8",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjQywh",
"doi": "10.1109/TPAMI.1986.4767859",
"abstract": "We propose a fast nearest neighbor finding algorithm, named tentatively an ordered partition, based on the ordered lists of the training samples of each projection axis. The ordered partition contains two properties, one is ordering-to bound the search region, and the other is partitioning-to reject the unwanted samples without actual distance computations. It is proved that the proposed algorithm can find k nearest neighbors in a constant expected time. Simulations show that the algorithm is rather distribution free, and only 4.6 distance calculations, on the average, were required to find a nearest neighbor among 10 000 samples drawn from a bivariate normal distribution.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose a fast nearest neighbor finding algorithm, named tentatively an ordered partition, based on the ordered lists of the training samples of each projection axis. The ordered partition contains two properties, one is ordering-to bound the search region, and the other is partitioning-to reject the unwanted samples without actual distance computations. It is proved that the proposed algorithm can find k nearest neighbors in a constant expected time. Simulations show that the algorithm is rather distribution free, and only 4.6 distance calculations, on the average, were required to find a nearest neighbor among 10 000 samples drawn from a bivariate normal distribution.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose a fast nearest neighbor finding algorithm, named tentatively an ordered partition, based on the ordered lists of the training samples of each projection axis. The ordered partition contains two properties, one is ordering-to bound the search region, and the other is partitioning-to reject the unwanted samples without actual distance computations. It is proved that the proposed algorithm can find k nearest neighbors in a constant expected time. Simulations show that the algorithm is rather distribution free, and only 4.6 distance calculations, on the average, were required to find a nearest neighbor among 10 000 samples drawn from a bivariate normal distribution.",
"title": "A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition",
"normalizedTitle": "A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition",
"fno": "04767859",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Nearest Neighbor Searches",
"Partitioning Algorithms",
"Testing",
"Clustering Algorithms",
"Search Methods",
"Computational Modeling",
"Gaussian Distribution",
"Pattern Recognition",
"Pattern Classification",
"Management Training",
"Density Estimation",
"K Nearest Neighbors",
"Nonparametric Pattern Recognition",
"Ordered Partition",
"Preprocessing",
"Search Tree"
],
"authors": [
{
"givenName": "Baek S.",
"surname": "Kim",
"fullName": "Baek S. Kim",
"affiliation": "Department of Medical Information Management, College of Medicine, Hanyang University, 17 Haengdangdong, Seong-dong-ku, Seoul 133, Korea.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Song B.",
"surname": "Park",
"fullName": "Song B. Park",
"affiliation": "Department of Electrical Engineering, Korea Advanced Institute of Science and Technology, P.O. Box 150, Chongyangni, Seoul 131, Korea.",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "1986-11-01 00:00:00",
"pubType": "trans",
"pages": "761-766",
"year": "1986",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sisap/2009/3765/0/3765a091",
"title": "Approximate Direct and Reverse Nearest Neighbor Queries, and the k-nearest Neighbor Graph",
"doi": null,
"abstractUrl": "/proceedings-article/sisap/2009/3765a091/12OmNBuL1a6",
"parentPublication": {
"id": "proceedings/sisap/2009/3765/0",
"title": "Similarity Search and Applications, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2017/6543/0/6543a031",
"title": "The Moving K Diversified Nearest Neighbor Query",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2017/6543a031/12OmNrAMEU7",
"parentPublication": {
"id": "proceedings/icde/2017/6543/0",
"title": "2017 IEEE 33rd International Conference on Data Engineering (ICDE)",
"__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/icdar/1993/4960/0/00395770",
"title": "Color map image segmentation using optimized nearest neighbor classifiers",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/1993/00395770/12OmNyoiZ4A",
"parentPublication": {
"id": "proceedings/icdar/1993/4960/0",
"title": "Proceedings of 2nd International Conference on Document Analysis and Recognition (ICDAR '93)",
"__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/tp/2014/02/ttp2014020388",
"title": "Trinary-Projection Trees for Approximate Nearest Neighbor Search",
"doi": null,
"abstractUrl": "/journal/tp/2014/02/ttp2014020388/13rRUxAAT2s",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__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"
},
{
"id": "trans/tc/1974/11/01672420",
"title": "Finding Prototypes For Nearest Neighbor Classifiers",
"doi": null,
"abstractUrl": "/journal/tc/1974/11/01672420/13rRUygT7lB",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2016/10/07517340",
"title": "The Moving Z_$K$_Z Diversified Nearest Neighbor Query",
"doi": null,
"abstractUrl": "/journal/tk/2016/10/07517340/13rRUyp7tXk",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "04767860",
"articleId": "13rRUxAAT8C",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04767861",
"articleId": "13rRUyuvRpH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCy2L3z",
"title": "Oct.",
"year": "2012",
"issueNum": "10",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5rT",
"doi": "10.1109/TVCG.2011.282",
"abstract": "We present an algorithm to render objects made of transparent materials with rough surfaces in real-time, under all-frequency distant illumination. Rough surfaces cause wide scattering as light enters and exits objects, which significantly complicates the rendering of such materials. We present two contributions to approximate the successive scattering events at interfaces, due to rough refraction: First, an approximation of the Bidirectional Transmittance Distribution Function (BTDF), using spherical Gaussians, suitable for real-time estimation of environment lighting using preconvolution; second, a combination of cone tracing and macrogeometry filtering to efficiently integrate the scattered rays at the exiting interface of the object. We demonstrate the quality of our approximation by comparison against stochastic ray tracing. Furthermore we propose two extensions to our method for supporting spatially varying roughness on object surfaces and local lighting for thin objects.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present an algorithm to render objects made of transparent materials with rough surfaces in real-time, under all-frequency distant illumination. Rough surfaces cause wide scattering as light enters and exits objects, which significantly complicates the rendering of such materials. We present two contributions to approximate the successive scattering events at interfaces, due to rough refraction: First, an approximation of the Bidirectional Transmittance Distribution Function (BTDF), using spherical Gaussians, suitable for real-time estimation of environment lighting using preconvolution; second, a combination of cone tracing and macrogeometry filtering to efficiently integrate the scattered rays at the exiting interface of the object. We demonstrate the quality of our approximation by comparison against stochastic ray tracing. Furthermore we propose two extensions to our method for supporting spatially varying roughness on object surfaces and local lighting for thin objects.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present an algorithm to render objects made of transparent materials with rough surfaces in real-time, under all-frequency distant illumination. Rough surfaces cause wide scattering as light enters and exits objects, which significantly complicates the rendering of such materials. We present two contributions to approximate the successive scattering events at interfaces, due to rough refraction: First, an approximation of the Bidirectional Transmittance Distribution Function (BTDF), using spherical Gaussians, suitable for real-time estimation of environment lighting using preconvolution; second, a combination of cone tracing and macrogeometry filtering to efficiently integrate the scattered rays at the exiting interface of the object. We demonstrate the quality of our approximation by comparison against stochastic ray tracing. Furthermore we propose two extensions to our method for supporting spatially varying roughness on object surfaces and local lighting for thin objects.",
"title": "Real-Time Rendering of Rough Refraction",
"normalizedTitle": "Real-Time Rendering of Rough Refraction",
"fno": "ttg2012101591",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Surface Roughness",
"Real Time Systems",
"Rough Surfaces",
"Geometry",
"Scattering",
"Lighting",
"Normal Distribution Function",
"Real Time Rendering",
"Translucent Material",
"Bidirectional Transmittance Distribution Function"
],
"authors": [
{
"givenName": "Charles",
"surname": "de Rousiers",
"fullName": "Charles de Rousiers",
"affiliation": "INRIA Rhone-Alpes, Grenoble",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Adrien",
"surname": "Bousseau",
"fullName": "Adrien Bousseau",
"affiliation": "INRIA Sophia-Antipolis, Sophia-Antipolis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kartic",
"surname": "Subr",
"fullName": "Kartic Subr",
"affiliation": "University College London, London",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nicolas",
"surname": "Holzschuch",
"fullName": "Nicolas Holzschuch",
"affiliation": "INRIA Rhone-Alpes, Grenoble",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ravi",
"surname": "Ramamoorthi",
"fullName": "Ravi Ramamoorthi",
"affiliation": "University of California, Berkeley, Berkeley",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2012-10-01 00:00:00",
"pubType": "trans",
"pages": "1591-1602",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cgiv/2013/5051/0/5051a027",
"title": "Real-Time Rendering of Rough Refraction under Dynamically Varying Environmental Lighting",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2013/5051a027/12OmNAWH9zn",
"parentPublication": {
"id": "proceedings/cgiv/2013/5051/0",
"title": "2013 10th International Conference Computer Graphics, Imaging and Visualization (CGIV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2012/4789/0/4789a127",
"title": "Finite Element Analysis of Normal Contact Stiffness between Real Rough Surfaces Based on ANSYS",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2012/4789a127/12OmNCf1Dx3",
"parentPublication": {
"id": "proceedings/iccis/2012/4789/0",
"title": "2012 Fourth International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisis/2014/4325/0/4325a307",
"title": "A Discretization Criterion for Generating Random Rough Surface Based on Convolution Method",
"doi": null,
"abstractUrl": "/proceedings-article/cisis/2014/4325a307/12OmNrGb2fM",
"parentPublication": {
"id": "proceedings/cisis/2014/4325/0",
"title": "2014 Eighth International Conference on Complex, Intelligent and Software Intensive Systems (CISIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2007/3009/0/30090116",
"title": "Fogshop: Real-Time Design and Rendering of Inhomogeneous, Single-Scattering Media",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2007/30090116/12OmNwe2IrM",
"parentPublication": {
"id": "proceedings/pg/2007/3009/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2004/2158/1/01315027",
"title": "Self shadowing and local illumination of randomly rough surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2004/01315027/12OmNx19k1j",
"parentPublication": {
"id": "proceedings/cvpr/2004/2158/1",
"title": "Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2013/2576/0/06814988",
"title": "Real-Time Multi-scale Refraction under All-Frequency Environmental Lighting",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2013/06814988/12OmNx6Pizy",
"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": "mags/cg/2012/02/mcg2012020034",
"title": "A Parallel Architecture for Interactively Rendering Scattering and Refraction Effects",
"doi": null,
"abstractUrl": "/magazine/cg/2012/02/mcg2012020034/13rRUwgyOfn",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/03/07866010",
"title": "Rendering Rough Opaque Materials with Interfaced Lambertian Microfacets",
"doi": null,
"abstractUrl": "/journal/tg/2018/03/07866010/13rRUyYSWl7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bwcca/2010/4236/0/05630041",
"title": "Back Scattering from Target above Random Rough Surface",
"doi": null,
"abstractUrl": "/proceedings-article/bwcca/2010/05630041/183rAfcgQq9",
"parentPublication": {
"id": "proceedings/bwcca/2010/4236/0",
"title": "2010 International Conference on Broadband, Wireless Computing, Communication and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/06/09689957",
"title": "Efficient Specular Glints Rendering With Differentiable Regularization",
"doi": null,
"abstractUrl": "/journal/tg/2023/06/09689957/1AlCfIlPhfy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012101589",
"articleId": "13rRUwdIOUI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012101603",
"articleId": "13rRUxC0SvS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRHR",
"name": "ttg2012101591s.avi",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012101591s.avi",
"extension": "avi",
"size": "42.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzVoBCB",
"title": "July-Sept.",
"year": "2014",
"issueNum": "03",
"idPrefix": "th",
"pubType": "journal",
"volume": "7",
"label": "July-Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxOdD8p",
"doi": "10.1109/TOH.2014.2321575",
"abstract": "In daily life, certain textures and materials invite our touch motions. To seek the nature of such haptic invitation, we conducted a series of experiments consisting of sensory evaluations and ranking tasks for 36 materials to ascertain their perceptual properties and their degrees of haptic invitation. In addition, we recorded the human touch motions elicited by these materials. The results showed high degrees of haptic invitation for materials with perceptually prominent textures, which indicates that such textures frequently invite human touch motions. We also developed a Bayesian network model that represented the probabilistic relationships between invited touch motions and the properties of textures. The model substantiated the observation that different types of textural prominence led to different types of invited touch motions. These results collectively suggest that materials with prominent textures frequently encourage humans to touch them, using appropriate or specified touch motions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In daily life, certain textures and materials invite our touch motions. To seek the nature of such haptic invitation, we conducted a series of experiments consisting of sensory evaluations and ranking tasks for 36 materials to ascertain their perceptual properties and their degrees of haptic invitation. In addition, we recorded the human touch motions elicited by these materials. The results showed high degrees of haptic invitation for materials with perceptually prominent textures, which indicates that such textures frequently invite human touch motions. We also developed a Bayesian network model that represented the probabilistic relationships between invited touch motions and the properties of textures. The model substantiated the observation that different types of textural prominence led to different types of invited touch motions. These results collectively suggest that materials with prominent textures frequently encourage humans to touch them, using appropriate or specified touch motions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In daily life, certain textures and materials invite our touch motions. To seek the nature of such haptic invitation, we conducted a series of experiments consisting of sensory evaluations and ranking tasks for 36 materials to ascertain their perceptual properties and their degrees of haptic invitation. In addition, we recorded the human touch motions elicited by these materials. The results showed high degrees of haptic invitation for materials with perceptually prominent textures, which indicates that such textures frequently invite human touch motions. We also developed a Bayesian network model that represented the probabilistic relationships between invited touch motions and the properties of textures. The model substantiated the observation that different types of textural prominence led to different types of invited touch motions. These results collectively suggest that materials with prominent textures frequently encourage humans to touch them, using appropriate or specified touch motions.",
"title": "Haptic Invitation of Textures: Perceptually Prominent Properties of Materials Determine Human Touch Motions",
"normalizedTitle": "Haptic Invitation of Textures: Perceptually Prominent Properties of Materials Determine Human Touch Motions",
"fno": "06809998",
"hasPdf": true,
"idPrefix": "th",
"keywords": [
"Materials",
"Haptic Interfaces",
"Weaving",
"Rough Surfaces",
"Surface Roughness",
"Standards",
"Correlation"
],
"authors": [
{
"givenName": "Hikaru",
"surname": "Nagano",
"fullName": "Hikaru Nagano",
"affiliation": "Department of Mechanical Science and Engineering, Nagoya University, Nagoya, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shogo",
"surname": "Okamoto",
"fullName": "Shogo Okamoto",
"affiliation": "Department of Mechanical Science and Engineering, Nagoya University, Nagoya, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yoji",
"surname": "Yamada",
"fullName": "Yoji Yamada",
"affiliation": "Department of Mechanical Science and Engineering, Nagoya University, Nagoya, Japan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2014-07-01 00:00:00",
"pubType": "trans",
"pages": "345-355",
"year": "2014",
"issn": "1939-1412",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/haptics/2008/2005/0/04479912",
"title": "Discrimination of Virtual Square Gratings by Dynamic Touch on Friction Based Tactile Displays",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2008/04479912/12OmNAQJzTQ",
"parentPublication": {
"id": "proceedings/haptics/2008/2005/0",
"title": "IEEE Haptics Symposium 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2008/2005/0/04479905",
"title": "The Geometric Model for Perceived Roughness Applies to Virtual Textures",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2008/04479905/12OmNwt5sjl",
"parentPublication": {
"id": "proceedings/haptics/2008/2005/0",
"title": "IEEE Haptics Symposium 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/whc/2007/2738/0/04145153",
"title": "Texture Gradients and Perceptual Constancy under Haptic Exploration",
"doi": null,
"abstractUrl": "/proceedings-article/whc/2007/04145153/12OmNyUnEDQ",
"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/haptic/2006/0226/0/01627087",
"title": "Discrimination of Real and Virtual High-Definition Textured Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/haptic/2006/01627087/12OmNyoSbec",
"parentPublication": {
"id": "proceedings/haptic/2006/0226/0",
"title": "Haptic Interfaces for Virtual Environment and Teleoperator Systems, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2017/04/07873287",
"title": "Torque Contribution to Haptic Rendering of Virtual Textures",
"doi": null,
"abstractUrl": "/journal/th/2017/04/07873287/13rRUILLkvB",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2013/01/tth2013010081",
"title": "Psychophysical Dimensions of Tactile Perception of Textures",
"doi": null,
"abstractUrl": "/journal/th/2013/01/tth2013010081/13rRUx0xPTW",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2011/02/tth2011020122",
"title": "Roughness Perception in Virtual Textures",
"doi": null,
"abstractUrl": "/journal/th/2011/02/tth2011020122/13rRUxYINfp",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2017/02/07725536",
"title": "Linkage between Free Exploratory Movements and Subjective Tactile Ratings",
"doi": null,
"abstractUrl": "/journal/th/2017/02/07725536/13rRUxjQypi",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/05/08642446",
"title": "Modulating Fine Roughness Perception of Vibrotactile Textured Surface using Pseudo-haptic Effect",
"doi": null,
"abstractUrl": "/journal/tg/2019/05/08642446/17PYEjfZjoZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2018/1174/0/08658439",
"title": "Visuo-haptic Simulations to Improve Students’ Understanding of Friction Concepts",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2018/08658439/18j986wHygM",
"parentPublication": {
"id": "proceedings/fie/2018/1174/0",
"title": "2018 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06750738",
"articleId": "13rRUxZRbo8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06750735",
"articleId": "13rRUxDqS8s",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzV70s0",
"title": "May",
"year": "2015",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "21",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvyakP",
"doi": "10.1109/TVCG.2014.2383380",
"abstract": "Dynamic network visualization has been a challenging research topic due to the visual and computational complexity introduced by the extra time dimension. Existing solutions are usually good for overview and presentation tasks, but not for the interactive analysis of a large dynamic network. We introduce in this paper a new approach which considers only the dynamic network central to a focus node, also known as the egocentric dynamic network. Our major contribution is a novel 1.5D visualization design which greatly reduces the visual complexity of the dynamic network without sacrificing the topological and temporal context central to the focus node. In our design, the egocentric dynamic network is presented in a single static view, supporting rich analysis through user interactions on both time and network. We propose a general framework for the 1.5D visualization approach, including the data processing pipeline, the visualization algorithm design, and customized interaction methods. Finally, we demonstrate the effectiveness of our approach on egocentric dynamic network analysis tasks, through case studies and a controlled user experiment comparing with three baseline dynamic network visualization methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Dynamic network visualization has been a challenging research topic due to the visual and computational complexity introduced by the extra time dimension. Existing solutions are usually good for overview and presentation tasks, but not for the interactive analysis of a large dynamic network. We introduce in this paper a new approach which considers only the dynamic network central to a focus node, also known as the egocentric dynamic network. Our major contribution is a novel 1.5D visualization design which greatly reduces the visual complexity of the dynamic network without sacrificing the topological and temporal context central to the focus node. In our design, the egocentric dynamic network is presented in a single static view, supporting rich analysis through user interactions on both time and network. We propose a general framework for the 1.5D visualization approach, including the data processing pipeline, the visualization algorithm design, and customized interaction methods. Finally, we demonstrate the effectiveness of our approach on egocentric dynamic network analysis tasks, through case studies and a controlled user experiment comparing with three baseline dynamic network visualization methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Dynamic network visualization has been a challenging research topic due to the visual and computational complexity introduced by the extra time dimension. Existing solutions are usually good for overview and presentation tasks, but not for the interactive analysis of a large dynamic network. We introduce in this paper a new approach which considers only the dynamic network central to a focus node, also known as the egocentric dynamic network. Our major contribution is a novel 1.5D visualization design which greatly reduces the visual complexity of the dynamic network without sacrificing the topological and temporal context central to the focus node. In our design, the egocentric dynamic network is presented in a single static view, supporting rich analysis through user interactions on both time and network. We propose a general framework for the 1.5D visualization approach, including the data processing pipeline, the visualization algorithm design, and customized interaction methods. Finally, we demonstrate the effectiveness of our approach on egocentric dynamic network analysis tasks, through case studies and a controlled user experiment comparing with three baseline dynamic network visualization methods.",
"title": "1.5D Egocentric Dynamic Network Visualization",
"normalizedTitle": "1.5D Egocentric Dynamic Network Visualization",
"fno": "06991551",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Market Research",
"Layout",
"Data Visualization",
"Visualization",
"Electronic Mail",
"Heuristic Algorithms",
"Algorithm Design And Analysis",
"Egocentric Abstraction",
"Graph Visualization",
"1 5 D Visualization",
"Dynamic Network",
"Egocentric Abstraction",
"Graph Visualization",
"1 5 D Visualization",
"Dynamic Network"
],
"authors": [
{
"givenName": "Lei",
"surname": "Shi",
"fullName": "Lei Shi",
"affiliation": "State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chen",
"surname": "Wang",
"fullName": "Chen Wang",
"affiliation": "IBM Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhen",
"surname": "Wen",
"fullName": "Zhen Wen",
"affiliation": "IBM Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Qu",
"fullName": "Huamin Qu",
"affiliation": "Department of Computer Science and Engineering, Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chuang",
"surname": "Lin",
"fullName": "Chuang Lin",
"affiliation": "Department of Computer Science and Technology, Tsinghua University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qi",
"surname": "Liao",
"fullName": "Qi Liao",
"affiliation": "Department of Computer Science, Central Michigan University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2015-05-01 00:00:00",
"pubType": "trans",
"pages": "624-637",
"year": "2015",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cw/2016/2303/0/2303a119",
"title": "A Dynamic Network Layout Visualization Method Based on Structural Similarity",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2016/2303a119/12OmNAPSMmj",
"parentPublication": {
"id": "proceedings/cw/2016/2303/0",
"title": "2016 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2013/2240/0/06785790",
"title": "An interactive visualization interface for studying egocentric, categorical, contact diary datasets",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2013/06785790/12OmNAXPy9v",
"parentPublication": {
"id": "proceedings/asonam/2013/2240/0",
"title": "2013 International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2014/5118/0/5118c537",
"title": "Temporal Segmentation of Egocentric Videos",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118c537/12OmNs59JN1",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2017/5738/0/08031576",
"title": "A visual analytics approach for understanding egocentric intimacy network evolution and impact propagation in MMORPGs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031576/12OmNvAAtzN",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2011/935/0/05742388",
"title": "Dynamic network visualization in 1.5D",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742388/12OmNvjgWV1",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2015/9783/0/07347632",
"title": "EgoNetCloud: Event-based egocentric dynamic network visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2015/07347632/12OmNyo1o44",
"parentPublication": {
"id": "proceedings/vast/2015/9783/0",
"title": "2015 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192725",
"title": "egoSlider: Visual Analysis of Egocentric Network Evolution",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192725/13rRUNvya9n",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/08/06674295",
"title": "Dynamic Network Visualization withExtended Massive Sequence Views",
"doi": null,
"abstractUrl": "/journal/tg/2014/08/06674295/13rRUx0xPZz",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2018/6873/0/08739176",
"title": "Citation Network Visualization of Reference Papers Based on Influence Groups",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2018/08739176/1b1xbTKglNe",
"parentPublication": {
"id": "proceedings/ldav/2018/6873/0",
"title": "2018 IEEE 8th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icitbs/2020/6698/0/669800a870",
"title": "Data Visualization for Making Sense of Scientific Literature",
"doi": null,
"abstractUrl": "/proceedings-article/icitbs/2020/669800a870/1kuHK1dn6ko",
"parentPublication": {
"id": "proceedings/icitbs/2020/6698/0",
"title": "2020 International Conference on Intelligent Transportation, Big Data & Smart City (ICITBS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07054558",
"articleId": "13rRUx0xPib",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06994851",
"articleId": "13rRUwghd9a",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqGA5hn",
"title": "Dec.",
"year": "2015",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "21",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwfZBVn",
"doi": "10.1109/TVCG.2015.2440241",
"abstract": "A word cloud is a visual representation of a collection of text documents that uses various font sizes, colors, and spaces to arrange and depict significant words. The majority of previous studies on time-varying word clouds focuses on layout optimization and temporal trend visualization. However, they do not fully consider the spatial shapes and temporal motions of word clouds, which are important factors for attracting people’s attention and are also important cues for human visual systems in capturing information from time-varying text data. This paper presents a novel method that uses rigid body dynamics to arrange multi-temporal word-tags in a specific shape sequence under various constraints. Each word-tag is regarded as a rigid body in dynamics. With the aid of geometric, aesthetic, and temporal coherence constraints, the proposed method can generate a temporally morphable word cloud that not only arranges word-tags in their corresponding shapes but also smoothly transforms the shapes of word clouds over time, thus yielding a pleasing time-varying visualization. Using the proposed frame-by-frame and morphable word clouds, people can observe the overall story of a time-varying text data from the shape transition, and people can also observe the details from the word clouds in frames. Experimental results on various data demonstrate the feasibility and flexibility of the proposed method in morphable word cloud generation. In addition, an application that uses the proposed word clouds in a simulated exhibition demonstrates the usefulness of the proposed method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A word cloud is a visual representation of a collection of text documents that uses various font sizes, colors, and spaces to arrange and depict significant words. The majority of previous studies on time-varying word clouds focuses on layout optimization and temporal trend visualization. However, they do not fully consider the spatial shapes and temporal motions of word clouds, which are important factors for attracting people’s attention and are also important cues for human visual systems in capturing information from time-varying text data. This paper presents a novel method that uses rigid body dynamics to arrange multi-temporal word-tags in a specific shape sequence under various constraints. Each word-tag is regarded as a rigid body in dynamics. With the aid of geometric, aesthetic, and temporal coherence constraints, the proposed method can generate a temporally morphable word cloud that not only arranges word-tags in their corresponding shapes but also smoothly transforms the shapes of word clouds over time, thus yielding a pleasing time-varying visualization. Using the proposed frame-by-frame and morphable word clouds, people can observe the overall story of a time-varying text data from the shape transition, and people can also observe the details from the word clouds in frames. Experimental results on various data demonstrate the feasibility and flexibility of the proposed method in morphable word cloud generation. In addition, an application that uses the proposed word clouds in a simulated exhibition demonstrates the usefulness of the proposed method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A word cloud is a visual representation of a collection of text documents that uses various font sizes, colors, and spaces to arrange and depict significant words. The majority of previous studies on time-varying word clouds focuses on layout optimization and temporal trend visualization. However, they do not fully consider the spatial shapes and temporal motions of word clouds, which are important factors for attracting people’s attention and are also important cues for human visual systems in capturing information from time-varying text data. This paper presents a novel method that uses rigid body dynamics to arrange multi-temporal word-tags in a specific shape sequence under various constraints. Each word-tag is regarded as a rigid body in dynamics. With the aid of geometric, aesthetic, and temporal coherence constraints, the proposed method can generate a temporally morphable word cloud that not only arranges word-tags in their corresponding shapes but also smoothly transforms the shapes of word clouds over time, thus yielding a pleasing time-varying visualization. Using the proposed frame-by-frame and morphable word clouds, people can observe the overall story of a time-varying text data from the shape transition, and people can also observe the details from the word clouds in frames. Experimental results on various data demonstrate the feasibility and flexibility of the proposed method in morphable word cloud generation. In addition, an application that uses the proposed word clouds in a simulated exhibition demonstrates the usefulness of the proposed method.",
"title": "Morphable Word Clouds for Time-Varying Text Data Visualization",
"normalizedTitle": "Morphable Word Clouds for Time-Varying Text Data Visualization",
"fno": "07118241",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Tag Clouds",
"Shape",
"Data Visualization",
"Layout",
"Interpolation",
"Market Research",
"Visualization",
"Information Visualization",
"Word Cloud",
"Time Varying Text Data",
"Digital Storytelling",
"Information Visualization",
"Word Cloud",
"Time Varying Text Data",
"Digital Storytelling"
],
"authors": [
{
"givenName": "Ming-Te",
"surname": "Chi",
"fullName": "Ming-Te Chi",
"affiliation": ", National Chengchi University, Taipei, Taiwan, R.O.C",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shih-Syun",
"surname": "Lin",
"fullName": "Shih-Syun Lin",
"affiliation": ", National Cheng Kung University, Tainan, Taiwan, R.O.C",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shiang-Yi",
"surname": "Chen",
"fullName": "Shiang-Yi Chen",
"affiliation": ", National Cheng Kung University, Tainan, Taiwan, R.O.C",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chao-Hung",
"surname": "Lin",
"fullName": "Chao-Hung Lin",
"affiliation": ", National Cheng Kung University, Tainan, Taiwan, R.O.C",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tong-Yee",
"surname": "Lee",
"fullName": "Tong-Yee Lee",
"affiliation": ", National Cheng Kung University, Tainan, Taiwan, R.O.C",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2015-12-01 00:00:00",
"pubType": "trans",
"pages": "1415-1426",
"year": "2015",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2015/7568/0/7568a114",
"title": "Concentri Cloud: Word Cloud Visualization for Multiple Text Documents",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2015/7568a114/12OmNA0dMO6",
"parentPublication": {
"id": "proceedings/iv/2015/7568/0",
"title": "2015 19th International Conference on Information Visualisation (iV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2014/4103/0/4103a108",
"title": "RadCloud: Visualizing Multiple Texts with Merged Word Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2014/4103a108/12OmNAgY7my",
"parentPublication": {
"id": "proceedings/iv/2014/4103/0",
"title": "2014 18th International Conference on Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2014/2504/0/2504b833",
"title": "Word Cloud Explorer: Text Analytics Based on Word Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2014/2504b833/12OmNqNG3jl",
"parentPublication": {
"id": "proceedings/hicss/2014/2504/0",
"title": "2014 47th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2014/7434/0/7434a539",
"title": "Visualization of Police Intelligence Data Based on Word Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2014/7434a539/12OmNxwENNB",
"parentPublication": {
"id": "proceedings/cis/2014/7434/0",
"title": "2014 Tenth International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2012/4771/0/4771a013",
"title": "Three-level Visualization of Internet Discussion with Extruded Word Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2012/4771a013/12OmNyrIaxa",
"parentPublication": {
"id": "proceedings/iv/2012/4771/0",
"title": "2012 16th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2016/8942/0/8942a051",
"title": "Lyrics Word Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2016/8942a051/12OmNzT7Orr",
"parentPublication": {
"id": "proceedings/iv/2016/8942/0",
"title": "2016 20th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2010/6685/0/05429600",
"title": "Context preserving dynamic word cloud visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2010/05429600/12OmNzUxObM",
"parentPublication": {
"id": "proceedings/pacificvis/2010/6685/0",
"title": "2010 IEEE Pacific Visualization Symposium (PacificVis 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017586",
"title": "EdWordle: Consistency-Preserving Word Cloud Editing",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017586/13rRUIJuxvp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2010/06/mcg2010060042",
"title": "Context-Preserving, Dynamic Word Cloud Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2010/06/mcg2010060042/13rRUwcAquA",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis4dh/2022/7668/0/766800a043",
"title": "Word Clouds in the Wild",
"doi": null,
"abstractUrl": "/proceedings-article/vis4dh/2022/766800a043/1J2XH4Bdug0",
"parentPublication": {
"id": "proceedings/vis4dh/2022/7668/0",
"title": "2022 IEEE 7th Workshop on Visualization for the Digital Humanities (VIS4DH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07063265",
"articleId": "13rRUy3xY2T",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07272121",
"articleId": "13rRUygT7fe",
"__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": "1nTr0CUpIIM",
"doi": "10.1109/TVCG.2020.3030469",
"abstract": "Density map is an effective visualization technique for depicting the scalar field distribution in 2D space. Conventional methods for constructing density maps are mainly based on Euclidean distance, limiting their applicability in urban analysis that shall consider road network and urban traffic. In this work, we propose a new method named Topology Density Map, targeting for accurate and intuitive density maps in the context of urban environment. Based on the various constraints of road connections and traffic conditions, the method first constructs a directed acyclic graph (DAG) that propagates nonlinear scalar fields along 1D road networks. Next, the method extends the scalar fields to a 2D space by identifying key intersecting points in the DAG and calculating the scalar fields for every point, yielding a weighted Voronoi diagram like effect of space division. Two case studies demonstrate that the Topology Density Map supplies accurate information to users and provides an intuitive visualization for decision making. An interview with domain experts demonstrates the feasibility, usability, and effectiveness of our method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Density map is an effective visualization technique for depicting the scalar field distribution in 2D space. Conventional methods for constructing density maps are mainly based on Euclidean distance, limiting their applicability in urban analysis that shall consider road network and urban traffic. In this work, we propose a new method named Topology Density Map, targeting for accurate and intuitive density maps in the context of urban environment. Based on the various constraints of road connections and traffic conditions, the method first constructs a directed acyclic graph (DAG) that propagates nonlinear scalar fields along 1D road networks. Next, the method extends the scalar fields to a 2D space by identifying key intersecting points in the DAG and calculating the scalar fields for every point, yielding a weighted Voronoi diagram like effect of space division. Two case studies demonstrate that the Topology Density Map supplies accurate information to users and provides an intuitive visualization for decision making. An interview with domain experts demonstrates the feasibility, usability, and effectiveness of our method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Density map is an effective visualization technique for depicting the scalar field distribution in 2D space. Conventional methods for constructing density maps are mainly based on Euclidean distance, limiting their applicability in urban analysis that shall consider road network and urban traffic. In this work, we propose a new method named Topology Density Map, targeting for accurate and intuitive density maps in the context of urban environment. Based on the various constraints of road connections and traffic conditions, the method first constructs a directed acyclic graph (DAG) that propagates nonlinear scalar fields along 1D road networks. Next, the method extends the scalar fields to a 2D space by identifying key intersecting points in the DAG and calculating the scalar fields for every point, yielding a weighted Voronoi diagram like effect of space division. Two case studies demonstrate that the Topology Density Map supplies accurate information to users and provides an intuitive visualization for decision making. An interview with domain experts demonstrates the feasibility, usability, and effectiveness of our method.",
"title": "Topology Density Map for Urban Data Visualization and Analysis",
"normalizedTitle": "Topology Density Map for Urban Data Visualization and Analysis",
"fno": "09222248",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Geometry",
"Decision Making",
"Directed Graphs",
"Road Traffic",
"Urban Data Visualization",
"Effective Visualization Technique",
"Scalar Field Distribution",
"Urban Analysis",
"Urban Traffic",
"Intuitive Density Maps",
"Urban Environment",
"Nonlinear Scalar Fields",
"1 D Road Networks",
"Topology Density Map",
"Directed Acyclic Graph",
"DAG",
"Roads",
"Topology",
"Data Visualization",
"Estimation",
"Network Topology",
"Urban Areas",
"Two Dimensional Displays",
"Density Map",
"Network Topology",
"Urban Data"
],
"authors": [
{
"givenName": "Zezheng",
"surname": "Feng",
"fullName": "Zezheng Feng",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haotian",
"surname": "Li",
"fullName": "Haotian Li",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Zeng",
"fullName": "Wei Zeng",
"affiliation": "Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shuang-Hua",
"surname": "Yang",
"fullName": "Shuang-Hua Yang",
"affiliation": "Southern University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Qu",
"fullName": "Huamin Qu",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "828-838",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2016/07/07208899",
"title": "Interactive Urban Context-Aware Visualization via Multiple Disocclusion Operators",
"doi": null,
"abstractUrl": "/journal/tg/2016/07/07208899/13rRUxC0SEj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2017/02/07727980",
"title": "Detecting and Analyzing Urban Regions with High Impact of Weather Change on Transport",
"doi": null,
"abstractUrl": "/journal/bd/2017/02/07727980/13rRUxDqSap",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scout/2021/0767/0/076700a090",
"title": "Construction of Urban Traffic Spatial Information Database",
"doi": null,
"abstractUrl": "/proceedings-article/scout/2021/076700a090/1IbRK7kuihG",
"parentPublication": {
"id": "proceedings/scout/2021/0767/0",
"title": "2021 Smart City Challenges & Outcomes for Urban Transformation (SCOUT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wslm/2022/0819/0/081900a107",
"title": "Urban functional district Identification based on OSM Road Network and POI data: A case study of Changsha City center",
"doi": null,
"abstractUrl": "/proceedings-article/wslm/2022/081900a107/1KBdQ8fXvgc",
"parentPublication": {
"id": "proceedings/wslm/2022/0819/0",
"title": "2022 International Conference on Wearables, Sports and Lifestyle Management (WSLM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccea/2020/5904/0/09103865",
"title": "Application of Intelligent Technology in Urban Traffic Congestion",
"doi": null,
"abstractUrl": "/proceedings-article/iccea/2020/09103865/1kesx1zNJza",
"parentPublication": {
"id": "proceedings/iccea/2020/5904/0",
"title": "2020 International Conference on Computer Engineering and Application (ICCEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smartcomp/2020/6997/0/699700a332",
"title": "Discovering Multi-density Urban Hotspots in a Smart City",
"doi": null,
"abstractUrl": "/proceedings-article/smartcomp/2020/699700a332/1oxo8AQD6yA",
"parentPublication": {
"id": "proceedings/smartcomp/2020/6997/0",
"title": "2020 IEEE International Conference on Smart Computing (SMARTCOMP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdp/2021/1455/0/145500a245",
"title": "Towards Parallel Multi-density Clustering for Urban Hotspots Detection",
"doi": null,
"abstractUrl": "/proceedings-article/pdp/2021/145500a245/1sZ2HLiDGLK",
"parentPublication": {
"id": "proceedings/pdp/2021/1455/0",
"title": "2021 29th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2021/3892/0/389200a840",
"title": "Rationality Evaluation of Urban Road Network Plan Based on the EW-TOPSIS Method",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2021/389200a840/1t2nqxPVUMU",
"parentPublication": {
"id": "proceedings/icmtma/2021/3892/0",
"title": "2021 13th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mdm/2021/2845/0/284500a039",
"title": "Urban Crowd Density Prediction Based on Multi-relational Graph",
"doi": null,
"abstractUrl": "/proceedings-article/mdm/2021/284500a039/1v2QxX1aeSk",
"parentPublication": {
"id": "proceedings/mdm/2021/2845/0",
"title": "2021 22nd IEEE International Conference on Mobile Data Management (MDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdacs/2021/2561/0/256100a039",
"title": "Prediction and Detection of Urban Trajectory Using Data Mining and Deep Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/bdacs/2021/256100a039/1wiRueah6Du",
"parentPublication": {
"id": "proceedings/bdacs/2021/2561/0",
"title": "2021 International Conference on Big Data Analysis and Computer Science (BDACS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09222274",
"articleId": "1nTqB0SXkwE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09228894",
"articleId": "1nYptLKl7by",
"__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": "1xic8Hlfu4o",
"doi": "10.1109/TVCG.2021.3114880",
"abstract": "We present a pyramid-based scatterplot sampling technique to avoid overplotting and enable progressive and streaming visualization of large data. Our technique is based on a multiresolution pyramid-based decomposition of the underlying density map and makes use of the density values in the pyramid to guide the sampling at each scale for preserving the relative data densities and outliers. We show that our technique is competitive in quality with state-of-the-art methods and runs faster by about an order of magnitude. Also, we have adapted it to deliver progressive and streaming data visualization by processing the data in chunks and updating the scatterplot areas with visible changes in the density map. A quantitative evaluation shows that our approach generates stable and faithful progressive samples that are comparable to the state-of-the-art method in preserving relative densities and superior to it in keeping outliers and stability when switching frames. We present two case studies that demonstrate the effectiveness of our approach for exploring large data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a pyramid-based scatterplot sampling technique to avoid overplotting and enable progressive and streaming visualization of large data. Our technique is based on a multiresolution pyramid-based decomposition of the underlying density map and makes use of the density values in the pyramid to guide the sampling at each scale for preserving the relative data densities and outliers. We show that our technique is competitive in quality with state-of-the-art methods and runs faster by about an order of magnitude. Also, we have adapted it to deliver progressive and streaming data visualization by processing the data in chunks and updating the scatterplot areas with visible changes in the density map. A quantitative evaluation shows that our approach generates stable and faithful progressive samples that are comparable to the state-of-the-art method in preserving relative densities and superior to it in keeping outliers and stability when switching frames. We present two case studies that demonstrate the effectiveness of our approach for exploring large data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a pyramid-based scatterplot sampling technique to avoid overplotting and enable progressive and streaming visualization of large data. Our technique is based on a multiresolution pyramid-based decomposition of the underlying density map and makes use of the density values in the pyramid to guide the sampling at each scale for preserving the relative data densities and outliers. We show that our technique is competitive in quality with state-of-the-art methods and runs faster by about an order of magnitude. Also, we have adapted it to deliver progressive and streaming data visualization by processing the data in chunks and updating the scatterplot areas with visible changes in the density map. A quantitative evaluation shows that our approach generates stable and faithful progressive samples that are comparable to the state-of-the-art method in preserving relative densities and superior to it in keeping outliers and stability when switching frames. We present two case studies that demonstrate the effectiveness of our approach for exploring large data.",
"title": "Pyramid-based Scatterplots Sampling for Progressive and Streaming Data Visualization",
"normalizedTitle": "Pyramid-based Scatterplots Sampling for Progressive and Streaming Data Visualization",
"fno": "09552916",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Image Resolution",
"Sampling Methods",
"Progressive Samples",
"Relative Densities",
"Pyramid Based Scatterplots Sampling",
"Streaming Data Visualization",
"Pyramid Based Scatterplot Sampling Technique",
"Streaming Visualization",
"Multiresolution Pyramid Based Decomposition",
"Underlying Density Map",
"Relative Data Densities",
"Scatterplot Areas",
"Data Visualization",
"Sampling Methods",
"Coherence",
"Reservoirs",
"Scalability",
"Visual Analytics",
"Rivers",
"Scatterplots",
"Sampling",
"Pyramid",
"Progressive Visualization",
"Streaming Visualization",
"Scalability",
"Big Data"
],
"authors": [
{
"givenName": "Xin",
"surname": "Chen",
"fullName": "Xin Chen",
"affiliation": "Shandong University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jian",
"surname": "Zhang",
"fullName": "Jian Zhang",
"affiliation": "CNIC, CAS, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chi-Wing",
"surname": "Fu",
"fullName": "Chi-Wing Fu",
"affiliation": "Dept. of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jean-Daniel",
"surname": "Fekete",
"fullName": "Jean-Daniel Fekete",
"affiliation": "University Paris-Saclay, CNRS, Inria, LISN, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yunhai",
"surname": "Wang",
"fullName": "Yunhai Wang",
"affiliation": "Shandong University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "593-603",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wsc/2002/7614/2/01166424",
"title": "Importance sampling for multimodal functions and application to pricing exotic options",
"doi": null,
"abstractUrl": "/proceedings-article/wsc/2002/01166424/12OmNBIFmvx",
"parentPublication": {
"id": "proceedings/wsc/2002/7614/2",
"title": "Proceedings of the 2002 Winter Simulation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1998/8821/2/882120747",
"title": "An adaptive irregular sampling method for progressive transmission",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1998/882120747/12OmNqJ8tbK",
"parentPublication": {
"id": "proceedings/icip/1998/8821/3",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2008/3305/4/3305d081",
"title": "Motion Determination Using Non-uniform Sampling Based Density Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2008/3305d081/12OmNxFJXu2",
"parentPublication": {
"id": "proceedings/fskd/2008/3305/4",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccee/2009/3925/1/3925a610",
"title": "Developing Novel and Effective Approach for Association Rule Mining Using Progressive Sampling",
"doi": null,
"abstractUrl": "/proceedings-article/iccee/2009/3925a610/12OmNyUFfXz",
"parentPublication": {
"id": "iccee/2009/3925/1",
"title": "Computer and Electrical Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1994/6275/0/00577129",
"title": "The farthest point strategy for progressive image sampling",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1994/00577129/12OmNyugyHO",
"parentPublication": {
"id": "proceedings/icpr/1994/6275/0",
"title": "12th IAPR International Conference on Pattern Recognition, 1994",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/07/07473883",
"title": "Approximated and User Steerable tSNE for Progressive Visual Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2017/07/07473883/13rRUxly8T1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/02/08462793",
"title": "PANENE: A Progressive Algorithm for Indexing and Querying Approximate <italic>k</italic>-Nearest Neighbors",
"doi": null,
"abstractUrl": "/journal/tg/2020/02/08462793/13w3lozFWqB",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807244",
"title": "Data Sampling in Multi-view and Multi-class Scatterplots via Set Cover Optimization",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807244/1cG6natfOKY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08809844",
"title": "A Recursive Subdivision Technique for Sampling Multi-class Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08809844/1cHEfHRrSOQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09226404",
"title": "Evaluation of Sampling Methods for Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09226404/1nYqk0TjyeY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552891",
"articleId": "1xic5VPyxhu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09552249",
"articleId": "1xicaqbwmA0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zBb0kD6BSo",
"name": "ttg202201-09552916s1-tvcg-3114880-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09552916s1-tvcg-3114880-mm.zip",
"extension": "zip",
"size": "7.72 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNviZlCL",
"title": "January",
"year": "2011",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "January",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwIF6dJ",
"doi": "10.1109/TVCG.2010.27",
"abstract": "We present a novel concept, Virtualized Traffic, to reconstruct and visualize continuous traffic flows from discrete spatiotemporal data provided by traffic sensors or generated artificially to enhance a sense of immersion in a dynamic virtual world. Given the positions of each car at two recorded locations on a highway and the corresponding time instances, our approach can reconstruct the traffic flows (i.e., the dynamic motions of multiple cars over time) between the two locations along the highway for immersive visualization of virtual cities or other environments. Our algorithm is applicable to high-density traffic on highways with an arbitrary number of lanes and takes into account the geometric, kinematic, and dynamic constraints on the cars. Our method reconstructs the car motion that automatically minimizes the number of lane changes, respects safety distance to other cars, and computes the acceleration necessary to obtain a smooth traffic flow subject to the given constraints. Furthermore, our framework can process a continuous stream of input data in real time, enabling the users to view virtualized traffic events in a virtual world as they occur. We demonstrate our reconstruction technique with both synthetic and real-world input.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a novel concept, Virtualized Traffic, to reconstruct and visualize continuous traffic flows from discrete spatiotemporal data provided by traffic sensors or generated artificially to enhance a sense of immersion in a dynamic virtual world. Given the positions of each car at two recorded locations on a highway and the corresponding time instances, our approach can reconstruct the traffic flows (i.e., the dynamic motions of multiple cars over time) between the two locations along the highway for immersive visualization of virtual cities or other environments. Our algorithm is applicable to high-density traffic on highways with an arbitrary number of lanes and takes into account the geometric, kinematic, and dynamic constraints on the cars. Our method reconstructs the car motion that automatically minimizes the number of lane changes, respects safety distance to other cars, and computes the acceleration necessary to obtain a smooth traffic flow subject to the given constraints. Furthermore, our framework can process a continuous stream of input data in real time, enabling the users to view virtualized traffic events in a virtual world as they occur. We demonstrate our reconstruction technique with both synthetic and real-world input.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a novel concept, Virtualized Traffic, to reconstruct and visualize continuous traffic flows from discrete spatiotemporal data provided by traffic sensors or generated artificially to enhance a sense of immersion in a dynamic virtual world. Given the positions of each car at two recorded locations on a highway and the corresponding time instances, our approach can reconstruct the traffic flows (i.e., the dynamic motions of multiple cars over time) between the two locations along the highway for immersive visualization of virtual cities or other environments. Our algorithm is applicable to high-density traffic on highways with an arbitrary number of lanes and takes into account the geometric, kinematic, and dynamic constraints on the cars. Our method reconstructs the car motion that automatically minimizes the number of lane changes, respects safety distance to other cars, and computes the acceleration necessary to obtain a smooth traffic flow subject to the given constraints. Furthermore, our framework can process a continuous stream of input data in real time, enabling the users to view virtualized traffic events in a virtual world as they occur. We demonstrate our reconstruction technique with both synthetic and real-world input.",
"title": "Virtualized Traffic: Reconstructing Traffic Flows from Discrete Spatiotemporal Data",
"normalizedTitle": "Virtualized Traffic: Reconstructing Traffic Flows from Discrete Spatiotemporal Data",
"fno": "ttg2011010026",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Spatiotemporal Phenomena",
"Traffic Control",
"Automated Highways",
"Data Visualization",
"Road Transportation",
"Kinematics",
"Virtual Reality",
"Urban Areas",
"Vehicle Safety",
"Kinematics And Dynamics",
"Animation",
"Virtual Reality"
],
"authors": [
{
"givenName": "Jason",
"surname": "Sewall",
"fullName": "Jason Sewall",
"affiliation": "University of North Carolina at Chapel Hill, Chapel Hill",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jur",
"surname": "van den Berg",
"fullName": "Jur van den Berg",
"affiliation": "University of California at Berkeley, Berkeley",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ming",
"surname": "Lin",
"fullName": "Ming Lin",
"affiliation": "University of North Carolina at Chapel Hill, Chapel Hill",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dinesh",
"surname": "Manocha",
"fullName": "Dinesh Manocha",
"affiliation": "University of North Carolina at Chapel Hill, Chapel Hill",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2011-01-01 00:00:00",
"pubType": "trans",
"pages": "26-37",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icicta/2008/3357/2/3357c574",
"title": "Traffic Safety Evaluation of Highway Intersection with the Use of Conflict Severity Concept",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2008/3357c574/12OmNBSBk1S",
"parentPublication": {
"id": "icicta/2008/3357/2",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2008/3357/2/3357c461",
"title": "Safety Analysis on Road Sight Distance",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2008/3357c461/12OmNs59JGH",
"parentPublication": {
"id": "icicta/2008/3357/2",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2010/4077/3/4077e045",
"title": "Research on Network Safety Operation of Highway Segment",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2010/4077e045/12OmNwMXnrS",
"parentPublication": {
"id": "proceedings/icicta/2010/4077/3",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1994/6265/1/00576243",
"title": "Towards robust automatic traffic scene analysis in real-time",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1994/00576243/12OmNyS6RLN",
"parentPublication": {
"id": "proceedings/icpr/1994/6265/1",
"title": "Proceedings of 12th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ivs/2005/8961/0/01505118",
"title": "VisionSense: an advanced lateral collision warning system",
"doi": null,
"abstractUrl": "/proceedings-article/ivs/2005/01505118/12OmNz2TCIh",
"parentPublication": {
"id": "proceedings/ivs/2005/8961/0",
"title": "2005 IEEE Intelligent Vehicles Symposium Proceedings",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cso/2012/1365/0/06274778",
"title": "Optimizing Traffic Flow on Highway with Three Consecutive On-ramps",
"doi": null,
"abstractUrl": "/proceedings-article/cso/2012/06274778/12OmNzYwc40",
"parentPublication": {
"id": "proceedings/cso/2012/1365/0",
"title": "2012 Fifth International Joint Conference on Computational Sciences and Optimization (CSO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2009/3943/0/04811021",
"title": "Virtualized Traffic: Reconstructing Traffic Flows from Discrete Spatio-Temporal Data",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2009/04811021/12OmNzZmZl5",
"parentPublication": {
"id": "proceedings/vr/2009/3943/0",
"title": "2009 IEEE Virtual Reality Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoias/2019/2662/0/266200a135",
"title": "Analysis of Traffic Congestion Reducer Agents on Multi-Lane Highway",
"doi": null,
"abstractUrl": "/proceedings-article/icoias/2019/266200a135/1c8PahCGRpK",
"parentPublication": {
"id": "proceedings/icoias/2019/2662/0",
"title": "2019 2nd International Conference on Intelligent Autonomous Systems (ICoIAS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mdm/2019/3363/0/336300a298",
"title": "Traffic Congestion Prediction by Spatiotemporal Propagation Patterns",
"doi": null,
"abstractUrl": "/proceedings-article/mdm/2019/336300a298/1ckrQodp6qk",
"parentPublication": {
"id": "proceedings/mdm/2019/3363/0",
"title": "2019 20th IEEE International Conference on Mobile Data Management (MDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-smartcity-dss/2019/2058/0/205800b526",
"title": "Stay of Interest: A Dynamic Spatiotemporal Stay Behavior Perception Method for Private Car Users",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2019/205800b526/1dPoy17CU24",
"parentPublication": {
"id": "proceedings/hpcc-smartcity-dss/2019/2058/0",
"title": "2019 IEEE 21st International Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; IEEE 5th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011010051",
"articleId": "13rRUyuegp4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011010064",
"articleId": "13rRUxZ0o1u",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgHn",
"name": "ttg2011010026s.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2011010026s.zip",
"extension": "zip",
"size": "54.3 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.