data
dict |
|---|
{
"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": "1xibZvRmYzm",
"doi": "10.1109/TVCG.2021.3114769",
"abstract": "We present a differentiable volume rendering solution that provides differentiability of all continuous parameters of the volume rendering process. This differentiable renderer is used to steer the parameters towards a setting with an optimal solution of a problem-specific objective function. We have tailored the approach to volume rendering by enforcing a constant memory footprint via analytic inversion of the blending functions. This makes it independent of the number of sampling steps through the volume and facilitates the consideration of small-scale changes. The approach forms the basis for automatic optimizations regarding external parameters of the rendering process and the volumetric density field itself. We demonstrate its use for automatic viewpoint selection using differentiable entropy as objective, and for optimizing a transfer function from rendered images of a given volume. Optimization of per-voxel densities is addressed in two different ways: First, we mimic inverse tomography and optimize a 3D density field from images using an absorption model. This simplification enables comparisons with algebraic reconstruction techniques and state-of-the-art differentiable path tracers. Second, we introduce a novel approach for tomographic reconstruction from images using an emission-absorption model with post-shading via an arbitrary transfer function.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a differentiable volume rendering solution that provides differentiability of all continuous parameters of the volume rendering process. This differentiable renderer is used to steer the parameters towards a setting with an optimal solution of a problem-specific objective function. We have tailored the approach to volume rendering by enforcing a constant memory footprint via analytic inversion of the blending functions. This makes it independent of the number of sampling steps through the volume and facilitates the consideration of small-scale changes. The approach forms the basis for automatic optimizations regarding external parameters of the rendering process and the volumetric density field itself. We demonstrate its use for automatic viewpoint selection using differentiable entropy as objective, and for optimizing a transfer function from rendered images of a given volume. Optimization of per-voxel densities is addressed in two different ways: First, we mimic inverse tomography and optimize a 3D density field from images using an absorption model. This simplification enables comparisons with algebraic reconstruction techniques and state-of-the-art differentiable path tracers. Second, we introduce a novel approach for tomographic reconstruction from images using an emission-absorption model with post-shading via an arbitrary transfer function.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a differentiable volume rendering solution that provides differentiability of all continuous parameters of the volume rendering process. This differentiable renderer is used to steer the parameters towards a setting with an optimal solution of a problem-specific objective function. We have tailored the approach to volume rendering by enforcing a constant memory footprint via analytic inversion of the blending functions. This makes it independent of the number of sampling steps through the volume and facilitates the consideration of small-scale changes. The approach forms the basis for automatic optimizations regarding external parameters of the rendering process and the volumetric density field itself. We demonstrate its use for automatic viewpoint selection using differentiable entropy as objective, and for optimizing a transfer function from rendered images of a given volume. Optimization of per-voxel densities is addressed in two different ways: First, we mimic inverse tomography and optimize a 3D density field from images using an absorption model. This simplification enables comparisons with algebraic reconstruction techniques and state-of-the-art differentiable path tracers. Second, we introduce a novel approach for tomographic reconstruction from images using an emission-absorption model with post-shading via an arbitrary transfer function.",
"title": "Differentiable Direct Volume Rendering",
"normalizedTitle": "Differentiable Direct Volume Rendering",
"fno": "09552224",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Entropy",
"Image Reconstruction",
"Ray Tracing",
"Rendering Computer Graphics",
"Transfer Functions",
"Automatic Optimizations",
"External Parameters",
"Volumetric Density Field",
"Automatic Viewpoint Selection",
"Differentiable Entropy",
"Rendered Images",
"Given Volume",
"3 D Density Field",
"Algebraic Reconstruction Techniques",
"State Of The Art Differentiable Path Tracers",
"Arbitrary Transfer Function",
"Differentiable Direct Volume Rendering",
"Differentiable Volume Rendering Solution",
"Differentiability",
"Continuous Parameters",
"Volume Rendering Process",
"Differentiable Renderer",
"Optimal Solution",
"Problem Specific Objective Function",
"Constant Memory Footprint",
"Analytic Inversion",
"Blending Functions",
"Rendering Computer Graphics",
"Optimization",
"Image Reconstruction",
"Transfer Functions",
"Solid Modeling",
"Tomography",
"Image Color Analysis",
"Differentiable Rendering",
"Direct Volume Rendering",
"Automatic Differentiation"
],
"authors": [
{
"givenName": "Sebastian",
"surname": "Weiss",
"fullName": "Sebastian Weiss",
"affiliation": "Technical University of Munich, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rüdiger",
"surname": "Westermann",
"fullName": "Rüdiger Westermann",
"affiliation": "Technical University of Munich, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "562-572",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visual/1990/2083/0/00146362",
"title": "A procedural interface for volume rendering",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1990/00146362/12OmNApLGMS",
"parentPublication": {
"id": "proceedings/visual/1990/2083/0",
"title": "1990 First IEEE Conference on Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"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/2005/2766/0/01532808",
"title": "Scale-invariant volume rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532808/12OmNyoAA5X",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061283",
"title": "Perception-Based Transparency Optimization for Direct Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061283/13rRUwIF69f",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/03/ttg2013030446",
"title": "Perceptually-Based Depth-Ordering Enhancement for Direct Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2013/03/ttg2013030446/13rRUwInvyw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2001/03/v0253",
"title": "Volume Illustration: Nonphotorealistic Rendering of Volume Models",
"doi": null,
"abstractUrl": "/journal/tg/2001/03/v0253/13rRUxbTMyH",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/04/ttg2010040548",
"title": "Local Ambient Occlusion in Direct Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2010/04/ttg2010040548/13rRUy0HYRk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/04/08316963",
"title": "A Generative Model for Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2019/04/08316963/181W9oUhqP9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200g068",
"title": "Differentiable Surface Rendering via Non-Differentiable Sampling",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200g068/1BmFpmQFMKA",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222562",
"title": "Homomorphic-Encrypted Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222562/1nTqvh6tnr2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552206",
"articleId": "1xic9jxItoI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09552900",
"articleId": "1xic6f4Sc6I",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zBayyrCS1G",
"name": "ttg202201-09552224s1-supp1-3114769.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09552224s1-supp1-3114769.mp4",
"extension": "mp4",
"size": "31 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrFTr5Y",
"title": "Nov.",
"year": "2017",
"issueNum": "11",
"idPrefix": "tc",
"pubType": "journal",
"volume": "66",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjQyoA",
"doi": "10.1109/TC.2017.2712152",
"abstract": "Gaussian Mixture Models (GMMs) are widely used in many applications such as data mining, signal processing and computer vision, for probability density modeling and soft clustering. However, the parameters of a GMM need to be estimated from data by, for example, the Expectation-Maximization algorithm for Gaussian Mixture Models (EM-GMM), which is computationally demanding. This paper presents a novel design for the EM-GMM algorithm targeting reconfigurable platforms, with five main contributions. First, a pipeline-friendly EM-GMM with diagonal covariance matrices that can easily be mapped to hardware architectures. Second, a function evaluation unit for Gaussian probability density based on fixed-point arithmetic. Third, our approach is extended to support a wide range of dimensions or/and components by fitting multiple pieces of smaller dimensions onto an FPGA chip. Fourth, we derive a cost and performance model that estimates logic resources. Fifth, our dataflow design targeting the Maxeler MPC-X2000 with a Stratix-5SGSD8 FPGA can run over 200 times faster than a 6-core Xeon E5645 processor, and over 39 times faster than a Pascal TITAN-X GPU. Our design provides a practical solution to applications for training and explores better parameters for GMMs with hundreds of millions of high dimensional input instances, for low-latency and high-performance applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Gaussian Mixture Models (GMMs) are widely used in many applications such as data mining, signal processing and computer vision, for probability density modeling and soft clustering. However, the parameters of a GMM need to be estimated from data by, for example, the Expectation-Maximization algorithm for Gaussian Mixture Models (EM-GMM), which is computationally demanding. This paper presents a novel design for the EM-GMM algorithm targeting reconfigurable platforms, with five main contributions. First, a pipeline-friendly EM-GMM with diagonal covariance matrices that can easily be mapped to hardware architectures. Second, a function evaluation unit for Gaussian probability density based on fixed-point arithmetic. Third, our approach is extended to support a wide range of dimensions or/and components by fitting multiple pieces of smaller dimensions onto an FPGA chip. Fourth, we derive a cost and performance model that estimates logic resources. Fifth, our dataflow design targeting the Maxeler MPC-X2000 with a Stratix-5SGSD8 FPGA can run over 200 times faster than a 6-core Xeon E5645 processor, and over 39 times faster than a Pascal TITAN-X GPU. Our design provides a practical solution to applications for training and explores better parameters for GMMs with hundreds of millions of high dimensional input instances, for low-latency and high-performance applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Gaussian Mixture Models (GMMs) are widely used in many applications such as data mining, signal processing and computer vision, for probability density modeling and soft clustering. However, the parameters of a GMM need to be estimated from data by, for example, the Expectation-Maximization algorithm for Gaussian Mixture Models (EM-GMM), which is computationally demanding. This paper presents a novel design for the EM-GMM algorithm targeting reconfigurable platforms, with five main contributions. First, a pipeline-friendly EM-GMM with diagonal covariance matrices that can easily be mapped to hardware architectures. Second, a function evaluation unit for Gaussian probability density based on fixed-point arithmetic. Third, our approach is extended to support a wide range of dimensions or/and components by fitting multiple pieces of smaller dimensions onto an FPGA chip. Fourth, we derive a cost and performance model that estimates logic resources. Fifth, our dataflow design targeting the Maxeler MPC-X2000 with a Stratix-5SGSD8 FPGA can run over 200 times faster than a 6-core Xeon E5645 processor, and over 39 times faster than a Pascal TITAN-X GPU. Our design provides a practical solution to applications for training and explores better parameters for GMMs with hundreds of millions of high dimensional input instances, for low-latency and high-performance applications.",
"title": "A Fully-Pipelined Hardware Design for Gaussian Mixture Models",
"normalizedTitle": "A Fully-Pipelined Hardware Design for Gaussian Mixture Models",
"fno": "07938761",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Covariance Matrices",
"Algorithm Design And Analysis",
"Hardware",
"Gaussian Mixture Model",
"Computational Modeling",
"Signal Processing Algorithms",
"Gaussian Mixture Model",
"Expectation Maximization",
"High Performance Computing",
"Data Flow Engine",
"Reconfigurable Hardware",
"Algorithms Implemented In Hardware"
],
"authors": [
{
"givenName": "Conghui",
"surname": "He",
"fullName": "Conghui He",
"affiliation": "Tsinghua University, Beijing, Shi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haohuan",
"surname": "Fu",
"fullName": "Haohuan Fu",
"affiliation": "Tsinghua University, Beijing, Shi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ce",
"surname": "Guo",
"fullName": "Ce Guo",
"affiliation": "Imperial College, Lodon, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wayne",
"surname": "Luk",
"fullName": "Wayne Luk",
"affiliation": "Imperial College, Lodon, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guangwen",
"surname": "Yang",
"fullName": "Guangwen Yang",
"affiliation": "Tsinghua University, Beijing, Shi, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2017-11-01 00:00:00",
"pubType": "trans",
"pages": "1837-1850",
"year": "2017",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icnc/2009/3736/6/3736f479",
"title": "A Novel Split and Merge EM Algorithm for Gaussian Mixture Model",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2009/3736f479/12OmNAWH9FQ",
"parentPublication": {
"id": "proceedings/icnc/2009/3736/6",
"title": "2009 Fifth International Conference on Natural Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2016/5473/0/07838000",
"title": "Gaussian Component Based Index for GMMs",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2016/07838000/12OmNAlvHTi",
"parentPublication": {
"id": "proceedings/icdm/2016/5473/0",
"title": "2016 IEEE 16th International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2012/4747/0/4747a246",
"title": "Searching Uncertain Data Represented by Non-axis Parallel Gaussian Mixture Models",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2012/4747a246/12OmNBEGYKH",
"parentPublication": {
"id": "proceedings/icde/2012/4747/0",
"title": "2012 IEEE 28th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icesssymposia/2008/3288/0/3288a441",
"title": "Frequency and Space Domain Features for Image Classification Using Gaussian Mixture Models",
"doi": null,
"abstractUrl": "/proceedings-article/icesssymposia/2008/3288a441/12OmNrkjVhj",
"parentPublication": {
"id": "proceedings/icesssymposia/2008/3288/0",
"title": "Embedded Software and Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2016/3906/0/3906a587",
"title": "Maximum Gaussian Mixture Model for Classification",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2016/3906a587/12OmNwBT1mL",
"parentPublication": {
"id": "proceedings/itme/2016/3906/0",
"title": "2016 8th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2017/3581/0/3581a704",
"title": "A Comparison Between Different Gaussian-Based Mixture Models",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2017/3581a704/12OmNwLOYWp",
"parentPublication": {
"id": "proceedings/aiccsa/2017/3581/0",
"title": "2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iita/2009/3859/2/3859b506",
"title": "A Greedy Merge Learning Algorithm for Gaussian Mixture Model",
"doi": null,
"abstractUrl": "/proceedings-article/iita/2009/3859b506/12OmNzd7bsE",
"parentPublication": {
"id": "proceedings/iita/2009/3859/2",
"title": "2009 Third International Symposium on Intelligent Information Technology Application",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2019/02/08125179",
"title": "Constructing Pathway-Based Priors within a Gaussian Mixture Model for Bayesian Regression and Classification",
"doi": null,
"abstractUrl": "/journal/tb/2019/02/08125179/13rRUxlgyag",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2018/9159/0/08594892",
"title": "LEEM: Lean Elastic EM for Gaussian Mixture Model via Bounds-Based Filtering",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2018/08594892/17D45WrVg0N",
"parentPublication": {
"id": "proceedings/icdm/2018/9159/0",
"title": "2018 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000d427",
"title": "Sliced Wasserstein Distance for Learning Gaussian Mixture Models",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000d427/17D45XwUAI2",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "07936672",
"articleId": "13rRUygT7xE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBKEyob",
"title": "January-February",
"year": "1997",
"issueNum": "01",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "17",
"label": "January-February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgs2vy",
"doi": "10.1109/38.576857",
"abstract": "We introduce a new hybrid approach to space subdivision for ray tracing. The technique builds on the efficiency of the regular grid in scenes with uniformly distributed objects. Regions of such distribution are identified and their spatial decomposition recursively improved through application of heterogeneous local and subvoxel grids. This isolates empty areas and equalizes voxel occupancy. The method outperforms the regular grid technique by a factor of 5 to 50 in compact scenes. In scenes with highly irregular distributions of objects, the acceleration factor rises to hundreds and, if the method is combined with an area interpolator, to thousands.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We introduce a new hybrid approach to space subdivision for ray tracing. The technique builds on the efficiency of the regular grid in scenes with uniformly distributed objects. Regions of such distribution are identified and their spatial decomposition recursively improved through application of heterogeneous local and subvoxel grids. This isolates empty areas and equalizes voxel occupancy. The method outperforms the regular grid technique by a factor of 5 to 50 in compact scenes. In scenes with highly irregular distributions of objects, the acceleration factor rises to hundreds and, if the method is combined with an area interpolator, to thousands.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We introduce a new hybrid approach to space subdivision for ray tracing. The technique builds on the efficiency of the regular grid in scenes with uniformly distributed objects. Regions of such distribution are identified and their spatial decomposition recursively improved through application of heterogeneous local and subvoxel grids. This isolates empty areas and equalizes voxel occupancy. The method outperforms the regular grid technique by a factor of 5 to 50 in compact scenes. In scenes with highly irregular distributions of objects, the acceleration factor rises to hundreds and, if the method is combined with an area interpolator, to thousands.",
"title": "Faster Ray Tracing Using Adaptive Grids",
"normalizedTitle": "Faster Ray Tracing Using Adaptive Grids",
"fno": "mcg1997010042",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Rendering",
"Ray Tracing",
"Space Subdivision",
"Regular Grid"
],
"authors": [
{
"givenName": "Krzysztof S.",
"surname": "Klimaszewski",
"fullName": "Krzysztof S. Klimaszewski",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas W.",
"surname": "Sederberg",
"fullName": "Thomas W. Sederberg",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "1997-01-01 00:00:00",
"pubType": "mags",
"pages": "42-51",
"year": "1997",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "mcg1997010040",
"articleId": "13rRUx0gehE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg1997010052",
"articleId": "13rRUxAASMQ",
"__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": "1I6O5QqMxQ4",
"doi": "10.1109/TVCG.2022.3219982",
"abstract": "Distributed ray tracing algorithms are widely used when rendering massive scenes, where data utilization and load balancing are the keys to improving performance. One essential observation is that rays are temporally coherent, which indicates that temporal information can be used to improve computational efficiency. In this paper, we use temporal coherence to optimize the performance of distributed ray tracing. First, we propose a temporal coherence-based scheduling algorithm to guide the task/data assignment and scheduling. Then, we propose a virtual portal structure to predict the radiance of rays based on the previous frame, and send the rays with low radiance to a precomputed simplified model for further tracing, which can dramatically reduce the traversal complexity and the overhead of network data transmission. The approach was validated on scenes of sizes up to 355 GB. Our algorithm can achieve a speedup of up to 81% compared to previous algorithms, with a very small mean squared error.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Distributed ray tracing algorithms are widely used when rendering massive scenes, where data utilization and load balancing are the keys to improving performance. One essential observation is that rays are temporally coherent, which indicates that temporal information can be used to improve computational efficiency. In this paper, we use temporal coherence to optimize the performance of distributed ray tracing. First, we propose a temporal coherence-based scheduling algorithm to guide the task/data assignment and scheduling. Then, we propose a virtual portal structure to predict the radiance of rays based on the previous frame, and send the rays with low radiance to a precomputed simplified model for further tracing, which can dramatically reduce the traversal complexity and the overhead of network data transmission. The approach was validated on scenes of sizes up to 355 GB. Our algorithm can achieve a speedup of up to 81% compared to previous algorithms, with a very small mean squared error.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Distributed ray tracing algorithms are widely used when rendering massive scenes, where data utilization and load balancing are the keys to improving performance. One essential observation is that rays are temporally coherent, which indicates that temporal information can be used to improve computational efficiency. In this paper, we use temporal coherence to optimize the performance of distributed ray tracing. First, we propose a temporal coherence-based scheduling algorithm to guide the task/data assignment and scheduling. Then, we propose a virtual portal structure to predict the radiance of rays based on the previous frame, and send the rays with low radiance to a precomputed simplified model for further tracing, which can dramatically reduce the traversal complexity and the overhead of network data transmission. The approach was validated on scenes of sizes up to 355 GB. Our algorithm can achieve a speedup of up to 81% compared to previous algorithms, with a very small mean squared error.",
"title": "Temporal Coherence-Based Distributed Ray Tracing of Massive Scenes",
"normalizedTitle": "Temporal Coherence-Based Distributed Ray Tracing of Massive Scenes",
"fno": "09940545",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Rendering Computer Graphics",
"Ray Tracing",
"Portals",
"Heuristic Algorithms",
"Dynamic Scheduling",
"Task Analysis",
"Distributed Databases",
"Computer Graphics",
"Distributed Graphics",
"Ray Tracing"
],
"authors": [
{
"givenName": "Xiang",
"surname": "Xu",
"fullName": "Xiang Xu",
"affiliation": "Shandong Key Laboratory of Blockchain Finance, Shandong University of Finance and Economics, Jinan, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lu",
"surname": "Wang",
"fullName": "Lu Wang",
"affiliation": "School of Software, Shandong University, Jinan, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Arsène",
"surname": "Pérard-Gayot",
"fullName": "Arsène Pérard-Gayot",
"affiliation": "Wētā Digital, PO Box 15208, Miramar, Wellington, New Zealand",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Richard",
"surname": "Membarth",
"fullName": "Richard Membarth",
"affiliation": "Technische Hochschule Ingolstadt (THI), Research Institute AImotion Bavaria, Ingolstadt, Bayern, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cuiyu",
"surname": "Li",
"fullName": "Cuiyu Li",
"affiliation": "Advanced Computing East China Sub-center, Suzhou, JiangSu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chenglei",
"surname": "Yang",
"fullName": "Chenglei Yang",
"affiliation": "School of Software, Shandong University, Jinan, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Philipp",
"surname": "Slusallek",
"fullName": "Philipp Slusallek",
"affiliation": "German Research Center for Artificial Intelligence (DFKI), Saarland University, Saarland Informatics Campus, Saarbrc̎cken, Saarland, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-11-01 00:00:00",
"pubType": "trans",
"pages": "1-13",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/rt/2007/1629/0/04342586",
"title": "Ray-Strips: A Compact Mesh Representation for Interactive Ray Tracing",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2007/04342586/12OmNASILFQ",
"parentPublication": {
"id": "proceedings/rt/2007/1629/0",
"title": "IEEE/ EG Symposium on Interactive Ray Tracing 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pvg/2003/2091/0/20910011",
"title": "Distributed Interactive Ray Tracing of Dynamic Scenes",
"doi": null,
"abstractUrl": "/proceedings-article/pvg/2003/20910011/12OmNBO3KjK",
"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/2008/2741/0/04634613",
"title": "Ray-specialized acceleration structures for ray tracing",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2008/04634613/12OmNBt3qlA",
"parentPublication": {
"id": "proceedings/rt/2008/2741/0",
"title": "Symposium on Interactive Ray Tracing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2013/5099/0/5099a258",
"title": "Dynamic Per Object Ray Caching Textures for Real-Time Ray Tracing",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2013/5099a258/12OmNCfAPL8",
"parentPublication": {
"id": "proceedings/sibgrapi/2013/5099/0",
"title": "2013 XXVI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rt/2006/0693/0/04061544",
"title": "RT-DEFORM: Interactive Ray Tracing of Dynamic Scenes using BVHs",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2006/04061544/12OmNwErpUk",
"parentPublication": {
"id": "proceedings/rt/2006/0693/0",
"title": "IEEE Symposium on Interactive Ray Tracing 2006",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1995/7187/0/71870027",
"title": "A Hardware Acceleration Method for Volumetric Ray Tracing",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1995/71870027/12OmNxHJ9p1",
"parentPublication": {
"id": "proceedings/ieee-vis/1995/7187/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rt/2008/2741/0/04634622",
"title": "Coherent ray tracing via stream filtering",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2008/04634622/12OmNxxdZDN",
"parentPublication": {
"id": "proceedings/rt/2008/2741/0",
"title": "Symposium on Interactive Ray Tracing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/09/06081859",
"title": "Combining Single and Packet-Ray Tracing for Arbitrary Ray Distributions on the Intel MIC Architecture",
"doi": null,
"abstractUrl": "/journal/tg/2012/09/06081859/13rRUwInvJe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1997/04/v0316",
"title": "Breadth-First Ray Tracing Utilizing Uniform Spatial Subdivision",
"doi": null,
"abstractUrl": "/journal/tg/1997/04/v0316/13rRUxBa5ne",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cecit/2021/3757/0/375700b168",
"title": "Stackless KD-Tree Traversal For Ray Tracing",
"doi": null,
"abstractUrl": "/proceedings-article/cecit/2021/375700b168/1CdEOBZgTVC",
"parentPublication": {
"id": "proceedings/cecit/2021/3757/0",
"title": "2021 2nd International Conference on Electronics, Communications and Information Technology (CECIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09939115",
"articleId": "1I1KuH1xVF6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09942350",
"articleId": "1I8NUS7Puc8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1I8NUzcFlBu",
"name": "ttg555501-09940545s1-supp1-3219982.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09940545s1-supp1-3219982.mp4",
"extension": "mp4",
"size": "19.2 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNC0PGNS",
"title": "Nov.-Dec.",
"year": "2018",
"issueNum": "06",
"idPrefix": "tb",
"pubType": "journal",
"volume": "15",
"label": "Nov.-Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45Xh13sg",
"doi": "10.1109/TCBB.2018.2858755",
"abstract": "In this article, we present a computational framework to identify “causal relationships” among super gene sets. For “causal relationships,” we refer to both stimulatory and inhibitory regulatory relationships, regardless of through direct or indirect mechanisms. For super gene sets, we refer to “pathways, annotated lists, and gene signatures,” or PAGs. To identify causal relationships among PAGs, we extend the previous work on identifying PAG-to-PAG regulatory relationships by further requiring them to be significantly enriched with gene-to-gene co-expression pairs across the two PAGs involved. This is achieved by developing a quantitative metric based on PAG-to-PAG Co-expressions (PPC), which we use to infer the likelihood that PAG-to-PAG relationships under examination are causal-either stimulatory or inhibitory. Since true causal relationships are unknown, we approximate the overall performance of inferring causal relationships with the performance of recalling known r-type PAG-to-PAG relationships from causal PAG-to-PAG inference, using a functional genomics benchmark dataset from the GEO database. We report the area-under-curve (AUC) performance for both precision and recall being 0.81. By applying our framework to a myeloid-derived suppressor cells (MDSC) dataset, we further demonstrate that this framework is effective in helping build multi-scale biomolecular systems models with new insights on regulatory and causal links for downstream biological interpretations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this article, we present a computational framework to identify “causal relationships” among super gene sets. For “causal relationships,” we refer to both stimulatory and inhibitory regulatory relationships, regardless of through direct or indirect mechanisms. For super gene sets, we refer to “pathways, annotated lists, and gene signatures,” or PAGs. To identify causal relationships among PAGs, we extend the previous work on identifying PAG-to-PAG regulatory relationships by further requiring them to be significantly enriched with gene-to-gene co-expression pairs across the two PAGs involved. This is achieved by developing a quantitative metric based on PAG-to-PAG Co-expressions (PPC), which we use to infer the likelihood that PAG-to-PAG relationships under examination are causal-either stimulatory or inhibitory. Since true causal relationships are unknown, we approximate the overall performance of inferring causal relationships with the performance of recalling known r-type PAG-to-PAG relationships from causal PAG-to-PAG inference, using a functional genomics benchmark dataset from the GEO database. We report the area-under-curve (AUC) performance for both precision and recall being 0.81. By applying our framework to a myeloid-derived suppressor cells (MDSC) dataset, we further demonstrate that this framework is effective in helping build multi-scale biomolecular systems models with new insights on regulatory and causal links for downstream biological interpretations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this article, we present a computational framework to identify “causal relationships” among super gene sets. For “causal relationships,” we refer to both stimulatory and inhibitory regulatory relationships, regardless of through direct or indirect mechanisms. For super gene sets, we refer to “pathways, annotated lists, and gene signatures,” or PAGs. To identify causal relationships among PAGs, we extend the previous work on identifying PAG-to-PAG regulatory relationships by further requiring them to be significantly enriched with gene-to-gene co-expression pairs across the two PAGs involved. This is achieved by developing a quantitative metric based on PAG-to-PAG Co-expressions (PPC), which we use to infer the likelihood that PAG-to-PAG relationships under examination are causal-either stimulatory or inhibitory. Since true causal relationships are unknown, we approximate the overall performance of inferring causal relationships with the performance of recalling known r-type PAG-to-PAG relationships from causal PAG-to-PAG inference, using a functional genomics benchmark dataset from the GEO database. We report the area-under-curve (AUC) performance for both precision and recall being 0.81. By applying our framework to a myeloid-derived suppressor cells (MDSC) dataset, we further demonstrate that this framework is effective in helping build multi-scale biomolecular systems models with new insights on regulatory and causal links for downstream biological interpretations.",
"title": "“Super Gene Set” Causal Relationship Discovery from Functional Genomics Data",
"normalizedTitle": "“Super Gene Set” Causal Relationship Discovery from Functional Genomics Data",
"fno": "08417929",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Bioinformatics",
"Cellular Biophysics",
"Genetics",
"Genomics",
"Molecular Biophysics",
"Downstream Biological Interpretations",
"Multiscale Biomolecular Systems Models",
"MDSC Dataset",
"Myeloid Derived Suppressor Cells Dataset",
"AUC",
"Area Under Curve",
"GEO Database",
"PPC",
"Annotated Lists",
"Gene Signatures",
"Pathways",
"Functional Genomics Data",
"PAG To PAG Co Expressions",
"PAG To PAG Inference",
"R Type PAG To PAG Relationships",
"Gene To Gene Co Expression Pairs",
"PAG To PAG Regulatory Relationships",
"Inhibitory Regulatory Relationships",
"Stimulatory Relationships",
"Causal Relationships",
"Super Gene Set",
"Causal Links",
"Regulatory Links",
"Systems Biology",
"Genomics",
"Bioinformatics",
"Gene Expression",
"Super Gene Set",
"Causal",
"PAG",
"Systems Biology"
],
"authors": [
{
"givenName": "Zongliang",
"surname": "Yue",
"fullName": "Zongliang Yue",
"affiliation": "University of Alabama, Birmingham, AL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael T.",
"surname": "Neylon",
"fullName": "Michael T. Neylon",
"affiliation": "School of Informatics and Computing, Indiana University, Indianapolis, IN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thanh",
"surname": "Nguyen",
"fullName": "Thanh Nguyen",
"affiliation": "University of Alabama, Birmingham, AL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Timothy",
"surname": "Ratliff",
"fullName": "Timothy Ratliff",
"affiliation": "Purdue University Center for Cancer Research, West Lafayette, IN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jake Y.",
"surname": "Chen",
"fullName": "Jake Y. Chen",
"affiliation": "University of Alabama, Birmingham, AL, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2018-11-01 00:00:00",
"pubType": "trans",
"pages": "1991-1998",
"year": "2018",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibm/2016/1611/0/07822534",
"title": "Towards constructing “Super Gene Sets” regulatory networks",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2016/07822534/12OmNBbJTpW",
"parentPublication": {
"id": "proceedings/bibm/2016/1611/0",
"title": "2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2017/6543/0/6543b525",
"title": "Integrated Theory-and Data-Driven Feature Selection in Gene Expression Data Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2017/6543b525/12OmNz61dzS",
"parentPublication": {
"id": "proceedings/icde/2017/6543/0",
"title": "2017 IEEE 33rd International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2016/01/07138595",
"title": "GeneNetFinder2: Improved Inference of Dynamic Gene Regulatory Relations with Multiple Regulators",
"doi": null,
"abstractUrl": "/journal/tb/2016/01/07138595/13rRUILc8dU",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2015/05/07065232",
"title": "An Independent Filter for Gene Set Testing Based on Spectral Enrichment",
"doi": null,
"abstractUrl": "/journal/tb/2015/05/07065232/13rRUxASuEy",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdp/2019/1644/0/08671629",
"title": "OneGenE: Regulatory Gene Network Expansion via Distributed Volunteer Computing on BOINC",
"doi": null,
"abstractUrl": "/proceedings-article/pdp/2019/08671629/18Av6Ln1L7a",
"parentPublication": {
"id": "proceedings/pdp/2019/1644/0",
"title": "2019 27th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2021/0126/0/09669808",
"title": "Gene expression analysis of known COPD loci revealed its varied levels by disease severity",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2021/09669808/1A9VFvDTb9e",
"parentPublication": {
"id": "proceedings/bibm/2021/0126/0",
"title": "2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2023/01/09709100",
"title": "Causal Gene Identification Using Non-Linear Regression-Based Independence Tests",
"doi": null,
"abstractUrl": "/journal/tb/2023/01/09709100/1AR0pckq2UU",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09995122",
"title": "Causal Discovery in Biological Data Using Directed Topological Overlap Matrix",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995122/1JC26NSycla",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09995450",
"title": "Discovering eQTL Regulatory Patterns Through eQTLMotif",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995450/1JC3lnB0cj6",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2020/6215/0/09313323",
"title": "A Review of Artificial Intelligence Applications in Bacterial Genomics",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2020/09313323/1qmghh3sqFW",
"parentPublication": {
"id": "proceedings/bibm/2020/6215/0",
"title": "2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08385176",
"articleId": "17D45XzbnJX",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08395030",
"articleId": "17D45VTRosc",
"__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": "13rRUILLkDG",
"doi": "10.1109/TVCG.2007.70578",
"abstract": "In this paper we introduce a visualization technique that provides an abstracted view of the shape and spatio-physico-chemical properties of complex molecules. Unlike existing molecular viewing methods, our approach suppresses small details to facilitate rapid comprehension, yet marks the location of significant features so they remain visible. Our approach uses a combination of filters and mesh restructuring to generate a simplified representation that conveys the overall shape and spatio-physico-chemical properties (e.g. electrostatic charge). Surface markings are then used in the place of important removed details, as well as to supply additional information. These simplified representations are amenable to display using stylized rendering algorithms to further enhance comprehension. Our initial experience suggests that our approach is particularly useful in browsing collections of large molecules and in readily making comparisons between them.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper we introduce a visualization technique that provides an abstracted view of the shape and spatio-physico-chemical properties of complex molecules. Unlike existing molecular viewing methods, our approach suppresses small details to facilitate rapid comprehension, yet marks the location of significant features so they remain visible. Our approach uses a combination of filters and mesh restructuring to generate a simplified representation that conveys the overall shape and spatio-physico-chemical properties (e.g. electrostatic charge). Surface markings are then used in the place of important removed details, as well as to supply additional information. These simplified representations are amenable to display using stylized rendering algorithms to further enhance comprehension. Our initial experience suggests that our approach is particularly useful in browsing collections of large molecules and in readily making comparisons between them.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper we introduce a visualization technique that provides an abstracted view of the shape and spatio-physico-chemical properties of complex molecules. Unlike existing molecular viewing methods, our approach suppresses small details to facilitate rapid comprehension, yet marks the location of significant features so they remain visible. Our approach uses a combination of filters and mesh restructuring to generate a simplified representation that conveys the overall shape and spatio-physico-chemical properties (e.g. electrostatic charge). Surface markings are then used in the place of important removed details, as well as to supply additional information. These simplified representations are amenable to display using stylized rendering algorithms to further enhance comprehension. Our initial experience suggests that our approach is particularly useful in browsing collections of large molecules and in readily making comparisons between them.",
"title": "Molecular Surface Abstraction",
"normalizedTitle": "Molecular Surface Abstraction",
"fno": "v1608",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Shape",
"Visualization",
"Displays",
"Proteins",
"Electrostatics",
"Surface Texture",
"Chemical Processes",
"Filters",
"Mesh Generation",
"Labeling",
"Cartographic Labeling",
"Molecular Surfaces",
"Molecular Visualization",
"Surfaces",
"Textures"
],
"authors": [
{
"givenName": "Gregory",
"surname": "Cipriano",
"fullName": "Gregory Cipriano",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Gleicher",
"fullName": "Michael Gleicher",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2007-11-01 00:00:00",
"pubType": "trans",
"pages": "1608-1615",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/biovis/2011/0003/0/095102bertini",
"title": "HiTSEE: A visualization tool for hit selection and analysis in high-throughput screening experiments",
"doi": null,
"abstractUrl": "/proceedings-article/biovis/2011/095102bertini/12OmNARRYyr",
"parentPublication": {
"id": "proceedings/biovis/2011/0003/0",
"title": "2011 IEEE Symposium on Biological Data Visualization (BioVis).",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/case/2007/1153/0/04341842",
"title": "A Compact Separation Column For Hazardous Chemicals",
"doi": null,
"abstractUrl": "/proceedings-article/case/2007/04341842/12OmNqBbHCQ",
"parentPublication": {
"id": "proceedings/case/2007/1153/0",
"title": "3rd Annual IEEE Conference on Automation Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisis/2011/4373/0/4373a541",
"title": "A Hybrid Method of Propensity Scales and Support Vector Machine in a Linear Epitope Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/cisis/2011/4373a541/12OmNxEByYY",
"parentPublication": {
"id": "proceedings/cisis/2011/4373/0",
"title": "2011 International Conference on Complex, Intelligent, and Software Intensive Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2011/4391/0/4391a201",
"title": "Exploration of Chemical Space by Molecular Morphing",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2011/4391a201/12OmNyrZLA1",
"parentPublication": {
"id": "proceedings/bibe/2011/4391/0",
"title": "2011 IEEE 11th International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2013/1309/0/06732769",
"title": "Exploring the molecular mechanism of Juan-Bi-Tang for Feng-Han-Shi-Bi syndrome in rheumatoid arthritis",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2013/06732769/12OmNzC5SDb",
"parentPublication": {
"id": "proceedings/bibm/2013/1309/0",
"title": "2013 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/caia/1991/2135/1/00120852",
"title": "Crystal and molecular structure determination through imagery",
"doi": null,
"abstractUrl": "/proceedings-article/caia/1991/00120852/12OmNzV70Ga",
"parentPublication": {
"id": "proceedings/caia/1991/2135/1",
"title": "Proceedings The Seventh IEEE Conference on Artificial Intelligence Application",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08456856",
"title": "Visualization of Large Molecular Trajectories",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08456856/17D45Xbl4Qi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1995/2568/0/01383158",
"title": "Surveying Molecular Interactions with DOT",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1995/01383158/1D881uAtMyI",
"parentPublication": {
"id": "proceedings/sc/1995/2568/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nana/2022/6131/0/613100a041",
"title": "Channel Capacity Analysis for Diffusive Molecular Communication with a Partly Covered Comprehensive Reactive Receiver",
"doi": null,
"abstractUrl": "/proceedings-article/nana/2022/613100a041/1JwPOKcUHgQ",
"parentPublication": {
"id": "proceedings/nana/2022/6131/0",
"title": "2022 International Conference on Networking and Network Applications (NaNA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2020/8128/0/812800a928",
"title": "3D Deep Learning for Biological Function Prediction from Physical Fields",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2020/812800a928/1qyxiJWhDNe",
"parentPublication": {
"id": "proceedings/3dv/2020/8128/0",
"title": "2020 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "04376206",
"articleId": "13rRUyuegh4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1616",
"articleId": "13rRUB6Sq0t",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzDvSjv",
"title": "July-September",
"year": "2002",
"issueNum": "03",
"idPrefix": "pc",
"pubType": "magazine",
"volume": "1",
"label": "July-September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjQysi",
"doi": "10.1109/MPRV.2002.1037717",
"abstract": "Labscape is a smart environment that we designed to improve the experience of people who work in a cell biology laboratory. Our goal in creating it was to simplify, laboratory work by making information available where it is needed and by collecting and organizing data where and when it is created into a formal representation that others can understand and process. By helping biologists produce a more complete record of their work with less effort, Labscape is designed to foster improved collaboration in conjunction with increased individual efficiency and satisfaction. A user-driven system, although technologically conservative, embraces a central goal of ubiquitous computing: to enhance the ability to perform domain tasks through fluid interaction with computational resources. Smart environments could soon replace the pen and paper commonly used in the laboratory setting.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Labscape is a smart environment that we designed to improve the experience of people who work in a cell biology laboratory. Our goal in creating it was to simplify, laboratory work by making information available where it is needed and by collecting and organizing data where and when it is created into a formal representation that others can understand and process. By helping biologists produce a more complete record of their work with less effort, Labscape is designed to foster improved collaboration in conjunction with increased individual efficiency and satisfaction. A user-driven system, although technologically conservative, embraces a central goal of ubiquitous computing: to enhance the ability to perform domain tasks through fluid interaction with computational resources. Smart environments could soon replace the pen and paper commonly used in the laboratory setting.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Labscape is a smart environment that we designed to improve the experience of people who work in a cell biology laboratory. Our goal in creating it was to simplify, laboratory work by making information available where it is needed and by collecting and organizing data where and when it is created into a formal representation that others can understand and process. By helping biologists produce a more complete record of their work with less effort, Labscape is designed to foster improved collaboration in conjunction with increased individual efficiency and satisfaction. A user-driven system, although technologically conservative, embraces a central goal of ubiquitous computing: to enhance the ability to perform domain tasks through fluid interaction with computational resources. Smart environments could soon replace the pen and paper commonly used in the laboratory setting.",
"title": "Labscape: a smart environment for the cell biology laboratory",
"normalizedTitle": "Labscape: a smart environment for the cell biology laboratory",
"fno": "01037717",
"hasPdf": true,
"idPrefix": "pc",
"keywords": [
"Laboratory Techniques",
"Biology Computing",
"Biochemical Procedure",
"Cell Biology",
"Labscape",
"Laboratory Work",
"Ubiquitous Computing",
"Smart Environment",
"Experimental Technologies",
"Biological Cells",
"Drugs",
"RNA",
"Laboratories",
"Ubiquitous Computing",
"Cells Biology",
"Electrokinetics",
"Organizing",
"Collaborative Work",
"Testing"
],
"authors": [],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2002-07-01 00:00:00",
"pubType": "mags",
"pages": "13,14,15,16,17,18,19,20,21",
"year": "2002",
"issn": "1536-1268",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "01037719",
"articleId": "13rRUyXKxRC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01037716",
"articleId": "13rRUxASuQ4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxb5hpz",
"title": "July",
"year": "2010",
"issueNum": "07",
"idPrefix": "tm",
"pubType": "journal",
"volume": "9",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvJY",
"doi": "10.1109/TMC.2010.44",
"abstract": "Evaluating and quantifying trust stimulates collaboration in mobile ad hoc networks (MANETs). Many existing reputation systems sharply divide the trust value into right or wrong, thus ignoring another core dimension of trust: uncertainty. As uncertainty deeply impacts a node's anticipation of others' behavior and decisions during interaction, we include uncertainty in the reputation system. Specifically, we define a new uncertainty model to directly reflect a node's confidence in the sufficiency of its past experience, and study how the collection of trust information affects uncertainty in nodes' opinions. After defining a way to reveal and compute the uncertainty in trust opinions, we exploit mobility, one of the important characteristics of MANETs, to efficiently reduce uncertainty and to speed up trust convergence. Two different categories of mobility-assisted uncertainty reduction schemes are provided: the proactive schemes exploit mobile nodes to collect and broadcast trust information to achieve trust convergence; the reactive schemes provide the mobile nodes methods to get authenticated and bring their reputation in the original region to the destination region. Both of the schemes offer a controllable trade-off between delay, cost, and uncertainty. Extensive analytical and simulation results are presented to support our uncertainty model and mobility-assisted reduction schemes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Evaluating and quantifying trust stimulates collaboration in mobile ad hoc networks (MANETs). Many existing reputation systems sharply divide the trust value into right or wrong, thus ignoring another core dimension of trust: uncertainty. As uncertainty deeply impacts a node's anticipation of others' behavior and decisions during interaction, we include uncertainty in the reputation system. Specifically, we define a new uncertainty model to directly reflect a node's confidence in the sufficiency of its past experience, and study how the collection of trust information affects uncertainty in nodes' opinions. After defining a way to reveal and compute the uncertainty in trust opinions, we exploit mobility, one of the important characteristics of MANETs, to efficiently reduce uncertainty and to speed up trust convergence. Two different categories of mobility-assisted uncertainty reduction schemes are provided: the proactive schemes exploit mobile nodes to collect and broadcast trust information to achieve trust convergence; the reactive schemes provide the mobile nodes methods to get authenticated and bring their reputation in the original region to the destination region. Both of the schemes offer a controllable trade-off between delay, cost, and uncertainty. Extensive analytical and simulation results are presented to support our uncertainty model and mobility-assisted reduction schemes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Evaluating and quantifying trust stimulates collaboration in mobile ad hoc networks (MANETs). Many existing reputation systems sharply divide the trust value into right or wrong, thus ignoring another core dimension of trust: uncertainty. As uncertainty deeply impacts a node's anticipation of others' behavior and decisions during interaction, we include uncertainty in the reputation system. Specifically, we define a new uncertainty model to directly reflect a node's confidence in the sufficiency of its past experience, and study how the collection of trust information affects uncertainty in nodes' opinions. After defining a way to reveal and compute the uncertainty in trust opinions, we exploit mobility, one of the important characteristics of MANETs, to efficiently reduce uncertainty and to speed up trust convergence. Two different categories of mobility-assisted uncertainty reduction schemes are provided: the proactive schemes exploit mobile nodes to collect and broadcast trust information to achieve trust convergence; the reactive schemes provide the mobile nodes methods to get authenticated and bring their reputation in the original region to the destination region. Both of the schemes offer a controllable trade-off between delay, cost, and uncertainty. Extensive analytical and simulation results are presented to support our uncertainty model and mobility-assisted reduction schemes.",
"title": "Uncertainty Modeling and Reduction in MANETs",
"normalizedTitle": "Uncertainty Modeling and Reduction in MANETs",
"fno": "ttm2010071035",
"hasPdf": true,
"idPrefix": "tm",
"keywords": [
"Authentication",
"Mobile Ad Hoc Networks",
"Mobility",
"Proactive",
"Reactive",
"Reputation",
"Trust",
"Uncertainty",
"Vouching"
],
"authors": [
{
"givenName": "Feng",
"surname": "Li",
"fullName": "Feng Li",
"affiliation": "Indiana University-Purdue University, Indianapolis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jie",
"surname": "Wu",
"fullName": "Jie Wu",
"affiliation": "Temple University, Philadelphia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2010-07-01 00:00:00",
"pubType": "trans",
"pages": "1035-1048",
"year": "2010",
"issn": "1536-1233",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iptc/2010/4196/0/4196a615",
"title": "E-commerce Reputation Modeling Based on Fuzzy Relation",
"doi": null,
"abstractUrl": "/proceedings-article/iptc/2010/4196a615/12OmNAqU4Wp",
"parentPublication": {
"id": "proceedings/iptc/2010/4196/0",
"title": "Intelligence Information Processing and Trusted Computing, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ares/2008/3102/0/3102a881",
"title": "A Survey on Trust and Reputation Schemes in Ad Hoc Networks",
"doi": null,
"abstractUrl": "/proceedings-article/ares/2008/3102a881/12OmNBlofSX",
"parentPublication": {
"id": "proceedings/ares/2008/3102/0",
"title": "2008 Third International Conference on Availability, Reliability and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sasow/2011/4545/0/4545a041",
"title": "The Neighbor-Trust Metric to Measure Reputation in Organic Computing Systems",
"doi": null,
"abstractUrl": "/proceedings-article/sasow/2011/4545a041/12OmNBtl1rI",
"parentPublication": {
"id": "proceedings/sasow/2011/4545/0",
"title": "Self-Adaptive and Self-Organizing Systems Workshops, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccgi/2008/3275/0/3275a137",
"title": "Getting More from Reputation Systems: A Context?Aware Reputation Framework Based on Trust Centers and Agent Lists",
"doi": null,
"abstractUrl": "/proceedings-article/iccgi/2008/3275a137/12OmNC36tPV",
"parentPublication": {
"id": "proceedings/iccgi/2008/3275/0",
"title": "Computing in the Global Information Technology, International Multi-Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcsw/2008/3173/0/3173a249",
"title": "On the Modeling of Honest Players in Reputation Systems",
"doi": null,
"abstractUrl": "/proceedings-article/icdcsw/2008/3173a249/12OmNqHItuB",
"parentPublication": {
"id": "proceedings/icdcsw/2008/3173/0",
"title": "2008 The 28th International Conference on Distributed Computing Systems Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cccm/2008/3290/1/3290a424",
"title": "Revisiting Trust and Reputation in Multi-agent Systems",
"doi": null,
"abstractUrl": "/proceedings-article/cccm/2008/3290a424/12OmNwcUjVn",
"parentPublication": {
"id": "cccm/2008/3290/1",
"title": "Computing, Communication, Control and Management, ISECS International Colloquium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcsw/2008/3173/0/3173a364",
"title": "A Novel CDS-Based Reputation Monitoring System for Wireless Sensor Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icdcsw/2008/3173a364/12OmNwwMeZ6",
"parentPublication": {
"id": "proceedings/icdcsw/2008/3173/0",
"title": "2008 The 28th International Conference on Distributed Computing Systems Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aict/2007/2843/0/28430030",
"title": "An Overview of the Interpretations of Trust and Reputation",
"doi": null,
"abstractUrl": "/proceedings-article/aict/2007/28430030/12OmNzBOhzq",
"parentPublication": {
"id": "proceedings/aict/2007/2843/0",
"title": "Advanced International Conference on Telecommunications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icie/2009/3679/1/3679a635",
"title": "A Trust Model Combining Reputation and Credential",
"doi": null,
"abstractUrl": "/proceedings-article/icie/2009/3679a635/12OmNzYwbWI",
"parentPublication": {
"id": "proceedings/icie/2009/3679/1",
"title": "2009 WASE International Conference on Information Engineering (ICIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ic/2008/04/mic2008040055",
"title": "Reputation-Oriented Trustworthy Computing in E-Commerce Environments",
"doi": null,
"abstractUrl": "/magazine/ic/2008/04/mic2008040055/13rRUwInvbc",
"parentPublication": {
"id": "mags/ic",
"title": "IEEE Internet Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttm2010071022",
"articleId": "13rRUyoPSPK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttm2010071049",
"articleId": "13rRUygT7yE",
"__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": "1ujXLzVvMs0",
"doi": "10.1109/TVCG.2021.3088339",
"abstract": "While we know that the visualization of quantifiable uncertainty impacts the confidence in insights, little is known about whether the same is true for uncertainty that originates from aspects so inherent to the data that they can only be accounted for qualitatively. Being embedded within an archaeological project, we realized how assessing such qualitative uncertainty is crucial in gaining a holistic and accurate understanding of regional spatio-temporal patterns of human settlements over millennia. We therefore investigated the impact of visualizing qualitative implicit errors on the sense-making process via a probe that deliberately represented three distinct implicit errors, i.e., differing collection methods, subjectivity of data interpretations and assumptions on temporal continuity. By analyzing the interactions of 14 archaeologists with different levels of domain expertise, we discovered that novices became more actively aware of typically overlooked data issues and domain experts became more confident of the visualization itself. We observed how participants quoted social factors to alleviate some uncertainty, while in order to minimize it they requested additional contextual <italic>breadth</italic> or <italic>depth</italic> of the data. While our visualization did not alleviate all uncertainty, we recognized how it sparked <italic>reflective meta-insights</italic> regarding methodological directions of the data. We believe our findings inform future visualizations on how to handle the complexity of implicit errors for a range of user typologies and for highly data-critical application domains such as the digital humanities.",
"abstracts": [
{
"abstractType": "Regular",
"content": "While we know that the visualization of quantifiable uncertainty impacts the confidence in insights, little is known about whether the same is true for uncertainty that originates from aspects so inherent to the data that they can only be accounted for qualitatively. Being embedded within an archaeological project, we realized how assessing such qualitative uncertainty is crucial in gaining a holistic and accurate understanding of regional spatio-temporal patterns of human settlements over millennia. We therefore investigated the impact of visualizing qualitative implicit errors on the sense-making process via a probe that deliberately represented three distinct implicit errors, i.e., differing collection methods, subjectivity of data interpretations and assumptions on temporal continuity. By analyzing the interactions of 14 archaeologists with different levels of domain expertise, we discovered that novices became more actively aware of typically overlooked data issues and domain experts became more confident of the visualization itself. We observed how participants quoted social factors to alleviate some uncertainty, while in order to minimize it they requested additional contextual <italic>breadth</italic> or <italic>depth</italic> of the data. While our visualization did not alleviate all uncertainty, we recognized how it sparked <italic>reflective meta-insights</italic> regarding methodological directions of the data. We believe our findings inform future visualizations on how to handle the complexity of implicit errors for a range of user typologies and for highly data-critical application domains such as the digital humanities.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "While we know that the visualization of quantifiable uncertainty impacts the confidence in insights, little is known about whether the same is true for uncertainty that originates from aspects so inherent to the data that they can only be accounted for qualitatively. Being embedded within an archaeological project, we realized how assessing such qualitative uncertainty is crucial in gaining a holistic and accurate understanding of regional spatio-temporal patterns of human settlements over millennia. We therefore investigated the impact of visualizing qualitative implicit errors on the sense-making process via a probe that deliberately represented three distinct implicit errors, i.e., differing collection methods, subjectivity of data interpretations and assumptions on temporal continuity. By analyzing the interactions of 14 archaeologists with different levels of domain expertise, we discovered that novices became more actively aware of typically overlooked data issues and domain experts became more confident of the visualization itself. We observed how participants quoted social factors to alleviate some uncertainty, while in order to minimize it they requested additional contextual breadth or depth of the data. While our visualization did not alleviate all uncertainty, we recognized how it sparked reflective meta-insights regarding methodological directions of the data. We believe our findings inform future visualizations on how to handle the complexity of implicit errors for a range of user typologies and for highly data-critical application domains such as the digital humanities.",
"title": "Implicit Error, Uncertainty and Confidence in Visualization: An Archaeological Case Study",
"normalizedTitle": "Implicit Error, Uncertainty and Confidence in Visualization: An Archaeological Case Study",
"fno": "09451614",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Archaeology",
"Data Mining",
"Data Visualisation",
"Decision Making",
"Human Factors",
"Information Retrieval",
"Accurate Understanding",
"Additional Contextual Breadth",
"Archaeological Case Study",
"Archaeological Project",
"Collection Methods",
"Data Interpretations",
"Distinct Implicit Errors",
"Domain Expertise",
"Domain Experts",
"Future Visualizations",
"Highly Data Critical Application",
"Holistic Understanding",
"Human Settlements",
"Implicit Error",
"Qualitative Implicit Errors",
"Qualitative Uncertainty",
"Qualitatively",
"Quantifiable Uncertainty",
"Reflective Meta Insights",
"Regional Spatio Temporal Patterns",
"Sense Making Process",
"Temporal Continuity",
"Typically Overlooked Data Issues",
"Uncertainty",
"Data Visualization",
"Cognition",
"Archeology",
"Encoding",
"Decision Making",
"Visual Analytics",
"Digital Systems",
"Data Uncertainty",
"Data Visualization",
"Implicit Error",
"Qualitative Study",
"Digital Humanities",
"Design Study",
"Archaeology"
],
"authors": [
{
"givenName": "Georgia",
"surname": "Panagiotidou",
"fullName": "Georgia Panagiotidou",
"affiliation": "RxD, KU Leuven, Leuven, Belgium",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ralf",
"surname": "Vandam",
"fullName": "Ralf Vandam",
"affiliation": "Sagalassos Archaeological Research Project, KU Leuven, Leuven, Belgium",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeroen",
"surname": "Poblome",
"fullName": "Jeroen Poblome",
"affiliation": "Sagalassos Archaeological Research Project, KU Leuven, Leuven, Belgium",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrew Vande",
"surname": "Moere",
"fullName": "Andrew Vande Moere",
"affiliation": "RxD, KU Leuven, Leuven, Belgium",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "4389-4402",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/re/2014/3031/0/06912245",
"title": "Supporting early decision-making in the presence of uncertainty",
"doi": null,
"abstractUrl": "/proceedings-article/re/2014/06912245/12OmNzICEVd",
"parentPublication": {
"id": "proceedings/re/2014/3031/0",
"title": "2014 IEEE 22nd International Requirements Engineering Conference (RE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122496",
"title": "Visual Semiotics & Uncertainty Visualization: An Empirical Study",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122496/13rRUNvyaeZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192694",
"title": "An Uncertainty-Aware Approach for Exploratory Microblog Retrieval",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192694/13rRUy2YLYy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08457476",
"title": "In Pursuit of Error: A Survey of Uncertainty Visualization Evaluation",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08457476/17D45WaTkcP",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/08/08611178",
"title": "Exploring the Sensitivity of Choropleths under Attribute Uncertainty",
"doi": null,
"abstractUrl": "/journal/tg/2020/08/08611178/17D45XvMccD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904433",
"title": "Evaluating the Use of Uncertainty Visualisations for Imputations of Data Missing At Random in Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904433/1H1gkkbe0hy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904442",
"title": "Communicating Uncertainty in Digital Humanities Visualization Research",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904442/1H1gpt871W8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805422",
"title": "Why Authors Don't Visualize Uncertainty",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805422/1cG4ylx5qbC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/04/09187994",
"title": "Uncertainty Visualization of 2D Morse Complex Ensembles Using Statistical Summary Maps",
"doi": null,
"abstractUrl": "/journal/tg/2022/04/09187994/1mXkiNpxvvq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09217952",
"title": "A Bayesian cognition approach for belief updating of correlation judgement through uncertainty visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09217952/1nL7qhcUKPe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09449973",
"articleId": "1uiiQsEsi6A",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09453114",
"articleId": "1ulCAbr1xpC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1HMOmqxeZBS",
"name": "ttg202212-09451614s1-supp2-3088339.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202212-09451614s1-supp2-3088339.pdf",
"extension": "pdf",
"size": "99 kB",
"__typename": "WebExtraType"
},
{
"id": "1HMOn4tzymI",
"name": "ttg202212-09451614s1-supp1-3088339.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202212-09451614s1-supp1-3088339.mp4",
"extension": "mp4",
"size": "176 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": "1xeSlZqOf8A",
"doi": "10.1109/TVCG.2021.3114692",
"abstract": "For many households, investing for retirement is one of the most significant decisions and is fraught with uncertainty. In a classic study in behavioral economics, Benartzi and Thaler (1999) found evidence using bar charts that investors exhibit myopic loss aversion in retirement decisions: Investors overly focus on the potential for short-term losses, leading them to invest less in riskier assets and miss out on higher long-term returns. Recently, advances in uncertainty visualizations have shown improvements in decision-making under uncertainty in a variety of tasks. In this paper, we conduct a controlled and incentivized crowdsourced experiment replicating Benartzi and Thaler (1999) and extending it to measure the effect of different uncertainty representations on myopic loss aversion. Consistent with the original study, we find evidence of myopic loss aversion with bar charts and find that participants make better investment decisions with longer evaluation periods. We also find that common uncertainty representations such as interval plots and bar charts achieve the highest mean expected returns while other uncertainty visualizations lead to poorer long-term performance and strong effects on the equity premium. Qualitative feedback further suggests that different uncertainty representations lead to visual reasoning heuristics that can either mitigate or encourage a focus on potential short-term losses. We discuss implications of our results on using uncertainty visualizations for retirement decisions in practice and possible extensions for future work.",
"abstracts": [
{
"abstractType": "Regular",
"content": "For many households, investing for retirement is one of the most significant decisions and is fraught with uncertainty. In a classic study in behavioral economics, Benartzi and Thaler (1999) found evidence using bar charts that investors exhibit myopic loss aversion in retirement decisions: Investors overly focus on the potential for short-term losses, leading them to invest less in riskier assets and miss out on higher long-term returns. Recently, advances in uncertainty visualizations have shown improvements in decision-making under uncertainty in a variety of tasks. In this paper, we conduct a controlled and incentivized crowdsourced experiment replicating Benartzi and Thaler (1999) and extending it to measure the effect of different uncertainty representations on myopic loss aversion. Consistent with the original study, we find evidence of myopic loss aversion with bar charts and find that participants make better investment decisions with longer evaluation periods. We also find that common uncertainty representations such as interval plots and bar charts achieve the highest mean expected returns while other uncertainty visualizations lead to poorer long-term performance and strong effects on the equity premium. Qualitative feedback further suggests that different uncertainty representations lead to visual reasoning heuristics that can either mitigate or encourage a focus on potential short-term losses. We discuss implications of our results on using uncertainty visualizations for retirement decisions in practice and possible extensions for future work.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "For many households, investing for retirement is one of the most significant decisions and is fraught with uncertainty. In a classic study in behavioral economics, Benartzi and Thaler (1999) found evidence using bar charts that investors exhibit myopic loss aversion in retirement decisions: Investors overly focus on the potential for short-term losses, leading them to invest less in riskier assets and miss out on higher long-term returns. Recently, advances in uncertainty visualizations have shown improvements in decision-making under uncertainty in a variety of tasks. In this paper, we conduct a controlled and incentivized crowdsourced experiment replicating Benartzi and Thaler (1999) and extending it to measure the effect of different uncertainty representations on myopic loss aversion. Consistent with the original study, we find evidence of myopic loss aversion with bar charts and find that participants make better investment decisions with longer evaluation periods. We also find that common uncertainty representations such as interval plots and bar charts achieve the highest mean expected returns while other uncertainty visualizations lead to poorer long-term performance and strong effects on the equity premium. Qualitative feedback further suggests that different uncertainty representations lead to visual reasoning heuristics that can either mitigate or encourage a focus on potential short-term losses. We discuss implications of our results on using uncertainty visualizations for retirement decisions in practice and possible extensions for future work.",
"title": "Effect of uncertainty visualizations on myopic loss aversion and the equity premium puzzle in retirement investment decisions",
"normalizedTitle": "Effect of uncertainty visualizations on myopic loss aversion and the equity premium puzzle in retirement investment decisions",
"fno": "09548797",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Decision Making",
"Economics",
"Investment",
"Risk Analysis",
"Stock Markets",
"Uncertainty Visualizations",
"Myopic Loss Aversion",
"Retirement Investment Decisions",
"Significant Decisions",
"Thaler",
"Bar Charts",
"Retirement Decisions",
"Short Term Losses",
"Long Term Returns",
"Decision Making",
"Different Uncertainty Representations",
"Common Uncertainty Representations",
"Uncertainty",
"Retirement",
"Visualization",
"Investment",
"Resource Management",
"Economics",
"Bars",
"Uncertainty Visualizations",
"Myopic Loss Aversion",
"Retirement Investing",
"Equity Premium Puzzle"
],
"authors": [
{
"givenName": "Ryan",
"surname": "Wesslen",
"fullName": "Ryan Wesslen",
"affiliation": "UNC-Charlotte, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alireza",
"surname": "Karduni",
"fullName": "Alireza Karduni",
"affiliation": "UNC-Charlotte, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Douglas",
"surname": "Markant",
"fullName": "Douglas Markant",
"affiliation": "UNC-Charlotte, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wenwen",
"surname": "Dou",
"fullName": "Wenwen Dou",
"affiliation": "UNC-Charlotte, United States",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "454-464",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cso/2014/5372/0/5372a074",
"title": "Incentive Mechanism for University Teachers under Multi-task Principal-Agent Model",
"doi": null,
"abstractUrl": "/proceedings-article/cso/2014/5372a074/12OmNAObbGy",
"parentPublication": {
"id": "proceedings/cso/2014/5372/0",
"title": "2014 Seventh International Joint Conference on Computational Sciences and Optimization (CSO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2013/4892/0/4892e166",
"title": "Technology Investment Decision-Making under Uncertainty: The Case of Mobile Payment Systems",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2013/4892e166/12OmNBNM8O6",
"parentPublication": {
"id": "proceedings/hicss/2013/4892/0",
"title": "2013 46th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2013/5004/0/5004a633",
"title": "Economic Evaluation of EOR Project Based on Options Differential Equation Method",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2013/5004a633/12OmNrHSD6e",
"parentPublication": {
"id": "proceedings/iccis/2013/5004/0",
"title": "2013 International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdataservice/2015/8128/0/8128a341",
"title": "Inferring Risk Aversion for Decentralized Investment Portfolios",
"doi": null,
"abstractUrl": "/proceedings-article/bigdataservice/2015/8128a341/12OmNvSbByl",
"parentPublication": {
"id": "proceedings/bigdataservice/2015/8128/0",
"title": "2015 IEEE First International Conference on Big Data Computing Service and Applications (BigDataService)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2015/7367/0/7367b240",
"title": "Multi-criteria Decision Support for Investment Decisions: Examining the Interactive Effects of Risk Profile, Information Horizon, and Prospect Format",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2015/7367b240/12OmNyuPLbD",
"parentPublication": {
"id": "proceedings/hicss/2015/7367/0",
"title": "2015 48th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bife/2012/4750/0/4750a274",
"title": "A jump-diffusion approach to modelling software security investment",
"doi": null,
"abstractUrl": "/proceedings-article/bife/2012/4750a274/12OmNz2TCDN",
"parentPublication": {
"id": "proceedings/bife/2012/4750/0",
"title": "2012 Fifth International Conference on Business Intelligence and Financial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2015/09/07056447",
"title": "Non-Myopic Adaptive Route Planning in Uncertain Congestion Environments",
"doi": null,
"abstractUrl": "/journal/tk/2015/09/07056447/13rRUxASuGK",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/sp/2010/01/msp2010010053",
"title": "The Iterated Weakest Link",
"doi": null,
"abstractUrl": "/magazine/sp/2010/01/msp2010010053/13rRUxNEqU3",
"parentPublication": {
"id": "mags/sp",
"title": "IEEE Security & Privacy",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2007/2755/0/04076421",
"title": "Advice Availability and Gender Differences in Risky Decision Making: A Study of Online Retirement Planning",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2007/04076421/17D45XacGjM",
"parentPublication": {
"id": "proceedings/hicss/2007/2755/0",
"title": "2007 40th Annual Hawaii International Conference on System Sciences (HICSS'07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552205",
"title": "Visualization Equilibrium",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552205/1xic4zmtlra",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552465",
"articleId": "1xic9toQQrC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09552205",
"articleId": "1xic4zmtlra",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zHDGBp9S6c",
"name": "ttg202201-09548797s1-tvcg-3114692-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09548797s1-tvcg-3114692-mm.zip",
"extension": "zip",
"size": "129 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx7ouTK",
"title": "Nov.",
"year": "2013",
"issueNum": "11",
"idPrefix": "tk",
"pubType": "journal",
"volume": "25",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIM2VHo",
"doi": "10.1109/TKDE.2012.204",
"abstract": "We consider the problem of ordinal classification with monotonicity constraints. It differs from usual classification by handling background knowledge about ordered classes, ordered domains of attributes, and about a monotonic relationship between an evaluation of an object on the attributes and its class assignment. In other words, the class label (output variable) should not decrease when attribute values (input variables) increase. Although this problem is of great practical importance, it has received relatively low attention in machine learning. Among existing approaches to learning with monotonicity constraints, the most general is the nonparametric approach, where no other assumption is made apart from the monotonicity constraints assumption. The main contribution of this paper is the analysis of the nonparametric approach from statistical point of view. To this end, we first provide a statistical framework for classification with monotonicity constraints. Then, we focus on learning in the nonparametric setting, and we consider two approaches: the \"plug-in\" method (classification by estimating first the class conditional distribution) and the direct method (classification by minimization of the empirical risk). We show that these two methods are very closely related. We also perform a thorough theoretical analysis of their statistical and computational properties, confirmed in a computational experiment.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We consider the problem of ordinal classification with monotonicity constraints. It differs from usual classification by handling background knowledge about ordered classes, ordered domains of attributes, and about a monotonic relationship between an evaluation of an object on the attributes and its class assignment. In other words, the class label (output variable) should not decrease when attribute values (input variables) increase. Although this problem is of great practical importance, it has received relatively low attention in machine learning. Among existing approaches to learning with monotonicity constraints, the most general is the nonparametric approach, where no other assumption is made apart from the monotonicity constraints assumption. The main contribution of this paper is the analysis of the nonparametric approach from statistical point of view. To this end, we first provide a statistical framework for classification with monotonicity constraints. Then, we focus on learning in the nonparametric setting, and we consider two approaches: the \"plug-in\" method (classification by estimating first the class conditional distribution) and the direct method (classification by minimization of the empirical risk). We show that these two methods are very closely related. We also perform a thorough theoretical analysis of their statistical and computational properties, confirmed in a computational experiment.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We consider the problem of ordinal classification with monotonicity constraints. It differs from usual classification by handling background knowledge about ordered classes, ordered domains of attributes, and about a monotonic relationship between an evaluation of an object on the attributes and its class assignment. In other words, the class label (output variable) should not decrease when attribute values (input variables) increase. Although this problem is of great practical importance, it has received relatively low attention in machine learning. Among existing approaches to learning with monotonicity constraints, the most general is the nonparametric approach, where no other assumption is made apart from the monotonicity constraints assumption. The main contribution of this paper is the analysis of the nonparametric approach from statistical point of view. To this end, we first provide a statistical framework for classification with monotonicity constraints. Then, we focus on learning in the nonparametric setting, and we consider two approaches: the \"plug-in\" method (classification by estimating first the class conditional distribution) and the direct method (classification by minimization of the empirical risk). We show that these two methods are very closely related. We also perform a thorough theoretical analysis of their statistical and computational properties, confirmed in a computational experiment.",
"title": "On Nonparametric Ordinal Classification with Monotonicity Constraints",
"normalizedTitle": "On Nonparametric Ordinal Classification with Monotonicity Constraints",
"fno": "ttk2013112576",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Vectors",
"Probability Distribution",
"Loss Measurement",
"Input Variables",
"Training",
"Minimization",
"Machine Learning",
"Monotone Functions",
"Machine Learning",
"Monotonicity Constraints",
"Ordinal Classification",
"Ordinal Regression",
"Preference Learning",
"Nonparametric Methods",
"Isotonic Regression",
"Isotonic Classification"
],
"authors": [
{
"givenName": "Wojciech",
"surname": "Kotlowski",
"fullName": "Wojciech Kotlowski",
"affiliation": "Poznan University of Technology, Poznan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Roman",
"surname": "Slowinski",
"fullName": "Roman Slowinski",
"affiliation": "Poznan University of Technology, Poznan and Polish Academy of Sciences, Warsaw",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2013-11-01 00:00:00",
"pubType": "trans",
"pages": "2576-2589",
"year": "2013",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdmw/2017/3800/0/3800a288",
"title": "Pruning and Nonparametric Multiple Change Point Detection",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2017/3800a288/12OmNApu5Hj",
"parentPublication": {
"id": "proceedings/icdmw/2017/3800/0",
"title": "2017 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1994/6270/2/00576878",
"title": "Nonparametric classification using radial basis function nets and empirical risk minimization",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1994/00576878/12OmNqyUUJv",
"parentPublication": {
"id": "proceedings/icpr/1994/6270/2",
"title": "Proceedings of 12th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2004/2128/3/212830414",
"title": "Supervised Nonparametric Information Theoretic Classification",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2004/212830414/12OmNvpew4l",
"parentPublication": {
"id": "proceedings/icpr/2004/2128/3",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2009/11/ttp2009112093",
"title": "FINE: Fisher Information Nonparametric Embedding",
"doi": null,
"abstractUrl": "/journal/tp/2009/11/ttp2009112093/13rRUwwsltR",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2009/07/ttp2009071153",
"title": "Classification Based on Hybridization of Parametric and Nonparametric Classifiers",
"doi": null,
"abstractUrl": "/journal/tp/2009/07/ttp2009071153/13rRUxASuOg",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1977/04/01674849",
"title": "A Recursive Partitioning Decision Rule for Nonparametric Classification",
"doi": null,
"abstractUrl": "/journal/tc/1977/04/01674849/13rRUxBrGfw",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2017/07/07534828",
"title": "A Novel Nonparametric Maximum Likelihood Estimator for Probability Density Functions",
"doi": null,
"abstractUrl": "/journal/tp/2017/07/07534828/13rRUxZRbpm",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1997/06/i0667",
"title": "On Dimensionality, Sample Size, and Classification Error of Nonparametric Linear Classification Algorithms",
"doi": null,
"abstractUrl": "/journal/tp/1997/06/i0667/13rRUxjQyig",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2019/4284/0/428400a300",
"title": "Learning Bayesian Networks Parameters via Monotonicity Constraints",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2019/428400a300/1hQqLE9Scda",
"parentPublication": {
"id": "proceedings/icicta/2019/4284/0",
"title": "2019 12th International Conference on Intelligent Computation Technology and Automation (ICICTA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09224194",
"title": "Direct Volume Rendering with Nonparametric Models of Uncertainty",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09224194/1nV71j9G3yo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttk2013112564",
"articleId": "13rRUxAASWj",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttk2013112590",
"articleId": "13rRUxly8XV",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet5b",
"name": "ttk2013112576s1.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttk2013112576s1.pdf",
"extension": "pdf",
"size": "127 kB",
"__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": "1nTrrxWmyqs",
"doi": "10.1109/TVCG.2020.3030466",
"abstract": "In this paper, we introduce uncertainty to continuous scatterplots and continuous parallel coordinates. We derive respective models, validate them with sampling-based brute-force schemes, and present acceleration strategies for their computation. At the same time, we show that our approach lends itself as well for introducing uncertainty into the definition of fibers in bivariate data. Finally, we demonstrate the properties and the utility of our approach using specifically designed synthetic cases and simulated data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we introduce uncertainty to continuous scatterplots and continuous parallel coordinates. We derive respective models, validate them with sampling-based brute-force schemes, and present acceleration strategies for their computation. At the same time, we show that our approach lends itself as well for introducing uncertainty into the definition of fibers in bivariate data. Finally, we demonstrate the properties and the utility of our approach using specifically designed synthetic cases and simulated data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we introduce uncertainty to continuous scatterplots and continuous parallel coordinates. We derive respective models, validate them with sampling-based brute-force schemes, and present acceleration strategies for their computation. At the same time, we show that our approach lends itself as well for introducing uncertainty into the definition of fibers in bivariate data. Finally, we demonstrate the properties and the utility of our approach using specifically designed synthetic cases and simulated data.",
"title": "Uncertainty in Continuous Scatterplots, Continuous Parallel Coordinates, and Fibers",
"normalizedTitle": "Uncertainty in Continuous Scatterplots, Continuous Parallel Coordinates, and Fibers",
"fno": "09222253",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Continuous Scatterplots",
"Continuous Parallel Coordinates",
"Sampling Based Brute Force Schemes",
"Bivariate Data",
"Respective Models",
"Simulated Data",
"Multivariate Data Visualization",
"Uncertainty",
"Two Dimensional Displays",
"Mathematical Model",
"Data Visualization",
"Geometry",
"Acceleration",
"Gaussian Distribution",
"Multivariate Data",
"Uncertainty Visualization",
"Uncertain Continuous Scatterplots",
"Uncertain Continuous Parallel Coordinates",
"Uncertain Fibers"
],
"authors": [
{
"givenName": "Boyan",
"surname": "Zheng",
"fullName": "Boyan Zheng",
"affiliation": "Heidelberg University, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Filip",
"surname": "Sadlo",
"fullName": "Filip Sadlo",
"affiliation": "Heidelberg University, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "1819-1828",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2018/1424/0/142401a106",
"title": "Modeling and Visualization of Uncertainty-Aware Geometry Using Multi-variate Normal Distributions",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2018/142401a106/12OmNBO3Kc8",
"parentPublication": {
"id": "proceedings/pacificvis/2018/1424/0",
"title": "2018 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061531",
"title": "Continuous Parallel Coordinates",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061531/13rRUxZRbnX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011121912",
"title": "Features in Continuous Parallel Coordinates",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011121912/13rRUyYBlgy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061428",
"title": "Continuous Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061428/13rRUyYjK5e",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903471",
"title": "Fiber Uncertainty Visualization for Bivariate Data With Parametric and Nonparametric Noise Models",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903471/1GZolxWTqPS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904433",
"title": "Evaluating the Use of Uncertainty Visualisations for Imputations of Data Missing At Random in Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904433/1H1gkkbe0hy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800f709",
"title": "Data Uncertainty Learning in Face Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800f709/1m3oi0v3Wbm",
"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/02/09224194",
"title": "Direct Volume Rendering with Nonparametric Models of Uncertainty",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09224194/1nV71j9G3yo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2021/3864/0/09428421",
"title": "Intra-Class Uncertainty Loss Function For Classification",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2021/09428421/1uilGWcermM",
"parentPublication": {
"id": "proceedings/icme/2021/3864/0",
"title": "2021 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2021/0019/0/09597425",
"title": "Estimating continuous affect with label uncertainty",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2021/09597425/1yylaKqSpH2",
"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": "09222092",
"articleId": "1nTqGJRtSIU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09222295",
"articleId": "1nTqtC45a12",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNANBZko",
"title": "Jan.-Feb.",
"year": "2013",
"issueNum": "01",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "33",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwcAquB",
"doi": "10.1109/MCG.2013.14",
"abstract": "As dataset size and complexity steadily increase, uncertainty is becoming an important data aspect. So, today's visualizations need to incorporate indications of uncertainty. However, characterizing uncertainty for visualization isn't always straightforward. Entropy, in the information-theoretic sense, can be a measure for uncertainty in categorical datasets. The authors discuss the mathematical formulation, interpretation, and use of entropy in visualizations. This research aims to demonstrate entropy as a metric and expand the vocabulary of uncertainty measures for visualization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As dataset size and complexity steadily increase, uncertainty is becoming an important data aspect. So, today's visualizations need to incorporate indications of uncertainty. However, characterizing uncertainty for visualization isn't always straightforward. Entropy, in the information-theoretic sense, can be a measure for uncertainty in categorical datasets. The authors discuss the mathematical formulation, interpretation, and use of entropy in visualizations. This research aims to demonstrate entropy as a metric and expand the vocabulary of uncertainty measures for visualization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As dataset size and complexity steadily increase, uncertainty is becoming an important data aspect. So, today's visualizations need to incorporate indications of uncertainty. However, characterizing uncertainty for visualization isn't always straightforward. Entropy, in the information-theoretic sense, can be a measure for uncertainty in categorical datasets. The authors discuss the mathematical formulation, interpretation, and use of entropy in visualizations. This research aims to demonstrate entropy as a metric and expand the vocabulary of uncertainty measures for visualization.",
"title": "Visualization of Uncertainty without a Mean",
"normalizedTitle": "Visualization of Uncertainty without a Mean",
"fno": "mcg2013010075",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Entropy",
"Data Visualization",
"Uncertainty",
"Image Color Analysis",
"Measurement Uncertainty",
"Magnetic Resonance Imaging",
"Visualization",
"Color Mapping",
"Entropy",
"Data Visualization",
"Uncertainty",
"Image Color Analysis",
"Measurement Uncertainty",
"Magnetic Resonance Imaging",
"Visualization",
"Computer Graphics",
"Uncertainty",
"Entropy",
"Volume Rendering"
],
"authors": [
{
"givenName": "K.",
"surname": "Potter",
"fullName": "K. Potter",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "S.",
"surname": "Gerber",
"fullName": "S. Gerber",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "E. W.",
"surname": "Anderson",
"fullName": "E. W. Anderson",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2013-01-01 00:00:00",
"pubType": "mags",
"pages": "75-79",
"year": "2013",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-infovis/2002/1751/0/17510037",
"title": "Visualizing Data with Bounded Uncertainty",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2002/17510037/12OmNrFkeWk",
"parentPublication": {
"id": "proceedings/ieee-infovis/2002/1751/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061209",
"title": "A User Study to Compare Four Uncertainty Visualization Methods for 1D and 2D Datasets",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061209/13rRUxcsYLI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/01/ttg2008010061",
"title": "A Spreadsheet Approach to Facilitate Visualization of Uncertainty in Information",
"doi": null,
"abstractUrl": "/journal/tg/2008/01/ttg2008010061/13rRUxlgy3x",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/lt/2015/03/07058341",
"title": "Uncertainty Representation in Visualizations of Learning Analytics for Learners: Current Approaches and Opportunities",
"doi": null,
"abstractUrl": "/journal/lt/2015/03/07058341/13rRUygT7pf",
"parentPublication": {
"id": "trans/lt",
"title": "IEEE Transactions on Learning Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08457476",
"title": "In Pursuit of Error: A Survey of Uncertainty Visualization Evaluation",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08457476/17D45WaTkcP",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904442",
"title": "Communicating Uncertainty in Digital Humanities Visualization Research",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904442/1H1gpt871W8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2022/4609/0/460900a626",
"title": "Unsupervised DeepView: Global Uncertainty Visualization for High Dimensional Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2022/460900a626/1KBr5pVl2qA",
"parentPublication": {
"id": "proceedings/icdmw/2022/4609/0",
"title": "2022 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805422",
"title": "Why Authors Don't Visualize Uncertainty",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805422/1cG4ylx5qbC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/04/09187994",
"title": "Uncertainty Visualization of 2D Morse Complex Ensembles Using Statistical Summary Maps",
"doi": null,
"abstractUrl": "/journal/tg/2022/04/09187994/1mXkiNpxvvq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2021/3335/0/333500a106",
"title": "Uncertainty Visualization of the Marching Squares and Marching Cubes Topology Cases",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2021/333500a106/1yXucf3VjxK",
"parentPublication": {
"id": "proceedings/vis/2021/3335/0",
"title": "2021 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2013010070",
"articleId": "13rRUwwslyH",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2013010080",
"articleId": "13rRUB6SpUH",
"__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": "17D45WaTkcP",
"doi": "10.1109/TVCG.2018.2864889",
"abstract": "Understanding and accounting for uncertainty is critical to effectively reasoning about visualized data. However, evaluating the impact of an uncertainty visualization is complex due to the difficulties that people have interpreting uncertainty and the challenge of defining correct behavior with uncertainty information. Currently, evaluators of uncertainty visualization must rely on general purpose visualization evaluation frameworks which can be ill-equipped to provide guidance with the unique difficulties of assessing judgments under uncertainty. To help evaluators navigate these complexities, we present a taxonomy for characterizing decisions made in designing an evaluation of an uncertainty visualization. Our taxonomy differentiates six levels of decisions that comprise an uncertainty visualization evaluation: the behavioral targets of the study, expected effects from an uncertainty visualization, evaluation goals, measures, elicitation techniques, and analysis approaches. Applying our taxonomy to 86 user studies of uncertainty visualizations, we find that existing evaluation practice, particularly in visualization research, focuses on Performance and Satisfaction-based measures that assume more predictable and statistically-driven judgment behavior than is suggested by research on human judgment and decision making. We reflect on common themes in evaluation practice concerning the interpretation and semantics of uncertainty, the use of confidence reporting, and a bias toward evaluating performance as accuracy rather than decision quality. We conclude with a concrete set of recommendations for evaluators designed to reduce the mismatch between the conceptualization of uncertainty in visualization versus other fields.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Understanding and accounting for uncertainty is critical to effectively reasoning about visualized data. However, evaluating the impact of an uncertainty visualization is complex due to the difficulties that people have interpreting uncertainty and the challenge of defining correct behavior with uncertainty information. Currently, evaluators of uncertainty visualization must rely on general purpose visualization evaluation frameworks which can be ill-equipped to provide guidance with the unique difficulties of assessing judgments under uncertainty. To help evaluators navigate these complexities, we present a taxonomy for characterizing decisions made in designing an evaluation of an uncertainty visualization. Our taxonomy differentiates six levels of decisions that comprise an uncertainty visualization evaluation: the behavioral targets of the study, expected effects from an uncertainty visualization, evaluation goals, measures, elicitation techniques, and analysis approaches. Applying our taxonomy to 86 user studies of uncertainty visualizations, we find that existing evaluation practice, particularly in visualization research, focuses on Performance and Satisfaction-based measures that assume more predictable and statistically-driven judgment behavior than is suggested by research on human judgment and decision making. We reflect on common themes in evaluation practice concerning the interpretation and semantics of uncertainty, the use of confidence reporting, and a bias toward evaluating performance as accuracy rather than decision quality. We conclude with a concrete set of recommendations for evaluators designed to reduce the mismatch between the conceptualization of uncertainty in visualization versus other fields.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Understanding and accounting for uncertainty is critical to effectively reasoning about visualized data. However, evaluating the impact of an uncertainty visualization is complex due to the difficulties that people have interpreting uncertainty and the challenge of defining correct behavior with uncertainty information. Currently, evaluators of uncertainty visualization must rely on general purpose visualization evaluation frameworks which can be ill-equipped to provide guidance with the unique difficulties of assessing judgments under uncertainty. To help evaluators navigate these complexities, we present a taxonomy for characterizing decisions made in designing an evaluation of an uncertainty visualization. Our taxonomy differentiates six levels of decisions that comprise an uncertainty visualization evaluation: the behavioral targets of the study, expected effects from an uncertainty visualization, evaluation goals, measures, elicitation techniques, and analysis approaches. Applying our taxonomy to 86 user studies of uncertainty visualizations, we find that existing evaluation practice, particularly in visualization research, focuses on Performance and Satisfaction-based measures that assume more predictable and statistically-driven judgment behavior than is suggested by research on human judgment and decision making. We reflect on common themes in evaluation practice concerning the interpretation and semantics of uncertainty, the use of confidence reporting, and a bias toward evaluating performance as accuracy rather than decision quality. We conclude with a concrete set of recommendations for evaluators designed to reduce the mismatch between the conceptualization of uncertainty in visualization versus other fields.",
"title": "In Pursuit of Error: A Survey of Uncertainty Visualization Evaluation",
"normalizedTitle": "In Pursuit of Error: A Survey of Uncertainty Visualization Evaluation",
"fno": "08457476",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Decision Making",
"Probability",
"Statistical Analysis",
"Uncertainty Visualization Evaluation",
"Visualized Data",
"Uncertainty Information",
"Visualization Evaluation Frameworks",
"Taxonomy",
"Statistically Driven Judgment Behavior",
"Human Judgment",
"Decision Making",
"Probability Distribution",
"Uncertainty",
"Visualization",
"Taxonomy",
"Data Visualization",
"Task Analysis",
"Measurement Uncertainty",
"Decision Making",
"Uncertainty Visualization",
"User Study",
"Subjective Confidence",
"Probability Distribution"
],
"authors": [
{
"givenName": "Jessica",
"surname": "Hullman",
"fullName": "Jessica Hullman",
"affiliation": "Northwestern University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaoli",
"surname": "Qiao",
"fullName": "Xiaoli Qiao",
"affiliation": "University of Washington",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Correll",
"fullName": "Michael Correll",
"affiliation": "Tableau Software",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alex",
"surname": "Kale",
"fullName": "Alex Kale",
"affiliation": "University of Washington",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matthew",
"surname": "Kay",
"fullName": "Matthew Kay",
"affiliation": "University of Michigan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "903-913",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2020/02/08476234",
"title": "A Task-Based Taxonomy of Cognitive Biases for Information Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2020/02/08476234/13WBGLOgq3z",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2013/01/mcg2013010075",
"title": "Visualization of Uncertainty without a Mean",
"doi": null,
"abstractUrl": "/magazine/cg/2013/01/mcg2013010075/13rRUwcAquB",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/01/ttg2008010061",
"title": "A Spreadsheet Approach to Facilitate Visualization of Uncertainty in Information",
"doi": null,
"abstractUrl": "/journal/tg/2008/01/ttg2008010061/13rRUxlgy3x",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904442",
"title": "Communicating Uncertainty in Digital Humanities Visualization Research",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904442/1H1gpt871W8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2022/4609/0/460900a626",
"title": "Unsupervised DeepView: Global Uncertainty Visualization for High Dimensional Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2022/460900a626/1KBr5pVl2qA",
"parentPublication": {
"id": "proceedings/icdmw/2022/4609/0",
"title": "2022 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aivr/2022/5725/0/572500a109",
"title": "Visualization of Machine Learning Uncertainty in AR-Based See-Through Applications",
"doi": null,
"abstractUrl": "/proceedings-article/aivr/2022/572500a109/1KmFcUFPF3G",
"parentPublication": {
"id": "proceedings/aivr/2022/5725/0",
"title": "2022 IEEE International Conference on Artificial Intelligence and Virtual Reality (AIVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805422",
"title": "Why Authors Don't Visualize Uncertainty",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805422/1cG4ylx5qbC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2021/3931/0/393100a041",
"title": "Visualising Temporal Uncertainty: A Taxonomy and Call for Systematic Evaluation",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2021/393100a041/1tTtqZZkSzu",
"parentPublication": {
"id": "proceedings/pacificvis/2021/3931/0",
"title": "2021 IEEE 14th Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09451614",
"title": "Implicit Error, Uncertainty and Confidence in Visualization: An Archaeological Case Study",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09451614/1ujXLzVvMs0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis4dh/2021/1370/0/137000a012",
"title": "Uncertainty-aware Topic Modeling Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vis4dh/2021/137000a012/1yNiG9yU9JS",
"parentPublication": {
"id": "proceedings/vis4dh/2021/1370/0",
"title": "2021 IEEE 6th Workshop on Visualization for the Digital Humanities (VIS4DH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440816",
"articleId": "17D45Xh13so",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440857",
"articleId": "17D45WZZ7Gl",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgE2",
"name": "ttg201901-08457476s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08457476s1.zip",
"extension": "zip",
"size": "2.81 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBhpS2I",
"title": "Nov.-Dec.",
"year": "2018",
"issueNum": "06",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "38",
"label": "Nov.-Dec.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45Wuc32C",
"doi": "10.1109/MCG.2018.2878900",
"abstract": "For the past two years, researchers from the visualization community and the digital humanities have come together at the IEEE VIS conference to discuss how both disciplines can work together to push research goals in their respective disciplines. In this paper, we present our experiences as a result of this collaboration.",
"abstracts": [
{
"abstractType": "Regular",
"content": "For the past two years, researchers from the visualization community and the digital humanities have come together at the IEEE VIS conference to discuss how both disciplines can work together to push research goals in their respective disciplines. In this paper, we present our experiences as a result of this collaboration.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "For the past two years, researchers from the visualization community and the digital humanities have come together at the IEEE VIS conference to discuss how both disciplines can work together to push research goals in their respective disciplines. In this paper, we present our experiences as a result of this collaboration.",
"title": "Visualization and the Digital Humanities:",
"normalizedTitle": "Visualization and the Digital Humanities:",
"fno": "08617736",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Visualization",
"Conferences",
"Collaboration",
"Scholarships",
"Organizations",
"Complexity Theory",
"Visualization"
],
"authors": [
{
"givenName": "Adam James",
"surname": "Bradley",
"fullName": "Adam James Bradley",
"affiliation": "University of Ontario Institute of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mennatallah",
"surname": "El-Assady",
"fullName": "Mennatallah El-Assady",
"affiliation": "University of Konstanz",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Katharine",
"surname": "Coles",
"fullName": "Katharine Coles",
"affiliation": "University of Utah",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eric",
"surname": "Alexander",
"fullName": "Eric Alexander",
"affiliation": "Carleton College",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Min",
"surname": "Chen",
"fullName": "Min Chen",
"affiliation": "University of Oxford",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christopher",
"surname": "Collins",
"fullName": "Christopher Collins",
"affiliation": "University of Ontario Institute of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefan",
"surname": "Janicke",
"fullName": "Stefan Janicke",
"affiliation": "Leipzig University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David Joseph",
"surname": "Wrisley",
"fullName": "David Joseph Wrisley",
"affiliation": "New York University Abu Dhabi",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2018-11-01 00:00:00",
"pubType": "mags",
"pages": "26-38",
"year": "2018",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2010/7846/0/05571256",
"title": "From Data Realism to Dada Aggregations: Visualizations in Digital Art, Humanities and Popular Culture",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2010/05571256/12OmNCxbXKy",
"parentPublication": {
"id": "proceedings/iv/2010/7846/0",
"title": "2010 14th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e-science/2009/5946/0/05407979",
"title": "Classifying the (digital) arts and humanities",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2009/05407979/12OmNrAv3OV",
"parentPublication": {
"id": "proceedings/e-science/2009/5946/0",
"title": "2009 5th IEEE International Conference on e-Science Workshops (e-science 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/culture-computing/2013/5047/0/5047a196",
"title": "Improving User Control and Transparency in the Digital Humanities",
"doi": null,
"abstractUrl": "/proceedings-article/culture-computing/2013/5047a196/12OmNylKAPW",
"parentPublication": {
"id": "proceedings/culture-computing/2013/5047/0",
"title": "2013 International Conference on Culture and Computing (Culture Computing)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e-science/2009/5340/0/3877a001",
"title": "Alfalab: Construction and Deconstruction of a Digital Humanities Experiment",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2009/3877a001/12OmNyv7mdO",
"parentPublication": {
"id": "proceedings/e-science/2009/5340/0",
"title": "2009 5th IEEE International Conference on e-Science (e-Science 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e-science/2006/2734/0/04031109",
"title": "The Arts and Humanities e-Science Initiative in the UK",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2006/04031109/12OmNz6iOBK",
"parentPublication": {
"id": "proceedings/e-science/2006/2734/0",
"title": "2006 Second IEEE International Conference on e-Science and Grid Computing (e-Science'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e-science/2010/8957/0/05693895",
"title": "Humanities e-Science: From Systematic Investigations to Institutional Infrastructures",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2010/05693895/12OmNzyp5Wz",
"parentPublication": {
"id": "proceedings/e-science/2010/8957/0",
"title": "E-Science 2010. 6th IEEE International Conference on E-Science (E-Science 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904442",
"title": "Communicating Uncertainty in Digital Humanities Visualization Research",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904442/1H1gpt871W8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/jcdl/2019/1547/0/154700a138",
"title": "Modeling Digital Humanities Collections as Research Objects",
"doi": null,
"abstractUrl": "/proceedings-article/jcdl/2019/154700a138/1ckrF3hMFyM",
"parentPublication": {
"id": "proceedings/jcdl/2019/1547/0",
"title": "2019 ACM/IEEE Joint Conference on Digital Libraries (JCDL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2020/03/08999515",
"title": "A Data-Driven Introduction to Authors, Readings, and Techniques in Visualization for the Digital Humanities",
"doi": null,
"abstractUrl": "/magazine/cg/2020/03/08999515/1hpPHQ3jV7i",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis4dh/2020/9153/0/915300a024",
"title": "Pilaster: A Collection of Citation Metadata Extracted From Publications on Visualization for the Digital Humanities",
"doi": null,
"abstractUrl": "/proceedings-article/vis4dh/2020/915300a024/1pZ0XhtNffW",
"parentPublication": {
"id": "proceedings/vis4dh/2020/9153/0",
"title": "2020 IEEE 5th Workshop on Visualization for the Digital Humanities (VIS4DH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08617762",
"articleId": "17D45WaTkjP",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08617747",
"articleId": "17D45VsBTUS",
"__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": "1nTrGyTQ0Pm",
"doi": "10.1109/TVCG.2020.3030426",
"abstract": "Information visualization (infovis) is a powerful tool for exploring rich datasets. Within humanistic research, rich qualitative data and domain culture make traditional infovis approaches appear reductive and disconnected, leading to low adoption. In this paper, we use a multi-step approach to scrutinize the relationship between infovis and the humanities and suggest new directions for it. We first look into infovis from the humanistic perspective by exploring the humanistic literature around infovis. We validate and expand those findings though a co-design workshop with humanist and infovis experts. Then, we translate our findings into guidelines for designers and conduct a design critique exercise to explore their effect on the perception of humanist researchers. Based on these steps, we introduce Layers of Meaning, a framework to reduce the semantic distance between humanist researchers and visualizations of their research material, by grounding infovis tools in time and space, physicality, terminology, nuance, and provenance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Information visualization (infovis) is a powerful tool for exploring rich datasets. Within humanistic research, rich qualitative data and domain culture make traditional infovis approaches appear reductive and disconnected, leading to low adoption. In this paper, we use a multi-step approach to scrutinize the relationship between infovis and the humanities and suggest new directions for it. We first look into infovis from the humanistic perspective by exploring the humanistic literature around infovis. We validate and expand those findings though a co-design workshop with humanist and infovis experts. Then, we translate our findings into guidelines for designers and conduct a design critique exercise to explore their effect on the perception of humanist researchers. Based on these steps, we introduce Layers of Meaning, a framework to reduce the semantic distance between humanist researchers and visualizations of their research material, by grounding infovis tools in time and space, physicality, terminology, nuance, and provenance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Information visualization (infovis) is a powerful tool for exploring rich datasets. Within humanistic research, rich qualitative data and domain culture make traditional infovis approaches appear reductive and disconnected, leading to low adoption. In this paper, we use a multi-step approach to scrutinize the relationship between infovis and the humanities and suggest new directions for it. We first look into infovis from the humanistic perspective by exploring the humanistic literature around infovis. We validate and expand those findings though a co-design workshop with humanist and infovis experts. Then, we translate our findings into guidelines for designers and conduct a design critique exercise to explore their effect on the perception of humanist researchers. Based on these steps, we introduce Layers of Meaning, a framework to reduce the semantic distance between humanist researchers and visualizations of their research material, by grounding infovis tools in time and space, physicality, terminology, nuance, and provenance.",
"title": "Introducing Layers of Meaning (LoM): A Framework to Reduce Semantic Distance of Visualization In Humanistic Research",
"normalizedTitle": "Introducing Layers of Meaning (LoM): A Framework to Reduce Semantic Distance of Visualization In Humanistic Research",
"fno": "09222293",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Humanities",
"Humanistic Perspective",
"Humanistic Literature",
"Humanist Researchers",
"Infovis Tools",
"Humanistic Research",
"Information Visualization",
"Qualitative Data",
"Domain Culture",
"Multistep Approach",
"Semantic Distance Reduction",
"Humanities",
"Design Critique Exercise",
"Layers Of Meaning Framework",
"Lo M Framework",
"Research Material",
"Tools",
"Data Visualization",
"Conferences",
"Task Analysis",
"Guidelines",
"Collaboration",
"Semantics",
"Infovis",
"Humanities",
"Digital Humanities"
],
"authors": [
{
"givenName": "Houda",
"surname": "Lamqaddam",
"fullName": "Houda Lamqaddam",
"affiliation": "KU Leuven, Belgium",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrew",
"surname": "Vande Moere",
"fullName": "Andrew Vande Moere",
"affiliation": "KU Leuven, Belgium",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vero",
"surname": "Vanden Abeele",
"fullName": "Vero Vanden Abeele",
"affiliation": "KU Leuven, Belgium",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Koenraad",
"surname": "Brosens",
"fullName": "Koenraad Brosens",
"affiliation": "KU Leuven, Belgium",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Katrien",
"surname": "Verbert",
"fullName": "Katrien Verbert",
"affiliation": "KU Leuven, Belgium",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "1084-1094",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cts/2006/0/0/01644162",
"title": "ConferenceXP and Advanced Collaborative Scenarios",
"doi": null,
"abstractUrl": "/proceedings-article/cts/2006/01644162/12OmNqIzgXb",
"parentPublication": {
"id": "proceedings/cts/2006/0/0",
"title": "International Symposium on Collaborative Technologies and Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icws/2018/7247/0/724701a363",
"title": "Extinguishing the Backfire Effect: Using Emotions in Online Social Collaborative Argumentation for Fact Checking",
"doi": null,
"abstractUrl": "/proceedings-article/icws/2018/724701a363/13rRUx0xPQk",
"parentPublication": {
"id": "proceedings/icws/2018/7247/0",
"title": "2018 IEEE International Conference on Web Services (ICWS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/09/09337213",
"title": "VIS30K: A Collection of Figures and Tables From IEEE Visualization Conference Publications",
"doi": null,
"abstractUrl": "/journal/tg/2021/09/09337213/1qJqUNl4cIo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wetice/2020/6975/0/697500a235",
"title": "Web2Touch 2020–21 : Semantic Technologies for Smart Information Sharing and Web Collaboration",
"doi": null,
"abstractUrl": "/proceedings-article/wetice/2020/697500a235/1qRP02IGyZ2",
"parentPublication": {
"id": "proceedings/wetice/2020/6975/0",
"title": "2020 IEEE 29th International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2020/9012/0/901200a211",
"title": "Interactive Knowledge Graph Attention Network for Recommender Systems",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2020/901200a211/1rgGgRw3E8E",
"parentPublication": {
"id": "proceedings/icdmw/2020/9012/0",
"title": "2020 International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/chase/2021/1409/0/140900a109",
"title": "Qualitatively Analyzing PR Rejection Reasons from Conversations in Open-Source Projects",
"doi": null,
"abstractUrl": "/proceedings-article/chase/2021/140900a109/1tB7tcs7gwU",
"parentPublication": {
"id": "proceedings/chase/2021/1409/0/",
"title": "2021 IEEE/ACM 13th International Workshop on Cooperative and Human Aspects of Software Engineering (CHASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2021/3864/0/09428164",
"title": "Distance Restricted Transformer Encoder for Multi-Label Classification",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2021/09428164/1uilNgRqUk8",
"parentPublication": {
"id": "proceedings/icme/2021/3864/0",
"title": "2021 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2021/0477/0/047700c219",
"title": "StacMR: Scene-Text Aware Cross-Modal Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2021/047700c219/1uqGFaeiXnO",
"parentPublication": {
"id": "proceedings/wacv/2021/0477/0",
"title": "2021 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09238508",
"articleId": "1oa15KNUtGg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09229242",
"articleId": "1o3nvQqSIQ8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyvY9o8",
"title": "April",
"year": "2013",
"issueNum": "04",
"idPrefix": "tk",
"pubType": "journal",
"volume": "25",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvgziV",
"doi": "10.1109/TKDE.2011.229",
"abstract": "Skyline query processing for location-based services, which considers both spatial and nonspatial attributes of the objects being queried, has recently received increasing attention. Existing solutions focus on solving point- or line-based skyline queries, in which the query location is an exact location point or a line segment. However, due to privacy concerns and limited precision of localization devices, the input of a user location is often a spatial range. This paper studies a new problem of how to process such range-based skyline queries. Two novel algorithms are proposed: one is index-based (I-SKY) and the other is not based on any index (N-SKY). To handle frequent movements of the objects being queried, we also propose incremental versions of I-SKY and N-SKY, which avoid recomputing the query index and results from scratch. Additionally, we develop efficient solutions for probabilistic and continuous range-based skyline queries. Experimental results show that our proposed algorithms well outperform the baseline algorithm that adopts the existing line-based skyline solution. Moreover, the incremental versions of I-SKY and N-SKY save substantial computation cost, especially when the objects move frequently.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Skyline query processing for location-based services, which considers both spatial and nonspatial attributes of the objects being queried, has recently received increasing attention. Existing solutions focus on solving point- or line-based skyline queries, in which the query location is an exact location point or a line segment. However, due to privacy concerns and limited precision of localization devices, the input of a user location is often a spatial range. This paper studies a new problem of how to process such range-based skyline queries. Two novel algorithms are proposed: one is index-based (I-SKY) and the other is not based on any index (N-SKY). To handle frequent movements of the objects being queried, we also propose incremental versions of I-SKY and N-SKY, which avoid recomputing the query index and results from scratch. Additionally, we develop efficient solutions for probabilistic and continuous range-based skyline queries. Experimental results show that our proposed algorithms well outperform the baseline algorithm that adopts the existing line-based skyline solution. Moreover, the incremental versions of I-SKY and N-SKY save substantial computation cost, especially when the objects move frequently.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Skyline query processing for location-based services, which considers both spatial and nonspatial attributes of the objects being queried, has recently received increasing attention. Existing solutions focus on solving point- or line-based skyline queries, in which the query location is an exact location point or a line segment. However, due to privacy concerns and limited precision of localization devices, the input of a user location is often a spatial range. This paper studies a new problem of how to process such range-based skyline queries. Two novel algorithms are proposed: one is index-based (I-SKY) and the other is not based on any index (N-SKY). To handle frequent movements of the objects being queried, we also propose incremental versions of I-SKY and N-SKY, which avoid recomputing the query index and results from scratch. Additionally, we develop efficient solutions for probabilistic and continuous range-based skyline queries. Experimental results show that our proposed algorithms well outperform the baseline algorithm that adopts the existing line-based skyline solution. Moreover, the incremental versions of I-SKY and N-SKY save substantial computation cost, especially when the objects move frequently.",
"title": "Range-Based Skyline Queries in Mobile Environments",
"normalizedTitle": "Range-Based Skyline Queries in Mobile Environments",
"fno": "ttk2013040835",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Indexes",
"Heuristic Algorithms",
"Query Processing",
"Mobile Communication",
"Probabilistic Logic",
"Search Problems",
"Privacy",
"Moving Objects",
"Location Based Services",
"Query Processing",
"Skyline Queries"
],
"authors": [
{
"givenName": "Xin",
"surname": "Lin",
"fullName": "Xin Lin",
"affiliation": "East China Normal University, Shanghai and Hong Kong Baptist University, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jianliang",
"surname": "Xu",
"fullName": "Jianliang Xu",
"affiliation": "Hong Kong Baptist University, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haibo",
"surname": "Hu",
"fullName": "Haibo Hu",
"affiliation": "Hong Kong Baptist University, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2013-04-01 00:00:00",
"pubType": "trans",
"pages": "835-849",
"year": "2013",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/nswctc/2009/3610/1/3610a391",
"title": "Location-Based Skyline Queries in Wireless Sensor Networks",
"doi": null,
"abstractUrl": "/proceedings-article/nswctc/2009/3610a391/12OmNAY79eN",
"parentPublication": {
"id": "proceedings/nswctc/2009/3610/1",
"title": "Networks Security, Wireless Communications and Trusted Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apweb/2010/4012/0/4012a358",
"title": "Skyline Minimum Vector",
"doi": null,
"abstractUrl": "/proceedings-article/apweb/2010/4012a358/12OmNC17hTE",
"parentPublication": {
"id": "proceedings/apweb/2010/4012/0",
"title": "Conference, International Asia-Pacific Web",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2009/3545/0/3545b036",
"title": "Online Interval Skyline Queries on Time Series",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2009/3545b036/12OmNqBbHF6",
"parentPublication": {
"id": "proceedings/icde/2009/3545/0",
"title": "2009 IEEE 25th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2012/4893/0/4893a215",
"title": "Skyline Queries for Spatial Objects: A Method for Selecting Spatial Objects Based on Surrounding Environments",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2012/4893a215/12OmNvnwVlP",
"parentPublication": {
"id": "proceedings/icnc/2012/4893/0",
"title": "2012 Third International Conference on Networking and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mvhi/2010/4009/0/4009a499",
"title": "Privacy-Preserving Skyline Queries in LBS",
"doi": null,
"abstractUrl": "/proceedings-article/mvhi/2010/4009a499/12OmNxGj9YR",
"parentPublication": {
"id": "proceedings/mvhi/2010/4009/0",
"title": "Machine Vision and Human-machine Interface, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csa/2008/3428/0/3428a353",
"title": "Processing Continuous Skyline Queries in Road Networks",
"doi": null,
"abstractUrl": "/proceedings-article/csa/2008/3428a353/12OmNyfdOYq",
"parentPublication": {
"id": "proceedings/csa/2008/3428/0",
"title": "2008 International Symposium on Computer Science and its Applications (CSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wisa/2010/4193/0/4193a003",
"title": "Location-Dependent Skyline Query Processing in Mobile Databases",
"doi": null,
"abstractUrl": "/proceedings-article/wisa/2010/4193a003/12OmNzsrwcO",
"parentPublication": {
"id": "proceedings/wisa/2010/4193/0",
"title": "Web Information Systems and Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2013/04/ttk2013040945",
"title": "U-Skyline: A New Skyline Query for Uncertain Databases",
"doi": null,
"abstractUrl": "/journal/tk/2013/04/ttk2013040945/13rRUwIF6lv",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2010/12/ttk2010121694",
"title": "Efficient Routing of Subspace Skyline Queries over Highly Distributed Data",
"doi": null,
"abstractUrl": "/journal/tk/2010/12/ttk2010121694/13rRUwInuWM",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2011/07/ttk2011070991",
"title": "Flexible and Efficient Resolution of Skyline Query Size Constraints",
"doi": null,
"abstractUrl": "/journal/tk/2011/07/ttk2011070991/13rRUxOdD8A",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttk2013040820",
"articleId": "13rRUytWF9G",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttk2013040850",
"articleId": "13rRUwInvJI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRFh",
"name": "ttk2013040835s1.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttk2013040835s1.pdf",
"extension": "pdf",
"size": "230 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNASILLk",
"title": "March",
"year": "2009",
"issueNum": "03",
"idPrefix": "tk",
"pubType": "journal",
"volume": "21",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyueghx",
"doi": "10.1109/TKDE.2008.146",
"abstract": "Skyline query is of great importance in many applications, such as multi-criteria decision making and business planning. In particular, a skyline point is a data object in the database whose attribute vector is not dominated by that of any other objects. Previous methods to retrieve skyline points usually assume static data objects in the database (i.e. their attribute vectors are fixed), whereas several recent work focus on skyline queries with dynamic attributes. In this paper, we propose a novel variant of skyline queries, namely metric skyline, whose dynamic attributes are defined in the metric space (i.e. not limited to the Euclidean space). We illustrate an efficient and effective pruning mechanism to answer metric skyline queries through a metric index. Most importantly, we formalize the query performance of the metric skyline query in terms of the pruning power, by a cost model, in light of which we construct an optimized metric index aiming to maximize the pruning power of metric skyline queries. Extensive experiments have demonstrated the efficiency and effectiveness of our proposed pruning techniques as well as the constructed index in answering metric skyline queries.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Skyline query is of great importance in many applications, such as multi-criteria decision making and business planning. In particular, a skyline point is a data object in the database whose attribute vector is not dominated by that of any other objects. Previous methods to retrieve skyline points usually assume static data objects in the database (i.e. their attribute vectors are fixed), whereas several recent work focus on skyline queries with dynamic attributes. In this paper, we propose a novel variant of skyline queries, namely metric skyline, whose dynamic attributes are defined in the metric space (i.e. not limited to the Euclidean space). We illustrate an efficient and effective pruning mechanism to answer metric skyline queries through a metric index. Most importantly, we formalize the query performance of the metric skyline query in terms of the pruning power, by a cost model, in light of which we construct an optimized metric index aiming to maximize the pruning power of metric skyline queries. Extensive experiments have demonstrated the efficiency and effectiveness of our proposed pruning techniques as well as the constructed index in answering metric skyline queries.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Skyline query is of great importance in many applications, such as multi-criteria decision making and business planning. In particular, a skyline point is a data object in the database whose attribute vector is not dominated by that of any other objects. Previous methods to retrieve skyline points usually assume static data objects in the database (i.e. their attribute vectors are fixed), whereas several recent work focus on skyline queries with dynamic attributes. In this paper, we propose a novel variant of skyline queries, namely metric skyline, whose dynamic attributes are defined in the metric space (i.e. not limited to the Euclidean space). We illustrate an efficient and effective pruning mechanism to answer metric skyline queries through a metric index. Most importantly, we formalize the query performance of the metric skyline query in terms of the pruning power, by a cost model, in light of which we construct an optimized metric index aiming to maximize the pruning power of metric skyline queries. Extensive experiments have demonstrated the efficiency and effectiveness of our proposed pruning techniques as well as the constructed index in answering metric skyline queries.",
"title": "Efficient Processing of Metric Skyline Queries",
"normalizedTitle": "Efficient Processing of Metric Skyline Queries",
"fno": "ttk2009030351",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Query Processing",
"Multimedia Databases",
"Indexing Methods"
],
"authors": [
{
"givenName": "Lei",
"surname": "Chen",
"fullName": "Lei Chen",
"affiliation": "Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiang",
"surname": "Lian",
"fullName": "Xiang Lian",
"affiliation": "Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2009-03-01 00:00:00",
"pubType": "trans",
"pages": "351-365",
"year": "2009",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ssdbm/2007/2868/0/28680012",
"title": "On Efficient Processing of Subspace Skyline Queries on High Dimensional Data",
"doi": null,
"abstractUrl": "/proceedings-article/ssdbm/2007/28680012/12OmNxveNO5",
"parentPublication": {
"id": "proceedings/ssdbm/2007/2868/0",
"title": "Scientific and Statistical Database Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gmc/2010/9001/0/05634617",
"title": "An efficient method for processing reverse skyline queries",
"doi": null,
"abstractUrl": "/proceedings-article/gmc/2010/05634617/12OmNyaGeF9",
"parentPublication": {
"id": "proceedings/gmc/2010/9001/0",
"title": "2010 Global Mobile Congress (GMC 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgc/2012/3027/0/06382907",
"title": "A Partitioned-Based Method of Convex Skyline for Efficient Processing Top-k Queries",
"doi": null,
"abstractUrl": "/proceedings-article/cgc/2012/06382907/12OmNzDvShi",
"parentPublication": {
"id": "proceedings/cgc/2012/3027/0",
"title": "2012 International Conference on Cloud and Green Computing (CGC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2013/04/ttk2013040835",
"title": "Range-Based Skyline Queries in Mobile Environments",
"doi": null,
"abstractUrl": "/journal/tk/2013/04/ttk2013040835/13rRUNvgziV",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2013/04/ttk2013040945",
"title": "U-Skyline: A New Skyline Query for Uncertain Databases",
"doi": null,
"abstractUrl": "/journal/tk/2013/04/ttk2013040945/13rRUwIF6lv",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2018/10/08302507",
"title": "Efficient Parallel Skyline Query Processing for High-Dimensional Data",
"doi": null,
"abstractUrl": "/journal/tk/2018/10/08302507/13xI8AOXccT",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2018/5520/0/552000a653",
"title": "Skyline Diagram: Finding the Voronoi Counterpart for Skyline Queries",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2018/552000a653/14Fq0VFPGar",
"parentPublication": {
"id": "proceedings/icde/2018/5520/0",
"title": "2018 IEEE 34th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/05/09714833",
"title": "ProbSky: Efficient Computation of Probabilistic Skyline Queries Over Distributed Data",
"doi": null,
"abstractUrl": "/journal/tk/2023/05/09714833/1B2CRAQcvok",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2019/7474/0/747400c113",
"title": "Efficient Parallel Skyline Query Processing for High-Dimensional Data",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2019/747400c113/1aDT2u6GCxq",
"parentPublication": {
"id": "proceedings/icde/2019/7474/0",
"title": "2019 IEEE 35th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2020/1924/0/192400a299",
"title": "Morph-Skyline: Virtual Ontology-Based Data Access for Skyline Queries",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2020/192400a299/1uHhgYXYNLa",
"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": "ttk2009030335",
"articleId": "13rRUwInvJE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttk2009030366",
"articleId": "13rRUxASuMR",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1I6No9Att7y",
"title": "Dec.",
"year": "2022",
"issueNum": "12",
"idPrefix": "tk",
"pubType": "journal",
"volume": "34",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1rqztmHtpjW",
"doi": "10.1109/TKDE.2021.3060757",
"abstract": "Increasingly, individuals and companies adopt a cloud service provider as a primary data and IT infrastructure platform. The remote access of the data inevitably brings the issue of trust. Data encryption is necessary to keep sensitive information secure and private on the cloud. Yet adversaries can still learn valuable information regarding encrypted data by observing data access patterns. To solve such problem, Oblivious RAMs (ORAMs) are proposed to completely hide access patterns. However, most ORAM constructions are expensive and not suitable to deploy in a database for supporting query processing over large data. Furthermore, an ORAM processes queries <italic>synchronously</italic>, hence, does not provide high throughput for <italic>concurrent query processing</italic>. In this article, we design a practical <italic>oblivious query processing framework</italic> to enable efficient query processing over a cloud database. In particular, we focus on processing multiple range and <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>NN queries <italic>asynchronously and concurrently with high throughput</italic>. The key idea is to integrate indices into ORAM which leverages a suite of optimization techniques (e.g., oblivious batch processing and caching). The effectiveness and efficiency of our oblivious query processing framework is demonstrated through extensive evaluations over large datasets. Our construction shows an order of magnitude speedup in comparison with other baselines.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Increasingly, individuals and companies adopt a cloud service provider as a primary data and IT infrastructure platform. The remote access of the data inevitably brings the issue of trust. Data encryption is necessary to keep sensitive information secure and private on the cloud. Yet adversaries can still learn valuable information regarding encrypted data by observing data access patterns. To solve such problem, Oblivious RAMs (ORAMs) are proposed to completely hide access patterns. However, most ORAM constructions are expensive and not suitable to deploy in a database for supporting query processing over large data. Furthermore, an ORAM processes queries <italic>synchronously</italic>, hence, does not provide high throughput for <italic>concurrent query processing</italic>. In this article, we design a practical <italic>oblivious query processing framework</italic> to enable efficient query processing over a cloud database. In particular, we focus on processing multiple range and <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"chang-ieq1-3060757.gif\"/></alternatives></inline-formula>NN queries <italic>asynchronously and concurrently with high throughput</italic>. The key idea is to integrate indices into ORAM which leverages a suite of optimization techniques (e.g., oblivious batch processing and caching). The effectiveness and efficiency of our oblivious query processing framework is demonstrated through extensive evaluations over large datasets. Our construction shows an order of magnitude speedup in comparison with other baselines.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Increasingly, individuals and companies adopt a cloud service provider as a primary data and IT infrastructure platform. The remote access of the data inevitably brings the issue of trust. Data encryption is necessary to keep sensitive information secure and private on the cloud. Yet adversaries can still learn valuable information regarding encrypted data by observing data access patterns. To solve such problem, Oblivious RAMs (ORAMs) are proposed to completely hide access patterns. However, most ORAM constructions are expensive and not suitable to deploy in a database for supporting query processing over large data. Furthermore, an ORAM processes queries synchronously, hence, does not provide high throughput for concurrent query processing. In this article, we design a practical oblivious query processing framework to enable efficient query processing over a cloud database. In particular, we focus on processing multiple range and -NN queries asynchronously and concurrently with high throughput. The key idea is to integrate indices into ORAM which leverages a suite of optimization techniques (e.g., oblivious batch processing and caching). The effectiveness and efficiency of our oblivious query processing framework is demonstrated through extensive evaluations over large datasets. Our construction shows an order of magnitude speedup in comparison with other baselines.",
"title": "Efficient Oblivious Query Processing for Range and kNN Queries",
"normalizedTitle": "Efficient Oblivious Query Processing for Range and kNN Queries",
"fno": "09360469",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Cloud Computing",
"Cryptography",
"Query Processing",
"Cloud Database",
"Cloud Service Provider",
"Concurrent Query Processing",
"Data Access Patterns",
"Data Encryption",
"Efficient Oblivious Query Processing",
"Efficient Query",
"Encrypted Data",
"Infrastructure Platform",
"K NN Queries",
"Multiple Range",
"Oblivious Batch Processing",
"Oblivious RA Ms",
"ORAM Constructions",
"Practical Oblivious Query Processing Framework",
"Primary Data",
"Remote Access",
"Servers",
"Query Processing",
"Databases",
"Throughput",
"Indexes",
"Concurrent Computing",
"Protocols",
"Data Privacy",
"Oblivious RAM",
"Oblivious Query Processing",
"range and <named-content xmlns:xlink=\"http://www.w3.org/1999/xlink\" xmlns:ali=\"http://www.niso.org/schemas/ali/1.0/\" xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" content-type=\"math\" xlink:type=\"simple\"> <inline-formula> <tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math> </inline-formula> </named-content>NN query"
],
"authors": [
{
"givenName": "Zhao",
"surname": "Chang",
"fullName": "Zhao Chang",
"affiliation": "School of Computer Science and Technology, Xidian University, Xi'an, Shaanxi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dong",
"surname": "Xie",
"fullName": "Dong Xie",
"affiliation": "School of Electrical Engineering and Computer Science, The Pennsylvania State University, University Park, PA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Feifei",
"surname": "Li",
"fullName": "Feifei Li",
"affiliation": "Alibaba Group, Hangzhou, Zhejiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeff M.",
"surname": "Phillips",
"fullName": "Jeff M. Phillips",
"affiliation": "School of Computing, University of Utah, Salt Lake City, UT, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rajeev",
"surname": "Balasubramonian",
"fullName": "Rajeev Balasubramonian",
"affiliation": "School of Computing, University of Utah, Salt Lake City, UT, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "5741-5754",
"year": "2022",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sp/2016/0824/0/0824a198",
"title": "TaoStore: Overcoming Asynchronicity in Oblivious Data Storage",
"doi": null,
"abstractUrl": "/proceedings-article/sp/2016/0824a198/12OmNA0MZ4n",
"parentPublication": {
"id": "proceedings/sp/2016/0824/0",
"title": "2016 IEEE Symposium on Security and Privacy (SP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2017/6543/0/6543b377",
"title": "Understanding the Security Challenges of Oblivious Cloud Storage with Asynchronous Accesses",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2017/6543b377/12OmNClQ0Aa",
"parentPublication": {
"id": "proceedings/icde/2017/6543/0",
"title": "2017 IEEE 33rd International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom-bigdatase/2018/4388/0/438801a397",
"title": "A Practical Accountability Scheme for Oblivious RAM in Cloud Storage",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom-bigdatase/2018/438801a397/17D45WrVgd7",
"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": "trans/cc/2021/02/08519627",
"title": "Efficient Oblivious Data Structures for Database Services on the Cloud",
"doi": null,
"abstractUrl": "/journal/cc/2021/02/08519627/17D45Wuc3al",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/cc/5555/01/09772342",
"title": "An Efficient Oblivious Random Data Access Scheme in Cloud Computing",
"doi": null,
"abstractUrl": "/journal/cc/5555/01/09772342/1DgjuMxl9a8",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2022/0883/0/088300b487",
"title": "Efficient and Oblivious Query Processing for Range and kNN Queries (Extended Abstract)",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2022/088300b487/1FwFewDhETC",
"parentPublication": {
"id": "proceedings/icde/2022/0883/0",
"title": "2022 IEEE 38th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/5555/01/10032622",
"title": "Tianji: Securing A Practical Asynchronous Multi-User ORAM",
"doi": null,
"abstractUrl": "/journal/tq/5555/01/10032622/1KnSwOy3LmE",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2019/7474/0/747400a626",
"title": "ServeDB: Secure, Verifiable, and Efficient Range Queries on Outsourced Database",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2019/747400a626/1aDSTKhhiG4",
"parentPublication": {
"id": "proceedings/icde/2019/7474/0",
"title": "2019 IEEE 35th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpca/2020/6149/0/614900a369",
"title": "Multi-Range Supported Oblivious RAM for Efficient Block Data Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/hpca/2020/614900a369/1j9wthSwA3S",
"parentPublication": {
"id": "proceedings/hpca/2020/6149/0",
"title": "2020 IEEE International Symposium on High Performance Computer Architecture (HPCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2022/02/09141390",
"title": "Loco-Store: Locality-Based Oblivious Data Storage",
"doi": null,
"abstractUrl": "/journal/tq/2022/02/09141390/1lu2SKm9JD2",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09363542",
"articleId": "1rvybv0CCUE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09360458",
"articleId": "1rqztz31z7W",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1JP1e1gAvYY",
"title": "Feb.",
"year": "2023",
"issueNum": "02",
"idPrefix": "tk",
"pubType": "journal",
"volume": "35",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1v2M0gZ7HMs",
"doi": "10.1109/TKDE.2021.3093909",
"abstract": "As location-based applications flourishing, we will witness soon the transferring of a prodigious amount of data from the local to a public cloud. The rising demand for outsourced data is moving toward a wider geographical area with arbitrary distribution (i.e., dense or sparse) and query scope (i.e., limited or vast). The outsourced individual data should be preserved when being queried as facing cloud risks, especially for location information. Geometric range queries are one of the most fundamental search functions. However, the existed works of secure geometric queries are far from practical usage on efficiency and security simultaneously. In this paper, we propose a novel scheme, LuxGeo. Our scheme reaches a <italic>constant</italic> navigation and a <italic>linear</italic> sweep, which is tailored for secure and efficient location-lookup. Our experiments over three real-world spatial datasets have shown its practical efficiency. For example, it only takes <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathbf {10.01s}$_Z</tex-math></inline-formula> with <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathbf {728}$_Z</tex-math></inline-formula> tuples retrieved over <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathbf {63,369}$_Z</tex-math></inline-formula> ciphertext dataset for a single query. LuxGeo has better performance than the existed solutions for a GSE problem on efficiency and security.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As location-based applications flourishing, we will witness soon the transferring of a prodigious amount of data from the local to a public cloud. The rising demand for outsourced data is moving toward a wider geographical area with arbitrary distribution (i.e., dense or sparse) and query scope (i.e., limited or vast). The outsourced individual data should be preserved when being queried as facing cloud risks, especially for location information. Geometric range queries are one of the most fundamental search functions. However, the existed works of secure geometric queries are far from practical usage on efficiency and security simultaneously. In this paper, we propose a novel scheme, LuxGeo. Our scheme reaches a <italic>constant</italic> navigation and a <italic>linear</italic> sweep, which is tailored for secure and efficient location-lookup. Our experiments over three real-world spatial datasets have shown its practical efficiency. For example, it only takes <inline-formula><tex-math notation=\"LaTeX\">$\\mathbf {10.01s}$</tex-math><alternatives><mml:math><mml:mrow><mml:mn mathvariant=\"bold\">10</mml:mn><mml:mo>.</mml:mo><mml:mn mathvariant=\"bold\">01</mml:mn><mml:mi mathvariant=\"bold\">s</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href=\"guo-ieq1-3093909.gif\"/></alternatives></inline-formula> with <inline-formula><tex-math notation=\"LaTeX\">$\\mathbf {728}$</tex-math><alternatives><mml:math><mml:mn mathvariant=\"bold\">728</mml:mn></mml:math><inline-graphic xlink:href=\"guo-ieq2-3093909.gif\"/></alternatives></inline-formula> tuples retrieved over <inline-formula><tex-math notation=\"LaTeX\">$\\mathbf {63,369}$</tex-math><alternatives><mml:math><mml:mrow><mml:mn mathvariant=\"bold\">63</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant=\"bold\">369</mml:mn></mml:mrow></mml:math><inline-graphic xlink:href=\"guo-ieq3-3093909.gif\"/></alternatives></inline-formula> ciphertext dataset for a single query. LuxGeo has better performance than the existed solutions for a GSE problem on efficiency and security.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As location-based applications flourishing, we will witness soon the transferring of a prodigious amount of data from the local to a public cloud. The rising demand for outsourced data is moving toward a wider geographical area with arbitrary distribution (i.e., dense or sparse) and query scope (i.e., limited or vast). The outsourced individual data should be preserved when being queried as facing cloud risks, especially for location information. Geometric range queries are one of the most fundamental search functions. However, the existed works of secure geometric queries are far from practical usage on efficiency and security simultaneously. In this paper, we propose a novel scheme, LuxGeo. Our scheme reaches a constant navigation and a linear sweep, which is tailored for secure and efficient location-lookup. Our experiments over three real-world spatial datasets have shown its practical efficiency. For example, it only takes - with - tuples retrieved over - ciphertext dataset for a single query. LuxGeo has better performance than the existed solutions for a GSE problem on efficiency and security.",
"title": "LuxGeo: Efficient and Security-Enhanced Geometric Range Queries",
"normalizedTitle": "LuxGeo: Efficient and Security-Enhanced Geometric Range Queries",
"fno": "09477110",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Cloud Computing",
"Cryptography",
"Data Handling",
"Location Based Services",
"Mobile Computing",
"Outsourcing",
"Query Processing",
"Arbitrary Distribution",
"Fundamental Search Functions",
"GSE Problem",
"Location Information",
"Location Based Applications",
"Lux Geo",
"Outsourced Individual Data",
"Public Cloud",
"Query Scope",
"Real World Spatial Datasets",
"Secure Geometric Queries",
"Security Enhanced Geometric Range Queries",
"Wider Geographical Area",
"Servers",
"Indexes",
"Encryption",
"Security",
"Spatial Databases",
"Clouds",
"Probabilistic Logic",
"Geometrically Searchable Encryption GSE",
"Geometric Range Queries",
"Secure Queries",
"Privacy",
"Outsourced Cloud"
],
"authors": [
{
"givenName": "Ruoyang",
"surname": "Guo",
"fullName": "Ruoyang Guo",
"affiliation": "School of Information, Renmin University of China, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bo",
"surname": "Qin",
"fullName": "Bo Qin",
"affiliation": "School of Information, Renmin University of China, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuncheng",
"surname": "Wu",
"fullName": "Yuncheng Wu",
"affiliation": "School of Computing, National University of Singapore, Singapore, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ruixuan",
"surname": "Liu",
"fullName": "Ruixuan Liu",
"affiliation": "School of Information, Renmin University of China, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hong",
"surname": "Chen",
"fullName": "Hong Chen",
"affiliation": "School of Information, Renmin University of China, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cuiping",
"surname": "Li",
"fullName": "Cuiping Li",
"affiliation": "School of Information, Renmin University of China, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2023-02-01 00:00:00",
"pubType": "trans",
"pages": "1775-1790",
"year": "2023",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/bd/2023/01/09784919",
"title": "Rethinking Embedded Unsupervised Feature Selection: A Simple Joint Approach",
"doi": null,
"abstractUrl": "/journal/bd/2023/01/09784919/1DQLFKdcpSo",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__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/cc/2022/02/08976273",
"title": "Distributed Traffic Flow Consolidation for Power Efficiency of Large-Scale Data Center Network",
"doi": null,
"abstractUrl": "/journal/cc/2022/02/08976273/1h0VVDXFBh6",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__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/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/tp/2022/08/09361303",
"title": "Instance-Dependent Positive and Unlabeled Learning With Labeling Bias Estimation",
"doi": null,
"abstractUrl": "/journal/tp/2022/08/09361303/1rsezbEXNxS",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2022/05/09428608",
"title": "Make Web3.0 Connected",
"doi": null,
"abstractUrl": "/journal/tq/2022/05/09428608/1twaRP2Jjl6",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/10/09463735",
"title": "Signed Graph Metric Learning via Gershgorin Disc Perfect Alignment",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09463735/1uFxm1okYhO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/cc/2023/01/09460791",
"title": "Dual Traceable Distributed Attribute-Based Searchable Encryption and Ownership Transfer",
"doi": null,
"abstractUrl": "/journal/cc/2023/01/09460791/1uxeNCTsnra",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__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": "09483677",
"articleId": "1vcJo4x5s6Q",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09492838",
"articleId": "1vq0EU6lrAA",
"__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": "13rRUxC0SEk",
"doi": "10.1109/TVCG.2016.2598870",
"abstract": "The study of spatial data ensembles leads to substantial visualization challenges in a variety of applications. In this paper, we present a model for comparative visualization that supports the design of according ensemble visualization solutions by partial automation. We focus on applications, where the user is interested in preserving selected spatial data characteristics of the data as much as possible—even when many ensemble members should be jointly studied using comparative visualization. In our model, we separate the design challenge into a minimal set of user-specified parameters and an optimization component for the automatic configuration of the remaining design variables. We provide an illustrated formal description of our model and exemplify our approach in the context of several application examples from different domains in order to demonstrate its generality within the class of comparative visualization problems for spatial data ensembles.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The study of spatial data ensembles leads to substantial visualization challenges in a variety of applications. In this paper, we present a model for comparative visualization that supports the design of according ensemble visualization solutions by partial automation. We focus on applications, where the user is interested in preserving selected spatial data characteristics of the data as much as possible—even when many ensemble members should be jointly studied using comparative visualization. In our model, we separate the design challenge into a minimal set of user-specified parameters and an optimization component for the automatic configuration of the remaining design variables. We provide an illustrated formal description of our model and exemplify our approach in the context of several application examples from different domains in order to demonstrate its generality within the class of comparative visualization problems for spatial data ensembles.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The study of spatial data ensembles leads to substantial visualization challenges in a variety of applications. In this paper, we present a model for comparative visualization that supports the design of according ensemble visualization solutions by partial automation. We focus on applications, where the user is interested in preserving selected spatial data characteristics of the data as much as possible—even when many ensemble members should be jointly studied using comparative visualization. In our model, we separate the design challenge into a minimal set of user-specified parameters and an optimization component for the automatic configuration of the remaining design variables. We provide an illustrated formal description of our model and exemplify our approach in the context of several application examples from different domains in order to demonstrate its generality within the class of comparative visualization problems for spatial data ensembles.",
"title": "A Fractional Cartesian Composition Model for Semi-Spatial Comparative Visualization Design",
"normalizedTitle": "A Fractional Cartesian Composition Model for Semi-Spatial Comparative Visualization Design",
"fno": "07539573",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Spatial Databases",
"Data Models",
"Visualization",
"Computational Modeling",
"Three Dimensional Displays",
"Encoding",
"Design Methodologies",
"Visualization Models",
"Integrating Spatial And Non Spatial Data Visualization"
],
"authors": [
{
"givenName": "Ivan",
"surname": "Kolesár",
"fullName": "Ivan Kolesár",
"affiliation": "Department of Informatics, University of Bergen, Norway",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefan",
"surname": "Bruckner",
"fullName": "Stefan Bruckner",
"affiliation": "Department of Informatics, University of Bergen, Norway",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ivan",
"surname": "Viola",
"fullName": "Ivan Viola",
"affiliation": "TU Wien, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Helwig",
"surname": "Hauser",
"fullName": "Helwig Hauser",
"affiliation": "Department of Informatics, University of Bergen, Norway",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2017-01-01 00:00:00",
"pubType": "trans",
"pages": "851-860",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-infovis/2005/2790/0/27900028",
"title": "Temporal Visualization of Planning Polygons for Efficient Partitioning of Geo-Spatial Data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/27900028/12OmNzb7Znj",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061421",
"title": "Noodles: A Tool for Visualization of Numerical Weather Model Ensemble Uncertainty",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061421/13rRUILtJm4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122743",
"title": "Comparative Visual Analysis of Lagrangian Transport in CFD Ensembles",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122743/13rRUwbs2b4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539323",
"title": "Multi-Resolution Climate Ensemble Parameter Analysis with Nested Parallel Coordinates Plots",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539323/13rRUxNEqPZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875990",
"title": "Multi-Charts for Comparative 3D Ensemble Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875990/13rRUxYIMUZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07194852",
"title": "Effective Visualization of Temporal Ensembles",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07194852/13rRUy3xY8c",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440052",
"title": "An Interactive Framework for Visualization of Weather Forecast Ensembles",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440052/17D45XDIXW9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2022/9007/0/900700a280",
"title": "Visualization Tool for Comparative Analysis of Seabird Movement Data",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2022/900700a280/1KaH5N5YOK4",
"parentPublication": {
"id": "proceedings/iv/2022/9007/0",
"title": "2022 26th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222374",
"title": "Data-Driven Space-Filling Curves",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222374/1nTqIxy4mQM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/03/09622132",
"title": "Scalable Comparative Visualization of Ensembles of Call Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2023/03/09622132/1yEUqT5fBwQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07539581",
"articleId": "13rRUx0xPTU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07539578",
"articleId": "13rRUyuNsx2",
"__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": "17D45VUZMTZ",
"doi": "10.1109/TVCG.2018.2865126",
"abstract": "Interactive ranking techniques have substantially promoted analysts' ability in making judicious and informed decisions effectively based on multiple criteria. However, the existing techniques cannot satisfactorily support the analysis tasks involved in ranking large-scale spatial alternatives, such as selecting optimal locations for chain stores, where the complex spatial contexts involved are essential to the decision-making process. Limitations observed in the prior attempts of integrating rankings with spatial contexts motivate us to develop a context-integrated visual ranking technique. Based on a set of generic design requirements we summarized by collaborating with domain experts, we propose SRVis, a novel spatial ranking visualization technique that supports efficient spatial multi-criteria decision-making processes by addressing three major challenges in the aforementioned context integration, namely, a) the presentation of spatial rankings and contexts, b) the scalability of rankings' visual representations, and c) the analysis of context-integrated spatial rankings. Specifically, we encode massive rankings and their cause with scalable matrix-based visualizations and stacked bar charts based on a novel two-phase optimization framework that minimizes the information loss, and the flexible spatial filtering and intuitive comparative analysis are adopted to enable the in-depth evaluation of the rankings and assist users in selecting the best spatial alternative. The effectiveness of the proposed technique has been evaluated and demonstrated with an empirical study of optimization methods, two case studies, and expert interviews.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Interactive ranking techniques have substantially promoted analysts' ability in making judicious and informed decisions effectively based on multiple criteria. However, the existing techniques cannot satisfactorily support the analysis tasks involved in ranking large-scale spatial alternatives, such as selecting optimal locations for chain stores, where the complex spatial contexts involved are essential to the decision-making process. Limitations observed in the prior attempts of integrating rankings with spatial contexts motivate us to develop a context-integrated visual ranking technique. Based on a set of generic design requirements we summarized by collaborating with domain experts, we propose SRVis, a novel spatial ranking visualization technique that supports efficient spatial multi-criteria decision-making processes by addressing three major challenges in the aforementioned context integration, namely, a) the presentation of spatial rankings and contexts, b) the scalability of rankings' visual representations, and c) the analysis of context-integrated spatial rankings. Specifically, we encode massive rankings and their cause with scalable matrix-based visualizations and stacked bar charts based on a novel two-phase optimization framework that minimizes the information loss, and the flexible spatial filtering and intuitive comparative analysis are adopted to enable the in-depth evaluation of the rankings and assist users in selecting the best spatial alternative. The effectiveness of the proposed technique has been evaluated and demonstrated with an empirical study of optimization methods, two case studies, and expert interviews.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Interactive ranking techniques have substantially promoted analysts' ability in making judicious and informed decisions effectively based on multiple criteria. However, the existing techniques cannot satisfactorily support the analysis tasks involved in ranking large-scale spatial alternatives, such as selecting optimal locations for chain stores, where the complex spatial contexts involved are essential to the decision-making process. Limitations observed in the prior attempts of integrating rankings with spatial contexts motivate us to develop a context-integrated visual ranking technique. Based on a set of generic design requirements we summarized by collaborating with domain experts, we propose SRVis, a novel spatial ranking visualization technique that supports efficient spatial multi-criteria decision-making processes by addressing three major challenges in the aforementioned context integration, namely, a) the presentation of spatial rankings and contexts, b) the scalability of rankings' visual representations, and c) the analysis of context-integrated spatial rankings. Specifically, we encode massive rankings and their cause with scalable matrix-based visualizations and stacked bar charts based on a novel two-phase optimization framework that minimizes the information loss, and the flexible spatial filtering and intuitive comparative analysis are adopted to enable the in-depth evaluation of the rankings and assist users in selecting the best spatial alternative. The effectiveness of the proposed technique has been evaluated and demonstrated with an empirical study of optimization methods, two case studies, and expert interviews.",
"title": "SRVis: Towards Better Spatial Integration in Ranking Visualization",
"normalizedTitle": "SRVis: Towards Better Spatial Integration in Ranking Visualization",
"fno": "08456575",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Bar Charts",
"Data Visualisation",
"Decision Making",
"Matrix Algebra",
"Optimisation",
"Spatial Filters",
"Judicious Decisions",
"Informed Decisions",
"Analysis Tasks",
"Large Scale Spatial Alternatives",
"Optimal Locations",
"Complex Spatial Contexts",
"Context Integrated Visual Ranking Technique",
"SR Vis",
"Spatial Ranking Visualization Technique",
"Context Integrated Spatial Rankings",
"Spatial Filtering",
"Spatial Multicriteria Decision Making Processes",
"Matrix Based Visualizations",
"Bar Charts",
"Optimization Methods",
"In Depth Evaluation",
"Visualization",
"Bars",
"Decision Making",
"Data Visualization",
"Scalability",
"Spatial Databases",
"Reliability",
"Spatial Ranking",
"Visualization"
],
"authors": [
{
"givenName": "Di",
"surname": "Weng",
"fullName": "Di Weng",
"affiliation": "State Key Lab of CAD & CGZhejiang UniversityAlibaba-Zhejiang University JointInstitute of Frontier Technologies",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ran",
"surname": "Chen",
"fullName": "Ran Chen",
"affiliation": "State Key Lab of CAD & CGZhejiang UniversityAlibaba-Zhejiang University JointInstitute of Frontier Technologies",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zikun",
"surname": "Deng",
"fullName": "Zikun Deng",
"affiliation": "State Key Lab of CAD & CGZhejiang UniversityAlibaba-Zhejiang University JointInstitute of Frontier Technologies",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Feiran",
"surname": "Wu",
"fullName": "Feiran Wu",
"affiliation": "Alibaba Group, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jingmin",
"surname": "Chen",
"fullName": "Jingmin Chen",
"affiliation": "Alibaba Group, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yingcai",
"surname": "Wu",
"fullName": "Yingcai Wu",
"affiliation": "State Key Lab of CAD & CGZhejiang UniversityAlibaba-Zhejiang University JointInstitute of Frontier Technologies",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "459-469",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2015/6879/0/07156392",
"title": "TrajRank: Exploring travel behaviour on a route by trajectory ranking",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156392/12OmNAYXWFA",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wccct/2017/5573/0/5573a198",
"title": "QoS-Based Web Service Ranking Model Considering Decision Making Methods",
"doi": null,
"abstractUrl": "/proceedings-article/wccct/2017/5573a198/12OmNCbU3bp",
"parentPublication": {
"id": "proceedings/wccct/2017/5573/0",
"title": "2017 World Congress on Computing and Communication Technologies (WCCCT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2008/2570/0/04607384",
"title": "SocialRank: A ranking model for web image retrieval in web 2.0",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2008/04607384/12OmNs4S8DY",
"parentPublication": {
"id": "proceedings/icme/2008/2570/0",
"title": "2008 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scc/2016/2628/0/2628a665",
"title": "RaaS - Ranking as a Service",
"doi": null,
"abstractUrl": "/proceedings-article/scc/2016/2628a665/12OmNxveNJN",
"parentPublication": {
"id": "proceedings/scc/2016/2628/0",
"title": "2016 IEEE International Conference on Services Computing (SCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccie/2010/4026/2/4026b153",
"title": "Application of Visualization Technology in Spatial Data Mining",
"doi": null,
"abstractUrl": "/proceedings-article/ccie/2010/4026b153/12OmNzBOhXD",
"parentPublication": {
"id": "proceedings/ccie/2010/4026/2",
"title": "Computing, Control and Industrial Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2009/3733/0/3733a393",
"title": "GAIA Map: A Tool for Visual Ranking Analysis in Spatial Multicriteria Problems",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2009/3733a393/12OmNzmtWAT",
"parentPublication": {
"id": "proceedings/iv/2009/3733/0",
"title": "2009 13th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122669",
"title": "RankExplorer: Visualization of Ranking Changes in Large Time Series Data",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122669/13rRUxBa5xh",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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/881200a065",
"title": "FairFuse: Interactive Visual Support for Fair Consensus Ranking",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a065/1J6haP1jUt2",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2019/06/08890890",
"title": "Expected Value From a Ranking of Alternatives for Personalized Quantifier",
"doi": null,
"abstractUrl": "/magazine/ex/2019/06/08890890/1eGxdK0snPG",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440845",
"articleId": "17D45WYQJ9Z",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440817",
"articleId": "17D45VTRotk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i4QtMvQ5m8",
"name": "ttg201901-08456575s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08456575s1.mp4",
"extension": "mp4",
"size": "33.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBOUxmQ",
"title": "November/December",
"year": "2008",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "14",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxC0SvO",
"doi": "10.1109/TVCG.2008.140",
"abstract": "The ability to identify and present the most essential aspects of time-varying data is critically important in many areas of science and engineering. This paper introduces an importance-driven approach to time-varying volume data visualization for enhancing that ability. By conducting a block-wise analysis of the data in the joint feature-temporal space, we derive an importance curve for each data block based on the formulation of conditional entropy from information theory. Each curve characterizes the local temporal behavior of the respective block, and clustering the importance curves of all the volume blocks effectively classifies the underlying data. Based on different temporal trends exhibited by importance curves and their clustering results, we suggest several interesting and effective visualization techniques to reveal the important aspects of time-varying data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The ability to identify and present the most essential aspects of time-varying data is critically important in many areas of science and engineering. This paper introduces an importance-driven approach to time-varying volume data visualization for enhancing that ability. By conducting a block-wise analysis of the data in the joint feature-temporal space, we derive an importance curve for each data block based on the formulation of conditional entropy from information theory. Each curve characterizes the local temporal behavior of the respective block, and clustering the importance curves of all the volume blocks effectively classifies the underlying data. Based on different temporal trends exhibited by importance curves and their clustering results, we suggest several interesting and effective visualization techniques to reveal the important aspects of time-varying data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The ability to identify and present the most essential aspects of time-varying data is critically important in many areas of science and engineering. This paper introduces an importance-driven approach to time-varying volume data visualization for enhancing that ability. By conducting a block-wise analysis of the data in the joint feature-temporal space, we derive an importance curve for each data block based on the formulation of conditional entropy from information theory. Each curve characterizes the local temporal behavior of the respective block, and clustering the importance curves of all the volume blocks effectively classifies the underlying data. Based on different temporal trends exhibited by importance curves and their clustering results, we suggest several interesting and effective visualization techniques to reveal the important aspects of time-varying data.",
"title": "Importance-Driven Time-Varying Data Visualization",
"normalizedTitle": "Importance-Driven Time-Varying Data Visualization",
"fno": "ttg2008061547",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Time Varying Data",
"Conditional Entropy",
"Joint Feature Temporal Space",
"Clustering",
"Highlighting",
"Transfer Function"
],
"authors": [
{
"givenName": "Chaoli",
"surname": "Wang",
"fullName": "Chaoli Wang",
"affiliation": "University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongfeng",
"surname": "Yu",
"fullName": "Hongfeng Yu",
"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": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1547-1554",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-infovis/2005/2790/0/01532148",
"title": "Importance-driven visualization layouts for large time series data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/01532148/12OmNBkfRme",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2011/4602/0/4602a038",
"title": "Information Assisted Visualization of Large Scale Time Varying Scientific Data",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2011/4602a038/12OmNBlFQX0",
"parentPublication": {
"id": "proceedings/icvrv/2011/4602/0",
"title": "2011 International Conference on Virtual Reality and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/27900027",
"title": "Importance-Driven Visualization Layouts for Large Time Series Data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/27900027/12OmNs0C9EK",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bcgin/2011/4464/0/4464a235",
"title": "Time Varying Betas of Five Sectors in Shanghai Stock Exchange",
"doi": null,
"abstractUrl": "/proceedings-article/bcgin/2011/4464a235/12OmNyQpgKF",
"parentPublication": {
"id": "proceedings/bcgin/2011/4464/0",
"title": "2011 International Conference on Business Computing and Global Informatization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2004/8779/0/87790097",
"title": "Time-Varying Data Visualization Using Information Flocking Boids",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2004/87790097/12OmNyoiYSe",
"parentPublication": {
"id": "proceedings/ieee-infovis/2004/8779/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/04/v0408",
"title": "Importance-Driven Feature Enhancement in Volume Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2005/04/v0408/13rRUNvgyWb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030421",
"title": "Time-Varying Data Visualization Using Functional Representations",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030421/13rRUx0xPi6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/10/ttg2012101717",
"title": "Design of 2D Time-Varying Vector Fields",
"doi": null,
"abstractUrl": "/journal/tg/2012/10/ttg2012101717/13rRUxNEqPP",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061715",
"title": "Query-Driven Visualization of Time-Varying Adaptive Mesh Refinement Data",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061715/13rRUyYSWkV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/01/v0014",
"title": "Time-Varying Contour Topology",
"doi": null,
"abstractUrl": "/journal/tg/2006/01/v0014/13rRUzp02oc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061539",
"articleId": "13rRUwInveZ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061555",
"articleId": "13rRUxYrbUy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesQv",
"name": "ttg2008061547.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2008061547.zip",
"extension": "zip",
"size": "48.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvA1hrV",
"title": "Jan.-Feb.",
"year": "2014",
"issueNum": "01",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "16",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjyWZx",
"doi": "10.1109/MCSE.2013.45",
"abstract": "A new way to define mesh importance for decimation uses transfer functions and visualizes large simulation data in cases where normal visualization methods are insufficient due to memory limit. Next, a parallel isosurface simplification framework uses pyramid peeling to extract the decimated meshes progressively without generating the original surface. A new way to define mesh importance for decimation uses transfer functions and visualizes large simulation data in cases where normal visualization methods are insufficient due to memory limits. Next, a parallel isosurface simplification framework uses an importance pyramid to extract and render the decimated meshes progressively without generating the original surface.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A new way to define mesh importance for decimation uses transfer functions and visualizes large simulation data in cases where normal visualization methods are insufficient due to memory limit. Next, a parallel isosurface simplification framework uses pyramid peeling to extract the decimated meshes progressively without generating the original surface. A new way to define mesh importance for decimation uses transfer functions and visualizes large simulation data in cases where normal visualization methods are insufficient due to memory limits. Next, a parallel isosurface simplification framework uses an importance pyramid to extract and render the decimated meshes progressively without generating the original surface.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A new way to define mesh importance for decimation uses transfer functions and visualizes large simulation data in cases where normal visualization methods are insufficient due to memory limit. Next, a parallel isosurface simplification framework uses pyramid peeling to extract the decimated meshes progressively without generating the original surface. A new way to define mesh importance for decimation uses transfer functions and visualizes large simulation data in cases where normal visualization methods are insufficient due to memory limits. Next, a parallel isosurface simplification framework uses an importance pyramid to extract and render the decimated meshes progressively without generating the original surface.",
"title": "Importance-Driven Isosurface Decimation for Visualization of Large Simulation Data Based on OpenCL",
"normalizedTitle": "Importance-Driven Isosurface Decimation for Visualization of Large Simulation Data Based on OpenCL",
"fno": "mcs2014010024",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Feature Extraction",
"Transfer Functions",
"Isosurfaces",
"Histograms",
"Rendering Computer Graphics",
"Visualization",
"Scientific Computing",
"Isosurface Visualization",
"Importance Driven Methods",
"Transfer Function",
"Marching Cubes",
"Mesh Simplification",
"Open CL"
],
"authors": [
{
"givenName": "Yi",
"surname": "Peng",
"fullName": "Yi Peng",
"affiliation": "Tsinghua University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Li",
"surname": "Chen",
"fullName": "Li Chen",
"affiliation": "Tsinghua University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jun-Hai",
"surname": "Yong",
"fullName": "Jun-Hai Yong",
"affiliation": "Tsinghua University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2014-01-01 00:00:00",
"pubType": "mags",
"pages": "24-32",
"year": "2014",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visual/1996/864/0/00568133",
"title": "Three dimensional visualization of proteins in cellular interactions",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1996/00568133/12OmNBSSVcj",
"parentPublication": {
"id": "proceedings/visual/1996/864/0",
"title": "Proceedings of Seventh Annual IEEE Visualization '96",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/1999/0185/0/01850222",
"title": "Volume Decimation of Irregular Tetrahedral Grids",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/1999/01850222/12OmNBrlPyh",
"parentPublication": {
"id": "proceedings/cgi/1999/0185/0",
"title": "Computer Graphics International Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2017/1600/0/1600a359",
"title": "Research on Multi-resolution Isosurface Extraction Method for 3D Scalar Field",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2017/1600a359/12OmNwekjAv",
"parentPublication": {
"id": "proceedings/dsc/2017/1600/0",
"title": "2017 IEEE Second International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2017/5738/0/08031592",
"title": "Efficient GPU-accelerated computation of isosurface similarity maps",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031592/12OmNyNzhyo",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vg/2005/26/0/01500543",
"title": "iSBVR: isosurface-AIDED hardware acceleration techniques for slice-based volume rendering",
"doi": null,
"abstractUrl": "/proceedings-article/vg/2005/01500543/12OmNzSh1c6",
"parentPublication": {
"id": "proceedings/vg/2005/26/0",
"title": "Volume Graphics 2005",
"__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/06/ttg2008061659",
"title": "Revisiting Histograms and Isosurface Statistics",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061659/13rRUxZ0o1p",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1267",
"title": "Interactive Point-based Isosurface Exploration and High-quality Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1267/13rRUxjQyhm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1259",
"title": "On Histograms and Isosurface Statistics",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1259/13rRUzp02of",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08493612",
"title": "CPU Isosurface Ray Tracing of Adaptive Mesh Refinement Data",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08493612/17D45Vw15vd",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcs2014010018",
"articleId": "13rRUwwaKnI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcs2014010033",
"articleId": "13rRUIJuxsy",
"__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": "13rRUyfKIHS",
"doi": "10.1109/TVCG.2016.2599041",
"abstract": "Scientific data is continually increasing in complexity, variety and size, making efficient visualization and specifically rendering an ongoing challenge. Traditional rasterization-based visualization approaches encounter performance and quality limitations, particularly in HPC environments without dedicated rendering hardware. In this paper, we present OSPRay, a turn-key CPU ray tracing framework oriented towards production-use scientific visualization which can utilize varying SIMD widths and multiple device backends found across diverse HPC resources. This framework provides a high-quality, efficient CPU-based solution for typical visualization workloads, which has already been integrated into several prevalent visualization packages. We show that this system delivers the performance, high-level API simplicity, and modular device support needed to provide a compelling new rendering framework for implementing efficient scientific visualization workflows.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Scientific data is continually increasing in complexity, variety and size, making efficient visualization and specifically rendering an ongoing challenge. Traditional rasterization-based visualization approaches encounter performance and quality limitations, particularly in HPC environments without dedicated rendering hardware. In this paper, we present OSPRay, a turn-key CPU ray tracing framework oriented towards production-use scientific visualization which can utilize varying SIMD widths and multiple device backends found across diverse HPC resources. This framework provides a high-quality, efficient CPU-based solution for typical visualization workloads, which has already been integrated into several prevalent visualization packages. We show that this system delivers the performance, high-level API simplicity, and modular device support needed to provide a compelling new rendering framework for implementing efficient scientific visualization workflows.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Scientific data is continually increasing in complexity, variety and size, making efficient visualization and specifically rendering an ongoing challenge. Traditional rasterization-based visualization approaches encounter performance and quality limitations, particularly in HPC environments without dedicated rendering hardware. In this paper, we present OSPRay, a turn-key CPU ray tracing framework oriented towards production-use scientific visualization which can utilize varying SIMD widths and multiple device backends found across diverse HPC resources. This framework provides a high-quality, efficient CPU-based solution for typical visualization workloads, which has already been integrated into several prevalent visualization packages. We show that this system delivers the performance, high-level API simplicity, and modular device support needed to provide a compelling new rendering framework for implementing efficient scientific visualization workflows.",
"title": "OSPRay - A CPU Ray Tracing Framework for Scientific Visualization",
"normalizedTitle": "OSPRay - A CPU Ray Tracing Framework for Scientific Visualization",
"fno": "07539599",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Rendering Computer Graphics",
"Ray Tracing",
"Pipelines",
"Data Models",
"Computational Modeling",
"Graphics Processing Units"
],
"authors": [
{
"givenName": "I",
"surname": "Wald",
"fullName": "I Wald",
"affiliation": "Intel Corp",
"__typename": "ArticleAuthorType"
},
{
"givenName": "GP",
"surname": "Johnson",
"fullName": "GP Johnson",
"affiliation": "Intel Corp",
"__typename": "ArticleAuthorType"
},
{
"givenName": "J",
"surname": "Amstutz",
"fullName": "J Amstutz",
"affiliation": "Intel Corp",
"__typename": "ArticleAuthorType"
},
{
"givenName": "C",
"surname": "Brownlee",
"fullName": "C Brownlee",
"affiliation": "Intel Corp",
"__typename": "ArticleAuthorType"
},
{
"givenName": "A",
"surname": "Knoll",
"fullName": "A Knoll",
"affiliation": "SCI InsituteUniversity of Utah",
"__typename": "ArticleAuthorType"
},
{
"givenName": "J",
"surname": "Jeffers",
"fullName": "J Jeffers",
"affiliation": "Intel Corp",
"__typename": "ArticleAuthorType"
},
{
"givenName": "J",
"surname": "Günther",
"fullName": "J Günther",
"affiliation": "Intel Corp",
"__typename": "ArticleAuthorType"
},
{
"givenName": "P",
"surname": "Navratil",
"fullName": "P Navratil",
"affiliation": "Texas Advanced Computing Center",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2017-01-01 00:00:00",
"pubType": "trans",
"pages": "931-940",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/1995/7187/0/71870019",
"title": "Interactive Realism for Visualization Using Ray Tracing",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1995/71870019/12OmNAsTgR0",
"parentPublication": {
"id": "proceedings/ieee-vis/1995/7187/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etvis/2016/4731/0/07851170",
"title": "An analysis of eye-tracking data in foveated ray tracing",
"doi": null,
"abstractUrl": "/proceedings-article/etvis/2016/07851170/12OmNvT2pjL",
"parentPublication": {
"id": "proceedings/etvis/2016/4731/0",
"title": "2016 IEEE Second Workshop on Eye Tracking and Visualization (ETVIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2016/3682/0/3682b048",
"title": "Immersive Molecular Visualization with Omnidirectional Stereoscopic Ray Tracing and Remote Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2016/3682b048/12OmNzA6GQL",
"parentPublication": {
"id": "proceedings/ipdpsw/2016/3682/0",
"title": "2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061243",
"title": "Special Relativistic Visualization by Local Ray Tracing",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061243/13rRUxjyX3U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08493612",
"title": "CPU Isosurface Ray Tracing of Adaptive Mesh Refinement Data",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08493612/17D45Vw15vd",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2018/6873/0/08739224",
"title": "SpRay: Speculative Ray Scheduling for Large Data Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2018/08739224/1b1xbA4goJW",
"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/ldav/2018/6873/0/08739241",
"title": "Galaxy: Asynchronous Ray Tracing for Large High-Fidelity Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2018/08739241/1b1xcjia3Be",
"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/searis/2017/6274/0/09183547",
"title": "Visionaray: A Cross-Platform Ray Tracing Template Library",
"doi": null,
"abstractUrl": "/proceedings-article/searis/2017/09183547/1mLMmelx0Fa",
"parentPublication": {
"id": "proceedings/searis/2017/6274/0",
"title": "2017 IEEE 10th Workshop on Software Engineering and Architectures for Realtime Interactive Systems (SEARIS)",
"__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"
},
{
"id": "proceedings/ldav/2020/8468/0/846800a042",
"title": "Spatial Partitioning Strategies for Memory-Efficient Ray Tracing of Particles",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2020/846800a042/1pZ0TM9iMHm",
"parentPublication": {
"id": "proceedings/ldav/2020/8468/0",
"title": "2020 IEEE 10th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07539644",
"articleId": "13rRUyueghc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07539653",
"articleId": "13rRUB6Sq0C",
"__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": "1BLn9j3xNQs",
"doi": "10.1109/TVCG.2022.3159114",
"abstract": "Feature related particle data analysis plays an important role in many scientific applications such as fluid simulations, cosmology simulations and molecular dynamics. Compared to conventional methods that use hand-crafted feature descriptors, some recent studies focus on transforming the data into a new latent space, where features are easier to be identified, compared and extracted. However, it is challenging to transform particle data into latent representations, since the convolution neural networks used in prior studies require the data presented in regular grids. In this paper, we adopt Geometric Convolution, a neural network building block designed for 3D point clouds, to create latent representations for scientific particle data. These latent representations capture both the particle positions and their physical attributes in the local neighborhood so that features can be extracted by clustering in the latent space, and tracked by applying tracking algorithms such as mean-shift. We validate the extracted features and tracking results from our approach using datasets from three applications and show that they are comparable to the methods that define hand-crafted features for each specific dataset.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Feature related particle data analysis plays an important role in many scientific applications such as fluid simulations, cosmology simulations and molecular dynamics. Compared to conventional methods that use hand-crafted feature descriptors, some recent studies focus on transforming the data into a new latent space, where features are easier to be identified, compared and extracted. However, it is challenging to transform particle data into latent representations, since the convolution neural networks used in prior studies require the data presented in regular grids. In this paper, we adopt Geometric Convolution, a neural network building block designed for 3D point clouds, to create latent representations for scientific particle data. These latent representations capture both the particle positions and their physical attributes in the local neighborhood so that features can be extracted by clustering in the latent space, and tracked by applying tracking algorithms such as mean-shift. We validate the extracted features and tracking results from our approach using datasets from three applications and show that they are comparable to the methods that define hand-crafted features for each specific dataset.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Feature related particle data analysis plays an important role in many scientific applications such as fluid simulations, cosmology simulations and molecular dynamics. Compared to conventional methods that use hand-crafted feature descriptors, some recent studies focus on transforming the data into a new latent space, where features are easier to be identified, compared and extracted. However, it is challenging to transform particle data into latent representations, since the convolution neural networks used in prior studies require the data presented in regular grids. In this paper, we adopt Geometric Convolution, a neural network building block designed for 3D point clouds, to create latent representations for scientific particle data. These latent representations capture both the particle positions and their physical attributes in the local neighborhood so that features can be extracted by clustering in the latent space, and tracked by applying tracking algorithms such as mean-shift. We validate the extracted features and tracking results from our approach using datasets from three applications and show that they are comparable to the methods that define hand-crafted features for each specific dataset.",
"title": "Local Latent Representation based on Geometric Convolution for Particle Data Feature Exploration",
"normalizedTitle": "Local Latent Representation based on Geometric Convolution for Particle Data Feature Exploration",
"fno": "09735308",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Feature Extraction",
"Neural Networks",
"Point Cloud Compression",
"Data Visualization",
"Convolution",
"Three Dimensional Displays",
"Kernel",
"Data Transformation",
"Particle Data",
"Feature Extraction And Tracking",
"Deep Learning"
],
"authors": [
{
"givenName": "Haoyu",
"surname": "Li",
"fullName": "Haoyu Li",
"affiliation": "Computer Science and Engineering, The Ohio State University, 2647 Columbus, Ohio, United States, 43210",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Han-Wei",
"surname": "Shen",
"fullName": "Han-Wei Shen",
"affiliation": "Department of Computer Science and Engineering, The Ohio State University, Columbus, Ohio, United States",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-03-01 00:00:00",
"pubType": "trans",
"pages": "1-1",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2016/1437/0/1437b359",
"title": "3D Convolutional Networks-Based Mitotic Event Detection in Time-Lapse Phase Contrast Microscopy Image Sequences of Stem Cell Populations",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2016/1437b359/12OmNyYm2D8",
"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/iccv/2021/2812/0/281200e945",
"title": "Adaptive Graph Convolution for Point Cloud Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200e945/1BmFzgP28iA",
"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/694600g292",
"title": "POCO: Point Convolution for Surface Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600g292/1H0KAZrauEo",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600f533",
"title": "Learning a Structured Latent Space for Unsupervised Point Cloud Completion",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600f533/1H0KOsU2FZC",
"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/10024001",
"title": "AGConv: Adaptive Graph Convolution on 3D Point Clouds",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/10024001/1K9spf0w0Ug",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2022/5670/0/567000a166",
"title": "GNPM: Geometric-Aware Neural Parametric Models",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2022/567000a166/1KYslWC3W7u",
"parentPublication": {
"id": "proceedings/3dv/2022/5670/0",
"title": "2022 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2019/3293/0/329300k0288",
"title": "Graph Attention Convolution for Point Cloud Semantic Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300k0288/1gyrHUpmp68",
"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/iccv/2019/4803/0/480300i180",
"title": "Geometric Disentanglement for Generative Latent Shape Models",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300i180/1hQqibv9Neg",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2020/6553/0/09093505",
"title": "Blended Convolution and Synthesis for Efficient Discrimination of 3D Shapes",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2020/09093505/1jPbfCoY1IQ",
"parentPublication": {
"id": "proceedings/wacv/2020/6553/0",
"title": "2020 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2021/0477/0/047700d148",
"title": "Cross-Domain Latent Modulation for Variational Transfer Learning",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2021/047700d148/1uqGAEg8Jaw",
"parentPublication": {
"id": "proceedings/wacv/2021/0477/0",
"title": "2021 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09733942",
"articleId": "1BJIbG1OGqc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09736452",
"articleId": "1BN1Ujkoysg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1BN1TTJERlC",
"name": "ttg555501-09735308s1-supp3-3159114.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09735308s1-supp3-3159114.mp4",
"extension": "mp4",
"size": "4.37 MB",
"__typename": "WebExtraType"
},
{
"id": "1BN1TNc24tq",
"name": "ttg555501-09735308s1-supp2-3159114.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09735308s1-supp2-3159114.mp4",
"extension": "mp4",
"size": "4.2 MB",
"__typename": "WebExtraType"
},
{
"id": "1BN1TYNSOl2",
"name": "ttg555501-09735308s1-supp4-3159114.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09735308s1-supp4-3159114.mp4",
"extension": "mp4",
"size": "4.2 MB",
"__typename": "WebExtraType"
},
{
"id": "1BN1U3YDxjW",
"name": "ttg555501-09735308s1-supp1-3159114.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09735308s1-supp1-3159114.mp4",
"extension": "mp4",
"size": "4.35 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1GZolSVvsPu",
"doi": "10.1109/TVCG.2022.3209448",
"abstract": "This paper introduces design patterns for dashboards to inform dashboard design processes. Despite a growing number of public examples, case studies, and general guidelines there is surprisingly little design guidance for dashboards. Such guidance is necessary to inspire designs and discuss tradeoffs in, e.g., screenspace, interaction, or information shown. Based on a systematic review of 144 dashboards, we report on eight groups of design patterns that provide common solutions in dashboard design. We discuss combinations of these patterns in “dashboard genres” such as <italic>narrative, analytical</italic>, or <italic>embedded dashboard</italic>. We ran a 2-week dashboard design workshop with 23 participants of varying expertise working on their own data and dashboards. We discuss the application of patterns for the dashboard design processes, as well as general design tradeoffs and common challenges. Our work complements previous surveys and aims to support dashboard designers and researchers in co-creation, structured design decisions, as well as future user evaluations about dashboard design guidelines. Detailed pattern descriptions and workshop material can be found online: <uri>https://dashboarddesignpatterns.github.io</uri>",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper introduces design patterns for dashboards to inform dashboard design processes. Despite a growing number of public examples, case studies, and general guidelines there is surprisingly little design guidance for dashboards. Such guidance is necessary to inspire designs and discuss tradeoffs in, e.g., screenspace, interaction, or information shown. Based on a systematic review of 144 dashboards, we report on eight groups of design patterns that provide common solutions in dashboard design. We discuss combinations of these patterns in “dashboard genres” such as <italic>narrative, analytical</italic>, or <italic>embedded dashboard</italic>. We ran a 2-week dashboard design workshop with 23 participants of varying expertise working on their own data and dashboards. We discuss the application of patterns for the dashboard design processes, as well as general design tradeoffs and common challenges. Our work complements previous surveys and aims to support dashboard designers and researchers in co-creation, structured design decisions, as well as future user evaluations about dashboard design guidelines. Detailed pattern descriptions and workshop material can be found online: <uri>https://dashboarddesignpatterns.github.io</uri>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper introduces design patterns for dashboards to inform dashboard design processes. Despite a growing number of public examples, case studies, and general guidelines there is surprisingly little design guidance for dashboards. Such guidance is necessary to inspire designs and discuss tradeoffs in, e.g., screenspace, interaction, or information shown. Based on a systematic review of 144 dashboards, we report on eight groups of design patterns that provide common solutions in dashboard design. We discuss combinations of these patterns in “dashboard genres” such as narrative, analytical, or embedded dashboard. We ran a 2-week dashboard design workshop with 23 participants of varying expertise working on their own data and dashboards. We discuss the application of patterns for the dashboard design processes, as well as general design tradeoffs and common challenges. Our work complements previous surveys and aims to support dashboard designers and researchers in co-creation, structured design decisions, as well as future user evaluations about dashboard design guidelines. Detailed pattern descriptions and workshop material can be found online: https://dashboarddesignpatterns.github.io",
"title": "Dashboard Design Patterns",
"normalizedTitle": "Dashboard Design Patterns",
"fno": "09903550",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Design Engineering",
"Human Computer Interaction",
"Object Oriented Programming",
"Analytical Dashboard",
"Asnarrative Dashboard",
"Dashboard Design Guidelines",
"Dashboard Design Patterns",
"Dashboard Design Processes",
"Dashboard Design Workshop",
"Dashboard Designers",
"Dashboard Genres",
"Detailed Pattern Descriptions",
"General Design Tradeoffs",
"Orembedded Dashboard",
"Structured Design Decisions",
"Visualization",
"Data Visualization",
"Conferences",
"Guidelines",
"Encoding",
"Task Analysis",
"Monitoring",
"Dashboards",
"Design Patterns",
"Data Visualization",
"Storytelling",
"Visual Analytics",
"Qualitative Evaluation",
"Education"
],
"authors": [
{
"givenName": "Benjamin",
"surname": "Bach",
"fullName": "Benjamin Bach",
"affiliation": "University of Edinburgh, Scotland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Euan",
"surname": "Freeman",
"fullName": "Euan Freeman",
"affiliation": "University of Glasgow, Scotland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alfie",
"surname": "Abdul-Rahman",
"fullName": "Alfie Abdul-Rahman",
"affiliation": "King's College London, England",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cagatay",
"surname": "Turkay",
"fullName": "Cagatay Turkay",
"affiliation": "University of Warwick, England",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Saiful",
"surname": "Khan",
"fullName": "Saiful Khan",
"affiliation": "University of Oxford, England",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yulei",
"surname": "Fan",
"fullName": "Yulei Fan",
"affiliation": "University of Oxford, England",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Min",
"surname": "Chen",
"fullName": "Min Chen",
"affiliation": "University of Oxford, England",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "342-352",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/2016/5670/0/5670d483",
"title": "Insights from the Design and Evaluation of a Personal Health Dashboard",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/5670d483/12OmNAnMuCE",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2016/3682/0/3682b106",
"title": "Re-Examining HPC Energy Efficiency Dashboard Elements",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2016/3682b106/12OmNwKGArR",
"parentPublication": {
"id": "proceedings/ipdpsw/2016/3682/0",
"title": "2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08443395",
"title": "What Do We Talk About When We Talk About Dashboards?",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08443395/17D45XDIXWb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/03/08283817",
"title": "Using Dashboard Networks to Visualize Multiple Patient Histories: A Design Study on Post-Operative Prostate Cancer",
"doi": null,
"abstractUrl": "/journal/tg/2019/03/08283817/17D45XacGi3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09906971",
"title": "DashBot: Insight-Driven Dashboard Generation Based on Deep Reinforcement Learning",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09906971/1H5EWMQX9ZK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09911200",
"title": "MEDLEY: Intent-based Recommendations to Support Dashboard Composition<sc/>",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09911200/1Hcjm0PMkgw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10057994",
"title": "Dashboard Design Mining and Recommendation",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10057994/1LbFmG2HHnW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/09/09035622",
"title": "LADV: Deep Learning Assisted Authoring of Dashboard Visualizations From Images and Sketches",
"doi": null,
"abstractUrl": "/journal/tg/2021/09/09035622/1iaeAO11H6o",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2023/01/09656613",
"title": "Finding Their Data Voice: Practices and Challenges of Dashboard Users",
"doi": null,
"abstractUrl": "/magazine/cg/2023/01/09656613/1zumu8nC20U",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2021/3851/0/09637388",
"title": "Descriptive Analytics Dashboard for an Inclusive Learning Environment",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2021/09637388/1zuw1NkrZ28",
"parentPublication": {
"id": "proceedings/fie/2021/3851/0",
"title": "2021 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09906974",
"articleId": "1H5EXDBdLz2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09909991",
"articleId": "1HcjalbroGY",
"__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": "1xic65iQBoY",
"doi": "10.1109/TVCG.2021.3114826",
"abstract": "We contribute a deep-learning-based method that assists in designing analytical dashboards for analyzing a data table. Given a data table, data workers usually need to experience a tedious and time-consuming process to select meaningful combinations of data columns for creating charts. This process is further complicated by the needs of creating dashboards composed of multiple views that unveil different perspectives of data. Existing automated approaches for recommending multiple-view visualizations mainly build on manually crafted design rules, producing sub-optimal or irrelevant suggestions. To address this gap, we present a deep learning approach for selecting data columns and recommending multiple charts. More importantly, we integrate the deep learning models into a mixed-initiative system. Our model could make recommendations given optional user-input selections of data columns. The model, in turn, learns from provenance data of authoring logs in an offline manner. We compare our deep learning model with existing methods for visualization recommendation and conduct a user study to evaluate the usefulness of the system.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We contribute a deep-learning-based method that assists in designing analytical dashboards for analyzing a data table. Given a data table, data workers usually need to experience a tedious and time-consuming process to select meaningful combinations of data columns for creating charts. This process is further complicated by the needs of creating dashboards composed of multiple views that unveil different perspectives of data. Existing automated approaches for recommending multiple-view visualizations mainly build on manually crafted design rules, producing sub-optimal or irrelevant suggestions. To address this gap, we present a deep learning approach for selecting data columns and recommending multiple charts. More importantly, we integrate the deep learning models into a mixed-initiative system. Our model could make recommendations given optional user-input selections of data columns. The model, in turn, learns from provenance data of authoring logs in an offline manner. We compare our deep learning model with existing methods for visualization recommendation and conduct a user study to evaluate the usefulness of the system.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We contribute a deep-learning-based method that assists in designing analytical dashboards for analyzing a data table. Given a data table, data workers usually need to experience a tedious and time-consuming process to select meaningful combinations of data columns for creating charts. This process is further complicated by the needs of creating dashboards composed of multiple views that unveil different perspectives of data. Existing automated approaches for recommending multiple-view visualizations mainly build on manually crafted design rules, producing sub-optimal or irrelevant suggestions. To address this gap, we present a deep learning approach for selecting data columns and recommending multiple charts. More importantly, we integrate the deep learning models into a mixed-initiative system. Our model could make recommendations given optional user-input selections of data columns. The model, in turn, learns from provenance data of authoring logs in an offline manner. We compare our deep learning model with existing methods for visualization recommendation and conduct a user study to evaluate the usefulness of the system.",
"title": "MultiVision: Designing Analytical Dashboards with Deep Learning Based Recommendation",
"normalizedTitle": "MultiVision: Designing Analytical Dashboards with Deep Learning Based Recommendation",
"fno": "09552449",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Interactive Systems",
"Learning Artificial Intelligence",
"Recommender Systems",
"Creating Charts",
"Multiple View Visualizations",
"Manually Crafted Design Rules",
"Deep Learning Approach",
"Data Columns",
"Recommending Multiple Charts",
"Deep Learning Model",
"Optional User Input Selections",
"Provenance Data",
"Visualization Recommendation",
"Designing Analytical Dashboards",
"Based Recommendation",
"Data Table",
"Data Workers",
"Tedious Time Consuming Process",
"Data Visualization",
"Visualization",
"Encoding",
"Deep Learning",
"Tools",
"Measurement",
"Layout",
"Visualization Recommendation",
"Deep Learning",
"Multiple View",
"Dashboard",
"Mixed Initiative",
"Visualization Provenance"
],
"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 Area, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mengyu",
"surname": "Zhou",
"fullName": "Mengyu Zhou",
"affiliation": "Microsoft Research Area, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xinyi",
"surname": "He",
"fullName": "Xinyi He",
"affiliation": "Microsoft Research Area, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haidong",
"surname": "Zhang",
"fullName": "Haidong Zhang",
"affiliation": "Microsoft Research Area, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Qu",
"fullName": "Huamin Qu",
"affiliation": "Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dongmei",
"surname": "Zhang",
"fullName": "Dongmei Zhang",
"affiliation": "Microsoft Research Area, United States",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "162-172",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vahc/2017/3187/0/08387496",
"title": "DataScope: Interactive visual exploratory dashboards for large multidimensional data",
"doi": null,
"abstractUrl": "/proceedings-article/vahc/2017/08387496/12OmNx4Q6FM",
"parentPublication": {
"id": "proceedings/vahc/2017/3187/0",
"title": "2017 IEEE Workshop on Visual Analytics in Healthcare (VAHC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2016/5670/0/5670a041",
"title": "Enhancing the Professional Vision of Teachers: A Physiological Study of Teaching Analytics Dashboards of Students' Repertory Grid Exercises in Business Education",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/5670a041/12OmNxcdG0Y",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/it/2016/05/mit2016050058",
"title": "Displaying Background Maps in Business Intelligence Dashboards",
"doi": null,
"abstractUrl": "/magazine/it/2016/05/mit2016050058/13rRUx0xPxC",
"parentPublication": {
"id": "mags/it",
"title": "IT Professional",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2016/02/mcg2016020083",
"title": "Lessons Learned from Designing Visualization Dashboards",
"doi": null,
"abstractUrl": "/magazine/cg/2016/02/mcg2016020083/13rRUxBa5zP",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08443395",
"title": "What Do We Talk About When We Talk About Dashboards?",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08443395/17D45XDIXWb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09906971",
"title": "DashBot: Insight-Driven Dashboard Generation Based on Deep Reinforcement Learning",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09906971/1H5EWMQX9ZK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10057994",
"title": "Dashboard Design Mining and Recommendation",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10057994/1LbFmG2HHnW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/09/09035622",
"title": "LADV: Deep Learning Assisted Authoring of Dashboard Visualizations From Images and Sketches",
"doi": null,
"abstractUrl": "/journal/tg/2021/09/09035622/1iaeAO11H6o",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/it/2021/03/09464119",
"title": "Rigorous Data Validation for Accurate Dashboards: Experience From a Higher Education Institution",
"doi": null,
"abstractUrl": "/magazine/it/2021/03/09464119/1uHcqgoeili",
"parentPublication": {
"id": "mags/it",
"title": "IT Professional",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/conisoft/2021/4361/0/436100a034",
"title": "Information Visualization In Adaptable Dashboards For Smart Cities: A Systematic Review",
"doi": null,
"abstractUrl": "/proceedings-article/conisoft/2021/436100a034/1zHIifIcW4w",
"parentPublication": {
"id": "proceedings/conisoft/2021/4361/0",
"title": "2021 9th International Conference in Software Engineering Research and Innovation (CONISOFT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09555227",
"articleId": "1xjR1zzHe6s",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09585700",
"articleId": "1y11cGSPuPC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zBaRp3TMvC",
"name": "ttg202201-09552449s1-supp1-3114826.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09552449s1-supp1-3114826.mp4",
"extension": "mp4",
"size": "8.19 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxdm4Hw",
"title": "December",
"year": "2006",
"issueNum": "12",
"idPrefix": "tk",
"pubType": "journal",
"volume": "18",
"label": "December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILtJzN",
"doi": "10.1109/TKDE.2006.194",
"abstract": "Dimensionality reduction by feature projection is widely used in pattern recognition, information retrieval, and statistics. When there are some outputs available (e.g., regression values or classification results), it is often beneficial to consider supervised projection, which is based not only on the inputs, but also on the target values. While this applies to a single-output setting, we are more interested in applications with multiple outputs, where several tasks need to be learned simultaneously. In this paper, we introduce a novel projection approach called Multi-Output Regularized feature Projection (MORP), which preserves the information of input features and, meanwhile, captures the correlations between inputs/outputs and (if applicable) between multiple outputs. This is done by introducing a latent variable model on the joint input-output space and minimizing the reconstruction errors for both inputs and outputs. It turns out that the mappings can be found by solving a generalized eigenvalue problem and are ready to extend to nonlinear mappings. Prediction accuracy can be greatly improved by using the new features since the structure of outputs is explored. We validate our approach in two applications. In the first setting, we predict users' preferences for a set of paintings. The second is concerned with image and text categorization where each image (or document) may belong to multiple categories. The proposed algorithm produces very encouraging results in both settings.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Dimensionality reduction by feature projection is widely used in pattern recognition, information retrieval, and statistics. When there are some outputs available (e.g., regression values or classification results), it is often beneficial to consider supervised projection, which is based not only on the inputs, but also on the target values. While this applies to a single-output setting, we are more interested in applications with multiple outputs, where several tasks need to be learned simultaneously. In this paper, we introduce a novel projection approach called Multi-Output Regularized feature Projection (MORP), which preserves the information of input features and, meanwhile, captures the correlations between inputs/outputs and (if applicable) between multiple outputs. This is done by introducing a latent variable model on the joint input-output space and minimizing the reconstruction errors for both inputs and outputs. It turns out that the mappings can be found by solving a generalized eigenvalue problem and are ready to extend to nonlinear mappings. Prediction accuracy can be greatly improved by using the new features since the structure of outputs is explored. We validate our approach in two applications. In the first setting, we predict users' preferences for a set of paintings. The second is concerned with image and text categorization where each image (or document) may belong to multiple categories. The proposed algorithm produces very encouraging results in both settings.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Dimensionality reduction by feature projection is widely used in pattern recognition, information retrieval, and statistics. When there are some outputs available (e.g., regression values or classification results), it is often beneficial to consider supervised projection, which is based not only on the inputs, but also on the target values. While this applies to a single-output setting, we are more interested in applications with multiple outputs, where several tasks need to be learned simultaneously. In this paper, we introduce a novel projection approach called Multi-Output Regularized feature Projection (MORP), which preserves the information of input features and, meanwhile, captures the correlations between inputs/outputs and (if applicable) between multiple outputs. This is done by introducing a latent variable model on the joint input-output space and minimizing the reconstruction errors for both inputs and outputs. It turns out that the mappings can be found by solving a generalized eigenvalue problem and are ready to extend to nonlinear mappings. Prediction accuracy can be greatly improved by using the new features since the structure of outputs is explored. We validate our approach in two applications. In the first setting, we predict users' preferences for a set of paintings. The second is concerned with image and text categorization where each image (or document) may belong to multiple categories. The proposed algorithm produces very encouraging results in both settings.",
"title": "Multi-Output Regularized Feature Projection",
"normalizedTitle": "Multi-Output Regularized Feature Projection",
"fno": "k1600",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Dimensionality Reduction",
"Supervised Projection",
"Feature Transformation"
],
"authors": [
{
"givenName": "Shipeng",
"surname": "Yu",
"fullName": "Shipeng Yu",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kai",
"surname": "Yu",
"fullName": "Kai Yu",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Volker",
"surname": "Tresp",
"fullName": "Volker Tresp",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hans-Peter",
"surname": "Kriegel",
"fullName": "Hans-Peter Kriegel",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2006-12-01 00:00:00",
"pubType": "trans",
"pages": "1600-1613",
"year": "2006",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ictai/2005/2488/0/24880356",
"title": "Document Retrieval Using Projection by Frequency Distribution",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2005/24880356/12OmNB7cjgX",
"parentPublication": {
"id": "proceedings/ictai/2005/2488/0",
"title": "17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109a380",
"title": "Dimensionality Reduction for Distributed Vision Systems Using Random Projection",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109a380/12OmNC8uRhA",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2008/3304/6/3304f288",
"title": "Mining Projection Transformation Based on Gene Expression Programming of Multi-Variable Niches",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2008/3304f288/12OmNCcKQvU",
"parentPublication": {
"id": "proceedings/icnc/2008/3304/6",
"title": "2008 Fourth International Conference on Natural Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ifita/2009/3600/1/3600a574",
"title": "The Module Design of Map Projection Transformation Based on Object-Oriented",
"doi": null,
"abstractUrl": "/proceedings-article/ifita/2009/3600a574/12OmNCesrbL",
"parentPublication": {
"id": "proceedings/ifita/2009/3600/3",
"title": "Information Technology and Applications, International Forum on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dbta/2009/3604/0/3604a192",
"title": "A Framework for Semi-supervised Clustering Based on Dimensionality Reduction",
"doi": null,
"abstractUrl": "/proceedings-article/dbta/2009/3604a192/12OmNrF2DMW",
"parentPublication": {
"id": "proceedings/dbta/2009/3604/0",
"title": "2009 First International Workshop on Database Technology and Applications, DBTA",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2011/4513/3/4513c213",
"title": "Semi-supervised Learning Framework for Cross-Lingual Projection",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2011/4513c213/12OmNrMZpwr",
"parentPublication": {
"id": "proceedings/wi-iat/2011/4513/3",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2008/3381/0/3381a131",
"title": "Time-Embedding 2D Locality Preserving Projection for Video Summarization",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2008/3381a131/12OmNvDI3WK",
"parentPublication": {
"id": "proceedings/cw/2008/3381/0",
"title": "2008 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2009/3804/4/3804e275",
"title": "SVM-Induced Dimensionality Reduction and Classification",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2009/3804e275/12OmNzG4gwg",
"parentPublication": {
"id": "proceedings/icicta/2009/3804/4",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061281",
"title": "Two-Phase Mapping for Projecting Massive Data Sets",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061281/13rRUynHuj5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "k1585",
"articleId": "13rRUxBJhFU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "k1614",
"articleId": "13rRUwh80BM",
"__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": "13rRUwwaKtd",
"doi": "10.1109/TVCG.2017.2745078",
"abstract": "People often rank and order data points as a vital part of making decisions. Multi-attribute ranking systems are a common tool used to make these data-driven decisions. Such systems often take the form of a table-based visualization in which users assign weights to the attributes representing the quantifiable importance of each attribute to a decision, which the system then uses to compute a ranking of the data. However, these systems assume that users are able to quantify their conceptual understanding of how important particular attributes are to a decision. This is not always easy or even possible for users to do. Rather, people often have a more holistic understanding of the data. They form opinions that data point A is better than data point B but do not necessarily know which attributes are important. To address these challenges, we present a visual analytic application to help people rank multi-variate data points. We developed a prototype system, Podium, that allows users to drag rows in the table to rank order data points based on their perception of the relative value of the data. Podium then infers a weighting model using Ranking SVM that satisfies the user's data preferences as closely as possible. Whereas past systems help users understand the relationships between data points based on changes to attribute weights, our approach helps users to understand the attributes that might inform their understanding of the data. We present two usage scenarios to describe some of the potential uses of our proposed technique: (1) understanding which attributes contribute to a user's subjective preferences for data, and (2) deconstructing attributes of importance for existing rankings. Our proposed approach makes powerful machine learning techniques more usable to those who may not have expertise in these areas.",
"abstracts": [
{
"abstractType": "Regular",
"content": "People often rank and order data points as a vital part of making decisions. Multi-attribute ranking systems are a common tool used to make these data-driven decisions. Such systems often take the form of a table-based visualization in which users assign weights to the attributes representing the quantifiable importance of each attribute to a decision, which the system then uses to compute a ranking of the data. However, these systems assume that users are able to quantify their conceptual understanding of how important particular attributes are to a decision. This is not always easy or even possible for users to do. Rather, people often have a more holistic understanding of the data. They form opinions that data point A is better than data point B but do not necessarily know which attributes are important. To address these challenges, we present a visual analytic application to help people rank multi-variate data points. We developed a prototype system, Podium, that allows users to drag rows in the table to rank order data points based on their perception of the relative value of the data. Podium then infers a weighting model using Ranking SVM that satisfies the user's data preferences as closely as possible. Whereas past systems help users understand the relationships between data points based on changes to attribute weights, our approach helps users to understand the attributes that might inform their understanding of the data. We present two usage scenarios to describe some of the potential uses of our proposed technique: (1) understanding which attributes contribute to a user's subjective preferences for data, and (2) deconstructing attributes of importance for existing rankings. Our proposed approach makes powerful machine learning techniques more usable to those who may not have expertise in these areas.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "People often rank and order data points as a vital part of making decisions. Multi-attribute ranking systems are a common tool used to make these data-driven decisions. Such systems often take the form of a table-based visualization in which users assign weights to the attributes representing the quantifiable importance of each attribute to a decision, which the system then uses to compute a ranking of the data. However, these systems assume that users are able to quantify their conceptual understanding of how important particular attributes are to a decision. This is not always easy or even possible for users to do. Rather, people often have a more holistic understanding of the data. They form opinions that data point A is better than data point B but do not necessarily know which attributes are important. To address these challenges, we present a visual analytic application to help people rank multi-variate data points. We developed a prototype system, Podium, that allows users to drag rows in the table to rank order data points based on their perception of the relative value of the data. Podium then infers a weighting model using Ranking SVM that satisfies the user's data preferences as closely as possible. Whereas past systems help users understand the relationships between data points based on changes to attribute weights, our approach helps users to understand the attributes that might inform their understanding of the data. We present two usage scenarios to describe some of the potential uses of our proposed technique: (1) understanding which attributes contribute to a user's subjective preferences for data, and (2) deconstructing attributes of importance for existing rankings. Our proposed approach makes powerful machine learning techniques more usable to those who may not have expertise in these areas.",
"title": "Podium: Ranking Data Using Mixed-Initiative Visual Analytics",
"normalizedTitle": "Podium: Ranking Data Using Mixed-Initiative Visual Analytics",
"fno": "08019863",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Support Vector Machines",
"Visual Analytics",
"Data Models",
"Prototypes",
"Computational Modeling",
"Mixed Initiative Visual Analytics",
"Multi Attribute Ranking",
"User Interaction"
],
"authors": [
{
"givenName": "Emily",
"surname": "Wall",
"fullName": "Emily Wall",
"affiliation": "Georgia Institute of Technology, Atlanta, GA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Subhajit",
"surname": "Das",
"fullName": "Subhajit Das",
"affiliation": "Georgia Institute of Technology, Atlanta, GA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ravish",
"surname": "Chawla",
"fullName": "Ravish Chawla",
"affiliation": "Georgia Institute of Technology, Atlanta, GA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bharath",
"surname": "Kalidindi",
"fullName": "Bharath Kalidindi",
"affiliation": "Georgia Institute of Technology, Atlanta, GA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eli T.",
"surname": "Brown",
"fullName": "Eli T. Brown",
"affiliation": "DePaul University, Chicago, IL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alex",
"surname": "Endert",
"fullName": "Alex Endert",
"affiliation": "Georgia Institute of Technology, Atlanta, GA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "trans",
"pages": "288-297",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdmw/2010/4257/0/4257a388",
"title": "A Visual Analytics Tool for Analysing Microarray Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2010/4257a388/12OmNvlg8nK",
"parentPublication": {
"id": "proceedings/icdmw/2010/4257/0",
"title": "2010 IEEE International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2016/5670/0/5670b427",
"title": "Mixed-Initiative for Big Data: The Intersection of Human + Visual Analytics + Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/5670b427/12OmNzVGcUy",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2012/04/mcg2012040026",
"title": "A Graph Algebra for Scalable Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2012/04/mcg2012040026/13rRUILLkpN",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2016/03/mcg2016030072",
"title": "Knowledge-Assisted Ranking: A Visual Analytic Application for Sports Event Data",
"doi": null,
"abstractUrl": "/magazine/cg/2016/03/mcg2016030072/13rRUyekIZN",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdva/2018/9194/0/08534019",
"title": "Multiple Workspaces in Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2018/08534019/17D45W9KVIu",
"parentPublication": {
"id": "proceedings/bdva/2018/9194/0",
"title": "2018 International Symposium on Big Data Visual and Immersive Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2022/2335/0/233500a196",
"title": "Visual Analytics of Multiple Network Ranking Based on Structural Similarity",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2022/233500a196/1E2wmSIym52",
"parentPublication": {
"id": "proceedings/pacificvis/2022/2335/0",
"title": "2022 IEEE 15th Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a065",
"title": "FairFuse: Interactive Visual Support for Fair Consensus Ranking",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a065/1J6haP1jUt2",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09216512",
"title": "Auditing the Sensitivity of Graph-based Ranking with Visual Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09216512/1nJsHwdIuqc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222249",
"title": "CAVA: A Visual Analytics System for Exploratory Columnar Data Augmentation Using Knowledge Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222249/1nTroT3Yn72",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2021/3335/0/333500a121",
"title": "A Mixed-Initiative Visual Analytics Approach for Qualitative Causal Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2021/333500a121/1yXubl1hwk0",
"parentPublication": {
"id": "proceedings/vis/2021/3335/0",
"title": "2021 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08017577",
"articleId": "13rRUxC0SWe",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08019851",
"articleId": "13rRUxBrGh7",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesTL",
"name": "ttg201801-08019863s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201801-08019863s1.zip",
"extension": "zip",
"size": "58.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7k",
"title": "May",
"year": "2011",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxZ0o1v",
"doi": "10.1109/TVCG.2010.242",
"abstract": "Visual exploration of multivariate data typically requires projection onto lower dimensional representations. The number of possible representations grows rapidly with the number of dimensions, and manual exploration quickly becomes ineffective or even unfeasible. This paper proposes automatic analysis methods to extract potentially relevant visual structures from a set of candidate visualizations. Based on features, the visualizations are ranked in accordance with a specified user task. The user is provided with a manageable number of potentially useful candidate visualizations, which can be used as a starting point for interactive data analysis. This can effectively ease the task of finding truly useful visualizations and potentially speed up the data exploration task. In this paper, we present ranking measures for class-based as well as non-class-based scatterplots and parallel coordinates visualizations. The proposed analysis methods are evaluated on different data sets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visual exploration of multivariate data typically requires projection onto lower dimensional representations. The number of possible representations grows rapidly with the number of dimensions, and manual exploration quickly becomes ineffective or even unfeasible. This paper proposes automatic analysis methods to extract potentially relevant visual structures from a set of candidate visualizations. Based on features, the visualizations are ranked in accordance with a specified user task. The user is provided with a manageable number of potentially useful candidate visualizations, which can be used as a starting point for interactive data analysis. This can effectively ease the task of finding truly useful visualizations and potentially speed up the data exploration task. In this paper, we present ranking measures for class-based as well as non-class-based scatterplots and parallel coordinates visualizations. The proposed analysis methods are evaluated on different data sets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visual exploration of multivariate data typically requires projection onto lower dimensional representations. The number of possible representations grows rapidly with the number of dimensions, and manual exploration quickly becomes ineffective or even unfeasible. This paper proposes automatic analysis methods to extract potentially relevant visual structures from a set of candidate visualizations. Based on features, the visualizations are ranked in accordance with a specified user task. The user is provided with a manageable number of potentially useful candidate visualizations, which can be used as a starting point for interactive data analysis. This can effectively ease the task of finding truly useful visualizations and potentially speed up the data exploration task. In this paper, we present ranking measures for class-based as well as non-class-based scatterplots and parallel coordinates visualizations. The proposed analysis methods are evaluated on different data sets.",
"title": "Automated Analytical Methods to Support Visual Exploration of High-Dimensional Data",
"normalizedTitle": "Automated Analytical Methods to Support Visual Exploration of High-Dimensional Data",
"fno": "ttg2011050584",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Dimensionality Reduction",
"Quality Measures",
"Scatterplots",
"Parallel Coordinates"
],
"authors": [
{
"givenName": "Andrada",
"surname": "Tatu",
"fullName": "Andrada Tatu",
"affiliation": "University of Konstanz, Konstanz",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Georgia",
"surname": "Albuquerque",
"fullName": "Georgia Albuquerque",
"affiliation": "TU Braunschweig, Braunschweig",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Martin",
"surname": "Eisemann",
"fullName": "Martin Eisemann",
"affiliation": "TU Braunschweig, Braunschweig",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter",
"surname": "Bak",
"fullName": "Peter Bak",
"affiliation": "University of Konstanz, Konstanz",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Holger",
"surname": "Theisel",
"fullName": "Holger Theisel",
"affiliation": "University of Magdeburg, Magdeburg",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marcus",
"surname": "Magnor",
"fullName": "Marcus Magnor",
"affiliation": "TU Braunschweig, Braunschweig",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Keim",
"fullName": "Daniel Keim",
"affiliation": "University of Konstanz, Konstanz",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2011-05-01 00:00:00",
"pubType": "trans",
"pages": "584-597",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/socpar/2009/3879/0/3879a254",
"title": "An Artificial Neural Network Model for Multi Dimension Reduction and Data Structure Exploration",
"doi": null,
"abstractUrl": "/proceedings-article/socpar/2009/3879a254/12OmNBlFQWz",
"parentPublication": {
"id": "proceedings/socpar/2009/3879/0",
"title": "Soft Computing and Pattern Recognition, International Conference of",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2016/2020/0/07498285",
"title": "MuVE: Efficient Multi-Objective View Recommendation for Visual Data Exploration",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2016/07498285/12OmNxeM45Z",
"parentPublication": {
"id": "proceedings/icde/2016/2020/0",
"title": "2016 IEEE 32nd International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsia/2017/2198/0/08339086",
"title": "High-dimensional scientific data exploration via cinema",
"doi": null,
"abstractUrl": "/proceedings-article/dsia/2017/08339086/12OmNxymoc7",
"parentPublication": {
"id": "proceedings/dsia/2017/2198/0",
"title": "2017 IEEE Workshop on Data Systems for Interactive Analysis (DSIA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009060993",
"title": "Interactive Dimensionality Reduction Through User-defined Combinations of Quality Metrics",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009060993/13rRUEgs2tm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011121902",
"title": "Branching and Circular Features in High Dimensional Data",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011121902/13rRUwh80uw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/destion/2022/7040/0/704000a064",
"title": "Comparing Strategies for Visualizing the High-Dimensional Exploration Behavior of CPS Design Agents",
"doi": null,
"abstractUrl": "/proceedings-article/destion/2022/704000a064/1EzI3b1JwmA",
"parentPublication": {
"id": "proceedings/destion/2022/7040/0",
"title": "2022 IEEE Workshop on Design Automation for CPS and IoT (DESTION)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09930144",
"title": "Out of the Plane: Flower Vs. Star Glyphs to Support High-Dimensional Exploration in Two-Dimensional Embeddings",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09930144/1HMOX2J2VMY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/04/08967136",
"title": "Glyphboard: Visual Exploration of High-Dimensional Data Combining Glyphs with Dimensionality Reduction",
"doi": null,
"abstractUrl": "/journal/tg/2020/04/08967136/1gPjxXgWQM0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09217981",
"title": "An Examination of Grouping and Spatial Organization Tasks for High-Dimensional Data Exploration",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09217981/1nL7qQvHEOI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/09349198",
"title": "DimLift: Interactive Hierarchical Data Exploration Through Dimensional Bundling",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/09349198/1qYmbJluuBi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011050570",
"articleId": "13rRUILLkvl",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011050598",
"articleId": "13rRUxASupx",
"__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": "1cG64NEzXUY",
"doi": "10.1109/TVCG.2019.2934300",
"abstract": "Matrix representations are one of the main established and empirically proven to be effective visualization techniques for relational (or network) data. However, matrices-similar to node-link diagrams-are most effective if their layout reveals the underlying data topology. Given the many developed algorithms, a practical problem arises: “Which matrix reordering algorithm should I choose for my dataset at hand?” To make matters worse, different reordering algorithms applied to the same dataset may let significantly different visual matrix patterns emerge. This leads to the question of trustworthiness and explainability of these fully automated, often heuristic, black-box processes. We present GUIRO, a Visual Analytics system that helps novices, network analysts, and algorithm designers to open the black-box. Users can investigate the usefulness and expressiveness of 70 accessible matrix reordering algorithms. For network analysts, we introduce a novel model space representation and two interaction techniques for a user-guided reordering of rows or columns, and especially groups thereof (submatrix reordering). These novel techniques contribute to the understanding of the global and local dataset topology. We support algorithm designers by giving them access to 16 reordering quality metrics and visual exploration means for comparing reordering implementations on a row/column permutation level. We evaluated GUIRO in a guided explorative user study with 12 subjects, a case study demonstrating its usefulness in a real-world scenario, and through an expert study gathering feedback on our design decisions. We found that our proposed methods help even inexperienced users to understand matrix patterns and allow a user-guided steering of reordering algorithms. GUIRO helps to increase the transparency of matrix reordering algorithms, thus helping a broad range of users to get a better insight into the complex reordering process, in turn supporting data and reordering algorithm insights.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Matrix representations are one of the main established and empirically proven to be effective visualization techniques for relational (or network) data. However, matrices-similar to node-link diagrams-are most effective if their layout reveals the underlying data topology. Given the many developed algorithms, a practical problem arises: “Which matrix reordering algorithm should I choose for my dataset at hand?” To make matters worse, different reordering algorithms applied to the same dataset may let significantly different visual matrix patterns emerge. This leads to the question of trustworthiness and explainability of these fully automated, often heuristic, black-box processes. We present GUIRO, a Visual Analytics system that helps novices, network analysts, and algorithm designers to open the black-box. Users can investigate the usefulness and expressiveness of 70 accessible matrix reordering algorithms. For network analysts, we introduce a novel model space representation and two interaction techniques for a user-guided reordering of rows or columns, and especially groups thereof (submatrix reordering). These novel techniques contribute to the understanding of the global and local dataset topology. We support algorithm designers by giving them access to 16 reordering quality metrics and visual exploration means for comparing reordering implementations on a row/column permutation level. We evaluated GUIRO in a guided explorative user study with 12 subjects, a case study demonstrating its usefulness in a real-world scenario, and through an expert study gathering feedback on our design decisions. We found that our proposed methods help even inexperienced users to understand matrix patterns and allow a user-guided steering of reordering algorithms. GUIRO helps to increase the transparency of matrix reordering algorithms, thus helping a broad range of users to get a better insight into the complex reordering process, in turn supporting data and reordering algorithm insights.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Matrix representations are one of the main established and empirically proven to be effective visualization techniques for relational (or network) data. However, matrices-similar to node-link diagrams-are most effective if their layout reveals the underlying data topology. Given the many developed algorithms, a practical problem arises: “Which matrix reordering algorithm should I choose for my dataset at hand?” To make matters worse, different reordering algorithms applied to the same dataset may let significantly different visual matrix patterns emerge. This leads to the question of trustworthiness and explainability of these fully automated, often heuristic, black-box processes. We present GUIRO, a Visual Analytics system that helps novices, network analysts, and algorithm designers to open the black-box. Users can investigate the usefulness and expressiveness of 70 accessible matrix reordering algorithms. For network analysts, we introduce a novel model space representation and two interaction techniques for a user-guided reordering of rows or columns, and especially groups thereof (submatrix reordering). These novel techniques contribute to the understanding of the global and local dataset topology. We support algorithm designers by giving them access to 16 reordering quality metrics and visual exploration means for comparing reordering implementations on a row/column permutation level. We evaluated GUIRO in a guided explorative user study with 12 subjects, a case study demonstrating its usefulness in a real-world scenario, and through an expert study gathering feedback on our design decisions. We found that our proposed methods help even inexperienced users to understand matrix patterns and allow a user-guided steering of reordering algorithms. GUIRO helps to increase the transparency of matrix reordering algorithms, thus helping a broad range of users to get a better insight into the complex reordering process, in turn supporting data and reordering algorithm insights.",
"title": "GUIRO: User-Guided Matrix Reordering",
"normalizedTitle": "GUIRO: User-Guided Matrix Reordering",
"fno": "08807245",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Interactive Systems",
"Matrix Algebra",
"Topology",
"GUIRO",
"User Guided Matrix Reordering",
"Matrix Representations",
"Visualization Techniques",
"Relational Data",
"Data Topology",
"Matrix Reordering Algorithm",
"Visual Analytics System",
"Submatrix Reordering",
"Visual Exploration",
"User Guided Steering",
"Visual Matrix Patterns",
"Dataset Topology",
"Interaction Techniques",
"Visualization",
"Data Visualization",
"Indexes",
"Topology",
"Measurement",
"Task Analysis",
"Partitioning Algorithms",
"Visual Analytics",
"Matrix",
"Black Box Algorithms",
"Seriation",
"Ordering",
"Sorting",
"Steerable Algorithm",
"Interaction",
"2 D Projection"
],
"authors": [
{
"givenName": "Michael",
"surname": "Behrisch",
"fullName": "Michael Behrisch",
"affiliation": "School of Engineering, Applied Sciences, Harvard University, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tobias",
"surname": "Schreck",
"fullName": "Tobias Schreck",
"affiliation": "Graz University of Technology, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanspeter",
"surname": "Pfister",
"fullName": "Hanspeter Pfister",
"affiliation": "School of Engineering, Applied Sciences, Harvard University, United States",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "184-194",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dac/1990/1363/0/00114900",
"title": "A transistor reordering technique for gate matrix layout",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1990/00114900/12OmNAo45Kb",
"parentPublication": {
"id": "proceedings/dac/1990/1363/0",
"title": "Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2017/2219/0/2219a119",
"title": "A Hierarchical Network Simplification via Non-Negative Matrix Factorization",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2017/2219a119/12OmNx3ZjoU",
"parentPublication": {
"id": "proceedings/sibgrapi/2017/2219/0",
"title": "2017 30th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispass/2000/6418/0/641813",
"title": "Accurate simulation and evaluation of code reordering",
"doi": null,
"abstractUrl": "/proceedings-article/ispass/2000/641813/12OmNyFU70d",
"parentPublication": {
"id": "proceedings/ispass/2000/6418/0",
"title": "2000 IEEE International Symposium on Performance Analysis of Systems and Software. ISPASS (Cat. No.00EX422)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2016/8942/0/8942a088",
"title": "Smoothed Multiple Binarization -- Using PQR Tree, Smoothing, Feature Vectors and Thresholding for Matrix Reordering",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2016/8942a088/12OmNzUPpiN",
"parentPublication": {
"id": "proceedings/iv/2016/8942/0",
"title": "2016 20th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2014/5500/0/5500a921",
"title": "Parallelization of Reordering Algorithms for Bandwidth and Wavefront Reduction",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2014/5500a921/12OmNzwpU8u",
"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/2017/01/07534849",
"title": "Magnostics: Image-Based Search of Interesting Matrix Views for Guided Network Exploration",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07534849/13rRUILLkDW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09721695",
"title": "A Deep Generative Model for Reordering Adjacency Matrices",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09721695/1Bhzo1K76IU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-icess/2008/3352/0/04637688",
"title": "Reordering Algorithms for Increasing Locality on Multicore Processors",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-icess/2008/04637688/1fHFGKz9cUo",
"parentPublication": {
"id": "proceedings/hpcc-icess/2008/3352/0",
"title": "High Performance Computing and Communication & IEEE International Conference on Embedded Software and Systems, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icict/2020/7283/0/728300a001",
"title": "Partial Scoring of Reordering Tasks Revisited: Linearity Matrix by Excel",
"doi": null,
"abstractUrl": "/proceedings-article/icict/2020/728300a001/1jPb5kxsLsc",
"parentPublication": {
"id": "proceedings/icict/2020/7283/0",
"title": "2020 3rd International Conference on Information and Computer Technologies (ICICT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccd/2021/3219/0/321900a260",
"title": "ReSpar: Reordering Algorithm for ReRAM-based Sparse Matrix-Vector Multiplication Accelerator",
"doi": null,
"abstractUrl": "/proceedings-article/iccd/2021/321900a260/1zuveVWttoA",
"parentPublication": {
"id": "proceedings/iccd/2021/3219/0",
"title": "2021 IEEE 39th International Conference on Computer Design (ICCD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08794560",
"articleId": "1eX8ARELiX6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08805456",
"articleId": "1cG4x9FpdAI",
"__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": "13rRUEgs2tm",
"doi": "10.1109/TVCG.2009.153",
"abstract": "Multivariate data sets including hundreds of variables are increasingly common in many application areas. Most multivariate visualization techniques are unable to display such data effectively, and a common approach is to employ dimensionality reduction prior to visualization. Most existing dimensionality reduction systems focus on preserving one or a few significant structures in data. For many analysis tasks, however, several types of structures can be of high significance and the importance of a certain structure compared to the importance of another is often task-dependent. This paper introduces a system for dimensionality reduction by combining user-defined quality metrics using weight functions to preserve as many important structures as possible. The system aims at effective visualization and exploration of structures within large multivariate data sets and provides enhancement of diverse structures by supplying a range of automatic variable orderings. Furthermore it enables a quality-guided reduction of variables through an interactive display facilitating investigation of trade-offs between loss of structure and the number of variables to keep. The generality and interactivity of the system is demonstrated through a case scenario.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Multivariate data sets including hundreds of variables are increasingly common in many application areas. Most multivariate visualization techniques are unable to display such data effectively, and a common approach is to employ dimensionality reduction prior to visualization. Most existing dimensionality reduction systems focus on preserving one or a few significant structures in data. For many analysis tasks, however, several types of structures can be of high significance and the importance of a certain structure compared to the importance of another is often task-dependent. This paper introduces a system for dimensionality reduction by combining user-defined quality metrics using weight functions to preserve as many important structures as possible. The system aims at effective visualization and exploration of structures within large multivariate data sets and provides enhancement of diverse structures by supplying a range of automatic variable orderings. Furthermore it enables a quality-guided reduction of variables through an interactive display facilitating investigation of trade-offs between loss of structure and the number of variables to keep. The generality and interactivity of the system is demonstrated through a case scenario.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Multivariate data sets including hundreds of variables are increasingly common in many application areas. Most multivariate visualization techniques are unable to display such data effectively, and a common approach is to employ dimensionality reduction prior to visualization. Most existing dimensionality reduction systems focus on preserving one or a few significant structures in data. For many analysis tasks, however, several types of structures can be of high significance and the importance of a certain structure compared to the importance of another is often task-dependent. This paper introduces a system for dimensionality reduction by combining user-defined quality metrics using weight functions to preserve as many important structures as possible. The system aims at effective visualization and exploration of structures within large multivariate data sets and provides enhancement of diverse structures by supplying a range of automatic variable orderings. Furthermore it enables a quality-guided reduction of variables through an interactive display facilitating investigation of trade-offs between loss of structure and the number of variables to keep. The generality and interactivity of the system is demonstrated through a case scenario.",
"title": "Interactive Dimensionality Reduction Through User-defined Combinations of Quality Metrics",
"normalizedTitle": "Interactive Dimensionality Reduction Through User-defined Combinations of Quality Metrics",
"fno": "ttg2009060993",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Dimensionality Reduction",
"Interactivity",
"Quality Metrics",
"Variable Ordering"
],
"authors": [
{
"givenName": "Sara",
"surname": "Johansson",
"fullName": "Sara Johansson",
"affiliation": "Norrköping Visualization and Interaction Studio, Linköping University, Sweden",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jimmy",
"surname": "Johansson",
"fullName": "Jimmy Johansson",
"affiliation": "Norrköping Visualization and Interaction Studio, Linköping University, Sweden",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2009-11-01 00:00:00",
"pubType": "trans",
"pages": "993-1000",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icmla/2011/4607/1/4607a275",
"title": "Dimensionality Reduction by Unsupervised K-Nearest Neighbor Regression",
"doi": null,
"abstractUrl": "/proceedings-article/icmla/2011/4607a275/12OmNxWLTmw",
"parentPublication": {
"id": "proceedings/icmla/2011/4607/1",
"title": "Machine Learning and Applications, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dicta/2010/4271/0/4271a349",
"title": "Robust Dimensionality Reduction for Human Action Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/dicta/2010/4271a349/12OmNxwWoRF",
"parentPublication": {
"id": "proceedings/dicta/2010/4271/0",
"title": "2010 International Conference on Digital Image Computing: Techniques and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"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/ictai/2011/4596/0/4596a865",
"title": "Transferable Discriminative Dimensionality Reduction",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2011/4596a865/12OmNy3iFuF",
"parentPublication": {
"id": "proceedings/ictai/2011/4596/0",
"title": "2011 IEEE 23rd International Conference on Tools with Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isecs/2009/3643/2/3643b113",
"title": "Multimodal Biometrics Recognition by Dimensionality Reduction Method",
"doi": null,
"abstractUrl": "/proceedings-article/isecs/2009/3643b113/12OmNyQph63",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2009/3804/4/3804e275",
"title": "SVM-Induced Dimensionality Reduction and Classification",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2009/3804e275/12OmNzG4gwg",
"parentPublication": {
"id": "proceedings/icicta/2009/3804/4",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/04/ttp2011040657",
"title": "Central Subspace Dimensionality Reduction Using Covariance Operators",
"doi": null,
"abstractUrl": "/journal/tp/2011/04/ttp2011040657/13rRUwbJD63",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1989/03/i0304",
"title": "Dimensionality-Reduction Using Connectionist Networks",
"doi": null,
"abstractUrl": "/journal/tp/1989/03/i0304/13rRUxYrbN7",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904480",
"title": "Interactive Visual Cluster Analysis by Contrastive Dimensionality Reduction",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904480/1H0GkV5P1qo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009060985",
"articleId": "13rRUxASubx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2009061001",
"articleId": "13rRUxNW1TQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgLr",
"name": "ttg2009060993s.avi",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2009060993s.avi",
"extension": "avi",
"size": "35.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNy3iFo4",
"title": "June",
"year": "2011",
"issueNum": "06",
"idPrefix": "tp",
"pubType": "journal",
"volume": "33",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwgQprO",
"doi": "10.1109/TPAMI.2010.183",
"abstract": "In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. The resulting data representations are typically high-dimensional and assume diverse forms. Hence, finding a way of transforming them into a unified space of lower dimension generally facilitates the underlying tasks such as object recognition or clustering. To this end, the proposed approach (termed MKL-DR) generalizes the framework of multiple kernel learning for dimensionality reduction, and distinguishes itself with the following three main contributions: First, our method provides the convenience of using diverse image descriptors to describe useful characteristics of various aspects about the underlying data. Second, it extends a broad set of existing dimensionality reduction techniques to consider multiple kernel learning, and consequently improves their effectiveness. Third, by focusing on the techniques pertaining to dimensionality reduction, the formulation introduces a new class of applications with the multiple kernel learning framework to address not only the supervised learning problems but also the unsupervised and semi-supervised ones.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. The resulting data representations are typically high-dimensional and assume diverse forms. Hence, finding a way of transforming them into a unified space of lower dimension generally facilitates the underlying tasks such as object recognition or clustering. To this end, the proposed approach (termed MKL-DR) generalizes the framework of multiple kernel learning for dimensionality reduction, and distinguishes itself with the following three main contributions: First, our method provides the convenience of using diverse image descriptors to describe useful characteristics of various aspects about the underlying data. Second, it extends a broad set of existing dimensionality reduction techniques to consider multiple kernel learning, and consequently improves their effectiveness. Third, by focusing on the techniques pertaining to dimensionality reduction, the formulation introduces a new class of applications with the multiple kernel learning framework to address not only the supervised learning problems but also the unsupervised and semi-supervised ones.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. The resulting data representations are typically high-dimensional and assume diverse forms. Hence, finding a way of transforming them into a unified space of lower dimension generally facilitates the underlying tasks such as object recognition or clustering. To this end, the proposed approach (termed MKL-DR) generalizes the framework of multiple kernel learning for dimensionality reduction, and distinguishes itself with the following three main contributions: First, our method provides the convenience of using diverse image descriptors to describe useful characteristics of various aspects about the underlying data. Second, it extends a broad set of existing dimensionality reduction techniques to consider multiple kernel learning, and consequently improves their effectiveness. Third, by focusing on the techniques pertaining to dimensionality reduction, the formulation introduces a new class of applications with the multiple kernel learning framework to address not only the supervised learning problems but also the unsupervised and semi-supervised ones.",
"title": "Multiple Kernel Learning for Dimensionality Reduction",
"normalizedTitle": "Multiple Kernel Learning for Dimensionality Reduction",
"fno": "ttp2011061147",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Dimensionality Reduction",
"Multiple Kernel Learning",
"Object Categorization",
"Image Clustering",
"Face Recognition"
],
"authors": [
{
"givenName": "Yen-Yu",
"surname": "Lin",
"fullName": "Yen-Yu Lin",
"affiliation": "Academia Sinica, Taipei",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tyng-Luh",
"surname": "Liu",
"fullName": "Tyng-Luh Liu",
"affiliation": "Academia Sinica, Taipei",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chiou-Shann",
"surname": "Fuh",
"fullName": "Chiou-Shann Fuh",
"affiliation": "National Taiwan University, Taipei",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2011-06-01 00:00:00",
"pubType": "trans",
"pages": "1147-1160",
"year": "2011",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2010/4109/0/4109a173",
"title": "Effective Dimensionality Reduction Based on Support Vector Machine",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109a173/12OmNBPc8zC",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2009/3735/5/3735e071",
"title": "Predicting Membrane Protein Types with Dimensionality Reduction and Kernel Method",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2009/3735e071/12OmNC8uRAO",
"parentPublication": {
"id": "proceedings/fskd/2009/3735/5",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"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/ictai/2011/4596/0/4596a865",
"title": "Transferable Discriminative Dimensionality Reduction",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2011/4596a865/12OmNy3iFuF",
"parentPublication": {
"id": "proceedings/ictai/2011/4596/0",
"title": "2011 IEEE 23rd International Conference on Tools with Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2013/10/ttk2013102381",
"title": "Supervised Multiple Kernel Embedding for Learning Predictive Subspaces",
"doi": null,
"abstractUrl": "/journal/tk/2013/10/ttk2013102381/13rRUwInvta",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/04/ttp2011040657",
"title": "Central Subspace Dimensionality Reduction Using Covariance Operators",
"doi": null,
"abstractUrl": "/journal/tp/2011/04/ttp2011040657/13rRUwbJD63",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2007/12/i2143",
"title": "Orthogonal Neighborhood Preserving Projections: A Projection-Based Dimensionality Reduction Technique",
"doi": null,
"abstractUrl": "/journal/tp/2007/12/i2143/13rRUwbaqVU",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__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/bdicn/2022/8476/0/847600a360",
"title": "Reconfigurable Dimensionality Reduction Based on Joint Dictionary Learning and Applications",
"doi": null,
"abstractUrl": "/proceedings-article/bdicn/2022/847600a360/1CJgBnOIZsA",
"parentPublication": {
"id": "proceedings/bdicn/2022/8476/0",
"title": "2022 International Conference on Big Data, Information and Computer Network (BDICN）",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09543512",
"title": "Unsupervised Dimensionality Reduction Based on Fusing Multiple Clustering Results",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09543512/1x4UGJ56Qpy",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2011061132",
"articleId": "13rRUIJcWmq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2011061161",
"articleId": "13rRUxAASXn",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNy7QfpV",
"title": "June",
"year": "2000",
"issueNum": "06",
"idPrefix": "tp",
"pubType": "journal",
"volume": "22",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxNmPET",
"doi": "10.1109/34.862200",
"abstract": "Abstract—Linear projections for dimensionality reduction, computed using linear discriminant analysis (LDA), are commonly based on optimization of certain separability criteria in the output space. The resulting optimization problem is linear, but these separability criteria are not directly related to the classification accuracy in the output space. Consequently, a trial and error procedure has to be invoked, experimenting with different separability criteria that differ in the weighting function used and selecting the one that performed best on the training set. Often, even the best weighting function among the trial choices results in poor classification of data in the subspace. In this short paper, we introduce the concept of fractional dimensionality and develop an incremental procedure, called the fractional-step LDA (F-LDA) to reduce the dimensionality in fractional steps. The F-LDA algorithm is more robust to the selection of weighting function and for any given weighting function, it finds a subspace in which the classification accuracy is higher than that obtained using LDA.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Linear projections for dimensionality reduction, computed using linear discriminant analysis (LDA), are commonly based on optimization of certain separability criteria in the output space. The resulting optimization problem is linear, but these separability criteria are not directly related to the classification accuracy in the output space. Consequently, a trial and error procedure has to be invoked, experimenting with different separability criteria that differ in the weighting function used and selecting the one that performed best on the training set. Often, even the best weighting function among the trial choices results in poor classification of data in the subspace. In this short paper, we introduce the concept of fractional dimensionality and develop an incremental procedure, called the fractional-step LDA (F-LDA) to reduce the dimensionality in fractional steps. The F-LDA algorithm is more robust to the selection of weighting function and for any given weighting function, it finds a subspace in which the classification accuracy is higher than that obtained using LDA.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Linear projections for dimensionality reduction, computed using linear discriminant analysis (LDA), are commonly based on optimization of certain separability criteria in the output space. The resulting optimization problem is linear, but these separability criteria are not directly related to the classification accuracy in the output space. Consequently, a trial and error procedure has to be invoked, experimenting with different separability criteria that differ in the weighting function used and selecting the one that performed best on the training set. Often, even the best weighting function among the trial choices results in poor classification of data in the subspace. In this short paper, we introduce the concept of fractional dimensionality and develop an incremental procedure, called the fractional-step LDA (F-LDA) to reduce the dimensionality in fractional steps. The F-LDA algorithm is more robust to the selection of weighting function and for any given weighting function, it finds a subspace in which the classification accuracy is higher than that obtained using LDA.",
"title": "Fractional-Step Dimensionality Reduction",
"normalizedTitle": "Fractional-Step Dimensionality Reduction",
"fno": "i0623",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Dimensionality Reduction",
"Classification",
"Fishers Linear Discriminant"
],
"authors": [
{
"givenName": "Rohit",
"surname": "Lotlikar",
"fullName": "Rohit Lotlikar",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ravi",
"surname": "Kothari",
"fullName": "Ravi Kothari",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2000-06-01 00:00:00",
"pubType": "trans",
"pages": "623-627",
"year": "2000",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0610",
"articleId": "13rRUxZ0o2w",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0628",
"articleId": "13rRUxly8U1",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1IbM4t1NH1K",
"title": "Dec.",
"year": "2022",
"issueNum": "06",
"idPrefix": "bd",
"pubType": "journal",
"volume": "8",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1twasK9vXtS",
"doi": "10.1109/TBDATA.2021.3079200",
"abstract": "Dimensionality reduction is commonly used for identifying and analyzing patterns in the visual analysis of multi-dimensional datasets. The selection of subspaces is a core building block in projecting high-dimensional data to low-dimensional space, which is usually illustrated as a scatterplot for analysts to easily understand and explore. This process involves human prior knowledge and domain-specific requirements. Thus, quantifying and tracking the changes of dimensionality reduction results across subspaces remain challenging. Existing methods can neither quantify the subsets-based changes of dimensionality reduction results when switching subspaces, nor automatically and comprehensively display the overall and subtle differences among dimensionality reduction results. To address this, we developed <italic>EvoSets</italic>, a novel visual analytics system designed to help users understand how subspaces affect dimensionality reduction results. The effects are quantified based on the distribution of subsets within projections to tracking the sensitivity of dimensionality reduction results across subspaces. In addition, the system supports the exploration of the overall evolution of the dimensionality reduction results for helping users track the convergence and divergence behavior changes of subsets based on an extended <italic>Bubble Sets</italic> visualization. Similarities are intuitively illustrated, and dissimilarities are highlighted among the generated dimensionality reduction results across subspaces based on different layout constraints. The usefulness and effectiveness of the system are further evaluated with a user study and two case studies on multi-dimensional datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Dimensionality reduction is commonly used for identifying and analyzing patterns in the visual analysis of multi-dimensional datasets. The selection of subspaces is a core building block in projecting high-dimensional data to low-dimensional space, which is usually illustrated as a scatterplot for analysts to easily understand and explore. This process involves human prior knowledge and domain-specific requirements. Thus, quantifying and tracking the changes of dimensionality reduction results across subspaces remain challenging. Existing methods can neither quantify the subsets-based changes of dimensionality reduction results when switching subspaces, nor automatically and comprehensively display the overall and subtle differences among dimensionality reduction results. To address this, we developed <italic>EvoSets</italic>, a novel visual analytics system designed to help users understand how subspaces affect dimensionality reduction results. The effects are quantified based on the distribution of subsets within projections to tracking the sensitivity of dimensionality reduction results across subspaces. In addition, the system supports the exploration of the overall evolution of the dimensionality reduction results for helping users track the convergence and divergence behavior changes of subsets based on an extended <italic>Bubble Sets</italic> visualization. Similarities are intuitively illustrated, and dissimilarities are highlighted among the generated dimensionality reduction results across subspaces based on different layout constraints. The usefulness and effectiveness of the system are further evaluated with a user study and two case studies on multi-dimensional datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Dimensionality reduction is commonly used for identifying and analyzing patterns in the visual analysis of multi-dimensional datasets. The selection of subspaces is a core building block in projecting high-dimensional data to low-dimensional space, which is usually illustrated as a scatterplot for analysts to easily understand and explore. This process involves human prior knowledge and domain-specific requirements. Thus, quantifying and tracking the changes of dimensionality reduction results across subspaces remain challenging. Existing methods can neither quantify the subsets-based changes of dimensionality reduction results when switching subspaces, nor automatically and comprehensively display the overall and subtle differences among dimensionality reduction results. To address this, we developed EvoSets, a novel visual analytics system designed to help users understand how subspaces affect dimensionality reduction results. The effects are quantified based on the distribution of subsets within projections to tracking the sensitivity of dimensionality reduction results across subspaces. In addition, the system supports the exploration of the overall evolution of the dimensionality reduction results for helping users track the convergence and divergence behavior changes of subsets based on an extended Bubble Sets visualization. Similarities are intuitively illustrated, and dissimilarities are highlighted among the generated dimensionality reduction results across subspaces based on different layout constraints. The usefulness and effectiveness of the system are further evaluated with a user study and two case studies on multi-dimensional datasets.",
"title": "EvoSets: Tracking the Sensitivity of Dimensionality Reduction Results Across Subspaces",
"normalizedTitle": "EvoSets: Tracking the Sensitivity of Dimensionality Reduction Results Across Subspaces",
"fno": "09428524",
"hasPdf": true,
"idPrefix": "bd",
"keywords": [
"Convergence",
"Data Analysis",
"Data Preparation",
"Data Visualisation",
"Convergence Behavior",
"Dimensionality Reduction Sensitivity",
"Divergence Behavior",
"Evo Sets",
"Extended Bubble Sets Visualization",
"Multidimensional Datasets",
"Subspaces",
"Visual Analytics System",
"Dimensionality Reduction",
"Visualization",
"Correlation",
"Data Visualization",
"Convergence",
"Big Data",
"Layout",
"Subspace",
"Dimensionality Reduction Result",
"Convergence And Divergence Behavior Changes",
"Comparison"
],
"authors": [
{
"givenName": "Guodao",
"surname": "Sun",
"fullName": "Guodao Sun",
"affiliation": "Zhejiang University of Technology, HangZhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sujia",
"surname": "Zhu",
"fullName": "Sujia Zhu",
"affiliation": "Zhejiang University of Technology, HangZhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qi",
"surname": "Jiang",
"fullName": "Qi Jiang",
"affiliation": "Zhejiang University of Technology, HangZhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wang",
"surname": "Xia",
"fullName": "Wang Xia",
"affiliation": "Zhejiang University of Technology, HangZhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ronghua",
"surname": "Liang",
"fullName": "Ronghua Liang",
"affiliation": "Zhejiang University of Technology, HangZhou, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "1566-1579",
"year": "2022",
"issn": "2332-7790",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/avss/2012/4797/0/4797a130",
"title": "Analyzing the Subspaces Obtained by Dimensionality Reduction for Human Action Recognition from 3d Data",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2012/4797a130/12OmNBscCXK",
"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/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": "trans/tp/2011/04/ttp2011040657",
"title": "Central Subspace Dimensionality Reduction Using Covariance Operators",
"doi": null,
"abstractUrl": "/journal/tp/2011/04/ttp2011040657/13rRUwbJD63",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1989/03/i0304",
"title": "Dimensionality-Reduction Using Connectionist Networks",
"doi": null,
"abstractUrl": "/journal/tp/1989/03/i0304/13rRUxYrbN7",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/03/09782552",
"title": "Low Dimensional Trajectory Hypothesis is True: DNNs Can Be Trained in Tiny Subspaces",
"doi": null,
"abstractUrl": "/journal/tp/2023/03/09782552/1DGRXLmbrWw",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2022/2335/0/233500a011",
"title": "Incorporating Texture Information into Dimensionality Reduction for High-Dimensional Images",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2022/233500a011/1E2wiOFBEbe",
"parentPublication": {
"id": "proceedings/pacificvis/2022/2335/0",
"title": "2022 IEEE 15th Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904480",
"title": "Interactive Visual Cluster Analysis by Contrastive Dimensionality Reduction",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904480/1H0GkV5P1qo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/05/09128033",
"title": "Interpretation of Structural Preservation in Low-Dimensional Embeddings",
"doi": null,
"abstractUrl": "/journal/tk/2022/05/09128033/1l3u8JV5SP6",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09543512",
"title": "Unsupervised Dimensionality Reduction Based on Fusing Multiple Clustering Results",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09543512/1x4UGJ56Qpy",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2021/3335/0/333500a026",
"title": "Semantic Explanation of Interactive Dimensionality Reduction",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2021/333500a026/1yXuftZECbe",
"parentPublication": {
"id": "proceedings/vis/2021/3335/0",
"title": "2021 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09366965",
"articleId": "1rDQEF3Zy1i",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09392332",
"articleId": "1sq7oegaNby",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNC8uRnm",
"title": "January",
"year": "2007",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": "29",
"label": "January",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxEhFtN",
"doi": "10.1109/TPAMI.2007.250598",
"abstract": "A large family of algorithms - supervised or unsupervised; stemming from statistics or geometry theory - has been designed to provide different solutions to the problem of dimensionality reduction. Despite the different motivations of these algorithms, we present in this paper a general formulation known as graph embedding to unify them within a common framework. In graph embedding, each algorithm can be considered as the direct graph embedding or its linear/kernel/tensor extension of a specific intrinsic graph that describes certain desired statistical or geometric properties of a data set, with constraints from scale normalization or a penalty graph that characterizes a statistical or geometric property that should be avoided. Furthermore, the graph embedding framework can be used as a general platform for developing new dimensionality reduction algorithms. By utilizing this framework as a tool, we propose a new supervised dimensionality reduction algorithm called marginal Fisher analysis in which the intrinsic graph characterizes the intraclass compactness and connects each data point with its neighboring points of the same class, while the penalty graph connects the marginal points and characterizes the interclass separability. We show that MFA effectively overcomes the limitations of the traditional linear discriminant analysis algorithm due to data distribution assumptions and available projection directions. Real face recognition experiments show the superiority of our proposed MFA in comparison to LDA, also for corresponding kernel and tensor extensions",
"abstracts": [
{
"abstractType": "Regular",
"content": "A large family of algorithms - supervised or unsupervised; stemming from statistics or geometry theory - has been designed to provide different solutions to the problem of dimensionality reduction. Despite the different motivations of these algorithms, we present in this paper a general formulation known as graph embedding to unify them within a common framework. In graph embedding, each algorithm can be considered as the direct graph embedding or its linear/kernel/tensor extension of a specific intrinsic graph that describes certain desired statistical or geometric properties of a data set, with constraints from scale normalization or a penalty graph that characterizes a statistical or geometric property that should be avoided. Furthermore, the graph embedding framework can be used as a general platform for developing new dimensionality reduction algorithms. By utilizing this framework as a tool, we propose a new supervised dimensionality reduction algorithm called marginal Fisher analysis in which the intrinsic graph characterizes the intraclass compactness and connects each data point with its neighboring points of the same class, while the penalty graph connects the marginal points and characterizes the interclass separability. We show that MFA effectively overcomes the limitations of the traditional linear discriminant analysis algorithm due to data distribution assumptions and available projection directions. Real face recognition experiments show the superiority of our proposed MFA in comparison to LDA, also for corresponding kernel and tensor extensions",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A large family of algorithms - supervised or unsupervised; stemming from statistics or geometry theory - has been designed to provide different solutions to the problem of dimensionality reduction. Despite the different motivations of these algorithms, we present in this paper a general formulation known as graph embedding to unify them within a common framework. In graph embedding, each algorithm can be considered as the direct graph embedding or its linear/kernel/tensor extension of a specific intrinsic graph that describes certain desired statistical or geometric properties of a data set, with constraints from scale normalization or a penalty graph that characterizes a statistical or geometric property that should be avoided. Furthermore, the graph embedding framework can be used as a general platform for developing new dimensionality reduction algorithms. By utilizing this framework as a tool, we propose a new supervised dimensionality reduction algorithm called marginal Fisher analysis in which the intrinsic graph characterizes the intraclass compactness and connects each data point with its neighboring points of the same class, while the penalty graph connects the marginal points and characterizes the interclass separability. We show that MFA effectively overcomes the limitations of the traditional linear discriminant analysis algorithm due to data distribution assumptions and available projection directions. Real face recognition experiments show the superiority of our proposed MFA in comparison to LDA, also for corresponding kernel and tensor extensions",
"title": "Graph Embedding and Extensions: A General Framework for Dimensionality Reduction",
"normalizedTitle": "Graph Embedding and Extensions: A General Framework for Dimensionality Reduction",
"fno": "04016549",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Kernel",
"Tensile Stress",
"Linear Discriminant Analysis",
"Principal Component Analysis",
"Laplace Equations",
"Algorithm Design And Analysis",
"Vectors",
"Statistics",
"Geometry",
"Face Recognition",
"Graph Embedding Framework",
"Dimensionality Reduction",
"Manifold Learning",
"Subspace Learning"
],
"authors": [
{
"givenName": "Shuicheng",
"surname": "Yan",
"fullName": "Shuicheng Yan",
"affiliation": "Beckman Institute, University of Illinois at Urbana- Champaign, Urbana, IL",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dong",
"surname": "Xu",
"fullName": "Dong Xu",
"affiliation": "Department of Electrical Engineering, Columbia University, New York, NY",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Benyu",
"surname": "Zhang",
"fullName": "Benyu Zhang",
"affiliation": "Microsoft Research Asia, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hong-jiang",
"surname": "Zhang",
"fullName": "Hong-jiang Zhang",
"affiliation": "Microsoft Research Asia, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qiang",
"surname": "Yang",
"fullName": "Qiang Yang",
"affiliation": "Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stephen",
"surname": "Lin",
"fullName": "Stephen Lin",
"affiliation": "Microsoft Research Asia, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2007-01-01 00:00:00",
"pubType": "trans",
"pages": "40-51",
"year": "2007",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdar/2013/4999/0/06628827",
"title": "An Empirical Evaluation of Supervised Dimensionality Reduction for Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2013/06628827/12OmNApu5Ku",
"parentPublication": {
"id": "proceedings/icdar/2013/4999/0",
"title": "2013 12th International Conference on Document Analysis and Recognition (ICDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2005/2372/2/237220830",
"title": "Graph Embedding: A General Framework for Dimensionality Reduction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2005/237220830/12OmNBkxsoY",
"parentPublication": {
"id": "proceedings/cvpr/2005/2372/2",
"title": "2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761254",
"title": "Local Regularized Least-Square Dimensionality Reduction",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761254/12OmNviZlgj",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2009/4442/0/05457696",
"title": "Multilinear Isometric Embedding for visual pattern analysis",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2009/05457696/12OmNvwC5uK",
"parentPublication": {
"id": "proceedings/iccvw/2009/4442/0",
"title": "2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460366",
"title": "Graph-based dimensionality reduction for KNN-based image annotation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460366/12OmNzTppIy",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2007/01/i0040",
"title": "Graph Embedding and Extensions: A General Framework for Dimensionality Reduction",
"doi": null,
"abstractUrl": "/journal/tp/2007/01/i0040/13rRUB7a12a",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2019/01/08226989",
"title": "Probabilistic Dimensionality Reduction via Structure Learning",
"doi": null,
"abstractUrl": "/journal/tp/2019/01/08226989/17D45XDIXQx",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904619",
"title": "Predicting User Preferences of Dimensionality Reduction Embedding Quality",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904619/1H1ggvuBvMc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/10/09314042",
"title": "Adaptive Local Embedding Learning for Semi-Supervised Dimensionality Reduction",
"doi": null,
"abstractUrl": "/journal/tk/2022/10/09314042/1q8U4AEHVTy",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09543512",
"title": "Unsupervised Dimensionality Reduction Based on Fusing Multiple Clustering Results",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09543512/1x4UGJ56Qpy",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "04016548",
"articleId": "13rRUwI5TYB",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04016550",
"articleId": "13rRUxZ0o2z",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAHW0Jb",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": "41",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45XDIXQx",
"doi": "10.1109/TPAMI.2017.2785402",
"abstract": "We propose an alternative probabilistic dimensionality reduction framework that can naturally integrate the generative model and the locality information of data. Based on this framework, we present a new model, which is able to learn a set of embedding points in a low-dimensional space by retaining the inherent structure from high-dimensional data. The objective function of this new model can be equivalently interpreted as two coupled learning problems, i.e., structure learning and the learning of projection matrix. Inspired by this interesting interpretation, we propose another model, which finds a set of embedding points that can directly form an explicit graph structure. We proved that the model by learning explicit graphs generalizes the reversed graph embedding method, but leads to a natural interpretation from Bayesian perspective. This can greatly facilitate data visualization and scientific discovery in downstream analysis. Extensive experiments are performed that demonstrate that the proposed framework is able to retain the inherent structure of datasets and achieve competitive quantitative results in terms of various performance evaluation criteria.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose an alternative probabilistic dimensionality reduction framework that can naturally integrate the generative model and the locality information of data. Based on this framework, we present a new model, which is able to learn a set of embedding points in a low-dimensional space by retaining the inherent structure from high-dimensional data. The objective function of this new model can be equivalently interpreted as two coupled learning problems, i.e., structure learning and the learning of projection matrix. Inspired by this interesting interpretation, we propose another model, which finds a set of embedding points that can directly form an explicit graph structure. We proved that the model by learning explicit graphs generalizes the reversed graph embedding method, but leads to a natural interpretation from Bayesian perspective. This can greatly facilitate data visualization and scientific discovery in downstream analysis. Extensive experiments are performed that demonstrate that the proposed framework is able to retain the inherent structure of datasets and achieve competitive quantitative results in terms of various performance evaluation criteria.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose an alternative probabilistic dimensionality reduction framework that can naturally integrate the generative model and the locality information of data. Based on this framework, we present a new model, which is able to learn a set of embedding points in a low-dimensional space by retaining the inherent structure from high-dimensional data. The objective function of this new model can be equivalently interpreted as two coupled learning problems, i.e., structure learning and the learning of projection matrix. Inspired by this interesting interpretation, we propose another model, which finds a set of embedding points that can directly form an explicit graph structure. We proved that the model by learning explicit graphs generalizes the reversed graph embedding method, but leads to a natural interpretation from Bayesian perspective. This can greatly facilitate data visualization and scientific discovery in downstream analysis. Extensive experiments are performed that demonstrate that the proposed framework is able to retain the inherent structure of datasets and achieve competitive quantitative results in terms of various performance evaluation criteria.",
"title": "Probabilistic Dimensionality Reduction via Structure Learning",
"normalizedTitle": "Probabilistic Dimensionality Reduction via Structure Learning",
"fno": "08226989",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Data Models",
"Probabilistic Logic",
"Manifolds",
"Kernel",
"Principal Component Analysis",
"Data Visualization",
"Nonlinear Dimensionality Reduction",
"Structure Learning",
"Probabilistic Models",
"Latent Variable Model"
],
"authors": [
{
"givenName": "Li",
"surname": "Wang",
"fullName": "Li Wang",
"affiliation": "Department of Mathematics, University of Texas at Arlington, Arlington, TX",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qi",
"surname": "Mao",
"fullName": "Qi Mao",
"affiliation": "HERE North America LLC, Chicago, IL",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "205-219",
"year": "2019",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2008/2174/0/04761254",
"title": "Local Regularized Least-Square Dimensionality Reduction",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761254/12OmNviZlgj",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2014/4308/0/4308a496",
"title": "Generalized Autoencoder: A Neural Network Framework for Dimensionality Reduction",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2014/4308a496/12OmNyYm2CH",
"parentPublication": {
"id": "proceedings/cvprw/2014/4308/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2016/07/07293680",
"title": "Nonlinear Dimensionality Reduction via Path-Based Isometric Mapping",
"doi": null,
"abstractUrl": "/journal/tp/2016/07/07293680/13rRUwfZC1K",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/04/v0459",
"title": "Robust Linear Dimensionality Reduction",
"doi": null,
"abstractUrl": "/journal/tg/2004/04/v0459/13rRUxBJhFl",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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/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": "trans/tk/2022/04/09107495",
"title": "Dimensionality Reduction Based on Multilocal Linear Pattern Preservation",
"doi": null,
"abstractUrl": "/journal/tk/2022/04/09107495/1kmkvJGgz96",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/10/09314042",
"title": "Adaptive Local Embedding Learning for Semi-Supervised Dimensionality Reduction",
"doi": null,
"abstractUrl": "/journal/tk/2022/10/09314042/1q8U4AEHVTy",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09543512",
"title": "Unsupervised Dimensionality Reduction Based on Fusing Multiple Clustering Results",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09543512/1x4UGJ56Qpy",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552226",
"title": "Revisiting Dimensionality Reduction Techniques for Visual Cluster Analysis: An Empirical Study",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552226/1xicaXrIayI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08187699",
"articleId": "17D45W1Oa2Z",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08128485",
"articleId": "17D45WnnFYY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet2E",
"name": "ttp201901-08226989s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp201901-08226989s1.zip",
"extension": "zip",
"size": "1.6 MB",
"__typename": "WebExtraType"
}
],
"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": "1yoxyIQPsqs",
"doi": "10.1109/TKDE.2021.3126642",
"abstract": "Emerging data-driven technologies and big data analytics generate and deal with high-dimensional data. Transformation of such data into a low-dimensional feature space comes with several benefits, such as a more discriminant feature space, performance enhancement, less computational burden, and facilitating data visualization. This paper proposes a novel dimensionality reduction algorithm based on generative adversarial networks to tackle the issues related to high-dimensional data and common challenges in dimensionality reduction. To this aim, two constraints are defined to preserve the characteristics of the original data while rectifying the data distribution upon transformation. Formulating the transformation as sequential projections, the proposed Constrained Adversarial Dimensionality Reduction (CADR) method finds a set of sequential weight vectors that lead to a feature space in which between-class separability and within-class integrity are satisfied. This is while the transformed data perfectly comply with the pairwise affinity correlation in the original feature space. To evaluate the proposed method, nine advanced dimensionality reduction techniques are employed to enable a comparative study. The experiments are performed on several real-world benchmark datasets in terms of classification accuracy, F-measure, and G-mean. The obtained results show that CADR could yield classification performance at a satisfactory level and outperforms the other competitors.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Emerging data-driven technologies and big data analytics generate and deal with high-dimensional data. Transformation of such data into a low-dimensional feature space comes with several benefits, such as a more discriminant feature space, performance enhancement, less computational burden, and facilitating data visualization. This paper proposes a novel dimensionality reduction algorithm based on generative adversarial networks to tackle the issues related to high-dimensional data and common challenges in dimensionality reduction. To this aim, two constraints are defined to preserve the characteristics of the original data while rectifying the data distribution upon transformation. Formulating the transformation as sequential projections, the proposed Constrained Adversarial Dimensionality Reduction (CADR) method finds a set of sequential weight vectors that lead to a feature space in which between-class separability and within-class integrity are satisfied. This is while the transformed data perfectly comply with the pairwise affinity correlation in the original feature space. To evaluate the proposed method, nine advanced dimensionality reduction techniques are employed to enable a comparative study. The experiments are performed on several real-world benchmark datasets in terms of classification accuracy, F-measure, and G-mean. The obtained results show that CADR could yield classification performance at a satisfactory level and outperforms the other competitors.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Emerging data-driven technologies and big data analytics generate and deal with high-dimensional data. Transformation of such data into a low-dimensional feature space comes with several benefits, such as a more discriminant feature space, performance enhancement, less computational burden, and facilitating data visualization. This paper proposes a novel dimensionality reduction algorithm based on generative adversarial networks to tackle the issues related to high-dimensional data and common challenges in dimensionality reduction. To this aim, two constraints are defined to preserve the characteristics of the original data while rectifying the data distribution upon transformation. Formulating the transformation as sequential projections, the proposed Constrained Adversarial Dimensionality Reduction (CADR) method finds a set of sequential weight vectors that lead to a feature space in which between-class separability and within-class integrity are satisfied. This is while the transformed data perfectly comply with the pairwise affinity correlation in the original feature space. To evaluate the proposed method, nine advanced dimensionality reduction techniques are employed to enable a comparative study. The experiments are performed on several real-world benchmark datasets in terms of classification accuracy, F-measure, and G-mean. The obtained results show that CADR could yield classification performance at a satisfactory level and outperforms the other competitors.",
"title": "Constrained Generative Adversarial Learning for Dimensionality Reduction",
"normalizedTitle": "Constrained Generative Adversarial Learning for Dimensionality Reduction",
"fno": "09609642",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Big Data",
"Data Analysis",
"Data Visualisation",
"Feature Extraction",
"Image Classification",
"Learning Artificial Intelligence",
"Pattern Classification",
"Advanced Dimensionality Reduction Techniques",
"Big Data Analytics Generate",
"Constrained Adversarial Dimensionality Reduction Method",
"Constrained Generative Adversarial",
"Data Distribution",
"Data Visualization",
"Dimensionality Reduction Algorithm",
"Discriminant Feature Space",
"Emerging Data Driven Technologies",
"Generative Adversarial Networks",
"High Dimensional Data",
"Low Dimensional Feature Space",
"Transformed Data",
"Principal Component Analysis",
"Dimensionality Reduction",
"Feature Extraction",
"Generative Adversarial Networks",
"Optimization",
"Data Visualization",
"Correlation",
"Generative Adversarial Networks",
"Dimensionality Reduction",
"Deep Learning",
"Supervised Learning",
"Affinity Correlation",
"Separability Constraint"
],
"authors": [
{
"givenName": "Ehsan",
"surname": "Hallaji",
"fullName": "Ehsan Hallaji",
"affiliation": "Department of Electrical and Computer Engineering, University of Windsor, Windsor, ON, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Maryam",
"surname": "Farajzadeh-Zanjani",
"fullName": "Maryam Farajzadeh-Zanjani",
"affiliation": "Department of Electrical and Computer Engineering, University of Windsor, Windsor, ON, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Roozbeh",
"surname": "Razavi-Far",
"fullName": "Roozbeh Razavi-Far",
"affiliation": "Department of Electrical and Computer Engineering, University of Windsor, Windsor, ON, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vasile",
"surname": "Palade",
"fullName": "Vasile Palade",
"affiliation": "Centre for Data Science, Coventry University, Coventry, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mehrdad",
"surname": "Saif",
"fullName": "Mehrdad Saif",
"affiliation": "Department of Electrical and Computer Engineering, University of Windsor, Windsor, ON, Canada",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2023-03-01 00:00:00",
"pubType": "trans",
"pages": "2394-2405",
"year": "2023",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dicta/2010/4271/0/4271a349",
"title": "Robust Dimensionality Reduction for Human Action Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/dicta/2010/4271a349/12OmNxwWoRF",
"parentPublication": {
"id": "proceedings/dicta/2010/4271/0",
"title": "2010 International Conference on Digital Image Computing: Techniques and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"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/ictai/2011/4596/0/4596a865",
"title": "Transferable Discriminative Dimensionality Reduction",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2011/4596a865/12OmNy3iFuF",
"parentPublication": {
"id": "proceedings/ictai/2011/4596/0",
"title": "2011 IEEE 23rd International Conference on Tools with Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmla/2009/3926/0/3926a771",
"title": "Improving Fusion of Dimensionality Reduction Methods for Nearest Neighbor Classification",
"doi": null,
"abstractUrl": "/proceedings-article/icmla/2009/3926a771/12OmNyUWR6J",
"parentPublication": {
"id": "proceedings/icmla/2009/3926/0",
"title": "Machine Learning and Applications, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis/2018/5892/0/08466379",
"title": "Research on Feature Dimensionality Reduction in Content Based Public Cultural Video Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2018/08466379/13Jkr9njwcw",
"parentPublication": {
"id": "proceedings/icis/2018/5892/0",
"title": "2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS)",
"__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/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/tk/2023/03/09543512",
"title": "Unsupervised Dimensionality Reduction Based on Fusing Multiple Clustering Results",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09543512/1x4UGJ56Qpy",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09560111",
"articleId": "1xtOlm6CIDK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09548829",
"articleId": "1xeS7hT9Bni",
"__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": "1cG6uHFRwqI",
"doi": "10.1109/TVCG.2019.2934209",
"abstract": "The collection of large, complex datasets has become common across a wide variety of domains. Visual analytics tools increasingly play a key role in exploring and answering complex questions about these large datasets. However, many visualizations are not designed to concurrently visualize the large number of dimensions present in complex datasets (e.g. tens of thousands of distinct codes in an electronic health record system). This fact, combined with the ability of many visual analytics systems to enable rapid, ad-hoc specification of groups, or cohorts, of individuals based on a small subset of visualized dimensions, leads to the possibility of introducing selection bias-when the user creates a cohort based on a specified set of dimensions, differences across many other unseen dimensions may also be introduced. These unintended side effects may result in the cohort no longer being representative of the larger population intended to be studied, which can negatively affect the validity of subsequent analyses. We present techniques for selection bias tracking and visualization that can be incorporated into high-dimensional exploratory visual analytics systems, with a focus on medical data with existing data hierarchies. These techniques include: (1) tree-based cohort provenance and visualization, including a user-specified baseline cohort that all other cohorts are compared against, and visual encoding of cohort “drift”, which indicates where selection bias may have occurred, and (2) a set of visualizations, including a novel icicle-plot based visualization, to compare in detail the per-dimension differences between the baseline and a user-specified focus cohort. These techniques are integrated into a medical temporal event sequence visual analytics tool. We present example use cases and report findings from domain expert user interviews.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The collection of large, complex datasets has become common across a wide variety of domains. Visual analytics tools increasingly play a key role in exploring and answering complex questions about these large datasets. However, many visualizations are not designed to concurrently visualize the large number of dimensions present in complex datasets (e.g. tens of thousands of distinct codes in an electronic health record system). This fact, combined with the ability of many visual analytics systems to enable rapid, ad-hoc specification of groups, or cohorts, of individuals based on a small subset of visualized dimensions, leads to the possibility of introducing selection bias-when the user creates a cohort based on a specified set of dimensions, differences across many other unseen dimensions may also be introduced. These unintended side effects may result in the cohort no longer being representative of the larger population intended to be studied, which can negatively affect the validity of subsequent analyses. We present techniques for selection bias tracking and visualization that can be incorporated into high-dimensional exploratory visual analytics systems, with a focus on medical data with existing data hierarchies. These techniques include: (1) tree-based cohort provenance and visualization, including a user-specified baseline cohort that all other cohorts are compared against, and visual encoding of cohort “drift”, which indicates where selection bias may have occurred, and (2) a set of visualizations, including a novel icicle-plot based visualization, to compare in detail the per-dimension differences between the baseline and a user-specified focus cohort. These techniques are integrated into a medical temporal event sequence visual analytics tool. We present example use cases and report findings from domain expert user interviews.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The collection of large, complex datasets has become common across a wide variety of domains. Visual analytics tools increasingly play a key role in exploring and answering complex questions about these large datasets. However, many visualizations are not designed to concurrently visualize the large number of dimensions present in complex datasets (e.g. tens of thousands of distinct codes in an electronic health record system). This fact, combined with the ability of many visual analytics systems to enable rapid, ad-hoc specification of groups, or cohorts, of individuals based on a small subset of visualized dimensions, leads to the possibility of introducing selection bias-when the user creates a cohort based on a specified set of dimensions, differences across many other unseen dimensions may also be introduced. These unintended side effects may result in the cohort no longer being representative of the larger population intended to be studied, which can negatively affect the validity of subsequent analyses. We present techniques for selection bias tracking and visualization that can be incorporated into high-dimensional exploratory visual analytics systems, with a focus on medical data with existing data hierarchies. These techniques include: (1) tree-based cohort provenance and visualization, including a user-specified baseline cohort that all other cohorts are compared against, and visual encoding of cohort “drift”, which indicates where selection bias may have occurred, and (2) a set of visualizations, including a novel icicle-plot based visualization, to compare in detail the per-dimension differences between the baseline and a user-specified focus cohort. These techniques are integrated into a medical temporal event sequence visual analytics tool. We present example use cases and report findings from domain expert user interviews.",
"title": "Selection Bias Tracking and Detailed Subset Comparison for High-Dimensional Data",
"normalizedTitle": "Selection Bias Tracking and Detailed Subset Comparison for High-Dimensional Data",
"fno": "08807213",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Medical Information Systems",
"Set Theory",
"Trees Mathematics",
"Visual Analytics Tools",
"High Dimensional Data",
"Subset Comparison",
"Domain Expert User Interviews",
"Medical Temporal Event Sequence Visual Analytics Tool",
"User Specified Focus Cohort",
"Per Dimension Differences",
"Icicle Plot Based Visualization",
"Visual Encoding",
"User Specified Baseline Cohort",
"Data Hierarchies",
"Medical Data",
"High Dimensional Exploratory Visual Analytics Systems",
"Selection Bias Tracking",
"Unseen Dimensions",
"Selection Bias When",
"Visualized Dimensions",
"Electronic Health Record System",
"Complex Datasets",
"Complex Questions",
"Data Visualization",
"Visual Analytics",
"Encoding",
"Tools",
"Complexity Theory",
"Medical Diagnostic Imaging",
"High Dimensional Visualization",
"Visual Analytics",
"Cohort Selection",
"Medical Informatics",
"Selection Bias"
],
"authors": [
{
"givenName": "David",
"surname": "Borland",
"fullName": "David Borland",
"affiliation": "RENCI, University of North Carolina, Chapel Hill",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wenyuan",
"surname": "Wang",
"fullName": "Wenyuan Wang",
"affiliation": "School of Information and Library Science, University of North Carolina, Chapel Hill",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jonathan",
"surname": "Zhang",
"fullName": "Jonathan Zhang",
"affiliation": "Dept. of Biostatistics, University of North Carolina, Chapel Hill",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Joshua",
"surname": "Shrestha",
"fullName": "Joshua Shrestha",
"affiliation": "Dept. of Computer Science, University of North Carolina, Chapel Hill",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Gotz",
"fullName": "David Gotz",
"affiliation": "School of Information and Library Science, University of North Carolina, Chapel Hill",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "429-439",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/eisic/2016/2857/0/07870211",
"title": "A Framework for Cognitive Bias Detection and Feedback in a Visual Analytics Environment",
"doi": null,
"abstractUrl": "/proceedings-article/eisic/2016/07870211/12OmNz5apw2",
"parentPublication": {
"id": "proceedings/eisic/2016/2857/0",
"title": "2016 European Intelligence and Security Informatics Conference (EISIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06876009",
"title": "Interactive Visual Analysis of Image-Centric Cohort Study Data",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06876009/13rRUxASu0L",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2017/3163/0/08585669",
"title": "Warning, Bias May Occur: A Proposed Approach to Detecting Cognitive Bias in Interactive Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2017/08585669/17D45X0yjSw",
"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/2023/01/09903515",
"title": "A Unified Comparison of User Modeling Techniques for Predicting Data Interaction and Detecting Exploration Bias",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903515/1GZokjZcWFq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a110",
"title": "Toward Systematic Considerations of Missingness in Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a110/1J6heLU2nNS",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vds/2022/5721/0/572100a001",
"title": "Case Study Comparison of Computational Notebook Platforms for Interactive Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vds/2022/572100a001/1JezLhI4Vm8",
"parentPublication": {
"id": "proceedings/vds/2022/5721/0",
"title": "2022 IEEE Visualization in Data Science (VDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vahc/2019/2423/0/08945029",
"title": "Dynamic Hierarchical Aggregation, Selection Bias Tracking, and Detailed Subset Comparison for High-Dimensional Event Sequence Data",
"doi": null,
"abstractUrl": "/proceedings-article/vahc/2019/08945029/1grQjnSzdYs",
"parentPublication": {
"id": "proceedings/vahc/2019/2423/0",
"title": "2019 IEEE Workshop on Visual Analytics in Healthcare (VAHC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09233264",
"title": "Selection-Bias-Corrected Visualization via Dynamic Reweighting",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09233264/1o53XOFTPP2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vahc/2021/2067/0/206700a019",
"title": "Enabling Longitudinal Exploratory Analysis of Clinical COVID Data",
"doi": null,
"abstractUrl": "/proceedings-article/vahc/2021/206700a019/1z0yjcoWoE0",
"parentPublication": {
"id": "proceedings/vahc/2021/2067/0",
"title": "2021 IEEE Workshop on Visual Analytics in Healthcare (VAHC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/03/09645173",
"title": "<italic>GUCCI</italic> - Guided Cardiac Cohort Investigation of Blood Flow Data",
"doi": null,
"abstractUrl": "/journal/tg/2023/03/09645173/1zc6CvdsNMc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08809834",
"articleId": "1cHEiLzaKw8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08807220",
"articleId": "1cG6bfa8KkM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i4QgWF8Wxa",
"name": "ttg202001-08807213s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202001-08807213s1.mp4",
"extension": "mp4",
"size": "13.8 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": "1xibW2zLd9C",
"doi": "10.1109/TVCG.2021.3114855",
"abstract": "Semantic segmentation is a critical component in autonomous driving and has to be thoroughly evaluated due to safety concerns. Deep neural network (DNN) based semantic segmentation models are widely used in autonomous driving. However, it is challenging to evaluate DNN-based models due to their black-box-like nature, and it is even more difficult to assess model performance for crucial objects, such as lost cargos and pedestrians, in autonomous driving applications. In this work, we propose <italic>VASS</italic>, a <italic><underline>V</underline></italic>isual <italic><underline>A</underline></italic>nalytics approach to diagnosing and improving the accuracy and robustness of <italic><underline>S</underline></italic>emantic <italic><underline>S</underline></italic>egmentation models, especially for critical objects moving in various driving scenes. The key component of our approach is a context-aware spatial representation learning that extracts important spatial information of objects, such as position, size, and aspect ratio, with respect to given scene contexts. Based on this spatial representation, we first use it to create visual summarization to analyze models' performance. We then use it to guide the generation of adversarial examples to evaluate models' spatial robustness and obtain actionable insights. We demonstrate the effectiveness of <italic>VASS</italic> via two case studies of lost cargo detection and pedestrian detection in autonomous driving. For both cases, we show quantitative evaluation on the improvement of models' performance with actionable insights obtained from <italic>VASS</italic>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Semantic segmentation is a critical component in autonomous driving and has to be thoroughly evaluated due to safety concerns. Deep neural network (DNN) based semantic segmentation models are widely used in autonomous driving. However, it is challenging to evaluate DNN-based models due to their black-box-like nature, and it is even more difficult to assess model performance for crucial objects, such as lost cargos and pedestrians, in autonomous driving applications. In this work, we propose <italic>VASS</italic>, a <italic><underline>V</underline></italic>isual <italic><underline>A</underline></italic>nalytics approach to diagnosing and improving the accuracy and robustness of <italic><underline>S</underline></italic>emantic <italic><underline>S</underline></italic>egmentation models, especially for critical objects moving in various driving scenes. The key component of our approach is a context-aware spatial representation learning that extracts important spatial information of objects, such as position, size, and aspect ratio, with respect to given scene contexts. Based on this spatial representation, we first use it to create visual summarization to analyze models' performance. We then use it to guide the generation of adversarial examples to evaluate models' spatial robustness and obtain actionable insights. We demonstrate the effectiveness of <italic>VASS</italic> via two case studies of lost cargo detection and pedestrian detection in autonomous driving. For both cases, we show quantitative evaluation on the improvement of models' performance with actionable insights obtained from <italic>VASS</italic>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Semantic segmentation is a critical component in autonomous driving and has to be thoroughly evaluated due to safety concerns. Deep neural network (DNN) based semantic segmentation models are widely used in autonomous driving. However, it is challenging to evaluate DNN-based models due to their black-box-like nature, and it is even more difficult to assess model performance for crucial objects, such as lost cargos and pedestrians, in autonomous driving applications. In this work, we propose VASS, a Visual Analytics approach to diagnosing and improving the accuracy and robustness of Semantic Segmentation models, especially for critical objects moving in various driving scenes. The key component of our approach is a context-aware spatial representation learning that extracts important spatial information of objects, such as position, size, and aspect ratio, with respect to given scene contexts. Based on this spatial representation, we first use it to create visual summarization to analyze models' performance. We then use it to guide the generation of adversarial examples to evaluate models' spatial robustness and obtain actionable insights. We demonstrate the effectiveness of VASS via two case studies of lost cargo detection and pedestrian detection in autonomous driving. For both cases, we show quantitative evaluation on the improvement of models' performance with actionable insights obtained from VASS.",
"title": "<italic>Where Can We Help</italic>? A Visual Analytics Approach to Diagnosing and Improving Semantic Segmentation of Movable Objects",
"normalizedTitle": "Where Can We Help? A Visual Analytics Approach to Diagnosing and Improving Semantic Segmentation of Movable Objects",
"fno": "09552909",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Semantics",
"Image Segmentation",
"Autonomous Vehicles",
"Analytical Models",
"Robustness",
"Visual Analytics",
"Data Models",
"Model Diagnosis",
"Semantic Segmentation",
"Spatial Representation Learning",
"Adversarial Learning",
"Autonomous Driving"
],
"authors": [
{
"givenName": "Wenbin",
"surname": "He",
"fullName": "Wenbin He",
"affiliation": "Robert Bosch Research and Technology Center, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lincan",
"surname": "Zou",
"fullName": "Lincan Zou",
"affiliation": "Robert Bosch Research and Technology Center, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Arvind Kumar",
"surname": "Shekar",
"fullName": "Arvind Kumar Shekar",
"affiliation": "Robert Bosch GmbH, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Liang",
"surname": "Gou",
"fullName": "Liang Gou",
"affiliation": "Robert Bosch Research and Technology Center, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Liu",
"surname": "Ren",
"fullName": "Liu Ren",
"affiliation": "Robert Bosch Research and Technology Center, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "1040-1050",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2019/06/08667661",
"title": "<italic>DeepVID</italic>: Deep Visual Interpretation and Diagnosis for Image Classifiers via Knowledge Distillation",
"doi": null,
"abstractUrl": "/journal/tg/2019/06/08667661/18q6nouFfmo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/06/09705076",
"title": "<italic>GNNLens</italic>: A Visual Analytics Approach for Prediction Error Diagnosis of Graph Neural Networks",
"doi": null,
"abstractUrl": "/journal/tg/2023/06/09705076/1AIIbJW1goU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2022/06/09861728",
"title": "<italic>SUBPLEX</italic>: A Visual Analytics Approach to Understand Local Model Explanations at the Subpopulation Level",
"doi": null,
"abstractUrl": "/magazine/cg/2022/06/09861728/1FWhZ4WX0Ji",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09870679",
"title": "When, Where and How does it fail? A Spatial-temporal Visual Analytics Approach for Interpretable Object Detection in Autonomous Driving",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09870679/1GgcTinkSbK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2023/04/09906558",
"title": "A Declarative Metamorphic Testing Framework for Autonomous Driving",
"doi": null,
"abstractUrl": "/journal/ts/2023/04/09906558/1H5F3HSvRZu",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09233993",
"title": "<italic>VATLD</italic>: A <italic>V</italic>isual <italic>A</italic>nalytics System to Assess, Understand and Improve <italic>T</italic>raffic <italic>L</italic>ight <italic>D</italic>etection",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09233993/1o53W7V42CQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2022/02/09629223",
"title": "ESN Reinforcement Learning for Spectrum and Flight Control in THz-Enabled Drone Networks",
"doi": null,
"abstractUrl": "/journal/nt/2022/02/09629223/1yXvEGg3A5i",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/04/09599395",
"title": "Efficient Top-<italic>k</italic> Matching for Publish/Subscribe Ride Hitching",
"doi": null,
"abstractUrl": "/journal/tk/2023/04/09599395/1yeC79w0z3q",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/11/09599374",
"title": "<italic>CAGFuzz:</italic> Coverage-Guided Adversarial Generative Fuzzing Testing for Image-Based Deep Learning Systems",
"doi": null,
"abstractUrl": "/journal/ts/2022/11/09599374/1yeCbwvfO48",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09597616",
"title": "Visual Evaluation for Autonomous Driving",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09597616/1yezimL3oTS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09597616",
"articleId": "1yezimL3oTS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09557222",
"articleId": "1xlvZ1jrwLC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zBan7tT7J6",
"name": "ttg202201-09552909s1-supp1-3114855.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09552909s1-supp1-3114855.mp4",
"extension": "mp4",
"size": "124 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzFdtcj",
"title": "Sept.",
"year": "2018",
"issueNum": "09",
"idPrefix": "si",
"pubType": "journal",
"volume": "26",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwghd7a",
"doi": "10.1109/TVLSI.2018.2830810",
"abstract": "This paper presents a methodology for digital switching noise suppressions on the power lines at a fundamental frequency as well as its harmonics by using a clock scheduling technique in the frequency domain. Our approach provides a deep insight of the clock scheduling at the arbitrary phase shifts of clock signals. Moreover, an optimization algorithm is applied to find an optimal phase shift of a clock signal in order to maximize noise suppressions at a specific frequency band. The experimental results on a Xilinx field-programmable gate array Spartan-3 (XC3S400-TQ144) show that the estimated noise reduction rates well-match the measured ones. In these tests, dummy logics are used as noise injectors. This paper also presents a design example with a data encryption standard cryptoprocessor to demonstrate the applicability of our approach. The experiments show that the highest error between the estimated and the measured results is about 2.5 dB. Interestingly, our approach seems to be appropriately used with the designs in wireless communications where designers address to minimize the digital switching noise at the specific frequency bands of interest.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a methodology for digital switching noise suppressions on the power lines at a fundamental frequency as well as its harmonics by using a clock scheduling technique in the frequency domain. Our approach provides a deep insight of the clock scheduling at the arbitrary phase shifts of clock signals. Moreover, an optimization algorithm is applied to find an optimal phase shift of a clock signal in order to maximize noise suppressions at a specific frequency band. The experimental results on a Xilinx field-programmable gate array Spartan-3 (XC3S400-TQ144) show that the estimated noise reduction rates well-match the measured ones. In these tests, dummy logics are used as noise injectors. This paper also presents a design example with a data encryption standard cryptoprocessor to demonstrate the applicability of our approach. The experiments show that the highest error between the estimated and the measured results is about 2.5 dB. Interestingly, our approach seems to be appropriately used with the designs in wireless communications where designers address to minimize the digital switching noise at the specific frequency bands of interest.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a methodology for digital switching noise suppressions on the power lines at a fundamental frequency as well as its harmonics by using a clock scheduling technique in the frequency domain. Our approach provides a deep insight of the clock scheduling at the arbitrary phase shifts of clock signals. Moreover, an optimization algorithm is applied to find an optimal phase shift of a clock signal in order to maximize noise suppressions at a specific frequency band. The experimental results on a Xilinx field-programmable gate array Spartan-3 (XC3S400-TQ144) show that the estimated noise reduction rates well-match the measured ones. In these tests, dummy logics are used as noise injectors. This paper also presents a design example with a data encryption standard cryptoprocessor to demonstrate the applicability of our approach. The experiments show that the highest error between the estimated and the measured results is about 2.5 dB. Interestingly, our approach seems to be appropriately used with the designs in wireless communications where designers address to minimize the digital switching noise at the specific frequency bands of interest.",
"title": "Analysis of Clock Scheduling in Frequency Domain for Digital Switching Noise Suppressions",
"normalizedTitle": "Analysis of Clock Scheduling in Frequency Domain for Digital Switching Noise Suppressions",
"fno": "08357515",
"hasPdf": true,
"idPrefix": "si",
"keywords": [
"Circuit Optimisation",
"Clocks",
"Cryptography",
"Field Programmable Gate Arrays",
"Interference Suppression",
"Logic Design",
"Logic Testing",
"Microprocessor Chips",
"Phase Shifters",
"Scheduling",
"Digital Switching Noise Suppressions",
"Clock Scheduling Technique",
"Frequency Domain",
"Arbitrary Phase Shifts",
"Clock Signal",
"Optimal Phase Shift",
"Xilinx Field Programmable Gate Array Spartan 3",
"XC 3 S 400 TQ 144",
"Noise Injectors",
"Power Lines",
"Dummy Logics",
"Clocks",
"Switches",
"Harmonic Analysis",
"Optimization",
"Frequency Domain Analysis",
"Resonant Frequency",
"Noise Reduction",
"Clock Scheduling",
"Digital Switching Noise",
"Noise Reduction",
"Simultaneous Switching",
"Switching Current"
],
"authors": [
{
"givenName": "Nguyen",
"surname": "Van Toan",
"fullName": "Nguyen Van Toan",
"affiliation": "Department of Computer Engineering, Hallym University, Chuncheon, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dam",
"surname": "Minh Tung",
"fullName": "Dam Minh Tung",
"affiliation": "Department of Computer Engineering, Hallym University, Chuncheon, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeong-Gun",
"surname": "Lee",
"fullName": "Jeong-Gun Lee",
"affiliation": "Department of Computer Engineering, Hallym University, Chuncheon, South Korea",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2018-09-01 00:00:00",
"pubType": "trans",
"pages": "1685-1698",
"year": "2018",
"issn": "1063-8210",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccad/2007/1381/0/04397286",
"title": "A frequency-domain technique for statistical timing analysis of clock meshes",
"doi": null,
"abstractUrl": "/proceedings-article/iccad/2007/04397286/12OmNAoUTit",
"parentPublication": {
"id": "proceedings/iccad/2007/1381/0",
"title": "2007 IEEE/ACM International Conference on Computer Aided Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/2002/2402/0/24020514",
"title": "An Algorithm for Frequency-Domain Noise Analysis in Nonlinear Systems",
"doi": null,
"abstractUrl": "/proceedings-article/dac/2002/24020514/12OmNvxbhLU",
"parentPublication": {
"id": "proceedings/dac/2002/2402/0",
"title": "Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssst/1994/5320/0/00287800",
"title": "Noise cancellation in time and frequency domain using neural networks",
"doi": null,
"abstractUrl": "/proceedings-article/ssst/1994/00287800/12OmNvzJFYc",
"parentPublication": {
"id": "proceedings/ssst/1994/5320/0",
"title": "Proceedings of 26th Southeastern Symposium on System Theory",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1994/6275/0/00577137",
"title": "Filtering of randomly occurring signals by kurtosis in the frequency domain",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1994/00577137/12OmNx19jYF",
"parentPublication": {
"id": "proceedings/icpr/1994/6275/0",
"title": "12th IAPR International Conference on Pattern Recognition, 1994",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/date/2007/2/0/04211829",
"title": "Clock-Frequency Assignment for Multiple Clock Domain Systems-on-a-Chip",
"doi": null,
"abstractUrl": "/proceedings-article/date/2007/04211829/12OmNxE2mUk",
"parentPublication": {
"id": "proceedings/date/2007/2/0",
"title": "2007 10th Design, Automation and Test in Europe Conference and Exhibition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isqed/2008/3117/0/3117a476",
"title": "Clock Skew Analysis via Vector Fitting in Frequency Domain",
"doi": null,
"abstractUrl": "/proceedings-article/isqed/2008/3117a476/12OmNxwENJZ",
"parentPublication": {
"id": "proceedings/isqed/2008/3117/0",
"title": "2008 9th International Symposium on Quality Electronic Design (ISQED '08)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isip/2010/4261/0/4261a130",
"title": "Weak Signal De-noising Method Based on Accumulation in Frequency Domain and Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/isip/2010/4261a130/12OmNylKATO",
"parentPublication": {
"id": "proceedings/isip/2010/4261/0",
"title": "2010 Third International Symposium on Information Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2011/03/05352254",
"title": "Runtime Resonance Noise Reduction with Current Prediction Enabled Frequency Actuator",
"doi": null,
"abstractUrl": "/journal/si/2011/03/05352254/13rRUxN5eB1",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ainit/2021/1296/0/129600a611",
"title": "Application of Wavelet Denoising and Time- Frequency Domain Feature Extraction on Data Processing of Modulated Signals",
"doi": null,
"abstractUrl": "/proceedings-article/ainit/2021/129600a611/1BzWDDLREWI",
"parentPublication": {
"id": "proceedings/ainit/2021/1296/0",
"title": "2021 2nd International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlsid/2019/0409/0/040900a454",
"title": "Low Power Design Technique in Passive Tag to Reduce the EMD Noise for Reliable Communication with Reader",
"doi": null,
"abstractUrl": "/proceedings-article/vlsid/2019/040900a454/1a3wW5MrJhC",
"parentPublication": {
"id": "proceedings/vlsid/2019/0409/0",
"title": "2019 32nd International Conference on VLSI Design and 2019 18th International Conference on Embedded Systems (VLSID)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08347152",
"articleId": "13rRUwbaqSo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08354929",
"articleId": "13rRUIJuxni",
"__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": "13rRUxNmPDM",
"doi": "10.1109/TVCG.2008.145",
"abstract": "Interactive steering with visualization has been a common goal of the visualization research community for twenty years, but it is rarely ever realized in practice. In this paper we describe a successful realization of a tightly coupled steering loop, integrating new simulation technology and interactive visual analysis in a prototyping environment for automotive industry system design. Due to increasing pressure on car manufacturers to meet new emission regulations, to improve efficiency, and to reduce noise, both simulation and visualization are pushed to their limits. Automotive system components, such as the powertrain system or the injection system have an increasing number of parameters, and new design approaches are required. It is no longer possible to optimize such a system solely based on experience or forward optimization. By coupling interactive visualization with the simulation back-end (computational steering), it is now possible to quickly prototype a new system, starting from a non-optimized initial prototype and the corresponding simulation model. The prototyping continues through the refinement of the simulation model, of the simulation parameters and through trial-and-error attempts to an optimized solution. The ability to early see the first results from a multidimensional simulation space — thousands of simulations are run for a multidimensional variety of input parameters — and to quickly go back into the simulation and request more runs in particular parameter regions of interest significantly improves the prototyping process and provides a deeper understanding of the system behavior. The excellent results which we achieved for the common rail injection system strongly suggest that our approach has a great potential of being generalized to other, similar scenarios.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Interactive steering with visualization has been a common goal of the visualization research community for twenty years, but it is rarely ever realized in practice. In this paper we describe a successful realization of a tightly coupled steering loop, integrating new simulation technology and interactive visual analysis in a prototyping environment for automotive industry system design. Due to increasing pressure on car manufacturers to meet new emission regulations, to improve efficiency, and to reduce noise, both simulation and visualization are pushed to their limits. Automotive system components, such as the powertrain system or the injection system have an increasing number of parameters, and new design approaches are required. It is no longer possible to optimize such a system solely based on experience or forward optimization. By coupling interactive visualization with the simulation back-end (computational steering), it is now possible to quickly prototype a new system, starting from a non-optimized initial prototype and the corresponding simulation model. The prototyping continues through the refinement of the simulation model, of the simulation parameters and through trial-and-error attempts to an optimized solution. The ability to early see the first results from a multidimensional simulation space — thousands of simulations are run for a multidimensional variety of input parameters — and to quickly go back into the simulation and request more runs in particular parameter regions of interest significantly improves the prototyping process and provides a deeper understanding of the system behavior. The excellent results which we achieved for the common rail injection system strongly suggest that our approach has a great potential of being generalized to other, similar scenarios.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Interactive steering with visualization has been a common goal of the visualization research community for twenty years, but it is rarely ever realized in practice. In this paper we describe a successful realization of a tightly coupled steering loop, integrating new simulation technology and interactive visual analysis in a prototyping environment for automotive industry system design. Due to increasing pressure on car manufacturers to meet new emission regulations, to improve efficiency, and to reduce noise, both simulation and visualization are pushed to their limits. Automotive system components, such as the powertrain system or the injection system have an increasing number of parameters, and new design approaches are required. It is no longer possible to optimize such a system solely based on experience or forward optimization. By coupling interactive visualization with the simulation back-end (computational steering), it is now possible to quickly prototype a new system, starting from a non-optimized initial prototype and the corresponding simulation model. The prototyping continues through the refinement of the simulation model, of the simulation parameters and through trial-and-error attempts to an optimized solution. The ability to early see the first results from a multidimensional simulation space — thousands of simulations are run for a multidimensional variety of input parameters — and to quickly go back into the simulation and request more runs in particular parameter regions of interest significantly improves the prototyping process and provides a deeper understanding of the system behavior. The excellent results which we achieved for the common rail injection system strongly suggest that our approach has a great potential of being generalized to other, similar scenarios.",
"title": "Interactive Visual Steering - Rapid Visual Prototyping of a Common Rail Injection System",
"normalizedTitle": "Interactive Visual Steering - Rapid Visual Prototyping of a Common Rail Injection System",
"fno": "ttg2008061699",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Interactive Computational Steering",
"Interactive Visual Analysis",
"Simulation",
"Common Rail Injection System"
],
"authors": [
{
"givenName": "Kresimir",
"surname": "Matkovic",
"fullName": "Kresimir Matkovic",
"affiliation": "VRVis Research Center, Vienna",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Denis",
"surname": "Gracanin",
"fullName": "Denis Gracanin",
"affiliation": "Virginia Tech",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mario",
"surname": "Jelovic",
"fullName": "Mario Jelovic",
"affiliation": "AVL AST, Zagreb",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Helwig",
"surname": "Hauser",
"fullName": "Helwig Hauser",
"affiliation": "University of Bergen",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1699-1706",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icoip/2010/4252/1/4252a464",
"title": "Effect of Common Rail System on Vehicle Engine Combustion Performance",
"doi": null,
"abstractUrl": "/proceedings-article/icoip/2010/4252a464/12OmNApu5D8",
"parentPublication": {
"id": "proceedings/icoip/2010/4252/2",
"title": "Optoelectronics and Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cdciem/2011/4350/0/4350a586",
"title": "Simulation and Experimental Study on High Pressure Common Rail Fuel System of Diesel Engine",
"doi": null,
"abstractUrl": "/proceedings-article/cdciem/2011/4350a586/12OmNCcbEhb",
"parentPublication": {
"id": "proceedings/cdciem/2011/4350/0",
"title": "Computer Distributed Control and Intelligent Environmental Monitoring, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2010/4077/2/4077c258",
"title": "Examinatal Study on Common Rail Diesel Engine for Multi-injection Strategies",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2010/4077c258/12OmNvA1h7x",
"parentPublication": {
"id": "proceedings/icicta/2010/4077/2",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1995/7187/0/71870304",
"title": "3D Computational Steering with Parametrized Geometric Objects",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1995/71870304/12OmNvjyxtM",
"parentPublication": {
"id": "proceedings/ieee-vis/1995/7187/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etcs/2010/3987/3/3987c103",
"title": "Methodology for Model-Based Calibration on 4jb1 High-Pressure Common-Rail Diesel Engine",
"doi": null,
"abstractUrl": "/proceedings-article/etcs/2010/3987c103/12OmNvs4vr6",
"parentPublication": {
"id": "proceedings/etcs/2010/3987/3",
"title": "Education Technology and Computer Science, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1995/2568/0/25680052",
"title": "SCIRun: A Scientific Programming Environment for Computational Steering",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1995/25680052/12OmNyKa608",
"parentPublication": {
"id": "proceedings/sc/1995/2568/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdma/2010/4286/1/4286a387",
"title": "Common Rail Direct Injection Diesel Engine Control Strategy Validation Research",
"doi": null,
"abstractUrl": "/proceedings-article/icdma/2010/4286a387/12OmNySG3Vz",
"parentPublication": {
"id": "proceedings/icdma/2010/4286/1",
"title": "2010 International Conference on Digital Manufacturing & Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoip/2010/4252/2/4252b465",
"title": "Study on the Influence Factors of Common Rail System's Injection Mass",
"doi": null,
"abstractUrl": "/proceedings-article/icoip/2010/4252b465/12OmNzV70Hd",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780011",
"title": "A Computational Steering System for Studying Microwave Interactions with Space-Borne Bodies",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780011/12OmNzayNr8",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/06/ttg2013061062",
"title": "Visual Analysis and Steering of Flooding Simulations",
"doi": null,
"abstractUrl": "/journal/tg/2013/06/ttg2013061062/13rRUxNEqPS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061691",
"articleId": "13rRUygT7mN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061707",
"articleId": "13rRUygT7mO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqIhFOo",
"title": "Dec.",
"year": "2015",
"issueNum": "12",
"idPrefix": "si",
"pubType": "journal",
"volume": "23",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy0qnDY",
"doi": "10.1109/TVLSI.2014.2386315",
"abstract": "An analysis flow is proposed to determine the significance of induced (switching) noise in analog circuits. The proposed flow is exemplified through two commonly used amplifier topologies. Specifically, input-referred switching noise is introduced as the first figure-of-merit and compared with the well-known equivalent input device noise through analytic expressions. The comparison is achieved as a function of multiple parameters that characterize switching noise in the time domain (modeled as a decaying sine wave), such as peak amplitude, period, oscillation frequency within each period, and damping coefficient. The analytic expressions used to obtain input-referred switching and device noise are verified with SPICE simulations. These expressions are utilized to develop dominance regions for both noise sources. Furthermore, time-domain switching noise amplitude (at the bulk node) at which the input device and switching noise magnitude are equal (in the frequency domain) is determined as the second figure-of-merit, providing guidelines for the signal isolation process. Reverse body biasing is also proposed to alleviate the effect of switching noise by weakening the bulk-to-input transfer function as opposed to reducing the switching noise amplitude at the bulk nodes. It is demonstrated that this method has a negligible effect on primary design objectives of the victim circuit while reducing the input-referred switching noise by up to 10 dB. As a case study, the proposed flow is applied to a potentiostat circuitry where input sensitivity is of primary importance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "An analysis flow is proposed to determine the significance of induced (switching) noise in analog circuits. The proposed flow is exemplified through two commonly used amplifier topologies. Specifically, input-referred switching noise is introduced as the first figure-of-merit and compared with the well-known equivalent input device noise through analytic expressions. The comparison is achieved as a function of multiple parameters that characterize switching noise in the time domain (modeled as a decaying sine wave), such as peak amplitude, period, oscillation frequency within each period, and damping coefficient. The analytic expressions used to obtain input-referred switching and device noise are verified with SPICE simulations. These expressions are utilized to develop dominance regions for both noise sources. Furthermore, time-domain switching noise amplitude (at the bulk node) at which the input device and switching noise magnitude are equal (in the frequency domain) is determined as the second figure-of-merit, providing guidelines for the signal isolation process. Reverse body biasing is also proposed to alleviate the effect of switching noise by weakening the bulk-to-input transfer function as opposed to reducing the switching noise amplitude at the bulk nodes. It is demonstrated that this method has a negligible effect on primary design objectives of the victim circuit while reducing the input-referred switching noise by up to 10 dB. As a case study, the proposed flow is applied to a potentiostat circuitry where input sensitivity is of primary importance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "An analysis flow is proposed to determine the significance of induced (switching) noise in analog circuits. The proposed flow is exemplified through two commonly used amplifier topologies. Specifically, input-referred switching noise is introduced as the first figure-of-merit and compared with the well-known equivalent input device noise through analytic expressions. The comparison is achieved as a function of multiple parameters that characterize switching noise in the time domain (modeled as a decaying sine wave), such as peak amplitude, period, oscillation frequency within each period, and damping coefficient. The analytic expressions used to obtain input-referred switching and device noise are verified with SPICE simulations. These expressions are utilized to develop dominance regions for both noise sources. Furthermore, time-domain switching noise amplitude (at the bulk node) at which the input device and switching noise magnitude are equal (in the frequency domain) is determined as the second figure-of-merit, providing guidelines for the signal isolation process. Reverse body biasing is also proposed to alleviate the effect of switching noise by weakening the bulk-to-input transfer function as opposed to reducing the switching noise amplitude at the bulk nodes. It is demonstrated that this method has a negligible effect on primary design objectives of the victim circuit while reducing the input-referred switching noise by up to 10 dB. As a case study, the proposed flow is applied to a potentiostat circuitry where input sensitivity is of primary importance.",
"title": "Figures-of-Merit to Evaluate the Significance of Switching Noise in Analog Circuits",
"normalizedTitle": "Figures-of-Merit to Evaluate the Significance of Switching Noise in Analog Circuits",
"fno": "07097083",
"hasPdf": true,
"idPrefix": "si",
"keywords": [
"Amplifiers",
"Circuit Switching",
"Damping",
"Frequency Domain Analysis",
"Integrated Circuit Design",
"Integrated Circuit Modelling",
"Integrated Circuit Noise",
"Network Topology",
"Time Domain Analysis",
"Potentiostat Circuitry",
"Bulk To Input Transfer Function",
"Reverse Body Biasing",
"Signal Isolation Process",
"Frequency Domain",
"Switching Noise Magnitude",
"Time Domain Switching Noise Amplitude",
"Noise Sources",
"SPICE Simulations",
"Damping Coefficient",
"Oscillation Frequency",
"Equivalent Input Device Noise",
"Input Referred Switching Noise",
"Amplifier Topologies",
"Analog Circuits",
"Figures Of Merit",
"Noise",
"Switches",
"Switching Circuits",
"Frequency Domain Analysis",
"Transfer Functions",
"Transistors",
"Time Domain Analysis",
"Analog Digital Integrated Circuits",
"Circuit Noise",
"Integrated Circuit Modeling",
"Analog Digital Integrated Circuits",
"Circuit Noise",
"Integrated Circuit Modeling"
],
"authors": [
{
"givenName": "Zhihua",
"surname": "Gan",
"fullName": "Zhihua Gan",
"affiliation": "Department of Electrical and Computer Engineering, Stony Brook University, Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Emre",
"surname": "Salman",
"fullName": "Emre Salman",
"affiliation": "Department of Electrical and Computer Engineering, Stony Brook University, Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Milutin",
"surname": "Stanaćević",
"fullName": "Milutin Stanaćević",
"affiliation": "Department of Electrical and Computer Engineering, Stony Brook University, Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2015-12-01 00:00:00",
"pubType": "trans",
"pages": "2945-2956",
"year": "2015",
"issn": "1063-8210",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/aqtr/2012/0701/0/06237730",
"title": "Current-controlled PWM strategy with carrier wave for constant switching frequency",
"doi": null,
"abstractUrl": "/proceedings-article/aqtr/2012/06237730/12OmNAkWvp4",
"parentPublication": {
"id": "proceedings/aqtr/2012/0701/0",
"title": "International Conference on Automation, Quality and Testing, Robotics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2012/4608/0/4608b355",
"title": "A High-Power-Factor Switching Mode Power Supply Base on APFC and Soft-Switching",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2012/4608b355/12OmNB9t6mL",
"parentPublication": {
"id": "proceedings/isdea/2012/4608/0",
"title": "2012 Second International Conference on Intelligent System Design and Engineering Application",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismvl/1996/7392/0/73920248",
"title": "A method to represent multiple-output switching functions by using multi-valued decision diagrams",
"doi": null,
"abstractUrl": "/proceedings-article/ismvl/1996/73920248/12OmNBV9IfD",
"parentPublication": {
"id": "proceedings/ismvl/1996/7392/0",
"title": "Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlsid/2000/0487/0/04870168",
"title": "Estimation of Switching Noise on Power Supply Lines in Deep Sub-micron CMOS Circuits",
"doi": null,
"abstractUrl": "/proceedings-article/vlsid/2000/04870168/12OmNCxbXEh",
"parentPublication": {
"id": "proceedings/vlsid/2000/0487/0",
"title": "VLSI Design, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1979/05/01675369",
"title": "On the Number of Multivalued Switching Functions Realizable by Cascades",
"doi": null,
"abstractUrl": "/journal/tc/1979/05/01675369/13rRUILtJkH",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1971/06/01671923",
"title": "Realization of Nonlinearly Separable Switching Functions",
"doi": null,
"abstractUrl": "/journal/tc/1971/06/01671923/13rRUNvyady",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1996/09/t1017",
"title": "Switching Codes for Delta-I Noise Reduction",
"doi": null,
"abstractUrl": "/journal/tc/1996/09/t1017/13rRUwI5UjS",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1975/11/01672742",
"title": "On a Covering Problem for Partially Specified Switching Functions",
"doi": null,
"abstractUrl": "/journal/tc/1975/11/01672742/13rRUxBa5w7",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2010/12/05256138",
"title": "Properties of Digital Switching Currents in Fully CMOS Combinational Logic",
"doi": null,
"abstractUrl": "/journal/si/2010/12/05256138/13rRUxCRFTT",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ewdts/2020/9899/0/09225101",
"title": "The Noise Immunity of CMOS Elements During their Switching and Exposure to an Ionizing Particle",
"doi": null,
"abstractUrl": "/proceedings-article/ewdts/2020/09225101/1nWNWkNXNao",
"parentPublication": {
"id": "proceedings/ewdts/2020/9899/0",
"title": "2020 IEEE East-West Design & Test Symposium (EWDTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07001101",
"articleId": "13rRUxbTMwo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07019009",
"articleId": "13rRUwgyOe3",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1IXUpNdkyWs",
"title": "Dec.",
"year": "2022",
"issueNum": "12",
"idPrefix": "ts",
"pubType": "journal",
"volume": "48",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1yJTy62R2dq",
"doi": "10.1109/TSE.2021.3129688",
"abstract": "Logging the stack traces of runtime exceptions assists developers in diagnosing runtime failures. However, unnecessary logging of exception stack traces can have many negative impacts such as polluting log files. Unfortunately, there exist no guidelines for the logging of exception stack traces and developers usually practice it in an <italic>ad hoc</italic> manner. In this work, we perform a comprehensive study of the source code, code change history, and issue reports of ten open-source Java projects, combining quantitative and qualitative analysis, in order to understand how developers log and modify the logging of exception stack traces, their rationale for logging or not logging exception stack traces, and the factors that impact their logging of exception stack traces. We observe that logging of exception stack traces is a popular practice in open-source projects, while developers have difficulties making appropriate logging of exception stack traces in the first place. Through a qualitative analysis of 385 related issue reports, we derived recommendations for the logging of exception stack traces, such as logging of stack traces should be avoided or downgraded for user errors, normal execution, expected exceptions, in user interfaces, or when there is a security concern. Finally, based on our empirical observations, we design and extract a set of code metrics and construct models to explain the likelihood of logging an exception stack trace. Our analysis of the models indicates the important factors (e.g., the exception type and the method that throws the exception) for determining the logging of exception stack traces. Our study helps developers and researchers understand the current practices of logging exception stack traces, provides recommendations for developers to consider when determining whether to log the stack trace of an exception, and provides insights for future research and practices to derive global or company-wide guidelines for the logging of exception stack traces.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Logging the stack traces of runtime exceptions assists developers in diagnosing runtime failures. However, unnecessary logging of exception stack traces can have many negative impacts such as polluting log files. Unfortunately, there exist no guidelines for the logging of exception stack traces and developers usually practice it in an <italic>ad hoc</italic> manner. In this work, we perform a comprehensive study of the source code, code change history, and issue reports of ten open-source Java projects, combining quantitative and qualitative analysis, in order to understand how developers log and modify the logging of exception stack traces, their rationale for logging or not logging exception stack traces, and the factors that impact their logging of exception stack traces. We observe that logging of exception stack traces is a popular practice in open-source projects, while developers have difficulties making appropriate logging of exception stack traces in the first place. Through a qualitative analysis of 385 related issue reports, we derived recommendations for the logging of exception stack traces, such as logging of stack traces should be avoided or downgraded for user errors, normal execution, expected exceptions, in user interfaces, or when there is a security concern. Finally, based on our empirical observations, we design and extract a set of code metrics and construct models to explain the likelihood of logging an exception stack trace. Our analysis of the models indicates the important factors (e.g., the exception type and the method that throws the exception) for determining the logging of exception stack traces. Our study helps developers and researchers understand the current practices of logging exception stack traces, provides recommendations for developers to consider when determining whether to log the stack trace of an exception, and provides insights for future research and practices to derive global or company-wide guidelines for the logging of exception stack traces.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Logging the stack traces of runtime exceptions assists developers in diagnosing runtime failures. However, unnecessary logging of exception stack traces can have many negative impacts such as polluting log files. Unfortunately, there exist no guidelines for the logging of exception stack traces and developers usually practice it in an ad hoc manner. In this work, we perform a comprehensive study of the source code, code change history, and issue reports of ten open-source Java projects, combining quantitative and qualitative analysis, in order to understand how developers log and modify the logging of exception stack traces, their rationale for logging or not logging exception stack traces, and the factors that impact their logging of exception stack traces. We observe that logging of exception stack traces is a popular practice in open-source projects, while developers have difficulties making appropriate logging of exception stack traces in the first place. Through a qualitative analysis of 385 related issue reports, we derived recommendations for the logging of exception stack traces, such as logging of stack traces should be avoided or downgraded for user errors, normal execution, expected exceptions, in user interfaces, or when there is a security concern. Finally, based on our empirical observations, we design and extract a set of code metrics and construct models to explain the likelihood of logging an exception stack trace. Our analysis of the models indicates the important factors (e.g., the exception type and the method that throws the exception) for determining the logging of exception stack traces. Our study helps developers and researchers understand the current practices of logging exception stack traces, provides recommendations for developers to consider when determining whether to log the stack trace of an exception, and provides insights for future research and practices to derive global or company-wide guidelines for the logging of exception stack traces.",
"title": "Studying the Practices of Logging Exception Stack Traces in Open-Source Software Projects",
"normalizedTitle": "Studying the Practices of Logging Exception Stack Traces in Open-Source Software Projects",
"fno": "09623518",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Java",
"Project Management",
"Public Domain Software",
"Security Of Data",
"Software Maintenance",
"Software Metrics",
"Software Reliability",
"User Interfaces",
"Code Metrics",
"Exception Stack Trace",
"Logging Exception Stack",
"Open Source Java Projects",
"Open Source Software Projects",
"Runtime Exceptions",
"User Interfaces",
"Codes",
"History",
"Open Source Software",
"Guidelines",
"Runtime",
"Ports Computers",
"Memory",
"Software Maintenance",
"Software Logging",
"Exception Logging",
"Stack Traces",
"Random Forest"
],
"authors": [
{
"givenName": "Heng",
"surname": "Li",
"fullName": "Heng Li",
"affiliation": "Department of Computer Engineering and Software Engineering, Polytechnique Montreal, Montreal, QC, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haoxiang",
"surname": "Zhang",
"fullName": "Haoxiang Zhang",
"affiliation": "Centre for Software Excellence at Huawei, Markham, ON, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shaowei",
"surname": "Wang",
"fullName": "Shaowei Wang",
"affiliation": "Department of Computer Science, University of Manitoba, Winnipeg, MB, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ahmed E.",
"surname": "Hassan",
"fullName": "Ahmed E. Hassan",
"affiliation": "Software Analysis and Intelligence Lab (SAIL), Queen's University, Kingston, ON, Canada",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "4907-4924",
"year": "2022",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/saner/2017/5501/0/07884629",
"title": "Stack Overflow: A code laundering platform?",
"doi": null,
"abstractUrl": "/proceedings-article/saner/2017/07884629/12OmNBCqbzX",
"parentPublication": {
"id": "proceedings/saner/2017/5501/0",
"title": "2017 IEEE 24th International Conference on Software Analysis, Evolution and Reengineering (SANER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2012/1066/0/06227202",
"title": "Characterizing logging practices in open-source software",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2012/06227202/12OmNBkP3AX",
"parentPublication": {
"id": "proceedings/icse/2012/1066/0",
"title": "2012 34th International Conference on Software Engineering (ICSE 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msr/2010/6802/0/05463280",
"title": "Do stack traces help developers fix bugs?",
"doi": null,
"abstractUrl": "/proceedings-article/msr/2010/05463280/12OmNwAt1H8",
"parentPublication": {
"id": "proceedings/msr/2010/6802/0",
"title": "2010 7th IEEE Working Conference on Mining Software Repositories (MSR 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msr/2018/5716/0/571601a564",
"title": "Studying the Relationship between Exception Handling Practices and Post-Release Defects",
"doi": null,
"abstractUrl": "/proceedings-article/msr/2018/571601a564/17D45WwsQ8O",
"parentPublication": {
"id": "proceedings/msr/2018/5716/0",
"title": "2018 IEEE/ACM 15th International Conference on Mining Software Repositories (MSR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-companion/2019/1764/0/176400a194",
"title": "Improving the Software Logging Practices in DevOps",
"doi": null,
"abstractUrl": "/proceedings-article/icse-companion/2019/176400a194/1cJ7oqx4ri8",
"parentPublication": {
"id": "proceedings/icse-companion/2019/1764/0",
"title": "2019 IEEE/ACM 41st International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsme/2019/3094/0/309400a459",
"title": "An Exploratory Study of Logging Configuration Practice in Java",
"doi": null,
"abstractUrl": "/proceedings-article/icsme/2019/309400a459/1fHlDcyBBny",
"parentPublication": {
"id": "proceedings/icsme/2019/3094/0",
"title": "2019 IEEE International Conference on Software Maintenance and Evolution (ICSME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/searis/2017/6274/0/09183509",
"title": "VisAnalyticsKit: User Logging for Mobile Visualization Applications",
"doi": null,
"abstractUrl": "/proceedings-article/searis/2017/09183509/1mLMmmgB3GM",
"parentPublication": {
"id": "proceedings/searis/2017/6274/0",
"title": "2017 IEEE 10th Workshop on Software Engineering and Architectures for Realtime Interactive Systems (SEARIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2020/6768/0/676800a361",
"title": "Where Shall We Log? Studying and Suggesting Logging Locations in Code Blocks",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2020/676800a361/1pP3KnfOJs4",
"parentPublication": {
"id": "proceedings/ase/2020/6768/0",
"title": "2020 35th IEEE/ACM International Conference on Automated Software Engineering (ASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-companion/2020/7122/0/712200a125",
"title": "Studying and Suggesting Logging Locations in Code Blocks",
"doi": null,
"abstractUrl": "/proceedings-article/icse-companion/2020/712200a125/1pcSHw4mDJK",
"parentPublication": {
"id": "proceedings/icse-companion/2020/7122/0",
"title": "2020 IEEE/ACM 42nd International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mobilesoft/2021/8711/0/871100a056",
"title": "Logging Practices with Mobile Analytics: An Empirical Study on Firebase",
"doi": null,
"abstractUrl": "/proceedings-article/mobilesoft/2021/871100a056/1tB7pATiJWw",
"parentPublication": {
"id": "proceedings/mobilesoft/2021/8711/0/",
"title": "2021 IEEE/ACM 8th International Conference on Mobile Software Engineering and Systems (MobileSoft)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09622154",
"articleId": "1yEUrOmfuJW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09625808",
"articleId": "1yLTrIvxP6o",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvjgWIH",
"title": "August",
"year": "2011",
"issueNum": "08",
"idPrefix": "tk",
"pubType": "journal",
"volume": "23",
"label": "August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxOdD8B",
"doi": "10.1109/TKDE.2010.247",
"abstract": "Privacy-preserving data publishing has attracted considerable research interest in recent years. Among the existing solutions, \\epsilon-differential privacy provides the strongest privacy guarantee. Existing data publishing methods that achieve \\epsilon-differential privacy, however, offer little data utility. In particular, if the output data set is used to answer count queries, the noise in the query answers can be proportional to the number of tuples in the data, which renders the results useless. In this paper, we develop a data publishing technique that ensures \\epsilon-differential privacy while providing accurate answers for range-count queries, i.e., count queries where the predicate on each attribute is a range. The core of our solution is a framework that applies wavelet transforms on the data before adding noise to it. We present instantiations of the proposed framework for both ordinal and nominal data, and we provide a theoretical analysis on their privacy and utility guarantees. In an extensive experimental study on both real and synthetic data, we show the effectiveness and efficiency of our solution.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Privacy-preserving data publishing has attracted considerable research interest in recent years. Among the existing solutions, \\epsilon-differential privacy provides the strongest privacy guarantee. Existing data publishing methods that achieve \\epsilon-differential privacy, however, offer little data utility. In particular, if the output data set is used to answer count queries, the noise in the query answers can be proportional to the number of tuples in the data, which renders the results useless. In this paper, we develop a data publishing technique that ensures \\epsilon-differential privacy while providing accurate answers for range-count queries, i.e., count queries where the predicate on each attribute is a range. The core of our solution is a framework that applies wavelet transforms on the data before adding noise to it. We present instantiations of the proposed framework for both ordinal and nominal data, and we provide a theoretical analysis on their privacy and utility guarantees. In an extensive experimental study on both real and synthetic data, we show the effectiveness and efficiency of our solution.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Privacy-preserving data publishing has attracted considerable research interest in recent years. Among the existing solutions, \\epsilon-differential privacy provides the strongest privacy guarantee. Existing data publishing methods that achieve \\epsilon-differential privacy, however, offer little data utility. In particular, if the output data set is used to answer count queries, the noise in the query answers can be proportional to the number of tuples in the data, which renders the results useless. In this paper, we develop a data publishing technique that ensures \\epsilon-differential privacy while providing accurate answers for range-count queries, i.e., count queries where the predicate on each attribute is a range. The core of our solution is a framework that applies wavelet transforms on the data before adding noise to it. We present instantiations of the proposed framework for both ordinal and nominal data, and we provide a theoretical analysis on their privacy and utility guarantees. In an extensive experimental study on both real and synthetic data, we show the effectiveness and efficiency of our solution.",
"title": "Differential Privacy via Wavelet Transforms",
"normalizedTitle": "Differential Privacy via Wavelet Transforms",
"fno": "ttk2011081200",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Privacy Preserving Data Publishing",
"Differential Privacy",
"Wavelets"
],
"authors": [
{
"givenName": "Xiaokui",
"surname": "Xiao",
"fullName": "Xiaokui Xiao",
"affiliation": "Nanyang Technological University, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guozhang",
"surname": "Wang",
"fullName": "Guozhang Wang",
"affiliation": "Cornell University, Ithaca",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Johannes",
"surname": "Gehrke",
"fullName": "Johannes Gehrke",
"affiliation": "Cornell University, Ithaca",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2011-08-01 00:00:00",
"pubType": "trans",
"pages": "1200-1214",
"year": "2011",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2010/5445/0/05447831",
"title": "Differential privacy via wavelet transforms",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2010/05447831/12OmNxQOjAO",
"parentPublication": {
"id": "proceedings/icde/2010/5445/0",
"title": "2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nana/2018/8303/0/08648706",
"title": "Adaptive Differential Privacy Interactive Publishing Model Based on Dynamic Feedback",
"doi": null,
"abstractUrl": "/proceedings-article/nana/2018/08648706/181W9moJfxM",
"parentPublication": {
"id": "proceedings/nana/2018/8303/0",
"title": "2018 International Conference on Networking and Network Applications (NaNA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-iucc-bdcloud-socialcom-sustaincom/2018/1141/0/114100a737",
"title": "Dynamic Data Histogram Publishing Based on Differential Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-iucc-bdcloud-socialcom-sustaincom/2018/114100a737/18AuJd5D6da",
"parentPublication": {
"id": "proceedings/ispa-iucc-bdcloud-socialcom-sustaincom/2018/1141/0",
"title": "2018 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2018/9288/0/928800a029",
"title": "Preserving Differential Privacy and Utility of Non-stationary Data Streams",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2018/928800a029/18jXBtIlC4U",
"parentPublication": {
"id": "proceedings/icdmw/2018/9288/0",
"title": "2018 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msn/2018/0548/0/054800a177",
"title": "Real-Time Trajectory Data Publishing Method with Differential Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/msn/2018/054800a177/19m3pknLjeo",
"parentPublication": {
"id": "proceedings/msn/2018/0548/0",
"title": "2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msn/2022/6457/0/645700a803",
"title": "Publishing Weighted Graph with Node Differential Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/msn/2022/645700a803/1LUtXKiR5oA",
"parentPublication": {
"id": "proceedings/msn/2022/6457/0",
"title": "2022 18th International Conference on Mobility, Sensing and Networking (MSN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icinc/2022/0969/0/096900a214",
"title": "A 3-dimensional Histogram Publishing Algorithm for Spatiotemporal Data Based on Differential Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/icinc/2022/096900a214/1M671hu5SMM",
"parentPublication": {
"id": "proceedings/icinc/2022/0969/0",
"title": "2022 International Conference on Informatics, Networking and Computing (ICINC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icinc/2022/0969/0/096900a163",
"title": "Social Network Data Publishing Model Satisfying Differential Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/icinc/2022/096900a163/1M6726tVIFq",
"parentPublication": {
"id": "proceedings/icinc/2022/0969/0",
"title": "2022 International Conference on Informatics, Networking and Computing (ICINC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2019/2607/1/260701a746",
"title": "Dynamic Data Publishing with Differential Privacy via Reinforcement Learning",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2019/260701a746/1cYiDunH1IY",
"parentPublication": {
"id": "proceedings/compsac/2019/2607/1",
"title": "2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2020/1485/0/148500a313",
"title": "Privacy Preserving Trajectory Data Publishing with Personalized Differential Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-bdcloud-socialcom-sustaincom/2020/148500a313/1ua4vNXGM5a",
"parentPublication": {
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2020/1485/0",
"title": "2020 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttk2011081182",
"articleId": "13rRUxNW1ZH",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttk2011081215",
"articleId": "13rRUwbs2gJ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRQG",
"name": "ttk2011081200s.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttk2011081200s.pdf",
"extension": "pdf",
"size": "163 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1GZoks2MXAY",
"doi": "10.1109/TVCG.2022.3209451",
"abstract": "The trouble with data is that it frequently provides only an imperfect representation of a phenomenon of interest. Experts who are familiar with their datasets will often make implicit, mental corrections when analyzing a dataset, or will be cautious not to be overly confident about their findings if caveats are present. However, personal knowledge about the caveats of a dataset is typically not incorporated in a structured way, which is problematic if others who lack that knowledge interpret the data. In this work, we define such analysts' knowledge about datasets as <italic>data hunches</italic>. We differentiate data hunches from uncertainty and discuss types of hunches. We then explore ways of recording data hunches, and, based on a prototypical design, develop recommendations for designing visualizations that support data hunches. We conclude by discussing various challenges associated with data hunches, including the potential for harm and challenges for trust and privacy. We envision that data hunches will empower analysts to externalize their knowledge, facilitate collaboration and communication, and support the ability to learn from others' data hunches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The trouble with data is that it frequently provides only an imperfect representation of a phenomenon of interest. Experts who are familiar with their datasets will often make implicit, mental corrections when analyzing a dataset, or will be cautious not to be overly confident about their findings if caveats are present. However, personal knowledge about the caveats of a dataset is typically not incorporated in a structured way, which is problematic if others who lack that knowledge interpret the data. In this work, we define such analysts' knowledge about datasets as <italic>data hunches</italic>. We differentiate data hunches from uncertainty and discuss types of hunches. We then explore ways of recording data hunches, and, based on a prototypical design, develop recommendations for designing visualizations that support data hunches. We conclude by discussing various challenges associated with data hunches, including the potential for harm and challenges for trust and privacy. We envision that data hunches will empower analysts to externalize their knowledge, facilitate collaboration and communication, and support the ability to learn from others' data hunches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The trouble with data is that it frequently provides only an imperfect representation of a phenomenon of interest. Experts who are familiar with their datasets will often make implicit, mental corrections when analyzing a dataset, or will be cautious not to be overly confident about their findings if caveats are present. However, personal knowledge about the caveats of a dataset is typically not incorporated in a structured way, which is problematic if others who lack that knowledge interpret the data. In this work, we define such analysts' knowledge about datasets as data hunches. We differentiate data hunches from uncertainty and discuss types of hunches. We then explore ways of recording data hunches, and, based on a prototypical design, develop recommendations for designing visualizations that support data hunches. We conclude by discussing various challenges associated with data hunches, including the potential for harm and challenges for trust and privacy. We envision that data hunches will empower analysts to externalize their knowledge, facilitate collaboration and communication, and support the ability to learn from others' data hunches.",
"title": "Data Hunches: Incorporating Personal Knowledge into Visualizations",
"normalizedTitle": "Data Hunches: Incorporating Personal Knowledge into Visualizations",
"fno": "09903288",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Data Analysts",
"Data Hunches",
"Personal Knowledge Incorporation",
"Visualizations",
"Uncertainty",
"Data Visualization",
"Visualization",
"Recording",
"Data Analysis",
"Data Models",
"Blood",
"Data Visualization",
"Uncertainty",
"Data Hunches"
],
"authors": [
{
"givenName": "Haihan",
"surname": "Lin",
"fullName": "Haihan Lin",
"affiliation": "University of Utah, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Derya",
"surname": "Akbaba",
"fullName": "Derya Akbaba",
"affiliation": "University of Utah, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Miriah",
"surname": "Meyer",
"fullName": "Miriah Meyer",
"affiliation": "Linköping University, Sweden",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alexander",
"surname": "Lex",
"fullName": "Alexander Lex",
"affiliation": "University of Utah, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "504-514",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2001/1143/1/00937597",
"title": "Incorporating process knowledge into object recognition for assemblies",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2001/00937597/12OmNBBzohy",
"parentPublication": {
"id": "proceedings/iccv/2001/1143/1",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2016/5670/0/5670b456",
"title": "The Personal Equation of Interaction for Categorization of Composite Glyphs",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/5670b456/12OmNwDSdd6",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2007/2932/0/29320600",
"title": "Incorporating Knowledge into e-Commerce Automated Negotiation",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2007/29320600/12OmNyTwRhZ",
"parentPublication": {
"id": "proceedings/dexa/2007/2932/0",
"title": "18th International Workshop on Database and Expert Systems Applications (DEXA 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/08/07563865",
"title": "How Progressive Visualizations Affect Exploratory Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2017/08/07563865/13rRUNvya9q",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440857",
"title": "Where's My Data? Evaluating Visualizations with Missing Data",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440857/17D45WZZ7Gl",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904449",
"title": "DPVisCreator: Incorporating Pattern Constraints to Privacy-preserving Visualizations via Differential Privacy",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904449/1H0GlpjfzUc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09917516",
"title": "Geo-Storylines: Integrating Maps into Storyline Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09917516/1HrexIf2zZe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09408391",
"title": "The Unmet Data Visualization Needs of Decision Makers Within Organizations",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09408391/1sVEPCiNLI4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/02/09547737",
"title": "ChartStory: Automated Partitioning, Layout, and Captioning of Charts into Comic-Style Narratives",
"doi": null,
"abstractUrl": "/journal/tg/2023/02/09547737/1x9TL0bvSlq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552187",
"title": "Causal Support: Modeling Causal Inferences with Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552187/1xic7BF3mcE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09904491",
"articleId": "1H1gs8qCjdu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09903564",
"articleId": "1GZombIreEg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Jgw4bYQyUE",
"name": "ttg202301-09903288s1-supp1-3209451.xlsx",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09903288s1-supp1-3209451.xlsx",
"extension": "xlsx",
"size": "2.44 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwCsdFw",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tk",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1Krc4EmQyQw",
"doi": "10.1109/TKDE.2023.3241661",
"abstract": "Given a set of local sequential datasets held by multiple parties, we study the problem of publishing a synthetic dataset that preserves approximate sequentiality information of the integrated dataset while satisfying differential privacy for each local dataset. The existing solutions for publishing differentially private sequential data in the centralized setting mostly adopt tree-based approaches. Such approaches rely on different tree structures that encode sequential data's statistical information. The construction of a tree structure is normally done by recursively splitting nodes whose noisy <italic>scores</italic> (e.g., entropy or count) are larger than a given threshold. However, extending similar ideas to the multi-party setting is challenging. First, the comparison between noisy scores and a given threshold needs to be done in a distributed manner without letting the parties know the noisy scores, while satisfying differential privacy for each local dataset. Second, in the multi-party setting the large number of node splitting decisions incurs prohibitive computation costs. In addressing the above challenges, we present <italic>DPST</italic>, a distributed prediction suffix tree construction solution. In DPST, we first introduce a novel node splitting decision method that calculates the comparison result under encryption with substantially improved efficiency. Then we present a novel batch-based tree construction approach to reduce computation costs. In order to achieve high parallel performance without incurring any extra communication cost, we introduce the <italic>conjunction</italic> and <italic>slide</italic> methods to ensure that each batch contains a stable number of carefully arranged <italic>decision tasks</italic>. To further reduce communication and computation costs, we propose a prefix-based pre-pruning method to reduce the number of nodes that need to be judged whether to split by an interactive protocol. Extensive experiments on real datasets demonstrate that our DPST solution offers desirable data utility with low computation and communication costs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Given a set of local sequential datasets held by multiple parties, we study the problem of publishing a synthetic dataset that preserves approximate sequentiality information of the integrated dataset while satisfying differential privacy for each local dataset. The existing solutions for publishing differentially private sequential data in the centralized setting mostly adopt tree-based approaches. Such approaches rely on different tree structures that encode sequential data's statistical information. The construction of a tree structure is normally done by recursively splitting nodes whose noisy <italic>scores</italic> (e.g., entropy or count) are larger than a given threshold. However, extending similar ideas to the multi-party setting is challenging. First, the comparison between noisy scores and a given threshold needs to be done in a distributed manner without letting the parties know the noisy scores, while satisfying differential privacy for each local dataset. Second, in the multi-party setting the large number of node splitting decisions incurs prohibitive computation costs. In addressing the above challenges, we present <italic>DPST</italic>, a distributed prediction suffix tree construction solution. In DPST, we first introduce a novel node splitting decision method that calculates the comparison result under encryption with substantially improved efficiency. Then we present a novel batch-based tree construction approach to reduce computation costs. In order to achieve high parallel performance without incurring any extra communication cost, we introduce the <italic>conjunction</italic> and <italic>slide</italic> methods to ensure that each batch contains a stable number of carefully arranged <italic>decision tasks</italic>. To further reduce communication and computation costs, we propose a prefix-based pre-pruning method to reduce the number of nodes that need to be judged whether to split by an interactive protocol. Extensive experiments on real datasets demonstrate that our DPST solution offers desirable data utility with low computation and communication costs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Given a set of local sequential datasets held by multiple parties, we study the problem of publishing a synthetic dataset that preserves approximate sequentiality information of the integrated dataset while satisfying differential privacy for each local dataset. The existing solutions for publishing differentially private sequential data in the centralized setting mostly adopt tree-based approaches. Such approaches rely on different tree structures that encode sequential data's statistical information. The construction of a tree structure is normally done by recursively splitting nodes whose noisy scores (e.g., entropy or count) are larger than a given threshold. However, extending similar ideas to the multi-party setting is challenging. First, the comparison between noisy scores and a given threshold needs to be done in a distributed manner without letting the parties know the noisy scores, while satisfying differential privacy for each local dataset. Second, in the multi-party setting the large number of node splitting decisions incurs prohibitive computation costs. In addressing the above challenges, we present DPST, a distributed prediction suffix tree construction solution. In DPST, we first introduce a novel node splitting decision method that calculates the comparison result under encryption with substantially improved efficiency. Then we present a novel batch-based tree construction approach to reduce computation costs. In order to achieve high parallel performance without incurring any extra communication cost, we introduce the conjunction and slide methods to ensure that each batch contains a stable number of carefully arranged decision tasks. To further reduce communication and computation costs, we propose a prefix-based pre-pruning method to reduce the number of nodes that need to be judged whether to split by an interactive protocol. Extensive experiments on real datasets demonstrate that our DPST solution offers desirable data utility with low computation and communication costs.",
"title": "Multi-Party Sequential Data Publishing Under Differential Privacy",
"normalizedTitle": "Multi-Party Sequential Data Publishing Under Differential Privacy",
"fno": "10035304",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Noise Measurement",
"Differential Privacy",
"Costs",
"Publishing",
"Vegetation",
"Task Analysis",
"Distributed Databases",
"Data Publishing",
"Differential Privacy",
"Multiple Party",
"Sequential Dataset"
],
"authors": [
{
"givenName": "Peng",
"surname": "Tang",
"fullName": "Peng Tang",
"affiliation": "Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong Universtity, Qingdao, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rui",
"surname": "Chen",
"fullName": "Rui Chen",
"affiliation": "College of Computer Science and Technology, Harbin Engineering University, Harbin, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sen",
"surname": "Su",
"fullName": "Sen Su",
"affiliation": "State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shanqing",
"surname": "Guo",
"fullName": "Shanqing Guo",
"affiliation": "Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong Universtity, Qingdao, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lei",
"surname": "Ju",
"fullName": "Lei Ju",
"affiliation": "Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong Universtity, Qingdao, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gaoyuan",
"surname": "Liu",
"fullName": "Gaoyuan Liu",
"affiliation": "Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong Universtity, Qingdao, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-02-01 00:00:00",
"pubType": "trans",
"pages": "1-16",
"year": "5555",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ispa-iucc-bdcloud-socialcom-sustaincom/2018/1141/0/114100a737",
"title": "Dynamic Data Histogram Publishing Based on Differential Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-iucc-bdcloud-socialcom-sustaincom/2018/114100a737/18AuJd5D6da",
"parentPublication": {
"id": "proceedings/ispa-iucc-bdcloud-socialcom-sustaincom/2018/1141/0",
"title": "2018 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msn/2018/0548/0/054800a177",
"title": "Real-Time Trajectory Data Publishing Method with Differential Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/msn/2018/054800a177/19m3pknLjeo",
"parentPublication": {
"id": "proceedings/msn/2018/0548/0",
"title": "2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2021/1658/0/165800b246",
"title": "Release of Trajectory Data based on Space Segmentation using Differential Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2021/165800b246/1BBzBnOEAE0",
"parentPublication": {
"id": "proceedings/trustcom/2021/1658/0",
"title": "2021 IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10018869",
"title": "Global Combination and Clustering based Differential Privacy Mixed Data Publishing",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10018869/1K0DzlUYrq8",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msn/2022/6457/0/645700a803",
"title": "Publishing Weighted Graph with Node Differential Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/msn/2022/645700a803/1LUtXKiR5oA",
"parentPublication": {
"id": "proceedings/msn/2022/6457/0",
"title": "2022 18th International Conference on Mobility, Sensing and Networking (MSN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2019/2607/1/260701a746",
"title": "Dynamic Data Publishing with Differential Privacy via Reinforcement Learning",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2019/260701a746/1cYiDunH1IY",
"parentPublication": {
"id": "proceedings/compsac/2019/2607/1",
"title": "2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2020/08/08673599",
"title": "Multi-Party High-Dimensional Data Publishing Under Differential Privacy",
"doi": null,
"abstractUrl": "/journal/tk/2020/08/08673599/1lgLkcd0nwk",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2020/4380/0/438000b718",
"title": "Differential Privacy Preserving Data Publishing Based on Bayesian Network",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2020/438000b718/1r54jugQZry",
"parentPublication": {
"id": "proceedings/trustcom/2020/4380/0",
"title": "2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2021/9184/0/918400a145",
"title": "Differentially Private Publication of Multi-Party Sequential Data",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2021/918400a145/1uGXduYnpiU",
"parentPublication": {
"id": "proceedings/icde/2021/9184/0",
"title": "2021 IEEE 37th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/04/09619911",
"title": "Publishing Graphs Under Node Differential Privacy",
"doi": null,
"abstractUrl": "/journal/tk/2023/04/09619911/1yDfpSNbeJG",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10035414",
"articleId": "1Krc4tj3GAE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10036144",
"articleId": "1KsRzjDLuMg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwCsdFw",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tk",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1E5LzWuB8Sk",
"doi": "10.1109/TKDE.2022.3180886",
"abstract": "Concepts are building blocks of human thinking. For machines, concept understanding has also been increasingly important, which makes concept representation a fundamental problem in artificial intelligence. While many concepts have their instances, the massive amount of information carried by instances has long been ignored in current concept representation, which limits the usage of these concepts in applications. In this paper, inspired by prototype theory in cognitive science, we propose prototypical concept representation for machines, which represents each concept with a distributed prototype derived from representations of its instances. For prototypical representation learning, we further introduce a novel model named Prototypical Siamese Network (PSN). PSN is trained under the supervision of <sc>isA</sc> determination, one of the most important concept-related applications. Results of extensive experiments demonstrate that, our method achieves state-of-the-art performance, thus validating the effectiveness of prototypical concept representation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Concepts are building blocks of human thinking. For machines, concept understanding has also been increasingly important, which makes concept representation a fundamental problem in artificial intelligence. While many concepts have their instances, the massive amount of information carried by instances has long been ignored in current concept representation, which limits the usage of these concepts in applications. In this paper, inspired by prototype theory in cognitive science, we propose prototypical concept representation for machines, which represents each concept with a distributed prototype derived from representations of its instances. For prototypical representation learning, we further introduce a novel model named Prototypical Siamese Network (PSN). PSN is trained under the supervision of <sc>isA</sc> determination, one of the most important concept-related applications. Results of extensive experiments demonstrate that, our method achieves state-of-the-art performance, thus validating the effectiveness of prototypical concept representation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Concepts are building blocks of human thinking. For machines, concept understanding has also been increasingly important, which makes concept representation a fundamental problem in artificial intelligence. While many concepts have their instances, the massive amount of information carried by instances has long been ignored in current concept representation, which limits the usage of these concepts in applications. In this paper, inspired by prototype theory in cognitive science, we propose prototypical concept representation for machines, which represents each concept with a distributed prototype derived from representations of its instances. For prototypical representation learning, we further introduce a novel model named Prototypical Siamese Network (PSN). PSN is trained under the supervision of isA determination, one of the most important concept-related applications. Results of extensive experiments demonstrate that, our method achieves state-of-the-art performance, thus validating the effectiveness of prototypical concept representation.",
"title": "Prototypical Concept Representation",
"normalizedTitle": "Prototypical Concept Representation",
"fno": "09790317",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Prototypes",
"Task Analysis",
"Taxonomy",
"Semantics",
"Context Modeling",
"Cognition",
"Representation Learning",
"Concept Learning",
"Distributed Representations",
"Machine Learning",
"Knowledge Graphs"
],
"authors": [
{
"givenName": "Xintao",
"surname": "Wang",
"fullName": "Xintao Wang",
"affiliation": "Shanghai Key Laboratory of Data Science, School of Computer Science, Fudan University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiaqing",
"surname": "Liang",
"fullName": "Jiaqing Liang",
"affiliation": "Shanghai Key Laboratory of Data Science, School of Computer Science, Fudan University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yanghua",
"surname": "Xiao",
"fullName": "Yanghua Xiao",
"affiliation": "Shanghai Key Laboratory of Data Science, School of Computer Science, Fudan University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Wang",
"fullName": "Wei Wang",
"affiliation": "Shanghai Key Laboratory of Data Science, School of Computer Science, Fudan University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-06-01 00:00:00",
"pubType": "trans",
"pages": "1-14",
"year": "5555",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/tools/1999/0393/0/03930014",
"title": "Software Evolution: Prototypical Deltas",
"doi": null,
"abstractUrl": "/proceedings-article/tools/1999/03930014/12OmNA0vo1W",
"parentPublication": {
"id": "proceedings/tools/1999/0393/0",
"title": "Proceedings Technology of Object-Oriented Languages and Systems. TOOLS 31",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2010/7029/0/05543178",
"title": "Learning prototypical shapes for object categories",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2010/05543178/12OmNqGA56p",
"parentPublication": {
"id": "proceedings/cvprw/2010/7029/0",
"title": "2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2011/4408/0/4408a370",
"title": "Context-Aware Multi-instance Learning Based on Hierarchical Sparse Representation",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2011/4408a370/12OmNwtWfJ7",
"parentPublication": {
"id": "proceedings/icdm/2011/4408/0",
"title": "2011 IEEE 11th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/coginf/2010/8042/0/05599710",
"title": "Text knowledge representation model based on human concept learning",
"doi": null,
"abstractUrl": "/proceedings-article/coginf/2010/05599710/12OmNyQGS8v",
"parentPublication": {
"id": "proceedings/coginf/2010/8042/0",
"title": "2010 9th IEEE International Conference on Cognitive Informatics (ICCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/tai/1993/4200/0/00633941",
"title": "Object-oriented programming and frame-based knowledge representation",
"doi": null,
"abstractUrl": "/proceedings-article/tai/1993/00633941/12OmNyjtNGT",
"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/cit/2012/4858/0/4858b066",
"title": "A Text Representation and Retrieval Method Based on Concept Algebra",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2012/4858b066/12OmNz5JCgZ",
"parentPublication": {
"id": "proceedings/cit/2012/4858/0",
"title": "Computer and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/05/09699028",
"title": "Granularity-Aware Area Prototypical Network With Bimargin Loss for Few Shot Relation Classification",
"doi": null,
"abstractUrl": "/journal/tk/2023/05/09699028/1ADJcMO1lkY",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2022/0915/0/091500a846",
"title": "Self-supervised Video Representation Learning with Cross-Stream Prototypical Contrasting",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2022/091500a846/1B13LMICTdK",
"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/iccv/2021/2812/0/281200g954",
"title": "Prototypical Matching and Open Set Rejection for Zero-Shot Semantic Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200g954/1BmL2KXMVb2",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2022/8563/0/09859811",
"title": "Cross-Domain Action Recognition via Prototypical Graph Alignment",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2022/09859811/1G9EuBOBEHu",
"parentPublication": {
"id": "proceedings/icme/2022/8563/0",
"title": "2022 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09789476",
"articleId": "1E5LzPDo21G",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09794568",
"articleId": "1Eb12L6bPNK",
"__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": "1AvqGUeSJDG",
"doi": "10.1109/TKDE.2022.3146178",
"abstract": "Most recommendation systems focus on predicting rating or finding aspect information in reviews to understand user preferences and item properties. However, these methods ignore the effectiveness and persuasiveness of recommendation results. Consequently, explainable recommendation, namely providing recommendation results with recommendation reasons at the same time, has attracted increasing attention of researchers due to its ability in fostering transparency and trust. It is lucky that some E-commerce websites provide a kind of new interaction box called Tips and users can express their comments on items with a simple sentence. This brings us an opportunity to realize explainable recommendation. Under the supervision of two explicit feedbacks, namely rating and textual tips, we can implement a multi-task learning model which can provide recommendation results and generate recommendation reasons at the same time. In this paper, we propose an <bold>E</bold>ncoder-Decoder and <bold>M</bold>ulti-Layer Perception (MLP) based <bold>E</bold>xplainable <bold>R</bold>ecommendation model named <italic>EMER</italic> to simultaneously implement reason generation and rating prediction. Item’s title contains significant product-related information and plays an important role in grabbing user’s attention, so we fuse it in our model to generate recommendation reasons. Numerous experiments on benchmark datasets demonstrate that our model is superior to the state-of-the-art models.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Most recommendation systems focus on predicting rating or finding aspect information in reviews to understand user preferences and item properties. However, these methods ignore the effectiveness and persuasiveness of recommendation results. Consequently, explainable recommendation, namely providing recommendation results with recommendation reasons at the same time, has attracted increasing attention of researchers due to its ability in fostering transparency and trust. It is lucky that some E-commerce websites provide a kind of new interaction box called Tips and users can express their comments on items with a simple sentence. This brings us an opportunity to realize explainable recommendation. Under the supervision of two explicit feedbacks, namely rating and textual tips, we can implement a multi-task learning model which can provide recommendation results and generate recommendation reasons at the same time. In this paper, we propose an <bold>E</bold>ncoder-Decoder and <bold>M</bold>ulti-Layer Perception (MLP) based <bold>E</bold>xplainable <bold>R</bold>ecommendation model named <italic>EMER</italic> to simultaneously implement reason generation and rating prediction. Item’s title contains significant product-related information and plays an important role in grabbing user’s attention, so we fuse it in our model to generate recommendation reasons. Numerous experiments on benchmark datasets demonstrate that our model is superior to the state-of-the-art models.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Most recommendation systems focus on predicting rating or finding aspect information in reviews to understand user preferences and item properties. However, these methods ignore the effectiveness and persuasiveness of recommendation results. Consequently, explainable recommendation, namely providing recommendation results with recommendation reasons at the same time, has attracted increasing attention of researchers due to its ability in fostering transparency and trust. It is lucky that some E-commerce websites provide a kind of new interaction box called Tips and users can express their comments on items with a simple sentence. This brings us an opportunity to realize explainable recommendation. Under the supervision of two explicit feedbacks, namely rating and textual tips, we can implement a multi-task learning model which can provide recommendation results and generate recommendation reasons at the same time. In this paper, we propose an Encoder-Decoder and Multi-Layer Perception (MLP) based Explainable Recommendation model named EMER to simultaneously implement reason generation and rating prediction. Item’s title contains significant product-related information and plays an important role in grabbing user’s attention, so we fuse it in our model to generate recommendation reasons. Numerous experiments on benchmark datasets demonstrate that our model is superior to the state-of-the-art models.",
"title": "Joint Reason Generation and Rating Prediction for Explainable Recommendation",
"normalizedTitle": "Joint Reason Generation and Rating Prediction for Explainable Recommendation",
"fno": "09695275",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Deep Learning Artificial Intelligence",
"Electronic Commerce",
"Learning Artificial Intelligence",
"Pattern Classification",
"Recommender Systems",
"Sentiment Analysis",
"Web Sites",
"Explainable Recommendation",
"Joint Reason Generation",
"Rating Prediction",
"Recommendation Reasons",
"Recommendation Systems",
"Predictive Models",
"Task Analysis",
"Collaboration",
"Multitasking",
"Electronic Commerce",
"Numerical Models",
"Cognition",
"Reason Generation",
"Rating Prediction",
"Multi Task Learning",
"Explainable Recommendation"
],
"authors": [
{
"givenName": "Jihua",
"surname": "Zhu",
"fullName": "Jihua Zhu",
"affiliation": "School of Software Engineering, Xi’an Jiaotong University, Xi’an, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yujiao",
"surname": "He",
"fullName": "Yujiao He",
"affiliation": "School of Software Engineering, Xi’an Jiaotong University, Xi’an, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guoshuai",
"surname": "Zhao",
"fullName": "Guoshuai Zhao",
"affiliation": "School of Software Engineering, Xi’an Jiaotong University, Xi’an, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xuxiao",
"surname": "Bu",
"fullName": "Xuxiao Bu",
"affiliation": "School of Software Engineering, Xi’an Jiaotong University, Xi’an, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xueming",
"surname": "Qian",
"fullName": "Xueming Qian",
"affiliation": "Ministry of Education Key Laboratory for Intelligent Networks and Network Security and with SMILES LAB, Xi’an Jiaotong University, Xi’an, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2023-05-01 00:00:00",
"pubType": "trans",
"pages": "4940-4953",
"year": "2023",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cinc/2009/3645/2/3645b072",
"title": "A Collaborative Filtering Recommendation Algorithm Based on Item Genre and Rating Similarity",
"doi": null,
"abstractUrl": "/proceedings-article/cinc/2009/3645b072/12OmNwDSdKS",
"parentPublication": {
"id": "cinc/2009/3645/2",
"title": "Computational Intelligence and Natural Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2007/03/x3048",
"title": "New Recommendation Techniques for Multicriteria Rating Systems",
"doi": null,
"abstractUrl": "/magazine/ex/2007/03/x3048/13rRUwgQpyT",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2018/9288/0/928800b316",
"title": "Why You Should Listen to This Song: Reason Generation for Explainable Recommendation",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2018/928800b316/18jXA59PkVa",
"parentPublication": {
"id": "proceedings/icdmw/2018/9288/0",
"title": "2018 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09947331",
"title": "Aspect-guided Syntax Graph Learning for Explainable Recommendation",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09947331/1IiLdisq7yU",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10018538",
"title": "Reinforcement Learning based Path Exploration for Sequential Explainable Recommendation",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10018538/1K0DzwmJ4fm",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020741",
"title": "Multi-criteria Rating and Review based Recommendation Model",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020741/1KfR9m8UqZi",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2022/9402/0/940200a151",
"title": "Explainable Recommendation Enhancing Review Properties and PPLM",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2022/940200a151/1MBEPZr6EUM",
"parentPublication": {
"id": "proceedings/wi-iat/2022/9402/0",
"title": "2022 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/05/09145860",
"title": "Adaptive Hierarchical Attention-Enhanced Gated Network Integrating Reviews for Item Recommendation",
"doi": null,
"abstractUrl": "/journal/tk/2022/05/09145860/1lDZZfCXDB6",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2020/1924/0/192400a496",
"title": "Cross-Domain Rating Prediction for Market Development",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2020/192400a496/1uHhu2glPBC",
"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"
},
{
"id": "proceedings/iscipt/2021/4137/0/413700a185",
"title": "Recommendation system based on user preference and prediction rating",
"doi": null,
"abstractUrl": "/proceedings-article/iscipt/2021/413700a185/1zzpFQzQNe8",
"parentPublication": {
"id": "proceedings/iscipt/2021/4137/0",
"title": "2021 6th International Symposium on Computer and Information Processing Technology (ISCIPT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09699426",
"articleId": "1ADJckGjtiE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09681226",
"articleId": "1A8c5JBAXu0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1JInFQ8f8Q0",
"title": "Feb.",
"year": "2023",
"issueNum": "02",
"idPrefix": "tp",
"pubType": "journal",
"volume": "45",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1C0j3UXditG",
"doi": "10.1109/TPAMI.2022.3161804",
"abstract": "Semantic matching models—which assume that entities with similar semantics have similar embeddings—have shown great power in knowledge graph embeddings (KGE). Many existing semantic matching models use inner products in embedding spaces to measure the plausibility of triples and quadruples in static and temporal knowledge graphs. However, vectors that have the same inner products with another vector can still be orthogonal to each other, which implies that entities with similar semantics may have dissimilar embeddings. This property of inner products significantly limits the performance of semantic matching models. To address this challenge, we propose a novel regularizer—namely, <bold>DU</bold>ality-induced <bold>R</bold>egul<bold>A</bold>rizer (DURA)—which effectively encourages the entities with similar semantics to have similar embeddings. The major novelty of DURA is based on the observation that, for an existing semantic matching KGE model (<italic>primal</italic>), there is often another distance based KGE model (<italic>dual</italic>) closely associated with it, which can be used as effective constraints for entity embeddings. Experiments demonstrate that DURA consistently and significantly improves the performance of state-of-the-art semantic matching models on both static and temporal knowledge graph benchmarks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Semantic matching models—which assume that entities with similar semantics have similar embeddings—have shown great power in knowledge graph embeddings (KGE). Many existing semantic matching models use inner products in embedding spaces to measure the plausibility of triples and quadruples in static and temporal knowledge graphs. However, vectors that have the same inner products with another vector can still be orthogonal to each other, which implies that entities with similar semantics may have dissimilar embeddings. This property of inner products significantly limits the performance of semantic matching models. To address this challenge, we propose a novel regularizer—namely, <bold>DU</bold>ality-induced <bold>R</bold>egul<bold>A</bold>rizer (DURA)—which effectively encourages the entities with similar semantics to have similar embeddings. The major novelty of DURA is based on the observation that, for an existing semantic matching KGE model (<italic>primal</italic>), there is often another distance based KGE model (<italic>dual</italic>) closely associated with it, which can be used as effective constraints for entity embeddings. Experiments demonstrate that DURA consistently and significantly improves the performance of state-of-the-art semantic matching models on both static and temporal knowledge graph benchmarks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Semantic matching models—which assume that entities with similar semantics have similar embeddings—have shown great power in knowledge graph embeddings (KGE). Many existing semantic matching models use inner products in embedding spaces to measure the plausibility of triples and quadruples in static and temporal knowledge graphs. However, vectors that have the same inner products with another vector can still be orthogonal to each other, which implies that entities with similar semantics may have dissimilar embeddings. This property of inner products significantly limits the performance of semantic matching models. To address this challenge, we propose a novel regularizer—namely, DUality-induced RegulArizer (DURA)—which effectively encourages the entities with similar semantics to have similar embeddings. The major novelty of DURA is based on the observation that, for an existing semantic matching KGE model (primal), there is often another distance based KGE model (dual) closely associated with it, which can be used as effective constraints for entity embeddings. Experiments demonstrate that DURA consistently and significantly improves the performance of state-of-the-art semantic matching models on both static and temporal knowledge graph benchmarks.",
"title": "Duality-Induced Regularizer for Semantic Matching Knowledge Graph Embeddings",
"normalizedTitle": "Duality-Induced Regularizer for Semantic Matching Knowledge Graph Embeddings",
"fno": "09741534",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Duality Mathematics",
"Semantic Networks",
"Dissimilar Embeddings",
"Duality Induced Regularizer",
"Inner Products",
"Semantic Matching KGE Model",
"Semantic Matching Knowledge Graph Embeddings",
"Static Knowledge Graph Benchmarks",
"Static Knowledge Graphs",
"Temporal Knowledge Graph Benchmarks",
"Temporal Knowledge Graphs",
"Semantics",
"Tensors",
"Computational Modeling",
"Analytical Models",
"Predictive Models",
"Minimization",
"Triples Data Structure",
"Knowledge Graph",
"Knowledge Graph Embeddings",
"Link Prediction",
"Regularization",
"Temporal Knowledge Graphs"
],
"authors": [
{
"givenName": "Jie",
"surname": "Wang",
"fullName": "Jie Wang",
"affiliation": "CAS Key Laboratory of Technology in GIPAS, University of Science and Technology of China, Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhanqiu",
"surname": "Zhang",
"fullName": "Zhanqiu Zhang",
"affiliation": "CAS Key Laboratory of Technology in GIPAS, University of Science and Technology of China, Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhihao",
"surname": "Shi",
"fullName": "Zhihao Shi",
"affiliation": "CAS Key Laboratory of Technology in GIPAS, University of Science and Technology of China, Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jianyu",
"surname": "Cai",
"fullName": "Jianyu Cai",
"affiliation": "CAS Key Laboratory of Technology in GIPAS, University of Science and Technology of China, Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shuiwang",
"surname": "Ji",
"fullName": "Shuiwang Ji",
"affiliation": "Department of Computer Science and Engineering, Texas A&M University, College Station, TX, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Feng",
"surname": "Wu",
"fullName": "Feng Wu",
"affiliation": "CAS Key Laboratory of Technology in GIPAS, University of Science and Technology of China, Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2023-02-01 00:00:00",
"pubType": "trans",
"pages": "1652-1667",
"year": "2023",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tk/2023/05/09713947",
"title": "Geometric Algebra Based Embeddings for Static and Temporal Knowledge Graph Completion",
"doi": null,
"abstractUrl": "/journal/tk/2023/05/09713947/1AZKX05IxjO",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2023/02/09794430",
"title": "GOGCN: Graph Convolutional Network on Gene Ontology for Functional Similarity Analysis of Genes",
"doi": null,
"abstractUrl": "/journal/tb/2023/02/09794430/1E5Lw8qRHbO",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600j306",
"title": "VGSE: Visually-Grounded Semantic Embeddings for Zero-Shot Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600j306/1H1j2mN3nuE",
"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/ictai/2022/9744/0/974400a361",
"title": "Knowledge Graph Completion by Multi-Channel Translating Embeddings",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2022/974400a361/1MrFW9T1VV6",
"parentPublication": {
"id": "proceedings/ictai/2022/9744/0",
"title": "2022 IEEE 34th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2019/3293/0/329300f989",
"title": "Low-Rank Tensor Completion With a New Tensor Nuclear Norm Induced by Invertible Linear Transforms",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300f989/1gyrM5lN0T6",
"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/icdmw/2020/9012/0/901200a561",
"title": "Ensemble Node Embeddings using Tensor Decomposition: A Case-Study on DeepWalk",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2020/901200a561/1rgGidxk9eE",
"parentPublication": {
"id": "proceedings/icdmw/2020/9012/0",
"title": "2020 International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09525301",
"title": "Knowledge Graph Completion by Jointly Learning Structural Features and Soft Logical Rules",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09525301/1wuoP9kWXsY",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09763389",
"articleId": "1CT4SB4K316",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09766436",
"articleId": "1D4HhnlHlEA",
"__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": "1EzDPIlNqgM",
"doi": "10.1109/TMC.2022.3186936",
"abstract": "Data generated at the network edge can be processed locally by leveraging the paradigm of Edge Computing (EC). Aided by EC, Federated Learning (FL) has been becoming a practical and popular approach for distributed machine learning over locally distributed data. However, FL faces three critical challenges, i.e, resource constraint, system heterogeneity and context dynamics in EC. To address these challenges, we present a training-efficient FL method, termed <italic>FedLamp</italic>, by optimizing both the <bold>L</bold>ocal upd<bold>a</bold>ting frequency and <bold>m</bold>odel com<bold>p</bold>ression ratio in the resource-constrained EC systems. We theoretically analyze the model convergence rate and obtain a convergence upper bound related to the local updating frequency and model compression ratio. Upon the convergence bound, we propose a control algorithm, that adaptively determines diverse and appropriate local updating frequencies and model compression ratios for different edge nodes, so as to reduce the waiting time and enhance the training efficiency. We evaluate the performance of <italic>FedLamp</italic> through extensive simulation and testbed experiments. Evaluation results show that <italic>FedLamp</italic> can reduce the traffic consumption by 63% and the completion time by about 52% for achieving the similar test accuracy, compared to the baselines.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Data generated at the network edge can be processed locally by leveraging the paradigm of Edge Computing (EC). Aided by EC, Federated Learning (FL) has been becoming a practical and popular approach for distributed machine learning over locally distributed data. However, FL faces three critical challenges, i.e, resource constraint, system heterogeneity and context dynamics in EC. To address these challenges, we present a training-efficient FL method, termed <italic>FedLamp</italic>, by optimizing both the <bold>L</bold>ocal upd<bold>a</bold>ting frequency and <bold>m</bold>odel com<bold>p</bold>ression ratio in the resource-constrained EC systems. We theoretically analyze the model convergence rate and obtain a convergence upper bound related to the local updating frequency and model compression ratio. Upon the convergence bound, we propose a control algorithm, that adaptively determines diverse and appropriate local updating frequencies and model compression ratios for different edge nodes, so as to reduce the waiting time and enhance the training efficiency. We evaluate the performance of <italic>FedLamp</italic> through extensive simulation and testbed experiments. Evaluation results show that <italic>FedLamp</italic> can reduce the traffic consumption by 63% and the completion time by about 52% for achieving the similar test accuracy, compared to the baselines.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Data generated at the network edge can be processed locally by leveraging the paradigm of Edge Computing (EC). Aided by EC, Federated Learning (FL) has been becoming a practical and popular approach for distributed machine learning over locally distributed data. However, FL faces three critical challenges, i.e, resource constraint, system heterogeneity and context dynamics in EC. To address these challenges, we present a training-efficient FL method, termed FedLamp, by optimizing both the Local updating frequency and model compression ratio in the resource-constrained EC systems. We theoretically analyze the model convergence rate and obtain a convergence upper bound related to the local updating frequency and model compression ratio. Upon the convergence bound, we propose a control algorithm, that adaptively determines diverse and appropriate local updating frequencies and model compression ratios for different edge nodes, so as to reduce the waiting time and enhance the training efficiency. We evaluate the performance of FedLamp through extensive simulation and testbed experiments. Evaluation results show that FedLamp can reduce the traffic consumption by 63% and the completion time by about 52% for achieving the similar test accuracy, compared to the baselines.",
"title": "Adaptive Control of Local Updating and Model Compression for Efficient Federated Learning",
"normalizedTitle": "Adaptive Control of Local Updating and Model Compression for Efficient Federated Learning",
"fno": "09809924",
"hasPdf": true,
"idPrefix": "tm",
"keywords": [
"Adaptation Models",
"Computational Modeling",
"Training",
"Convergence",
"Bandwidth",
"Analytical Models",
"Time Frequency Analysis",
"Edge Computing",
"Federated Learning",
"Local Updating",
"Model Compression"
],
"authors": [
{
"givenName": "Yang",
"surname": "Xu",
"fullName": "Yang Xu",
"affiliation": "School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yunming",
"surname": "Liao",
"fullName": "Yunming Liao",
"affiliation": "School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongli",
"surname": "Xu",
"fullName": "Hongli Xu",
"affiliation": "School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhenguo",
"surname": "Ma",
"fullName": "Zhenguo Ma",
"affiliation": "School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lun",
"surname": "Wang",
"fullName": "Lun Wang",
"affiliation": "School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jianchun",
"surname": "Liu",
"fullName": "Jianchun Liu",
"affiliation": "School of Data Science, University of Science and Technology of China, Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-06-01 00:00:00",
"pubType": "trans",
"pages": "1-16",
"year": "5555",
"issn": "1536-1233",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/nt/2022/04/09705093",
"title": "Multi-Stage Hybrid Federated Learning Over Large-Scale D2D-Enabled Fog Networks",
"doi": null,
"abstractUrl": "/journal/nt/2022/04/09705093/1AIHTDVmS3K",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/12/09810502",
"title": "<italic>Eiffel</italic>: Efficient and Fair Scheduling in Adaptive Federated Learning",
"doi": null,
"abstractUrl": "/journal/td/2022/12/09810502/1EBiW6MzSiA",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/5555/01/09829327",
"title": "HCFL: A High Compression Approach for Communication-Efficient Federated Learning in Very Large Scale IoT Networks",
"doi": null,
"abstractUrl": "/journal/tm/5555/01/09829327/1EYxnoyLqE0",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2023/06/09913718",
"title": "Accelerating Federated Learning With a Global Biased Optimiser",
"doi": null,
"abstractUrl": "/journal/tc/2023/06/09913718/1Hmgfqc8f7i",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/5555/01/09944948",
"title": "Decentralized Federated Learning with Intermediate Results in Mobile Edge Computing",
"doi": null,
"abstractUrl": "/journal/tm/5555/01/09944948/1IbMb0GzL8c",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/5555/01/10004844",
"title": "SlimFL: Federated Learning With Superposition Coding Over Slimmable Neural Networks",
"doi": null,
"abstractUrl": "/journal/nt/5555/01/10004844/1JC5roWqGu4",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2023/03/09996127",
"title": "GossipFL: A Decentralized Federated Learning Framework With Sparsified and Adaptive Communication",
"doi": null,
"abstractUrl": "/journal/td/2023/03/09996127/1Jim0lSwFeU",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/04/09238427",
"title": "Lazily Aggregated Quantized Gradient Innovation for Communication-Efficient Federated Learning",
"doi": null,
"abstractUrl": "/journal/tp/2022/04/09238427/1oa0WCczEZO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2023/01/09415152",
"title": "Adaptive Batch Size for Federated Learning in Resource-Constrained Edge Computing",
"doi": null,
"abstractUrl": "/journal/tm/2023/01/09415152/1t2ifPPh8Va",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/03/09492755",
"title": "Multi-Task Federated Learning for Personalised Deep Neural Networks in Edge Computing",
"doi": null,
"abstractUrl": "/journal/td/2022/03/09492755/1vq0IneiQA8",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09809921",
"articleId": "1EzDPiMc7Go",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09812500",
"articleId": "1ECXBxHhiZG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1EMV5pcnDvW",
"name": "ttm555501-09809924s1-supp1-3186936.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttm555501-09809924s1-supp1-3186936.pdf",
"extension": "pdf",
"size": "189 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwCsdFw",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tk",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1GeUPmAKUyk",
"doi": "10.1109/TKDE.2022.3200921",
"abstract": "As a key component of e-commerce computing, product representation learning (PRL) provides benefits for a variety of applications, including product matching, search, and categorization. The existing PRL approaches have poor language understanding ability due to their inability to capture contextualized semantics. In addition, the learned representations by existing methods are not easily transferable to new products. Inspired by the recent advance of pre-trained language models (PLMs), we make the attempt to adapt PLMs for PRL to mitigate the above issues. In this paper, we develop KINDLE, a<bold>K</bold>nowledge-dr<bold>I</bold>ven pre-traini<bold>N</bold>g framework for pro<bold>D</bold>uct representation <bold>LE</bold>arning, which can preserve the contextual semantics and multi-faceted product knowledge <italic>robustly</italic> and <italic>flexibly</italic>. Specifically, we first extend traditional one-stage pre-training to a two-stage pre-training framework, and exploit a deliberate knowledge encoder to ensure a smooth knowledge fusion into PLM. In addition, we propose a multi-objective heterogeneous embedding method to represent thousands of knowledge elements. This helps KINDLE calibrate knowledge noise and sparsity automatically by replacing isolated classes as training targets in knowledge acquisition tasks. Furthermore, an input-aware gating network is proposed to select the most relevant knowledge for different downstream tasks. Finally, extensive experiments have demonstrated the advantages of KINDLE over the state-of-the-art baselines across three downstream tasks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As a key component of e-commerce computing, product representation learning (PRL) provides benefits for a variety of applications, including product matching, search, and categorization. The existing PRL approaches have poor language understanding ability due to their inability to capture contextualized semantics. In addition, the learned representations by existing methods are not easily transferable to new products. Inspired by the recent advance of pre-trained language models (PLMs), we make the attempt to adapt PLMs for PRL to mitigate the above issues. In this paper, we develop KINDLE, a<bold>K</bold>nowledge-dr<bold>I</bold>ven pre-traini<bold>N</bold>g framework for pro<bold>D</bold>uct representation <bold>LE</bold>arning, which can preserve the contextual semantics and multi-faceted product knowledge <italic>robustly</italic> and <italic>flexibly</italic>. Specifically, we first extend traditional one-stage pre-training to a two-stage pre-training framework, and exploit a deliberate knowledge encoder to ensure a smooth knowledge fusion into PLM. In addition, we propose a multi-objective heterogeneous embedding method to represent thousands of knowledge elements. This helps KINDLE calibrate knowledge noise and sparsity automatically by replacing isolated classes as training targets in knowledge acquisition tasks. Furthermore, an input-aware gating network is proposed to select the most relevant knowledge for different downstream tasks. Finally, extensive experiments have demonstrated the advantages of KINDLE over the state-of-the-art baselines across three downstream tasks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As a key component of e-commerce computing, product representation learning (PRL) provides benefits for a variety of applications, including product matching, search, and categorization. The existing PRL approaches have poor language understanding ability due to their inability to capture contextualized semantics. In addition, the learned representations by existing methods are not easily transferable to new products. Inspired by the recent advance of pre-trained language models (PLMs), we make the attempt to adapt PLMs for PRL to mitigate the above issues. In this paper, we develop KINDLE, aKnowledge-drIven pre-trainiNg framework for proDuct representation LEarning, which can preserve the contextual semantics and multi-faceted product knowledge robustly and flexibly. Specifically, we first extend traditional one-stage pre-training to a two-stage pre-training framework, and exploit a deliberate knowledge encoder to ensure a smooth knowledge fusion into PLM. In addition, we propose a multi-objective heterogeneous embedding method to represent thousands of knowledge elements. This helps KINDLE calibrate knowledge noise and sparsity automatically by replacing isolated classes as training targets in knowledge acquisition tasks. Furthermore, an input-aware gating network is proposed to select the most relevant knowledge for different downstream tasks. Finally, extensive experiments have demonstrated the advantages of KINDLE over the state-of-the-art baselines across three downstream tasks.",
"title": "Multi-Faceted Knowledge-Driven Pre-Training for Product Representation Learning",
"normalizedTitle": "Multi-Faceted Knowledge-Driven Pre-Training for Product Representation Learning",
"fno": "09869708",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Task Analysis",
"Monitoring",
"Semantics",
"Pediatrics",
"Representation Learning",
"Electronic Publishing",
"Electronic Commerce",
"Product Representation Learning",
"Product Search",
"Product Matching",
"Product Classification",
"Pre Trained Language Models"
],
"authors": [
{
"givenName": "Denghui",
"surname": "Zhang",
"fullName": "Denghui Zhang",
"affiliation": "Rutgers, The State University of New Jersey, Newark, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yanchi",
"surname": "Liu",
"fullName": "Yanchi Liu",
"affiliation": "NEC Laboratories America, Princeton, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zixuan",
"surname": "Yuan",
"fullName": "Zixuan Yuan",
"affiliation": "Rutgers, The State University of New Jersey, Newark, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yanjie",
"surname": "Fu",
"fullName": "Yanjie Fu",
"affiliation": "University of Central Florida, Orlando, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haifeng",
"surname": "Chen",
"fullName": "Haifeng Chen",
"affiliation": "NEC Laboratories America, Princeton, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hui",
"surname": "Xiong",
"fullName": "Hui Xiong",
"affiliation": "Rutgers, The State University of New Jersey, Newark, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-08-01 00:00:00",
"pubType": "trans",
"pages": "1-12",
"year": "5555",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/aiccsa/2016/4320/0/07945821",
"title": "Some commericial concerns of Amazon's community forums: The case of the Kindle",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2016/07945821/12OmNzdGnqi",
"parentPublication": {
"id": "proceedings/aiccsa/2016/4320/0",
"title": "2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/01/09693189",
"title": "Reinforced, Incremental and Cross-Lingual Event Detection From Social Messages",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09693189/1As6TRFHnOM",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/05/09695275",
"title": "Joint Reason Generation and Rating Prediction for Explainable Recommendation",
"doi": null,
"abstractUrl": "/journal/tk/2023/05/09695275/1AvqGUeSJDG",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/03/09779951",
"title": "Seed the Views: Hierarchical Semantic Alignment for Contrastive Representation Learning",
"doi": null,
"abstractUrl": "/journal/tp/2023/03/09779951/1DBTw34fQdy",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09935254",
"title": "OERL: Enhanced Representation Learning Via Open Knowledge Graphs",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09935254/1HYqBmhzTDW",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/10003654",
"title": "A Multi-Task Multi-Stage Transitional Training Framework for Neural Chat Translation",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/10003654/1JwLorw3TFK",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/5555/01/10058556",
"title": "API Usage Recommendation via Multi-View Heterogeneous Graph Representation Learning",
"doi": null,
"abstractUrl": "/journal/ts/5555/01/10058556/1LdkkBWtmY8",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2021/9184/0/918400c476",
"title": "Billion-scale Pre-trained E-commerce Product Knowledge Graph Model",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2021/918400c476/1uGXJ9PqEP6",
"parentPublication": {
"id": "proceedings/icde/2021/9184/0",
"title": "2021 IEEE 37th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/02/09492753",
"title": "Cross-Platform Item Recommendation for Online Social E-Commerce",
"doi": null,
"abstractUrl": "/journal/tk/2023/02/09492753/1vq0EJT4moE",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/12/09656627",
"title": "Collaborative Learning of Label Semantics and Deep Label-Specific Features for Multi-Label Classification",
"doi": null,
"abstractUrl": "/journal/tp/2022/12/09656627/1zumlxTPBLi",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09869733",
"articleId": "1GeUOPuv47S",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09870034",
"articleId": "1GgcKhLBGBW",
"__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": "1GrP68bmAuI",
"doi": "10.1109/TPAMI.2022.3204708",
"abstract": "Reinforcement Learning (RL) can be considered as a sequence modeling task, where an agent employs a sequence of past state-action-reward experiences to predict a sequence of future actions. In this work, we propose <bold>St</bold>ate-<bold>A</bold>ction-<bold>R</bold>eward Transformer (<bold>StAR</bold>former), a Transformer architecture for robot learning with image inputs, which explicitly models <italic>short-term</italic> state-action-reward representations (StAR-representations), essentially introducing a Markovian-like inductive bias to improve <italic>long-term</italic> modeling. StARformer first extracts StAR-representations using self-attending patches of image states, action, and reward tokens within a short temporal window. These StAR-representations are combined with pure image state representations, extracted as convolutional features, to perform self-attention over the whole sequence. Our experimental results show that StARformer outperforms the state-of-the-art Transformer-based method on image-based Atari and DeepMind Control Suite benchmarks, under both offline-RL and imitation learning settings. We find that models can benefit from our combination of patch-wise and convolutional image embeddings. StARformer is also more compliant with longer sequences of inputs than the baseline method. Finally, we demonstrate how StARformer can be successfully applied to a real-world robot imitation learning setting via a human-following task.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Reinforcement Learning (RL) can be considered as a sequence modeling task, where an agent employs a sequence of past state-action-reward experiences to predict a sequence of future actions. In this work, we propose <bold>St</bold>ate-<bold>A</bold>ction-<bold>R</bold>eward Transformer (<bold>StAR</bold>former), a Transformer architecture for robot learning with image inputs, which explicitly models <italic>short-term</italic> state-action-reward representations (StAR-representations), essentially introducing a Markovian-like inductive bias to improve <italic>long-term</italic> modeling. StARformer first extracts StAR-representations using self-attending patches of image states, action, and reward tokens within a short temporal window. These StAR-representations are combined with pure image state representations, extracted as convolutional features, to perform self-attention over the whole sequence. Our experimental results show that StARformer outperforms the state-of-the-art Transformer-based method on image-based Atari and DeepMind Control Suite benchmarks, under both offline-RL and imitation learning settings. We find that models can benefit from our combination of patch-wise and convolutional image embeddings. StARformer is also more compliant with longer sequences of inputs than the baseline method. Finally, we demonstrate how StARformer can be successfully applied to a real-world robot imitation learning setting via a human-following task.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Reinforcement Learning (RL) can be considered as a sequence modeling task, where an agent employs a sequence of past state-action-reward experiences to predict a sequence of future actions. In this work, we propose State-Action-Reward Transformer (StARformer), a Transformer architecture for robot learning with image inputs, which explicitly models short-term state-action-reward representations (StAR-representations), essentially introducing a Markovian-like inductive bias to improve long-term modeling. StARformer first extracts StAR-representations using self-attending patches of image states, action, and reward tokens within a short temporal window. These StAR-representations are combined with pure image state representations, extracted as convolutional features, to perform self-attention over the whole sequence. Our experimental results show that StARformer outperforms the state-of-the-art Transformer-based method on image-based Atari and DeepMind Control Suite benchmarks, under both offline-RL and imitation learning settings. We find that models can benefit from our combination of patch-wise and convolutional image embeddings. StARformer is also more compliant with longer sequences of inputs than the baseline method. Finally, we demonstrate how StARformer can be successfully applied to a real-world robot imitation learning setting via a human-following task.",
"title": "StARformer: Transformer with State-Action-Reward Representations for Robot Learning",
"normalizedTitle": "StARformer: Transformer with State-Action-Reward Representations for Robot Learning",
"fno": "09878209",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Transformers",
"Task Analysis",
"Trajectory",
"Mathematical Models",
"Robot Learning",
"Predictive Models",
"Markov Processes",
"Transformer",
"Robot Learning",
"Reinforcement Learning",
"Imitation Learning"
],
"authors": [
{
"givenName": "Jinghuan",
"surname": "Shang",
"fullName": "Jinghuan Shang",
"affiliation": "Department of Computer Science, Stony Brook University, Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiang",
"surname": "Li",
"fullName": "Xiang Li",
"affiliation": "Department of Computer Science, Stony Brook University, Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kumara",
"surname": "Kahatapitiya",
"fullName": "Kumara Kahatapitiya",
"affiliation": "Department of Computer Science, Stony Brook University, Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yu-Cheol",
"surname": "Lee",
"fullName": "Yu-Cheol Lee",
"affiliation": "Department of Autonomous Vehicle Engineering, Korea Aerospace University, Goyang-si, Gyeonggi-do, Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael S.",
"surname": "Ryoo",
"fullName": "Michael S. Ryoo",
"affiliation": "Department of Computer Science, Stony Brook University, Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-09-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/qest/2004/2185/0/21850165",
"title": "Evaluation of Reward Analysis Methods with MRMSolve 2.0",
"doi": null,
"abstractUrl": "/proceedings-article/qest/2004/21850165/12OmNyQpgMe",
"parentPublication": {
"id": "proceedings/qest/2004/2185/0",
"title": "Quantitative Evaluation of Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciibms/2015/8562/0/07439495",
"title": "Maximizing the average reward in episodic reinforcement learning tasks",
"doi": null,
"abstractUrl": "/proceedings-article/iciibms/2015/07439495/12OmNzBOhEY",
"parentPublication": {
"id": "proceedings/iciibms/2015/8562/0",
"title": "2015 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2023/02/09760073",
"title": "Empirical Study of Protein Feature Representation on Deep Belief Networks Trained With Small Data for Secondary Structure Prediction",
"doi": null,
"abstractUrl": "/journal/tb/2023/02/09760073/1CHsux44DVm",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09950330",
"title": "Multivariate Time Series Forecasting with Dynamic Graph Neural ODEs",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09950330/1IiLdUwEK7m",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/10018569",
"title": "SePiCo: Semantic-Guided Pixel Contrast for Domain Adaptive Semantic Segmentation",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/10018569/1K0DCOx8LQs",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600d319",
"title": "STAR-Transformer: A Spatio-temporal Cross Attention Transformer for Human Action Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600d319/1L8qpvQuULe",
"parentPublication": {
"id": "proceedings/wacv/2023/9346/0",
"title": "2023 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10114565",
"title": "TransCP: A Transformer Pointer Network for Generic Entity Description Generation with Explicit Content-Planning",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10114565/1MPbKyny3fO",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/01/09039683",
"title": "Learning Vertex Representations for Bipartite Networks",
"doi": null,
"abstractUrl": "/journal/tk/2022/01/09039683/1igS3hfyfCg",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/06/09340014",
"title": "Forecasting Action Through Contact Representations From First Person Video",
"doi": null,
"abstractUrl": "/journal/tp/2023/06/09340014/1qL5dKixPS8",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/11/09565383",
"title": "GCP: Graph Encoder With Content-Planning for Sentence Generation From Knowledge Bases",
"doi": null,
"abstractUrl": "/journal/tp/2022/11/09565383/1xx86H3k5Gg",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09878227",
"articleId": "1GrP4QuCCrK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09888037",
"articleId": "1GBRkqcf7m8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1GttZrKpB3W",
"name": "ttp555501-09878209s1-supp2-3204708.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp555501-09878209s1-supp2-3204708.mp4",
"extension": "mp4",
"size": "118 MB",
"__typename": "WebExtraType"
},
{
"id": "1GttZG02SYM",
"name": "ttp555501-09878209s1-supp1-3204708.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp555501-09878209s1-supp1-3204708.pdf",
"extension": "pdf",
"size": "741 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1M80HSPgVmo",
"title": "May",
"year": "2023",
"issueNum": "05",
"idPrefix": "tc",
"pubType": "journal",
"volume": "72",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1HpV6UiTlKw",
"doi": "10.1109/TC.2022.3214113",
"abstract": "Deep Neural Network (DNN) INFerence-as-a-Service (INFaaS) is the dominating workload in current data centers, for which FPGAs become promising hardware platforms because of their high flexibility and energy efficiency. The dynamic and multi-tenancy nature of INFaaS requires careful design in three aspects: multi-tenant architecture, multi-DNN scheduling, and multi-core mapping. These three factors are critical to the system latency and energy efficiency but are also challenging to optimize since they are tightly coupled and correlated. This paper proposes <bold>H3M</bold>, an automatic Design Space Exploration (DSE) framework to jointly optimize the <italic>architecture</italic>, <italic>scheduling</italic>, and <italic>mapping</italic> for serving INFaaS on cloud FPGAs. H3M explores: (1) the architecture design space with <italic><bold>H</bold>eterogeneous</italic> spatial <italic><bold>M</bold>ulti-tenant</italic> sub-accelerators, (2) layer-wise scheduling for <italic><bold>H</bold>eterogeneous</italic> <italic><bold>M</bold>ulti-DNN</italic> workloads, and (3) single-layer mapping to the <italic><bold>H</bold>omogeneous</italic> <italic><bold>M</bold>ulti-core</italic> architecture. H3M beats state-of-the-art multi-tenant DNN accelerators, Planaria and Herald, by up to 7.5× and 3.6× in Energy-Delay-Product (EDP) reduction on the ASIC platform. On the Xilinx U200 and U280 FPGA platforms, H3M offers 2.1-5.7× and 1.8-9.0× EDP reduction over Herald.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Deep Neural Network (DNN) INFerence-as-a-Service (INFaaS) is the dominating workload in current data centers, for which FPGAs become promising hardware platforms because of their high flexibility and energy efficiency. The dynamic and multi-tenancy nature of INFaaS requires careful design in three aspects: multi-tenant architecture, multi-DNN scheduling, and multi-core mapping. These three factors are critical to the system latency and energy efficiency but are also challenging to optimize since they are tightly coupled and correlated. This paper proposes <bold>H3M</bold>, an automatic Design Space Exploration (DSE) framework to jointly optimize the <italic>architecture</italic>, <italic>scheduling</italic>, and <italic>mapping</italic> for serving INFaaS on cloud FPGAs. H3M explores: (1) the architecture design space with <italic><bold>H</bold>eterogeneous</italic> spatial <italic><bold>M</bold>ulti-tenant</italic> sub-accelerators, (2) layer-wise scheduling for <italic><bold>H</bold>eterogeneous</italic> <italic><bold>M</bold>ulti-DNN</italic> workloads, and (3) single-layer mapping to the <italic><bold>H</bold>omogeneous</italic> <italic><bold>M</bold>ulti-core</italic> architecture. H3M beats state-of-the-art multi-tenant DNN accelerators, Planaria and Herald, by up to 7.5× and 3.6× in Energy-Delay-Product (EDP) reduction on the ASIC platform. On the Xilinx U200 and U280 FPGA platforms, H3M offers 2.1-5.7× and 1.8-9.0× EDP reduction over Herald.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Deep Neural Network (DNN) INFerence-as-a-Service (INFaaS) is the dominating workload in current data centers, for which FPGAs become promising hardware platforms because of their high flexibility and energy efficiency. The dynamic and multi-tenancy nature of INFaaS requires careful design in three aspects: multi-tenant architecture, multi-DNN scheduling, and multi-core mapping. These three factors are critical to the system latency and energy efficiency but are also challenging to optimize since they are tightly coupled and correlated. This paper proposes H3M, an automatic Design Space Exploration (DSE) framework to jointly optimize the architecture, scheduling, and mapping for serving INFaaS on cloud FPGAs. H3M explores: (1) the architecture design space with Heterogeneous spatial Multi-tenant sub-accelerators, (2) layer-wise scheduling for Heterogeneous Multi-DNN workloads, and (3) single-layer mapping to the Homogeneous Multi-core architecture. H3M beats state-of-the-art multi-tenant DNN accelerators, Planaria and Herald, by up to 7.5× and 3.6× in Energy-Delay-Product (EDP) reduction on the ASIC platform. On the Xilinx U200 and U280 FPGA platforms, H3M offers 2.1-5.7× and 1.8-9.0× EDP reduction over Herald.",
"title": "Serving Multi-DNN Workloads on FPGAs: A Coordinated Architecture, Scheduling, and Mapping Perspective",
"normalizedTitle": "Serving Multi-DNN Workloads on FPGAs: A Coordinated Architecture, Scheduling, and Mapping Perspective",
"fno": "09917279",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Application Specific Integrated Circuits",
"Cloud Computing",
"Computer Centres",
"Deep Learning Artificial Intelligence",
"Electronic Engineering Computing",
"Field Programmable Gate Arrays",
"Hardware Accelerators",
"Inference Mechanisms",
"Logic Design",
"Power Aware Computing",
"Scheduling",
"Architecture Design Space With Heterogeneousspatial Multitenantsub Accelerators",
"ASIC Platform",
"Automatic Design Space Exploration Framework",
"Cloud FPG As",
"Coordinated Architecture",
"Current Data Centers",
"Deep Neural Network IN Ference As A Service",
"Dominating Workload",
"Energy Efficiency",
"Energy Delay Product Reduction",
"H 3 M Beats State Of The Art Multitenant DNN Accelerators",
"Hardware Platforms",
"IN Faa S",
"Mapping Perspective",
"Multicore Mapping",
"Multi DNN Scheduling",
"Multi DNN Workloads",
"Multitenant Architecture",
"Paper Proposes H 3 M",
"Single Layer Mapping",
"U 280 FPGA Platforms",
"Computer Architecture",
"Field Programmable Gate Arrays",
"Dynamic Scheduling",
"Optimization",
"Hardware",
"Bandwidth",
"Parallel Processing",
"Multi Tenancy",
"Deep Neural Network",
"Multi Core",
"Accelerator",
"FPGA"
],
"authors": [
{
"givenName": "Shulin",
"surname": "Zeng",
"fullName": "Shulin Zeng",
"affiliation": "Department of Electrical Engineering, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guohao",
"surname": "Dai",
"fullName": "Guohao Dai",
"affiliation": "Qing Yuan Research Institute, Shanghai Jiao Tong University, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Niansong",
"surname": "Zhang",
"fullName": "Niansong Zhang",
"affiliation": "Department of Electrical Engineering, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xinhao",
"surname": "Yang",
"fullName": "Xinhao Yang",
"affiliation": "Department of Electrical Engineering, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haoyu",
"surname": "Zhang",
"fullName": "Haoyu Zhang",
"affiliation": "Department of Electrical Engineering, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhenhua",
"surname": "Zhu",
"fullName": "Zhenhua Zhu",
"affiliation": "Department of Electrical Engineering, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huazhong",
"surname": "Yang",
"fullName": "Huazhong Yang",
"affiliation": "Department of Electrical Engineering, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yu",
"surname": "Wang",
"fullName": "Yu Wang",
"affiliation": "Department of Electrical Engineering, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "05",
"pubDate": "2023-05-01 00:00:00",
"pubType": "trans",
"pages": "1314-1328",
"year": "2023",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/fccm/2017/4037/0/07966671",
"title": "FP-DNN: An Automated Framework for Mapping Deep Neural Networks onto FPGAs with RTL-HLS Hybrid Templates",
"doi": null,
"abstractUrl": "/proceedings-article/fccm/2017/07966671/12OmNASraHc",
"parentPublication": {
"id": "proceedings/fccm/2017/4037/0",
"title": "2017 IEEE 25th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/12/09780577",
"title": "SmartVM: A Smart Contract Virtual Machine for Fast On-Chain DNN Computations",
"doi": null,
"abstractUrl": "/journal/td/2022/12/09780577/1DDyfaUJh4I",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fccm/2019/1131/0/113100a318",
"title": "Model-Extraction Attack Against FPGA-DNN Accelerator Utilizing Correlation Electromagnetic Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/fccm/2019/113100a318/1aPv00CGZDa",
"parentPublication": {
"id": "proceedings/fccm/2019/1131/0",
"title": "2019 IEEE 27th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asap/2019/1601/0/160100a071",
"title": "HelmGemm: Managing GPUs and FPGAs for Transprecision GEMM Workloads in Containerized Environments",
"doi": null,
"abstractUrl": "/proceedings-article/asap/2019/160100a071/1d5kFfjaaDC",
"parentPublication": {
"id": "proceedings/asap/2019/1601/2160-052X",
"title": "2019 IEEE 30th International Conference on Application-specific Systems, Architectures and Processors (ASAP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fpl/2019/4884/0/488400a360",
"title": "TensorFlow to Cloud FPGAs: Tradeoffs for Accelerating Deep Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/fpl/2019/488400a360/1eLy7tZ4LXG",
"parentPublication": {
"id": "proceedings/fpl/2019/4884/0",
"title": "2019 29th International Conference on Field Programmable Logic and Applications (FPL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fpl/2019/4884/0/488400a187",
"title": "Towards an Efficient Accelerator for DNN-Based Remote Sensing Image Segmentation on FPGAs",
"doi": null,
"abstractUrl": "/proceedings-article/fpl/2019/488400a187/1eLya9KOJDG",
"parentPublication": {
"id": "proceedings/fpl/2019/4884/0",
"title": "2019 29th International Conference on Field Programmable Logic and Applications (FPL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "letters/ca/2020/01/08770061",
"title": "Towards Scalable Analytics with Inference-Enabled Solid-State Drives",
"doi": null,
"abstractUrl": "/journal/ca/2020/01/08770061/1iQ0WqSI3ny",
"parentPublication": {
"id": "letters/ca",
"title": "IEEE Computer Architecture Letters",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2020/7445/0/09150409",
"title": "Optimizing OpenCL Kernels and Runtime for DNN Inference on FPGAs",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2020/09150409/1lPGHwOPDS8",
"parentPublication": {
"id": "proceedings/ipdpsw/2020/7445/0",
"title": "2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "letters/ca/2021/01/09293373",
"title": "Flexion: A Quantitative Metric for Flexibility in DNN Accelerators",
"doi": null,
"abstractUrl": "/journal/ca/2021/01/09293373/1qdT701jtAs",
"parentPublication": {
"id": "letters/ca",
"title": "IEEE Computer Architecture Letters",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/11/09623507",
"title": "Elastic Significant Bit Quantization and Acceleration for Deep Neural Networks",
"doi": null,
"abstractUrl": "/journal/td/2022/11/09623507/1yJTzJJNbos",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09854159",
"articleId": "1FJ0TSDi8Fi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09896131",
"articleId": "1GP3Lfa9LLG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1M80KwypN1C",
"name": "ttc202305-09917279s1-supp1-3214113.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttc202305-09917279s1-supp1-3214113.pdf",
"extension": "pdf",
"size": "58.3 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwCsdFw",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tk",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1IiLdUwEK7m",
"doi": "10.1109/TKDE.2022.3221989",
"abstract": "Multivariate time series forecasting has long received significant attention in real-world applications, such as energy consumption and traffic prediction. While recent methods demonstrate good forecasting abilities, they have three fundamental limitations. (i). <italic>Discrete neural architectures</italic>: Interlacing individually parameterized spatial and temporal blocks to encode rich underlying patterns leads to discontinuous latent state trajectories and higher forecasting numerical errors. (ii). <italic>High complexity</italic>: Discrete approaches complicate models with dedicated designs and redundant parameters, leading to higher computational and memory overheads. (iii). <italic>Reliance on graph priors</italic>: Relying on predefined static graph structures limits their effectiveness and practicability in real-world applications. In this paper, we address all the above limitations by proposing a continuous model to forecast <underline><bold>M</bold></underline>ultivariate <underline><bold>T</bold></underline>ime series with dynamic <underline><bold>G</bold></underline>raph neural <underline><bold>O</bold></underline>rdinary <underline><bold>D</bold></underline>ifferential <underline><bold>E</bold></underline>quations (<monospace>MTGODE</monospace>). Specifically, we first abstract multivariate time series into dynamic graphs with time-evolving node features and unknown graph structures. Then, we design and solve a neural ODE to complement missing graph topologies and unify both spatial and temporal message passing, allowing deeper graph propagation and fine-grained temporal information aggregation to characterize stable and precise latent spatial-temporal dynamics. Our experiments demonstrate the superiorities of <monospace>MTGODE</monospace> from various perspectives on five time series benchmark datasets",
"abstracts": [
{
"abstractType": "Regular",
"content": "Multivariate time series forecasting has long received significant attention in real-world applications, such as energy consumption and traffic prediction. While recent methods demonstrate good forecasting abilities, they have three fundamental limitations. (i). <italic>Discrete neural architectures</italic>: Interlacing individually parameterized spatial and temporal blocks to encode rich underlying patterns leads to discontinuous latent state trajectories and higher forecasting numerical errors. (ii). <italic>High complexity</italic>: Discrete approaches complicate models with dedicated designs and redundant parameters, leading to higher computational and memory overheads. (iii). <italic>Reliance on graph priors</italic>: Relying on predefined static graph structures limits their effectiveness and practicability in real-world applications. In this paper, we address all the above limitations by proposing a continuous model to forecast <underline><bold>M</bold></underline>ultivariate <underline><bold>T</bold></underline>ime series with dynamic <underline><bold>G</bold></underline>raph neural <underline><bold>O</bold></underline>rdinary <underline><bold>D</bold></underline>ifferential <underline><bold>E</bold></underline>quations (<monospace>MTGODE</monospace>). Specifically, we first abstract multivariate time series into dynamic graphs with time-evolving node features and unknown graph structures. Then, we design and solve a neural ODE to complement missing graph topologies and unify both spatial and temporal message passing, allowing deeper graph propagation and fine-grained temporal information aggregation to characterize stable and precise latent spatial-temporal dynamics. Our experiments demonstrate the superiorities of <monospace>MTGODE</monospace> from various perspectives on five time series benchmark datasets",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Multivariate time series forecasting has long received significant attention in real-world applications, such as energy consumption and traffic prediction. While recent methods demonstrate good forecasting abilities, they have three fundamental limitations. (i). Discrete neural architectures: Interlacing individually parameterized spatial and temporal blocks to encode rich underlying patterns leads to discontinuous latent state trajectories and higher forecasting numerical errors. (ii). High complexity: Discrete approaches complicate models with dedicated designs and redundant parameters, leading to higher computational and memory overheads. (iii). Reliance on graph priors: Relying on predefined static graph structures limits their effectiveness and practicability in real-world applications. In this paper, we address all the above limitations by proposing a continuous model to forecast Multivariate Time series with dynamic Graph neural Ordinary Differential Equations (MTGODE). Specifically, we first abstract multivariate time series into dynamic graphs with time-evolving node features and unknown graph structures. Then, we design and solve a neural ODE to complement missing graph topologies and unify both spatial and temporal message passing, allowing deeper graph propagation and fine-grained temporal information aggregation to characterize stable and precise latent spatial-temporal dynamics. Our experiments demonstrate the superiorities of MTGODE from various perspectives on five time series benchmark datasets",
"title": "Multivariate Time Series Forecasting with Dynamic Graph Neural ODEs",
"normalizedTitle": "Multivariate Time Series Forecasting with Dynamic Graph Neural ODEs",
"fno": "09950330",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Time Series Analysis",
"Forecasting",
"Predictive Models",
"Trajectory",
"Computational Modeling",
"Mathematical Models",
"Electronic Mail",
"Multivariate Time Series Forecasting",
"Graph Neural Networks",
"Neural Ordinary Differential Equations"
],
"authors": [
{
"givenName": "Ming",
"surname": "Jin",
"fullName": "Ming Jin",
"affiliation": "Department of Data Science and AI, Faculty of IT, Monash University, Clayton, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yu",
"surname": "Zheng",
"fullName": "Yu Zheng",
"affiliation": "Department of Computer Science and Information Technology, La Trobe University, Melbourne, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuan-Fang",
"surname": "Li",
"fullName": "Yuan-Fang Li",
"affiliation": "Department of Data Science and AI, Faculty of IT, Monash University, Clayton, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Siheng",
"surname": "Chen",
"fullName": "Siheng Chen",
"affiliation": "Shanghai Jiao Tong University, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bin",
"surname": "Yang",
"fullName": "Bin Yang",
"affiliation": "School of Data Science and Engineering, East China Normal University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shirui",
"surname": "Pan",
"fullName": "Shirui Pan",
"affiliation": "School of Information and Communication Technology, Griffith University, Southport, Australia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-11-01 00:00:00",
"pubType": "trans",
"pages": "1-14",
"year": "5555",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tk/5555/01/09802746",
"title": "Explicit Message-Passing Heterogeneous Graph Neural Network",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09802746/1Eo1tvOKn0k",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2023/05/09854159",
"title": "DMACN: A Dynamic Multi-Attribute Caching Mechanism for NDN-Based Remote Health Monitoring System",
"doi": null,
"abstractUrl": "/journal/tc/2023/05/09854159/1FJ0TSDi8Fi",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09947331",
"title": "Aspect-guided Syntax Graph Learning for Explainable Recommendation",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09947331/1IiLdisq7yU",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09950609",
"title": "Spectral Adversarial Training for Robust Graph Neural Network",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09950609/1Ik4HsmA7mg",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/5555/01/10035508",
"title": "Two-Stream Graph Convolutional Network-Incorporated Latent Feature Analysis",
"doi": null,
"abstractUrl": "/journal/sc/5555/01/10035508/1Krc3XGuhb2",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10105527",
"title": "Multi-Scale Adaptive Graph Neural Network for Multivariate Time Series Forecasting",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10105527/1MtgpjufAOc",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/09/09261122",
"title": "TTPNet: A Neural Network for Travel Time Prediction Based on Tensor Decomposition and Graph Embedding",
"doi": null,
"abstractUrl": "/journal/tk/2022/09/09261122/1oNViFjurPq",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2022/10/09355028",
"title": "Fingerprinting Movements of Industrial Robots for Replay Attack Detection",
"doi": null,
"abstractUrl": "/journal/tm/2022/10/09355028/1rgCemQuqDm",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/02/09361263",
"title": "<monospace><bold>PINE</bold></monospace>: Universal Deep Embedding for Graph Nodes via Partial Permutation Invariant Set Functions",
"doi": null,
"abstractUrl": "/journal/tp/2022/02/09361263/1rsexdBagFO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/09/09416768",
"title": "Pay Attention to Evolution: Time Series Forecasting With Deep Graph-Evolution Learning",
"doi": null,
"abstractUrl": "/journal/tp/2022/09/09416768/1t8VSzT9Cj6",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09950351",
"articleId": "1IiLdId5MdO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09950699",
"articleId": "1Ik4FvKLqIE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1IlJzP7g10I",
"name": "ttk555501-09950330s1-supp1-3221989.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttk555501-09950330s1-supp1-3221989.pdf",
"extension": "pdf",
"size": "149 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1CdACzpvTPi",
"title": "May",
"year": "2022",
"issueNum": "05",
"idPrefix": "tk",
"pubType": "journal",
"volume": "34",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1lDZZfCXDB6",
"doi": "10.1109/TKDE.2020.3010949",
"abstract": "Many studies focusing on integrating reviews with ratings to improve recommendation performance have been quite successful. However, these works still face several shortcomings: (1) The importance of dynamically integrating review and interaction data features is typically ignored, yet treating these fusion features equally may lead to an incomplete understanding of user preferences. (2) Some forms of soft attention methods are adopted to model the local semantic information of words. As features thus captured may contain irrelevant information, the generated attention map is neither discriminatory nor detailed. In this paper, we propose a novel <italic/><bold>A</bold><italic>daptive</italic> <bold>H</bold><italic>ierarchical</italic> <bold>A</bold><italic>ttention-enhanced</italic> <bold>G</bold><italic>ated network integrating reviews for item recommendation</italic>, named AHAG. AHAG is a unified framework to capture the hidden intentions of users by adaptively incorporating reviews. Specifically, we design a gated network to dynamically fuse the extracted features and select the features that are most relevant to user preferences. To capture distinguishing fine-grained features, we introduce a hierarchical attention mechanism to learn important semantic information features and the dynamic interaction of these features. Besides, the high-order non-linear interaction of neural factorization machines is utilized to derive the rating prediction. Experiments on seven real-world datasets show that the proposed AHAG significantly outperforms state-of-the-art methods. Furthermore, the attention mechanism can highlight the relevant information in reviews to increase the interpretability of the recommendation task. Source codes are available in <uri>https://github.com/luojia527/AHAG</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Many studies focusing on integrating reviews with ratings to improve recommendation performance have been quite successful. However, these works still face several shortcomings: (1) The importance of dynamically integrating review and interaction data features is typically ignored, yet treating these fusion features equally may lead to an incomplete understanding of user preferences. (2) Some forms of soft attention methods are adopted to model the local semantic information of words. As features thus captured may contain irrelevant information, the generated attention map is neither discriminatory nor detailed. In this paper, we propose a novel <italic/><bold>A</bold><italic>daptive</italic> <bold>H</bold><italic>ierarchical</italic> <bold>A</bold><italic>ttention-enhanced</italic> <bold>G</bold><italic>ated network integrating reviews for item recommendation</italic>, named AHAG. AHAG is a unified framework to capture the hidden intentions of users by adaptively incorporating reviews. Specifically, we design a gated network to dynamically fuse the extracted features and select the features that are most relevant to user preferences. To capture distinguishing fine-grained features, we introduce a hierarchical attention mechanism to learn important semantic information features and the dynamic interaction of these features. Besides, the high-order non-linear interaction of neural factorization machines is utilized to derive the rating prediction. Experiments on seven real-world datasets show that the proposed AHAG significantly outperforms state-of-the-art methods. Furthermore, the attention mechanism can highlight the relevant information in reviews to increase the interpretability of the recommendation task. Source codes are available in <uri>https://github.com/luojia527/AHAG</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Many studies focusing on integrating reviews with ratings to improve recommendation performance have been quite successful. However, these works still face several shortcomings: (1) The importance of dynamically integrating review and interaction data features is typically ignored, yet treating these fusion features equally may lead to an incomplete understanding of user preferences. (2) Some forms of soft attention methods are adopted to model the local semantic information of words. As features thus captured may contain irrelevant information, the generated attention map is neither discriminatory nor detailed. In this paper, we propose a novel Adaptive Hierarchical Attention-enhanced Gated network integrating reviews for item recommendation, named AHAG. AHAG is a unified framework to capture the hidden intentions of users by adaptively incorporating reviews. Specifically, we design a gated network to dynamically fuse the extracted features and select the features that are most relevant to user preferences. To capture distinguishing fine-grained features, we introduce a hierarchical attention mechanism to learn important semantic information features and the dynamic interaction of these features. Besides, the high-order non-linear interaction of neural factorization machines is utilized to derive the rating prediction. Experiments on seven real-world datasets show that the proposed AHAG significantly outperforms state-of-the-art methods. Furthermore, the attention mechanism can highlight the relevant information in reviews to increase the interpretability of the recommendation task. Source codes are available in https://github.com/luojia527/AHAG.",
"title": "Adaptive Hierarchical Attention-Enhanced Gated Network Integrating Reviews for Item Recommendation",
"normalizedTitle": "Adaptive Hierarchical Attention-Enhanced Gated Network Integrating Reviews for Item Recommendation",
"fno": "09145860",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Data Mining",
"Feature Extraction",
"Learning Artificial Intelligence",
"Recommender Systems",
"Text Analysis",
"Dynamic Interaction",
"High Order Nonlinear Interaction",
"AHAG",
"Recommendation Task",
"Adaptive Hierarchical Attention Enhanced Gated Network Integrating Reviews",
"Item Recommendation",
"Integrating Review",
"Interaction Data Features",
"Fusion Features",
"User Preferences",
"Soft Attention Methods",
"Irrelevant Information",
"Generated Attention Map",
"Novel Adaptive Hierarchical Attention Enhanced Gated Network",
"Distinguishing Fine Grained Features",
"Hierarchical Attention Mechanism",
"Important Semantic Information Features",
"Logic Gates",
"Semantics",
"Feature Extraction",
"Fuses",
"Adaptation Models",
"Predictive Models",
"Neural Networks",
"Recommender Systems",
"Gated Network",
"Attention Mechanism",
"Semantic Information",
"Neural Factorization Machines"
],
"authors": [
{
"givenName": "Donghua",
"surname": "Liu",
"fullName": "Donghua Liu",
"affiliation": "National Engineering Research Center for Multimedia Software, School of Computer Science, and Institute of Artificial Intelligence, Wuhan University, Wuhuan, Hubei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jia",
"surname": "Wu",
"fullName": "Jia Wu",
"affiliation": "Department of Computing, Faculty of Science and Engineering, Macquarie University, Sydney, NSW, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jing",
"surname": "Li",
"fullName": "Jing Li",
"affiliation": "National Engineering Research Center for Multimedia Software, School of Computer Science, and Institute of Artificial Intelligence, Wuhan University, Wuhuan, Hubei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bo",
"surname": "Du",
"fullName": "Bo Du",
"affiliation": "National Engineering Research Center for Multimedia Software, School of Computer Science, and Institute of Artificial Intelligence, Wuhan University, Wuhuan, Hubei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jun",
"surname": "Chang",
"fullName": "Jun Chang",
"affiliation": "School of Computer Science, Wuhan University, Wuhuan, Hubei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xuefei",
"surname": "Li",
"fullName": "Xuefei Li",
"affiliation": "School of Computer Science, Wuhan University, Wuhuan, Hubei, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2022-05-01 00:00:00",
"pubType": "trans",
"pages": "2076-2090",
"year": "2022",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tk/2023/05/09695275",
"title": "Joint Reason Generation and Rating Prediction for Explainable Recommendation",
"doi": null,
"abstractUrl": "/journal/tk/2023/05/09695275/1AvqGUeSJDG",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09906903",
"title": "SliceTeller: A Data Slice-Driven Approach for Machine Learning Model Validation",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09906903/1H5EOffqPqE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09950330",
"title": "Multivariate Time Series Forecasting with Dynamic Graph Neural ODEs",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09950330/1IiLdUwEK7m",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10016684",
"title": "Fast Multi-view Clustering via Ensembles: Towards Scalability, Superiority, and Simplicity",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10016684/1JTZXlhcnug",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2020/1331/0/09102758",
"title": "PA-GGAN: Session-Based Recommendation with Position-Aware Gated Graph Attention Network",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2020/09102758/1kwr28jIEU0",
"parentPublication": {
"id": "proceedings/icme/2020/1331/0",
"title": "2020 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2020/05/09130085",
"title": "HIGnet: Hierarchical and Interactive Gate Networks for Item Recommendation",
"doi": null,
"abstractUrl": "/magazine/ex/2020/05/09130085/1l59niV38Tm",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/06/09170855",
"title": "Social Recommendation With Characterized Regularization",
"doi": null,
"abstractUrl": "/journal/tk/2022/06/09170855/1motfVuBP1u",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/06/09171850",
"title": "Item Recommendation for Word-of-Mouth Scenario in Social E-Commerce",
"doi": null,
"abstractUrl": "/journal/tk/2022/06/09171850/1mrN2Bcepgc",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/02/09492753",
"title": "Cross-Platform Item Recommendation for Online Social E-Commerce",
"doi": null,
"abstractUrl": "/journal/tk/2023/02/09492753/1vq0EJT4moE",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900h798",
"title": "Gated Spatio-Temporal Attention-Guided Video Deblurring",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900h798/1yeIWGEQqek",
"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": "09157914",
"articleId": "1m1eB0gblw4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09122440",
"articleId": "1kRRvncJNao",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1CY3CBTnmHC",
"title": "June",
"year": "2022",
"issueNum": "06",
"idPrefix": "tk",
"pubType": "journal",
"volume": "34",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1mrN2Bcepgc",
"doi": "10.1109/TKDE.2020.3017509",
"abstract": "Social commerce, which is different from traditional e-commerce where people purchase products via initiative searching or recommendations from the platform, transforms a social community into an inclusive place to do business by enabling people to share products with their friends. A user (<italic>sharer</italic>), can share a link of a product to their social-connected friends (<italic>receiver</italic>). Once a receiver purchases the product, the sharer can earn commission provided by the platform. To promote sales, the platform can also assist sharers by providing product candidates which are more likely to be purchased during the social sharing. We define this task of generating sharing suggestions as item recommendation for word-of-mouth scenario, and to the best of our knowledge, this is a new task that has never been explored. In this article, we propose a <italic>TriM</italic> (short for <bold>Tri</bold>ad based word-of-<bold>M</bold>outh recommendation) model that can capture both the sharer’s influence and the receiver’s interest at the same time, which are two significant factors that determine whether the receiver will buy the product or not. Furthermore, with joint learning on two parts of interaction data to address data sparsity issue, our proposed TriM-Joint further improves the recommendation performance. By conducting experiments, we show that our proposed models achieve the best results compared to state-of-the-art models with significant improvements by at least <inline-formula><tex-math notation=\"LaTeX\">Z_$7.4\\% \\sim 14.4\\%$_Z</tex-math></inline-formula> respectively.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Social commerce, which is different from traditional e-commerce where people purchase products via initiative searching or recommendations from the platform, transforms a social community into an inclusive place to do business by enabling people to share products with their friends. A user (<italic>sharer</italic>), can share a link of a product to their social-connected friends (<italic>receiver</italic>). Once a receiver purchases the product, the sharer can earn commission provided by the platform. To promote sales, the platform can also assist sharers by providing product candidates which are more likely to be purchased during the social sharing. We define this task of generating sharing suggestions as item recommendation for word-of-mouth scenario, and to the best of our knowledge, this is a new task that has never been explored. In this article, we propose a <italic>TriM</italic> (short for <bold>Tri</bold>ad based word-of-<bold>M</bold>outh recommendation) model that can capture both the sharer’s influence and the receiver’s interest at the same time, which are two significant factors that determine whether the receiver will buy the product or not. Furthermore, with joint learning on two parts of interaction data to address data sparsity issue, our proposed TriM-Joint further improves the recommendation performance. By conducting experiments, we show that our proposed models achieve the best results compared to state-of-the-art models with significant improvements by at least <inline-formula><tex-math notation=\"LaTeX\">$7.4\\% \\sim 14.4\\%$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>7</mml:mn><mml:mo>.</mml:mo><mml:mn>4</mml:mn><mml:mo>%</mml:mo><mml:mo>∼</mml:mo><mml:mn>14</mml:mn><mml:mo>.</mml:mo><mml:mn>4</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"li-ieq1-3017509.gif\"/></alternatives></inline-formula> respectively.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Social commerce, which is different from traditional e-commerce where people purchase products via initiative searching or recommendations from the platform, transforms a social community into an inclusive place to do business by enabling people to share products with their friends. A user (sharer), can share a link of a product to their social-connected friends (receiver). Once a receiver purchases the product, the sharer can earn commission provided by the platform. To promote sales, the platform can also assist sharers by providing product candidates which are more likely to be purchased during the social sharing. We define this task of generating sharing suggestions as item recommendation for word-of-mouth scenario, and to the best of our knowledge, this is a new task that has never been explored. In this article, we propose a TriM (short for Triad based word-of-Mouth recommendation) model that can capture both the sharer’s influence and the receiver’s interest at the same time, which are two significant factors that determine whether the receiver will buy the product or not. Furthermore, with joint learning on two parts of interaction data to address data sparsity issue, our proposed TriM-Joint further improves the recommendation performance. By conducting experiments, we show that our proposed models achieve the best results compared to state-of-the-art models with significant improvements by at least - respectively.",
"title": "Item Recommendation for Word-of-Mouth Scenario in Social E-Commerce",
"normalizedTitle": "Item Recommendation for Word-of-Mouth Scenario in Social E-Commerce",
"fno": "09171850",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Consumer Behaviour",
"Data Handling",
"Electronic Commerce",
"Learning Artificial Intelligence",
"Recommender Systems",
"Social Networking Online",
"Item Recommendation",
"Word Of Mouth Scenario",
"Social E Commerce",
"Social Community",
"Social Connected Friends",
"Product Candidates",
"Social Sharing",
"Triad Based Word Of Mouth Recommendation",
"Tri M",
"Interaction Data",
"Data Sparsity",
"Joint Learning",
"Receivers",
"Social Networking Online",
"Task Analysis",
"Mouth",
"Analytical Models",
"Data Models",
"Recommender Systems",
"Word Of Mouth",
"Social E Commerce"
],
"authors": [
{
"givenName": "Chen",
"surname": "Gao",
"fullName": "Chen Gao",
"affiliation": "Department of Electronic Engineering, Beijing National Research Center for Information Science and Technology, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chao",
"surname": "Huang",
"fullName": "Chao Huang",
"affiliation": "Department of Electronic Engineering, Beijing National Research Center for Information Science and Technology, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Donghan",
"surname": "Yu",
"fullName": "Donghan Yu",
"affiliation": "Department of Electronic Engineering, Beijing National Research Center for Information Science and Technology, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haohao",
"surname": "Fu",
"fullName": "Haohao Fu",
"affiliation": "College of Letters and Science, UC Berkeley, Berkeley, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tzh-Heng",
"surname": "Lin",
"fullName": "Tzh-Heng Lin",
"affiliation": "Department of Electronic Engineering, Beijing National Research Center for Information Science and Technology, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Depeng",
"surname": "Jin",
"fullName": "Depeng Jin",
"affiliation": "Department of Electronic Engineering, Beijing National Research Center for Information Science and Technology, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yong",
"surname": "Li",
"fullName": "Yong Li",
"affiliation": "Department of Electronic Engineering, Beijing National Research Center for Information Science and Technology, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2022-06-01 00:00:00",
"pubType": "trans",
"pages": "2798-2809",
"year": "2022",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tk/2023/06/09774007",
"title": "Graph Stream Sketch: Summarizing Graph Streams With High Speed and Accuracy",
"doi": null,
"abstractUrl": "/journal/tk/2023/06/09774007/1DjDnjq9sGI",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/12/09887909",
"title": "TDFL: Truth Discovery Based Byzantine Robust Federated Learning",
"doi": null,
"abstractUrl": "/journal/td/2022/12/09887909/1GBRpr0IWS4",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__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/td/2023/03/10018536",
"title": "FedMDS: An Efficient Model Discrepancy-Aware Semi-Asynchronous Clustered Federated Learning Framework",
"doi": null,
"abstractUrl": "/journal/td/2023/03/10018536/1K0DHUawdkk",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/09/09271901",
"title": "Modelling High-Order Social Relations for Item Recommendation",
"doi": null,
"abstractUrl": "/journal/tk/2022/09/09271901/1p2RcFfs5TG",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/02/09477110",
"title": "LuxGeo: Efficient and Security-Enhanced Geometric Range Queries",
"doi": null,
"abstractUrl": "/journal/tk/2023/02/09477110/1v2M0gZ7HMs",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/02/09492753",
"title": "Cross-Platform Item Recommendation for Online Social E-Commerce",
"doi": null,
"abstractUrl": "/journal/tk/2023/02/09492753/1vq0EJT4moE",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/05/09516878",
"title": "Workload Balancing via Graph Reordering on Multicore Systems",
"doi": null,
"abstractUrl": "/journal/td/2022/05/09516878/1watZSFykhi",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/11/09565383",
"title": "GCP: Graph Encoder With Content-Planning for Sentence Generation From Knowledge Bases",
"doi": null,
"abstractUrl": "/journal/tp/2022/11/09565383/1xx86H3k5Gg",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/11/09647969",
"title": "Flexible Clustered Federated Learning for Client-Level Data Distribution Shift",
"doi": null,
"abstractUrl": "/journal/td/2022/11/09647969/1ziKk2OmMkU",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09158364",
"articleId": "1m1eC2EztZu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09160895",
"articleId": "1m4yzbKri1i",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNylsZGl",
"title": "Feb.",
"year": "2015",
"issueNum": "02",
"idPrefix": "td",
"pubType": "journal",
"volume": "26",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxC0SE1",
"doi": "10.1109/TPDS.2014.2308205",
"abstract": "With widespread usages of smart phones, participatory sensing becomes mainstream, especially for applications requiring pervasive deployments with massive sensors. However, the sensors on smart phones are prone to the unknown measurement errors, requiring automatic calibration among uncooperative participants. Current methods need either collaboration or explicit calibration process. However, due to the uncooperative and uncontrollable nature of the participants, these methods fail to calibrate sensor nodes effectively. We investigate sensor calibration in monitoring pollution sources, without explicit calibration process in uncooperative environment. We leverage the opportunity in sensing diversity, where a participant will sense multiple pollution sources when roaming in the area. Further, inspired by expectation maximization (EM) method, we propose a two-level iterative algorithm to estimate the source presences, source parameters and sensor noise iteratively. The key insight is that, only based on the participatory observations, we can “calibrate sensors without explicit or cooperative calibrating process”. Theoretical analysis proves that, our method can converge to the optimal estimation of sensor noise, where the likelihood of observations is maximized. Also, extensive simulations show that, ours improves the estimation accuracy of sensor bias up to 20 percent and that of sensor noise deviation up to 30 percent, compared with three baseline methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "With widespread usages of smart phones, participatory sensing becomes mainstream, especially for applications requiring pervasive deployments with massive sensors. However, the sensors on smart phones are prone to the unknown measurement errors, requiring automatic calibration among uncooperative participants. Current methods need either collaboration or explicit calibration process. However, due to the uncooperative and uncontrollable nature of the participants, these methods fail to calibrate sensor nodes effectively. We investigate sensor calibration in monitoring pollution sources, without explicit calibration process in uncooperative environment. We leverage the opportunity in sensing diversity, where a participant will sense multiple pollution sources when roaming in the area. Further, inspired by expectation maximization (EM) method, we propose a two-level iterative algorithm to estimate the source presences, source parameters and sensor noise iteratively. The key insight is that, only based on the participatory observations, we can “calibrate sensors without explicit or cooperative calibrating process”. Theoretical analysis proves that, our method can converge to the optimal estimation of sensor noise, where the likelihood of observations is maximized. Also, extensive simulations show that, ours improves the estimation accuracy of sensor bias up to 20 percent and that of sensor noise deviation up to 30 percent, compared with three baseline methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "With widespread usages of smart phones, participatory sensing becomes mainstream, especially for applications requiring pervasive deployments with massive sensors. However, the sensors on smart phones are prone to the unknown measurement errors, requiring automatic calibration among uncooperative participants. Current methods need either collaboration or explicit calibration process. However, due to the uncooperative and uncontrollable nature of the participants, these methods fail to calibrate sensor nodes effectively. We investigate sensor calibration in monitoring pollution sources, without explicit calibration process in uncooperative environment. We leverage the opportunity in sensing diversity, where a participant will sense multiple pollution sources when roaming in the area. Further, inspired by expectation maximization (EM) method, we propose a two-level iterative algorithm to estimate the source presences, source parameters and sensor noise iteratively. The key insight is that, only based on the participatory observations, we can “calibrate sensors without explicit or cooperative calibrating process”. Theoretical analysis proves that, our method can converge to the optimal estimation of sensor noise, where the likelihood of observations is maximized. Also, extensive simulations show that, ours improves the estimation accuracy of sensor bias up to 20 percent and that of sensor noise deviation up to 30 percent, compared with three baseline methods.",
"title": "Calibrate without Calibrating: An Iterative Approach in Participatory Sensing Network",
"normalizedTitle": "Calibrate without Calibrating: An Iterative Approach in Participatory Sensing Network",
"fno": "06762992",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Noise",
"Pollution",
"Estimation",
"Pollution Measurement",
"Calibration",
"Intelligent Sensors",
"Expectation Maximization EM Method",
"Participatory Sensing",
"Sensor Calibration"
],
"authors": [
{
"givenName": "Chaocan",
"surname": "Xiang",
"fullName": "Chaocan Xiang",
"affiliation": "College of Communications Engineering, PLA University of Science and Technology, Box 110, 2 Biaoying, Yudao Street, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Panlong",
"surname": "Yang",
"fullName": "Panlong Yang",
"affiliation": "College of Communications Engineering, PLA University of Science and Technology, Box 110, 2 Biaoying, Yudao Street, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chang",
"surname": "Tian",
"fullName": "Chang Tian",
"affiliation": "College of Communications Engineering, PLA University of Science and Technology, Box 110, 2 Biaoying, Yudao Street, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haibin",
"surname": "Cai",
"fullName": "Haibin Cai",
"affiliation": "Software Engineering Institute , East China Normal University, No. 3663, North Zhongshan Road, Putuo District, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yunhao",
"surname": "Liu",
"fullName": "Yunhao Liu",
"affiliation": "MOE Key Lab for Information System Security, School of Software, Tsinghua University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2015-02-01 00:00:00",
"pubType": "trans",
"pages": "351-361",
"year": "2015",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/msn/2013/5159/0/06726333",
"title": "Feeling Sensors' Pulse: Accurate Noise Quantification in Participatory Sensing Network",
"doi": null,
"abstractUrl": "/proceedings-article/msn/2013/06726333/12OmNBOlloY",
"parentPublication": {
"id": "proceedings/msn/2013/5159/0",
"title": "2013 Ninth International Conference on Mobile Ad-hoc and Sensor Networks (MSN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/chase/2017/4722/0/4722a300",
"title": "Characterizing and Calibrating Low-Cost Wearable Ozone Sensors in Dynamic Environments",
"doi": null,
"abstractUrl": "/proceedings-article/chase/2017/4722a300/12OmNqC2uW4",
"parentPublication": {
"id": "proceedings/chase/2017/4722/0",
"title": "2017 IEEE/ACM International Conference on Connected Health: Applications, Systems and Engineering Technologies (CHASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mass/2013/3408/0/5104a431",
"title": "An Iterative Method of Sensor Calibration in Participatory Sensing Network",
"doi": null,
"abstractUrl": "/proceedings-article/mass/2013/5104a431/12OmNqJHFAx",
"parentPublication": {
"id": "proceedings/mass/2013/3408/0",
"title": "2013 IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems (MASS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mass/2017/2324/0/2324a435",
"title": "Opportunistic Multiparty Calibration for Robust Participatory Sensing",
"doi": null,
"abstractUrl": "/proceedings-article/mass/2017/2324a435/12OmNvqW6Wj",
"parentPublication": {
"id": "proceedings/mass/2017/2324/0",
"title": "2017 IEEE 14th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percomw/2014/2736/0/06815208",
"title": "Citizen-friendly participatory campaign support",
"doi": null,
"abstractUrl": "/proceedings-article/percomw/2014/06815208/12OmNwcUjTw",
"parentPublication": {
"id": "proceedings/percomw/2014/2736/0",
"title": "2014 IEEE International Conference on Pervasive Computing and Communication Workshops (PERCOM WORKSHOPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percomw/2013/5075/0/06529500",
"title": "ExposureSense: Integrating daily activities with air quality using mobile participatory sensing",
"doi": null,
"abstractUrl": "/proceedings-article/percomw/2013/06529500/12OmNx7G66J",
"parentPublication": {
"id": "proceedings/percomw/2013/5075/0",
"title": "2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lcn-workshops/2014/3784/0/06927732",
"title": "Classification of participatory sensing privacy schemes",
"doi": null,
"abstractUrl": "/proceedings-article/lcn-workshops/2014/06927732/12OmNxGAL1e",
"parentPublication": {
"id": "proceedings/lcn-workshops/2014/3784/0",
"title": "2014 IEEE 39th Conference on Local Computer Networks Workshops (LCN Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoip/2010/4252/1/4252a526",
"title": "Experimental Analysis on Sound Sources of Calibrating Acoustic Emission Sensitivity",
"doi": null,
"abstractUrl": "/proceedings-article/icoip/2010/4252a526/12OmNzt0IxM",
"parentPublication": {
"id": "proceedings/icoip/2010/4252/2",
"title": "Optoelectronics and Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2018/01/07913667",
"title": "MPiLoc: Self-Calibrating Multi-Floor Indoor Localization Exploiting Participatory Sensing",
"doi": null,
"abstractUrl": "/journal/tm/2018/01/07913667/13rRUxjQycy",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2021/4899/0/489900b403",
"title": "How to Calibrate Your Event Camera",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2021/489900b403/1yVzO1GLBXq",
"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": "06762988",
"articleId": "13rRUyeTVhM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06748070",
"articleId": "13rRUNvgz3T",
"__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": "1L8lOmJUaeA",
"doi": "10.1109/TMC.2023.3250508",
"abstract": "The widespread applications of the Hybrid Internet of Things (HIoT) have put forward higher requirements for network reliability. Coverage reliability is one of the important metrics of reliability, and reliable coverage ensures network data perception and transmission to improve the Quality of Service (QoS). In this paper, we define Confident Information Coverage Reliability (<italic>CICR</italic>) based on the Confident Information Coverage Model (CIC), which comprehensively considers sensor multistate, sensor energy, coverage rate, and connectivity robustness to evaluate coverage reliability. Furthermore, a Tensor-based Confident Information Coverage Reliability Algorithm (T-CICR) is proposed based on tensor modeling to evaluate <italic>CICR</italic>. The algorithm uses a tensor-based Markov model to predict sensor multistate. Three tensors of coverage rate, sensor multistate, and sensor energy are constructed to provide unified representations. Simulation results show that our proposed algorithm can significantly improve coverage reliability in terms of duty cycle, coverage rate requirement, sensing range, Root Mean Square Error (RMSE) threshold, connectivity robustness requirement, and link reliability.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The widespread applications of the Hybrid Internet of Things (HIoT) have put forward higher requirements for network reliability. Coverage reliability is one of the important metrics of reliability, and reliable coverage ensures network data perception and transmission to improve the Quality of Service (QoS). In this paper, we define Confident Information Coverage Reliability (<italic>CICR</italic>) based on the Confident Information Coverage Model (CIC), which comprehensively considers sensor multistate, sensor energy, coverage rate, and connectivity robustness to evaluate coverage reliability. Furthermore, a Tensor-based Confident Information Coverage Reliability Algorithm (T-CICR) is proposed based on tensor modeling to evaluate <italic>CICR</italic>. The algorithm uses a tensor-based Markov model to predict sensor multistate. Three tensors of coverage rate, sensor multistate, and sensor energy are constructed to provide unified representations. Simulation results show that our proposed algorithm can significantly improve coverage reliability in terms of duty cycle, coverage rate requirement, sensing range, Root Mean Square Error (RMSE) threshold, connectivity robustness requirement, and link reliability.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The widespread applications of the Hybrid Internet of Things (HIoT) have put forward higher requirements for network reliability. Coverage reliability is one of the important metrics of reliability, and reliable coverage ensures network data perception and transmission to improve the Quality of Service (QoS). In this paper, we define Confident Information Coverage Reliability (CICR) based on the Confident Information Coverage Model (CIC), which comprehensively considers sensor multistate, sensor energy, coverage rate, and connectivity robustness to evaluate coverage reliability. Furthermore, a Tensor-based Confident Information Coverage Reliability Algorithm (T-CICR) is proposed based on tensor modeling to evaluate CICR. The algorithm uses a tensor-based Markov model to predict sensor multistate. Three tensors of coverage rate, sensor multistate, and sensor energy are constructed to provide unified representations. Simulation results show that our proposed algorithm can significantly improve coverage reliability in terms of duty cycle, coverage rate requirement, sensing range, Root Mean Square Error (RMSE) threshold, connectivity robustness requirement, and link reliability.",
"title": "Tensor-based Confident Information Coverage Reliability of Hybrid Internet of Things",
"normalizedTitle": "Tensor-based Confident Information Coverage Reliability of Hybrid Internet of Things",
"fno": "10056361",
"hasPdf": true,
"idPrefix": "tm",
"keywords": [
"Reliability",
"Predictive Models",
"Tensors",
"Correlation",
"Sensors",
"Monitoring",
"Robustness",
"Hybrid Internet Of Things H Io T",
"Coverage Reliability",
"Confident Information Coverage Model CIC",
"Connectivity Robustness",
"Tensor"
],
"authors": [
{
"givenName": "Xiaoxuan",
"surname": "Fan",
"fullName": "Xiaoxuan Fan",
"affiliation": "Hubei Key Laboratory of Distributed System Security, Hubei Engineering Research Center on Big Data Security, School of Cyber Science and Engineering, Huazhong University of Science and Technology, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xianjun",
"surname": "Deng",
"fullName": "Xianjun Deng",
"affiliation": "Hubei Key Laboratory of Distributed System Security, Hubei Engineering Research Center on Big Data Security, School of Cyber Science and Engineering, Huazhong University of Science and Technology, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yunzhi",
"surname": "Xia",
"fullName": "Yunzhi Xia",
"affiliation": "Hubei Key Laboratory of Distributed System Security, Hubei Engineering Research Center on Big Data Security, School of Cyber Science and Engineering, Huazhong University of Science and Technology, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lingzhi",
"surname": "Yi",
"fullName": "Lingzhi Yi",
"affiliation": "School of Information and Safety Engineering, Zhongnan University of Economics and Law, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Laurence T.",
"surname": "Yang",
"fullName": "Laurence T. Yang",
"affiliation": "Hubei Key Laboratory of Distributed System Security, Hubei Engineering Research Center on Big Data Security, School of Cyber Science and Engineering, Huazhong University of Science and Technology, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chenlu",
"surname": "Zhu",
"fullName": "Chenlu Zhu",
"affiliation": "Hubei Key Laboratory of Distributed System Security, Hubei Engineering Research Center on Big Data Security, School of Cyber Science and Engineering, Huazhong University of Science and Technology, Wuhan, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-02-01 00:00:00",
"pubType": "trans",
"pages": "1-15",
"year": "5555",
"issn": "1536-1233",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/lcn/2011/926/0/06115520",
"title": "On area coverage reliability of wireless sensor networks",
"doi": null,
"abstractUrl": "/proceedings-article/lcn/2011/06115520/12OmNAOKnZC",
"parentPublication": {
"id": "proceedings/lcn/2011/926/0",
"title": "2011 IEEE 36th Conference on Local Computer Networks",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/modeva/2004/8852/0/01425848",
"title": "Reliability analysis of the k-out-of-n multi-state system",
"doi": null,
"abstractUrl": "/proceedings-article/modeva/2004/01425848/12OmNCdBDE5",
"parentPublication": {
"id": "proceedings/modeva/2004/8852/0",
"title": "Proceedings. 2004 1st International Workshop on Model, Design and Validation. SIVOES - MoDeVa 2004",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-euc/2013/5088/0/06832048",
"title": "Lifetime Maximization for Multi-modal Confident Information Coverage in Sensor Networks",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-euc/2013/06832048/12OmNwErpX3",
"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/issre/1997/8120/0/81200283",
"title": "Confidence-Based Reliability And Statistical Coverage Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/issre/1997/81200283/12OmNzVoBsm",
"parentPublication": {
"id": "proceedings/issre/1997/8120/0",
"title": "Proceedings The Eighth International Symposium on Software Reliability Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2005/04/q0336",
"title": "OBDD-Based Evaluation of Reliability and Importance Measures for Multistate Systems Subject to Imperfect Fault Coverage",
"doi": null,
"abstractUrl": "/journal/tq/2005/04/q0336/13rRUxly8YO",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2015/03/06782385",
"title": "Sensor Scheduling for Multi-Modal Confident Information Coverage in Sensor Networks",
"doi": null,
"abstractUrl": "/journal/td/2015/03/06782385/13rRUynHuiO",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2016/04/07122315",
"title": "The Optimal Placement Pattern for Confident Information Coverage in Wireless Sensor Networks",
"doi": null,
"abstractUrl": "/journal/tm/2016/04/07122315/13rRUzpzeBP",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ithings-greencom-cpscom-smartdata-cybermatics/2022/5417/0/541700a101",
"title": "Node Deployment and Confident Information Coverage for WSN-based Air Quality Monitoring",
"doi": null,
"abstractUrl": "/proceedings-article/ithings-greencom-cpscom-smartdata-cybermatics/2022/541700a101/1HcmO4wHf8I",
"parentPublication": {
"id": "proceedings/ithings-greencom-cpscom-smartdata-cybermatics/2022/5417/0",
"title": "2022 IEEE International Conferences on Internet of Things (iThings) and IEEE Green Computing & Communications (GreenCom) and IEEE Cyber, Physical & Social Computing (CPSCom) and IEEE Smart Data (SmartData) and IEEE Congress on Cybermatics (Cybermatics)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2022/9425/0/942500a074",
"title": "Coverage Reliability of IoT Intrusion Detection System based on Attack-Defense Game Design",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2022/942500a074/1LFLT46LpwQ",
"parentPublication": {
"id": "proceedings/trustcom/2022/9425/0",
"title": "2022 IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dasc-picom-cbdcom-cyberscitech/2019/3024/0/302400a228",
"title": "A Novel Strategy for Barrier Confident Information Coverage in Sensor Networks",
"doi": null,
"abstractUrl": "/proceedings-article/dasc-picom-cbdcom-cyberscitech/2019/302400a228/1eEUqivKxUI",
"parentPublication": {
"id": "proceedings/dasc-picom-cbdcom-cyberscitech/2019/3024/0",
"title": "2019 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10056271",
"articleId": "1L8lOcKxqpO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10059193",
"articleId": "1LiKLSFF0UE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvkpkSQ",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "ta",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1v2LX9tNM7C",
"doi": "10.1109/TAFFC.2021.3094883",
"abstract": "Safety-critical systems are often equipped with warning mechanisms to alert users regarding imminent system failures. However, they can suffer from false alarms, and affect users emotions and trust in the system negatively. While providing feedback could be an effective way to calibrate trust under such scenarios, the effects of feedback and warning reliability on users emotions, trust, and compliance behavior is not clear. This paper investigates this by designing a 2 (feedback: present/absent) 2 (warning reliability: high/low) 4 (sessions) mixed design study where participants interacted with a simulated unmanned aerial vehicle (UAV) system to identify and neutralize enemy targets. Results indicated that feedback containing both correctness and affective components decreased users positive emotions and trust in the system, and increased loneliness and hostility (negative) emotions. Emotions were found to mediate the relationship between feedback and trust. Implications of our findings for designing feedback and calibration of trust are discussed in the paper.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Safety-critical systems are often equipped with warning mechanisms to alert users regarding imminent system failures. However, they can suffer from false alarms, and affect users emotions and trust in the system negatively. While providing feedback could be an effective way to calibrate trust under such scenarios, the effects of feedback and warning reliability on users emotions, trust, and compliance behavior is not clear. This paper investigates this by designing a 2 (feedback: present/absent) 2 (warning reliability: high/low) 4 (sessions) mixed design study where participants interacted with a simulated unmanned aerial vehicle (UAV) system to identify and neutralize enemy targets. Results indicated that feedback containing both correctness and affective components decreased users positive emotions and trust in the system, and increased loneliness and hostility (negative) emotions. Emotions were found to mediate the relationship between feedback and trust. Implications of our findings for designing feedback and calibration of trust are discussed in the paper.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Safety-critical systems are often equipped with warning mechanisms to alert users regarding imminent system failures. However, they can suffer from false alarms, and affect users emotions and trust in the system negatively. While providing feedback could be an effective way to calibrate trust under such scenarios, the effects of feedback and warning reliability on users emotions, trust, and compliance behavior is not clear. This paper investigates this by designing a 2 (feedback: present/absent) 2 (warning reliability: high/low) 4 (sessions) mixed design study where participants interacted with a simulated unmanned aerial vehicle (UAV) system to identify and neutralize enemy targets. Results indicated that feedback containing both correctness and affective components decreased users positive emotions and trust in the system, and increased loneliness and hostility (negative) emotions. Emotions were found to mediate the relationship between feedback and trust. Implications of our findings for designing feedback and calibration of trust are discussed in the paper.",
"title": "The Mediating Effect of Emotions on Trust in the Context of Automated System Usage",
"normalizedTitle": "The Mediating Effect of Emotions on Trust in the Context of Automated System Usage",
"fno": "09477000",
"hasPdf": true,
"idPrefix": "ta",
"keywords": [
"Task Analysis",
"Automation",
"Robots",
"Reliability Engineering",
"Drones",
"Decision Making",
"Calibration",
"Emotion",
"Trust",
"Mediation",
"Warning",
"Feedback",
"Safety Critical Systems",
"Time Critical Systems"
],
"authors": [
{
"givenName": "Md Abdullah Al",
"surname": "Fahim",
"fullName": "Md Abdullah Al Fahim",
"affiliation": "Computer Science and Engineering, University of Connecticut, 7712 Storrs, Connecticut, United States, (e-mail: md.fahim@uconn.edu)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mohammad Maifi Hasan",
"surname": "Khan",
"fullName": "Mohammad Maifi Hasan Khan",
"affiliation": "Computer Science and Engineering, University of Connecticut, 7712 Storrs, Connecticut, United States, (e-mail: mohammad.khan@uconn.edu)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Theodore",
"surname": "Jensen",
"fullName": "Theodore Jensen",
"affiliation": "Computer Science and Engineering, University of Connecticut, 7712 Storrs, Connecticut, United States, (e-mail: theodore.jensen@uconn.edu)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yusuf",
"surname": "Albayram",
"fullName": "Yusuf Albayram",
"affiliation": "Computer Science, Central Connecticut State University, 5745 New Britain, Connecticut, United States, (e-mail: yusuf.albayram@ccsu.edu)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Emil",
"surname": "Coman",
"fullName": "Emil Coman",
"affiliation": "Health Disparities Institute, University of Connecticut Health Center, 21654 Farmington, Connecticut, United States, (e-mail: coman@uchc.edu)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ross",
"surname": "Buck",
"fullName": "Ross Buck",
"affiliation": "Communication/Psychology, University of Connecticut, 7712 Storrs, Connecticut, United States, (e-mail: ross.buck@uconn.edu)",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2021-07-01 00:00:00",
"pubType": "trans",
"pages": "1-1",
"year": "5555",
"issn": "1949-3045",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/acii/2013/5048/0/5048a717",
"title": "Ubiquitous Interaction for Computer Mediated Communication of Emotions",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2013/5048a717/12OmNC0PGMV",
"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/trustcom/2013/5022/0/5022b581",
"title": "A Reliability-Based Trust Management Mechanism for Cloud Services",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2013/5022b581/12OmNx5GU5D",
"parentPublication": {
"id": "proceedings/trustcom/2013/5022/0",
"title": "2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2009/3801/2/3801b289",
"title": "Relation of Trust and Social Emotions: A Logical Approach",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2009/3801b289/12OmNzGDsJX",
"parentPublication": {
"id": "proceedings/wi-iat/2009/3801/2",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a650",
"title": "Emotional Avatars: Effect of Uncanniness in Identifying Emotions using Avatar Expressions",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a650/1CJdQj37aw0",
"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/bcd/2022/6582/0/09900624",
"title": "Linking Authentic Leadership to Change-Oriented Behaviors: The Mediating Effect of Workplace Trust",
"doi": null,
"abstractUrl": "/proceedings-article/bcd/2022/09900624/1H44bVGhT5S",
"parentPublication": {
"id": "proceedings/bcd/2022/6582/0",
"title": "2022 IEEE/ACIS 7th International Conference on Big Data, Cloud Computing, and Data Science (BCD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2019/1838/0/183800a195",
"title": "Investigating Trust Factors in Human-Robot Shared Control: Implicit Gender Bias Around Robot Voice",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2019/183800a195/1cMGvp8by2Q",
"parentPublication": {
"id": "proceedings/crv/2019/1838/0",
"title": "2019 16th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/seaa/2019/3421/0/342100a169",
"title": "Detecting User Emotions with the True-Depth Camera to Support Mobile App Quality Assurance",
"doi": null,
"abstractUrl": "/proceedings-article/seaa/2019/342100a169/1f8MGDUuS40",
"parentPublication": {
"id": "proceedings/seaa/2019/3421/0",
"title": "2019 45th Euromicro Conference on Software Engineering and Advanced Applications (SEAA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/re/2019/3912/0/391200a375",
"title": "Don't Worry, Be Happy – Exploring Users' Emotions During App Usage for Requirements Engineering",
"doi": null,
"abstractUrl": "/proceedings-article/re/2019/391200a375/1fHlsnVzdba",
"parentPublication": {
"id": "proceedings/re/2019/3912/0",
"title": "2019 IEEE 27th International Requirements Engineering Conference (RE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rew/2019/5165/0/516500a084",
"title": "On the Road to Enriching the App Improvement Process with Emotions",
"doi": null,
"abstractUrl": "/proceedings-article/rew/2019/516500a084/1fTh2Cw5TRS",
"parentPublication": {
"id": "proceedings/rew/2019/5165/0",
"title": "2019 IEEE 27th International Requirements Engineering Conference Workshops (REW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trex/2020/8514/0/851400a009",
"title": "Beyond Trust Building — Calibrating Trust in Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/trex/2020/851400a009/1pXm2QUw2ek",
"parentPublication": {
"id": "proceedings/trex/2020/8514/0",
"title": "2020 IEEE Workshop on TRust and EXpertise in Visual Analytics (TREX)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09470976",
"articleId": "1uSOwMJI2TS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09477021",
"articleId": "1v2LXvFlUsg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1I6Nvxq2hxe",
"title": "Dec.",
"year": "2022",
"issueNum": "12",
"idPrefix": "tp",
"pubType": "journal",
"volume": "44",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "187Z9n3e5KE",
"doi": "10.1109/TPAMI.2019.2903035",
"abstract": "Night beats with alternating current (AC) illumination. By passively sensing this beat, we reveal new scene information which includes: the type of bulbs in the scene, the phases of the electric grid up to city scale, and the light transport matrix. This information yields unmixing of reflections and semi-reflections, nocturnal high dynamic range, and scene rendering with bulbs not observed during acquisition. The latter is facilitated by a dataset of <italic>bulb response functions</italic> for a range of sources, which we collected and provide. To do all this, we built a novel coded-exposure high-dynamic-range imaging technique, specifically designed to operate on the grid’s AC lighting.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Night beats with alternating current (AC) illumination. By passively sensing this beat, we reveal new scene information which includes: the type of bulbs in the scene, the phases of the electric grid up to city scale, and the light transport matrix. This information yields unmixing of reflections and semi-reflections, nocturnal high dynamic range, and scene rendering with bulbs not observed during acquisition. The latter is facilitated by a dataset of <italic>bulb response functions</italic> for a range of sources, which we collected and provide. To do all this, we built a novel coded-exposure high-dynamic-range imaging technique, specifically designed to operate on the grid’s AC lighting.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Night beats with alternating current (AC) illumination. By passively sensing this beat, we reveal new scene information which includes: the type of bulbs in the scene, the phases of the electric grid up to city scale, and the light transport matrix. This information yields unmixing of reflections and semi-reflections, nocturnal high dynamic range, and scene rendering with bulbs not observed during acquisition. The latter is facilitated by a dataset of bulb response functions for a range of sources, which we collected and provide. To do all this, we built a novel coded-exposure high-dynamic-range imaging technique, specifically designed to operate on the grid’s AC lighting.",
"title": "Computational Imaging on the Electric Grid",
"normalizedTitle": "Computational Imaging on the Electric Grid",
"fno": "08658151",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Image Reconstruction",
"Image Sensors",
"Lighting",
"Rendering Computer Graphics",
"Beat",
"Bulb Response Functions",
"Bulbs",
"City Scale",
"Computational Imaging",
"Current Illumination",
"Electric Grid",
"Light Transport Matrix",
"Nocturnal High Dynamic Range",
"Novel Coded Exposure High Dynamic Range Imaging Technique",
"Reflections",
"Scene Information",
"Scene Rendering",
"Semireflections",
"Lighting",
"Cameras",
"Light Sources",
"Visualization",
"Photodiodes",
"Urban Areas",
"AC Illumination",
"Bulb Flicker",
"Bulb Response Function",
"Light Transport",
"Light Source Separation",
"AC Phase Recovery",
"Coded Exposure",
"Reflection Removal"
],
"authors": [
{
"givenName": "Mark",
"surname": "Sheinin",
"fullName": "Mark Sheinin",
"affiliation": "Viterbi Faculty of Electrical Engineering, Technion - Israel Institute of Technology, Haifa, Israel",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yoav Y.",
"surname": "Schechner",
"fullName": "Yoav Y. Schechner",
"affiliation": "Viterbi Faculty of Electrical Engineering, Technion - Israel Institute of Technology, Haifa, Israel",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kiriakos N.",
"surname": "Kutulakos",
"fullName": "Kiriakos N. Kutulakos",
"affiliation": "Department of Computer Science, University of Toronto, Toronto, Ontario, Canada",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "8728-8739",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2017/0457/0/0457c363",
"title": "Computational Imaging on the Electric Grid",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457c363/12OmNAoUTip",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imstw/2015/6732/0/07177862",
"title": "Considerations for light sources: For semiconductor light sensor test",
"doi": null,
"abstractUrl": "/proceedings-article/imstw/2015/07177862/12OmNClQ0qG",
"parentPublication": {
"id": "proceedings/imstw/2015/6732/0",
"title": "2015 20th International Mixed-Signal Testing Workshop (IMSTW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pbmcv/1995/7021/0/00514673",
"title": "A ray-based computational model of light sources and illumination",
"doi": null,
"abstractUrl": "/proceedings-article/pbmcv/1995/00514673/12OmNrAMEYe",
"parentPublication": {
"id": "proceedings/pbmcv/1995/7021/0",
"title": "Proceedings of the Workshop on Physics-Based Modeling in Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2016/0811/0/0811a084",
"title": "Reflectance Transformation Imaging Method for Large-Scale Objects",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2016/0811a084/12OmNsd6vp3",
"parentPublication": {
"id": "proceedings/cgiv/2016/0811/0",
"title": "2016 13th International Conference on Computer Graphics, Imaging and Visualization (CGiV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2009/4534/0/05559012",
"title": "Image-based separation of diffuse and specular reflections using environmental structured illumination",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2009/05559012/12OmNyRPgVx",
"parentPublication": {
"id": "proceedings/iccp/2009/4534/0",
"title": "IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2018/2526/0/08368472",
"title": "Rolling shutter imaging on the electric grid",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2018/08368472/12OmNyo1o6e",
"parentPublication": {
"id": "proceedings/iccp/2018/2526/0",
"title": "2018 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2014/2871/0/06802044",
"title": "Efficient and robust radiance transfer for probeless photorealistic augmented reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2014/06802044/12OmNz4SOCN",
"parentPublication": {
"id": "proceedings/vr/2014/2871/0",
"title": "2014 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391d595",
"title": "Depth Selective Camera: A Direct, On-Chip, Programmable Technique for Depth Selectivity in Photography",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391d595/12OmNzt0INA",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percom/2018/3224/0/08444591",
"title": "Spatial Interference Detection for Mobile Visible Light Communication",
"doi": null,
"abstractUrl": "/proceedings-article/percom/2018/08444591/13bd1eOELLV",
"parentPublication": {
"id": "proceedings/percom/2018/3224/0",
"title": "2018 IEEE International Conference on Pervasive Computing and Communications (PerCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/02/09018202",
"title": "Detecting Specular Reflections and Cast Shadows to Estimate Reflectance and Illumination of Dynamic Indoor Scenes",
"doi": null,
"abstractUrl": "/journal/tg/2022/02/09018202/1hN4BrDSVHi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09633156",
"articleId": "1z0u4Q2vdtu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09606538",
"articleId": "1ymEN8wBXRC",
"__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": "1Brwons3Oa4",
"doi": "10.1109/TVCG.2022.3155808",
"abstract": "This work presents an innovative method for point set self-embedding, that encodes the structural information of a dense point set into its sparser version in a visual but imperceptible form. The self-embedded point set can function as the ordinary downsampled one and be visualized efficiently on mobile devices. Particularly, we can leverage the self-embedded information to fully restore the original point set for detailed analysis on remote servers. This new task is challenging, cause both the self-embedded point set and restored point set should resemble the original one. To achieve a learnable self-embedding scheme, we design a novel framework with two jointly-trained networks: one to encode the input point set into its self-embedded sparse point set and the other to leverage the embedded information for inverting the original point set back. Further, we develop a pair of up-shuffle and down-shuffle units in the two networks, and formulate loss terms to encourage the shape similarity and point distribution in the results. Extensive qualitative and quantitative results demonstrate the effectiveness of our method on both synthetic and real-scanned datasets. The source code and trained models will be publicly available at https://github.com/liruihui/Self-Embedding.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This work presents an innovative method for point set self-embedding, that encodes the structural information of a dense point set into its sparser version in a visual but imperceptible form. The self-embedded point set can function as the ordinary downsampled one and be visualized efficiently on mobile devices. Particularly, we can leverage the self-embedded information to fully restore the original point set for detailed analysis on remote servers. This new task is challenging, cause both the self-embedded point set and restored point set should resemble the original one. To achieve a learnable self-embedding scheme, we design a novel framework with two jointly-trained networks: one to encode the input point set into its self-embedded sparse point set and the other to leverage the embedded information for inverting the original point set back. Further, we develop a pair of up-shuffle and down-shuffle units in the two networks, and formulate loss terms to encourage the shape similarity and point distribution in the results. Extensive qualitative and quantitative results demonstrate the effectiveness of our method on both synthetic and real-scanned datasets. The source code and trained models will be publicly available at https://github.com/liruihui/Self-Embedding.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This work presents an innovative method for point set self-embedding, that encodes the structural information of a dense point set into its sparser version in a visual but imperceptible form. The self-embedded point set can function as the ordinary downsampled one and be visualized efficiently on mobile devices. Particularly, we can leverage the self-embedded information to fully restore the original point set for detailed analysis on remote servers. This new task is challenging, cause both the self-embedded point set and restored point set should resemble the original one. To achieve a learnable self-embedding scheme, we design a novel framework with two jointly-trained networks: one to encode the input point set into its self-embedded sparse point set and the other to leverage the embedded information for inverting the original point set back. Further, we develop a pair of up-shuffle and down-shuffle units in the two networks, and formulate loss terms to encourage the shape similarity and point distribution in the results. Extensive qualitative and quantitative results demonstrate the effectiveness of our method on both synthetic and real-scanned datasets. The source code and trained models will be publicly available at https://github.com/liruihui/Self-Embedding.",
"title": "Point Set Self-Embedding",
"normalizedTitle": "Point Set Self-Embedding",
"fno": "09727090",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Task Analysis",
"Shape",
"Point Cloud Compression",
"Visualization",
"Image Restoration",
"Feature Extraction",
"Three Dimensional Displays",
"Point Set Self Embedding",
"Jointly Trained Networks",
"Shape Similarity",
"Point Distribution"
],
"authors": [
{
"givenName": "Ruihui",
"surname": "Li",
"fullName": "Ruihui Li",
"affiliation": "Chinese University of Hong Kong, Hong Kong and Hunan University, Changsha, Hunan 410082, China, and (email: liruihui@hnu.edu.cn)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xianzhi",
"surname": "Li",
"fullName": "Xianzhi Li",
"affiliation": "Computer Science and Technology, Huazhong University of Science and Technology, 12443 Wuhan, Hubei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tien-Tsin",
"surname": "Wong",
"fullName": "Tien-Tsin Wong",
"affiliation": "Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong, HKG, Hong Kong, HKG",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chi-Wing",
"surname": "Fu",
"fullName": "Chi-Wing Fu",
"affiliation": "Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong, Hong Kong, Hong Kong, SIN",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-03-01 00:00:00",
"pubType": "trans",
"pages": "1-1",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/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/iccv/2021/2812/0/281200g383",
"title": "Geometry-Aware Self-Training for Unsupervised Domain Adaptation on Object Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200g383/1BmG4XlYzqo",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200g515",
"title": "Spatio-temporal Self-Supervised Representation Learning for 3D Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200g515/1BmHreVQrSg",
"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/09729524",
"title": "Unsupervised Category-Specific Partial Point Set Registration via Joint Shape Completion and Registration",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09729524/1Bya8dlokw0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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": "proceedings/icme/2022/8563/0/09860015",
"title": "Self-Supervised Point Cloud Completion on Real Traffic Scenes Via Scene-Concerned Bottom-Up Mechanism",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2022/09860015/1G9DVAZg2uA",
"parentPublication": {
"id": "proceedings/icme/2022/8563/0",
"title": "2022 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600i407",
"title": "Voxel Set Transformer: A Set-to-Set Approach to 3D Object Detection from Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600i407/1H0N8QxLrgs",
"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/567000a042",
"title": "Point Discriminative Learning for Data-efficient 3D Point Cloud Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2022/567000a042/1KYsxw3MorC",
"parentPublication": {
"id": "proceedings/3dv/2022/5670/0",
"title": "2022 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/10106495",
"title": "Variational Relational Point Completion Network for Robust 3D Classification",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/10106495/1MwAn9y4Ozu",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2021/2688/0/268800a940",
"title": "NeeDrop: Self-supervised Shape Representation from Sparse Point Clouds using Needle Dropping",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2021/268800a940/1zWEezCujxC",
"parentPublication": {
"id": "proceedings/3dv/2021/2688/0",
"title": "2021 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09721603",
"articleId": "1BhzoNy6wWA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09729541",
"articleId": "1Bya7Ux2z2U",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1BtbC34fvJS",
"name": "ttg555501-09727090s1-supp1-3155808.rar",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09727090s1-supp1-3155808.rar",
"extension": "rar",
"size": "49.1 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": "1nJsLTOInJu",
"doi": "10.1109/TVCG.2020.3028953",
"abstract": "Grid maps are spatial arrangements of simple tiles (often squares or hexagons), each of which represents a spatial element. They are an established, effective way to show complex data per spatial element, using visual encodings within each tile ranging from simple coloring to nested small-multiples visualizations. An effective grid map is coherent with the underlying geographic space: the tiles maintain the contiguity, neighborhoods and identifiability of the corresponding spatial elements, while the grid map as a whole maintains the global shape of the input. Of particular importance are salient local features of the global shape which need to be represented by tiles assigned to the appropriate spatial elements. State-of-the-art techniques can adequately deal only with simple cases, such as close-to-uniform spatial distributions or global shapes that have few characteristic features. We introduce a simple fully-automated 3-step pipeline for computing coherent grid maps. Each step is a well-studied problem: shape decomposition based on salient features, tile-based Mosaic Cartograms, and point-set matching. Our pipeline is a seamless composition of existing techniques for these problems and results in high-quality grid maps. We provide an implementation, demonstrate the efficacy of our approach on various complex datasets, and compare it to the state-of-the-art.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Grid maps are spatial arrangements of simple tiles (often squares or hexagons), each of which represents a spatial element. They are an established, effective way to show complex data per spatial element, using visual encodings within each tile ranging from simple coloring to nested small-multiples visualizations. An effective grid map is coherent with the underlying geographic space: the tiles maintain the contiguity, neighborhoods and identifiability of the corresponding spatial elements, while the grid map as a whole maintains the global shape of the input. Of particular importance are salient local features of the global shape which need to be represented by tiles assigned to the appropriate spatial elements. State-of-the-art techniques can adequately deal only with simple cases, such as close-to-uniform spatial distributions or global shapes that have few characteristic features. We introduce a simple fully-automated 3-step pipeline for computing coherent grid maps. Each step is a well-studied problem: shape decomposition based on salient features, tile-based Mosaic Cartograms, and point-set matching. Our pipeline is a seamless composition of existing techniques for these problems and results in high-quality grid maps. We provide an implementation, demonstrate the efficacy of our approach on various complex datasets, and compare it to the state-of-the-art.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Grid maps are spatial arrangements of simple tiles (often squares or hexagons), each of which represents a spatial element. They are an established, effective way to show complex data per spatial element, using visual encodings within each tile ranging from simple coloring to nested small-multiples visualizations. An effective grid map is coherent with the underlying geographic space: the tiles maintain the contiguity, neighborhoods and identifiability of the corresponding spatial elements, while the grid map as a whole maintains the global shape of the input. Of particular importance are salient local features of the global shape which need to be represented by tiles assigned to the appropriate spatial elements. State-of-the-art techniques can adequately deal only with simple cases, such as close-to-uniform spatial distributions or global shapes that have few characteristic features. We introduce a simple fully-automated 3-step pipeline for computing coherent grid maps. Each step is a well-studied problem: shape decomposition based on salient features, tile-based Mosaic Cartograms, and point-set matching. Our pipeline is a seamless composition of existing techniques for these problems and results in high-quality grid maps. We provide an implementation, demonstrate the efficacy of our approach on various complex datasets, and compare it to the state-of-the-art.",
"title": "A Simple Pipeline for Coherent Grid Maps",
"normalizedTitle": "A Simple Pipeline for Coherent Grid Maps",
"fno": "09216586",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Geometry",
"Data Visualisation",
"Feature Extraction",
"Image Matching",
"Image Segmentation",
"Spatial Arrangements",
"Spatial Element",
"Visual Encodings",
"Effective Grid Map",
"Corresponding Spatial Elements",
"Global Shape",
"Salient Local Features",
"Close To Uniform Spatial Distributions",
"3 Step Pipeline",
"Coherent Grid Maps",
"Shape Decomposition",
"Salient Features",
"High Quality Grid Maps",
"Nested Small Multiple Visualizations",
"Geographic Space",
"Tile Based Mosaic Cartograms",
"Shape",
"Topology",
"Pipelines",
"Coherence",
"Data Visualization",
"Visualization",
"Geometry",
"Grid Maps",
"Algorithms",
"Tile Maps",
"Small Multiples",
"Geovisualization"
],
"authors": [
{
"givenName": "Wouter",
"surname": "Meulemans",
"fullName": "Wouter Meulemans",
"affiliation": "TU Eindhoven",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Max",
"surname": "Sondag",
"fullName": "Max Sondag",
"affiliation": "TU Eindhoven",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bettina",
"surname": "Speckmann",
"fullName": "Bettina Speckmann",
"affiliation": "TU Eindhoven",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "1236-1246",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icicta/2011/4353/2/05751121",
"title": "Watermarking Vector Maps Based on Minimum Encasing Rectangle",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2011/05751121/12OmNAkWvCp",
"parentPublication": {
"id": "icicta/2011/4353/2",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209c990",
"title": "Hierarchical Semantic Hashing: Visual Localization from Buildings on Maps",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209c990/12OmNylsZOZ",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2014/6636/0/6636a300",
"title": "Image Mosaics via the Novel Saliency Map",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2014/6636a300/12OmNzCWG8k",
"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/isca/2015/0256/0/07284108",
"title": "Fusion: Design tradeoffs in coherent cache hierarchies for accelerators",
"doi": null,
"abstractUrl": "/proceedings-article/isca/2015/07284108/12OmNzWfp3D",
"parentPublication": {
"id": "proceedings/isca/2015/0256/0",
"title": "2015 ACM/IEEE 42nd Annual International Symposium on Computer Architecture (ISCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2013/2576/0/06814970",
"title": "Time and Space Coherent Occlusion Culling for Tileable Extended 3D Worlds",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2013/06814970/12OmNzuIjnk",
"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": "trans/tg/2008/05/ttg2008050982",
"title": "Dual Poisson-Disk Tiling: An Efficient Method for Distributing Features on Arbitrary Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2008/05/ttg2008050982/13rRUwI5UfY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/04/v0355",
"title": "Real-Time Optimal Adaptation for Planetary Geometry and Texture: 4-8 Tile Hierarchies",
"doi": null,
"abstractUrl": "/journal/tg/2005/04/v0355/13rRUynHuiW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/micro/2018/6240/0/624000a682",
"title": "Multi-dimensional Parallel Training of Winograd Layer on Memory-Centric Architecture",
"doi": null,
"abstractUrl": "/proceedings-article/micro/2018/624000a682/17D45WrVgdS",
"parentPublication": {
"id": "proceedings/micro/2018/6240/0",
"title": "2018 51st Annual IEEE/ACM International Symposium on Microarchitecture (MICRO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpca/2019/1444/0/144400a623",
"title": "Rendering Elimination: Early Discard of Redundant Tiles in the Graphics Pipeline",
"doi": null,
"abstractUrl": "/proceedings-article/hpca/2019/144400a623/18M7PSwaQkE",
"parentPublication": {
"id": "proceedings/hpca/2019/1444/0",
"title": "2019 IEEE International Symposium on High Performance Computer Architecture (HPCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl-hcc/2022/4214/0/09833006",
"title": "Evaluating a Casual Procedural Generation Tool for Tabletop Role-Playing Game Maps",
"doi": null,
"abstractUrl": "/proceedings-article/vl-hcc/2022/09833006/1FUSLmm5kek",
"parentPublication": {
"id": "proceedings/vl-hcc/2022/4214/0",
"title": "2022 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09222263",
"articleId": "1nTqyTSNcCA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09222088",
"articleId": "1nTqWDGmCMU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"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": "1pOZrP70lGM",
"doi": "10.1109/TVCG.2020.3047111",
"abstract": "We present GridSet, a novel set visualization for exploring elements, their attributes, intersections, as well as entire sets. In this set visualization, each set representation is composed of glyphs, which represent individual elements and their attributes utilizing different visual encodings. In each set, elements are organized within a grid treemap layout that can provide space-efficient overviews of the elements structured by set intersections across multiple sets. These intersecting elements can be connected among sets through visual links. These visual representations for the individual set, elements, and intersection in GridSet facilitate novel interaction approaches for undertaking analysis tasks by utilizing both macroscopic views of sets, as well as microscopic views of elements and attribute details. In order to perform multiple set operations, GridSet supports a simple and straightforward process for set operations through dragging and dropping set objects. Our use cases involving two large set-typed datasets demonstrate that GridSet facilitates the exploration and identification of meaningful patterns and distributions of elements with respect to attributes and set intersections for solving complex analysis problems in set-typed data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present GridSet, a novel set visualization for exploring elements, their attributes, intersections, as well as entire sets. In this set visualization, each set representation is composed of glyphs, which represent individual elements and their attributes utilizing different visual encodings. In each set, elements are organized within a grid treemap layout that can provide space-efficient overviews of the elements structured by set intersections across multiple sets. These intersecting elements can be connected among sets through visual links. These visual representations for the individual set, elements, and intersection in GridSet facilitate novel interaction approaches for undertaking analysis tasks by utilizing both macroscopic views of sets, as well as microscopic views of elements and attribute details. In order to perform multiple set operations, GridSet supports a simple and straightforward process for set operations through dragging and dropping set objects. Our use cases involving two large set-typed datasets demonstrate that GridSet facilitates the exploration and identification of meaningful patterns and distributions of elements with respect to attributes and set intersections for solving complex analysis problems in set-typed data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present GridSet, a novel set visualization for exploring elements, their attributes, intersections, as well as entire sets. In this set visualization, each set representation is composed of glyphs, which represent individual elements and their attributes utilizing different visual encodings. In each set, elements are organized within a grid treemap layout that can provide space-efficient overviews of the elements structured by set intersections across multiple sets. These intersecting elements can be connected among sets through visual links. These visual representations for the individual set, elements, and intersection in GridSet facilitate novel interaction approaches for undertaking analysis tasks by utilizing both macroscopic views of sets, as well as microscopic views of elements and attribute details. In order to perform multiple set operations, GridSet supports a simple and straightforward process for set operations through dragging and dropping set objects. Our use cases involving two large set-typed datasets demonstrate that GridSet facilitates the exploration and identification of meaningful patterns and distributions of elements with respect to attributes and set intersections for solving complex analysis problems in set-typed data.",
"title": "GridSet: Visualizing Individual Elements and Attributes for Analysis of Set-Typed Data",
"normalizedTitle": "GridSet: Visualizing Individual Elements and Attributes for Analysis of Set-Typed Data",
"fno": "09307276",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Grid Set",
"Set Visualization",
"Set Representation",
"Visual Encodings",
"Set Intersections",
"Intersecting Elements",
"Visual Links",
"Visual Representations",
"Attribute Details",
"Set Operations",
"Set Typed Data Analysis",
"Data Visualization",
"Visualization",
"Layout",
"Motion Pictures",
"Image Color Analysis",
"Complexity Theory",
"Aggregates",
"Set Visualization",
"Sets",
"Intersections",
"Elements",
"Attributes",
"Glyphs",
"Visual Links",
"Treemap",
"Set Typed Data"
],
"authors": [
{
"givenName": "Haeyong",
"surname": "Chung",
"fullName": "Haeyong Chung",
"affiliation": "Department of Computer Science, University of Alabama in Huntsville, Huntsville, AL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Santhosh",
"surname": "Nandhakumar",
"fullName": "Santhosh Nandhakumar",
"affiliation": "Department of Computer Science, University of Alabama in Huntsville, Huntsville, AL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Seungwon",
"surname": "Yang",
"fullName": "Seungwon Yang",
"affiliation": "School of Information Studies & Center for Computation and Technology, Louisiana State University, Baton Rouge, LA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2022-08-01 00:00:00",
"pubType": "trans",
"pages": "2983-2998",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2017/5738/0/08031575",
"title": "NetSet: A systematic integration of visualization for analyzing set intersections with network",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031575/12OmNyOHG3r",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061340",
"title": "Interactive Visual Analysis of Set-Typed Data",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061340/13rRUIM2VGX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07194854",
"title": "AggreSet: Rich and Scalable Set Exploration using Visualizations of Element Aggregations",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07194854/13rRUxOve9M",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07536208",
"title": "PowerSet: A Comprehensive Visualization of Set Intersections",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07536208/13rRUy0HYRv",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06876017",
"title": "UpSet: Visualization of Intersecting Sets",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06876017/13rRUyY294D",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2018/7202/0/720200a350",
"title": "Knowledge Representation in a Visual Typed Language: from Principles to Practice",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a350/17D45VsBU3h",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440828",
"title": "iStoryline: Effective Convergence to Hand-drawn Storylines",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440828/17D45XfSESS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/06/09705082",
"title": "Visualizing Graph Neural Networks With CorGIE: <underline>Cor</underline>responding a <underline>G</underline>raph to <underline>I</underline>ts <underline>E</underline>mbedding",
"doi": null,
"abstractUrl": "/journal/tg/2022/06/09705082/1AIIcR14E4o",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101356",
"title": "The Pastwatch: On the usability of provenance data in relational databases",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101356/1kaMB5wtYys",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2020/8316/0/831600b370",
"title": "Multi-typed Objects Multi-view Multi-instance Multi-label Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2020/831600b370/1r54FVUrLag",
"parentPublication": {
"id": "proceedings/icdm/2020/8316/0",
"title": "2020 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09303392",
"articleId": "1pLFQxpKDIY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09296808",
"articleId": "1pDnJLfMBWg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1ECXKjczOsE",
"name": "ttg202208-09307276s1-tvcg-3047111-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202208-09307276s1-tvcg-3047111-mm.zip",
"extension": "zip",
"size": "123 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": "13rRUNvyat8",
"doi": "10.1109/TVCG.2006.156",
"abstract": "We extend the popular force-directed approach to network (or graph) layout to allow separation constraints, which enforce a minimum horizontal or vertical separation between selected pairs of nodes. This simple class of linear constraints is expressive enough to satisfy a wide variety of application-specific layout requirements, including: layout of directed graphs to better show flow; layout with non-overlapping node labels; and layout of graphs with grouped nodes (called clusters). In the stress majorization force-directed layout process, separation constraints can be treated as a quadratic programming problem. We give an incremental algorithm based on gradient projection for efficiently solving this problem. The algorithm is considerably faster than using generic constraint optimization techniques and is comparable in speed to unconstrained stress majorization. We demonstrate the utility of our technique with sample data from a number of practical applications including gene-activation networks, terrorist networks and visualization of high-dimensional data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We extend the popular force-directed approach to network (or graph) layout to allow separation constraints, which enforce a minimum horizontal or vertical separation between selected pairs of nodes. This simple class of linear constraints is expressive enough to satisfy a wide variety of application-specific layout requirements, including: layout of directed graphs to better show flow; layout with non-overlapping node labels; and layout of graphs with grouped nodes (called clusters). In the stress majorization force-directed layout process, separation constraints can be treated as a quadratic programming problem. We give an incremental algorithm based on gradient projection for efficiently solving this problem. The algorithm is considerably faster than using generic constraint optimization techniques and is comparable in speed to unconstrained stress majorization. We demonstrate the utility of our technique with sample data from a number of practical applications including gene-activation networks, terrorist networks and visualization of high-dimensional data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We extend the popular force-directed approach to network (or graph) layout to allow separation constraints, which enforce a minimum horizontal or vertical separation between selected pairs of nodes. This simple class of linear constraints is expressive enough to satisfy a wide variety of application-specific layout requirements, including: layout of directed graphs to better show flow; layout with non-overlapping node labels; and layout of graphs with grouped nodes (called clusters). In the stress majorization force-directed layout process, separation constraints can be treated as a quadratic programming problem. We give an incremental algorithm based on gradient projection for efficiently solving this problem. The algorithm is considerably faster than using generic constraint optimization techniques and is comparable in speed to unconstrained stress majorization. We demonstrate the utility of our technique with sample data from a number of practical applications including gene-activation networks, terrorist networks and visualization of high-dimensional data.",
"title": "IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs",
"normalizedTitle": "IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs",
"fno": "v0821",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Stress",
"Clustering Algorithms",
"Data Visualization",
"Robustness",
"Quadratic Programming",
"Constraint Optimization",
"Engineering Drawings",
"Industrial Relations",
"Cells Biology",
"Complex Networks",
"Graph Drawing",
"Layout",
"Constraints",
"Stress Majorization",
"Force Directed Algorithms",
"Multidimensional Scaling"
],
"authors": [
{
"givenName": "Tim",
"surname": "Dwyer",
"fullName": "Tim Dwyer",
"affiliation": "Monash University, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yehuda",
"surname": "Koren",
"fullName": "Yehuda Koren",
"affiliation": "AT&T Labs — Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kim",
"surname": "Marriott",
"fullName": "Kim Marriott",
"affiliation": "Monash University, Australia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "trans",
"pages": "821-828",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/infvis/2005/9464/0/01532130",
"title": "Dig-CoLa: directed graph layout through constrained energy minimization",
"doi": null,
"abstractUrl": "/proceedings-article/infvis/2005/01532130/12OmNBU1jJ7",
"parentPublication": {
"id": "proceedings/infvis/2005/9464/0",
"title": "IEEE Symposium on Information Visualization (InfoVis 05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isbim/2008/3560/1/3560a465",
"title": "Separation of Duty Constraint for Permission Based Delegation Model",
"doi": null,
"abstractUrl": "/proceedings-article/isbim/2008/3560a465/12OmNBigFod",
"parentPublication": {
"id": "proceedings/isbim/2008/3560/1",
"title": "2008 International Seminar on Business and Information Management (ISBIM 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/1996/7686/0/76860360",
"title": "Incremental Algorithms for Managing Temporal Constraints",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/1996/76860360/12OmNC0PGMt",
"parentPublication": {
"id": "proceedings/ictai/1996/7686/0",
"title": "Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/27900009",
"title": "DIG-COLA: Directed Graph Layout through Constrained Energy Minimization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/27900009/12OmNwMXnuu",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isqed/2008/3117/0/3117a379",
"title": "On Efficient and Robust Constraint Generation for Practical Layout Legalization",
"doi": null,
"abstractUrl": "/proceedings-article/isqed/2008/3117a379/12OmNwdL7qV",
"parentPublication": {
"id": "proceedings/isqed/2008/3117/0",
"title": "2008 9th International Symposium on Quality Electronic Design (ISQED '08)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl/1999/0216/0/02160012",
"title": "Constraint-Based Diagram Beautification",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1999/02160012/12OmNxVV5ZU",
"parentPublication": {
"id": "proceedings/vl/1999/0216/0",
"title": "Visual Languages, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2011/0868/0/06004088",
"title": "Node-attribute Graph Layout for Small-World Networks",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2011/06004088/12OmNyxFKbt",
"parentPublication": {
"id": "proceedings/iv/2011/0868/0",
"title": "2011 15th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017634",
"title": "Revisiting Stress Majorization as a Unified Framework for Interactive Constrained Graph Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017634/13rRUxC0Sw3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/08/07272131",
"title": "Automatic Constraint Detection for 2D Layout Regularization",
"doi": null,
"abstractUrl": "/journal/tg/2016/08/07272131/13rRUxcsYLU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2022/2335/0/233500a061",
"title": "UNICON: A UNIform CONstraint Based Graph Layout Framework",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2022/233500a061/1E2wfeBklZS",
"parentPublication": {
"id": "proceedings/pacificvis/2022/2335/0",
"title": "2022 IEEE 15th Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0813",
"articleId": "13rRUx0gezN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0829",
"articleId": "13rRUxcKzVd",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAlvHDC",
"title": "June",
"year": "2013",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwj7cpa",
"doi": "10.1109/TVCG.2012.299",
"abstract": "In some applications of graph visualization, input edges have associated target lengths. Dealing with these lengths is a challenge, especially for large graphs. Stress models are often employed in this situation. However, the traditional full stress model is not scalable due to its reliance on an initial all-pairs shortest path calculation. A number of fast approximation algorithms have been proposed. While they work well for some graphs, the results are less satisfactory on graphs of intrinsically high dimension, because some nodes may be placed too close together, or even share the same position. We propose a solution, called the maxent-stress model, which applies the principle of maximum entropy to cope with the extra degrees of freedom. We describe a force-augmented stress majorization algorithm that solves the maxent-stress model. Numerical results show that the algorithm scales well, and provides acceptable layouts for large, nonrigid graphs. This also has potential applications to scalable algorithms for statistical multidimensional scaling (MDS) with variable distances.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In some applications of graph visualization, input edges have associated target lengths. Dealing with these lengths is a challenge, especially for large graphs. Stress models are often employed in this situation. However, the traditional full stress model is not scalable due to its reliance on an initial all-pairs shortest path calculation. A number of fast approximation algorithms have been proposed. While they work well for some graphs, the results are less satisfactory on graphs of intrinsically high dimension, because some nodes may be placed too close together, or even share the same position. We propose a solution, called the maxent-stress model, which applies the principle of maximum entropy to cope with the extra degrees of freedom. We describe a force-augmented stress majorization algorithm that solves the maxent-stress model. Numerical results show that the algorithm scales well, and provides acceptable layouts for large, nonrigid graphs. This also has potential applications to scalable algorithms for statistical multidimensional scaling (MDS) with variable distances.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In some applications of graph visualization, input edges have associated target lengths. Dealing with these lengths is a challenge, especially for large graphs. Stress models are often employed in this situation. However, the traditional full stress model is not scalable due to its reliance on an initial all-pairs shortest path calculation. A number of fast approximation algorithms have been proposed. While they work well for some graphs, the results are less satisfactory on graphs of intrinsically high dimension, because some nodes may be placed too close together, or even share the same position. We propose a solution, called the maxent-stress model, which applies the principle of maximum entropy to cope with the extra degrees of freedom. We describe a force-augmented stress majorization algorithm that solves the maxent-stress model. Numerical results show that the algorithm scales well, and provides acceptable layouts for large, nonrigid graphs. This also has potential applications to scalable algorithms for statistical multidimensional scaling (MDS) with variable distances.",
"title": "A Maxent-Stress Model for Graph Layout",
"normalizedTitle": "A Maxent-Stress Model for Graph Layout",
"fno": "ttg2013060927",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Stress",
"Layout",
"Computational Modeling",
"Entropy",
"Force",
"Springs",
"Approximation Methods",
"Low Dimensional Embedding",
"Graph Drawing",
"Metric Embedding"
],
"authors": [
{
"givenName": "E. R.",
"surname": "Gansner",
"fullName": "E. R. Gansner",
"affiliation": "AT&T Labs. Res., Florham Park, NJ, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Yifan Hu",
"fullName": "Yifan Hu",
"affiliation": "AT&T Labs. Res., Florham Park, NJ, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "S.",
"surname": "North",
"fullName": "S. North",
"affiliation": "AT&T Labs. Res., Florham Park, NJ, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2013-06-01 00:00:00",
"pubType": "trans",
"pages": "927-940",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2012/0863/0/06183576",
"title": "A maxent-stress model for graph layout",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2012/06183576/12OmNCesr7C",
"parentPublication": {
"id": "proceedings/pacificvis/2012/0863/0",
"title": "Visualization Symposium, IEEE Pacific",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2016/8942/0/8942a069",
"title": "Drawing Clustered Graphs Using Stress Majorization and Force-Directed Placements",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2016/8942a069/12OmNrMHOnz",
"parentPublication": {
"id": "proceedings/iv/2016/8942/0",
"title": "2016 20th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2003/1988/0/19880258",
"title": "Visualizing Weighted Edges in Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2003/19880258/12OmNwNwzIW",
"parentPublication": {
"id": "proceedings/iv/2003/1988/0",
"title": "Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v0821",
"title": "IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v0821/13rRUNvyat8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/09/08031987",
"title": "Joint Graph Layouts for Visualizing Collections of Segmented Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2018/09/08031987/13rRUxC0SWg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017634",
"title": "Revisiting Stress Majorization as a Unified Framework for Interactive Constrained Graph Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017634/13rRUxC0Sw3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/05/07889042",
"title": "Drawing Large Graphs by Multilevel Maxent-Stress Optimization",
"doi": null,
"abstractUrl": "/journal/tg/2018/05/07889042/13rRUxYINfn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/09/08419285",
"title": "Graph Drawing by Stochastic Gradient Descent",
"doi": null,
"abstractUrl": "/journal/tg/2019/09/08419285/13rRUyYBlgE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09814874",
"title": "Target Netgrams: An Annulus-Constrained Stress Model for Radial Graph Visualization",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09814874/1EJBn7YxwGY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904492",
"title": "Taurus: Towards a Unified Force Representation and Universal Solver for Graph Layout",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904492/1H1gf0yG0qA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013060913",
"articleId": "13rRUy0HYRp",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013060941",
"articleId": "13rRUxD9h58",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAlvHDC",
"title": "June",
"year": "2013",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuhz",
"doi": "10.1109/TVCG.2012.178",
"abstract": "We present a new algorithm for automatic layout of clustered graphs using a circular style. The algorithm tries to determine optimal location and orientation of individual clusters intrinsically within a modified spring embedder. Heuristics such as reversal of the order of nodes in a cluster and swap of neighboring node pairs in the same cluster are employed intermittently to further relax the spring embedder system, resulting in reduced inter-cluster edge crossings. Unlike other algorithms generating circular drawings, our algorithm does not require the quotient graph to be acyclic, nor does it sacrifice the edge crossing number of individual clusters to improve respective positioning of the clusters. Moreover, it reduces the total area required by a cluster by using the space inside the associated circle. Experimental results show that the execution time and quality of the produced drawings with respect to commonly accepted layout criteria are quite satisfactory, surpassing previous algorithms. The algorithm has also been successfully implemented and made publicly available as part of a compound and clustered graph editing and layout tool named Chisio.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a new algorithm for automatic layout of clustered graphs using a circular style. The algorithm tries to determine optimal location and orientation of individual clusters intrinsically within a modified spring embedder. Heuristics such as reversal of the order of nodes in a cluster and swap of neighboring node pairs in the same cluster are employed intermittently to further relax the spring embedder system, resulting in reduced inter-cluster edge crossings. Unlike other algorithms generating circular drawings, our algorithm does not require the quotient graph to be acyclic, nor does it sacrifice the edge crossing number of individual clusters to improve respective positioning of the clusters. Moreover, it reduces the total area required by a cluster by using the space inside the associated circle. Experimental results show that the execution time and quality of the produced drawings with respect to commonly accepted layout criteria are quite satisfactory, surpassing previous algorithms. The algorithm has also been successfully implemented and made publicly available as part of a compound and clustered graph editing and layout tool named Chisio.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a new algorithm for automatic layout of clustered graphs using a circular style. The algorithm tries to determine optimal location and orientation of individual clusters intrinsically within a modified spring embedder. Heuristics such as reversal of the order of nodes in a cluster and swap of neighboring node pairs in the same cluster are employed intermittently to further relax the spring embedder system, resulting in reduced inter-cluster edge crossings. Unlike other algorithms generating circular drawings, our algorithm does not require the quotient graph to be acyclic, nor does it sacrifice the edge crossing number of individual clusters to improve respective positioning of the clusters. Moreover, it reduces the total area required by a cluster by using the space inside the associated circle. Experimental results show that the execution time and quality of the produced drawings with respect to commonly accepted layout criteria are quite satisfactory, surpassing previous algorithms. The algorithm has also been successfully implemented and made publicly available as part of a compound and clustered graph editing and layout tool named Chisio.",
"title": "CiSE: A Circular Spring Embedder Layout Algorithm",
"normalizedTitle": "CiSE: A Circular Spring Embedder Layout Algorithm",
"fno": "ttg2013060953",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Layout",
"Clustering Algorithms",
"Springs",
"Force",
"Algorithm Design And Analysis",
"Software Algorithms",
"Data Visualization",
"Sequence Alignment",
"Information Visualization",
"Visualization Techniques And Methodologies",
"Visualization Systems And Software",
"Graph Algorithms",
"Algorithm Design And Analysis",
"Graph Visualization",
"Graph Drawing",
"Force Directed Layout",
"Circular Layout",
"Clustered Graphs"
],
"authors": [
{
"givenName": "U.",
"surname": "Dogrusoz",
"fullName": "U. Dogrusoz",
"affiliation": "Dept. of Comput. Eng., Bilkent Univ., Ankara, Turkey",
"__typename": "ArticleAuthorType"
},
{
"givenName": "M. E.",
"surname": "Belviranli",
"fullName": "M. E. Belviranli",
"affiliation": "Dept. of Comput. Sci. & Eng., Univ. of California, Riverside, Riverside, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "A.",
"surname": "Dilek",
"fullName": "A. Dilek",
"affiliation": "TUBITAK-BILGEM, Sci. & Technol. Res. Council of Turkey, Ankara, Turkey",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2013-06-01 00:00:00",
"pubType": "trans",
"pages": "953-966",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-infovis/2004/8779/0/87790199",
"title": "Interactive Visualization of Small World Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2004/87790199/12OmNCgrDcT",
"parentPublication": {
"id": "proceedings/ieee-infovis/2004/8779/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2012/4771/0/4771a018",
"title": "Fast Layout Computation of Hierarchically Clustered Networks: Algorithmic Advances and Experimental Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2012/4771a018/12OmNrEL2zK",
"parentPublication": {
"id": "proceedings/iv/2012/4771/0",
"title": "2012 16th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2003/1988/0/19880272",
"title": "Layout Metrics for Euler Diagrams",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2003/19880272/12OmNvD8RBs",
"parentPublication": {
"id": "proceedings/iv/2003/1988/0",
"title": "Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl/1998/8712/0/87120056",
"title": "Competitive Learning of Network Diagram Layout",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1998/87120056/12OmNyRPgyj",
"parentPublication": {
"id": "proceedings/vl/1998/8712/0",
"title": "Visual Languages, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2015/7568/0/7568a259",
"title": "Fast Graph Drawing Algorithm Revealing Networks Cores",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2015/7568a259/12OmNznCl21",
"parentPublication": {
"id": "proceedings/iv/2015/7568/0",
"title": "2015 19th International Conference on Information Visualisation (iV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nsw/2011/1049/0/06004630",
"title": "Time spring layout for visualization of dynamic social networks",
"doi": null,
"abstractUrl": "/proceedings-article/nsw/2011/06004630/12OmNzvhvAx",
"parentPublication": {
"id": "proceedings/nsw/2011/1049/0",
"title": "IEEE Network Science Workshop",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2016/8942/0/8942a094",
"title": "On Edge Bundling and Node Layout for Mutually Connected Directed Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2016/8942a094/12OmNzwZ6qg",
"parentPublication": {
"id": "proceedings/iv/2016/8942/0",
"title": "2016 20th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/01/ttg2011010101",
"title": "Automatic Metro Map Layout Using Multicriteria Optimization",
"doi": null,
"abstractUrl": "/journal/tg/2011/01/ttg2011010101/13rRUx0xPIA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09477202",
"title": "fCoSE: A Fast Compound Graph Layout Algorithm with Constraint Support",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09477202/1v2MaDZG6fC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552919",
"title": "Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552919/1xibXgJW32U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013060941",
"articleId": "13rRUxD9h58",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013060967",
"articleId": "13rRUy3gn7v",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesVM",
"name": "ttg2013060953s.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013060953s.pdf",
"extension": "pdf",
"size": "1.82 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUxC0Sw3",
"doi": "10.1109/TVCG.2017.2745919",
"abstract": "We present an improved stress majorization method that incorporates various constraints, including directional constraints without the necessity of solving a constraint optimization problem. This is achieved by reformulating the stress function to impose constraints on both the edge vectors and lengths instead of just on the edge lengths (node distances). This is a unified framework for both constrained and unconstrained graph visualizations, where we can model most existing layout constraints, as well as develop new ones such as the star shapes and cluster separation constraints within stress majorization. This improvement also allows us to parallelize computation with an efficient GPU conjugant gradient solver, which yields fast and stable solutions, even for large graphs. As a result, we allow the constraint-based exploration of large graphs with 10K nodes — an approach which previous methods cannot support.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present an improved stress majorization method that incorporates various constraints, including directional constraints without the necessity of solving a constraint optimization problem. This is achieved by reformulating the stress function to impose constraints on both the edge vectors and lengths instead of just on the edge lengths (node distances). This is a unified framework for both constrained and unconstrained graph visualizations, where we can model most existing layout constraints, as well as develop new ones such as the star shapes and cluster separation constraints within stress majorization. This improvement also allows us to parallelize computation with an efficient GPU conjugant gradient solver, which yields fast and stable solutions, even for large graphs. As a result, we allow the constraint-based exploration of large graphs with 10K nodes — an approach which previous methods cannot support.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present an improved stress majorization method that incorporates various constraints, including directional constraints without the necessity of solving a constraint optimization problem. This is achieved by reformulating the stress function to impose constraints on both the edge vectors and lengths instead of just on the edge lengths (node distances). This is a unified framework for both constrained and unconstrained graph visualizations, where we can model most existing layout constraints, as well as develop new ones such as the star shapes and cluster separation constraints within stress majorization. This improvement also allows us to parallelize computation with an efficient GPU conjugant gradient solver, which yields fast and stable solutions, even for large graphs. As a result, we allow the constraint-based exploration of large graphs with 10K nodes — an approach which previous methods cannot support.",
"title": "Revisiting Stress Majorization as a Unified Framework for Interactive Constrained Graph Visualization",
"normalizedTitle": "Revisiting Stress Majorization as a Unified Framework for Interactive Constrained Graph Visualization",
"fno": "08017634",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Stress",
"Layout",
"Visualization",
"Springs",
"Optimization",
"Computational Modeling",
"Shape",
"Graph Visualization",
"Stress Majorization",
"Constraints"
],
"authors": [
{
"givenName": "Yunhai",
"surname": "Wang",
"fullName": "Yunhai Wang",
"affiliation": "Shandong University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yanyan",
"surname": "Wang",
"fullName": "Yanyan Wang",
"affiliation": "Shandong University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yinqi",
"surname": "Sun",
"fullName": "Yinqi Sun",
"affiliation": "Shandong University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lifeng",
"surname": "Zhu",
"fullName": "Lifeng Zhu",
"affiliation": "Southeast University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kecheng",
"surname": "Lu",
"fullName": "Kecheng Lu",
"affiliation": "Shandong University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chi-Wing",
"surname": "Fu",
"fullName": "Chi-Wing Fu",
"affiliation": "VRHIT SIATChinese University of Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Sedlmair",
"fullName": "Michael Sedlmair",
"affiliation": "University of Vienna, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Oliver",
"surname": "Deussen",
"fullName": "Oliver Deussen",
"affiliation": "Konstanz University, VCC SIAT, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Baoquan",
"surname": "Chen",
"fullName": "Baoquan Chen",
"affiliation": "Shandong University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "trans",
"pages": "489-499",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2012/0863/0/06183576",
"title": "A maxent-stress model for graph layout",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2012/06183576/12OmNCesr7C",
"parentPublication": {
"id": "proceedings/pacificvis/2012/0863/0",
"title": "Visualization Symposium, IEEE Pacific",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2016/8942/0/8942a069",
"title": "Drawing Clustered Graphs Using Stress Majorization and Force-Directed Placements",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2016/8942a069/12OmNrMHOnz",
"parentPublication": {
"id": "proceedings/iv/2016/8942/0",
"title": "2016 20th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2008/3357/1/04659684",
"title": "A Topological Optimization Method Considering Stress Constraints",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2008/04659684/12OmNyQGSaY",
"parentPublication": {
"id": "proceedings/icicta/2008/3357/1",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v0821",
"title": "IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v0821/13rRUNvyat8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/06/ttg2013060927",
"title": "A Maxent-Stress Model for Graph Layout",
"doi": null,
"abstractUrl": "/journal/tg/2013/06/ttg2013060927/13rRUwj7cpa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/09/08031987",
"title": "Joint Graph Layouts for Visualizing Collections of Segmented Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2018/09/08031987/13rRUxC0SWg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2012/03/05703168",
"title": "A Framework for Layout-dependent STI Stress Analysis and Stress-aware Circuit Optimization",
"doi": null,
"abstractUrl": "/journal/si/2012/03/05703168/13rRUxNEqNc",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/05/07889042",
"title": "Drawing Large Graphs by Multilevel Maxent-Stress Optimization",
"doi": null,
"abstractUrl": "/journal/tg/2018/05/07889042/13rRUxYINfn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09814874",
"title": "Target Netgrams: An Annulus-Constrained Stress Model for Radial Graph Visualization",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09814874/1EJBn7YxwGY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904492",
"title": "Taurus: Towards a Unified Force Representation and Universal Solver for Graph Layout",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904492/1H1gf0yG0qA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08017580",
"articleId": "13rRUxCitJk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08017623",
"articleId": "13rRUyYSWt2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesQE",
"name": "ttg201801-08017634s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201801-08017634s1.zip",
"extension": "zip",
"size": "4.42 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBOUxmQ",
"title": "November/December",
"year": "2008",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "14",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyp7tWQ",
"doi": "10.1109/TVCG.2008.130",
"abstract": "A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The user explores the network by changing the focal node in the detailed view or by changing the level of detail of a node or cluster. For scalability, fast force-based layout algorithms are used for the overview and the detailed view. However, using the same layout algorithm in both views is problematic since layout for the detailed view has different requirements to that in the overview. Here we present a model in which constrained graph layout algorithms are used for layout in the detailed view. This means the detailed view has high-quality layout including sophisticated edge routing and is customisable by the user who can add placement constraints on the layout. Scalability is still ensured since the slower layout techniques are only applied to the small subgraph shown in the detailed view. The main technical innovations are techniques to ensure that the overview and detailed view remain synchronized, and modifying constrained graph layout algorithms to support smooth, stable layout. The key innovation supporting stability are new dynamic graph layout algorithms that preserve the topology or structure of the network when the user changes the focus node or the level of detail by in situ semantic zooming. We have built a prototype tool and demonstrate its use in two application domains, UML class diagrams and biological networks.\r",
"abstracts": [
{
"abstractType": "Regular",
"content": "A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The user explores the network by changing the focal node in the detailed view or by changing the level of detail of a node or cluster. For scalability, fast force-based layout algorithms are used for the overview and the detailed view. However, using the same layout algorithm in both views is problematic since layout for the detailed view has different requirements to that in the overview. Here we present a model in which constrained graph layout algorithms are used for layout in the detailed view. This means the detailed view has high-quality layout including sophisticated edge routing and is customisable by the user who can add placement constraints on the layout. Scalability is still ensured since the slower layout techniques are only applied to the small subgraph shown in the detailed view. The main technical innovations are techniques to ensure that the overview and detailed view remain synchronized, and modifying constrained graph layout algorithms to support smooth, stable layout. The key innovation supporting stability are new dynamic graph layout algorithms that preserve the topology or structure of the network when the user changes the focus node or the level of detail by in situ semantic zooming. We have built a prototype tool and demonstrate its use in two application domains, UML class diagrams and biological networks.\r",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The user explores the network by changing the focal node in the detailed view or by changing the level of detail of a node or cluster. For scalability, fast force-based layout algorithms are used for the overview and the detailed view. However, using the same layout algorithm in both views is problematic since layout for the detailed view has different requirements to that in the overview. Here we present a model in which constrained graph layout algorithms are used for layout in the detailed view. This means the detailed view has high-quality layout including sophisticated edge routing and is customisable by the user who can add placement constraints on the layout. Scalability is still ensured since the slower layout techniques are only applied to the small subgraph shown in the detailed view. The main technical innovations are techniques to ensure that the overview and detailed view remain synchronized, and modifying constrained graph layout algorithms to support smooth, stable layout. The key innovation supporting stability are new dynamic graph layout algorithms that preserve the topology or structure of the network when the user changes the focus node or the level of detail by in situ semantic zooming. We have built a prototype tool and demonstrate its use in two application domains, UML class diagrams and biological networks.\r",
"title": "Exploration of Networks using overview+detail with Constraint-based cooperative layout",
"normalizedTitle": "Exploration of Networks using overview+detail with Constraint-based cooperative layout",
"fno": "ttg2008061293",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Index Terms Graph Drawing",
"Constraints",
"Stress Majorization",
"Force Directed Algorithms",
"Multidimensional Scaling"
],
"authors": [
{
"givenName": "Tim",
"surname": "Dwyer",
"fullName": "Tim Dwyer",
"affiliation": "Microsoft Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kim",
"surname": "Marriott",
"fullName": "Kim Marriott",
"affiliation": "Monash University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Falk",
"surname": "Schreiber",
"fullName": "Falk Schreiber",
"affiliation": "IPL-Gatersleben",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter",
"surname": "Stuckey",
"fullName": "Peter Stuckey",
"affiliation": "National ICT Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Woodward",
"fullName": "Michael Woodward",
"affiliation": "The University of Melbourne",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Wybrow",
"fullName": "Michael Wybrow",
"affiliation": "Monash University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1293-1300",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-infovis/2003/2055/0/20550011",
"title": "Improving Hybrid MDS with Pivot-Based Searching",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2003/20550011/12OmNAq3hT8",
"parentPublication": {
"id": "proceedings/ieee-infovis/2003/2055/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2012/4771/0/4771a124",
"title": "Force-directed Graph Visualization with Pre-positioning - Improving Convergence Time and Quality of Layout",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2012/4771a124/12OmNBiygtD",
"parentPublication": {
"id": "proceedings/iv/2012/4771/0",
"title": "2012 16th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2003/1988/0/19880272",
"title": "Layout Metrics for Euler Diagrams",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2003/19880272/12OmNvD8RBs",
"parentPublication": {
"id": "proceedings/iv/2003/1988/0",
"title": "Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2001/1342/0/13420043",
"title": "Animated Exploration of Dynamic Graphs with Radial Layout",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2001/13420043/12OmNvq5jEv",
"parentPublication": {
"id": "proceedings/ieee-infovis/2001/1342/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl/1993/3970/0/00269619",
"title": "Constraint-driven diagram layout",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1993/00269619/12OmNwvVrCN",
"parentPublication": {
"id": "proceedings/vl/1993/3970/0",
"title": "Proceedings 1993 IEEE Symposium on Visual Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2012/4660/0/06402554",
"title": "Interactive 4D overview and detail visualization in augmented reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2012/06402554/12OmNy3iFjC",
"parentPublication": {
"id": "proceedings/ismar/2012/4660/0",
"title": "2012 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2004/8779/0/87790057",
"title": "Steerable, Progressive Multidimensional Scaling",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2004/87790057/12OmNzV70oY",
"parentPublication": {
"id": "proceedings/ieee-infovis/2004/8779/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009060889",
"title": "Constructing Overview + Detail Dendrogram-Matrix Views",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009060889/13rRUwfZC0a",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061356",
"title": "Visualizing Incomplete and Partially Ranked Data",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061356/13rRUyYBlgt",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200g670",
"title": "Generative Layout Modeling using Constraint Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200g670/1BmIILGrL1u",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "04658158",
"articleId": "13rRUNvyaeU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061301",
"articleId": "13rRUx0xPIx",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesTj",
"name": "ttg2008061293.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2008061293.mov",
"extension": "mov",
"size": "28.9 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRo",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1KaBabqZxSg",
"doi": "10.1109/TVCG.2023.3238821",
"abstract": "In this paper, we propose the t-FDP model, a force-directed placement method based on a novel bounded short-range force (t-force) defined by Student’s t-distribution. Our formulation is flexible, exerts limited repulsive forces for nearby nodes and can be adapted separately in its short- and long-range effects. Using such forces in force-directed graph layouts yields better neighborhood preservation than current methods, while maintaining low stress errors. Our efficient implementation using a Fast Fourier Transform is one order of magnitude faster than state-of-the-art methods and two orders faster on the GPU, enabling us to perform parameter tuning by globally and locally adjusting the t-force in real-time for complex graphs. We demonstrate the quality of our approach by numerical evaluation against state-of-the-art approaches and extensions for interactive exploration.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we propose the t-FDP model, a force-directed placement method based on a novel bounded short-range force (t-force) defined by Student’s t-distribution. Our formulation is flexible, exerts limited repulsive forces for nearby nodes and can be adapted separately in its short- and long-range effects. Using such forces in force-directed graph layouts yields better neighborhood preservation than current methods, while maintaining low stress errors. Our efficient implementation using a Fast Fourier Transform is one order of magnitude faster than state-of-the-art methods and two orders faster on the GPU, enabling us to perform parameter tuning by globally and locally adjusting the t-force in real-time for complex graphs. We demonstrate the quality of our approach by numerical evaluation against state-of-the-art approaches and extensions for interactive exploration.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we propose the t-FDP model, a force-directed placement method based on a novel bounded short-range force (t-force) defined by Student’s t-distribution. Our formulation is flexible, exerts limited repulsive forces for nearby nodes and can be adapted separately in its short- and long-range effects. Using such forces in force-directed graph layouts yields better neighborhood preservation than current methods, while maintaining low stress errors. Our efficient implementation using a Fast Fourier Transform is one order of magnitude faster than state-of-the-art methods and two orders faster on the GPU, enabling us to perform parameter tuning by globally and locally adjusting the t-force in real-time for complex graphs. We demonstrate the quality of our approach by numerical evaluation against state-of-the-art approaches and extensions for interactive exploration.",
"title": "Force-Directed Graph Layouts Revisited: A New Force Based on the T-Distribution",
"normalizedTitle": "Force-Directed Graph Layouts Revisited: A New Force Based on the T-Distribution",
"fno": "10024360",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Layout",
"Computational Modeling",
"Force",
"Stress",
"Springs",
"Scalability",
"Graphics Processing Units",
"FFT",
"Force Directed Placement",
"Graph Layout",
"Students T Distribution"
],
"authors": [
{
"givenName": "Fahai",
"surname": "Zhong",
"fullName": "Fahai Zhong",
"affiliation": "Department of Computer Science, Shandong University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mingliang",
"surname": "Xue",
"fullName": "Mingliang Xue",
"affiliation": "Department of Computer Science, Shandong University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jian",
"surname": "Zhang",
"fullName": "Jian Zhang",
"affiliation": "Computer Network Information Center, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fan",
"surname": "Zhang",
"fullName": "Fan Zhang",
"affiliation": "School of Computer Science and Technology, SDTBU, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rui",
"surname": "Ban",
"fullName": "Rui Ban",
"affiliation": "Intelligent Network Design Institute, CITC, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Oliver",
"surname": "Deussen",
"fullName": "Oliver Deussen",
"affiliation": "Computer and Information Science, University of Konstanz, Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yunhai",
"surname": "Wang",
"fullName": "Yunhai Wang",
"affiliation": "Department of Computer Science, Shandong University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-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/date/2005/2288/2/228820902",
"title": "An Improved Multi-Level Framework for Force-Directed Placement",
"doi": null,
"abstractUrl": "/proceedings-article/date/2005/228820902/12OmNAqkSHJ",
"parentPublication": {
"id": "proceedings/date/2005/2288/2",
"title": "Design, Automation & Test in Europe Conference & Exhibition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccd/1997/8206/0/82060752",
"title": "Dynamic bounding of successor force computations in the force directed list scheduling algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/iccd/1997/82060752/12OmNCfSqQc",
"parentPublication": {
"id": "proceedings/iccd/1997/8206/0",
"title": "Proceedings International Conference on Computer Design VLSI in Computers and Processors",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispdc/2012/2599/0/06341510",
"title": "Scalable Force Directed Graph Layout Algorithms Using Fast Multipole Methods",
"doi": null,
"abstractUrl": "/proceedings-article/ispdc/2012/06341510/12OmNx3HI8B",
"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/iv/2012/4771/0/4771a454",
"title": "A Multilevel Force-directed Graph Drawing Algorithm Using Multilevel Global Force Approximation",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2012/4771a454/12OmNy2Jt2D",
"parentPublication": {
"id": "proceedings/iv/2012/4771/0",
"title": "2012 16th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0536",
"title": "Drawing Directed Graphs Using Quadratic Programming",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0536/13rRUxZRbnT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/topoinvis/2022/9354/0/935400a081",
"title": "Untangling Force-Directed Layouts Using Persistent Homology",
"doi": null,
"abstractUrl": "/proceedings-article/topoinvis/2022/935400a081/1J2XKiZs7xS",
"parentPublication": {
"id": "proceedings/topoinvis/2022/9354/0",
"title": "2022 Topological Data Analysis and Visualization (TopoInVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10005087",
"title": "SubLinearForce: Fully Sublinear-Time Force Computation for Large Complex Graph Drawing",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10005087/1JC5yDf0E5q",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807379",
"title": "Persistent Homology Guided Force-Directed Graph Layouts",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807379/1cG6h8OkgJq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2019/2605/0/08944364",
"title": "Force-Directed Graph Layouts by Edge Sampling",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2019/08944364/1grOFicLl9S",
"parentPublication": {
"id": "proceedings/ldav/2019/2605/0",
"title": "2019 IEEE 9th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a096",
"title": "Accelerating Force-Directed Graph Drawing with RT Cores",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a096/1qROE1kZkek",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10024388",
"articleId": "1KaB9SqICWs",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10024310",
"articleId": "1KaBaMU2Iog",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1KcgXK34IGk",
"name": "ttg555501-010024360s1-supp2-3238821.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-010024360s1-supp2-3238821.mp4",
"extension": "mp4",
"size": "83.9 MB",
"__typename": "WebExtraType"
},
{
"id": "1KcgYxZCOE8",
"name": "ttg555501-010024360s1-supp1-3238821.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-010024360s1-supp1-3238821.pdf",
"extension": "pdf",
"size": "56.8 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNscfHUA",
"title": "October-December",
"year": "2007",
"issueNum": "04",
"idPrefix": "mu",
"pubType": "magazine",
"volume": "14",
"label": "October-December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjyX0Y",
"doi": "10.1109/MMUL.2007.70",
"abstract": "George Khut took an experience-centered approach in Cardiomorphologies, an interactive artwork exploring how subjectivity is a physiologically embodied phenomenon. He offers ways to think about how collaborations—between artists, programmers, researchers, and the audience—shape the experience of interactive art.",
"abstracts": [
{
"abstractType": "Regular",
"content": "George Khut took an experience-centered approach in Cardiomorphologies, an interactive artwork exploring how subjectivity is a physiologically embodied phenomenon. He offers ways to think about how collaborations—between artists, programmers, researchers, and the audience—shape the experience of interactive art.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "George Khut took an experience-centered approach in Cardiomorphologies, an interactive artwork exploring how subjectivity is a physiologically embodied phenomenon. He offers ways to think about how collaborations—between artists, programmers, researchers, and the audience—shape the experience of interactive art.",
"title": "Cardiomorphologies: An Inner Journey through Art",
"normalizedTitle": "Cardiomorphologies: An Inner Journey through Art",
"fno": "mmu2007040005",
"hasPdf": true,
"idPrefix": "mu",
"keywords": [
"Signal Processing",
"Interactive Art",
"And Biofeedback"
],
"authors": [
{
"givenName": "George Poonkhin",
"surname": "Khut",
"fullName": "George Poonkhin Khut",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2007-10-01 00:00:00",
"pubType": "mags",
"pages": "5-7",
"year": "2007",
"issn": "1070-986X",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ispaw/2011/4429/0/4429a066",
"title": "Analysis about Application of Learning System into Interactive Digital Art Implementation",
"doi": null,
"abstractUrl": "/proceedings-article/ispaw/2011/4429a066/12OmNAHmOvO",
"parentPublication": {
"id": "proceedings/ispaw/2011/4429/0",
"title": "Parallel and Distributed Processing with Applications Workshops, IEEE International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2011/4484/0/4484a039",
"title": "A Study of Interactive Art in the Narrative Form of \"Magic Monkey\"",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2011/4484a039/12OmNASILTr",
"parentPublication": {
"id": "proceedings/cgiv/2011/4484/0",
"title": "2011 Eighth International Conference Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2015/9403/0/9403a259",
"title": "Art Behind the Mind: Exploring New Art Forms by Implementation of the Electroencephalography",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2015/9403a259/12OmNBqv293",
"parentPublication": {
"id": "proceedings/cw/2015/9403/0",
"title": "2015 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/culture-computing/2013/5047/0/5047a188",
"title": "Interactive Human: Seen through Digital Art",
"doi": null,
"abstractUrl": "/proceedings-article/culture-computing/2013/5047a188/12OmNwE9OEg",
"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/2009/4800/0/05349522",
"title": "The chameleon project: An art installation exploring emotional contagion",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2009/05349522/12OmNxjjEeE",
"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": "proceedings/cgiv/2009/3789/0/3789a083",
"title": "A Framework on the Applications of Interactive Art",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2009/3789a083/12OmNylsZSB",
"parentPublication": {
"id": "proceedings/cgiv/2009/3789/0",
"title": "2009 Sixth International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2015/7568/0/7568z026",
"title": "D-Art Gallery 2015",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2015/7568z026/12OmNz6iOK6",
"parentPublication": {
"id": "proceedings/iv/2015/7568/0",
"title": "2015 19th International Conference on Information Visualisation (iV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2013/03/mcg2013030016",
"title": "Viewing Chinese Art on an Interactive Tabletop",
"doi": null,
"abstractUrl": "/magazine/cg/2013/03/mcg2013030016/13rRUxCRFQi",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2018/7202/0/720200z026",
"title": "D-Art Gallery 2018",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200z026/17D45Wuc3b4",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2022/7218/0/09859412",
"title": "Quantification of Artist Representativity within an Art Movement",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2022/09859412/1G4F25H2uDm",
"parentPublication": {
"id": "proceedings/icmew/2022/7218/0",
"title": "2022 IEEE International Conference on Multimedia and Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mmu20070400c2",
"articleId": "13rRUytWFeg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mmu2007040008",
"articleId": "13rRUyYSWpl",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzFdtc6",
"title": "November/December",
"year": "2010",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "16",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvJc",
"doi": "10.1109/TVCG.2010.148",
"abstract": "High quality volume rendering of SPH data requires a complex order-dependent resampling of particle quantities along the view rays. In this paper we present an efficient approach to perform this task using a novel view-space discretization of the simulation domain. Our method draws upon recent work on GPU-based particle voxelization for the efficient resampling of particles into uniform grids. We propose a new technique that leverages a perspective grid to adaptively discretize the view-volume, giving rise to a continuous level-of-detail sampling structure and reducing memory requirements compared to a uniform grid. In combination with a level-of-detail representation of the particle set, the perspective grid allows effectively reducing the amount of primitives to be processed at run-time. We demonstrate the quality and performance of our method for the rendering of fluid and gas dynamics SPH simulations consisting of many millions of particles.",
"abstracts": [
{
"abstractType": "Regular",
"content": "High quality volume rendering of SPH data requires a complex order-dependent resampling of particle quantities along the view rays. In this paper we present an efficient approach to perform this task using a novel view-space discretization of the simulation domain. Our method draws upon recent work on GPU-based particle voxelization for the efficient resampling of particles into uniform grids. We propose a new technique that leverages a perspective grid to adaptively discretize the view-volume, giving rise to a continuous level-of-detail sampling structure and reducing memory requirements compared to a uniform grid. In combination with a level-of-detail representation of the particle set, the perspective grid allows effectively reducing the amount of primitives to be processed at run-time. We demonstrate the quality and performance of our method for the rendering of fluid and gas dynamics SPH simulations consisting of many millions of particles.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "High quality volume rendering of SPH data requires a complex order-dependent resampling of particle quantities along the view rays. In this paper we present an efficient approach to perform this task using a novel view-space discretization of the simulation domain. Our method draws upon recent work on GPU-based particle voxelization for the efficient resampling of particles into uniform grids. We propose a new technique that leverages a perspective grid to adaptively discretize the view-volume, giving rise to a continuous level-of-detail sampling structure and reducing memory requirements compared to a uniform grid. In combination with a level-of-detail representation of the particle set, the perspective grid allows effectively reducing the amount of primitives to be processed at run-time. We demonstrate the quality and performance of our method for the rendering of fluid and gas dynamics SPH simulations consisting of many millions of particles.",
"title": "Efficient High-Quality Volume Rendering of SPH Data",
"normalizedTitle": "Efficient High-Quality Volume Rendering of SPH Data",
"fno": "ttg2010061533",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Particle Visualization",
"Volume Rendering",
"Ray Casting",
"GPU Resampling"
],
"authors": [
{
"givenName": "Roland",
"surname": "Fraedrich",
"fullName": "Roland Fraedrich",
"affiliation": "Technische Universität München",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefan",
"surname": "Auer",
"fullName": "Stefan Auer",
"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": "2010-11-01 00:00:00",
"pubType": "trans",
"pages": "1533-1540",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/apvis/2007/0808/0/04126230",
"title": "Particle-based volume rendering",
"doi": null,
"abstractUrl": "/proceedings-article/apvis/2007/04126230/12OmNCeaPW4",
"parentPublication": {
"id": "proceedings/apvis/2007/0808/0",
"title": "Asia-Pacific Symposium on Visualisation 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scala/2016/5222/0/07836590",
"title": "Effective Dynamic Load Balance using Space-Filling Curves for Large-Scale SPH Simulations on GPU-rich Supercomputers",
"doi": null,
"abstractUrl": "/proceedings-article/scala/2016/07836590/12OmNCmpcV6",
"parentPublication": {
"id": "proceedings/scala/2016/5222/0",
"title": "2016 7th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems (ScalA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/svr/2017/3588/0/3588a309",
"title": "Screen Space Rendering Solution for Multiphase SPH Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2017/3588a309/12OmNvs4vmP",
"parentPublication": {
"id": "proceedings/svr/2017/3588/0",
"title": "2017 19th Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/esiat/2009/3682/2/3682b575",
"title": "Rapid Texture-based Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/esiat/2009/3682b575/12OmNx7G5VW",
"parentPublication": {
"id": "esiat/2009/3682/2",
"title": "Environmental Science and Information Application Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cscs/2017/1839/0/07968572",
"title": "Comparison between Incompressible SPH Solvers",
"doi": null,
"abstractUrl": "/proceedings-article/cscs/2017/07968572/12OmNzV70Gn",
"parentPublication": {
"id": "proceedings/cscs/2017/1839/0",
"title": "2017 21st International Conference on Control Systems and Computer Science (CSCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccet/2009/3521/1/3521a182",
"title": "Implementation and Improvement Based on Shear-Warp Volume Rendering Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/iccet/2009/3521a182/12OmNzVoBsM",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061579",
"title": "Interactive Volume Rendering of Functional Representations in Quantum Chemistry",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061579/13rRUwgQpDq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/06/ttg2012060925",
"title": "A Versatile Optical Model for Hybrid Rendering of Volume Data",
"doi": null,
"abstractUrl": "/journal/tg/2012/06/ttg2012060925/13rRUwjGoFX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/04/ttg2008040797",
"title": "Two-Way Coupled SPH and Particle Level Set Fluid Simulation",
"doi": null,
"abstractUrl": "/journal/tg/2008/04/ttg2008040797/13rRUxE04tu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/03/ttg2014030426",
"title": "Implicit Incompressible SPH",
"doi": null,
"abstractUrl": "/journal/tg/2014/03/ttg2014030426/13rRUxYrbMg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010061525",
"articleId": "13rRUxAATgs",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010061541",
"articleId": "13rRUB6Sq0w",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgI5",
"name": "ttg2010061533s1.avi",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2010061533s1.avi",
"extension": "avi",
"size": "46.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrMZpqR",
"title": "November/December",
"year": "2004",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "10",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwbaqUG",
"doi": "10.1109/TVCG.2004.46",
"abstract": "We present a threads and halos representation for interactive volume rendering of vector-field structure and describe a number of additional components that combine to create effective visualizations of multivalued 3D scientific data. After filtering linear structures, such as flow lines, into a volume representation, we use a multilayer volume rendering approach to simultaneously display this derived volume along with other data values. We demonstrate the utility of threads and halos in clarifying depth relationships within dense renderings and we present results from two scientific applications: visualization of second-order tensor valued magnetic resonance imaging (MRI) data and simulated 3D fluid flow data. In both application areas, the interactivity of the visualizations proved to be important to the domain scientists. Finally, we describe a PC-based implementation of our framework along with domain specific transfer functions, including an exploratory data culling tool, that enable fast data exploration.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a threads and halos representation for interactive volume rendering of vector-field structure and describe a number of additional components that combine to create effective visualizations of multivalued 3D scientific data. After filtering linear structures, such as flow lines, into a volume representation, we use a multilayer volume rendering approach to simultaneously display this derived volume along with other data values. We demonstrate the utility of threads and halos in clarifying depth relationships within dense renderings and we present results from two scientific applications: visualization of second-order tensor valued magnetic resonance imaging (MRI) data and simulated 3D fluid flow data. In both application areas, the interactivity of the visualizations proved to be important to the domain scientists. Finally, we describe a PC-based implementation of our framework along with domain specific transfer functions, including an exploratory data culling tool, that enable fast data exploration.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a threads and halos representation for interactive volume rendering of vector-field structure and describe a number of additional components that combine to create effective visualizations of multivalued 3D scientific data. After filtering linear structures, such as flow lines, into a volume representation, we use a multilayer volume rendering approach to simultaneously display this derived volume along with other data values. We demonstrate the utility of threads and halos in clarifying depth relationships within dense renderings and we present results from two scientific applications: visualization of second-order tensor valued magnetic resonance imaging (MRI) data and simulated 3D fluid flow data. In both application areas, the interactivity of the visualizations proved to be important to the domain scientists. Finally, we describe a PC-based implementation of our framework along with domain specific transfer functions, including an exploratory data culling tool, that enable fast data exploration.",
"title": "Interactive Volume Rendering of Thin Thread Structures within Multivalued Scientific Data Sets",
"normalizedTitle": "Interactive Volume Rendering of Thin Thread Structures within Multivalued Scientific Data Sets",
"fno": "v0664",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Scientific Visualization",
"Diffusion Tensor Imaging DTI",
"Fluid Flow Visualization",
"Medical Imaging",
"Direct Volume Rendering",
"Volume Graphics",
"Volume Shading",
"Multitextures",
"PC Graphics Hardware"
],
"authors": [
{
"givenName": "Andreas",
"surname": "Wenger",
"fullName": "Andreas Wenger",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel F.",
"surname": "Keefe",
"fullName": "Daniel F. Keefe",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Song",
"surname": "Zhang",
"fullName": "Song Zhang",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "David H.",
"surname": "Laidlaw",
"fullName": "David H. Laidlaw",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2004-11-01 00:00:00",
"pubType": "trans",
"pages": "664-672",
"year": "2004",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2002/7498/0/7498kniss",
"title": "Interactive Translucent Volume Rendering and Procedural Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498kniss/12OmNB0X8rO",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780037",
"title": "Volume Illustration: Non-Photorealistic Rendering of Volume Models",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780037/12OmNC0y5FO",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"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/vv/2002/7641/0/76410131",
"title": "Shading for Fourier Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/vv/2002/76410131/12OmNCwlajb",
"parentPublication": {
"id": "proceedings/vv/2002/7641/0",
"title": "Volume Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200dong",
"title": "Volume Rendering of Fine Details Within Medical Data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200dong/12OmNx6xHlc",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__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": "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/2009/06/ttg2009061299",
"title": "Depth-Dependent Halos: Illustrative Rendering of Dense Line Data",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061299/13rRUEgs2LX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2003/02/v0127",
"title": "Illustrative Interactive Stipple Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2003/02/v0127/13rRUIIVlcA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2001/03/v0253",
"title": "Volume Illustration: Nonphotorealistic Rendering of Volume Models",
"doi": null,
"abstractUrl": "/journal/tg/2001/03/v0253/13rRUxbTMyH",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0649",
"articleId": "13rRUNvgz9z",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0673",
"articleId": "13rRUIM2VBw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvwoO0",
"title": "June",
"year": "2012",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjGoFX",
"doi": "10.1109/TVCG.2011.113",
"abstract": "In volume rendering, most optical models currently in use are based on the assumptions that a volumetric object is a collection of particles and that the macro behavior of particles, when they interact with light rays, can be predicted based on the behavior of each individual particle. However, such models are not capable of characterizing the collective optical effect of a collection of particles which dominates the appearance of the boundaries of dense objects. In this paper, we propose a generalized optical model that combines particle elements and surface elements together to characterize both the behavior of individual particles and the collective effect of particles. The framework based on a new model provides a more powerful and flexible tool for hybrid rendering of isosurfaces and transparent clouds of particles in a single scene. It also provides a more rational basis for shading, so the problem of normal-based shading in homogeneous regions encountered in conventional volume rendering can be easily avoided. The model can be seen as an extension to the classical model. It can be implemented easily, and most of the advanced numerical estimation methods previously developed specifically for the particle-based optical model, such as preintegration, can be applied to the new model to achieve high-quality rendering results.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In volume rendering, most optical models currently in use are based on the assumptions that a volumetric object is a collection of particles and that the macro behavior of particles, when they interact with light rays, can be predicted based on the behavior of each individual particle. However, such models are not capable of characterizing the collective optical effect of a collection of particles which dominates the appearance of the boundaries of dense objects. In this paper, we propose a generalized optical model that combines particle elements and surface elements together to characterize both the behavior of individual particles and the collective effect of particles. The framework based on a new model provides a more powerful and flexible tool for hybrid rendering of isosurfaces and transparent clouds of particles in a single scene. It also provides a more rational basis for shading, so the problem of normal-based shading in homogeneous regions encountered in conventional volume rendering can be easily avoided. The model can be seen as an extension to the classical model. It can be implemented easily, and most of the advanced numerical estimation methods previously developed specifically for the particle-based optical model, such as preintegration, can be applied to the new model to achieve high-quality rendering results.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In volume rendering, most optical models currently in use are based on the assumptions that a volumetric object is a collection of particles and that the macro behavior of particles, when they interact with light rays, can be predicted based on the behavior of each individual particle. However, such models are not capable of characterizing the collective optical effect of a collection of particles which dominates the appearance of the boundaries of dense objects. In this paper, we propose a generalized optical model that combines particle elements and surface elements together to characterize both the behavior of individual particles and the collective effect of particles. The framework based on a new model provides a more powerful and flexible tool for hybrid rendering of isosurfaces and transparent clouds of particles in a single scene. It also provides a more rational basis for shading, so the problem of normal-based shading in homogeneous regions encountered in conventional volume rendering can be easily avoided. The model can be seen as an extension to the classical model. It can be implemented easily, and most of the advanced numerical estimation methods previously developed specifically for the particle-based optical model, such as preintegration, can be applied to the new model to achieve high-quality rendering results.",
"title": "A Versatile Optical Model for Hybrid Rendering of Volume Data",
"normalizedTitle": "A Versatile Optical Model for Hybrid Rendering of Volume Data",
"fno": "ttg2012060925",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Direct Volume Rendering",
"Optical Models",
"Isosurfaces",
"Preintegration",
"Ray Casting",
"Transfer Function"
],
"authors": [
{
"givenName": "Fei",
"surname": "Yang",
"fullName": "Fei Yang",
"affiliation": "Institute of Automation Chinese Academy of Sciences, Beijing",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qingde",
"surname": "Li",
"fullName": "Qingde Li",
"affiliation": "University of Hull, Hull",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dehui",
"surname": "Xiang",
"fullName": "Dehui Xiang",
"affiliation": "Institute of Automation Chinese Academy of Sciences, Beijing",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yong",
"surname": "Cao",
"fullName": "Yong Cao",
"affiliation": "Virginia Polytechnic Institute and State University, Blacksburg",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jie",
"surname": "Tian",
"fullName": "Jie Tian",
"affiliation": "Institute of Automation, Chinese Academy of Sciences, Beijing",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2012-06-01 00:00:00",
"pubType": "trans",
"pages": "925-937",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2003/2030/0/20300038",
"title": "Acceleration Techniques for GPU-based Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300038/12OmNC2xhD8",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apvis/2007/0808/0/04126230",
"title": "Particle-based volume rendering",
"doi": null,
"abstractUrl": "/proceedings-article/apvis/2007/04126230/12OmNCeaPW4",
"parentPublication": {
"id": "proceedings/apvis/2007/0808/0",
"title": "Asia-Pacific Symposium on Visualisation 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/esiat/2009/3682/2/3682b575",
"title": "Rapid Texture-based Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/esiat/2009/3682b575/12OmNx7G5VW",
"parentPublication": {
"id": "esiat/2009/3682/2",
"title": "Environmental Science and Information Application Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2011/4602/0/4602a158",
"title": "An Adaptive Sampling Based Parallel Volume Rendering Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2011/4602a158/12OmNxE2mHp",
"parentPublication": {
"id": "proceedings/icvrv/2011/4602/0",
"title": "2011 International Conference on Virtual Reality and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vv/1998/9180/0/91800063",
"title": "Edge Preservation in Volume Rendering Using Splatting",
"doi": null,
"abstractUrl": "/proceedings-article/vv/1998/91800063/12OmNzJbQVc",
"parentPublication": {
"id": "proceedings/vv/1998/9180/0",
"title": "Volume Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/alpit/2007/2930/0/2930a282",
"title": "Self-Adaptive Slices of 3D Texture Real-Time Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/alpit/2007/2930a282/12OmNzd7c2j",
"parentPublication": {
"id": "proceedings/alpit/2007/2930/0",
"title": "Advanced Language Processing and Web Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/08/ttg2013081264",
"title": "Advanced Interactive Preintegrated Volume Rendering with a Power Series",
"doi": null,
"abstractUrl": "/journal/tg/2013/08/ttg2013081264/13rRUwIF6dR",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061533",
"title": "Efficient High-Quality Volume Rendering of SPH Data",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061533/13rRUwInvJc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061505",
"title": "Direct Interval Volume Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061505/13rRUxcsYLN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061487",
"title": "Pre-Integrated Volume Rendering with Non-Linear Gradient Interpolation",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061487/13rRUyuNswV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012060914",
"articleId": "13rRUyfbwqF",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012060938",
"articleId": "13rRUxlgxOj",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFu5",
"name": "ttg2012060925s.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012060925s.pdf",
"extension": "pdf",
"size": "92.9 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAnuTvo",
"title": "Nov.",
"year": "2016",
"issueNum": "11",
"idPrefix": "tg",
"pubType": "journal",
"volume": "22",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxYIN4c",
"doi": "10.1109/TVCG.2015.2509996",
"abstract": "The physical world consists of spatially varying media, such as the atmosphere and the ocean, in which light and sound propagates along non-linear trajectories. This presents a challenge to existing ray-tracing based methods, which are widely adopted to simulate propagation due to their efficiency and flexibility, but assume linear rays. We present a novel algorithm that traces analytic ray curves computed from local media gradients, and utilizes the closed-form solutions of both the intersections of the ray curves with planar surfaces, and the travel distance. By constructing an adaptive unstructured mesh, our algorithm is able to model general media profiles that vary in three dimensions with complex boundaries consisting of terrains and other scene objects such as buildings. Our analytic ray curve tracer with the adaptive mesh improves the efficiency considerably over prior methods. We highlight the algorithm’s application on simulation of visual and sound propagation in outdoor scenes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The physical world consists of spatially varying media, such as the atmosphere and the ocean, in which light and sound propagates along non-linear trajectories. This presents a challenge to existing ray-tracing based methods, which are widely adopted to simulate propagation due to their efficiency and flexibility, but assume linear rays. We present a novel algorithm that traces analytic ray curves computed from local media gradients, and utilizes the closed-form solutions of both the intersections of the ray curves with planar surfaces, and the travel distance. By constructing an adaptive unstructured mesh, our algorithm is able to model general media profiles that vary in three dimensions with complex boundaries consisting of terrains and other scene objects such as buildings. Our analytic ray curve tracer with the adaptive mesh improves the efficiency considerably over prior methods. We highlight the algorithm’s application on simulation of visual and sound propagation in outdoor scenes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The physical world consists of spatially varying media, such as the atmosphere and the ocean, in which light and sound propagates along non-linear trajectories. This presents a challenge to existing ray-tracing based methods, which are widely adopted to simulate propagation due to their efficiency and flexibility, but assume linear rays. We present a novel algorithm that traces analytic ray curves computed from local media gradients, and utilizes the closed-form solutions of both the intersections of the ray curves with planar surfaces, and the travel distance. By constructing an adaptive unstructured mesh, our algorithm is able to model general media profiles that vary in three dimensions with complex boundaries consisting of terrains and other scene objects such as buildings. Our analytic ray curve tracer with the adaptive mesh improves the efficiency considerably over prior methods. We highlight the algorithm’s application on simulation of visual and sound propagation in outdoor scenes.",
"title": "Tracing Analytic Ray Curves for Light and Sound Propagation in Non-Linear Media",
"normalizedTitle": "Tracing Analytic Ray Curves for Light and Sound Propagation in Non-Linear Media",
"fno": "07360212",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Media",
"Atmospheric Modeling",
"Ray Tracing",
"Mathematical Model",
"Trajectory",
"Computational Modeling",
"Acoustics"
],
"authors": [
{
"givenName": "Qi",
"surname": "Mo",
"fullName": "Qi Mo",
"affiliation": "Department of Computer Science, University of North Carolina, Chapel Hill, NC",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hengchin",
"surname": "Yeh",
"fullName": "Hengchin Yeh",
"affiliation": "Department of Computer Science, University of North Carolina, Chapel Hill, NC",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dinesh",
"surname": "Manocha",
"fullName": "Dinesh Manocha",
"affiliation": "Department of Computer Science, University of North Carolina, Chapel Hill, NC",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2016-11-01 00:00:00",
"pubType": "trans",
"pages": "2493-2506",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/rt/2008/2741/0/04634643",
"title": "Ray tracing NPR-style feature lines",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2008/04634643/12OmNqAU6Br",
"parentPublication": {
"id": "proceedings/rt/2008/2741/0",
"title": "Symposium on Interactive Ray Tracing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2003/1845/0/18450272",
"title": "Ray Tracing Point Set Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2003/18450272/12OmNqGRG73",
"parentPublication": {
"id": "proceedings/smi/2003/1845/0",
"title": "Shape Modeling and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2005/9331/0/01521622",
"title": "The sound wave ray-space",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2005/01521622/12OmNvnwVmC",
"parentPublication": {
"id": "proceedings/icme/2005/9331/0",
"title": "2005 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a087",
"title": "SIMD Friendly Ray Tracing on GPU",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a087/12OmNxFaLiE",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmcs/1999/0253/2/02530819",
"title": "A Scalable System for 3D Audio Ray Tracing",
"doi": null,
"abstractUrl": "/proceedings-article/icmcs/1999/02530819/12OmNxecS0l",
"parentPublication": {
"id": "proceedings/icmcs/1999/0253/2",
"title": "Multimedia Computing and Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2005/9330/0/01500343",
"title": "Ray tracing on the desktop: when and how?",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2005/01500343/12OmNyjccyJ",
"parentPublication": {
"id": "proceedings/cgi/2005/9330/0",
"title": "Computer Graphics International 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/04/08307458",
"title": "Diffraction Kernels for Interactive Sound Propagation in Dynamic Environments",
"doi": null,
"abstractUrl": "/journal/tg/2018/04/08307458/13rRUwh80Hk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1998/03/v0202",
"title": "Ray-Tracing Triangular Trimmed Free-Form Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/1998/03/v0202/13rRUwhpBDW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111797",
"title": "Guided Multiview Ray Tracing for Fast Auralization",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111797/13rRUxAAST4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2014/10/06784142",
"title": "Statistical Inverse Ray Tracing for Image-Based 3D Modeling",
"doi": null,
"abstractUrl": "/journal/tp/2014/10/06784142/13rRUzp02ps",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07364293",
"articleId": "13rRUwvBy8Y",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzmclnG",
"title": "April-June",
"year": "2002",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "8",
"label": "April-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwbs2aS",
"doi": "10.1109/2945.998666",
"abstract": "This paper concerns stereoscopic virtual reality displays in which the head is tracked and the display is stationary, attached to a desk, tabletop, or wall. These are called stereoscopic HTDs (Head-Tracked Display). Stereoscopic displays render two perspective views of a scene, each of which is seen by one eye of the user. Ideally, the user's natural visual system combines the stereo image pair into a single, 3D perceived image. Unfortunately, users often have difficulty fusing the stereo image pair. Researchers use a number of software techniques to reduce fusion problems. This paper geometrically examines and compares a number of these techniques and reaches the following conclusions: In interactive stereoscopic applications, the combination of view placement, scale, and either false eye separation or \\alpha{\\hbox{-}}{\\rm false} eye separation can provide fusion control geometrically similar to image shifting and image scaling. However, in stereo HTDs, image shifting and image scaling also generate additional geometric artifacts not generated by the other methods. We anecdotally link some of these artifacts to exceeding perceptual limitations of human vision. While formal perceptual studies are still needed, geometric analysis suggests that image shifting and image scaling may be less appropriate than the other methods for interactive, stereo HTDs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper concerns stereoscopic virtual reality displays in which the head is tracked and the display is stationary, attached to a desk, tabletop, or wall. These are called stereoscopic HTDs (Head-Tracked Display). Stereoscopic displays render two perspective views of a scene, each of which is seen by one eye of the user. Ideally, the user's natural visual system combines the stereo image pair into a single, 3D perceived image. Unfortunately, users often have difficulty fusing the stereo image pair. Researchers use a number of software techniques to reduce fusion problems. This paper geometrically examines and compares a number of these techniques and reaches the following conclusions: In interactive stereoscopic applications, the combination of view placement, scale, and either false eye separation or \\alpha{\\hbox{-}}{\\rm false} eye separation can provide fusion control geometrically similar to image shifting and image scaling. However, in stereo HTDs, image shifting and image scaling also generate additional geometric artifacts not generated by the other methods. We anecdotally link some of these artifacts to exceeding perceptual limitations of human vision. While formal perceptual studies are still needed, geometric analysis suggests that image shifting and image scaling may be less appropriate than the other methods for interactive, stereo HTDs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper concerns stereoscopic virtual reality displays in which the head is tracked and the display is stationary, attached to a desk, tabletop, or wall. These are called stereoscopic HTDs (Head-Tracked Display). Stereoscopic displays render two perspective views of a scene, each of which is seen by one eye of the user. Ideally, the user's natural visual system combines the stereo image pair into a single, 3D perceived image. Unfortunately, users often have difficulty fusing the stereo image pair. Researchers use a number of software techniques to reduce fusion problems. This paper geometrically examines and compares a number of these techniques and reaches the following conclusions: In interactive stereoscopic applications, the combination of view placement, scale, and either false eye separation or \\alpha{\\hbox{-}}{\\rm false} eye separation can provide fusion control geometrically similar to image shifting and image scaling. However, in stereo HTDs, image shifting and image scaling also generate additional geometric artifacts not generated by the other methods. We anecdotally link some of these artifacts to exceeding perceptual limitations of human vision. While formal perceptual studies are still needed, geometric analysis suggests that image shifting and image scaling may be less appropriate than the other methods for interactive, stereo HTDs.",
"title": "A Geometric Comparison of Algorithms for Fusion Control in Stereoscopic HTDs",
"normalizedTitle": "A Geometric Comparison of Algorithms for Fusion Control in Stereoscopic HTDs",
"fno": "v0129",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Virtual Reality",
"Stereoscopic Display",
"Head Tracking",
"Distortion"
],
"authors": [
{
"givenName": "Z.",
"surname": "Wartell",
"fullName": "Z. Wartell",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "L.F.",
"surname": "Hodges",
"fullName": "L.F. Hodges",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "W.",
"surname": "Ribarsky",
"fullName": "W. Ribarsky",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2002-04-01 00:00:00",
"pubType": "trans",
"pages": "129-143",
"year": "2002",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0119",
"articleId": "13rRUyeTVhR",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0144",
"articleId": "13rRUwIF6dD",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNznkK6H",
"title": "January-February",
"year": "2004",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "10",
"label": "January-February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyYBlgp",
"doi": "10.1109/TVCG.2004.1260755",
"abstract": "Abstract—We present an efficient stereoscopic rendering algorithm supporting interactive navigation through large-scale 3D voxel-based environments. In this algorithm, most of the pixel values of the right image are derived from the left image by a fast 3D warping based on a specific stereoscopic projection geometry. An accelerated volumetric ray casting then fills the remaining gaps in the warped right image. Our algorithm has been parallelized on a multiprocessor by employing effective task partitioning schemes and achieved a high cache coherency and load balancing. We also extend our stereoscopic rendering to include view-dependent shading and transparency effects. We have applied our algorithm in two virtual navigation systems, flythrough over terrain and virtual colonoscopy, and reached interactive stereoscopic rendering rates of more than 10 frames per second on a 16-processor SGI Challenge.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—We present an efficient stereoscopic rendering algorithm supporting interactive navigation through large-scale 3D voxel-based environments. In this algorithm, most of the pixel values of the right image are derived from the left image by a fast 3D warping based on a specific stereoscopic projection geometry. An accelerated volumetric ray casting then fills the remaining gaps in the warped right image. Our algorithm has been parallelized on a multiprocessor by employing effective task partitioning schemes and achieved a high cache coherency and load balancing. We also extend our stereoscopic rendering to include view-dependent shading and transparency effects. We have applied our algorithm in two virtual navigation systems, flythrough over terrain and virtual colonoscopy, and reached interactive stereoscopic rendering rates of more than 10 frames per second on a 16-processor SGI Challenge.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—We present an efficient stereoscopic rendering algorithm supporting interactive navigation through large-scale 3D voxel-based environments. In this algorithm, most of the pixel values of the right image are derived from the left image by a fast 3D warping based on a specific stereoscopic projection geometry. An accelerated volumetric ray casting then fills the remaining gaps in the warped right image. Our algorithm has been parallelized on a multiprocessor by employing effective task partitioning schemes and achieved a high cache coherency and load balancing. We also extend our stereoscopic rendering to include view-dependent shading and transparency effects. We have applied our algorithm in two virtual navigation systems, flythrough over terrain and virtual colonoscopy, and reached interactive stereoscopic rendering rates of more than 10 frames per second on a 16-processor SGI Challenge.",
"title": "Interactive Stereoscopic Rendering of Volumetric Environments",
"normalizedTitle": "Interactive Stereoscopic Rendering of Volumetric Environments",
"fno": "v0015",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"3 D Voxel Based Environment",
"Stereoscopic Rendering",
"Ray Casting",
"3 D Warping",
"Splatting",
"Antialiasing",
"Virtual Flythrough",
"Virtual Colonoscopy"
],
"authors": [
{
"givenName": "Ming",
"surname": "Wan",
"fullName": "Ming Wan",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nan",
"surname": "Zhang",
"fullName": "Nan Zhang",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Qu",
"fullName": "Huamin Qu",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Arie E.",
"surname": "Kaufman",
"fullName": "Arie E. Kaufman",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2004-01-01 00:00:00",
"pubType": "trans",
"pages": "15-28",
"year": "2004",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0002",
"articleId": "13rRUwwaKsV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0029",
"articleId": "13rRUyY28Yi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1L8lPE0ODrG",
"title": "April",
"year": "2023",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1A4SvXrJO2k",
"doi": "10.1109/TVCG.2022.3141764",
"abstract": "For Reeb graph extraction on surfaces, existing methods always use the isolines of a function defined on the surface to detect the surface components and the neighboring relationships between them. Since such detection is unstable, it is still a challenge for the extracted Reeb graphs to stably and concisely encode the topological information of the surface. In this article, we address this challenge by using foliation leaves to extract Reeb graphs. In particular, we employ a method for generating measured harmonic foliations by defining loops for foliation initialization and diffusing leaves from loops over the surface. We demonstrate that when the loops are determined, the neighboring relationships between the leaves from different loops are fixed. Thus, we can use loops to represent surface components for robustly detecting the interrelationships between surface components. As a result, we are able to extract stable and concise Reeb graphs. We developed novel measures for loop determination and improved foliation generation, and our method allows the user to manually prescribe loops for generating Reeb graphs with desired structures. Therefore, the potential of Reeb graphs for representing surfaces is enhanced, including conveniently representing the symmetries of the surface and ignoring topological noise. This is verified by our experimental results which indicate that our Reeb graphs are compact and expressive, promoting shape analysis.",
"abstracts": [
{
"abstractType": "Regular",
"content": "For Reeb graph extraction on surfaces, existing methods always use the isolines of a function defined on the surface to detect the surface components and the neighboring relationships between them. Since such detection is unstable, it is still a challenge for the extracted Reeb graphs to stably and concisely encode the topological information of the surface. In this article, we address this challenge by using foliation leaves to extract Reeb graphs. In particular, we employ a method for generating measured harmonic foliations by defining loops for foliation initialization and diffusing leaves from loops over the surface. We demonstrate that when the loops are determined, the neighboring relationships between the leaves from different loops are fixed. Thus, we can use loops to represent surface components for robustly detecting the interrelationships between surface components. As a result, we are able to extract stable and concise Reeb graphs. We developed novel measures for loop determination and improved foliation generation, and our method allows the user to manually prescribe loops for generating Reeb graphs with desired structures. Therefore, the potential of Reeb graphs for representing surfaces is enhanced, including conveniently representing the symmetries of the surface and ignoring topological noise. This is verified by our experimental results which indicate that our Reeb graphs are compact and expressive, promoting shape analysis.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "For Reeb graph extraction on surfaces, existing methods always use the isolines of a function defined on the surface to detect the surface components and the neighboring relationships between them. Since such detection is unstable, it is still a challenge for the extracted Reeb graphs to stably and concisely encode the topological information of the surface. In this article, we address this challenge by using foliation leaves to extract Reeb graphs. In particular, we employ a method for generating measured harmonic foliations by defining loops for foliation initialization and diffusing leaves from loops over the surface. We demonstrate that when the loops are determined, the neighboring relationships between the leaves from different loops are fixed. Thus, we can use loops to represent surface components for robustly detecting the interrelationships between surface components. As a result, we are able to extract stable and concise Reeb graphs. We developed novel measures for loop determination and improved foliation generation, and our method allows the user to manually prescribe loops for generating Reeb graphs with desired structures. Therefore, the potential of Reeb graphs for representing surfaces is enhanced, including conveniently representing the symmetries of the surface and ignoring topological noise. This is verified by our experimental results which indicate that our Reeb graphs are compact and expressive, promoting shape analysis.",
"title": "Using Foliation Leaves to Extract Reeb Graphs on Surfaces",
"normalizedTitle": "Using Foliation Leaves to Extract Reeb Graphs on Surfaces",
"fno": "09677901",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Geometry",
"Feature Extraction",
"Graph Theory",
"Shape Recognition",
"Topology",
"Foliation Generation",
"Foliation Initialization",
"Foliation Leaves",
"Harmonic Foliation Measurement",
"Leaf Diffusion",
"Loop Determination",
"Reeb Graph Extraction",
"Shape Analysis",
"Surface Component Detection",
"Topological Noise",
"Harmonic Analysis",
"Surface Treatment",
"Shape",
"Level Set",
"Task Analysis",
"Skeleton",
"Manifolds",
"Reeb Graph",
"Topology",
"Foliation"
],
"authors": [
{
"givenName": "Shaodong",
"surname": "Wang",
"fullName": "Shaodong Wang",
"affiliation": "State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wencheng",
"surname": "Wang",
"fullName": "Wencheng Wang",
"affiliation": "State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hui",
"surname": "Zhao",
"fullName": "Hui Zhao",
"affiliation": "State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "2117-2131",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dpvt/2006/2825/0/282500105",
"title": "Invariant High Level Reeb Graphs of 3D Polygonal Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/3dpvt/2006/282500105/12OmNAndipH",
"parentPublication": {
"id": "proceedings/3dpvt/2006/2825/0",
"title": "Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032a938",
"title": "Surface Registration via Foliation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032a938/12OmNB0X8tQ",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2008/2339/0/04563018",
"title": "Anisotropic Laplace-Beltrami eigenmaps: Bridging Reeb graphs and skeletons",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2008/04563018/12OmNBO3K32",
"parentPublication": {
"id": "proceedings/cvprw/2008/2339/0",
"title": "2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2002/1862/0/18620465",
"title": "Topological Morphing Using Reeb Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2002/18620465/12OmNCwCLpE",
"parentPublication": {
"id": "proceedings/cw/2002/1862/0",
"title": "First International Symposium on Cyber Worlds, 2002. Proceedings.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2012/4814/0/4814a178",
"title": "Three Dimensional Sketch for a Landscape Using Morse Theory and Reeb Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2012/4814a178/12OmNwE9Oqe",
"parentPublication": {
"id": "proceedings/cw/2012/4814/0",
"title": "2012 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/01/ttg2012010146",
"title": "Output-Sensitive Construction of Reeb Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2012/01/ttg2012010146/13rRUwvBy8S",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539583",
"title": "Jacobi Fiber Surfaces for Bivariate Reeb Space Computation",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539583/13rRUx0xPif",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/02/ttg2013020249",
"title": "Computing Reeb Graphs as a Union of Contour Trees",
"doi": null,
"abstractUrl": "/journal/tg/2013/02/ttg2013020249/13rRUxDqS8h",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061177",
"title": "Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061177/13rRUyY28Yo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09672732",
"articleId": "1zWzK5oj3fa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09678000",
"articleId": "1A4SuYWCI7K",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzmclVD",
"title": "Oct.",
"year": "2016",
"issueNum": "10",
"idPrefix": "tg",
"pubType": "journal",
"volume": "22",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwIF6l9",
"doi": "10.1109/TVCG.2016.2516990",
"abstract": "We present an algorithm to accelerate resolution independent curve rendering on mobile GPUs. Recent trends in graphics hardware have created a plethora of compressed texture formats specific to GPU manufacturers. However, certain implementations of platform independent path rendering require generating grayscale textures on the CPU containing the extent that each pixel is covered by the curve. In this paper, we demonstrate that generating a compressed grayscale texture prior to uploading it to the GPU creates faster rendering times in addition to the memory savings. We implement a real-time compression technique for coverage masks and compare our results against the GPU-based implementation of the highly optimized Skia rendering library. We also analyze the worst case properties of our compression algorithms. We observe up to a 2Z_$\\times$_Z speed improvement over the existing GPU-based methods in addition to up to a 9:1 improvement in GPU memory gains. We demonstrate the performance on multiple mobile platforms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present an algorithm to accelerate resolution independent curve rendering on mobile GPUs. Recent trends in graphics hardware have created a plethora of compressed texture formats specific to GPU manufacturers. However, certain implementations of platform independent path rendering require generating grayscale textures on the CPU containing the extent that each pixel is covered by the curve. In this paper, we demonstrate that generating a compressed grayscale texture prior to uploading it to the GPU creates faster rendering times in addition to the memory savings. We implement a real-time compression technique for coverage masks and compare our results against the GPU-based implementation of the highly optimized Skia rendering library. We also analyze the worst case properties of our compression algorithms. We observe up to a 2$\\times$ speed improvement over the existing GPU-based methods in addition to up to a 9:1 improvement in GPU memory gains. We demonstrate the performance on multiple mobile platforms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present an algorithm to accelerate resolution independent curve rendering on mobile GPUs. Recent trends in graphics hardware have created a plethora of compressed texture formats specific to GPU manufacturers. However, certain implementations of platform independent path rendering require generating grayscale textures on the CPU containing the extent that each pixel is covered by the curve. In this paper, we demonstrate that generating a compressed grayscale texture prior to uploading it to the GPU creates faster rendering times in addition to the memory savings. We implement a real-time compression technique for coverage masks and compare our results against the GPU-based implementation of the highly optimized Skia rendering library. We also analyze the worst case properties of our compression algorithms. We observe up to a 2- speed improvement over the existing GPU-based methods in addition to up to a 9:1 improvement in GPU memory gains. We demonstrate the performance on multiple mobile platforms.",
"title": "Compressed Coverage Masks for Path Rendering on Mobile GPUs",
"normalizedTitle": "Compressed Coverage Masks for Path Rendering on Mobile GPUs",
"fno": "07378994",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Rendering Computer Graphics",
"Graphics Processing Units",
"Hardware",
"Gray Scale",
"Mobile Communication",
"Libraries",
"2 D Path Rendering",
"Texture Compression",
"Coverage Masks"
],
"authors": [
{
"givenName": "Pavel",
"surname": "Krajcevski",
"fullName": "Pavel Krajcevski",
"affiliation": "Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dinesh",
"surname": "Manocha",
"fullName": "Dinesh Manocha",
"affiliation": "Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2016-10-01 00:00:00",
"pubType": "trans",
"pages": "2229-2238",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/apvis/2007/0808/0/04126228",
"title": "Adaptive sampling in three dimensions for volume rendering on GPUs",
"doi": null,
"abstractUrl": "/proceedings-article/apvis/2007/04126228/12OmNARRYyX",
"parentPublication": {
"id": "proceedings/apvis/2007/0808/0",
"title": "Asia-Pacific Symposium on Visualisation 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2012/4836/0/4836a050",
"title": "GPU Based Compression and Rendering of Massive Aircraft CAD Models",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2012/4836a050/12OmNBaBuS8",
"parentPublication": {
"id": "proceedings/icvrv/2012/4836/0",
"title": "2012 International Conference on Virtual Reality and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/unesst/2015/9852/0/9852a022",
"title": "Increasing GPU-Speedup of Volume Rendering for Images with High Complexity",
"doi": null,
"abstractUrl": "/proceedings-article/unesst/2015/9852a022/12OmNCmpcES",
"parentPublication": {
"id": "proceedings/unesst/2015/9852/0",
"title": "2015 8th International Conference on u- and e- Service, Science and Technology (UNESST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2015/6879/0/07156372",
"title": "Computation-to-core mapping strategies for iso-surface volume rendering on GPUs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156372/12OmNwkzulc",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2019/02/08440753",
"title": "Visibility Rendering Order: Improving Energy Efficiency on Mobile GPUs through Frame Coherence",
"doi": null,
"abstractUrl": "/journal/td/2019/02/08440753/17D45W1Oa5j",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hcs/2022/6028/0/09895607",
"title": "Accelerating Graphic Rendering on Programmable RISC-V GPUs",
"doi": null,
"abstractUrl": "/proceedings-article/hcs/2022/09895607/1GZiJcJFUk0",
"parentPublication": {
"id": "proceedings/hcs/2022/6028/0",
"title": "2022 IEEE Hot Chips 34 Symposium (HCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2022/5444/0/544400a368",
"title": "Accelerating Elliptic Curve Digital Signature Algorithms on GPUs",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2022/544400a368/1I0bSTFFUE8",
"parentPublication": {
"id": "proceedings/sc/2022/5444/0/",
"title": "SC22: International Conference for High Performance Computing, Networking, Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a011",
"title": "A Virtual Frame Buffer Abstraction for Parallel Rendering of Large Tiled Display Walls",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a011/1qROP1sMu2I",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/08/09409710",
"title": "Interactive Focus+Context Rendering for Hexahedral Mesh Inspection",
"doi": null,
"abstractUrl": "/journal/tg/2021/08/09409710/1sXjFab9xYc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2021/3283/0/328300a043",
"title": "GPU-based Image Compression for Efficient Compositing in Distributed Rendering Applications",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2021/328300a043/1zdPDTXc4hy",
"parentPublication": {
"id": "proceedings/ldav/2021/3283/0",
"title": "2021 IEEE 11th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07501796",
"articleId": "13rRUyv53Fw",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07429785",
"articleId": "13rRUyfbwqN",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyxXloT",
"title": "March/April",
"year": "2008",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "14",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwvT9gl",
"doi": "10.1109/TVCG.2007.70442",
"abstract": "This paper presents a novel basis function, called spherical piecewise constant basis function (SPCBF), for precomputed radiance transfer. SPCBFs have several desirable properties: rotatability, ability to represent all-frequency signals, and support for efficient multiple product. By smartly partitioning the illumination sphere into a set of subregions, and associating each subregion with an SPCBF valued 1 inside the region and 0 elsewhere, we precompute the light coefficients using the resulting SPCBFs. Efficient rotation of the light representation in SPCBFs is achieved by rotating the domain of SPCBFs. We run-time approximate the BRDF and visibility coefficients using the set of SPCBFs for light, possibly rotated, through fast lookup of summed-area-table (SAT) and visibility distance table (VDT), respectively. SPCBFs enable new effects such as object rotation in all-frequency rendering of dynamic scenes and on-the-fly BRDF editing under rotating environment lighting. With graphics hardware acceleration, our method achieves real-time frame rates.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a novel basis function, called spherical piecewise constant basis function (SPCBF), for precomputed radiance transfer. SPCBFs have several desirable properties: rotatability, ability to represent all-frequency signals, and support for efficient multiple product. By smartly partitioning the illumination sphere into a set of subregions, and associating each subregion with an SPCBF valued 1 inside the region and 0 elsewhere, we precompute the light coefficients using the resulting SPCBFs. Efficient rotation of the light representation in SPCBFs is achieved by rotating the domain of SPCBFs. We run-time approximate the BRDF and visibility coefficients using the set of SPCBFs for light, possibly rotated, through fast lookup of summed-area-table (SAT) and visibility distance table (VDT), respectively. SPCBFs enable new effects such as object rotation in all-frequency rendering of dynamic scenes and on-the-fly BRDF editing under rotating environment lighting. With graphics hardware acceleration, our method achieves real-time frame rates.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a novel basis function, called spherical piecewise constant basis function (SPCBF), for precomputed radiance transfer. SPCBFs have several desirable properties: rotatability, ability to represent all-frequency signals, and support for efficient multiple product. By smartly partitioning the illumination sphere into a set of subregions, and associating each subregion with an SPCBF valued 1 inside the region and 0 elsewhere, we precompute the light coefficients using the resulting SPCBFs. Efficient rotation of the light representation in SPCBFs is achieved by rotating the domain of SPCBFs. We run-time approximate the BRDF and visibility coefficients using the set of SPCBFs for light, possibly rotated, through fast lookup of summed-area-table (SAT) and visibility distance table (VDT), respectively. SPCBFs enable new effects such as object rotation in all-frequency rendering of dynamic scenes and on-the-fly BRDF editing under rotating environment lighting. With graphics hardware acceleration, our method achieves real-time frame rates.",
"title": "Spherical Piecewise Constant Basis Functions for All-Frequency Precomputed Radiance Transfer",
"normalizedTitle": "Spherical Piecewise Constant Basis Functions for All-Frequency Precomputed Radiance Transfer",
"fno": "ttg2008020454",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Graphics",
"Color",
"Shading",
"Shadowing",
"And Texture",
"Real Time Rendering",
"Precomputed Radiance Transfer",
"Spherical Piecewise Constant Basis Functions"
],
"authors": [
{
"givenName": "Kun",
"surname": "Xu",
"fullName": "Kun Xu",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yun-Tao",
"surname": "Jia",
"fullName": "Yun-Tao Jia",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongbo",
"surname": "Fu",
"fullName": "Hongbo Fu",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shimin",
"surname": "Hu",
"fullName": "Shimin Hu",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chiew-Lan",
"surname": "Tai",
"fullName": "Chiew-Lan Tai",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2008-03-01 00:00:00",
"pubType": "trans",
"pages": "454-467",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cgiv/2004/2178/0/21780101",
"title": "Precomputed Radiance Transfer with Spatially-Varying Lighting Effects",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2004/21780101/12OmNBQkx3g",
"parentPublication": {
"id": "proceedings/cgiv/2004/2178/0",
"title": "Proceedings. International Conference on Computer Graphics, Imaging and Visualization, 2004. CGIV 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2007/3009/0/30090161",
"title": "Precomputed Visibility Cuts for Interactive Relighting with Dynamic BRDFs",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2007/30090161/12OmNqFa5pJ",
"parentPublication": {
"id": "proceedings/pg/2007/3009/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacific-graphics/2010/4205/0/4205a024",
"title": "Fast Height-Field Rendering under Image-Based Lighting",
"doi": null,
"abstractUrl": "/proceedings-article/pacific-graphics/2010/4205a024/12OmNs0C9Uf",
"parentPublication": {
"id": "proceedings/pacific-graphics/2010/4205/0",
"title": "Pacific Conference on Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/1997/8028/0/80280059",
"title": "Rendering of spherical light fields",
"doi": null,
"abstractUrl": "/proceedings-article/pg/1997/80280059/12OmNvTTciE",
"parentPublication": {
"id": "proceedings/pg/1997/8028/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/02/v0254",
"title": "Noise-Resistant Fitting for Spherical Harmonics",
"doi": null,
"abstractUrl": "/journal/tg/2006/02/v0254/13rRUwhHcQL",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030447",
"title": "Efficient Visibility Encoding for Dynamic Illumination in Direct Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030447/13rRUxAATgu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/01/ttg2010010043",
"title": "All-Frequency Lighting with Multiscale Spherical Radial Basis Functions",
"doi": null,
"abstractUrl": "/journal/tg/2010/01/ttg2010010043/13rRUxjQybO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111811",
"title": "Precomputed Safety Shapes for Efficient and Accurate Height-Field Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111811/13rRUxjQyvh",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/08/ttg2013081317",
"title": "Real-Time Volume Rendering in Dynamic Lighting Environments Using Precomputed Photon Mapping",
"doi": null,
"abstractUrl": "/journal/tg/2013/08/ttg2013081317/13rRUynHuja",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2003/03/mcg2003030028",
"title": "Efficient Light Transport Using Precomputed Visibility",
"doi": null,
"abstractUrl": "/magazine/cg/2003/03/mcg2003030028/13rRUzpzeHH",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008020440",
"articleId": "13rRUNvgz49",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrMZpqR",
"title": "November/December",
"year": "2004",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "10",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwgQpqB",
"doi": "10.1109/TVCG.2004.39",
"abstract": "There are many situations where one needs to compare two or more data sets. It may be to compare different models, different resolutions, differences in algorithms, different experimental results, etc. There is therefore a need for comparative visualization tools to help analyze the differences. This paper focuses on comparative visualization tools for analyzing flow or vector data sets. The techniques presented allow one to compare individual streamlines and streamribbons as well as a dense field of streamlines. These comparison methods can also be used to study differences in vortex cores that are represented as polylines.",
"abstracts": [
{
"abstractType": "Regular",
"content": "There are many situations where one needs to compare two or more data sets. It may be to compare different models, different resolutions, differences in algorithms, different experimental results, etc. There is therefore a need for comparative visualization tools to help analyze the differences. This paper focuses on comparative visualization tools for analyzing flow or vector data sets. The techniques presented allow one to compare individual streamlines and streamribbons as well as a dense field of streamlines. These comparison methods can also be used to study differences in vortex cores that are represented as polylines.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "There are many situations where one needs to compare two or more data sets. It may be to compare different models, different resolutions, differences in algorithms, different experimental results, etc. There is therefore a need for comparative visualization tools to help analyze the differences. This paper focuses on comparative visualization tools for analyzing flow or vector data sets. The techniques presented allow one to compare individual streamlines and streamribbons as well as a dense field of streamlines. These comparison methods can also be used to study differences in vortex cores that are represented as polylines.",
"title": "Comparative Flow Visualization",
"normalizedTitle": "Comparative Flow Visualization",
"fno": "v0609",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Streamline",
"Streamribbon",
"Comparative Visualization",
"Feature Extraction"
],
"authors": [
{
"givenName": "Vivek",
"surname": "Verma",
"fullName": "Vivek Verma",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alex",
"surname": "Pang",
"fullName": "Alex Pang",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2004-11-01 00:00:00",
"pubType": "trans",
"pages": "609-624",
"year": "2004",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2017/0831/0/0831a268",
"title": "Streamline Selection for Comparative Visualization of 3D Fluid Simulation Result",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2017/0831a268/12OmNviZlA5",
"parentPublication": {
"id": "proceedings/iv/2017/0831/0",
"title": "2017 21st International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2001/1195/0/11950317",
"title": "Animated Illuminated Lines for Flow Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2001/11950317/12OmNwBT1mq",
"parentPublication": {
"id": "proceedings/iv/2001/1195/0",
"title": "Proceedings Fifth International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2011/4584/0/4584b224",
"title": "Streamline-based Visualization of 3D Explosion Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584b224/12OmNwtEEJX",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780027",
"title": "A Flow-guided Streamline Seeding Strategy",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780027/12OmNxI0Kvw",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2011/4584/0/4584b174",
"title": "Multiresolution Streamline Placement for 2D Flow Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584b174/12OmNz6iOml",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/05/07117453",
"title": "A Vocabulary Approach to Partial Streamline Matching and Exploratory Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2016/05/07117453/13rRUEgs2C0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1995/02/v0142",
"title": "Competent, Compact, Comparative Visualization of a Vortical Flow Field",
"doi": null,
"abstractUrl": "/journal/tg/1995/02/v0142/13rRUxD9gXv",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061216",
"title": "An Information-Theoretic Framework for Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061216/13rRUxDIthc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061235",
"title": "Curve-Centric Volume Reformation for Comparative Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061235/13rRUxlgxTg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/07/ttg2013071185",
"title": "Parallel Streamline Placement for 2D Flow Fields",
"doi": null,
"abstractUrl": "/journal/tg/2013/07/ttg2013071185/13rRUyfbwqG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "v0625",
"articleId": "13rRUNvyakz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzFdtc6",
"title": "November/December",
"year": "2010",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "16",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxDIthc",
"doi": "10.1109/TVCG.2010.131",
"abstract": "The process of visualization can be seen as a visual communication channel where the input to the channel is the raw data, and the output is the result of a visualization algorithm. From this point of view, we can evaluate the effectiveness of visualization by measuring how much information in the original data is being communicated through the visual communication channel. In this paper, we present an information-theoretic framework for flow visualization with a special focus on streamline generation. In our framework, a vector field is modeled as a distribution of directions from which Shannon's entropy is used to measure the information content in the field. The effectiveness of the streamlines displayed in visualization can be measured by first constructing a new distribution of vectors derived from the existing streamlines, and then comparing this distribution with that of the original data set using the conditional entropy. The conditional entropy between these two distributions indicates how much information in the original data remains hidden after the selected streamlines are displayed. The quality of the visualization can be improved by progressively introducing new streamlines until the conditional entropy converges to a small value. We describe the key components of our framework with detailed analysis, and show that the framework can effectively visualize 2D and 3D flow data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The process of visualization can be seen as a visual communication channel where the input to the channel is the raw data, and the output is the result of a visualization algorithm. From this point of view, we can evaluate the effectiveness of visualization by measuring how much information in the original data is being communicated through the visual communication channel. In this paper, we present an information-theoretic framework for flow visualization with a special focus on streamline generation. In our framework, a vector field is modeled as a distribution of directions from which Shannon's entropy is used to measure the information content in the field. The effectiveness of the streamlines displayed in visualization can be measured by first constructing a new distribution of vectors derived from the existing streamlines, and then comparing this distribution with that of the original data set using the conditional entropy. The conditional entropy between these two distributions indicates how much information in the original data remains hidden after the selected streamlines are displayed. The quality of the visualization can be improved by progressively introducing new streamlines until the conditional entropy converges to a small value. We describe the key components of our framework with detailed analysis, and show that the framework can effectively visualize 2D and 3D flow data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The process of visualization can be seen as a visual communication channel where the input to the channel is the raw data, and the output is the result of a visualization algorithm. From this point of view, we can evaluate the effectiveness of visualization by measuring how much information in the original data is being communicated through the visual communication channel. In this paper, we present an information-theoretic framework for flow visualization with a special focus on streamline generation. In our framework, a vector field is modeled as a distribution of directions from which Shannon's entropy is used to measure the information content in the field. The effectiveness of the streamlines displayed in visualization can be measured by first constructing a new distribution of vectors derived from the existing streamlines, and then comparing this distribution with that of the original data set using the conditional entropy. The conditional entropy between these two distributions indicates how much information in the original data remains hidden after the selected streamlines are displayed. The quality of the visualization can be improved by progressively introducing new streamlines until the conditional entropy converges to a small value. We describe the key components of our framework with detailed analysis, and show that the framework can effectively visualize 2D and 3D flow data.",
"title": "An Information-Theoretic Framework for Flow Visualization",
"normalizedTitle": "An Information-Theoretic Framework for Flow Visualization",
"fno": "ttg2010061216",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Flow Field Visualization",
"Information Theory",
"Streamline Generation"
],
"authors": [
{
"givenName": "Lijie",
"surname": "Xu",
"fullName": "Lijie Xu",
"affiliation": "The Ohio State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Teng-Yok",
"surname": "Lee",
"fullName": "Teng-Yok Lee",
"affiliation": "The Ohio State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Han-Wei",
"surname": "Shen",
"fullName": "Han-Wei Shen",
"affiliation": "The Ohio State University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2010-11-01 00:00:00",
"pubType": "trans",
"pages": "1216-1224",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/1998/9176/0/91760305",
"title": "Real-Time Techniques for 3D Flow Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1998/91760305/12OmNAZOJWZ",
"parentPublication": {
"id": "proceedings/ieee-vis/1998/9176/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1998/9176/0/91760135",
"title": "Image-Guided Streamline Placement on Curvilinear Grid Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1998/91760135/12OmNCbU2XH",
"parentPublication": {
"id": "proceedings/ieee-vis/1998/9176/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2011/935/0/05742376",
"title": "View point evaluation and streamline filtering for flow visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742376/12OmNqyDjoV",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2011/4584/0/4584b224",
"title": "Streamline-based Visualization of 3D Explosion Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584b224/12OmNwtEEJX",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2011/4584/0/4584b174",
"title": "Multiresolution Streamline Placement for 2D Flow Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584b174/12OmNz6iOml",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__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/2004/06/v0609",
"title": "Comparative Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2004/06/v0609/13rRUwgQpqB",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061206",
"title": "An Information-theoretic Framework for Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061206/13rRUxYrbUA",
"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/2013/07/ttg2013071185",
"title": "Parallel Streamline Placement for 2D Flow Fields",
"doi": null,
"abstractUrl": "/journal/tg/2013/07/ttg2013071185/13rRUyfbwqG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010061206",
"articleId": "13rRUxYrbUA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010061225",
"articleId": "13rRUy0HYRl",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1tWJ8EdItri",
"title": "July",
"year": "2021",
"issueNum": "07",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1gPjyn904OA",
"doi": "10.1109/TVCG.2020.2968911",
"abstract": "Stress tensor fields play a central role in solid mechanics studies, but their visualization in 3D space remains challenging as the information-dense multi-variate tensor needs to be sampled in 3D space while avoiding clutter. Taking cues from current tensor visualizations, we adapted glyph-based visualization for stress tensors in 3D space. We also developed a testing framework and performed user studies to evaluate the various glyph-based tensor visualizations for objective accuracy measures, and subjective user feedback for each visualization method. To represent the stress tensor, we color encoded the original superquadric glyph, and in the user study, we compared it to superquadric glyphs developed for second-order symmetric tensors. We found that color encoding improved the user accuracy measures, while the users also rated our method the highest. We compared our method of placing stress tensor glyphs on displacement streamlines to the glyph placement on a 3D grid. In the visualization, we modified the glyph to show both the stress tensor and the displacement vector at each sample point. The participants preferred our method of glyph placement on displacement streamlines as it highlighted the underlying continuous structure in the tensor field.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Stress tensor fields play a central role in solid mechanics studies, but their visualization in 3D space remains challenging as the information-dense multi-variate tensor needs to be sampled in 3D space while avoiding clutter. Taking cues from current tensor visualizations, we adapted glyph-based visualization for stress tensors in 3D space. We also developed a testing framework and performed user studies to evaluate the various glyph-based tensor visualizations for objective accuracy measures, and subjective user feedback for each visualization method. To represent the stress tensor, we color encoded the original superquadric glyph, and in the user study, we compared it to superquadric glyphs developed for second-order symmetric tensors. We found that color encoding improved the user accuracy measures, while the users also rated our method the highest. We compared our method of placing stress tensor glyphs on displacement streamlines to the glyph placement on a 3D grid. In the visualization, we modified the glyph to show both the stress tensor and the displacement vector at each sample point. The participants preferred our method of glyph placement on displacement streamlines as it highlighted the underlying continuous structure in the tensor field.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Stress tensor fields play a central role in solid mechanics studies, but their visualization in 3D space remains challenging as the information-dense multi-variate tensor needs to be sampled in 3D space while avoiding clutter. Taking cues from current tensor visualizations, we adapted glyph-based visualization for stress tensors in 3D space. We also developed a testing framework and performed user studies to evaluate the various glyph-based tensor visualizations for objective accuracy measures, and subjective user feedback for each visualization method. To represent the stress tensor, we color encoded the original superquadric glyph, and in the user study, we compared it to superquadric glyphs developed for second-order symmetric tensors. We found that color encoding improved the user accuracy measures, while the users also rated our method the highest. We compared our method of placing stress tensor glyphs on displacement streamlines to the glyph placement on a 3D grid. In the visualization, we modified the glyph to show both the stress tensor and the displacement vector at each sample point. The participants preferred our method of glyph placement on displacement streamlines as it highlighted the underlying continuous structure in the tensor field.",
"title": "Visualization of 3D Stress Tensor Fields Using Superquadric Glyphs on Displacement Streamlines",
"normalizedTitle": "Visualization of 3D Stress Tensor Fields Using Superquadric Glyphs on Displacement Streamlines",
"fno": "08967163",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Continuum Mechanics",
"Data Visualisation",
"Materials Science Computing",
"Tensors",
"3 D Grid",
"3 D Stress Tensor Field Visualization",
"Glyph Placement",
"Stress Tensor Glyphs",
"Second Order Symmetric Tensors",
"Glyph Based Tensor Visualizations",
"Information Dense Multivariate Tensor",
"Solid Mechanics",
"Displacement Streamlines",
"Superquadric Glyphs",
"Tensors",
"Stress",
"Visualization",
"Three Dimensional Displays",
"Data Visualization",
"Clutter",
"Solids",
"3 D Stress Tensor Field",
"Visualization",
"Glyph",
"Glyph Placement",
"Virtual Reality",
"User Study"
],
"authors": [
{
"givenName": "Mohak",
"surname": "Patel",
"fullName": "Mohak Patel",
"affiliation": "Department of Computer Science, Brown University, Providence, RI, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David H.",
"surname": "Laidlaw",
"fullName": "David H. Laidlaw",
"affiliation": "Department of Computer Science, Brown University, Providence, RI, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2021-07-01 00:00:00",
"pubType": "trans",
"pages": "3264-3276",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/scivis/2015/9785/0/07429504",
"title": "3D superquadric glyphs for visualizing myocardial motion",
"doi": null,
"abstractUrl": "/proceedings-article/scivis/2015/07429504/12OmNrIaemh",
"parentPublication": {
"id": "proceedings/scivis/2015/9785/0",
"title": "2015 IEEE Scientific Visualization Conference (SciVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660005",
"title": "Visualizing Tensor Fields in Geomechanics",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660005/12OmNvpewaO",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880369",
"title": "Visualization of Salt-Induced Stress Perturbations",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880369/12OmNvqEvJq",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532771",
"title": "Exploring 2D tensor fields using stress nets",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532771/12OmNzmtWye",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1197",
"title": "Superellipsoid-based, Real Symmetric Traceless Tensor Glyphs Motivated by Nematic Liquid Crystal Alignment Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1197/13rRUNvgyWd",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192722",
"title": "Glyph-Based Comparative Visualization for Diffusion Tensor Fields",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192722/13rRUx0gefn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061595",
"title": "Superquadric Glyphs for Symmetric Second-Order Tensors",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061595/13rRUxZzAhA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/08/ttg2013081331",
"title": "Representing Flow Patterns by Using Streamlines with Glyphs",
"doi": null,
"abstractUrl": "/journal/tg/2013/08/ttg2013081331/13rRUxly9dT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/05/v0508",
"title": "Visualization of Geologic Stress Perturbations Using Mohr Diagrams",
"doi": null,
"abstractUrl": "/journal/tg/2005/05/v0508/13rRUyeTVhT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2022/02/09709109",
"title": "Stress Visualization for Interface Optimization of a Hybrid Component Using Surface Tensor Spines",
"doi": null,
"abstractUrl": "/magazine/cg/2022/02/09709109/1AR0uW6U00w",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08964443",
"articleId": "1gLZSnCp3Ko",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08967011",
"articleId": "1gPjyDVBxF6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1tWJbbdSB1K",
"name": "ttg202107-08967163s1-supp2-2968911.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202107-08967163s1-supp2-2968911.mp4",
"extension": "mp4",
"size": "63.3 MB",
"__typename": "WebExtraType"
},
{
"id": "1tWJavkCURq",
"name": "ttg202107-08967163s1-supp1-2968911.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202107-08967163s1-supp1-2968911.pdf",
"extension": "pdf",
"size": "84.7 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAle6Qx",
"title": "November/December",
"year": "2007",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgs2BN",
"doi": "10.1109/TVCG.2007.70595",
"abstract": "Most streamline generation algorithms either provide a particular density of streamlines across the domain or explicitly detect features, such as critical points, and follow customized rules to emphasize those features. However, the former generally includes many redundant streamlines, and the latter requires Boolean decisions on which points are features (and may thus suffer from robustness problems for real-world data). We take a new approach to adaptive streamline placement for steady vector fields in 2D and 3D. We define a metric for local similarity among streamlines and use this metric to grow streamlines from a dense set of candidate seed points. The metric considers not only Euclidean distance, but also a simple statistical measure of shape and directional similarity. Without explicit feature detection, our method produces streamlines that naturally accentuate regions of geometric interest. In conjunction with this method, we also propose a quantitative error metric for evaluating a streamline representation based on how well it preserves the information from the original vector field. This error metric reconstructs a vector field from points on the streamline representation and computes a difference of the reconstruction from the original vector field.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Most streamline generation algorithms either provide a particular density of streamlines across the domain or explicitly detect features, such as critical points, and follow customized rules to emphasize those features. However, the former generally includes many redundant streamlines, and the latter requires Boolean decisions on which points are features (and may thus suffer from robustness problems for real-world data). We take a new approach to adaptive streamline placement for steady vector fields in 2D and 3D. We define a metric for local similarity among streamlines and use this metric to grow streamlines from a dense set of candidate seed points. The metric considers not only Euclidean distance, but also a simple statistical measure of shape and directional similarity. Without explicit feature detection, our method produces streamlines that naturally accentuate regions of geometric interest. In conjunction with this method, we also propose a quantitative error metric for evaluating a streamline representation based on how well it preserves the information from the original vector field. This error metric reconstructs a vector field from points on the streamline representation and computes a difference of the reconstruction from the original vector field.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Most streamline generation algorithms either provide a particular density of streamlines across the domain or explicitly detect features, such as critical points, and follow customized rules to emphasize those features. However, the former generally includes many redundant streamlines, and the latter requires Boolean decisions on which points are features (and may thus suffer from robustness problems for real-world data). We take a new approach to adaptive streamline placement for steady vector fields in 2D and 3D. We define a metric for local similarity among streamlines and use this metric to grow streamlines from a dense set of candidate seed points. The metric considers not only Euclidean distance, but also a simple statistical measure of shape and directional similarity. Without explicit feature detection, our method produces streamlines that naturally accentuate regions of geometric interest. In conjunction with this method, we also propose a quantitative error metric for evaluating a streamline representation based on how well it preserves the information from the original vector field. This error metric reconstructs a vector field from points on the streamline representation and computes a difference of the reconstruction from the original vector field.",
"title": "Similarity-Guided Streamline Placement with Error Evaluation",
"normalizedTitle": "Similarity-Guided Streamline Placement with Error Evaluation",
"fno": "v1448",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Vision",
"Robustness",
"Euclidean Distance",
"Shape Measurement",
"Magnetic Fields",
"Convolution",
"Magnetohydrodynamics",
"Extraterrestrial Measurements",
"Magnetic Field Measurement",
"Magnetic Properties",
"Adaptive Streamlines",
"Vector Field Reconstruction",
"Shape Matching"
],
"authors": [
{
"givenName": "Yuan",
"surname": "Chen",
"fullName": "Yuan Chen",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jonathan",
"surname": "Cohen",
"fullName": "Jonathan Cohen",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Julian",
"surname": "Krolik",
"fullName": "Julian Krolik",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2007-11-01 00:00:00",
"pubType": "trans",
"pages": "1448-1455",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/1998/9176/0/91760135",
"title": "Image-Guided Streamline Placement on Curvilinear Grid Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1998/91760135/12OmNCbU2XH",
"parentPublication": {
"id": "proceedings/ieee-vis/1998/9176/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2013/4797/0/06596153",
"title": "Exploring vector fields with distribution-based streamline analysis",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2013/06596153/12OmNvAiSjV",
"parentPublication": {
"id": "proceedings/pacificvis/2013/4797/0",
"title": "2013 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2010/4297/0/4297a238",
"title": "A Streamline Placement Method Highlighting Flow Field Topology",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2010/4297a238/12OmNvF83qx",
"parentPublication": {
"id": "proceedings/cis/2010/4297/0",
"title": "2010 International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2008/1966/0/04475462",
"title": "Illustrative Streamline Placement and Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2008/04475462/12OmNwoPty5",
"parentPublication": {
"id": "proceedings/pacificvis/2008/1966/0",
"title": "IEEE Pacific Visualization Symposium 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780027",
"title": "A Flow-guided Streamline Seeding Strategy",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780027/12OmNxI0Kvw",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2011/4584/0/4584b174",
"title": "Multiresolution Streamline Placement for 2D Flow Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584b174/12OmNz6iOml",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__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/2012/03/ttg2012030407",
"title": "Streamline Embedding for 3D Vector Field Exploration",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030407/13rRUwInvsM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/05/ttg2010050791",
"title": "Topology-Aware Evenly Spaced Streamline Placement",
"doi": null,
"abstractUrl": "/journal/tg/2010/05/ttg2010050791/13rRUwvT9gp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/07/ttg2013071185",
"title": "Parallel Streamline Placement for 2D Flow Fields",
"doi": null,
"abstractUrl": "/journal/tg/2013/07/ttg2013071185/13rRUyfbwqG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1432",
"articleId": "13rRUNvgyWg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1456",
"articleId": "13rRUxBa5x9",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx5YvqP",
"title": "Nov.",
"year": "2020",
"issueNum": "11",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1bcHtOFxACQ",
"doi": "10.1109/TVCG.2019.2923196",
"abstract": "Video stabilization is usually composed of three stages: feature trajectory extraction, trajectory smoothing, and frame warping. Most previous approaches view them as three separate stages. This paper proposes a method combining the last two stages, namely the trajectory smoothing and frame warping stages, into a single optimization framework. The novelty exists in the way of how we combine them: the trajectory smoothing part plays a major role while the frame warping part plays an auxiliary role. With this kind of design, we can conveniently increase the strength of the trajectory smoothing part by a robust first-order derivative term, which makes it possible to produce very aggressive stabilization effects. On the other hand, we adopt adaptive weighting mechanisms in the frame warping part, to follow the smoothed trajectories as much as possible while regularizing other places as similar as possible. Our method is robust to utilize both foreground and background features, and very short trajectories. The utilization of all these information in turn increases the accuracy of the proposed method. We also provide a simplified implementation of our method, which is less accurate but more efficient. Experiments on various kinds of videos demonstrate the effectiveness of our method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Video stabilization is usually composed of three stages: feature trajectory extraction, trajectory smoothing, and frame warping. Most previous approaches view them as three separate stages. This paper proposes a method combining the last two stages, namely the trajectory smoothing and frame warping stages, into a single optimization framework. The novelty exists in the way of how we combine them: the trajectory smoothing part plays a major role while the frame warping part plays an auxiliary role. With this kind of design, we can conveniently increase the strength of the trajectory smoothing part by a robust first-order derivative term, which makes it possible to produce very aggressive stabilization effects. On the other hand, we adopt adaptive weighting mechanisms in the frame warping part, to follow the smoothed trajectories as much as possible while regularizing other places as similar as possible. Our method is robust to utilize both foreground and background features, and very short trajectories. The utilization of all these information in turn increases the accuracy of the proposed method. We also provide a simplified implementation of our method, which is less accurate but more efficient. Experiments on various kinds of videos demonstrate the effectiveness of our method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Video stabilization is usually composed of three stages: feature trajectory extraction, trajectory smoothing, and frame warping. Most previous approaches view them as three separate stages. This paper proposes a method combining the last two stages, namely the trajectory smoothing and frame warping stages, into a single optimization framework. The novelty exists in the way of how we combine them: the trajectory smoothing part plays a major role while the frame warping part plays an auxiliary role. With this kind of design, we can conveniently increase the strength of the trajectory smoothing part by a robust first-order derivative term, which makes it possible to produce very aggressive stabilization effects. On the other hand, we adopt adaptive weighting mechanisms in the frame warping part, to follow the smoothed trajectories as much as possible while regularizing other places as similar as possible. Our method is robust to utilize both foreground and background features, and very short trajectories. The utilization of all these information in turn increases the accuracy of the proposed method. We also provide a simplified implementation of our method, which is less accurate but more efficient. Experiments on various kinds of videos demonstrate the effectiveness of our method.",
"title": "Effective Video Stabilization via Joint Trajectory Smoothing and Frame Warping",
"normalizedTitle": "Effective Video Stabilization via Joint Trajectory Smoothing and Frame Warping",
"fno": "08737754",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Feature Extraction",
"Optimisation",
"Video Signal Processing",
"Trajectory Smoothing",
"Smoothed Trajectories",
"Video Stabilization",
"Joint Trajectory Smoothing",
"Feature Trajectory Extraction",
"Frame Warping",
"Trajectory",
"Smoothing Methods",
"Cameras",
"Two Dimensional Displays",
"Three Dimensional Displays",
"Feature Extraction",
"Streaming Media",
"Video Stabilization",
"Trajectory Smoothing",
"Mesh Warping",
"Optimization"
],
"authors": [
{
"givenName": "Tiezheng",
"surname": "Ma",
"fullName": "Tiezheng Ma",
"affiliation": "School of Computer Science and Engineering, South China University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yongwei",
"surname": "Nie",
"fullName": "Yongwei Nie",
"affiliation": "School of Computer Science and Engineering, South China University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qing",
"surname": "Zhang",
"fullName": "Qing Zhang",
"affiliation": "School of Data and Computer Science, Sun Yat-Sen University, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhensong",
"surname": "Zhang",
"fullName": "Zhensong Zhang",
"affiliation": "Noah's Ark Lab, Huawei Technologies Co. Ltd., Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanqiu",
"surname": "Sun",
"fullName": "Hanqiu Sun",
"affiliation": "Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guiqing",
"surname": "Li",
"fullName": "Guiqing Li",
"affiliation": "School of Computer Science and Engineering, South China University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2020-11-01 00:00:00",
"pubType": "trans",
"pages": "3163-3176",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wism/2010/4224/2/05663071",
"title": "Research of 3D Visualization for Wellbore Trajectory",
"doi": null,
"abstractUrl": "/proceedings-article/wism/2010/05663071/12OmNBZYTny",
"parentPublication": {
"id": "proceedings/wism/2010/4224/2",
"title": "2010 International Conference on Web Information Systems and Mining (WISM 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2009/3883/0/3883a223",
"title": "A Novel Trajectory Smoothing Algorithm Based on Empirical Mode Decomposition",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2009/3883a223/12OmNrJAdXu",
"parentPublication": {
"id": "proceedings/icig/2009/3883/0",
"title": "Image and Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2017/2939/0/08078488",
"title": "Semantic filtering for video stabilization",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2017/08078488/12OmNxcMSd4",
"parentPublication": {
"id": "proceedings/avss/2017/2939/0",
"title": "2017 14th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2014/4761/0/06890302",
"title": "A windowed dynamic time warping approach for 3D continuous hand gesture recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2014/06890302/12OmNy6Zs40",
"parentPublication": {
"id": "proceedings/icme/2014/4761/0",
"title": "2014 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/03/06942245",
"title": "Foldover-Free Mesh Warping for Constrained Texture Mapping",
"doi": null,
"abstractUrl": "/journal/tg/2015/03/06942245/13rRUwInvB9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000f060",
"title": "3D Semantic Trajectory Reconstruction from 3D Pixel Continuum",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000f060/17D45VUZMYS",
"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/281200m2106",
"title": "Video Geo-Localization Employing Geo-Temporal Feature Learning and GPS Trajectory Smoothing",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200m2106/1BmLrWSqWze",
"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/934600f395",
"title": "Sim2RealVS: A New Benchmark for Video Stabilization with a Strong Baseline",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600f395/1L8qpcZSmfC",
"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/716800g777",
"title": "Sub-Frame Appearance and 6D Pose Estimation of Fast Moving Objects",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800g777/1m3nXLgimIM",
"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/2021/4509/0/450900k0616",
"title": "3D Video Stabilization with Depth Estimation by CNN-based Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900k0616/1yeLRwhnDCo",
"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": "08727493",
"articleId": "1atT2xTflII",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08744364",
"articleId": "1bmEPJMhdOo",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1nxQYT3ZrOg",
"name": "ttg202011-08737754s1-supplementalmaterial.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202011-08737754s1-supplementalmaterial.mp4",
"extension": "mp4",
"size": "78.5 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": "13rRUNvyath",
"doi": "10.1109/TVCG.2012.284",
"abstract": "This paper presents a visualization approach for detecting and exploring similarity in the temporal variation of field data. We provide an interactive technique for extracting correlations from similarity matrices which capture temporal similarity of univariate functions. We make use of the concept to extract periodic and quasiperiodic behavior at single (spatial) points as well as similarity between different locations within a field and also between different data sets. The obtained correlations are utilized for visual exploration of both temporal and spatial relationships in terms of temporal similarity. Our entire pipeline offers visual interaction and inspection, allowing for the flexibility that in particular time-dependent data analysis techniques require. We demonstrate the utility and versatility of our approach by applying our implementation to data from both simulation and measurement.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a visualization approach for detecting and exploring similarity in the temporal variation of field data. We provide an interactive technique for extracting correlations from similarity matrices which capture temporal similarity of univariate functions. We make use of the concept to extract periodic and quasiperiodic behavior at single (spatial) points as well as similarity between different locations within a field and also between different data sets. The obtained correlations are utilized for visual exploration of both temporal and spatial relationships in terms of temporal similarity. Our entire pipeline offers visual interaction and inspection, allowing for the flexibility that in particular time-dependent data analysis techniques require. We demonstrate the utility and versatility of our approach by applying our implementation to data from both simulation and measurement.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a visualization approach for detecting and exploring similarity in the temporal variation of field data. We provide an interactive technique for extracting correlations from similarity matrices which capture temporal similarity of univariate functions. We make use of the concept to extract periodic and quasiperiodic behavior at single (spatial) points as well as similarity between different locations within a field and also between different data sets. The obtained correlations are utilized for visual exploration of both temporal and spatial relationships in terms of temporal similarity. Our entire pipeline offers visual interaction and inspection, allowing for the flexibility that in particular time-dependent data analysis techniques require. We demonstrate the utility and versatility of our approach by applying our implementation to data from both simulation and measurement.",
"title": "Visualization of Temporal Similarity in Field Data",
"normalizedTitle": "Visualization of Temporal Similarity in Field Data",
"fno": "ttg2012122023",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Matrix Algebra",
"Data Analysis",
"Data Visualisation",
"Inspection",
"Interactive Systems",
"Time Dependent Data Analysis Techniques",
"Temporal Similarity Visualization Approach",
"Field Data Temporal Variation",
"Interactive Technique",
"Correlation Extraction",
"Similarity Matrices",
"Univariate Function Temporal Similarity",
"Quasiperiodic Behavior Extraction",
"Visual Exploration",
"Temporal Relationships",
"Spatial Relationships",
"Visual Interaction",
"Visual Inspection",
"Data Visualization",
"Information Analysis",
"Context Awareness",
"Smoothing Methods",
"Correlation",
"Machine Learning",
"Comparative Visualization",
"Time Dependent Fields",
"Similarity Analysis",
"Interactive Recurrence Analysis"
],
"authors": [
{
"givenName": "S.",
"surname": "Frey",
"fullName": "S. Frey",
"affiliation": "Visualization Res. Center (VISUS), Univ. of Stuttgart, Stuttgart, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "F.",
"surname": "Sadlo",
"fullName": "F. Sadlo",
"affiliation": "Visualization Res. Center (VISUS), Univ. of Stuttgart, Stuttgart, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "T.",
"surname": "Ertl",
"fullName": "T. Ertl",
"affiliation": "Visualization Res. Center (VISUS), Univ. of Stuttgart, Stuttgart, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2023-2032",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cason/2010/4202/0/4202a638",
"title": "Joint Temporal-Spatial Error Concealment for Multiple Description Video Coding",
"doi": null,
"abstractUrl": "/proceedings-article/cason/2010/4202a638/12OmNBBzoij",
"parentPublication": {
"id": "proceedings/cason/2010/4202/0",
"title": "Computational Aspects of Social Networks, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2010/4270/0/4270a713",
"title": "An Efficient Method for Video Similarity Search with Video Signature",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2010/4270a713/12OmNqBKTXC",
"parentPublication": {
"id": "proceedings/iccis/2010/4270/0",
"title": "2010 International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2011/9618/0/05718613",
"title": "Describing Temporal Correlation Spatially in a Visual Analytics Environment",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2011/05718613/12OmNvpNIoc",
"parentPublication": {
"id": "proceedings/hicss/2011/9618/0",
"title": "2011 44th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iw-mmdbms/1995/7168/0/71680074",
"title": "A Visual Query Language for Identifying Temporal Trends in Video Data",
"doi": null,
"abstractUrl": "/proceedings-article/iw-mmdbms/1995/71680074/12OmNxw5BbW",
"parentPublication": {
"id": "proceedings/iw-mmdbms/1995/7168/0",
"title": "Multimedia Database Management Systems, International Workshop",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mmsd/1996/7511/0/75110120",
"title": "Spatio-Temporal Composition in Multimedia Applications",
"doi": null,
"abstractUrl": "/proceedings-article/mmsd/1996/75110120/12OmNy4r3Rh",
"parentPublication": {
"id": "proceedings/mmsd/1996/7511/0",
"title": "Multimedia Software Development, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ism/2011/4589/0/4589a422",
"title": "Similarity-Based Visualization for Image Browsing Revisited",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2011/4589a422/12OmNyUWR7r",
"parentPublication": {
"id": "proceedings/ism/2011/4589/0",
"title": "2011 IEEE International Symposium on Multimedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isecs/2009/3643/2/3643b056",
"title": "Similarity Retrieval of Video Database Based on 3D Z-string",
"doi": null,
"abstractUrl": "/proceedings-article/isecs/2009/3643b056/12OmNzwZ6sg",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2011/07/ttm2011070982",
"title": "A Distributed Spatial-Temporal Similarity Data Storage Scheme in Wireless Sensor Networks",
"doi": null,
"abstractUrl": "/journal/tm/2011/07/ttm2011070982/13rRUIJuxqh",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/1996/04/k0533",
"title": "Picture Similarity Retrieval Using the 2D Projection Interval Representation",
"doi": null,
"abstractUrl": "/journal/tk/1996/04/k0533/13rRUwdrdKW",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2009/08/ttk2009081147",
"title": "Similarity-Profiled Temporal Association Mining",
"doi": null,
"abstractUrl": "/journal/tk/2009/08/ttk2009081147/13rRUxOdD8y",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012122014",
"articleId": "13rRUxZzAhE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122033",
"articleId": "13rRUxNW1Zl",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRHB",
"name": "ttg2012122023s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012122023s1.zip",
"extension": "zip",
"size": "21.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzFdtc9",
"title": "Aug.",
"year": "2012",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxYIMUX",
"doi": "10.1109/TVCG.2011.128",
"abstract": "We present a new approach for time-varying graph drawing that achieves both spatiotemporal coherence and multifocus+context visualization in a single framework. Our approach utilizes existing graph layout algorithms to produce the initial graph layout, and formulates the problem of generating coherent time-varying graph visualization with the focus+context capability as a specially tailored deformation optimization problem. We adopt the concept of the super graph to maintain spatiotemporal coherence and further balance the needs for aesthetic quality and dynamic stability when interacting with time-varying graphs through focus+context visualization. Our method is particularly useful for multifocus+context visualization of time-varying graphs where we can preserve the mental map by preventing nodes in the focus from undergoing abrupt changes in size and location in the time sequence. Experiments demonstrate that our method strikes a good balance between maintaining spatiotemporal coherence and accentuating visual foci, thus providing a more engaging viewing experience for the users.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a new approach for time-varying graph drawing that achieves both spatiotemporal coherence and multifocus+context visualization in a single framework. Our approach utilizes existing graph layout algorithms to produce the initial graph layout, and formulates the problem of generating coherent time-varying graph visualization with the focus+context capability as a specially tailored deformation optimization problem. We adopt the concept of the super graph to maintain spatiotemporal coherence and further balance the needs for aesthetic quality and dynamic stability when interacting with time-varying graphs through focus+context visualization. Our method is particularly useful for multifocus+context visualization of time-varying graphs where we can preserve the mental map by preventing nodes in the focus from undergoing abrupt changes in size and location in the time sequence. Experiments demonstrate that our method strikes a good balance between maintaining spatiotemporal coherence and accentuating visual foci, thus providing a more engaging viewing experience for the users.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a new approach for time-varying graph drawing that achieves both spatiotemporal coherence and multifocus+context visualization in a single framework. Our approach utilizes existing graph layout algorithms to produce the initial graph layout, and formulates the problem of generating coherent time-varying graph visualization with the focus+context capability as a specially tailored deformation optimization problem. We adopt the concept of the super graph to maintain spatiotemporal coherence and further balance the needs for aesthetic quality and dynamic stability when interacting with time-varying graphs through focus+context visualization. Our method is particularly useful for multifocus+context visualization of time-varying graphs where we can preserve the mental map by preventing nodes in the focus from undergoing abrupt changes in size and location in the time sequence. Experiments demonstrate that our method strikes a good balance between maintaining spatiotemporal coherence and accentuating visual foci, thus providing a more engaging viewing experience for the users.",
"title": "Coherent Time-Varying Graph Drawing with Multifocus+Context Interaction",
"normalizedTitle": "Coherent Time-Varying Graph Drawing with Multifocus+Context Interaction",
"fno": "05963661",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Optimisation",
"Graph Theory",
"Visual Foci",
"Coherent Time Varying Graph Drawing",
"Multifocus Context Interaction",
"Spatiotemporal Coherence",
"Multifocus Context Visualization",
"Graph Layout Algorithms",
"Coherent Time Varying Graph Visualization",
"Focus Context Capability",
"Deformation Optimization Problem",
"Aesthetic Quality",
"Dynamic Stability",
"Focus Context Visualization",
"Layout",
"Visualization",
"Context",
"Heuristic Algorithms",
"Coherence",
"Data Visualization",
"Spatiotemporal Phenomena",
"Focus Context Visualization",
"Graph Drawing",
"Time Varying Graphs",
"Spatiotemporal Coherence"
],
"authors": [
{
"givenName": null,
"surname": "Chaoli Wang",
"fullName": "Chaoli Wang",
"affiliation": "Dept. of Comput. Sci., Michigan Technol. Univ., Houghton, MI, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Kun-Chuan Feng",
"fullName": "Kun-Chuan Feng",
"affiliation": "Dept. of Comput. Sci. & Inf. Eng, Nat. Cheng Kung Univ., Tainan, Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Han-Wei Shen",
"fullName": "Han-Wei Shen",
"affiliation": "Dept. of Comput. Sci. & Eng., Ohio State Univ., Columbus, OH, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Tong-Yee Lee",
"fullName": "Tong-Yee Lee",
"affiliation": "Dept. of Comput. Sci. & Inf. Eng, Nat. Cheng Kung Univ., Tainan, Taiwan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2012-08-01 00:00:00",
"pubType": "trans",
"pages": "1330-1342",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icis/2005/2296/0/22960573",
"title": "Visualizing Hierarchical Information Using a New Focus+Context Method",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2005/22960573/12OmNAJVcDe",
"parentPublication": {
"id": "proceedings/icis/2005/2296/0",
"title": "Proceedings. Fourth Annual ACIS International Conference on Computer and Information Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880147",
"title": "Visibility Culling for Time-Varying Volume Rendering Using Temporal Occlusion Coherence",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880147/12OmNAY79mS",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2011/4602/0/4602a038",
"title": "Information Assisted Visualization of Large Scale Time Varying Scientific Data",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2011/4602a038/12OmNBlFQX0",
"parentPublication": {
"id": "proceedings/icvrv/2011/4602/0",
"title": "2011 International Conference on Virtual Reality and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2013/5099/0/5099a107",
"title": "Multidimensional Projections to Explore Time-Varying Multivariate Volume Data",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2013/5099a107/12OmNrkT7Pm",
"parentPublication": {
"id": "proceedings/sibgrapi/2013/5099/0",
"title": "2013 XXVI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iita/2009/3859/2/3859b041",
"title": "Time Varying Coherence Spectrum Analysis of Multichannel Local Field Potentials and Neuronal Ensemble",
"doi": null,
"abstractUrl": "/proceedings-article/iita/2009/3859b041/12OmNwFicR7",
"parentPublication": {
"id": "proceedings/iita/2009/3859/2",
"title": "2009 Third International Symposium on Intelligent Information Technology Application",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1999/5897/0/58970062",
"title": "A Fast Volume Rendering Algorithm for Time-Varying Fields Using a Time-Space Partitioning (TSP) Tree",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1999/58970062/12OmNxA3YU5",
"parentPublication": {
"id": "proceedings/ieee-vis/1999/5897/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1998/9176/0/91760159",
"title": "Isosurface Extraction in Time-Varying Fields Using a Temporal Hierarchical Index Tree",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1998/91760159/12OmNxYL5dN",
"parentPublication": {
"id": "proceedings/ieee-vis/1998/9176/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2003/2055/0/20550008",
"title": "MoireGraphs: Radial Focus+Context Visualization and Interaction for Graphs with Visual Nodes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2003/20550008/12OmNxiKrV4",
"parentPublication": {
"id": "proceedings/ieee-infovis/2003/2055/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/08/ttg2013081362",
"title": "Stack Zooming for Multifocus Interaction in Skewed-Aspect Visual Spaces",
"doi": null,
"abstractUrl": "/journal/tg/2013/08/ttg2013081362/13rRUx0xPi8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/01/v0014",
"title": "Time-Varying Contour Topology",
"doi": null,
"abstractUrl": "/journal/tg/2006/01/v0014/13rRUzp02oc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012081189",
"articleId": "13rRUxBa5xg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05999664",
"articleId": "13rRUygT7sC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"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": "13rRUwI5TXw",
"doi": "10.1109/TVCG.2009.61",
"abstract": "Vector fields analysis traditionally distinguishes conservative (curl-free) from mass preserving (divergence-free) components. The Helmholtz-Hodge decomposition allows separating any vector field into the sum of three uniquely defined components: curl free, divergence free and harmonic. This decomposition is usually achieved by using mesh-based methods such as finite differences or finite elements. This work presents a new meshless approach to the Helmholtz-Hodge decomposition for the analysis of 2D discrete vector fields. It embeds into the SPH particle-based framework. The proposed method is efficient and can be applied to extract features from a 2D discrete vector field and to multiphase fluid flow simulation to ensure incompressibility.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Vector fields analysis traditionally distinguishes conservative (curl-free) from mass preserving (divergence-free) components. The Helmholtz-Hodge decomposition allows separating any vector field into the sum of three uniquely defined components: curl free, divergence free and harmonic. This decomposition is usually achieved by using mesh-based methods such as finite differences or finite elements. This work presents a new meshless approach to the Helmholtz-Hodge decomposition for the analysis of 2D discrete vector fields. It embeds into the SPH particle-based framework. The proposed method is efficient and can be applied to extract features from a 2D discrete vector field and to multiphase fluid flow simulation to ensure incompressibility.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Vector fields analysis traditionally distinguishes conservative (curl-free) from mass preserving (divergence-free) components. The Helmholtz-Hodge decomposition allows separating any vector field into the sum of three uniquely defined components: curl free, divergence free and harmonic. This decomposition is usually achieved by using mesh-based methods such as finite differences or finite elements. This work presents a new meshless approach to the Helmholtz-Hodge decomposition for the analysis of 2D discrete vector fields. It embeds into the SPH particle-based framework. The proposed method is efficient and can be applied to extract features from a 2D discrete vector field and to multiphase fluid flow simulation to ensure incompressibility.",
"title": "Meshless Helmholtz-Hodge Decomposition",
"normalizedTitle": "Meshless Helmholtz-Hodge Decomposition",
"fno": "ttg2010020338",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Helmholtz Hodge Decomposition",
"Smoothed Particles Hydrodynamics",
"Vector Field",
"Features Visualization",
"Multiphase Fluids",
"Incompressible Flow"
],
"authors": [
{
"givenName": "Fabiano",
"surname": "Petronetto",
"fullName": "Fabiano Petronetto",
"affiliation": "Universidad Federal do Espírito Santo, Brazil",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Afonso",
"surname": "Paiva",
"fullName": "Afonso Paiva",
"affiliation": "Universidade Federal de Uberlândia, Minas Gerais",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marcos",
"surname": "Lage",
"fullName": "Marcos Lage",
"affiliation": "PUC-Rio, Rio de Janeiro",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Geovan",
"surname": "Tavares",
"fullName": "Geovan Tavares",
"affiliation": "PUC-Rio, Rio de Janeiro",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hélio",
"surname": "Lopes",
"fullName": "Hélio Lopes",
"affiliation": "PUC-Rio, Rio de Janeiro",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Lewiner",
"fullName": "Thomas Lewiner",
"affiliation": "PUC-Rio, Rio de Janeiro",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2010-03-01 00:00:00",
"pubType": "trans",
"pages": "338-349",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ssst/1991/2190/0/00138595",
"title": "Helmholtz decomposition of surface electric current in electromagnetic scattering problems",
"doi": null,
"abstractUrl": "/proceedings-article/ssst/1991/00138595/12OmNApLGtx",
"parentPublication": {
"id": "proceedings/ssst/1991/2190/0",
"title": "The Twenty-Third Southeastern Symposium on System Theory",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asia/2009/3910/0/3910a157",
"title": "Helmholtz Equation and Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/asia/2009/3910a157/12OmNwHyZZC",
"parentPublication": {
"id": "proceedings/asia/2009/3910/0",
"title": "2009 International Asia Symposium on Intelligent Interaction and Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2014/4717/0/06890546",
"title": "Feature extraction of complex ocean flow field using the helmholtz-hodge decomposition",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2014/06890546/12OmNxA3YZS",
"parentPublication": {
"id": "proceedings/icmew/2014/4717/0",
"title": "2014 IEEE International Conference on Multimedia and Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/3/3336e287",
"title": "Parallel Preconditioned GMRES Solvers for 3-D Helmholtz Equations in Regional Non-hydrostatic Atmosphere Model",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336e287/12OmNyk2ZYC",
"parentPublication": {
"id": "proceedings/csse/2008/3336/3",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2013/05/mcs2013050042",
"title": "Discrete Hodge Theory on Graphs: A Tutorial",
"doi": null,
"abstractUrl": "/magazine/cs/2013/05/mcs2013050042/13rRUILLkzl",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/08/ttg2013081386",
"title": "The Helmholtz-Hodge Decomposition—A Survey",
"doi": null,
"abstractUrl": "/journal/tg/2013/08/ttg2013081386/13rRUwI5U7X",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/11/06774477",
"title": "The Natural Helmholtz-Hodge Decomposition for Open-Boundary Flow Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2014/11/06774477/13rRUxYrbUJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/03/v0289",
"title": "Segmentation of Discrete Vector Fields",
"doi": null,
"abstractUrl": "/journal/tg/2006/03/v0289/13rRUxcbnCj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/03/ttg2013030527",
"title": "Comments on the \"Meshless Helmholtz-Hodge Decomposition\"",
"doi": null,
"abstractUrl": "/journal/tg/2013/03/ttg2013030527/13rRUyYSWsU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/02/09166766",
"title": "Meshless Approximation and Helmholtz-Hodge Decomposition of Vector Fields",
"doi": null,
"abstractUrl": "/journal/tg/2022/02/09166766/1mgaO3cO3aU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010020325",
"articleId": "13rRUwdIOUF",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqzu6X1",
"title": "November/December",
"year": "2017",
"issueNum": "06",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "37",
"label": "November/December",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwwslv6",
"doi": "10.1109/MCG.2017.4031066",
"abstract": "The proposed physics-based approach can generate stable and robust full-body animation of various gaits under different gravitational conditions. The authors use a pre-estimation model based on the Froude number to predict the desired velocity and stride frequency of a character model in hypogravity and then generate full-body animation using a pendulum trajectory generator, motion planner, and tracking.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The proposed physics-based approach can generate stable and robust full-body animation of various gaits under different gravitational conditions. The authors use a pre-estimation model based on the Froude number to predict the desired velocity and stride frequency of a character model in hypogravity and then generate full-body animation using a pendulum trajectory generator, motion planner, and tracking.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The proposed physics-based approach can generate stable and robust full-body animation of various gaits under different gravitational conditions. The authors use a pre-estimation model based on the Froude number to predict the desired velocity and stride frequency of a character model in hypogravity and then generate full-body animation using a pendulum trajectory generator, motion planner, and tracking.",
"title": "Full-Body Animation of Human Locomotion in Reduced Gravity Using Physics-Based Control",
"normalizedTitle": "Full-Body Animation of Human Locomotion in Reduced Gravity Using Physics-Based Control",
"fno": "mcg2017060028",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Computer Animation",
"Gait Analysis",
"Nonlinear Control Systems",
"Path Planning",
"Pendulums",
"Physics Based Control",
"Tracking",
"Motion Planner",
"Gravitational Conditions",
"Pendulum Trajectory Generator",
"Character Model",
"Stride Frequency",
"Froude Number",
"Pre Estimation Model",
"Robust Full Body Animation",
"Stable Body Animation",
"Reduced Gravity",
"Human Locomotion",
"Gravity",
"Computational Modeling",
"Legged Locomotion",
"Predictive Models",
"Adaptation Models",
"Trajectory",
"Biological System Modeling",
"Computer Graphics",
"3 D Graphics",
"Animation",
"Computational Geometry",
"Object Modeling",
"Physics Based Modeling"
],
"authors": [
{
"givenName": "Yun-hyeong",
"surname": "Kim",
"fullName": "Yun-hyeong Kim",
"affiliation": "Ewha Womans University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Taesoo",
"surname": "Kwon",
"fullName": "Taesoo Kwon",
"affiliation": "Hanyang University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daeun",
"surname": "Song",
"fullName": "Daeun Song",
"affiliation": "Ewha Womans University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Young J.",
"surname": "Kim",
"fullName": "Young J. Kim",
"affiliation": "Ewha Womans University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2017-11-01 00:00:00",
"pubType": "mags",
"pages": "28-39",
"year": "2017",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccvw/2017/1034/0/1034b573",
"title": "Toward Describing Human Gaits by Onomatopoeias",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034b573/12OmNCmGNXG",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1991/2163/0/00131938",
"title": "Turning gait of a quadrupedal walking machine",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1991/00131938/12OmNqEAT3E",
"parentPublication": {
"id": "proceedings/robot/1991/2163/0",
"title": "Proceedings. 1991 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iih-msp/2007/2994/1/04457560",
"title": "IMHAP – An Experimental Platform for Humanoid Procedural Animation",
"doi": null,
"abstractUrl": "/proceedings-article/iih-msp/2007/04457560/12OmNrGb2cL",
"parentPublication": {
"id": "iih-msp/2007/2994/1",
"title": "Intelligent Information Hiding and Multimedia Signal Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1991/2163/0/00131669",
"title": "Kinematics of hyper-redundant robot locomotion with applications to grasping",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1991/00131669/12OmNvmXJ1P",
"parentPublication": {
"id": "proceedings/robot/1991/2163/0",
"title": "Proceedings. 1991 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2015/9403/0/9403a379",
"title": "Towards Crowd-Sourced Parameter Optimisation for Procedural Animation",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2015/9403a379/12OmNy68EOG",
"parentPublication": {
"id": "proceedings/cw/2015/9403/0",
"title": "2015 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2013/5048/0/5048a460",
"title": "Perception of Emotional Gaits Using Avatar Animation of Real and Artificially Synthesized Gaits",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2013/5048a460/12OmNzWx07H",
"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/ca/1995/7062/0/70620146",
"title": "Quick tuning of a reference locomotion gait [computer animation]",
"doi": null,
"abstractUrl": "/proceedings-article/ca/1995/70620146/12OmNzcPAaf",
"parentPublication": {
"id": "proceedings/ca/1995/7062/0",
"title": "Computer Animation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2017/6647/0/07892300",
"title": "Virtual zero gravity impact on internal gravity model",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2017/07892300/12OmNzkuKL6",
"parentPublication": {
"id": "proceedings/vr/2017/6647/0",
"title": "2017 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a056",
"title": "Physics-based character animation for Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a056/1CJdEcF4PjG",
"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/2021/06/08907402",
"title": "Modeling Data-Driven Dominance Traits for Virtual Characters Using Gait Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/08907402/1f75TiiWgik",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2017060026",
"articleId": "13rRUx0xPpu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2017060040",
"articleId": "13rRUxBa5ep",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwdL7lu",
"title": "July/August",
"year": "2006",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "12",
"label": "July/August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwgQpDh",
"doi": "10.1109/TVCG.2006.77",
"abstract": "Abstract—This paper presents a novel method for volume rendering of unstructured grids. Previously [CHECK END OF SENTENCE], we introduced an algorithm for perspective-correct interpolation of barycentric coordinates and computing polynomial attenuation integrals for a projected tetrahedron using graphics hardware. Here, we enhance the algorithm by providing a simple and efficient method to compute the projected shape (silhouette) and tessellation of a tetrahedron, in perspective and orthographic projection models. Our tessellation algorithm is published here for the first time. Compared with works of other groups on rendering unstructured grids, the main contributions of this work are: 1) A new algorithm for finding the silhouette of a projected tetrahedron. 2) A method for interpolating barycentric coordinates and thickness on the faces of the tetrahedron. 3) Visualizing higher-order attenuation functions using GPU without preintegration. 4) Capability of applying shape deformations to a rendered tetrahedral mesh without significant performance loss. Our visualization model is independent of depth-sorting of the cells. We present imaging and timing results of our implementation, and an application in time-critical \"2D-3D” deformable registration of anatomical models. We discuss the impact of using higher-order functions on quality and performance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—This paper presents a novel method for volume rendering of unstructured grids. Previously [CHECK END OF SENTENCE], we introduced an algorithm for perspective-correct interpolation of barycentric coordinates and computing polynomial attenuation integrals for a projected tetrahedron using graphics hardware. Here, we enhance the algorithm by providing a simple and efficient method to compute the projected shape (silhouette) and tessellation of a tetrahedron, in perspective and orthographic projection models. Our tessellation algorithm is published here for the first time. Compared with works of other groups on rendering unstructured grids, the main contributions of this work are: 1) A new algorithm for finding the silhouette of a projected tetrahedron. 2) A method for interpolating barycentric coordinates and thickness on the faces of the tetrahedron. 3) Visualizing higher-order attenuation functions using GPU without preintegration. 4) Capability of applying shape deformations to a rendered tetrahedral mesh without significant performance loss. Our visualization model is independent of depth-sorting of the cells. We present imaging and timing results of our implementation, and an application in time-critical \"2D-3D” deformable registration of anatomical models. We discuss the impact of using higher-order functions on quality and performance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—This paper presents a novel method for volume rendering of unstructured grids. Previously [CHECK END OF SENTENCE], we introduced an algorithm for perspective-correct interpolation of barycentric coordinates and computing polynomial attenuation integrals for a projected tetrahedron using graphics hardware. Here, we enhance the algorithm by providing a simple and efficient method to compute the projected shape (silhouette) and tessellation of a tetrahedron, in perspective and orthographic projection models. Our tessellation algorithm is published here for the first time. Compared with works of other groups on rendering unstructured grids, the main contributions of this work are: 1) A new algorithm for finding the silhouette of a projected tetrahedron. 2) A method for interpolating barycentric coordinates and thickness on the faces of the tetrahedron. 3) Visualizing higher-order attenuation functions using GPU without preintegration. 4) Capability of applying shape deformations to a rendered tetrahedral mesh without significant performance loss. Our visualization model is independent of depth-sorting of the cells. We present imaging and timing results of our implementation, and an application in time-critical \"2D-3D” deformable registration of anatomical models. We discuss the impact of using higher-order functions on quality and performance.",
"title": "Projected Tetrahedra Revisited: A Barycentric Formulation Applied to Digital Radiograph Reconstruction Using Higher-Order Attenuation Functions",
"normalizedTitle": "Projected Tetrahedra Revisited: A Barycentric Formulation Applied to Digital Radiograph Reconstruction Using Higher-Order Attenuation Functions",
"fno": "v0461",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Volume Rendering",
"Unstructured Grids",
"Projected Tetrahedra",
"DRR",
"Higher Order Volumetric Functions"
],
"authors": [
{
"givenName": "Ofri",
"surname": "Sadowsky",
"fullName": "Ofri Sadowsky",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jonathan D.",
"surname": "Cohen",
"fullName": "Jonathan D. Cohen",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Russell H.",
"surname": "Taylor",
"fullName": "Russell H. Taylor",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2006-07-01 00:00:00",
"pubType": "trans",
"pages": "461-473",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2005/2766/0/27660039",
"title": "Rendering Tetrahedral Meshes with Higher-Order Attenuation Functions for Digital Radiograph Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660039/12OmNAoUTua",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880027",
"title": "Projecting Tetrahedra without Rendering Artifacts",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880027/12OmNBbsidz",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/camp/2000/0740/0/07400331",
"title": "Homography Based Parallel Volume Intersection: Toward Real-Time Volume Reconstruction using Active Cameras",
"doi": null,
"abstractUrl": "/proceedings-article/camp/2000/07400331/12OmNzWx073",
"parentPublication": {
"id": "proceedings/camp/2000/0740/0",
"title": "Computer Architectures for Machine Perception, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0446",
"articleId": "13rRUEgs2LU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0474",
"articleId": "13rRUwhHcQN",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNro0HSA",
"title": "June",
"year": "1989",
"issueNum": "06",
"idPrefix": "tp",
"pubType": "journal",
"volume": "11",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwh80Cp",
"doi": "10.1109/34.24799",
"abstract": "Two simple methods are given for obtaining the surface shape using a projected grid. After the camera is calibrated to the 3-D workspace, the only input date needed for the computation of surface normals are grid intersect points in a single 2-D image. The first method performs nonlinear computations based on the distortion of the lengths of the grid edges and does not require a full calibration matrix. The second method requires that a full parallel projection model of the imaging is available, which enables it to compute 3-D normals using simple linear computations. The linear method performed better overall in the experiments, but both methods produced normals within 4-8 degrees of known 3-D directions. These methods appear to be superior to methods based on shape-from-shading because the results are comparable, yet the equipment setup is simpler and the processing is not very sensitive to object reflectance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Two simple methods are given for obtaining the surface shape using a projected grid. After the camera is calibrated to the 3-D workspace, the only input date needed for the computation of surface normals are grid intersect points in a single 2-D image. The first method performs nonlinear computations based on the distortion of the lengths of the grid edges and does not require a full calibration matrix. The second method requires that a full parallel projection model of the imaging is available, which enables it to compute 3-D normals using simple linear computations. The linear method performed better overall in the experiments, but both methods produced normals within 4-8 degrees of known 3-D directions. These methods appear to be superior to methods based on shape-from-shading because the results are comparable, yet the equipment setup is simpler and the processing is not very sensitive to object reflectance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Two simple methods are given for obtaining the surface shape using a projected grid. After the camera is calibrated to the 3-D workspace, the only input date needed for the computation of surface normals are grid intersect points in a single 2-D image. The first method performs nonlinear computations based on the distortion of the lengths of the grid edges and does not require a full calibration matrix. The second method requires that a full parallel projection model of the imaging is available, which enables it to compute 3-D normals using simple linear computations. The linear method performed better overall in the experiments, but both methods produced normals within 4-8 degrees of known 3-D directions. These methods appear to be superior to methods based on shape-from-shading because the results are comparable, yet the equipment setup is simpler and the processing is not very sensitive to object reflectance.",
"title": "Surface Orientation from a Projected Grid",
"normalizedTitle": "Surface Orientation from a Projected Grid",
"fno": "i0650",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"2 D Images Surface Orientation Computer Vision Pattern Recognition Projected Grid Surface Shape Surface Normals Nonlinear Computations Distortion Calibration Matrix Parallel Projection Model Computer Vision Computerised Pattern Recognition Matrix Algebra"
],
"authors": [
{
"givenName": "N.",
"surname": "Shrikhande",
"fullName": "N. Shrikhande",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "G.",
"surname": "Stockman",
"fullName": "G. Stockman",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "1989-06-01 00:00:00",
"pubType": "trans",
"pages": "650-655",
"year": "1989",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0643",
"articleId": "13rRUytF42k",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0655",
"articleId": "13rRUEgarkg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO06y",
"title": "October",
"year": "2009",
"issueNum": "10",
"idPrefix": "tp",
"pubType": "journal",
"volume": "31",
"label": "October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0gegq",
"doi": "10.1109/TPAMI.2008.294",
"abstract": "This paper describes an invariant-based shape- and motion reconstruction algorithm for 3D-to-1D orthographically projected range data taken from unknown viewpoints. The algorithm exploits the object-image relation that arises in echo-based range data and represents a simplification and unification of previous work in the literature. Unlike one proposed approach, this method does not require uniqueness constraints, which makes its algorithmic form independent of the translation removal process (centroid removal, range alignment, etc.). The new algorithm, which simultaneously incorporates every projection and does not use an initialization in the optimization process, requires fewer calculations and is more straightforward than the previous approach. Additionally, the new algorithm is shown to be the natural extension of the approach developed by Tomasi and Kanade for 3D-to-2D orthographically projected data and is applied to a realistic inverse synthetic aperture radar imaging scenario, as well as experiments with varying amounts of aperture diversity and noise.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper describes an invariant-based shape- and motion reconstruction algorithm for 3D-to-1D orthographically projected range data taken from unknown viewpoints. The algorithm exploits the object-image relation that arises in echo-based range data and represents a simplification and unification of previous work in the literature. Unlike one proposed approach, this method does not require uniqueness constraints, which makes its algorithmic form independent of the translation removal process (centroid removal, range alignment, etc.). The new algorithm, which simultaneously incorporates every projection and does not use an initialization in the optimization process, requires fewer calculations and is more straightforward than the previous approach. Additionally, the new algorithm is shown to be the natural extension of the approach developed by Tomasi and Kanade for 3D-to-2D orthographically projected data and is applied to a realistic inverse synthetic aperture radar imaging scenario, as well as experiments with varying amounts of aperture diversity and noise.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper describes an invariant-based shape- and motion reconstruction algorithm for 3D-to-1D orthographically projected range data taken from unknown viewpoints. The algorithm exploits the object-image relation that arises in echo-based range data and represents a simplification and unification of previous work in the literature. Unlike one proposed approach, this method does not require uniqueness constraints, which makes its algorithmic form independent of the translation removal process (centroid removal, range alignment, etc.). The new algorithm, which simultaneously incorporates every projection and does not use an initialization in the optimization process, requires fewer calculations and is more straightforward than the previous approach. Additionally, the new algorithm is shown to be the natural extension of the approach developed by Tomasi and Kanade for 3D-to-2D orthographically projected data and is applied to a realistic inverse synthetic aperture radar imaging scenario, as well as experiments with varying amounts of aperture diversity and noise.",
"title": "Shape and Motion Reconstruction from 3D-to-1D Orthographically Projected Data via Object-Image Relations",
"normalizedTitle": "Shape and Motion Reconstruction from 3D-to-1D Orthographically Projected Data via Object-Image Relations",
"fno": "ttp2009101906",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Geometric Invariants",
"Object Image Relation",
"Factorization Method",
"Shape From Motion",
"Orthographic Projection",
"Moving Target Imaging"
],
"authors": [
{
"givenName": "Matthew",
"surname": "Ferrara",
"fullName": "Matthew Ferrara",
"affiliation": "Air Force Research Laboratory, Dayton",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gregory",
"surname": "Arnold",
"fullName": "Gregory Arnold",
"affiliation": "Air Force Research Laboratory, Dayton",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mark",
"surname": "Stuff",
"fullName": "Mark Stuff",
"affiliation": "Michigan Tech Research Institute, Ann Arbor",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2009-10-01 00:00:00",
"pubType": "trans",
"pages": "1906-1912",
"year": "2009",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2008/2242/0/04587693",
"title": "Off-axis aperture camera: 3D shape reconstruction and image restoration",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2008/04587693/12OmNAlNiRy",
"parentPublication": {
"id": "proceedings/cvpr/2008/2242/0",
"title": "2008 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2006/2701/0/270100414",
"title": "P3C: A Robust Projected Clustering Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2006/270100414/12OmNBU1jLr",
"parentPublication": {
"id": "proceedings/icdm/2006/2701/0",
"title": "Sixth International Conference on Data Mining (ICDM'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2009/4420/0/05459388",
"title": "Improving accuracy of geometric parameter estimation using projected score method",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2009/05459388/12OmNx0RISt",
"parentPublication": {
"id": "proceedings/iccv/2009/4420/0",
"title": "2009 IEEE 12th International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1995/7042/0/70420995",
"title": "Real-time focus range sensor",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1995/70420995/12OmNxGj9Yv",
"parentPublication": {
"id": "proceedings/iccv/1995/7042/0",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761016",
"title": "3D reconstruction by combining shape from silhouette with stereo",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761016/12OmNyS6ROK",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2012/1611/0/06239256",
"title": "A content-based video copy detection method with randomly projected binary features",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2012/06239256/12OmNzX6cth",
"parentPublication": {
"id": "proceedings/cvprw/2012/1611/0",
"title": "2012 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2003/08/i0974",
"title": "Terrain Analysis Using Radar Shape-from-Shading",
"doi": null,
"abstractUrl": "/journal/tp/2003/08/i0974/13rRUEgartI",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1996/12/i1186",
"title": "Real-Time Focus Range Sensor",
"doi": null,
"abstractUrl": "/journal/tp/1996/12/i1186/13rRUwh80vt",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1996/02/i0211",
"title": "3D Shape Reconstruction by Using Vanishing Points",
"doi": null,
"abstractUrl": "/journal/tp/1996/02/i0211/13rRUxASu1F",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2011/03/ttb2011030797",
"title": "3D Shape Reconstruction of Loop Objects in X-Ray Protein Crystallography",
"doi": null,
"abstractUrl": "/journal/tb/2011/03/ttb2011030797/13rRUxNW23f",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2009101898",
"articleId": "13rRUwjXZKJ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2009101913",
"articleId": "13rRUwInvtW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyOq4VQ",
"title": "Sept.-Oct.",
"year": "2019",
"issueNum": "05",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "21",
"label": "Sept.-Oct.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "14qdcRKegef",
"doi": "10.1109/MCSE.2018.2873885",
"abstract": "Most methods in traffic simulations cannot deal with emergency circumstances. Inspired by the full velocity difference model (FVDM), we propose an improved approach called the synthetic vision based FVDM. Through numerous simulations, the experimental results demonstrate our SV-FVDM method can effectively generate interactive and realistic traffic simulations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Most methods in traffic simulations cannot deal with emergency circumstances. Inspired by the full velocity difference model (FVDM), we propose an improved approach called the synthetic vision based FVDM. Through numerous simulations, the experimental results demonstrate our SV-FVDM method can effectively generate interactive and realistic traffic simulations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Most methods in traffic simulations cannot deal with emergency circumstances. Inspired by the full velocity difference model (FVDM), we propose an improved approach called the synthetic vision based FVDM. Through numerous simulations, the experimental results demonstrate our SV-FVDM method can effectively generate interactive and realistic traffic simulations.",
"title": "SV-FVDM: A Synthetic Vision Based Full Velocity Difference Model for Interactive Traffic Simulation",
"normalizedTitle": "SV-FVDM: A Synthetic Vision Based Full Velocity Difference Model for Interactive Traffic Simulation",
"fno": "08493608",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Computer Vision",
"Road Accidents",
"Road Traffic",
"Traffic Engineering Computing",
"Synthetic Vision",
"Numerous Simulations",
"SV FVDM Method",
"Interactive Traffic Simulations",
"Realistic Traffic Simulations",
"Full Velocity Difference Model",
"Interactive Traffic Simulation",
"Emergency Circumstances",
"Computational Modeling",
"Traffic Control",
"Collision Avoidance",
"Solid Modeling",
"Machine Vision",
"Trajectory",
"Synthetic Vision",
"Traffic Simulation",
"Collision Avoidance",
"Lane Change"
],
"authors": [
{
"givenName": "Wu",
"surname": "He",
"fullName": "Wu He",
"affiliation": "Sichuan Normal University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zuning",
"surname": "Li",
"fullName": "Zuning Li",
"affiliation": "University of Electronic Science and Technology of China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shanwen",
"surname": "Yang",
"fullName": "Shanwen Yang",
"affiliation": "Southwest Jiaotong University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Quan",
"fullName": "Wei Quan",
"affiliation": "Southwest Jiaotong University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2019-09-01 00:00:00",
"pubType": "mags",
"pages": "35-45",
"year": "2019",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2014/2871/0/06802067",
"title": "Real-time path planning in emergency using non-uniform safety fields",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2014/06802067/12OmNAoDi4H",
"parentPublication": {
"id": "proceedings/vr/2014/2871/0",
"title": "2014 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pads/2008/3159/0/3159a033",
"title": "Parallel Vehicular Traffic Simulation using Reverse Computation-based Optimistic Execution",
"doi": null,
"abstractUrl": "/proceedings-article/pads/2008/3159a033/12OmNCm7BNi",
"parentPublication": {
"id": "proceedings/pads/2008/3159/0",
"title": "2008 22nd Workshop on Principles of Advanced and Distributed Simulation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bife/2013/4777/0/4777a023",
"title": "A Modified Recursive Probabilistic Velocity Obstacles Model for Multi-agent Navigation",
"doi": null,
"abstractUrl": "/proceedings-article/bife/2013/4777a023/12OmNzZmZlf",
"parentPublication": {
"id": "proceedings/bife/2013/4777/0",
"title": "2013 Sixth International Conference on Business Intelligence and Financial Engineering (BIFE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis/2018/5892/0/08466544",
"title": "Flight Safety Analysis with Multi-information’s Dynamic Perception and Synthesis",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2018/08466544/13Jkrb8ju9l",
"parentPublication": {
"id": "proceedings/icis/2018/5892/0",
"title": "2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wowmom/2018/4725/0/08449742",
"title": "Environment-Aware Communications for Cooperative Collision Avoidance Applications",
"doi": null,
"abstractUrl": "/proceedings-article/wowmom/2018/08449742/13bd1gJ1v0o",
"parentPublication": {
"id": "proceedings/wowmom/2018/4725/0",
"title": "2018 IEEE 19th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2009/01/mex2009010014",
"title": "Agent-Based Approach to Free-Flight Planning, Control, and Simulation",
"doi": null,
"abstractUrl": "/magazine/ex/2009/01/mex2009010014/13rRUxE04pm",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoias/2019/2662/0/266200a102",
"title": "Risk Assessment for Integral Safety in Automated Driving",
"doi": null,
"abstractUrl": "/proceedings-article/icoias/2019/266200a102/1c8PbKnMTYI",
"parentPublication": {
"id": "proceedings/icoias/2019/2662/0",
"title": "2019 2nd International Conference on Intelligent Autonomous Systems (ICoIAS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/03/08865441",
"title": "Heter-Sim: Heterogeneous Multi-Agent Systems Simulation by Interactive Data-Driven Optimization",
"doi": null,
"abstractUrl": "/journal/tg/2021/03/08865441/1e2DgJkkm0E",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2020/5608/0/09089637",
"title": "Eye-Gaze Activity in Crowds: Impact of Virtual Reality and Density",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2020/09089637/1jIx9WIWd5C",
"parentPublication": {
"id": "proceedings/vr/2020/5608/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2020/7303/0/730300a018",
"title": "Socially-Aware Multi-agent Velocity Obstacle Based Navigation for Nonholonomic Vehicles",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2020/730300a018/1nkDmLRKgEg",
"parentPublication": {
"id": "proceedings/compsac/2020/7303/0",
"title": "2020 IEEE 44th Annual Computers, Software, and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08254308",
"articleId": "13rRUwkxc1m",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08254310",
"articleId": "13rRUxZRbvK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1tpwYQ0ziX6",
"title": "May-June",
"year": "2021",
"issueNum": "03",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "41",
"label": "May-June",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1sq7GVOZ8nS",
"doi": "10.1109/MCG.2021.3069948",
"abstract": "Facial expression editing plays a fundamental role in facial expression generation and has been widely applied in modern film productions and computer games. While the existing 2-D caricature facial expression editing methods are mostly realized by expression interpolation from the original image to the target image, expression extrapolation has rarely been studied before. In this article, we propose a novel expression extrapolation method for caricature facial expressions based on the Kendall shape space, in which the key idea is to introduce a representation for the 3-D expression model to remove rigid transformations, such as translation, scaling, and rotation, from the Kendall shape space. Built upon the proposed representation, the 2-D caricature expression extrapolation process can be controlled by the 3-D model reconstructed from the input 2-D caricature image and the exaggerated expressions of the caricature images generated based on the extrapolated expression of a 3-D model that is robust to facial poses in the Kendall shape space; this 3-D model can be calculated with tools such as exponential mapping in Riemannian space. The experimental results demonstrate that our method can effectively and automatically extrapolate facial expressions in caricatures with high consistency and fidelity. In addition, we derive 3-D facial models with diverse expressions and expand the scale of the original FaceWarehouse database. Furthermore, compared with the deep learning method, our approach is based on standard face datasets and avoids the construction of complicated 3-D caricature training sets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Facial expression editing plays a fundamental role in facial expression generation and has been widely applied in modern film productions and computer games. While the existing 2-D caricature facial expression editing methods are mostly realized by expression interpolation from the original image to the target image, expression extrapolation has rarely been studied before. In this article, we propose a novel expression extrapolation method for caricature facial expressions based on the Kendall shape space, in which the key idea is to introduce a representation for the 3-D expression model to remove rigid transformations, such as translation, scaling, and rotation, from the Kendall shape space. Built upon the proposed representation, the 2-D caricature expression extrapolation process can be controlled by the 3-D model reconstructed from the input 2-D caricature image and the exaggerated expressions of the caricature images generated based on the extrapolated expression of a 3-D model that is robust to facial poses in the Kendall shape space; this 3-D model can be calculated with tools such as exponential mapping in Riemannian space. The experimental results demonstrate that our method can effectively and automatically extrapolate facial expressions in caricatures with high consistency and fidelity. In addition, we derive 3-D facial models with diverse expressions and expand the scale of the original FaceWarehouse database. Furthermore, compared with the deep learning method, our approach is based on standard face datasets and avoids the construction of complicated 3-D caricature training sets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Facial expression editing plays a fundamental role in facial expression generation and has been widely applied in modern film productions and computer games. While the existing 2-D caricature facial expression editing methods are mostly realized by expression interpolation from the original image to the target image, expression extrapolation has rarely been studied before. In this article, we propose a novel expression extrapolation method for caricature facial expressions based on the Kendall shape space, in which the key idea is to introduce a representation for the 3-D expression model to remove rigid transformations, such as translation, scaling, and rotation, from the Kendall shape space. Built upon the proposed representation, the 2-D caricature expression extrapolation process can be controlled by the 3-D model reconstructed from the input 2-D caricature image and the exaggerated expressions of the caricature images generated based on the extrapolated expression of a 3-D model that is robust to facial poses in the Kendall shape space; this 3-D model can be calculated with tools such as exponential mapping in Riemannian space. The experimental results demonstrate that our method can effectively and automatically extrapolate facial expressions in caricatures with high consistency and fidelity. In addition, we derive 3-D facial models with diverse expressions and expand the scale of the original FaceWarehouse database. Furthermore, compared with the deep learning method, our approach is based on standard face datasets and avoids the construction of complicated 3-D caricature training sets.",
"title": "Caricature Expression Extrapolation Based on Kendall Shape Space Theory",
"normalizedTitle": "Caricature Expression Extrapolation Based on Kendall Shape Space Theory",
"fno": "09392265",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Computer Animation",
"Emotion Recognition",
"Extrapolation",
"Face Recognition",
"Learning Artificial Intelligence",
"Visual Databases",
"Diverse Expressions",
"3 D Caricature Training Sets",
"Caricature Expression Extrapolation",
"Kendall Shape Space Theory",
"Facial Expression Generation",
"Modern Film Productions",
"Computer Games",
"Existing 2 D Caricature Facial Expression Editing Methods",
"Expression Interpolation",
"Expression Extrapolation Method",
"Caricature Facial Expressions",
"3 D Expression Model",
"Input 2 D Caricature Image",
"Exaggerated Expressions",
"Caricature Images",
"Extrapolated Expression",
"3 D Model",
"Facial Poses",
"Automatically Extrapolate Facial Expressions",
"Caricatures",
"3 D Facial Models",
"Three Dimensional Displays",
"Solid Modeling",
"Extrapolation",
"Two Dimensional Displays",
"Image Reconstruction",
"Databases"
],
"authors": [
{
"givenName": "Na",
"surname": "Liu",
"fullName": "Na Liu",
"affiliation": "Beijing Normal University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dan",
"surname": "Zhang",
"fullName": "Dan Zhang",
"affiliation": "Qinghai Normal University, Xining, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xudong",
"surname": "Ru",
"fullName": "Xudong Ru",
"affiliation": "Beijing Normal University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haichuan",
"surname": "Zhao",
"fullName": "Haichuan Zhao",
"affiliation": "Beijing Normal University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xingce",
"surname": "Wang",
"fullName": "Xingce Wang",
"affiliation": "Beijing Normal University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhongke",
"surname": "Wu",
"fullName": "Zhongke Wu",
"affiliation": "Beijing Normal University, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2021-05-01 00:00:00",
"pubType": "mags",
"pages": "71-84",
"year": "2021",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/acii/2017/0563/0/08273654",
"title": "CNN based 3D facial expression recognition using masking and landmark features",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2017/08273654/12OmNrAMEJB",
"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/cw/2014/4677/0/4677a213",
"title": "A Study on Perceived Similarity between Photograph and Shape Exaggerated Caricature",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2014/4677a213/12OmNwsNR9G",
"parentPublication": {
"id": "proceedings/cw/2014/4677/0",
"title": "2014 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2008/2570/0/04607591",
"title": "3D caricature generation by manifold learning",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2008/04607591/12OmNzQR1nw",
"parentPublication": {
"id": "proceedings/icme/2008/2570/0",
"title": "2008 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000h336",
"title": "Alive Caricature from 2D to 3D",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000h336/17D45W2Wyzi",
"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/cw/2018/7315/0/731500a033",
"title": "Facial Expression Editing in Face Sketch Using Shape Space Theory",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2018/731500a033/17D45XacGkk",
"parentPublication": {
"id": "proceedings/cw/2018/7315/0",
"title": "2018 International Conference on Cyberworlds (CW)",
"__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/cvprw/2019/2506/0/250600c927",
"title": "Multimodal 2D and 3D for In-The-Wild Facial Expression Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2019/250600c927/1iTvp8peZOg",
"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/icme/2020/1331/0/09102811",
"title": "Expression-Aware Face Reconstruction Via A Dual-Stream Network",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2020/09102811/1kwr15w4dQQ",
"parentPublication": {
"id": "proceedings/icme/2020/1331/0",
"title": "2020 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2020/10/08787885",
"title": "Sparse Coding of Shape Trajectories for Facial Expression and Action Recognition",
"doi": null,
"abstractUrl": "/journal/tp/2020/10/08787885/1mP2aZxtzCU",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/04/09609545",
"title": "3D-CariGAN: An End-to-End Solution to 3D Caricature Generation From Normal Face Photos",
"doi": null,
"abstractUrl": "/journal/tg/2023/04/09609545/1yoxJacbZ4I",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09392277",
"articleId": "1sq7H56VfiM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09360506",
"articleId": "1rqAemMCk4E",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1L8lPE0ODrG",
"title": "April",
"year": "2023",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1yoxJacbZ4I",
"doi": "10.1109/TVCG.2021.3126659",
"abstract": "Caricature is a type of artistic style of human faces that attracts considerable attention in the entertainment industry. So far a few 3D caricature generation methods exist and all of them require some caricature information (e.g., a caricature sketch or 2D caricature) as input. This kind of input, however, is difficult to provide by non-professional users. In this paper, we propose an end-to-end deep neural network model that generates high-quality 3D caricatures directly from a normal 2D face photo. The most challenging issue for our system is that the source domain of face photos (characterized by normal 2D faces) is significantly different from the target domain of 3D caricatures (characterized by 3D exaggerated face shapes and textures). To address this challenge, we: (1) build a large dataset of 5,343 3D caricature meshes and use it to establish a PCA model in the 3D caricature shape space; (2) reconstruct a normal full 3D head from the input face photo and use its PCA representation in the 3D caricature shape space to establish correspondences between the input photo and 3D caricature shape; and (3) propose a novel character loss and a novel caricature loss based on previous psychological studies on caricatures. Experiments including a novel two-level user study show that our system can generate high-quality 3D caricatures directly from normal face photos.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Caricature is a type of artistic style of human faces that attracts considerable attention in the entertainment industry. So far a few 3D caricature generation methods exist and all of them require some caricature information (e.g., a caricature sketch or 2D caricature) as input. This kind of input, however, is difficult to provide by non-professional users. In this paper, we propose an end-to-end deep neural network model that generates high-quality 3D caricatures directly from a normal 2D face photo. The most challenging issue for our system is that the source domain of face photos (characterized by normal 2D faces) is significantly different from the target domain of 3D caricatures (characterized by 3D exaggerated face shapes and textures). To address this challenge, we: (1) build a large dataset of 5,343 3D caricature meshes and use it to establish a PCA model in the 3D caricature shape space; (2) reconstruct a normal full 3D head from the input face photo and use its PCA representation in the 3D caricature shape space to establish correspondences between the input photo and 3D caricature shape; and (3) propose a novel character loss and a novel caricature loss based on previous psychological studies on caricatures. Experiments including a novel two-level user study show that our system can generate high-quality 3D caricatures directly from normal face photos.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Caricature is a type of artistic style of human faces that attracts considerable attention in the entertainment industry. So far a few 3D caricature generation methods exist and all of them require some caricature information (e.g., a caricature sketch or 2D caricature) as input. This kind of input, however, is difficult to provide by non-professional users. In this paper, we propose an end-to-end deep neural network model that generates high-quality 3D caricatures directly from a normal 2D face photo. The most challenging issue for our system is that the source domain of face photos (characterized by normal 2D faces) is significantly different from the target domain of 3D caricatures (characterized by 3D exaggerated face shapes and textures). To address this challenge, we: (1) build a large dataset of 5,343 3D caricature meshes and use it to establish a PCA model in the 3D caricature shape space; (2) reconstruct a normal full 3D head from the input face photo and use its PCA representation in the 3D caricature shape space to establish correspondences between the input photo and 3D caricature shape; and (3) propose a novel character loss and a novel caricature loss based on previous psychological studies on caricatures. Experiments including a novel two-level user study show that our system can generate high-quality 3D caricatures directly from normal face photos.",
"title": "3D-CariGAN: An End-to-End Solution to 3D Caricature Generation From Normal Face Photos",
"normalizedTitle": "3D-CariGAN: An End-to-End Solution to 3D Caricature Generation From Normal Face Photos",
"fno": "09609545",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Deep Learning Artificial Intelligence",
"Face Recognition",
"Principal Component Analysis",
"Psychology",
"3 D Exaggerated Face Shapes",
"Caricature Information",
"Caricature Sketch",
"End To End Deep Neural Network Model",
"High Quality 3 D",
"Input Face Photo",
"Normal 2 D Face Photo",
"Normal 2 D Faces",
"Normal Face Photos",
"Novel Caricature Loss",
"Three Dimensional Displays",
"Faces",
"Solid Modeling",
"Shape",
"Principal Component Analysis",
"Image Reconstruction",
"Parametric Statistics",
"Face Reconstruction",
"3 D Caricature",
"PCA Representation",
"Caricature Shape Space"
],
"authors": [
{
"givenName": "Zipeng",
"surname": "Ye",
"fullName": "Zipeng Ye",
"affiliation": "Department of Computer Science and Technology, BNRist, MOE-Key Laboratory of Pervasive Computing, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mengfei",
"surname": "Xia",
"fullName": "Mengfei Xia",
"affiliation": "Department of Computer Science and Technology, BNRist, MOE-Key Laboratory of Pervasive Computing, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yanan",
"surname": "Sun",
"fullName": "Yanan Sun",
"affiliation": "Department of Computer Science and Technology, BNRist, MOE-Key Laboratory of Pervasive Computing, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ran",
"surname": "Yi",
"fullName": "Ran Yi",
"affiliation": "Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Minjing",
"surname": "Yu",
"fullName": "Minjing Yu",
"affiliation": "College of Intelligence and Computing, Tianjin University, Tianjin, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Juyong",
"surname": "Zhang",
"fullName": "Juyong Zhang",
"affiliation": "School of Mathematical Sciences, University of Science and Technology of China, Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yu-Kun",
"surname": "Lai",
"fullName": "Yu-Kun Lai",
"affiliation": "School of Computer Science and Informatics, Cardiff University, Cardiff, U.K",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yong-Jin",
"surname": "Liu",
"fullName": "Yong-Jin Liu",
"affiliation": "Department of Computer Science and Technology, BNRist, MOE-Key Laboratory of Pervasive Computing, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "2203-2210",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pg/2002/1784/0/17840386",
"title": "Example-Based Caricature Generation with Exaggeration",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2002/17840386/12OmNALlckX",
"parentPublication": {
"id": "proceedings/pg/2002/1784/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dim/2001/0984/0/09840385",
"title": "3D Modeling System of Human Face and Full 3D Facial Caricaturing",
"doi": null,
"abstractUrl": "/proceedings-article/3dim/2001/09840385/12OmNAlvI1u",
"parentPublication": {
"id": "proceedings/3dim/2001/0984/0",
"title": "3D Digital Imaging and Modeling, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2008/2570/0/04607591",
"title": "3D caricature generation by manifold learning",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2008/04607591/12OmNzQR1nw",
"parentPublication": {
"id": "proceedings/icme/2008/2570/0",
"title": "2008 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis/2009/3641/0/3641a660",
"title": "Facial Metrical and Caricature-Pattern-Based Learning in Neural Network System for Face Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2009/3641a660/12OmNzX6cvb",
"parentPublication": {
"id": "proceedings/icis/2009/3641/0",
"title": "Computer and Information Science, ACIS International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2014/4677/0/4677a237",
"title": "Example-Based Automatic Caricature Generation",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2014/4677a237/12OmNzcPAE4",
"parentPublication": {
"id": "proceedings/cw/2014/4677/0",
"title": "2014 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000h336",
"title": "Alive Caricature from 2D to 3D",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000h336/17D45W2Wyzi",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2019/9552/0/955200b510",
"title": "A Relation Network Embedded with Prior Features for Few-Shot Caricature Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2019/955200b510/1cdOI1Zhlv2",
"parentPublication": {
"id": "proceedings/icme/2019/9552/0",
"title": "2019 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2019/3293/0/329300k0754",
"title": "WarpGAN: Automatic Caricature Generation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300k0754/1gyrw1AWIz6",
"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/icpr/2021/8808/0/09412569",
"title": "Unsupervised Contrastive Photo-to-Caricature Translation based on Auto-distortion",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412569/1tmjiXD2jba",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900k0231",
"title": "3DCaricShop: A Dataset and A Baseline Method for Single-view 3D Caricature Face Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900k0231/1yeIGVDwIak",
"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": "09677963",
"articleId": "1A4SqmEsrhm",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1L8lQ2WG5P2",
"name": "ttg202304-09609545s1-supp1-3126659.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202304-09609545s1-supp1-3126659.pdf",
"extension": "pdf",
"size": "3.95 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAtstbj",
"title": "Sept.",
"year": "2012",
"issueNum": "09",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxAAT0Q",
"doi": "10.1109/TVCG.2011.158",
"abstract": "The contribution of this paper is two-fold. First, we show how to extend the ESM algorithm to handle motion blur in 3D object tracking. ESM is a powerful algorithm for template matching-based tracking, but it can fail under motion blur. We introduce an image formation model that explicitly consider the possibility of blur, and shows its results in a generalization of the original ESM algorithm. This allows to converge faster, more accurately and more robustly even under large amount of blur. Our second contribution is an efficient method for rendering the virtual objects under the estimated motion blur. It renders two images of the object under 3D perspective, and warps them to create many intermediate images. By fusing these images we obtain a final image for the virtual objects blurred consistently with the captured image. Because warping is much faster than 3D rendering, we can create realistically blurred images at a very low computational cost.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The contribution of this paper is two-fold. First, we show how to extend the ESM algorithm to handle motion blur in 3D object tracking. ESM is a powerful algorithm for template matching-based tracking, but it can fail under motion blur. We introduce an image formation model that explicitly consider the possibility of blur, and shows its results in a generalization of the original ESM algorithm. This allows to converge faster, more accurately and more robustly even under large amount of blur. Our second contribution is an efficient method for rendering the virtual objects under the estimated motion blur. It renders two images of the object under 3D perspective, and warps them to create many intermediate images. By fusing these images we obtain a final image for the virtual objects blurred consistently with the captured image. Because warping is much faster than 3D rendering, we can create realistically blurred images at a very low computational cost.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The contribution of this paper is two-fold. First, we show how to extend the ESM algorithm to handle motion blur in 3D object tracking. ESM is a powerful algorithm for template matching-based tracking, but it can fail under motion blur. We introduce an image formation model that explicitly consider the possibility of blur, and shows its results in a generalization of the original ESM algorithm. This allows to converge faster, more accurately and more robustly even under large amount of blur. Our second contribution is an efficient method for rendering the virtual objects under the estimated motion blur. It renders two images of the object under 3D perspective, and warps them to create many intermediate images. By fusing these images we obtain a final image for the virtual objects blurred consistently with the captured image. Because warping is much faster than 3D rendering, we can create realistically blurred images at a very low computational cost.",
"title": "Handling Motion-Blur in 3D Tracking and Rendering for Augmented Reality",
"normalizedTitle": "Handling Motion-Blur in 3D Tracking and Rendering for Augmented Reality",
"fno": "06025351",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Solid Modelling",
"Augmented Reality",
"Image Matching",
"Image Motion Analysis",
"Image Restoration",
"Object Tracking",
"Rendering Computer Graphics",
"3 D Rendering",
"Motion Blur",
"Augmented Reality",
"ESM Algorithm",
"3 D Object Tracking",
"Template Matching Based Tracking",
"Image Formation Model",
"Virtual Objects",
"Intermediate Images",
"Image Fusion",
"Tracking",
"Rendering Computer Graphics",
"Three Dimensional Displays",
"Cameras",
"Jacobian Matrices",
"Robustness",
"Computational Modeling",
"Efficient Second Order Minimization",
"Augmented Reality",
"Computer Vision",
"Object Tracking",
"Object Detection",
"Motion Blur"
],
"authors": [
{
"givenName": "V.",
"surname": "Lepetit",
"fullName": "V. Lepetit",
"affiliation": "KAIST GSCT UVR Lab., Daejeon, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Youngmin Park",
"fullName": "Youngmin Park",
"affiliation": "Qualcomm Austria Res. Center, Wien, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Woontack Woo",
"fullName": "Woontack Woo",
"affiliation": "CVLab., ISIM, Lausanne, Switzerland",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2012-09-01 00:00:00",
"pubType": "trans",
"pages": "1449-1459",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2013/0015/0/06607493",
"title": "A novel approach for partial blur detection and segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2013/06607493/12OmNAle6Eb",
"parentPublication": {
"id": "proceedings/icme/2013/0015/0",
"title": "2013 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2009/5390/0/05336480",
"title": "ESM-Blur: Handling & rendering blur in 3D tracking and augmentation",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2009/05336480/12OmNBLdKMB",
"parentPublication": {
"id": "proceedings/ismar/2009/5390/0",
"title": "2009 8th IEEE International Symposium on Mixed and Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2008/3493/0/3493a320",
"title": "Image Extrema Analysis and Blur Detection with Identification",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2008/3493a320/12OmNBhHt8d",
"parentPublication": {
"id": "proceedings/sitis/2008/3493/0",
"title": "2008 IEEE International Conference on Signal Image Technology and Internet Based Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2012/1226/0/219P2B18",
"title": "Seeing through the blur",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/219P2B18/12OmNBpVPWe",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aici/2010/4225/1/4225a116",
"title": "Image-blur-based Robust Weed Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/aici/2010/4225a116/12OmNvSbBA3",
"parentPublication": {
"id": "proceedings/aici/2010/4225/1",
"title": "Artificial Intelligence and Computational Intelligence, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mines/2011/4559/0/4559a041",
"title": "Effective Pretreatment in Identification of Motion-Blur Direction",
"doi": null,
"abstractUrl": "/proceedings-article/mines/2011/4559a041/12OmNwCsdP2",
"parentPublication": {
"id": "proceedings/mines/2011/4559/0",
"title": "Multimedia Information Networking and Security, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2000/0813/0/08130022",
"title": "Restoration of Multiple Images with Motion Blur in Different Directions",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2000/08130022/12OmNx5GU0K",
"parentPublication": {
"id": "proceedings/wacv/2000/0813/0",
"title": "Applications of Computer Vision, IEEE Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2015/6964/0/07299159",
"title": "Handling motion blur in multi-frame super-resolution",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2015/07299159/12OmNzAoi1R",
"parentPublication": {
"id": "proceedings/cvpr/2015/6964/0",
"title": "2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccia/2019/2128/0/212800a063",
"title": "Blur Identification of the Degraded Images Based on Convolutional Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/iccia/2019/212800a063/1f8MFqFnpjG",
"parentPublication": {
"id": "proceedings/iccia/2019/2128/0",
"title": "2019 4th International Conference on Computational Intelligence and Applications (ICCIA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900b706",
"title": "Improved Handling of Motion Blur in Online Object Detection",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900b706/1yeMmuCia9q",
"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": "06051431",
"articleId": "13rRUx0gev6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06060947",
"articleId": "13rRUILtJqP",
"__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": "13rRUxASuvf",
"doi": "10.1109/TVCG.2014.2377753",
"abstract": "We propose the computation of a perceptual motion blur in videos. Our technique takes the predicted eye motion into account when watching the video. Compared to traditional motion blur recorded by a video camera our approach results in a perceptual blur that is closer to reality. This postprocess can also be used to simulate different shutter effects or for other artistic purposes. It handles real and artificial video input, is easy to compute and has a low additional cost for rendered content. We illustrate its advantages in a user study using eye tracking.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose the computation of a perceptual motion blur in videos. Our technique takes the predicted eye motion into account when watching the video. Compared to traditional motion blur recorded by a video camera our approach results in a perceptual blur that is closer to reality. This postprocess can also be used to simulate different shutter effects or for other artistic purposes. It handles real and artificial video input, is easy to compute and has a low additional cost for rendered content. We illustrate its advantages in a user study using eye tracking.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose the computation of a perceptual motion blur in videos. Our technique takes the predicted eye motion into account when watching the video. Compared to traditional motion blur recorded by a video camera our approach results in a perceptual blur that is closer to reality. This postprocess can also be used to simulate different shutter effects or for other artistic purposes. It handles real and artificial video input, is easy to compute and has a low additional cost for rendered content. We illustrate its advantages in a user study using eye tracking.",
"title": "Temporal Video Filtering and Exposure Control for Perceptual Motion Blur",
"normalizedTitle": "Temporal Video Filtering and Exposure Control for Perceptual Motion Blur",
"fno": "06977984",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Cameras",
"Retina",
"Motion Pictures",
"Observers",
"Image Edge Detection",
"Target Tracking",
"Sharpening And Blur",
"High Frame Rate",
"Temporal Filtering",
"Perception",
"Sharpening And Blur",
"High Frame Rate",
"Temporal Filtering",
"Perception"
],
"authors": [
{
"givenName": "Michael",
"surname": "Stengel",
"fullName": "Michael Stengel",
"affiliation": "Computer Graphics Lab, TU Braunschweig, Braunschweig, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pablo",
"surname": "Bauszat",
"fullName": "Pablo Bauszat",
"affiliation": "Computer Graphics Lab, TU Braunschweig, Braunschweig, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Martin",
"surname": "Eisemann",
"fullName": "Martin Eisemann",
"affiliation": "Computer Graphics Lab, TU Braunschweig, Braunschweig",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Elmar",
"surname": "Eisemann",
"fullName": "Elmar Eisemann",
"affiliation": "Computer Graphics and Visualization Lab, TU Delft, Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marcus",
"surname": "Magnor",
"fullName": "Marcus Magnor",
"affiliation": "Computer Graphics Lab, TU Braunschweig, Braunschweig, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2015-05-01 00:00:00",
"pubType": "trans",
"pages": "663-671",
"year": "2015",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wacv/2015/6683/0/6683a254",
"title": "A Motion Blur Resilient Fiducial for Quadcopter Imaging",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2015/6683a254/12OmNBJNKYu",
"parentPublication": {
"id": "proceedings/wacv/2015/6683/0",
"title": "2015 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssiai/2014/4053/0/06806028",
"title": "Temporal analysis and perceptual weighting for objective video quality measurement",
"doi": null,
"abstractUrl": "/proceedings-article/ssiai/2014/06806028/12OmNBc1uxr",
"parentPublication": {
"id": "proceedings/ssiai/2014/4053/0",
"title": "2014 IEEE Southwest Symposium on Image Analysis and Interpretation (SSIAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2006/2521/3/252130709",
"title": "Removing Temporal Stationary Blur in Route Panoramas",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2006/252130709/12OmNqI04T9",
"parentPublication": {
"id": "proceedings/icpr/2006/2521/3",
"title": "2006 18th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2010/7491/0/05583881",
"title": "LCD motion blur modeling and simulation",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2010/05583881/12OmNwDSddm",
"parentPublication": {
"id": "proceedings/icme/2010/7491/0",
"title": "2010 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2011/1101/0/06126357",
"title": "Blurred target tracking by Blur-driven Tracker",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2011/06126357/12OmNyr8Yed",
"parentPublication": {
"id": "proceedings/iccv/2011/1101/0",
"title": "2011 IEEE International Conference on Computer Vision (ICCV 2011)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2012/4711/0/4711a438",
"title": "Video Gaze Prediction: Minimizing Perceptual Information Loss",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2012/4711a438/12OmNzkuKJz",
"parentPublication": {
"id": "proceedings/icme/2012/4711/0",
"title": "2012 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2010/06/ttp2010061012",
"title": "Correction of Spatially Varying Image and Video Motion Blur Using a Hybrid Camera",
"doi": null,
"abstractUrl": "/journal/tp/2010/06/ttp2010061012/13rRUx0xPjk",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/09/06025351",
"title": "Handling Motion-Blur in 3D Tracking and Rendering for Augmented Reality",
"doi": null,
"abstractUrl": "/journal/tg/2012/09/06025351/13rRUxAAT0Q",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200e832",
"title": "R-SLAM: Optimizing Eye Tracking from Rolling Shutter Video of the Retina",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200e832/1BmET2U2EPm",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/11/09551756",
"title": "Exposure Trajectory Recovery From Motion Blur",
"doi": null,
"abstractUrl": "/journal/tp/2022/11/09551756/1xgx1M6nvWg",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07006805",
"articleId": "13rRUxYIMV0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07001093",
"articleId": "13rRUx0xPn0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1Hcio5iMQBW",
"title": "Nov.",
"year": "2022",
"issueNum": "11",
"idPrefix": "tp",
"pubType": "journal",
"volume": "44",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xgx1M6nvWg",
"doi": "10.1109/TPAMI.2021.3116135",
"abstract": "Motion blur in dynamic scenes is an important yet challenging research topic. Recently, deep learning methods have achieved impressive performance for dynamic scene deblurring. However, the motion information contained in a blurry image has yet to be fully explored and accurately formulated because: (i) the ground truth of dynamic motion is difficult to obtain; (ii) the temporal ordering is destroyed during the exposure; and (iii) the motion estimation from a blurry image is highly ill-posed. By revisiting the principle of camera exposure, motion blur can be described by the relative motions of sharp content with respect to each exposed position. In this paper, we define exposure trajectories, which represent the motion information contained in a blurry image and explain the causes of motion blur. A novel motion offset estimation framework is proposed to model pixel-wise displacements of the latent sharp image at multiple timepoints. Under mild constraints, our method can recover dense, (non-)linear exposure trajectories, which significantly reduce temporal disorder and ill-posed problems. Finally, experiments demonstrate that the recovered exposure trajectories not only capture accurate and interpretable motion information from a blurry image, but also benefit motion-aware image deblurring and warping-based video extraction tasks. Codes are available on <uri>https://github.com/yjzhang96/Motion-ETR</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Motion blur in dynamic scenes is an important yet challenging research topic. Recently, deep learning methods have achieved impressive performance for dynamic scene deblurring. However, the motion information contained in a blurry image has yet to be fully explored and accurately formulated because: (i) the ground truth of dynamic motion is difficult to obtain; (ii) the temporal ordering is destroyed during the exposure; and (iii) the motion estimation from a blurry image is highly ill-posed. By revisiting the principle of camera exposure, motion blur can be described by the relative motions of sharp content with respect to each exposed position. In this paper, we define exposure trajectories, which represent the motion information contained in a blurry image and explain the causes of motion blur. A novel motion offset estimation framework is proposed to model pixel-wise displacements of the latent sharp image at multiple timepoints. Under mild constraints, our method can recover dense, (non-)linear exposure trajectories, which significantly reduce temporal disorder and ill-posed problems. Finally, experiments demonstrate that the recovered exposure trajectories not only capture accurate and interpretable motion information from a blurry image, but also benefit motion-aware image deblurring and warping-based video extraction tasks. Codes are available on <uri>https://github.com/yjzhang96/Motion-ETR</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Motion blur in dynamic scenes is an important yet challenging research topic. Recently, deep learning methods have achieved impressive performance for dynamic scene deblurring. However, the motion information contained in a blurry image has yet to be fully explored and accurately formulated because: (i) the ground truth of dynamic motion is difficult to obtain; (ii) the temporal ordering is destroyed during the exposure; and (iii) the motion estimation from a blurry image is highly ill-posed. By revisiting the principle of camera exposure, motion blur can be described by the relative motions of sharp content with respect to each exposed position. In this paper, we define exposure trajectories, which represent the motion information contained in a blurry image and explain the causes of motion blur. A novel motion offset estimation framework is proposed to model pixel-wise displacements of the latent sharp image at multiple timepoints. Under mild constraints, our method can recover dense, (non-)linear exposure trajectories, which significantly reduce temporal disorder and ill-posed problems. Finally, experiments demonstrate that the recovered exposure trajectories not only capture accurate and interpretable motion information from a blurry image, but also benefit motion-aware image deblurring and warping-based video extraction tasks. Codes are available on https://github.com/yjzhang96/Motion-ETR.",
"title": "Exposure Trajectory Recovery From Motion Blur",
"normalizedTitle": "Exposure Trajectory Recovery From Motion Blur",
"fno": "09551756",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Cameras",
"Image Motion Analysis",
"Image Restoration",
"Image Segmentation",
"Learning Artificial Intelligence",
"Motion Estimation",
"Video Signal Processing",
"Motion Blur",
"Linear Exposure Trajectories",
"Recovered Exposure Trajectories",
"Accurate Motion Information",
"Interpretable Motion Information",
"Blurry Image",
"Motion Aware Image Deblurring",
"Exposure Trajectory Recovery",
"Dynamic Scenes",
"Dynamic Scene Deblurring",
"Dynamic Motion",
"Motion Estimation",
"Relative Motions",
"Trajectory",
"Dynamics",
"Estimation",
"Cameras",
"Kernel",
"Task Analysis",
"Image Restoration",
"Motion Blur",
"Exposure Trajectory Recovery",
"Motion Aware Image Deblurring",
"Video Extraction From A Single Blurry Image"
],
"authors": [
{
"givenName": "Youjian",
"surname": "Zhang",
"fullName": "Youjian Zhang",
"affiliation": "School of Computer Science, Faculty of Engineering, University of Sydney, Darlington, NSW, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chaoyue",
"surname": "Wang",
"fullName": "Chaoyue Wang",
"affiliation": "School of Computer Science, Faculty of Engineering, University of Sydney, Darlington, NSW, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stephen J.",
"surname": "Maybank",
"fullName": "Stephen J. Maybank",
"affiliation": "Department of Computer Science and Information Systems, Birkbeck College, London, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dacheng",
"surname": "Tao",
"fullName": "Dacheng Tao",
"affiliation": "School of Computer Science, Faculty of Engineering, University of Sydney, Darlington, NSW, Australia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2022-11-01 00:00:00",
"pubType": "trans",
"pages": "7490-7504",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccp/2010/7023/0/05585100",
"title": "Motion blur removal with orthogonal parabolic exposures",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2010/05585100/12OmNBlXs5g",
"parentPublication": {
"id": "proceedings/iccp/2010/7023/0",
"title": "2010 IEEE International Conference on Computational Photography (ICCP 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851b846",
"title": "Parametric Object Motion from Blur",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851b846/12OmNrMHOlr",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457d806",
"title": "From Motion Blur to Motion Flow: A Deep Learning Solution for Removing Heterogeneous Motion Blur",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457d806/12OmNxTVU29",
"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/2017/0457/0/0457a257",
"title": "Deep Multi-scale Convolutional Neural Network for Dynamic Scene Deblurring",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457a257/12OmNyFCw2O",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2013/5053/0/06475012",
"title": "Accurate motion deblurring using camera motion tracking and scene depth",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2013/06475012/12OmNzQR1pa",
"parentPublication": {
"id": "proceedings/wacv/2013/5053/0",
"title": "Applications of Computer Vision, IEEE Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2007/1630/0/04408904",
"title": "Removing Non-Uniform Motion Blur from Images",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2007/04408904/12OmNzkMlR8",
"parentPublication": {
"id": "proceedings/iccv/2007/1630/0",
"title": "2007 11th IEEE International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/07/08587199",
"title": "Controllable Motion-Blur Effects in Still Images",
"doi": null,
"abstractUrl": "/journal/tg/2020/07/08587199/17D45W9KVGn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2019/1975/0/197500c116",
"title": "Single Image Deblurring and Camera Motion Estimation With Depth Map",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2019/197500c116/18j8IDePOfK",
"parentPublication": {
"id": "proceedings/wacv/2019/1975/0",
"title": "2019 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200f530",
"title": "MBA-VO: Motion Blur Aware Visual Odometry",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200f530/1BmJbIoIPug",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300f571",
"title": "Human-Aware Motion Deblurring",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300f571/1hQqgfZbeG4",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09508171",
"articleId": "1vOUnMmxFCg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09540298",
"articleId": "1wWCd15P5cI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1HciUK9cPjG",
"name": "ttp202211-09551756s1-supp1-3116135.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp202211-09551756s1-supp1-3116135.mp4",
"extension": "mp4",
"size": "46.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzZ5oam",
"title": "July/August",
"year": "2008",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "14",
"label": "July/August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBJhvo",
"doi": "10.1109/TVCG.2008.11",
"abstract": "This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, while allowing arbitrary modifications between consecutive layouts. The algorithm works online and uses various execution culling methods in order to reduce the layout time and handle large dynamic graphs. Techniques for representing graphs on the GPU allow a speedup by a factor of up to 17 compared to the CPU implementation. The scalability of the algorithm across GPU generations is demonstrated. Applications of the algorithm to the visualization of discussion threads in Internet sites and to the visualization of social networks are provided.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, while allowing arbitrary modifications between consecutive layouts. The algorithm works online and uses various execution culling methods in order to reduce the layout time and handle large dynamic graphs. Techniques for representing graphs on the GPU allow a speedup by a factor of up to 17 compared to the CPU implementation. The scalability of the algorithm across GPU generations is demonstrated. Applications of the algorithm to the visualization of discussion threads in Internet sites and to the visualization of social networks are provided.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, while allowing arbitrary modifications between consecutive layouts. The algorithm works online and uses various execution culling methods in order to reduce the layout time and handle large dynamic graphs. Techniques for representing graphs on the GPU allow a speedup by a factor of up to 17 compared to the CPU implementation. The scalability of the algorithm across GPU generations is demonstrated. Applications of the algorithm to the visualization of discussion threads in Internet sites and to the visualization of social networks are provided.",
"title": "Online Dynamic Graph Drawing",
"normalizedTitle": "Online Dynamic Graph Drawing",
"fno": "ttg2008040727",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Graph Layout",
"GPU"
],
"authors": [
{
"givenName": "Yaniv",
"surname": "Frishman",
"fullName": "Yaniv Frishman",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ayellet",
"surname": "Tal",
"fullName": "Ayellet Tal",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2008-07-01 00:00:00",
"pubType": "trans",
"pages": "727-740",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vl/1998/8712/0/87120032",
"title": "A Graph Rewriting Programming Language for Graph Drawing",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1998/87120032/12OmNB7LvGY",
"parentPublication": {
"id": "proceedings/vl/1998/8712/0",
"title": "Visual Languages, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pact/2011/4566/0/4566a078",
"title": "Efficient Parallel Graph Exploration on Multi-Core CPU and GPU",
"doi": null,
"abstractUrl": "/proceedings-article/pact/2011/4566a078/12OmNrIrPoy",
"parentPublication": {
"id": "proceedings/pact/2011/4566/0",
"title": "2011 International Conference on Parallel Architectures and Compilation Techniques",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2010/7846/0/05571375",
"title": "Drawing Clustered Bipartite Graphs in Multi-circular Style",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2010/05571375/12OmNvEhfYC",
"parentPublication": {
"id": "proceedings/iv/2010/7846/0",
"title": "2010 14th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2018/5555/0/555501a269",
"title": "Spectral Graph Drawing: Building Blocks and Performance Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2018/555501a269/12OmNyYm2rZ",
"parentPublication": {
"id": "proceedings/ipdpsw/2018/5555/0",
"title": "2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2004/8779/0/87790191",
"title": "Dynamic Drawing of Clustered Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2004/87790191/12OmNyugyVo",
"parentPublication": {
"id": "proceedings/ieee-infovis/2004/8779/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2006/2517/0/25170653",
"title": "Graph Drawing Tools for Bioinformatics Research: An Overview",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2006/25170653/12OmNzcPA6E",
"parentPublication": {
"id": "proceedings/cbms/2006/2517/0",
"title": "19th IEEE Symposium on Computer-Based Medical Systems (CBMS'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2015/7568/0/7568a259",
"title": "Fast Graph Drawing Algorithm Revealing Networks Cores",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2015/7568a259/12OmNznCl21",
"parentPublication": {
"id": "proceedings/iv/2015/7568/0",
"title": "2015 19th International Conference on Information Visualisation (iV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1995/08/e0662",
"title": "Parametric Graph Drawing",
"doi": null,
"abstractUrl": "/journal/ts/1995/08/e0662/13rRUNvya2D",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/05/ttg2009050777",
"title": "Uncluttering Graph Layouts Using Anisotropic Diffusion and Mass Transport",
"doi": null,
"abstractUrl": "/journal/tg/2009/05/ttg2009050777/13rRUwInvyr",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/05963661",
"title": "Coherent Time-Varying Graph Drawing with Multifocus+Context Interaction",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/05963661/13rRUxYIMUX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008040725",
"articleId": "13rRUxASuAq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008040741",
"articleId": "13rRUNvgyWh",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.